全文获取类型
收费全文 | 774篇 |
免费 | 291篇 |
国内免费 | 59篇 |
出版年
2024年 | 3篇 |
2023年 | 7篇 |
2022年 | 9篇 |
2021年 | 24篇 |
2020年 | 23篇 |
2019年 | 31篇 |
2018年 | 18篇 |
2017年 | 54篇 |
2016年 | 51篇 |
2015年 | 39篇 |
2014年 | 57篇 |
2013年 | 91篇 |
2012年 | 53篇 |
2011年 | 48篇 |
2010年 | 33篇 |
2009年 | 52篇 |
2008年 | 49篇 |
2007年 | 40篇 |
2006年 | 46篇 |
2005年 | 55篇 |
2004年 | 49篇 |
2003年 | 42篇 |
2002年 | 38篇 |
2001年 | 26篇 |
2000年 | 24篇 |
1999年 | 25篇 |
1998年 | 28篇 |
1997年 | 14篇 |
1996年 | 15篇 |
1995年 | 13篇 |
1994年 | 11篇 |
1993年 | 13篇 |
1992年 | 9篇 |
1991年 | 6篇 |
1990年 | 19篇 |
1989年 | 9篇 |
排序方式: 共有1124条查询结果,搜索用时 15 毫秒
91.
92.
根据IP组播的原理,分析了组播通信的优点,并在此基础上提出了在校园网上实现组播通信的具体方法与过程,列举了一些实际的应用. 相似文献
93.
装备器材库温湿度监控系统的设计与实现 总被引:3,自引:0,他引:3
军用装备器材仓库温湿度监控是目前亟待解决的问题.文中详细地阐述了种切实可行的设计方法--主从式两级数字化监控系统的设计原理与实现方法,并用Borland C++Builder语言对其组态软件进行程序设计. 相似文献
94.
介绍了作者研制的一种用于半导体制造设备上的x-y并联执行机构。通过增加一个冗余运动链 ,使得该机构在工作空间内没有奇异点。该机构的最大特点是可以大大减少现有机构的体积 ,并具有较高的刚度 ,可以在高速运动条件下具有较高的运动精度和跟踪性能。实验结果表明 ,该系统的轨迹跟踪误差均低于 0 5mm。 相似文献
95.
Tsuyoshi Katayama 《海军后勤学研究》2001,48(7):638-651
We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001. 相似文献
96.
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 相似文献
97.
98.
99.
This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000 相似文献
100.
离散变结构系统的组合控制策略研究 总被引:4,自引:2,他引:2
对离散变结构控制系统的趋近律方法进行研究,提出了4种组合控制策略,它们可以明显改善系统的动态性能,并给出应用例子加以验证. 相似文献