全文获取类型
收费全文 | 2247篇 |
免费 | 572篇 |
国内免费 | 151篇 |
出版年
2024年 | 3篇 |
2023年 | 10篇 |
2022年 | 29篇 |
2021年 | 47篇 |
2020年 | 63篇 |
2019年 | 44篇 |
2018年 | 58篇 |
2017年 | 135篇 |
2016年 | 113篇 |
2015年 | 89篇 |
2014年 | 190篇 |
2013年 | 205篇 |
2012年 | 184篇 |
2011年 | 210篇 |
2010年 | 157篇 |
2009年 | 200篇 |
2008年 | 144篇 |
2007年 | 159篇 |
2006年 | 154篇 |
2005年 | 133篇 |
2004年 | 122篇 |
2003年 | 88篇 |
2002年 | 81篇 |
2001年 | 72篇 |
2000年 | 45篇 |
1999年 | 40篇 |
1998年 | 41篇 |
1997年 | 18篇 |
1996年 | 24篇 |
1995年 | 29篇 |
1994年 | 24篇 |
1993年 | 9篇 |
1992年 | 18篇 |
1991年 | 7篇 |
1990年 | 9篇 |
1989年 | 9篇 |
1988年 | 5篇 |
1987年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有2970条查询结果,搜索用时 290 毫秒
981.
针对协同性联合作战向一体化联合作战转变对作战指挥产生的影响,在正确定位指挥信息流通体系的基础上,从一体化联合作战的本质特征及对指挥信息流通体系的影响出发,设计了基本作战单元指挥信息输入、输出模型,并通过将作战体系区分为四类模块,得出了指挥信息流通体系的逻辑结构. 相似文献
982.
Consider a simulation experiment consisting of v independent vector replications across k systems, where in any given replication one system is selected as the best performer (i.e., it wins). Each system has an unknown constant probability of winning in any replication and the numbers of wins for the individual systems follow a multinomial distribution. The classical multinomial selection procedure of Bechhofer, Elmaghraby, and Morse (Procedure BEM) prescribes a minimum number of replications, denoted as v*, so that the probability of correctly selecting the true best system (PCS) meets or exceeds a prespecified probability. Assuming that larger is better, Procedure BEM selects as best the system having the largest value of the performance measure in more replications than any other system. We use these same v* replications across k systems to form (v*)k pseudoreplications that contain one observation from each system, and develop Procedure AVC (All Vector Comparisons) to achieve a higher PCS than with Procedure BEM. For specific small-sample cases and via a large-sample approximation we show that the PCS with Procedure AVC exceeds the PCS with Procedure BEM. We also show that with Procedure AVC we achieve a given PCS with a smaller v than the v* required with Procedure BEM. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 459–482, 1998 相似文献
983.
We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job Jj grows by wj with each time unit its start is delayed beyond a given common critical date d. This processing time is pj if Jj starts by d. We show that this problem is NP-hard, give a pseudopolynomial algorithm that runs in time and O(nd) space, and develop a branch-and-bound algorithm that solves instances with up to 100 jobs in a reasonable amount of time. We also introduce the case of bounded deterioration, where the processing time of a job grows no further if the job starts after a common maximum deterioration date D > d. For this case, we give two pseudopolynomial time algorithms: one runs in O(n2d(D − d) time and O(nd(D − d)) space, the other runs in pj)2) time and pj) space. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 511–523, 1998 相似文献
984.
The maximum likelihood estimator (MLE) for a distribution function with increasing failure rate is derived, based on a collection of series system data. Applications can arise in industries where operating environments make available only such system-level data, due to system configuration or type-II censoring. The estimator can be solved using isotonic regression. For the special case in which systems contain one component, the estimator is equivalent to the restricted maximum likelihood estimator of Marshall and Proschan [9]. The MLE is illustrated using emergency diesel generator failure data from the nuclear industry. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 115–123, 1998 相似文献
985.
Attahiru Sule Alfa 《海军后勤学研究》1998,45(1):23-50
We use the matrix-geometric method to study the discrete time MAP/PH/1 priority queue with two types of jobs. Both preemptive and non-preemptive cases are considered. We show that the structure of the R matrix obtained by Miller for the Birth-Death system can be extended to our Quasi-Birth-Death case. For both preemptive and non-preemptive cases the distributions of the number of jobs of each type in the system are obtained and their waiting times are obtained for the non-preemptive. For the preemptive case we obtain the waiting time distribution for the high priority job and the distribution of the lower priority job's wait before it becomes the leading job of its priority class. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 23–50, 1998 相似文献
986.
多时相遥感图像中利用线特征可以感知道路等线形地物的变化。论文提出一种新的基于边缘特征描述的线特征变化检测算法,首先根据边缘的梯度信息得到变化边缘,并对变化边缘进行编组,形成变化边缘的直线支撑区域,然后通过最小二乘拟合方法从直线支撑区域中提取出变化直线。提出的线特征变化检测算法把边缘的相位和幅度信息作为变化检测的判定依据,从而避免了线的匹配与比较工作,降低了变化检测的算法复杂度,具有很强的实用性。将提出的方法用于多时相遥感图像变化检测,实验结果显示该方法的有效性。 相似文献
987.
李霞 《兵团教育学院学报》2003,13(2):82-84
随着新技术在图书馆的应用和电子期刊的发展趋势,图书馆的期刊工作面临着挑战,为了适应新世纪的要求,图书馆期刊工作必须在观念、管理、服务等方面进行创新,使图书馆期刊工作得到进一步的发展。 相似文献
988.
虚拟环境下柔性线缆建模方法 总被引:2,自引:0,他引:2
研究了虚拟环境下柔性线缆建模方法,给出了离散控制点线缆简化模型和计算各离散控制点坐标值的算法。针对柔性线缆在虚拟环境中的碰撞检测问题,具体分析了从物体侧面绕过和从物体上表面经过2种碰撞检测情况,基于深度矢量和体矢量碰撞检测算法,给出了碰撞检测响应算法。 相似文献
989.
改善海空背景下红外弱点目标识别性能的理论方法探讨 总被引:6,自引:2,他引:4
针对舰载红外警戒系统的实际需要,对改善海空背景下红外弱点目标识别性能的方法进行了探讨.在对舰载红外警戒系统中弱点目标识别的技术难点及点目标场景图像模型进行分析的基础上,提出了改善海空背景下红外弱点目标识别性能的3种方法. 相似文献
990.