全文获取类型
收费全文 | 2344篇 |
免费 | 341篇 |
国内免费 | 168篇 |
出版年
2024年 | 2篇 |
2023年 | 9篇 |
2022年 | 20篇 |
2021年 | 52篇 |
2020年 | 55篇 |
2019年 | 43篇 |
2018年 | 78篇 |
2017年 | 117篇 |
2016年 | 108篇 |
2015年 | 78篇 |
2014年 | 191篇 |
2013年 | 230篇 |
2012年 | 169篇 |
2011年 | 198篇 |
2010年 | 146篇 |
2009年 | 182篇 |
2008年 | 135篇 |
2007年 | 147篇 |
2006年 | 165篇 |
2005年 | 155篇 |
2004年 | 127篇 |
2003年 | 81篇 |
2002年 | 70篇 |
2001年 | 71篇 |
2000年 | 44篇 |
1999年 | 34篇 |
1998年 | 32篇 |
1997年 | 16篇 |
1996年 | 18篇 |
1995年 | 20篇 |
1994年 | 18篇 |
1993年 | 7篇 |
1992年 | 12篇 |
1991年 | 8篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有2853条查询结果,搜索用时 156 毫秒
921.
本文就四川泸州的一次大型文化商贸活动 ,分析了大型商贸活动的特点及火灾危险性 ,并提出相应的消防安全对策。 相似文献
922.
为了提高作战仿真效果的可信度,提出了一种基于单元体的解决思路,并通过弹头终点弹道特性、装备几何特征、弹头与目标的关系分析,建立了陆军作战仿真的弹目交会模型。试验测试结果表明:该模型能够仿真作战过程中的弹头命中点坐标,满足作战仿真系统的准确性、实时性要求。 相似文献
923.
924.
925.
926.
介绍了数据仓库和数据挖掘的概念、数据挖掘的过程和方法,简单分析了现代战争中信息处理的特点和需求,阐述了数据挖掘在军事指挥控制系统中的应用必要性,提出了军事应用中数据挖掘系统的层次体系结构,并针对该层次体系结构进一步提出了指挥控制系统中数据挖掘技术的应用模型. 相似文献
927.
针对协同性联合作战向一体化联合作战转变对作战指挥产生的影响,在正确定位指挥信息流通体系的基础上,从一体化联合作战的本质特征及对指挥信息流通体系的影响出发,设计了基本作战单元指挥信息输入、输出模型,并通过将作战体系区分为四类模块,得出了指挥信息流通体系的逻辑结构. 相似文献
928.
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 相似文献
929.
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 相似文献
930.
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 相似文献