全文获取类型
收费全文 | 557篇 |
免费 | 191篇 |
国内免费 | 11篇 |
出版年
2023年 | 3篇 |
2022年 | 9篇 |
2021年 | 29篇 |
2020年 | 6篇 |
2019年 | 7篇 |
2018年 | 6篇 |
2017年 | 5篇 |
2016年 | 6篇 |
2015年 | 22篇 |
2014年 | 17篇 |
2013年 | 33篇 |
2012年 | 22篇 |
2011年 | 17篇 |
2010年 | 24篇 |
2009年 | 31篇 |
2008年 | 24篇 |
2007年 | 38篇 |
2006年 | 16篇 |
2005年 | 30篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2002年 | 5篇 |
2001年 | 11篇 |
2000年 | 22篇 |
1999年 | 47篇 |
1998年 | 50篇 |
1997年 | 39篇 |
1996年 | 40篇 |
1995年 | 30篇 |
1994年 | 32篇 |
1993年 | 26篇 |
1992年 | 17篇 |
1991年 | 24篇 |
1990年 | 21篇 |
1989年 | 11篇 |
1988年 | 4篇 |
1987年 | 6篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1977年 | 1篇 |
排序方式: 共有759条查询结果,搜索用时 93 毫秒
101.
日本06式枪榴弹采用新型材料,大幅降低了弹的质量和体积,提高了杀伤效能;采取分离一飞行方式,大大减小了后坐能量,增大了射程;运用弹头捕阱系统,减少了烟尘、碎屑等污染物,保证枪榴弹实弹发射时的安全。其设计思想和战术性能在步兵轻武器领域达到世界领先水平。 相似文献
102.
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
103.
基于FLAMES和HLA的联合作战仿真研究 总被引:1,自引:0,他引:1
主要研究基于FLAMES和HLA解决联合作战分布式仿真问题,首先介绍了基于FLAMES进行联合作战仿真开发的优点,然后剖析了基于FLAMES和HLA进行联合作战中的仿真实体之间的信息交互的机制,最后以简单的空地对抗仿真实例,探讨了基于FLAMES和HLA的开发过程,验证了基于FLAMES和HLA开发的联合作战分布式仿真的实用性.应用该仿真平台进行联合作战仿真不仅较大地减少了仿真开发的工作量,提高仿真系统开发的速度,而且能够充分表现出联合作战中多实体交互的特性. 相似文献
104.
105.
在武器装备采办中对竞争与单一来源的选择应分析竞争的可行性与合意性。引入竞争必须要满足一些基本的必要条件,只有这样才会使竞争具有可行性。引入竞争还要分析竞争的合意性,即竞争是否值得,而这种合意与否的判断是建立在竞争的成本一收益分析基础之上的。只有同时满足“竞争可行”与“竞争合意”两个条件,武器装备采办才适宜引入竞争,否则应保持单一来源。 相似文献
106.
107.
针对指挥决策仿真实际运用过程中出现的真实性、可信性等方面的问题,引入了行为可变性.介绍了行为可变性的定义、内容;建立了行为可变性对指挥决策仿真的影响模型;并通过实例对行为可变性在指挥决策中的影响进行仿真.结果表明在指挥决策仿真中引入行为可变性可以增强仿真的真实性与可信性,在一定程度上提高了仿真结果的精度与实用性. 相似文献
108.
In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003. 相似文献
109.
In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
110.
都市圈石漠化区域采石场的生态恢复方法与措施探讨 总被引:1,自引:0,他引:1
都市圈石漠化区域采石场往往由于过度开发且未采取有效的恢复措施,致使生态环境破坏严重,严重影响了都市圈的生态环境和经济发展.在分析都市圈石漠化区域采石场生态恢复特点的基础上,论述了其生态恢复的基本方法及工程技术措施,指出都市圈石漠化区域采石场生态恢复应依据都市圈发展总体规划和景观生态学、景观建筑学及美学原理,采用开发性治理方法,综合运用多种工程技术措施恢复植被、整治水土流失并进行景观再造,从而满足都市圈对于景观的要求,提高土地利用价值,促进都市圈社会经济发展和城市生态环境建设. 相似文献