全文获取类型
收费全文 | 677篇 |
免费 | 111篇 |
国内免费 | 128篇 |
出版年
2024年 | 2篇 |
2023年 | 4篇 |
2022年 | 5篇 |
2021年 | 6篇 |
2020年 | 12篇 |
2019年 | 7篇 |
2018年 | 7篇 |
2017年 | 36篇 |
2016年 | 47篇 |
2015年 | 23篇 |
2014年 | 32篇 |
2013年 | 38篇 |
2012年 | 60篇 |
2011年 | 52篇 |
2010年 | 40篇 |
2009年 | 75篇 |
2008年 | 48篇 |
2007年 | 57篇 |
2006年 | 70篇 |
2005年 | 66篇 |
2004年 | 51篇 |
2003年 | 32篇 |
2002年 | 20篇 |
2001年 | 21篇 |
2000年 | 18篇 |
1999年 | 15篇 |
1998年 | 15篇 |
1997年 | 12篇 |
1996年 | 9篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 4篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1988年 | 1篇 |
排序方式: 共有916条查询结果,搜索用时 15 毫秒
31.
32.
33.
34.
35.
36.
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 相似文献
37.
38.
舰船主动力装置系统可靠性的模糊分配 总被引:3,自引:1,他引:2
利用模糊数学理论中的综合评判方法 ,综合考虑多方面的模糊因素 ,对舰船主动力装置系统进行可靠性分配 .这种方法概念清楚、思路清晰 ,为舰船主动力装置初步设计阶段系统可靠性分配的较好方法 相似文献
39.
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 相似文献
40.
为了使高超声速飞行器在再入过程中完成姿态控制,在反步法的基础上将模糊自适应和终端滑模控制相结合设计控制器。对于姿态角动态,使用反步法和模糊自适应设计虚拟控制律;而对于角速率动态,利用终端滑模方法设计控制器,能够有效提高系统鲁棒性。稳定性分析说明所提方法可以保证系统状态的一致渐进有界性。 相似文献