全文获取类型
收费全文 | 638630篇 |
免费 | 7125篇 |
国内免费 | 1616篇 |
专业分类
电工技术 | 11292篇 |
综合类 | 435篇 |
化学工业 | 98769篇 |
金属工艺 | 28630篇 |
机械仪表 | 21274篇 |
建筑科学 | 15301篇 |
矿业工程 | 4589篇 |
能源动力 | 14262篇 |
轻工业 | 51072篇 |
水利工程 | 7204篇 |
石油天然气 | 14747篇 |
武器工业 | 40篇 |
无线电 | 72086篇 |
一般工业技术 | 134101篇 |
冶金工业 | 103937篇 |
原子能技术 | 16285篇 |
自动化技术 | 53347篇 |
出版年
2021年 | 5233篇 |
2019年 | 4984篇 |
2018年 | 8944篇 |
2017年 | 9272篇 |
2016年 | 9892篇 |
2015年 | 6259篇 |
2014年 | 10633篇 |
2013年 | 28240篇 |
2012年 | 16731篇 |
2011年 | 22577篇 |
2010年 | 17799篇 |
2009年 | 20098篇 |
2008年 | 21142篇 |
2007年 | 21179篇 |
2006年 | 18265篇 |
2005年 | 16720篇 |
2004年 | 16316篇 |
2003年 | 15872篇 |
2002年 | 15398篇 |
2001年 | 15365篇 |
2000年 | 14538篇 |
1999年 | 14369篇 |
1998年 | 29855篇 |
1997年 | 22413篇 |
1996年 | 17659篇 |
1995年 | 14075篇 |
1994年 | 12704篇 |
1993年 | 12535篇 |
1992年 | 9992篇 |
1991年 | 9832篇 |
1990年 | 9597篇 |
1989年 | 9232篇 |
1988年 | 8893篇 |
1987年 | 7937篇 |
1986年 | 7794篇 |
1985年 | 9059篇 |
1984年 | 8648篇 |
1983年 | 7827篇 |
1982年 | 7323篇 |
1981年 | 7337篇 |
1980年 | 7113篇 |
1979年 | 7171篇 |
1978年 | 7093篇 |
1977年 | 7831篇 |
1976年 | 9774篇 |
1975年 | 6211篇 |
1974年 | 6173篇 |
1973年 | 6121篇 |
1972年 | 5232篇 |
1971年 | 4701篇 |
排序方式: 共有10000条查询结果,搜索用时 10 毫秒
121.
A preliminary report presenting the results of fibular strut grafting in the severely resorbed mandibular and maxillary region is presented. Thirteen patients were treated due to severe resorption of alveolar and basilar bone of 49 segments of the mandible and the maxilla. Two patients additionally had pathological fractures of the mandible. In 10 cases the strut graft was harvested by means of a new minimally invasive technique. After modelling the fibular bone it was fixed to the recipient site by miniscrews or implants. After a mean follow-up period of 20 months (max. 31, min. 11 months) a retrospective analysis of clinical and radiological findings was carried out. It showed that a mean augmentation of 16 mm was achieved. Compared to other studies the fibular strut graft was resorbed less, and due to the primary stability it could be used for the treatment of fractures of the mandible. No more than natural resorption was observed when the patients received their prostheses fixed to dental implants. 相似文献
122.
V. I. Shtykov 《Power Technology and Engineering (formerly Hydrotechnical Construction)》1998,32(8):459-462
Conclusions 1. Use of dewatering systems based on voidless drainage is most effective when dewatering slightly permeable soils in regions
with a deep seasonal frost.
2. Two-story drainage with the upper and lower stories spaced 30 m apart accelerates the discharge of gravitational water
from the arable layer. Results of observations on two-story drainage in experimental-production sections indicated that it
discharges 2 – 3.8 times more water than systematic tubular drainage with an interdrain spacing of 10 m and a 0.2-m thick
three-dimensional filter of a sandy-gravelly mixture.
3. It is recommended to use crushed stone and porous-clay gravel with a fineness of 10 – 20 mm as a filler. In that case,
protection of the drain filler is, as a rule, required only from the intrusion of soil from above during construction in cohesive
soils with a plasticity indexW
p≥7.
4. seepage rate in a voidless drain should be lower than the scouring velocity for the soil in which the voidless drainage
is placed. In the opposite case, it is necessary to lower the grade of the drains or select a filler gradation such that the
seepage rate in the drain be lower than the scouring velocity.
Translated from Gidrotekhnicheskoe Stroitel’stvo, No. 8, pp. 41–43, August, 1998. 相似文献
123.
The capacitive idling converters derived from the Cuk, SEPIC, Zeta, and flyback topologies allow soft commutation of power switches without the need for additional circuitry, making it possible to increase the switching frequency while maintaining high efficiency 相似文献
124.
125.
John C. Hart Gordon W. Lescinsky Daniel J. Sandin Thomas A. DeFanti Louis H. Kauffman 《The Visual computer》1993,9(7):346-355
The pipelined architecture and parallel organization of the AT&T Pixel Machine image computer are described and demonstrated with applications for the visualization of multidimensional fractals, particularly linear fractals and quaternion/ stacked Julia sets. Techniques for pushing the Pixel Machine to its peak abilities are described and apply to more recent parallel image computers as well. 相似文献
126.
Moser L.E. Melliar-Smith P.M. Agrawala V. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(5):459-473
Presents protocols for determining processor membership in asynchronous distributed systems that are subject to processor and communication faults. These protocols depend on the placement of a total order on broadcast messages. The types of systems for which each of these protocols is applicable are characterized by the properties of the communication mechanisms and by the availability of stable storage. In the absence of stable storage or of a mechanism for distinguishing promptly delivered messages, the authors show that no membership protocol can exist. They also discuss their experience in implementing these membership protocols 相似文献
127.
Considers the applicability of algorithm based fault tolerance (ABET) to massively parallel scientific computation. Existing ABET schemes can provide effective fault tolerance at a low cost For computation on matrices of moderate size; however, the methods do not scale well to floating-point operations on large systems. This short note proposes the use of a partitioned linear encoding scheme to provide scalability. Matrix algorithms employing this scheme are presented and compared to current ABET schemes. It is shown that the partitioned scheme provides scalable linear codes with improved numerical properties with only a small increase in hardware and time overhead 相似文献
128.
We present new methods for load balancing of unstructured tree computations on large-scale SIMD machines, and analyze the scalability of these and other existing schemes. An efficient formulation of tree search on an SIMD machine consists of two major components: a triggering mechanism, which determines when the search space redistribution must occur to balance the search space over processors, and a scheme to redistribute the search space. We have devised a new redistribution mechanism and a new triggering mechanism. Either of these can be used in conjunction with triggering and redistribution mechanisms developed by other researchers. We analyze the scalability of these mechanisms and verify the results experimentally. The analysis and experiments show that our new load-balancing methods are highly scalable on SIMD architectures. Their scalability is shown to he no worse than that of the best load-balancing schemes on MIMD architectures. We verify our theoretical results by implementing the 15-puzzle problem on a CM-2 SIMD parallel computer 相似文献
129.
Arguello F. Bruguera J.D. Doallo R. Zapata E.L. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(10):1091-1099
We present an unified parallel architecture for four of the most important fast orthogonal transforms with trigonometric kernel: Complex Valued Fourier (CFFT), Real Valued Fourier (RFFT), Hartley (FHT), and Cosine (FCT). Out of these, only the CFFT has a data flow coinciding with the one generated by the successive doubling method, which can be transformed on a constant geometry flow using perfect unshuffle or shuffle permutations. The other three require some type of hardware modification to guarantee the constant geometry of the successive doubling method. We have defined a generalized processing section (PS), based on a circular CORDIC rotator, for the four transforms. This PS section permits the evaluation of the CFFT and FCT transforms in n data recirculations and the RFFT and FHT transforms in n-1 data recirculations, with n being the number of stages of a transform of length N=rn. Also, the efficiency of the partitioned parallel architecture is optimum because there is no cycle loss in the systolic computation of all the butterflies for each of the four transforms 相似文献
130.
Weight smoothing to improve network generalization 总被引:2,自引:0,他引:2
A weight smoothing algorithm is proposed in this paper to improve a neural network's generalization capability. The algorithm can be used when the data patterns to be classified are presented on an n-dimensional grid (n>/=1) and there exists some correlations among neighboring data points within a pattern. For a fully-interconnected feedforward net, no such correlation information is embedded into the architecture. Consequently, the correlations can only be extracted through sufficient amount of network training. With the proposed algorithm, a smoothing constraint is incorporated into the objective function of backpropagation to reflect the neighborhood correlations and to seek those solutions that have smooth connection weights. Experiments were performed on problems of waveform classification, multifont alphanumeric character recognition, and handwritten numeral recognition. The results indicate that (1) networks trained with the algorithm do have smooth connection weights, and (2) they generalize better. 相似文献