全文获取类型
收费全文 | 2762篇 |
免费 | 486篇 |
国内免费 | 179篇 |
出版年
2024年 | 7篇 |
2023年 | 12篇 |
2022年 | 24篇 |
2021年 | 44篇 |
2020年 | 34篇 |
2019年 | 70篇 |
2018年 | 56篇 |
2017年 | 108篇 |
2016年 | 113篇 |
2015年 | 76篇 |
2014年 | 224篇 |
2013年 | 283篇 |
2012年 | 174篇 |
2011年 | 237篇 |
2010年 | 190篇 |
2009年 | 223篇 |
2008年 | 163篇 |
2007年 | 208篇 |
2006年 | 168篇 |
2005年 | 162篇 |
2004年 | 158篇 |
2003年 | 116篇 |
2002年 | 87篇 |
2001年 | 91篇 |
2000年 | 57篇 |
1999年 | 56篇 |
1998年 | 38篇 |
1997年 | 35篇 |
1996年 | 32篇 |
1995年 | 27篇 |
1994年 | 34篇 |
1993年 | 24篇 |
1992年 | 24篇 |
1991年 | 19篇 |
1990年 | 27篇 |
1989年 | 13篇 |
1988年 | 10篇 |
1987年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有3427条查询结果,搜索用时 15 毫秒
891.
在遗传算法中采用自适应的方法来控制变异操作,可以提高算法的全局搜索能力,加快收敛速度,从而可以迅速地求解组合优化问题,并在进一步求解计算机通信网优化问题中得到成功应用. 相似文献
892.
从信息管理系统的模式出发,分析了系统的结构模式,并对由此产生的并发控制问题,应用时间戳法进行了分析处理,用触发器存储过程解决了对数据的随时更新问题。本系统以Sybase作为数据库,设计并实现了药库管理系统。 相似文献
893.
郭齐胜 《装甲兵工程学院学报》2002,16(3):38-42
探讨军事装备学学科研究的新途径一装备作战仿真,讨论了装备作战仿真的含义、特点、体系结构、关键技术和应用方向等。 相似文献
894.
图像中邻域内灰度起伏程度越大 ,各点灰度值占邻域内总灰度值的比率的平方和越大 ,由此提出了一种基于邻域灰度分布的弱小目标检测方法。同时考虑到复杂自然背景 ,特别是背景中含有大量边缘和高频点的情况 ,提出了目标检测的改进方法。最后 ,利用邻域判决法实现运动目标的进一步分离。实验表明该方法能够极大地减少候选目标点数 ,准确有效地检测复杂自然背景中的红外运动弱小目标 ,适合于实时和多目标的检测 相似文献
895.
相位差变化率是最近提出的用于快速无源定位的观测量。该文研究相位差的高精度测量方法 ,提出了一种正交双通道数字式的相位差测量方法。通过对信号频谱的分析 ,计算了测量系统输出的信噪比 ,从而得出了相位差测量的理论精度 ,随后进行仿真分析验证了理论精度。理论分析和仿真实验证明 ,论文提出的方法可以实现高精度的相位差测量 相似文献
896.
Within a reasonable life‐testing time, how to improve the reliability of highly reliable products is one of the great challenges to today's manufacturers. By using a resolution III experiment together with degradation test, Tseng, Hamada, and Chiao (1995) presented an interesting case study of improving the reliability of fluorescent lamps. However, in conducting such an experiment, they did not address the problem of how to choose the optimal settings of variables, such as sample size, inspection frequency, and termination time for each run, which are influential to the correct identification of significant factors and the experimental cost. Assuming that the product's degradation paths satisfy Wiener processes, this paper proposes a systematic approach to the aforementioned problem. First, an intuitively appealing identification rule is proposed. Next, under the constraints of a minimum probability of correct decision and a maximum probability of incorrect decision of the proposed identification rule, the optimum test plan (including the determinations of inspection frequency, sample size, and termination time for each run) can be obtained by minimizing the total experimental cost. An example is provided to illustrate the proposed method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 514–526, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10024 相似文献
897.
An R out of N repairable system consisting of N components and operates if at least R components are functioning. Repairable means that failed components are repaired, and upon repair completion they are as good as new. We derive formulas for the expected up‐time, expected down‐time, and the availability of the system, using Markov renewal processes. We assume that either the repair times of the components are generally distributed and the components' lifetimes are exponential or vice versa. The analysis is done for systems with either cold or warm stand‐by. Numerical examples are given for several life time and repair time distributions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 483–498, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10025 相似文献
898.
Ljiljana Pavlovi 《海军后勤学研究》2002,49(1):1-14
We have asymptotically solved a discrete search game on an array of n ordered cells with two players: infiltrator (hider) and searcher, when the probability of survival approaches 1. The infiltrator wishes to reach the last cell in finite time, and the searcher has to defend that cell. When the players occupy the same cell, the searcher captures the infiltrator with probability 1 ? z. The payoff to the hider is the probability that the hider reaches the last cell without getting captured. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 1–14, 2002; DOI 10.1002/nav.1047 相似文献
899.
In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039 相似文献
900.