全文获取类型
收费全文 | 197篇 |
免费 | 55篇 |
国内免费 | 22篇 |
出版年
2024年 | 2篇 |
2023年 | 1篇 |
2022年 | 4篇 |
2021年 | 5篇 |
2020年 | 1篇 |
2019年 | 2篇 |
2018年 | 4篇 |
2017年 | 11篇 |
2016年 | 23篇 |
2015年 | 11篇 |
2014年 | 21篇 |
2013年 | 19篇 |
2012年 | 20篇 |
2011年 | 20篇 |
2010年 | 10篇 |
2009年 | 10篇 |
2008年 | 12篇 |
2007年 | 13篇 |
2006年 | 13篇 |
2005年 | 13篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2002年 | 3篇 |
2001年 | 1篇 |
2000年 | 7篇 |
1999年 | 5篇 |
1998年 | 10篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 3篇 |
排序方式: 共有274条查询结果,搜索用时 171 毫秒
21.
星载无线数据网络可以解除航天器内错综复杂的线缆网的束缚,是航天器轻小型化的重要技术储备。旨在替代航天器内现有的点对点三线制的低电压差分信号线缆,提出了一种基于脉冲超宽带(IRUWB)技术的星载高速无线数据网络的设计方案,并重点介绍了高速无线网络协议的设计和实现。网络协议设计参考了美国军用数据总线标准MIL-STD-1553B协议,采用时分制指令响应机制,按物理层、链路层、网络层和应用层进行了详细说明,以适应星载高速率无线数据传输的要求,具有灵活性高、可靠性高、扩展性高的特点。网络协议的IP核经过地面演示系统进行验证,实验测得应用层数据传输的误码率小于10-9。 相似文献
22.
Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n3) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n3) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
23.
24.
作战系统服务能力是衡量其作战效能的重要指标,结合现代作战系统的特点,运用排队论原理,建立了一种地面防空武器系统效能评估模型,确定了武器系统作为随机服务系统的主要性能指标,包括目标突防概率、目标杀伤概率、占用射击通道的平均数、射击通道占用概率和武器系统效率等。示例计算分析显示,该模型与外部条件和地面防空武器系统的综合特性密切相关,对辅助指挥员决策有一定的参考价值。 相似文献
25.
针对水面舰艇对海作战网络的特点,基于复杂网络"反社区"性质,将对海作战网络描述成"反社区"有向赋权图。结合传统可靠性分析方法,提出了一种新的可靠性评价指标,进一步扩展了传统可靠性指标的4个特性,并通过实例仿真,证明了该指标的有效性。该方法将传统可靠性理论与复杂网络理论有效地结合起来,将进一步扩大复杂网络的适用范围。 相似文献
26.
27.
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 相似文献
28.
29.
30.
Kurt M. Bretthauer 《海军后勤学研究》2000,47(1):1-17
In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000 相似文献