全文获取类型
收费全文 | 1090篇 |
免费 | 166篇 |
国内免费 | 144篇 |
专业分类
电工技术 | 43篇 |
综合类 | 141篇 |
化学工业 | 1篇 |
金属工艺 | 4篇 |
机械仪表 | 18篇 |
建筑科学 | 5篇 |
矿业工程 | 1篇 |
能源动力 | 1篇 |
轻工业 | 4篇 |
水利工程 | 3篇 |
石油天然气 | 2篇 |
武器工业 | 14篇 |
无线电 | 273篇 |
一般工业技术 | 37篇 |
冶金工业 | 9篇 |
原子能技术 | 3篇 |
自动化技术 | 841篇 |
出版年
2024年 | 3篇 |
2023年 | 5篇 |
2022年 | 12篇 |
2021年 | 17篇 |
2020年 | 19篇 |
2019年 | 22篇 |
2018年 | 21篇 |
2017年 | 21篇 |
2016年 | 34篇 |
2015年 | 39篇 |
2014年 | 60篇 |
2013年 | 67篇 |
2012年 | 97篇 |
2011年 | 102篇 |
2010年 | 72篇 |
2009年 | 89篇 |
2008年 | 100篇 |
2007年 | 99篇 |
2006年 | 97篇 |
2005年 | 98篇 |
2004年 | 67篇 |
2003年 | 51篇 |
2002年 | 48篇 |
2001年 | 43篇 |
2000年 | 24篇 |
1999年 | 17篇 |
1998年 | 13篇 |
1997年 | 13篇 |
1996年 | 7篇 |
1995年 | 7篇 |
1994年 | 6篇 |
1993年 | 7篇 |
1992年 | 9篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1975年 | 2篇 |
排序方式: 共有1400条查询结果,搜索用时 31 毫秒
1.
文章介绍了新一代IP骨干网上的IP QoS实现技术,论述了集成业务(IntServ)与差分业务(DiffServ)解决方案的特点,详细介绍了相关的队列管理与排队机制。并结合多协议标签交换(MPLS)技术的最新发展,阐述了综合多协议标签交换流量工程与DiffServ技术体系端到端IP QoS的实现。 相似文献
2.
TCP/IP网络的动态模型描述 总被引:2,自引:0,他引:2
拥塞现象成为TCP/IP网络发展面临的一个重要问题。因此,拥塞控制对TCP/IP网络的鲁棒性和稳定性具有重要作用。目前,网络拥塞控制策略主要包括两类:端到端的控制机制,如TCP拥塞控制算法;网络内部的主动队列管理(AQM)策略。但由于缺乏对网络系统动态特性的了解,这些拥塞控制策略大都基于专家经验,并没有建立完整的理论分析框架。为此,本文从数据流的角度出发,通过建立网络基本单元状态方程模型来实现IP网络系统的数学解析模型,然后用混杂系统来描述TCP带有拥塞控制策略的数据传输过程,建立了TCP/IP网络的动态模型,为网络系统中动态性能的分析、拥塞控制策略的设计奠定了基础。实验结果表明,该数学模型与NS仿真实验的结果相一致。 相似文献
3.
Cells arriving to an ATM network experience random delays due to queueing in upstream multiplexing stages, notably in customer premises. This is the phenomenon of jitter and the aim of the present paper is to study its influence on peak rate enforcement. We first introduce some general characterizations of jitter and then, describe two models of jittered flows based on simple queueing systems. We discuss the objectives of peak rate enforcement and study the impact of jitter on the dimensioning of jumping window and leaky bucket mechanisms. A useful synthetic characterization of jitter appears to be a remote quantile of the cell delay distribution expressed in units of the initial inter-cell interval. 相似文献
4.
We study tandem queues with finite intermediate buffers and develop a general blocking scheme that unifies and generalizes various blocking schemes previously studied in the literature, such as manufacturing blocking, communication blocking, kanban blocking and its variations. In the general blocking scheme, job movement and service at each stage are controlled by three parameters, which represent, respectively, the upper limits (at that stage) on work-in-process inventory, finished goods inventory, and buffer space. We derive a set of recursive equations that characterize the dynamics of the system, in terms of the job completion and departure processes, and establish comparison results for these processes in the settings of stochastic ordering, variability ordering and stochastic convexity. Free of distributional assumptions, the results provide characterization of system behavior with respect to the control parameters as well as to the arrival and service processes. We also compare system performance under two different modes of operation: make-to-order versus make-to-stock, and demonstrate the trade-off between improving service and reducing inventory. Numerical studies are also presented to illustrate the diversity of performance trade-off, including composition of inventory, offered by the general model.Supported in part by NSF under grant ECS-89-96201. 相似文献
5.
This paper addresses the problem of finding the parameters of the arrival law which most significantly influence expected occupation and loss of a finite capacity queue. The input process is supposed to be ergodic and wide sense stationary. We show that it is mostly possible to fit an MMPP(2) to the decisive parameters of observational data. Numerical examples illustrate the importance of the decisive parameters, called key parameters, and also show the accuracy of the proposed fitting procedure. Finally, in the appendix we present the solution of the finite capacity queueing problem with Special Semi Markov Process (SSMP) arrivals and a general service strategy. 相似文献
6.
The queue of a single server is considered with independent and identically distributed interarrivai and service times and an infinite (GI/G/1) or finite (GI/G/1/N) waiting room. The queue discipline is non-preemptive and independent of the service times.
A discrete time version of the system is analyzed, using a two-component state model at the arrival and departure instants of customers. The equilibrium equations are solved by a polynomial factorization method. The steady state distribution of the queue size is then represented as a linear combination of geometrical series, whose parameters are evaluated by closed formulae depending on the roots of a characteristic polynomial.
Considering modified boundary constraints, systems with finite waiting room or with an exceptional first service in each busy period are included. 相似文献
7.
为了满足迅猛发展的网络业务对网络服务质量提出的更高要求,使用高速分组网络交换机中的队列调度器可以有效地提供高质量的网络服务。通过采用分级式队列调度和四种队列调度算法有效地实现了队列调度器的设计。并且深入地比较和分析了队列调度器中多种队列调度算法的优缺点,尤其是对DRR调度算法进行了优化和改进。最后。对所设计的电路进行了仿真验证和电路综合,结果表明该调度器可以满足网络对服务质量的更高要求,并且能够应用到高速分组交换网络的调度器设计中。 相似文献
8.
9.
Mosleh M. Abualhaj Abdelrahman H. Hussein Qasem M. Kharma Qusai Y. Shambour 《计算机系统科学与工程》2021,38(2):251-264
A considerable number of applications are running over IP networks. This increased the contention on the network resource, which ultimately results in congestion. Active queue management (AQM) aims to reduce the serious consequences of network congestion in the router buffer and its negative effects on network performance. AQM methods implement different techniques in accordance with congestion indicators, such as queue length and average queue length. The performance of the network is evaluated using delay, loss, and throughput. The gap between congestion indicators and network performance measurements leads to the decline in network performance. In this study, delay and loss predictions are used as congestion indicators in a novel stochastic approach for AQM. The proposed method estimates the congestion in the router buffer and then uses the indicators to calculate the dropping probability, which is responsible for managing the router buffer. The experimental results, based on two sets of experiments, have shown that the proposed method outperformed the existing benchmark algorithms including RED, ERED and BLUE algorithms. For instance, in the first experiment, the proposed method resides in the third-place in terms of delay when compared to the benchmark algorithms. In addition, the proposed method outperformed the benchmark algorithms in terms of packet loss, packet dropping, and packet retransmission. Overall, the proposed method outperformed the benchmark algorithms because it preserves packet loss while maintaining reasonable queuing delay. 相似文献
10.
We describe a new parallel data structure, namely parallel heap, for exclusive-read exclusive-write parallel random access machines. To our knowledge, it is the first such data structure to efficiently implement a truly parallel priority queue based on a heap structure. Employing p processors, the parallel heap allows deletions of (p) highest priority items and insertions of (p) new items, each in O(log n) time, where n is the size of the parallel heap. Furthermore, it can efficiently utilize processors in the range 1 through n.This work was supported by U.S. Army's PM-TRADE contract N61339-88-g-0002, Florida High Technology and Industry grant 11-28-716, and Georgia State University's internal research support during spring and summer quarters, 1991. 相似文献