全文获取类型
收费全文 | 445191篇 |
免费 | 4100篇 |
国内免费 | 648篇 |
专业分类
电工技术 | 7551篇 |
综合类 | 340篇 |
化学工业 | 71967篇 |
金属工艺 | 21665篇 |
机械仪表 | 15354篇 |
建筑科学 | 9034篇 |
矿业工程 | 4519篇 |
能源动力 | 8484篇 |
轻工业 | 32628篇 |
水利工程 | 6032篇 |
石油天然气 | 15374篇 |
武器工业 | 55篇 |
无线电 | 41078篇 |
一般工业技术 | 96706篇 |
冶金工业 | 71738篇 |
原子能技术 | 14687篇 |
自动化技术 | 32727篇 |
出版年
2021年 | 4239篇 |
2019年 | 4089篇 |
2018年 | 7532篇 |
2017年 | 7775篇 |
2016年 | 8226篇 |
2015年 | 4636篇 |
2014年 | 8060篇 |
2013年 | 18398篇 |
2012年 | 11957篇 |
2011年 | 15420篇 |
2010年 | 12392篇 |
2009年 | 13729篇 |
2008年 | 14238篇 |
2007年 | 14095篇 |
2006年 | 11962篇 |
2005年 | 10490篇 |
2004年 | 10241篇 |
2003年 | 9916篇 |
2002年 | 9908篇 |
2001年 | 9626篇 |
2000年 | 9442篇 |
1999年 | 8853篇 |
1998年 | 18664篇 |
1997年 | 13815篇 |
1996年 | 10629篇 |
1995年 | 8471篇 |
1994年 | 7705篇 |
1993年 | 7718篇 |
1992年 | 6380篇 |
1991年 | 6195篇 |
1990年 | 6452篇 |
1989年 | 6261篇 |
1988年 | 6018篇 |
1987年 | 5631篇 |
1986年 | 5583篇 |
1985年 | 6138篇 |
1984年 | 5927篇 |
1983年 | 5565篇 |
1982年 | 5251篇 |
1981年 | 5347篇 |
1980年 | 5274篇 |
1979年 | 5381篇 |
1978年 | 5569篇 |
1977年 | 5882篇 |
1976年 | 7094篇 |
1975年 | 5031篇 |
1974年 | 5038篇 |
1973年 | 5153篇 |
1972年 | 4494篇 |
1971年 | 4143篇 |
排序方式: 共有10000条查询结果,搜索用时 9 毫秒
101.
102.
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. 相似文献
103.
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 相似文献
104.
105.
Solotorevsky G. Gudes E. Meisels A. 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(5):681-697
A general language for specifying resource allocation and time-tabling problems is presented. The language is based on an expert system paradigm that was developed previously by the authors and that enables the solution of resource allocation problems by using experts' knowledge and heuristics. The language enables the specification of a problem in terms of resources, activities, allocation rules, and constraints, and thus provides a convenient knowledge acquisition tool. The language syntax is powerful and allows the specification of rules and constraints that are very difficult to formulate with traditional approaches, and it also supports the specification of various control and backtracking strategies. We constructed a generalized inference engine that runs compiled resource allocation problem specification language (RAPS) programs and provides all necessary control structures. This engine acts as an expert system shell and is called expert system for resource allocation (ESRA). The performance of RAPS combined with ESRA is demonstrated by analyzing its solution of a typical resource allocation problem 相似文献
106.
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 相似文献
107.
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 相似文献
108.
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 相似文献
109.
Implementing a neural network on a digital or mixed analog and digital chip yields the quantization of the synaptic weights dynamics. This paper addresses this topic in the case of Kohonen's self-organizing maps. We first study qualitatively how the quantization affects the convergence and the properties, and deduce from this analysis the way to choose the parameters of the network (adaptation gain and neighborhood). We show that a spatially decreasing neighborhood function is far more preferable than the usually rectangular neighborhood function, because of the weight quantization. Based on these results, an analog nonlinear network, integrated in a standard CMOS technology, and implementing this spatially decreasing neighborhood function is then presented. It can be used in a mixed analog and digital circuit implementation. 相似文献
110.
The bounded disorder file organization proposed by W. Litwin and D.B. Lomet (1987) uses a combination of hashing and tree indexing. Lomet provided an approximate analysis with the mention of the difficulty involved in exact modeling of data nodes, which motivated this work. In an earlier paper (M.V. Ramakrishna and P. Mukhopadhyay, 1988) we provided an exact model and analysis of the data nodes, which is based on the solution of a classical sequential occupancy problem. After summarizing the analysis of data nodes, an alternate file growth method based on repeated trials using universal hashing is proposed and analyzed. We conclude that the alternate file growth method provides simplicity and significant improvement in storage utilization 相似文献