全文获取类型
收费全文 | 325篇 |
免费 | 87篇 |
国内免费 | 67篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 7篇 |
2021年 | 7篇 |
2020年 | 8篇 |
2019年 | 4篇 |
2018年 | 6篇 |
2017年 | 19篇 |
2016年 | 28篇 |
2015年 | 10篇 |
2014年 | 18篇 |
2013年 | 16篇 |
2012年 | 26篇 |
2011年 | 21篇 |
2010年 | 22篇 |
2009年 | 41篇 |
2008年 | 26篇 |
2007年 | 28篇 |
2006年 | 32篇 |
2005年 | 29篇 |
2004年 | 26篇 |
2003年 | 8篇 |
2002年 | 9篇 |
2001年 | 10篇 |
2000年 | 11篇 |
1999年 | 13篇 |
1998年 | 7篇 |
1997年 | 11篇 |
1996年 | 5篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 3篇 |
1992年 | 6篇 |
1991年 | 3篇 |
1990年 | 4篇 |
排序方式: 共有479条查询结果,搜索用时 171 毫秒
21.
22.
23.
24.
Todas information and communication network requires a design that is secure to tampering. Traditional performance measures of reliability and throughput must be supplemented with measures of security. Recognition of an adversary who can inflict damage leads toward a game‐theoretic model. Through such a formulation, guidelines for network designs and improvements are derived. We opt for a design that is most robust to withstand both natural degradation and adversarial attacks. Extensive computational experience with such a model suggests that a Nash‐equilibrium design exists that can withstand the worst possible damage. Most important, the equilibrium is value‐free in that it is stable irrespective of the unit costs associated with reliability vs. capacity improvement and how one wishes to trade between throughput and reliability. This finding helps to pinpoint the most critical components in network design. From a policy standpoint, the model also allows the monetary value of information‐security to be imputed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
25.
基于故障树的导航装备故障诊断专家系统研究 总被引:8,自引:1,他引:7
针对导航装备比较常见的故障诊断方法,提出了基于故障树的通用故障诊断的概念.为使故障诊断专家系统具有通用性,在分析故障树流程图特点的基础上,提出了逻辑关系的数字编码和故障诊断数据库的思想,设计了对导航装备故障诊断专家系统具有通用性的系统软件及数据库. 相似文献
26.
We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
27.
A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017 相似文献
28.
29.
30.
为探索信息化作战中指挥控制关键因素,提出改进作战指挥体制的对策措施,采用系统动力学理论,对协同决策的结构、参与者和信息反馈关系等关键因素进行了分析,在此基础上构建了基于系统动力学的协同决策模型并进行了模拟仿真。结果表明,增加指挥控制机构之间的信息共享可以有效提升协同决策的效率,为建立协同决策指挥控制体制提供了借鉴意义。 相似文献