全文获取类型
收费全文 | 608篇 |
免费 | 251篇 |
国内免费 | 34篇 |
出版年
2023年 | 6篇 |
2022年 | 5篇 |
2021年 | 11篇 |
2020年 | 17篇 |
2019年 | 18篇 |
2018年 | 8篇 |
2017年 | 28篇 |
2016年 | 47篇 |
2015年 | 30篇 |
2014年 | 56篇 |
2013年 | 72篇 |
2012年 | 43篇 |
2011年 | 51篇 |
2010年 | 32篇 |
2009年 | 46篇 |
2008年 | 41篇 |
2007年 | 44篇 |
2006年 | 41篇 |
2005年 | 45篇 |
2004年 | 45篇 |
2003年 | 23篇 |
2002年 | 23篇 |
2001年 | 28篇 |
2000年 | 25篇 |
1999年 | 20篇 |
1998年 | 15篇 |
1997年 | 19篇 |
1996年 | 13篇 |
1995年 | 8篇 |
1994年 | 16篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1989年 | 2篇 |
排序方式: 共有893条查询结果,搜索用时 739 毫秒
71.
为了提高HLA仿真系统在高性能计算平台上的运行性能,针对高性能计算平台的高性能层次式通信环境,提出了一种共享内存/IB/以太网自适应RTI通信机制-SACM机制,该机制能够根据通信双方所在节点的网络拓扑信息,自适应建立延迟最小的通信连接,实现共享内存、IB等高速互连及以太网互连的自适应选择.同时在该通信机制中,针对节点内高速共享内存通信需求,提出了一种面向多盟员互连的共享内存通信算法,有效提高了节点内盟员通信效率.对象属性值更新延迟测试结果表明,该通信机制可以有效提高RTI在高性能计算平台的通信性能. 相似文献
72.
基于Markov模型对航天测控通信系统进行可靠性分析的过程中,若系统中测控通信设备数量较多,模型中的状态空间随设备数量呈指数增长,将会导致数值计算困难.提出了一种基于Krylov子空间技术的可靠性分析方法,将大规模问题投影至小规模子空间中,求得问题的近似解.实验结果证明,Krylov子空间方法的计算速度及精度优于Ross方法和前向Euler法(forward Euler method,FEM). 相似文献
73.
UDDI注册中心本质上是一个存储着Web服务注册信息的数据库,针对分布式存储与检索体系架构中出现的数据不一致性的问题,提出了一种分布式UDDI的数据一致性优化模型。首先分析了分布式UDDI及UDDI的核心数据模型,以及在分布式环境下的异构数据源问题。在此基础上,分析了数据的一致性问题,构建了UDDI节点—数据模型间的可达性矩阵,最后研究了分布式UDDI的一致性数据存储策略。该优化模型能有效减少存储冗余和检索网络带宽的消耗。 相似文献
74.
75.
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 相似文献
76.
时问是分布仿真中的核心概念;时间管理是分布交互仿真的关键技术.探讨了分布交互仿真中高层体系结构(HLA)的时间管理机制,针对HLA在实时系统仿真方面的不足,分析其原因,提出了时间管理在实时仿真中的改进方法,对HLA在实时系统仿真中的应用有一定的参考价值. 相似文献
77.
This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
78.
软件构件具有良好的功能封装性及接口规范性,在增强软件的可移植性和提高复用率等方面意义重大。在舰船综合电子仿真系统开发过程中,通过引入ACE Streams框架的技术,有效地降低了软件各层次间的耦合度,增强了数据的传输处理能力,固化了该系统的通信机制。 相似文献
79.
Gonzalo F-de-Córdoba 《Defence and Peace Economics》2016,27(4):549-570
This paper develops a Dynamic Stochastic General Equilibrium model where national security is an argument in the agent’s utility function and the government chooses optimally the level of military spending to maximize social welfare. National defense depends on military expenditure and on the strategic environment reflecting a potential hostile external threat. We use aggregate data on consumption, investment, and military spending for the US economy to estimate the parameters of the model. Estimation results suggest that consumption and national defense are complements and that military spending variability is mainly explained by external threat shocks although it also depends on the macroeconomic conditions. We compute impulse response functions of the main macroeconomic variables to several shocks: a total factor productivity shock, a defense technology shock, and a strategic environment shock. Surprisingly, we find that the optimal response to an increase in the external threat (a worsening in the strategic environment) will rise output by reducing consumption and increasing investment. 相似文献
80.
Martijn van Ee 《海军后勤学研究》2020,67(2):147-158
We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability pi: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete. 相似文献