全文获取类型
收费全文 | 639661篇 |
免费 | 8583篇 |
国内免费 | 1917篇 |
专业分类
电工技术 | 12077篇 |
综合类 | 881篇 |
化学工业 | 96175篇 |
金属工艺 | 21954篇 |
机械仪表 | 18105篇 |
建筑科学 | 17395篇 |
矿业工程 | 1585篇 |
能源动力 | 17368篇 |
轻工业 | 63892篇 |
水利工程 | 5173篇 |
石油天然气 | 5177篇 |
武器工业 | 21篇 |
无线电 | 81785篇 |
一般工业技术 | 118250篇 |
冶金工业 | 121712篇 |
原子能技术 | 9456篇 |
自动化技术 | 59155篇 |
出版年
2021年 | 4471篇 |
2019年 | 4131篇 |
2018年 | 6733篇 |
2017年 | 6639篇 |
2016年 | 6984篇 |
2015年 | 5431篇 |
2014年 | 9034篇 |
2013年 | 30029篇 |
2012年 | 15556篇 |
2011年 | 22109篇 |
2010年 | 17138篇 |
2009年 | 19526篇 |
2008年 | 20798篇 |
2007年 | 20921篇 |
2006年 | 18741篇 |
2005年 | 17357篇 |
2004年 | 16904篇 |
2003年 | 16463篇 |
2002年 | 15958篇 |
2001年 | 16092篇 |
2000年 | 15156篇 |
1999年 | 16099篇 |
1998年 | 37632篇 |
1997年 | 27265篇 |
1996年 | 21458篇 |
1995年 | 16671篇 |
1994年 | 15043篇 |
1993年 | 14421篇 |
1992年 | 10751篇 |
1991年 | 10334篇 |
1990年 | 9876篇 |
1989年 | 9515篇 |
1988年 | 9160篇 |
1987年 | 7704篇 |
1986年 | 7792篇 |
1985年 | 9311篇 |
1984年 | 8584篇 |
1983年 | 7762篇 |
1982年 | 7165篇 |
1981年 | 7229篇 |
1980年 | 6777篇 |
1979年 | 6549篇 |
1978年 | 6123篇 |
1977年 | 7455篇 |
1976年 | 10001篇 |
1975年 | 5245篇 |
1974年 | 5024篇 |
1973年 | 4942篇 |
1972年 | 3981篇 |
1971年 | 3498篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
191.
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. 相似文献
192.
For part I see, ibid., p. 134, 1998. The basic approach outlined in the previous article is applied to the difficult problem of computing the optical modes of a vertical-cavity surface-emitting laser. The formulation utilizes a finite difference equation based upon the lowest order term of an infinite series solution of the scalar Helmholtz equation in a local region. This difference equation becomes exact in the one-dimensional (1-D) limit, and is thus ideally suited for nearly 1-D devices such as vertical-cavity lasers. The performance of the resulting code is tested on both a simple cylindrical cavity with known solutions and an oxide-confined vertical-cavity laser structure, and the results compared against second-order-accurate code based upon Crank-Nicolson differencing 相似文献
193.
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 相似文献
194.
195.
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. 相似文献
196.
It is well known that the effectiveness of relational database systems is greatly dependent on the efficiency of the data access strategies. For this reason, much work has been devoted to the development of new access techniques, supported by adequate access structures such as the B+trees. The effectiveness of the B +tree also depends on the data distribution characteristics; in particular, poor performance results when the data show strong key value distribution unbalancing. The aim of this paper is to present the partial index: a new access structure that is useful in such cases of unbalancing, as an alternative to the B+tree unclustered indexes. The access structures are built in the physical design phase, and at execution (or compilation) time, the optimizer chooses the most efficient access path. Thus, integration of the partial indexing technique in the design and in the optimization process are also described 相似文献
197.
We propose and evaluate a parallel “decomposite best-first” search branch-and-bound algorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial best-first search branch-and-bound algorithm. This analysis is used in predicting the parallel algorithm speed-up. The proposed algorithm initially decomposes a problem into N subproblems, where N is the number of processors available in a multiprocessor. Afterwards, each processor executes the serial best-first search to find a local feasible solution. Local solutions are broadcasted through the network to compute the final solution. A conflict-free mapping scheme, known as the step-by-step spread, is used for subproblem distribution on the MIN. A speedup expression for the parallel algorithm is then derived using the serial best-first search node evaluation model. Our analysis considers both computation and communication overheads for providing realistic speed-up. Communication modeling is also extended for the parallel global best-first search technique. All the analytical results are validated via simulation. For large systems, when communication overhead is taken into consideration, it is observed that the parallel decomposite best-first search algorithm provides better speed-up compared to other reported schemes 相似文献
198.
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 相似文献
199.
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 相似文献
200.
Ju D.-C.R. Chuan-Lin Wu Carini P. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(10):1113-1120
We present a classification scheme for array language primitives that quantifies the variation in parallelism and data locality that results from the fusion of any two primitives. We also present an algorithm based on this scheme that efficiently determines when it is beneficial to fuse any two primitives. Experimental results show that five LINPACK routines report 50% performance improvement from the fusion of array operators 相似文献