全文获取类型
收费全文 | 413篇 |
免费 | 82篇 |
国内免费 | 18篇 |
出版年
2023年 | 2篇 |
2022年 | 5篇 |
2021年 | 3篇 |
2020年 | 11篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 24篇 |
2016年 | 31篇 |
2015年 | 6篇 |
2014年 | 26篇 |
2013年 | 24篇 |
2012年 | 29篇 |
2011年 | 32篇 |
2010年 | 25篇 |
2009年 | 31篇 |
2008年 | 30篇 |
2007年 | 26篇 |
2006年 | 23篇 |
2005年 | 22篇 |
2004年 | 19篇 |
2003年 | 16篇 |
2002年 | 21篇 |
2001年 | 19篇 |
2000年 | 13篇 |
1999年 | 11篇 |
1998年 | 5篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 8篇 |
1994年 | 4篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 1篇 |
1990年 | 7篇 |
1989年 | 1篇 |
1988年 | 2篇 |
排序方式: 共有513条查询结果,搜索用时 31 毫秒
61.
根据IP组播的原理,分析了组播通信的优点,并在此基础上提出了在校园网上实现组播通信的具体方法与过程,列举了一些实际的应用. 相似文献
62.
介绍了双DSP技术在无线分组网络路由控制器中的应用,阐述了双DSP间通信方案的选择及双DSP系统的实现,提出了一种双DSP对多个串行通信控制器(SCC)的设计方案,并给出了具体的硬件、软件设计方法. 相似文献
63.
R.E. Lillo 《海军后勤学研究》2001,48(3):201-209
An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001 相似文献
64.
采用了一种基于神经网络的舰船建造费预测方法 .计算结果表明 ,这种方法与传统的参数法相比较 ,有更好的估算精度 ,因而该方法可以作为研究此类问题的新途径 相似文献
65.
The opportunistic maintenance of a k‐out‐of‐n:G system with imperfect preventive maintenance (PM) is studied in this paper, where partial failure is allowed. In many applications, the optimal maintenance actions for one component often depend on the states of the other components and system reliability requirements. Two new (τ, T) opportunistic maintenance models with the consideration of reliability requirements are proposed. In these two models, only minimal repairs are performed on failed components before time τ and the corrective maintenance (CM) of all failed components are combined with PM of all functioning but deteriorated components after τ; if the system survives to time T without perfect maintenance, it will be subject to PM at time T. Considering maintenance time, asymptotic system cost rate and availability are derived. The results obtained generalize and unify some previous research in this area. Application to aircraft engine maintenance is presented. © 2000 John Wiley & Sons;, Inc. Naval Research Logistics 47: 223–239, 2000 相似文献
66.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献
67.
68.
结合分布式人工智能中的Agent技术和军械勤务辅助支持系统的特点 ,研究了面向A gent的军械勤务辅助支持结构。结合该系统介绍了Agent和多Agent系统的概念 ,讨论了A gent的通信机制 相似文献
69.
基于OPNET的战场IPV6通信网络拓扑设计及仿真 总被引:2,自引:0,他引:2
为了对IPv6与IPv4共存期间进行可靠通信提供技术上的参考,基于OPNET仿真平台,设计了几种不同的战场IPv6通信网络拓扑,强调了其特点和关键技术,突出了其仿真的主要参数配置,并通过分析仿真数据,对网络的有效性、实时性、可靠性等性能参数进行了评估,从而验证了所设计拓扑的可行性. 相似文献
70.
针对树状军事通信网中的文件传输优化问题,提出了一种有效的寻找最优的树图边着色算法,该算法保证了边着色后的树图中"延迟损耗"总和最小,并由求取最小"延迟损耗"的反向推导过程得到最优的树状通信网文件传输方案.算法的计算复杂度是,其中为顶点数,为树的最大度. 相似文献