全文获取类型
收费全文 | 396098篇 |
免费 | 10124篇 |
国内免费 | 3485篇 |
专业分类
电工技术 | 10190篇 |
技术理论 | 6篇 |
综合类 | 4994篇 |
化学工业 | 62578篇 |
金属工艺 | 14633篇 |
机械仪表 | 14204篇 |
建筑科学 | 13448篇 |
矿业工程 | 3287篇 |
能源动力 | 11237篇 |
轻工业 | 37562篇 |
水利工程 | 3598篇 |
石油天然气 | 8972篇 |
武器工业 | 468篇 |
无线电 | 48693篇 |
一般工业技术 | 70225篇 |
冶金工业 | 62212篇 |
原子能技术 | 6329篇 |
自动化技术 | 37071篇 |
出版年
2022年 | 3740篇 |
2021年 | 5570篇 |
2020年 | 4152篇 |
2019年 | 4444篇 |
2018年 | 6354篇 |
2017年 | 6442篇 |
2016年 | 6187篇 |
2015年 | 5690篇 |
2014年 | 8500篇 |
2013年 | 19508篇 |
2012年 | 12541篇 |
2011年 | 15888篇 |
2010年 | 12754篇 |
2009年 | 13742篇 |
2008年 | 14055篇 |
2007年 | 13806篇 |
2006年 | 12657篇 |
2005年 | 11661篇 |
2004年 | 10342篇 |
2003年 | 9881篇 |
2002年 | 9450篇 |
2001年 | 9362篇 |
2000年 | 9166篇 |
1999年 | 9778篇 |
1998年 | 19926篇 |
1997年 | 14615篇 |
1996年 | 11722篇 |
1995年 | 9213篇 |
1994年 | 8321篇 |
1993年 | 7759篇 |
1992年 | 5912篇 |
1991年 | 5562篇 |
1990年 | 5315篇 |
1989年 | 5110篇 |
1988年 | 4957篇 |
1987年 | 4077篇 |
1986年 | 4166篇 |
1985年 | 4871篇 |
1984年 | 4396篇 |
1983年 | 4092篇 |
1982年 | 3677篇 |
1981年 | 3821篇 |
1980年 | 3523篇 |
1979年 | 3456篇 |
1978年 | 3253篇 |
1977年 | 3868篇 |
1976年 | 4936篇 |
1975年 | 2818篇 |
1974年 | 2679篇 |
1973年 | 2701篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
The value of flexible videoendoscopy as a biofeedback tool in conservative swallowing rehabilitation of patients suffering from aspiration after head and neck surgery was examined. For this purpose, the outcomes of conventional swallowing therapy and of swallowing therapy with support of videoendoscopic biofeedback were compared. In the first 40 days of swallowing therapy, videoendoscopic biofeedback significantly increased the chance of therapeutic success, shortening the period of functional rehabilitation in comparison to conventional swallowing therapy. Limitations of this visual biofeedback procedure are poor cognitive skills of the patient, rejection of the procedure by the patient and local factors that make the positioning of the endoscope difficult. 相似文献
92.
93.
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 相似文献
94.
In order to build models that relate thematic mapper (TM) imagery to field forest variables, several regression techniques, such as the ones based on the Mallows' Cp and the adjusted R2 statistics, were applied. Nevertheless, although the best created models had good fittings (R2>0.65) apparently supported by a clear statistical significance (p<0.0001), later trials tested with additional plots showed that these models were, in fact, nonrobust models (models with very low-predictive capabilities). Two factors were pointed out as causes of these inconsistencies between predicted and observed values: a relatively small number of available field plots and a relatively high number of possible independent variables. Actually, different trials suggested much lower fittings for the expected “really” predictive models. Some restrictions of TM satellite data, such as its radiometric, spectral, and spatial limitations, together with restrictions arising from gathering and processing of field data, might have led to these poor relations. This study shows the need for guarantees stronger than the usual ones before concluding that there is a clear possibility of using satellite information to estimate forest parameters by means of regression techniques 相似文献
95.
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 相似文献
96.
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 相似文献
97.
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 相似文献
98.
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 相似文献
99.
We develop a characterization for m-fault-tolerant extensions, and for optimal m-fault-tolerant extensions, of a complete multipartite graph. Our formulation shows that this problem is equivalent to an interesting combinatorial problem on the partitioning of integers. This characterization leads to a new procedure for constructing an optimal m-fault-tolerant extension of any complete multipartite graph, for any m⩾0. The proposed procedure is mainly useful when the size of the graph is relatively small, because the search time required is exponential. This exponential search, however, is not always necessary. We prove several necessary conditions that help us, in several cases, to identify some optimal m-fault-tolerant extensions without performing any search 相似文献
100.
以网格曲线为连续条件的光滑曲面 总被引:3,自引:1,他引:2
本文提出一种以网格边界曲线定义曲面的方法。曲面的计算式唯一地由网格的四条边界线的参数而定,各网格间连接的光滑度完全由网格间的边界线的光滑度来决定。当网格间的边界线具有C~1连续以上的光滑度时,网络曲面间将自动保证是C~1连续的,否则将是C~0连续。利用这个方法,可以方便地从线框模型(wire-framemodel)建立面模型(surfacemodel)。 相似文献