全文获取类型
收费全文 | 117篇 |
免费 | 0篇 |
专业分类
化学工业 | 6篇 |
金属工艺 | 1篇 |
机械仪表 | 1篇 |
建筑科学 | 4篇 |
能源动力 | 3篇 |
轻工业 | 3篇 |
石油天然气 | 1篇 |
无线电 | 23篇 |
一般工业技术 | 28篇 |
冶金工业 | 23篇 |
原子能技术 | 1篇 |
自动化技术 | 23篇 |
出版年
2021年 | 4篇 |
2019年 | 2篇 |
2018年 | 3篇 |
2017年 | 1篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2013年 | 6篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 2篇 |
2009年 | 8篇 |
2008年 | 6篇 |
2007年 | 5篇 |
2006年 | 8篇 |
2005年 | 8篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 7篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 4篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1984年 | 2篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有117条查询结果,搜索用时 62 毫秒
111.
Yuval Emek Leszek Ga̧sieniec Erez Kantor Andrzej Pelc David Peleg Chang Su 《Distributed Computing》2009,21(5):331-351
The paper considers broadcasting in radio networks, modeled as unit disk graphs (UDG). Such networks occur in wireless communication between sites (e.g., stations or sensors) situated in a terrain. Network stations are represented by points in the Euclidean plane, where a station is connected to all stations at distance at most 1 from it. A message transmitted by a station reaches all its neighbors, but a station hears a message (receives the message correctly) only if exactly one of its neighbors transmits at a given time step. One station of the network, called the source, has a message which has to be disseminated to all other stations. Stations are unaware of the network topology. Two broadcasting models are considered. In the conditional wake up model, the stations other than the source are initially idle and cannot transmit until they hear a message for the first time. In the spontaneous wake up model, all stations are awake (and may transmit messages) from the beginning. It turns out that broadcasting time depends on two parameters of the UDG network, namely, its diameter D and its granularity g, which is the inverse of the minimum distance between any two stations. We present a deterministic broadcasting algorithm which works in time O (D g) under the conditional wake up model and prove that broadcasting in this model cannot be accomplished by any deterministic algorithm in time better than ${\Omega (D \sqrt{g})}The paper considers broadcasting in radio networks, modeled as unit disk graphs (UDG). Such networks occur in wireless communication
between sites (e.g., stations or sensors) situated in a terrain. Network stations are represented by points in the Euclidean
plane, where a station is connected to all stations at distance at most 1 from it. A message transmitted by a station reaches
all its neighbors, but a station hears a message (receives the message correctly) only if exactly one of its neighbors transmits at a given time step. One station
of the network, called the source, has a message which has to be disseminated to all other stations. Stations are unaware of the network topology. Two broadcasting
models are considered. In the conditional wake up model, the stations other than the source are initially idle and cannot transmit until they hear a message for the first
time. In the spontaneous wake up model, all stations are awake (and may transmit messages) from the beginning. It turns out that broadcasting time depends
on two parameters of the UDG network, namely, its diameter D and its granularity g, which is the inverse of the minimum distance between any two stations. We present a deterministic broadcasting algorithm
which works in time O (D
g) under the conditional wake up model and prove that broadcasting in this model cannot be accomplished by any deterministic
algorithm in time better than W(D ?g){\Omega (D \sqrt{g})} . For the spontaneous wake up model, we design two deterministic broadcasting algorithms: the first works in time O (D + g
2) and the second in time O (D log g). While neither of these algorithms alone is optimal for all parameter values, we prove that the algorithm obtained by interleaving
their steps, and thus working in time O ( min{ D + g2, D logg}){ O \left( \min\left\{ D + g^2, D \log{g}\right\}\right) }, turns out to be optimal by establishing a matching lower bound. 相似文献
112.
Erez N. Allouche Samuel T. Ariaratnam Jason S. Lueke 《Canadian Metallurgical Quarterly》2000,126(1):68-76
Perhaps the fastest growing segment in the underground trenchless construction industry is horizontal directional drilling (HDD). Currently, in North America alone, there are 17 manufacturers of HDD rigs and accessories and thousands of horizontal drilling rigs that are owned and operated by several hundred dedicated HDD contractors as well as utility companies and large pipeline outfits. Applications of HDD span across the civil engineering spectrum from mineral and oil exploration to the installation of telecommunication cables. An industry survey was conducted to gain a better understanding of this multibillion dollar industry, which is relatively unfamiliar to many in the construction sector. This paper presents the results obtained from analyzing 49 survey responses from HDD contractors in the United States and Canada. Topics investigated include company profile (e.g., annual volume, areas of activities); type of projects performed (e.g., applications, value, duration, type of product installed), and bidding and estimating practices (e.g., productivity values in various formations, cost of installation), Current and future trends in the industry are identified and discussed. 相似文献
113.
Erez U. Litsyn S. Zamir R. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2005,51(10):3401-3416
We define an ensemble of lattices, and show that for asymptotically high dimension most of its members are simultaneously good as sphere packings, sphere coverings, additive white Gaussian noise (AWGN) channel codes and mean-squared error (MSE) quantization codes. These lattices are generated by applying Construction A to a random linear code over a prime field of growing size, i.e., by "lifting" the code to /spl Ropf//sup n/. 相似文献
114.
The isotopic composition and concentrations of Pb in the sediments of the Sea of Galilee (Lake Kinneret) were measured. The studied sediments have been deposited in the lake since the early 1900s (ca. 1920), hence Pb data record the transition from a period when the lake vicinity was sparsely populated to the present (approximately 100,000 people living in the area around the lake). In general, there is either a constant or a relatively slow increase in Pb concentrations from 40 cm depth (3.5-4.4 microg/g; ca. 1920) to 17 +/- 2 cm below the sediment-water interface (3.7-7.2 microg/g;), which was deposited in the mid-1960s. From 17 +/- 2 cm below the surface, there is a much faster increase up to 7 +/- 2 cm below the surface (from 6.5 to 11.5 microg/g; 1982-1983), and from 7 +/- 2 cm there is a gradual decrease in Pb concentrations toward the sediment-water interface. At station G, near the outlet of the Jordan River, Pb concentrations drop between 29 and 25 cm below the surface, probably reflecting changes in the particulate load of the Jordan River due to the drying out of the Hula Swamp in the early 1950s. 206Pb/207Pb values in all the stations record most of the shifts displayed by Pb concentrations in the sediment. The estimated value of total Pb deposited annually in the lake sediment in the early 1990s is very close to the value obtained from measurements of Pb fluxes to the lake from eolian and fluvial sources. On the basis of the linear relationship between 206Pb/207Pb (or 208Pb/207Pb) and 1/[Pb], we argue that two end-members contribute most of the Pb to the lake sediments. Sources of Pb to the lake include (i) the weathering of basalt from the eastern Galilee and the Golan Heights contributing 2.6 +/- 0.5 microg/g Pb to the sediment and (ii) anthropogenic Pb that is affecting both surface and deep (from 30 to 40 cm) lake sediments. At station S, a third source, Pb released from soils developed on carbonates, should be considered as well. 相似文献
115.
Erez Petrank 《Computational Complexity》1994,4(2):133-157
We refine the complexity analysis of approximation problems by relating it to a new parameter calledgap location. Many of the results obtained so far for approximations yield satisfactory analysis with respect to this refined parameter, but some known results (e.g.,max-k-colorability, max 3-dimensional matching andmax not-all-equal 3sat) fall short of doing so. As a second contribution, our work fills the gap in these cases by presenting new reductions.Next, we present definitions and hardness results of new approximation versions of some NP-complete optimization problems. The problems we treat arevertex cover (for which we define a different optimization problem from the one treated in Papadimitriou & Yannakakis 1991),k-edge coloring, andset splitting. 相似文献
116.
117.
Leszek Gąsieniec Erez Kantor Dariusz R. Kowalski David Peleg Chang Su 《Distributed Computing》2008,21(2):117-127
The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy.
The radio network is modelled as an undirected graph G = (V, E) where |V| = n. It is assumed that during execution of the communication task every node in V is allowed to transmit at most once. Under this assumption it is shown that any radio broadcast protocol requires transmission rounds, where D is the diameter of G. This lower bound is complemented with an efficient construction of a deterministic protocol that accomplishes broadcasting
in rounds. Moreover, if we allow each node to transmit at most k times, the lower bound on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in rounds. The paper concludes with a number of open problems in the area.
The research of L. Gąsieniec, D.R. Kowalski and C. Su supported in part by the Royal Society grant Algorithmic and Combinatorial Aspects of Radio Communication, IJP - 2006/R2.
The research of E. Kantor and D. Peleg supported in part by grants from the Minerva Foundation and the Israel Ministry of
Science. 相似文献