全文获取类型
收费全文 | 10474篇 |
免费 | 676篇 |
国内免费 | 539篇 |
专业分类
电工技术 | 448篇 |
综合类 | 826篇 |
化学工业 | 163篇 |
金属工艺 | 112篇 |
机械仪表 | 549篇 |
建筑科学 | 180篇 |
矿业工程 | 57篇 |
能源动力 | 155篇 |
轻工业 | 51篇 |
水利工程 | 68篇 |
石油天然气 | 44篇 |
武器工业 | 48篇 |
无线电 | 910篇 |
一般工业技术 | 790篇 |
冶金工业 | 105篇 |
原子能技术 | 31篇 |
自动化技术 | 7152篇 |
出版年
2024年 | 42篇 |
2023年 | 62篇 |
2022年 | 99篇 |
2021年 | 102篇 |
2020年 | 164篇 |
2019年 | 149篇 |
2018年 | 125篇 |
2017年 | 229篇 |
2016年 | 257篇 |
2015年 | 330篇 |
2014年 | 471篇 |
2013年 | 680篇 |
2012年 | 596篇 |
2011年 | 706篇 |
2010年 | 452篇 |
2009年 | 727篇 |
2008年 | 776篇 |
2007年 | 795篇 |
2006年 | 712篇 |
2005年 | 569篇 |
2004年 | 532篇 |
2003年 | 482篇 |
2002年 | 418篇 |
2001年 | 320篇 |
2000年 | 280篇 |
1999年 | 213篇 |
1998年 | 228篇 |
1997年 | 202篇 |
1996年 | 137篇 |
1995年 | 107篇 |
1994年 | 109篇 |
1993年 | 77篇 |
1992年 | 74篇 |
1991年 | 45篇 |
1990年 | 39篇 |
1989年 | 44篇 |
1988年 | 49篇 |
1987年 | 32篇 |
1986年 | 24篇 |
1985年 | 36篇 |
1984年 | 49篇 |
1983年 | 32篇 |
1982年 | 22篇 |
1981年 | 23篇 |
1980年 | 20篇 |
1979年 | 15篇 |
1978年 | 7篇 |
1977年 | 11篇 |
1976年 | 10篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
Paolo Detti 《Journal of Scheduling》2008,11(3):205-212
A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C=2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the number of scheduled
jobs. 相似文献
22.
The recommendation of the CIE has been followed as closely as possible to evaluate the accuracy of five color gamut mapping algorithms (GMAs)—two nonspatial and three spatial algorithms—by psychophysical experiments with 20 test images, 20 observers, one test done on paper and a second one on display. Even though the results do not show any overall “winner,” one GMA is definitely perceived as not accurate. The importance of a high number of test images to obtain robust evaluation is underlined by the high variability of the results depending on the test images. Significant correlations between the percentage of out‐of‐gamut pixels, the number of distinguishable pairs of GMAs, and the perceived difficulty to distinguish them have been found. The type of observers is also important. The experts, who prefer a spatial GMA, show a stronger consensus and look especially for a good rendering of details, whereas the nonexperts hardly make a difference between the GMAs. © 2008 Wiley Periodicals, Inc. Col Res Appl, 33, 470–476, 2008 相似文献
23.
Sun-Yuan Hsieh 《The Journal of supercomputing》2007,39(1):39-57
A graph is distance-hereditary if the distance stays the same between any of two vertices in every connected induced subgraph containing both. Two well-known
classes of graphs, trees and cographs, both belong to distance-hereditary graphs. In this paper, we first show that the perfect
domination problem can be solved in sequential linear-time on distance-hereditary graphs. By sketching some regular property
of the problem, we also show that it can be easily parallelized on distance-hereditary graphs. 相似文献
24.
无向网络K终端可靠度的分解算法中,包括多边形→链简化在内的等可靠度简化和分解定理结合,可以降低算法的复杂度。本文完善了边随机无向网络和混合随机无向网络的4#,6#,7#型多边形→链简化定理。计算机编程验证了其正确性。 相似文献
25.
In this paper, the effectiveness of the approximate motion equations of a flexible structure, obtained by the RitzKantorovich method, is analysed by using Lyapunov functions. The analysis, which is restricted to the case of a single flexible beam for the sake of simplicity, is carried out under the assumption that a partial dissipation is present, affecting only the first degrees of freedom of the system. By means of suitable Lyapunov functions, an overbounding estimate of the quadratic approximation error is determined as a decreasing function of the approximation order. The analysis is completed by considering the two ‘extreme’ cases: the theoretical absence of dissipation and the presence of structural dissipation, affecting all the infinite degrees of freedom. 相似文献
26.
The focus of this paper is database design using automated database design tools or more general CASE tools. We present a genetic algorithm for the optimization of (internal) database structures, using a multi-criterion objective function. This function expresses conflicting objectives, reflecting the well-known time/space trade-off. This paper shows how the solution space of the algorithm can be set up in the form of tree structures (forests), and how these are encoded by a simple integer assignation. Genetic operators (database transformations) defined in terms of this encoding behave as if they manipulate tree structures. Some basic experimental results produced by a research prototype are presented. 相似文献
27.
A genetic algorithm for the optimisation of assembly sequences 总被引:6,自引:0,他引:6
This paper describes a Genetic Algorithm (GA) designed to optimise the Assembly Sequence Planning Problem (ASPP), an extremely diverse, large scale and highly constrained combinatorial problem. The modelling of the ASPP problem, which has to be able to encode any industrial-size product with realistic constraints, and the GA have been designed to accommodate any type of assembly plan and component. A number of specific modelling issues necessary for understanding the manner in which the algorithm works and how it relates to real-life problems, are succinctly presented, as they have to be taken into account/adapted/solved prior to Solving and Optimising (S/O) the problem. The GA has a classical structure but modified genetic operators, to avoid the combinatorial explosion. It works only with feasible assembly sequences and has the ability to search the entire solution space of full-scale, unabridged problems of industrial size. A case study illustrates the application of the proposed GA for a 25-components product. 相似文献
28.
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). 相似文献
29.
This paper deals with the issues of development and implementation of a real-time NURBS interpolator for a six-axis robot. Using an open-architecture controller system as a testbed, a real-time NURBS curve interpolator was developed, implemented and tested. Sample runs were conducted with the resulting trajectories measured in real-time during robot motion. The resulting trajectories are analyzed, discussed and compared with those from a commonly used point-to-point approximation technique. The real-time NURBS curve interpolator's feasibility, advantages and related issues are also discussed. 相似文献
30.
We consider an integer-subset representation problem motivated by a medical application in radiation therapy. We prove NP-completeness, derive nontrivial bounds, and report on the performance of a greedy heuristic. 相似文献