全文获取类型
收费全文 | 66473篇 |
免费 | 12537篇 |
国内免费 | 9046篇 |
专业分类
电工技术 | 8225篇 |
技术理论 | 1篇 |
综合类 | 8563篇 |
化学工业 | 1355篇 |
金属工艺 | 1265篇 |
机械仪表 | 5212篇 |
建筑科学 | 1189篇 |
矿业工程 | 936篇 |
能源动力 | 1378篇 |
轻工业 | 677篇 |
水利工程 | 1090篇 |
石油天然气 | 774篇 |
武器工业 | 1188篇 |
无线电 | 12412篇 |
一般工业技术 | 4147篇 |
冶金工业 | 492篇 |
原子能技术 | 268篇 |
自动化技术 | 38884篇 |
出版年
2024年 | 538篇 |
2023年 | 1256篇 |
2022年 | 2365篇 |
2021年 | 2544篇 |
2020年 | 2820篇 |
2019年 | 2349篇 |
2018年 | 2344篇 |
2017年 | 2715篇 |
2016年 | 3134篇 |
2015年 | 3726篇 |
2014年 | 4842篇 |
2013年 | 4585篇 |
2012年 | 5794篇 |
2011年 | 6033篇 |
2010年 | 4926篇 |
2009年 | 5038篇 |
2008年 | 5312篇 |
2007年 | 5741篇 |
2006年 | 4505篇 |
2005年 | 3682篇 |
2004年 | 2967篇 |
2003年 | 2346篇 |
2002年 | 1736篇 |
2001年 | 1354篇 |
2000年 | 1157篇 |
1999年 | 903篇 |
1998年 | 725篇 |
1997年 | 577篇 |
1996年 | 445篇 |
1995年 | 313篇 |
1994年 | 270篇 |
1993年 | 198篇 |
1992年 | 194篇 |
1991年 | 96篇 |
1990年 | 128篇 |
1989年 | 85篇 |
1988年 | 59篇 |
1987年 | 22篇 |
1986年 | 33篇 |
1985年 | 34篇 |
1984年 | 24篇 |
1983年 | 22篇 |
1982年 | 24篇 |
1981年 | 13篇 |
1980年 | 20篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1977年 | 8篇 |
1975年 | 9篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
81.
针对3^n阶矩阵的乘法运行,给出了一种分块算法,其乘法运行量比常规的矩阵乘法计算方法和补零的基-2算法都有所减少。 相似文献
82.
由于密码分析研究的进展及DES自身的弱点,原64比特的DES将不能作为数据加密的标准算法而长期存在。在原来工作的基础上,本文提出了256比特的分组密码方案。密码算法由基于混沌映射的数字滤波器构造。 相似文献
83.
The three-dimensional packing problem can be stated as follows. Given a list of boxes, each with a given length, width, and
height, the problem is to pack these boxes into a rectangular box of fixed-size bottom and unbounded height, so that the height
of this packing is minimized. The boxes have to be packed orthogonally and oriented in all three dimensions. We present an
approximation algorithm for this problem and show that its asymptotic performance bound is between 2.5 and 2.67. This result
answers a question raised by Li and Cheng [5] about the existence of an algorithm for this problem with an asymptotic performance
bound less than 2.89.
This research was partially supported by FAPESP (proc. 93/0603-1) and by CNPq/ProTeM-CC, project ProComb (proc. 680065/94-6). 相似文献
84.
Yvon Maday Frédéric Magoulès 《Computer Methods in Applied Mechanics and Engineering》2007,196(8):1541-1553
In this paper an original variant of the Schwarz domain decomposition method is introduced for heterogeneous media. This method uses new optimized interface conditions specially designed to take into account the heterogeneity between the sub-domains on each sides of the interfaces. Numerical experiments illustrate the dependency of the proposed method with respect to several parameters, and confirm the robustness and efficiency of this method based on such optimized interface conditions. Several mesh partitions taking into account multiple cross points are considered in these experiments. 相似文献
85.
This paper addresses the problem of finding the parameters of the arrival law which most significantly influence expected occupation and loss of a finite capacity queue. The input process is supposed to be ergodic and wide sense stationary. We show that it is mostly possible to fit an MMPP(2) to the decisive parameters of observational data. Numerical examples illustrate the importance of the decisive parameters, called key parameters, and also show the accuracy of the proposed fitting procedure. Finally, in the appendix we present the solution of the finite capacity queueing problem with Special Semi Markov Process (SSMP) arrivals and a general service strategy. 相似文献
86.
From the principle of of the Domain Decomposition Method (DDM), we analyse the 2nd-order linear elliptic partial differential problems and link the Separated-Layers Algorithm (SLA) with DDM. The mathematical properties of SLA and numerical example are presented to obtain satisfactory computation results. For general linear differential ones, also are the structure of SLA and its characteristics discussed. 相似文献
87.
In this paper we present an efficient technique for piecewise cubic Bézier approximation of digitized curve. An adaptive breakpoint detection method divides a digital curve into a number of segments and each segment is approximated by a cubic Bézier curve so that the approximation error is minimized. Initial approximated Bézier control points for each of the segments are obtained by interpolation technique i.e. by the reverse recursion of De Castaljau's algorithm. Two methods, two-dimensional logarithmic search algorithm (TDLSA) and an evolutionary search algorithm (ESA), are introduced to find the best-fit Bézier control points from the approximate interpolated control points. ESA based refinement is proved to be better experimentally. Experimental results show that Bézier approximation of a digitized curve is much more accurate and uses less number of points compared to other approximation techniques. 相似文献
88.
Fast Recognition of Fibonacci Cubes 总被引:1,自引:0,他引:1
Fibonacci cubes are induced subgraphs of hypercubes based on Fibonacci strings. They were introduced to represent interconnection
networks as an alternative to the hypercube networks. We derive a characterization of Fibonacci cubes founded on the concept
of resonance graphs. The characterization is the basis for an algorithm which recognizes these graphs in O(mlog n) time.
A. Vesel supported by the Ministry of Science of Slovenia under the grant 0101-P-297. 相似文献
89.
Donghua Yang 《Information Sciences》2007,177(17):3574-3591
Query processing in data grids is a difficult issue due to the heterogeneous, unpredictable and volatile behaviors of the grid resources. Applying join operations on remote relations in data grids is a unique and interesting problem. However, to the best of our knowledge, little is done to date on multi-join query processing in data grids. An approach for processing multi-join queries is proposed in this paper. Firstly, a relation-reduction algorithm for reducing the sizes of operand relations is presented in order to minimize data transmission cost among grid nodes. Then, a method for scheduling computer nodes in data grids is devised to parallel process multi-join queries. Thirdly, an innovative method is developed to efficiently execute join operations in a pipeline fashion. Finally, a complete algorithm for processing multi-join queries is given. Analytical and experimental results show the effectiveness and efficiency of the proposed approach. 相似文献
90.
Speed-up fractal image compression with a fuzzy classifier 总被引:4,自引:0,他引:4
This paper presents a fractal image compression scheme incorporated with a fuzzy classifier that is optimized by a genetic algorithm. The fractal image compression scheme requires to find matching range blocks to domain blocks from all the possible division of an image into subblocks. With suitable classification of the subblocks by a fuzzy classifier we can reduce the search time for this matching process so as to speedup the encoding process in the scheme. Implementation results show that by introducing three image classes and using fuzzy classifier optimized by a genetic algorithm the encoding process can be speedup by about 40% of an unclassified encoding system. 相似文献