首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   146篇
  免费   42篇
  国内免费   4篇
  2022年   2篇
  2020年   7篇
  2019年   3篇
  2018年   3篇
  2017年   13篇
  2016年   10篇
  2015年   7篇
  2014年   11篇
  2013年   21篇
  2012年   8篇
  2011年   13篇
  2010年   8篇
  2009年   14篇
  2008年   9篇
  2007年   14篇
  2006年   9篇
  2005年   12篇
  2004年   6篇
  2003年   5篇
  2002年   2篇
  2001年   3篇
  2000年   1篇
  1999年   6篇
  1998年   3篇
  1992年   1篇
  1990年   1篇
排序方式: 共有192条查询结果,搜索用时 31 毫秒
91.
针对空中骨干Mesh网络资源有限、计算能力相对不足的特点以及传统简单机会路由(Simple Opportunistic Adaptive Routing,SOAR)路由算法未充分考虑负载均衡与不同业务服务质量(Quality of Service,Qo S)保障需求差异性的问题,提出一种支持业务区分的改进型SOAR路由算法。该算法在考虑链路拥塞控制和负载均衡的基础上,定义综合预期传输次数来描述链路的综合状态,有效降低网络拥塞概率;同时根据传输业务类型的不同,设计一种基于层次分析法的路由选择策略,实现路径选择与业务类型的动态匹配。仿真结果表明,在重负载条件下,改进型SOAR路由算法相比传统SOAR路由算法其时延、吞吐量和吞吐率性能明显提升。当网络中存在不同类型业务时,改进型SOAR路由算法能够根据业务Qo S保障需求的差异性自适应选择最佳传输路径。  相似文献   
92.
针对容忍延迟网络(DTN)高延迟、数据传输成功率低等问题,提出了一种基于节点综合效能的DTN路由算法SERA。该算法综合考虑移动节点的活跃度和剩余能量,使消息副本向综合效能高的节点扩散。SERA节点活跃度描述了节点的社会和动态特性,SERA尽量将消息副本传递给活跃度高的节点,以提高消息传输的成功率;在选择中继节点时,充分考虑节点的能量状态,以避免能量不足的节点承担更多的信息传输任务,从而提高网络节点的存活率。仿真结果表明,与典型的DTN路由算法相比,SERA能够更好地平衡节点的能耗,获得更高的消息递交成功率和更长的网络生存期。  相似文献   
93.
战术移动自组织网络(Mobile Ad Hoc Network,MANET)作为网络中心战的重要组成,有望解决未来战场上传统作战力量与新型无人作战平台之间高效组网通信问题。战术MANET作为MANET在战场环境下的应用,可在基础设施缺乏或遭破坏的地域快速展开,具有节点自由出入、移动性高、抗毁伤性强等特点。综述了战术MANET路由协议和仿真方法,对研究方法和面临的挑战作了简要评述。  相似文献   
94.
文章利用DEA方法对2015-2016年我国国有军工集团的生产效率和创新效率进行了分析,结果发现:我国国有军工集团的生产效率在近两年整体上有所提升,受行业影响小于自身因素影响,受管理、技术等水平的影响与来自规模因素的影响相差不大;创新效率在近两年整体上有所下降,受行业影响与自身因素影响均较大,无效率主要来自创新管理水平或技术条件的不足;生产效率与创新效率呈现统计上不显著的正相关关系。在此基础上,提出了军工集团实施国企改革的几点建议,以供有关方面参考。  相似文献   
95.
本文力图从能表征状态的热力学参数熵的变化中找到有关有限时间热力学新的分析方法,提出了工作参数选择的最小熵产生最大值原则。这个原则揭示了有限时间热力学以时间为基础的“率”与非平衡热力学熵产生间的内在联系。据此,我们便可得到正、反向内可逆卡诺循环的最佳工作参数。为有限时间热力学的普遍应用研究提供了一新的线索。  相似文献   
96.
Optimizing the selection of resources to accomplish a set of tasks involves evaluating the tradeoffs between the cost of maintaining the resources necessary to accomplish the tasks and the penalty cost associated with unfinished tasks. We consider the case where resources are categorized into types, and limits (capacity) are imposed on the number of each type that can be selected. The objective is to minimize the sum of penalty costs and resource costs. This problem has several practical applications including production planning, new product design, menu selection and inventory management. We develop a branch‐and‐bound algorithm to find exact solutions to the problem. To generate bounds, we utilize a dual ascent procedure which exploits the special structure of the problem. Information from the dual and recovered primal solutions are used to select branching variables. We generate strong valid inequalities and use them to fix other variables at each branching step. Results of tests performed on reasonably sized problems are presented. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 19–37, 1999  相似文献   
97.
This paper uses the holding time model (HTM) method to derive an approximate analytic formula for the calculation of the mean throughput of a K-station production line with no buffers between any two successive stations. Service times follow the two-stage Coxian (C2) distribution at all stations. The paper provides a formula that relates the third moment of the service completion (or virtual service) time with the respective parameters of the service time, the repair time and the time to breakdown (the latter is assumed to follow the exponential distribution). In this way, it concludes that under certain conditions the two-stage Coxian distribution can be used to approximate any general distribution matching the first three moments of the service completion time distribution. The mean holding times (consisting of the service and blocking periods) of all stations of the line are obtained in an analytical form. Numerical results are provided for the mean throughput of lines with up to 20 stations. These results are shown to have a good accuracy compared against results obtained from the Markovian state method (for short lines) and results from simulation (for longer lines). © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 669–685, 1998  相似文献   
98.
MANET多路径路由中最大可靠性路径选择算法   总被引:2,自引:1,他引:1       下载免费PDF全文
如何选择路径的数量和质量对多路径路由机制的性能有着重要的影响。已有的多路径算法没有深入研究如何选择多路径的问题。对目前存在的两个典型问题进行了分析,在此基础上研究了路径可靠性模型和虚拟完全非交叉多路径模型,然后提出一个最大可靠性多路径选择算法。算法利用路径权重作为路径可靠性的近似解决方案,以此克服路径可靠性度量问题(NP难题)研究的复杂性,根据路径可靠性模型和完全非交叉多路径模型来选择可靠的路径集,使用这组路径集并行分布流量。应用OPNET模拟平台实现了算法,结果表明,本算法能增加聚合带宽,优化网络带宽的应用,提高网络的吞吐率和多路径路由的性能。  相似文献   
99.
The paper considers the economic lot scheduling problem (ELSP) where production facility is assumed to deteriorate, owing to aging, with an increasing failure rate. The time to shift from an “in‐control” state to an “out‐of‐control” state is assumed to be normally distributed. The system is scheduled to be inspected at the end of each production lot. If the process is found to be in an “out‐of‐control” state, then corrective maintenance is performed to restore it to an “in‐control” state before the start of the next production run. Otherwise, preventive maintenance is carried out to enhance system reliability. The ELSP is formulated under the capacity constraint taking into account the quality related cost due to possible production of non‐conforming items, process inspection, and maintenance costs. In order to find a feasible production schedule, both the common cycle and time‐varying lot sizes approaches are utilized. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 650–661, 2003  相似文献   
100.
We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号