全文获取类型
收费全文 | 518篇 |
免费 | 208篇 |
国内免费 | 45篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 1篇 |
2021年 | 12篇 |
2020年 | 3篇 |
2019年 | 5篇 |
2018年 | 6篇 |
2017年 | 28篇 |
2016年 | 43篇 |
2015年 | 22篇 |
2014年 | 52篇 |
2013年 | 62篇 |
2012年 | 37篇 |
2011年 | 41篇 |
2010年 | 32篇 |
2009年 | 40篇 |
2008年 | 37篇 |
2007年 | 34篇 |
2006年 | 45篇 |
2005年 | 48篇 |
2004年 | 45篇 |
2003年 | 20篇 |
2002年 | 19篇 |
2001年 | 27篇 |
2000年 | 31篇 |
1999年 | 19篇 |
1998年 | 17篇 |
1997年 | 11篇 |
1996年 | 4篇 |
1995年 | 8篇 |
1994年 | 8篇 |
1993年 | 4篇 |
1992年 | 4篇 |
1991年 | 2篇 |
1990年 | 1篇 |
排序方式: 共有771条查询结果,搜索用时 286 毫秒
71.
Pirja Heiskanen 《海军后勤学研究》2001,48(3):210-225
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001 相似文献
72.
应用虚拟检测技术开发的舰艇机电设备通用测试分析仪 总被引:2,自引:1,他引:1
针对舰艇机电设备复杂 ,需要监测的参数数量大、种类多等实际情况 ,研制了一种通用测试分析仪 .该仪器采用虚拟检测技术 ,功能全面、携带方面、经济可靠 ,具有较高的推广价值和应用前景 . 相似文献
73.
后方油库整体生存概率分析计算 总被引:1,自引:1,他引:0
针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。 相似文献
74.
Fangruo Chen 《海军后勤学研究》2000,47(5):422-439
Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000 相似文献
75.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献
76.
编队构形设计是分布式干涉SAR系统总体设计的关键问题,它必须紧密结合系统性能评价和编队运动规律进行。针对星载分布式干涉SAR的双站、斜视、空间基线等特点,以主星带辅星群分布式InSAR为例,建立干涉测高精度与基线矢量的关系;以直角坐标过渡,建立基线矢量与卫星间轨道根数差的关系,从而建立了测高精度与卫星轨道根数差的关系;以雷达工作的中间时刻达到测高精度最优值为设计准则,得到双星和多星编队设计方法;仿真分析表明根据上述设计方法得到的优化编队构形,其测高性能要优于干涉车轮和干涉钟摆编队。 相似文献
77.
78.
多分辨率建模及其军事应用 总被引:1,自引:0,他引:1
多分辨率建模是分布交互仿真中极其关键的技术,建模目的是根据情况需要动态改变分辨率,提高模型或模拟的灵活性和伸缩性,有效解决模拟复杂性与资源有限性等矛盾.介绍了当前多分辨率建模的主要方法:聚合-解聚法、一体化层次法和视点选择法.每种方法有各自的优缺点.多分辨率建模的难点主要是基础理论、一致性问题和应用研究等问题. 相似文献
79.
消防责任事故罪包括客体、客观要件、主体、主观要件等若干构成要件,其客体为“国家的消防监督制度”,其客观要件是“经消防监督机构通知采取改正措施而拒绝执行”,其主体为特殊主体“直接责任人员”,其主观要件应限于过于轻信的过失。 相似文献
80.
虚拟机应用软件VMware在计算机辅助教学中的应用 总被引:13,自引:0,他引:13
刘恩博 《兵团教育学院学报》2005,15(3):53-54
本文介绍了虚拟机应用软件VMware,并分析了虚拟机VMware软件作为一种新的教学辅助手段在计算机辅助教学中的应用。 相似文献