首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   796篇
  免费   304篇
  国内免费   75篇
  2024年   1篇
  2023年   9篇
  2022年   8篇
  2021年   23篇
  2020年   25篇
  2019年   19篇
  2018年   15篇
  2017年   36篇
  2016年   54篇
  2015年   31篇
  2014年   57篇
  2013年   66篇
  2012年   64篇
  2011年   67篇
  2010年   34篇
  2009年   72篇
  2008年   49篇
  2007年   53篇
  2006年   74篇
  2005年   62篇
  2004年   56篇
  2003年   46篇
  2002年   37篇
  2001年   35篇
  2000年   33篇
  1999年   22篇
  1998年   27篇
  1997年   13篇
  1996年   17篇
  1995年   11篇
  1994年   16篇
  1993年   5篇
  1992年   18篇
  1991年   6篇
  1990年   9篇
  1989年   3篇
  1988年   2篇
排序方式: 共有1175条查询结果,搜索用时 15 毫秒
131.
基于数据站场的系统效能评估决策支持方法   总被引:1,自引:0,他引:1       下载免费PDF全文
随着信息技术的发展,系统信息量的提升给军事系统效能评估带来了新的问题。针对系统效能分析数据非线性、高维数、强耦合的特点,提出了一种基于数据站场技术的效能评估决策支持方法。通过数据恢复、约减、求精与重构操作,对评估数据进行了处理,并搭建了数据站场立方体,降低了数据间的依赖性,满足了不同层面系统分析的需求。以面向任务的网络化火控系统的为例,进行了系统效能评估、时效性评估和指标分析,从三个层次验证了方法的有效性与可行性。将数据挖掘技术应用到仿真系统效能评估决策中,获得了更广泛的应用。  相似文献   
132.
机动发射条件下助推滑翔导弹射击诸元快速解算   总被引:1,自引:0,他引:1       下载免费PDF全文
针对机动发射条件下助推滑翔导弹对全程弹道快速生成的迫切需求,在弹道设计中选取7个关键性控制量参数作为全程弹道射击诸元,并提出与之相对应的诸元解算算法。将全程弹道分为助推段、初始下降段、滑翔段和俯冲攻击段,在统一化运动模型描述的基础上,运用参数化迭代的思路,依次对不同飞行阶段诸元进行了快速求解,满足多种复杂约束条件。在全程诸元迭代解算模式的基础上,提出助推段沿用中心弹道诸元,仅对其他射击诸元进行重计算的部分诸元迭代解算模式。仿真结果表明:采用所提助推滑翔导弹射击诸元快速解算方法,可在大范围机动条件下对远距离地面固定目标进行快速精确打击。  相似文献   
133.
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  相似文献   
134.
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.  相似文献   
135.
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  相似文献   
136.
渐开线球齿轮齿廓曲面方程的推导   总被引:2,自引:0,他引:2       下载免费PDF全文
介绍了一种新发明的球齿轮机构,建立了新型球齿轮齿廓曲面的参数方程。推导了渐开线齿廓曲线的通用表达式,对其进行旋转变换得到了球齿轮机构中齿轮的环形齿面方程。利用双自由度啮合理论,进一步推导出新型球齿轮的啮合方程,最后推导出渐开线球齿轮共轭齿廓曲面方程。理论结果证明了渐开线环面齿廓的共轭齿廓曲面仍然是渐开线环形曲面。  相似文献   
137.
为了满足多智能体应急反应仿真的需求,首先对构建多智能体应急反应仿真模拟框架的复杂性进行了分析,在此基础上提出并设计了组件式仿真模拟框架.采用本体(Ontology)建模、语义网模型及产生式规则推理等理论方法构建了仿真模拟框架的场景建模模块、人员Agent建模模块等组件.最后对依照上述研究内容所开发的原型系统进行了测试,对测试结果进行了分析,结果表明该框架能够有效满足多智能体应急反应仿真的建模需求.  相似文献   
138.
The ability to cope with uncertainty in dynamic scheduling environments is becoming an increasingly important issue. In such environments, any disruption in the production schedule will translate into a disturbance of the plans for several external activities as well. Hence, from a practical point of view, deviations between the planned and realized schedules are to be avoided as much as possible. The term stability refers to this concern. We propose a proactive approach to generate efficient and stable schedules for a job shop subject to processing time variability and random machine breakdowns. In our approach, efficiency is measured by the makespan, and the stability measure is the sum of the variances of the realized completion times. Because the calculation of the original measure is mathematically intractable, we develop a surrogate stability measure. The version of the problem with the surrogate stability measure is proven to be NP‐hard, even without machine breakdowns; a branch‐and‐bound algorithm is developed for this problem variant. A tabu search algorithm is proposed to handle larger instances of the problem with machine breakdowns. The results of extensive computational experiments indicate that the proposed algorithms are quite promising in performance. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
139.
针对履带车辆静动液辅助制动系统液力辅助制动和液力液压联合辅助制动工况,建立对应工况下的数学模型进行仿真研究,并根据相似原理进行静动液辅助制动系统实验.仿真和实验结果表明,所建立的数学模型能够准确反映系统的实际制动性能,且该辅助制动系统能够为车辆提供可靠的制动.  相似文献   
140.
本文针对RAM目标的特点,在敌方射面坐标系建立了目标运动模型,并利用此弹道微分方程建立目标状态方程和量测方程,在得到RAM目标的火控滤波数据后,利用弹道质点运动方程预测求取飞行时间后的目标未来点,从而提高了火控系统对RAM目标的解算精度。通过仿真计算,验证了此处理方法的有效性。该论文的主要内容是从工程实践中的总结,有一定的创新性。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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