首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   65篇
  免费   0篇
轻工业   3篇
无线电   11篇
一般工业技术   4篇
冶金工业   27篇
原子能技术   1篇
自动化技术   19篇
  2017年   2篇
  2016年   1篇
  2013年   4篇
  2012年   3篇
  2011年   2篇
  2010年   5篇
  2009年   2篇
  2008年   1篇
  2007年   1篇
  2005年   1篇
  2002年   1篇
  2001年   2篇
  2000年   1篇
  1999年   1篇
  1998年   2篇
  1997年   2篇
  1996年   1篇
  1995年   4篇
  1994年   1篇
  1993年   2篇
  1991年   1篇
  1989年   5篇
  1987年   1篇
  1984年   1篇
  1983年   2篇
  1981年   1篇
  1980年   1篇
  1979年   3篇
  1977年   1篇
  1974年   3篇
  1973年   2篇
  1972年   2篇
  1971年   1篇
  1970年   1篇
  1968年   1篇
排序方式: 共有65条查询结果,搜索用时 0 毫秒
61.
62.
63.
1 wk. of solitary confinement of 20 18-45 yr. old prison inmates produced significant changes in their EEG frequency and visual evoked potentials (VEP) that parallel those reported in laboratory studies of sensory deprivation. EEG frequency declined in a nonlinear manner over the 7-day period. VEP latency, which decreased with continued solitary confinement, was shorter for these Ss than for control Ss whose VEP latency did not change over the same period. Experimental Ss who had been in prison longer had shorter VEP latencies than relative newcomers to the prison. (20 ref.) (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
64.
Election in a computer network is an operation in which one process is selected from among a group of processes to perform a particular task. An election is characterized by (1) the capacities of the candidates, and (2) the agreement reached by all processes to elect the master. In this paper, we show that election is in fact a very general style of computation. Many problems in computer networks can be solved by means of election. We then examine the election problem in computer networks with broadcast support. Basic design issues of election algorithms are addressed, and a number of election algorithms are presented based on various environments. These algorithms allow all nonfaulty processes to elect one and only one process as the master, and, by changing the definition of the capacities, they can be applied to a variety of problems.  相似文献   
65.
Optical Burst Switching (OBS) is a promising switching technology for the next generation all-optical networks. An OBS network without wavelength converters and fiber delay lines can be implemented simply and cost-effectively using the existing technology. However, this kind of networks suffers from a relatively high burst loss probability at the OBS core nodes. To overcome this issue and consolidate OBS networks with QoS provisioning capabilities, we propose a wavelength partitioning approach, called Optimization-based Topology-aware Wavelength Partitioning approach (OTWP). OTWP formulates the wavelength partitioning problem, based on the topology of the network, as an Integer Linear Programming (ILP) model and uses a tabu search algorithm (TS) to resolve large instances efficiently. We use OTWP to develop an absolute QoS differentiation scheme, called Absolute Fair Quality of service Differentiation scheme (AFQD). AFQD is the first absolute QoS provisioning scheme that guarantees loss-free transmission for high priority traffic, inside the OBS network, regardless of its topology. Also, we use OTWP to develop a wavelength assignment scheme, called Best Effort Traffic Wavelength Assignment scheme (BETWA). BETWA aims to reduce loss probability for best effort traffic. To make AFQD adaptive to non-uniform traffic, we develop a wavelength borrowing protocol, called Wavelength Borrowing Protocol (WBP). Numerical results show the effectiveness of the proposed tabu search algorithm to resolve large instances of the partitioning problem. Also, simulation results, using ns-2, show that: (a) AFQD provides an excellent quality of service differentiation; (b) BETWA substantially decreases the loss probability of best effort traffic to a remarkably low level for the OBS network under study; and (c) WBP makes AFQD adaptive to non-uniform traffic by reducing efficiently blocking probability for high priority traffic.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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