首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   723篇
  免费   276篇
  国内免费   72篇
  1071篇
  2023年   8篇
  2022年   8篇
  2021年   22篇
  2020年   23篇
  2019年   17篇
  2018年   14篇
  2017年   33篇
  2016年   50篇
  2015年   28篇
  2014年   51篇
  2013年   62篇
  2012年   58篇
  2011年   60篇
  2010年   29篇
  2009年   64篇
  2008年   47篇
  2007年   50篇
  2006年   64篇
  2005年   57篇
  2004年   49篇
  2003年   43篇
  2002年   37篇
  2001年   34篇
  2000年   27篇
  1999年   21篇
  1998年   24篇
  1997年   12篇
  1996年   17篇
  1995年   10篇
  1994年   15篇
  1993年   5篇
  1992年   18篇
  1991年   4篇
  1990年   6篇
  1989年   3篇
  1988年   1篇
排序方式: 共有1071条查询结果,搜索用时 15 毫秒
11.
针对当前军事计量管理信息系统数据类型复杂、可扩展性差和智能化程度低等问题,提出了一种基于大数据的智能化计量管理信息系统。在给出系统总体架构的基础上,介绍了系统实现的关键技术和计量大数据应用价值等内容,该系统的开发和应用,可实现军事计量业务辅助决策、测试设备健康状况分析及质量预测,对推动军事计量技术的提升与发展具有重要意义。  相似文献   
12.
The client‐contractor bargaining problem addressed here is in the context of a multi‐mode resource constrained project scheduling problem with discounted cash flows, which is formulated as a progress payments model. In this model, the contractor receives payments from the client at predetermined regular time intervals. The last payment is paid at the first predetermined payment point right after project completion. The second payment model considered in this paper is the one with payments at activity completions. The project is represented on an Activity‐on‐Node (AON) project network. Activity durations are assumed to be deterministic. The project duration is bounded from above by a deadline imposed by the client, which constitutes a hard constraint. The bargaining objective is to maximize the bargaining objective function comprised of the objectives of both the client and the contractor. The bargaining objective function is expected to reflect the two‐party nature of the problem environment and seeks a compromise between the client and the contractor. The bargaining power concept is introduced into the problem by the bargaining power weights used in the bargaining objective function. Simulated annealing algorithm and genetic algorithm approaches are proposed as solution procedures. The proposed solution methods are tested with respect to solution quality and solution times. Sensitivity analyses are conducted among different parameters used in the model, namely the profit margin, the discount rate, and the bargaining power weights. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009  相似文献   
13.
在现代战争中组网雷达由于充分利用了各单部雷达的资源和数据融合技术的优势,使得在探测、定位、跟踪、识别、威胁判断等方面的雷达网整体性能得以大幅度改善,从而使整体作战能力得到极大提高,使其在现代战争尤其是争夺制电磁权方面扮演了越来越重要的角色.介绍了组网雷达的概念并对其所具有的优越作战能力进行了初步探讨和分析,然后阐述了数据融合技术在组网雷达作战效能发挥中的应用,最后从理论研究的角度详细分析了秩K融合规则、贝叶斯推理法、最大似然法等数据融合算法在组网雷达融合发现概率模型的建立及对敌方空袭目标战术意图识别方面的具体应用.  相似文献   
14.
数据链系统效能评估框架研究   总被引:1,自引:0,他引:1  
研究了数据链系统效能评估相关概念及其对作战的影响机制,给出了数据链系统效能评价指标体系以及不同层次指标的计算、聚合方法。在此基础上形成数据链系统的效能评估框架,通过该框架可以指导数据链系统的效能评估,为数据链装备的发展及应用提供科学依据。  相似文献   
15.
在目标识别中D-S证据理论应用较为广泛,该理论要求各传感器的重要程度相同,与作战使用相矛盾.就此提出了基于加权D-S证据理论的时空域目标识别方法,突出了不同传感器在目标识别中的地位和作用,使目标识别结果更接近作战实际.  相似文献   
16.
以模糊数学和决策理论为基础,通过建立成像数据模糊指数函数及平方误差 模糊指数函数,提出了一种称为模糊多目标优化的新的算法模型,对成像数据的噪声进行抑 制实现数据优化。实验结果表明,所提出的模糊多目标优化算法模型有较强的抑制噪声能 力,理论和实验有较好的一致性。  相似文献   
17.
We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   
18.
In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
19.
We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
20.
基于HLA的地空导弹指控模型仿真   总被引:3,自引:0,他引:3  
基于HLA标准开发仿真系统已成为分布式仿真系统实施的一个热点。对基于HLA标准的地空导弹指控模型仿真进行了探讨,并分析了给出的HLA模型。此种方法可有效地提高系统的开放性、重用性和可扩展性,为地空导弹武器系统仿真提供了新手段,对于其它武器系统的建模与仿真也具有参考价值。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号