全文获取类型
收费全文 | 3529篇 |
免费 | 387篇 |
国内免费 | 234篇 |
出版年
2024年 | 2篇 |
2023年 | 13篇 |
2022年 | 21篇 |
2021年 | 53篇 |
2020年 | 61篇 |
2019年 | 38篇 |
2018年 | 58篇 |
2017年 | 121篇 |
2016年 | 109篇 |
2015年 | 81篇 |
2014年 | 302篇 |
2013年 | 231篇 |
2012年 | 196篇 |
2011年 | 355篇 |
2010年 | 273篇 |
2009年 | 321篇 |
2008年 | 278篇 |
2007年 | 270篇 |
2006年 | 199篇 |
2005年 | 205篇 |
2004年 | 194篇 |
2003年 | 152篇 |
2002年 | 111篇 |
2001年 | 111篇 |
2000年 | 67篇 |
1999年 | 56篇 |
1998年 | 48篇 |
1997年 | 24篇 |
1996年 | 34篇 |
1995年 | 33篇 |
1994年 | 32篇 |
1993年 | 26篇 |
1992年 | 30篇 |
1991年 | 19篇 |
1990年 | 13篇 |
1989年 | 9篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有4150条查询结果,搜索用时 31 毫秒
941.
942.
介绍了数据仓库和数据挖掘的概念、数据挖掘的过程和方法,简单分析了现代战争中信息处理的特点和需求,阐述了数据挖掘在军事指挥控制系统中的应用必要性,提出了军事应用中数据挖掘系统的层次体系结构,并针对该层次体系结构进一步提出了指挥控制系统中数据挖掘技术的应用模型. 相似文献
943.
针对协同性联合作战向一体化联合作战转变对作战指挥产生的影响,在正确定位指挥信息流通体系的基础上,从一体化联合作战的本质特征及对指挥信息流通体系的影响出发,设计了基本作战单元指挥信息输入、输出模型,并通过将作战体系区分为四类模块,得出了指挥信息流通体系的逻辑结构. 相似文献
944.
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 相似文献
945.
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 相似文献
946.
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 相似文献
947.
针对近地卫星数传时的信道时变性和严重的Ka频段雨衰现象,采用自适应编码调制(Adaptive Coding and Modulation, ACM)技术能够充分利用链路资源,相对于传统的固定编码调制方式,进一步提高链路的数据吞吐量。提出近地卫星Ka频段数传链路ACM模式设计方法,在降雨环境下建立Ka频段数传链路模型,根据链路预算的信道状况确定ACM选用模式;采用基于导频符号的最大似然信噪比估计算法结合移动平均的平滑方法实现信道估计,有效地减小了估计值的波动。仿真结果表明,无论晴天还是雨天,采用提出的卫星数传链路ACM模式设计方法,能够在保证系统可靠性的同时获取较高的数据吞吐量。 相似文献
948.
In financial engineering, sensitivities of derivative prices (also known as the Greeks) are important quantities in risk management, and stochastic gradient estimation methods are used to estimate them given the market parameters. In practice, the surface (function) of the Greeks with respect to the underlying parameters is much more desired, because it can be used in real‐time risk management. In this paper, we consider derivatives with multiple underlying assets, and propose three stochastic kriging‐based methods, the element‐by‐element, the importance mapping, and the Cholesky decomposition, to fit the surface of the gamma matrix that can fulfill the time constraint and the precision requirement in real‐time risk management. Numerical experiments are provided to illustrate the effectiveness of the proposed methods. 相似文献
949.
为了增强复杂电磁环境中航空集群战术网络的抗干扰能力,提出把同时收发认知抗干扰电台应用于航空集群网络节点,且每个节点采用改进能量检测方法进行干扰感知。在此基础上,分别研究了存在单/多个干扰源时的网络节点干扰感知性能,推导出干扰感知的虚警概率和检测概率的闭式表达。仿真结果表明,通过调节改进能量检测器的参数p,可以提高航空集群机载战术网络的干扰感知能力。 相似文献
950.