全文获取类型
收费全文 | 168篇 |
免费 | 3篇 |
专业分类
化学 | 32篇 |
晶体学 | 1篇 |
数学 | 62篇 |
物理学 | 1篇 |
无线电 | 75篇 |
出版年
2020年 | 2篇 |
2019年 | 1篇 |
2018年 | 1篇 |
2017年 | 2篇 |
2016年 | 5篇 |
2015年 | 3篇 |
2014年 | 1篇 |
2013年 | 4篇 |
2012年 | 7篇 |
2011年 | 3篇 |
2010年 | 7篇 |
2009年 | 4篇 |
2008年 | 3篇 |
2007年 | 5篇 |
2006年 | 6篇 |
2005年 | 5篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 8篇 |
2001年 | 5篇 |
2000年 | 3篇 |
1999年 | 7篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 9篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 4篇 |
1989年 | 1篇 |
1988年 | 4篇 |
1987年 | 4篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1975年 | 4篇 |
1973年 | 1篇 |
1972年 | 2篇 |
1971年 | 3篇 |
1970年 | 1篇 |
1969年 | 3篇 |
1966年 | 1篇 |
排序方式: 共有171条查询结果,搜索用时 449 毫秒
61.
Effects of Erlang call holding times on PCS call completion 总被引:1,自引:0,他引:1
This paper studies personal communications services (PCSs) channel allocation assuming the Erlang call holding time distribution (a generalization of the exponential distribution) to investigate the effect of the variance of the call holding times on the call completion probability. Our analysis indicates that the call completion probability decreases as the variance of the call holding times decreases. This effect becomes more pronounced as the variance of the cell residence times decreases 相似文献
62.
Teletraffic analysis and mobility modeling of PCS networks 总被引:1,自引:0,他引:1
Channel holding time is of primary importance in teletraffic analysis of PCS networks. This quantity depends on user's mobility which can be characterized by the cell residence time. We show that when the cell residence time is not exponentially distributed, the channel holding time is not exponentially distributed either, a fact also confirmed by available field data. In order to capture the essence of PCS network behaviour, including the characterization of channel holding time, a correct mobility model is therefore necessary. The new model must be good enough to fit field data, while at the same time resulting in a tractable queueing system. We propose a new mobility model, called the hyper-Erlang distribution model, which is consistent with these requirements. Under the new realistic operational assumption of this model, in which the cell residence time is generally distributed, we derive analytical results for the channel holding time distribution, which are readily applicable to the hyper-Erlang distribution models. Using the derived analytical results we demonstrate how the distribution of the cell residence time affects the channel holding time distribution. The results presented in this paper can provide guidelines for field data processing in PCS network design and performance evaluation 相似文献
63.
We describe an adaptive multiaccess channel protocol for use in radio networks with an arbitrary distribution of stationary hidden nodes, which provides the nodes with controlled, collision-free access to the channel. The protocol can be considered to belong to the BRAM [5] protocol family, but differs in significant ways from BRAM. In this paper we describe the tenets of the protocol, then develop the protocol, and finally develop analytic expressions for its expected throughput and delay performance. Given these delay-throughput expressions, we show how protocol "delay" optimization can be achieved by dynamic adjustment of a protocol parameter as the network traffic load changes. 相似文献
64.
An approximate solution to slotted communication systems with finite population and finite buffer capacity is presented. The authors assume symmetric systems and present for the first time a linear solution involving linear equations whose number is a linear function of the total buffer capacity. They show that the model can be applied to existing multiaccess channel protocols in which a single successful transmission can be affected per slot. They further show that, unlike solutions based on existing nonlinear models, the proposed solution can be extended to communication systems in which several successful transmissions can take place in parallel, such as multibus communication networks and multichannel satellite systems 相似文献
65.
66.
67.
68.
CORD: contention resolution by delay lines 总被引:10,自引:0,他引:10
Chlamtac I. Fumagalli A. Kazovsky L.G. Melman P. Nelson W.H. Poggiolini P. Cerisola M. Choudhury A.N.M.M. Fong T.K. Hofmeister R.T. Chung-Li Lu Mekkittikul A. Sabido D.J.M. IX Chang-Jin Suh Wong E.W.M. 《Selected Areas in Communications, IEEE Journal on》1996,14(5):1014-1029
The implementation of optical packet-switched networks requires that the problems of resource contention, signalling and local and global synchronization be resolved. A possible optical solution to resource contention is based on the use of switching matrices suitably connected with optical delay lines. Signalling could be dealt with using subcarrier multiplexing of packet headers. Synchronization could take advantage of clock tone multiplexing techniques, digital processing for ultra-fast clock recovery, and new distributed techniques for global packet-slot alignment. To explore the practical feasibility and effectiveness of these key techniques, a consortium was formed among the University of Massachusetts, Stanford University, and GTE Laboratories. The consortium, funded by ARPA, has three main goals: investigating networking issues involved in optical contention resolution (University of Massachusetts), constructing an experimental contention-resolution optical (CRO) device (GTE Laboratories), and building a packet-switched optical network prototype employing a CRO and novel signaling/synchronization techniques (Stanford University). This paper describes the details of the project and provides an overview of the main results obtained so far 相似文献
69.
In high-speed communication networks, the ratio between the end-to-end propagation delay to packet transmission time is large, causing increased scheduling overhead in demand assignment protocols and increased collision probabilities in random access schemes. These lead to rapid degradation of the channel utilization in both channel access control approaches. In this paper, we present a "random token" oriented protocol where channel access is scheduled by random, implicit token passing leading to lower channel access control penalty. By optimally balancing the collision and scheduling penalties, the protocol allows the network to reach better performance than that obtained from random access schemes in networks with and without collision detection, without imposing additional system operational assumptions. Specifically, the random token protocol does not require knowledge of the number of stations, their identities, or synchronization in periods of silence. Therefore, the protocol is also suitable for high-speed networks with frequent reconfiguration and for mobile radio networks. 相似文献
70.
A class of message-based or station-based priority protocols for demand-assignment-based local area networks (LANs), such as Token Bus, HYPERbus, LCN, etc., is defined. It is shown how existing priority protocols can be represented within this class and how they can be extended for a more efficient realization with regard to both delay and capacity of prioritized channel access in LANs. An analytic approach for analyzing multiple-access systems operating under prioritized demand assignment protocols is introduced. The approach permits the modeling of station-dependent and priority-dependent arrival rates and generally distributed transmission times. The introduced finite-population model is especially appropriate for prioritized systems where the number of users per priority class is typically small and users place different service demands on the system. For modeling systems with large populations of users, an approximate model, which is shown to be significantly more computationally efficient than the exact model without imposing additional modeling restrictions, is introduced 相似文献