全文获取类型
收费全文 | 934篇 |
免费 | 371篇 |
国内免费 | 91篇 |
出版年
2024年 | 11篇 |
2023年 | 16篇 |
2022年 | 17篇 |
2021年 | 23篇 |
2020年 | 28篇 |
2019年 | 26篇 |
2018年 | 17篇 |
2017年 | 59篇 |
2016年 | 66篇 |
2015年 | 50篇 |
2014年 | 98篇 |
2013年 | 55篇 |
2012年 | 93篇 |
2011年 | 88篇 |
2010年 | 69篇 |
2009年 | 91篇 |
2008年 | 60篇 |
2007年 | 54篇 |
2006年 | 82篇 |
2005年 | 67篇 |
2004年 | 46篇 |
2003年 | 33篇 |
2002年 | 40篇 |
2001年 | 31篇 |
2000年 | 20篇 |
1999年 | 31篇 |
1998年 | 16篇 |
1997年 | 9篇 |
1996年 | 20篇 |
1995年 | 10篇 |
1994年 | 16篇 |
1993年 | 12篇 |
1992年 | 15篇 |
1991年 | 9篇 |
1990年 | 11篇 |
1989年 | 7篇 |
排序方式: 共有1396条查询结果,搜索用时 15 毫秒
311.
曾芷德 《国防科技大学学报》1999,21(2):37-41
针对特大规模组合电路和全扫描设计电路提出了一种高速测试生成方法,并建成了相应的测试生成系统ATGTA-1。该系统采用有限回溯测试模式产生方法生成测试码,采用n(机器字长)个测试码并行的单故障传播方法模拟验证测试覆盖。测试生成与故障模拟为n对1紧耦合集成方式。该系统运行10个Benchmark电路,取得了低测试长度、高故障覆盖、高效率的良好效果。 相似文献
312.
朱石坚 《海军工程大学学报》1994,(2)
本文将桁架式水塔结构等效成单自由度弹簧质量系统,考虑其在风载(包括定常与随机波动两部分)作用下,以桁架中的最大应力及频率耦合等作为约束条件的优化设计问题,导出了设计变量的最优化设计数学模型。 相似文献
313.
本文提出了一种以第二代电流传输器(CCII)作为基本单元的集成MOS-FET—C多功能连续时间滤波器。它可以实现诸如低通、带通、高通二次传递函数。该电路不采用平衡结构,但MOS管的非线性的消除程度则等同平衡结构。灵敏度也较低。 相似文献
314.
梁庆福 《军械工程学院学报》1994,(2)
本文从合理使用内存的角度,分析了影响大数据量关系型数据库管理系统运行速度的原因,提出了提高运行速度的对策及重组数据的4条原则。 相似文献
315.
毕小平 《装甲兵工程学院学报》1994,(3)
采用数学规化的方法优化汽油机的工作过程,可以在限制发动机热负荷、机械负荷、氧化氮排放和不爆震的条件下,使发动机在运行过程中经济性最好.但是要求得比较精确的优化解,一般要进行大量计算,花费较多机时.本文提出了一种分段、分层、分级的递进优化方法,应用于汽油机工作过程的优化计算中,取得了较好的效果. 相似文献
316.
In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999 相似文献
317.
Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2⌊(n−1)/2⌋ optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2⌊(n−1)/2⌋ sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999 相似文献
318.
In this study we present an integer programming model for determining an optimal inbound consolidation strategy for a purchasing manager who receives items from several suppliers. The model considers multiple suppliers with limited capacity, transportation economies, and quantity discounts. We propose an integrated branch and bound procedure for solving the model. This procedure, applied to a Lagrangean dual at every node of the search tree, combines the subgradient method with a primal heuristic that interact to change the Lagrangean multipliers and tighten the upper and lower bounds. An enhancement to the branch and bound procedure is developed using surrogate constraints, which is found to be beneficial for solving large problems. We report computational results for a variety of problems, with as many as 70,200 variables and 3665 constraints. Computational testing indicates that our procedure is significantly faster than the general purpose integer programming code OSL. A regression analysis is performed to determine the most significant parameters of our model. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 579–598, 1998 相似文献
319.
320.