全文获取类型
收费全文 | 725046篇 |
免费 | 10540篇 |
国内免费 | 2064篇 |
专业分类
电工技术 | 13056篇 |
综合类 | 671篇 |
化学工业 | 110481篇 |
金属工艺 | 28170篇 |
机械仪表 | 21145篇 |
建筑科学 | 17761篇 |
矿业工程 | 3727篇 |
能源动力 | 19233篇 |
轻工业 | 64406篇 |
水利工程 | 7413篇 |
石油天然气 | 13971篇 |
武器工业 | 49篇 |
无线电 | 81215篇 |
一般工业技术 | 141031篇 |
冶金工业 | 140423篇 |
原子能技术 | 15297篇 |
自动化技术 | 59601篇 |
出版年
2021年 | 6269篇 |
2020年 | 4630篇 |
2019年 | 5816篇 |
2018年 | 10144篇 |
2017年 | 9941篇 |
2016年 | 10536篇 |
2015年 | 7278篇 |
2014年 | 11988篇 |
2013年 | 32693篇 |
2012年 | 19005篇 |
2011年 | 26134篇 |
2010年 | 20879篇 |
2009年 | 23425篇 |
2008年 | 23974篇 |
2007年 | 23481篇 |
2006年 | 20677篇 |
2005年 | 19069篇 |
2004年 | 18128篇 |
2003年 | 17782篇 |
2002年 | 17168篇 |
2001年 | 17174篇 |
2000年 | 16032篇 |
1999年 | 16768篇 |
1998年 | 42723篇 |
1997年 | 30497篇 |
1996年 | 23449篇 |
1995年 | 17559篇 |
1994年 | 15392篇 |
1993年 | 15074篇 |
1992年 | 11070篇 |
1991年 | 10560篇 |
1990年 | 10263篇 |
1989年 | 10090篇 |
1988年 | 9557篇 |
1987年 | 8413篇 |
1986年 | 8309篇 |
1985年 | 9379篇 |
1984年 | 8825篇 |
1983年 | 7960篇 |
1982年 | 7457篇 |
1981年 | 7682篇 |
1980年 | 7292篇 |
1979年 | 7109篇 |
1978年 | 7001篇 |
1977年 | 8304篇 |
1976年 | 10935篇 |
1975年 | 6209篇 |
1974年 | 5810篇 |
1973年 | 5880篇 |
1972年 | 4978篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
The robust Schur stability of a polynomial with uncertain coefficients will be investigated. A formula for the stability radius of a Schur polynomial is established. The result is the counterpart of [1] for linear discrete-time systems 相似文献
992.
993.
George V. Eleftheriades Gabriel M. Rebeiz 《Journal of Infrared, Millimeter and Terahertz Waves》1993,14(10):1925-1946
In this paper, an efficient implementation of the spectral domain moment technique is presented for computing the self and mutual coupling between slot antennas on a dielectric half-space. It is demonstrated that by the proper selection of the weighting functions in the method of moments, the analytic evaluation or simplification of the transverse moment integrals is enabled. This results into a significant reduction of the required computational labor. The method is then utilized in order to provide design data for the self and mutual admittances between two slot antennas on a dielectric substrate lens in the case of fused quartz (∈ r =3.80), crystal quartz (∈ r =4.53), silicon (∈ r =11.9) and GaAs (∈ r =12.8). The presented technique and associated results are useful when designing twin slot quasi-optical receivers, imaging arrays, phased arrays or power-combining arrays of slot elements at millimeter-wave frequencies. 相似文献
994.
995.
Prolog/Rex represents a powerful amalgamation of the latest techniques for knowledge representation and processing, rich in semantic features that ease the difficult task of encoding heterogeneous knowledge of real-world applications. The Prolog/Rex concept mechanism lets a user represent domain entities in terms of their structural and behavioral properties, including multiple inheritance, arbitrary user-defined relations among entities, annotated values (demons), incomplete knowledge, etc. A flexible rule language helps the knowledge engineer capture human expertise and provide flexible control of the reasoning process. Additional Prolog/Rex strength that cannot be found in any other hybrid language made on top of Prolog is language level support for keeping many potentially contradictory solutions to a problem, allowing possible solutions and their implications to be automatically generated and completely explored before they are committed. The same mechanism is used to model time-states, which are useful in planning and scheduling applications of Prolog/Rex 相似文献
996.
Kemper A. Kilger C. Moerkotte G. 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(4):587-608
View materialization is a well-known optimization technique of relational database systems. We present a similar, yet more powerful, optimization concept for object-oriented data models: function materialization. Exploiting the object-oriented paradigm-namely, classification, object identity, and encapsulation-facilitates a rather easy incorporation of function materialization into (existing) object-oriented systems. Only those types (classes) whose instances are involved in some materialization are appropriately modified and recompiled, thus leaving the remainder of the object system invariant. Furthermore, the exploitation of encapsulation (information hiding) and object identity provides for additional performance tuning measures that drastically decrease the invalidation and rematerialization overhead incurred by updates in the object base. First, it allows us to cleanly separate the object instances that are irrelevant for the materialized functions from those that are involved in the materialization of some function result, and this to penalize only those involved objects upon update. Second, the principle of information hiding facilitates fine-grained control over the invalidation of precomputed results. Based on specifications given by the data type implementor, the system can exploit operational semantics to better distinguish between update operations that invalidate a materialized result and those that require no rematerialization. The paper concludes with a quantitative analysis of function materialization based on two sample performance benchmarks obtained from our experimental object base system GOM 相似文献
997.
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 相似文献
998.
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 相似文献
999.
Graefe G. Linville A. Shapiro L.D. 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(6):934-944
Efficient algorithms for processing large volumes of data are very important both for relational and new object-oriented database systems. Many query-processing operations can be implemented using sort- or hash-based algorithms, e.g. intersections, joins, and duplicate elimination. In the early relational database systems, only sort-based algorithms were employed. In the last decade, hash-based algorithms have gained acceptance and popularity, and are often considered generally superior to sort-based algorithms such as merge-join. In this article, we compare the concepts behind sort- and hash-based query-processing algorithms and conclude that (1) many dualities exist between the two types of algorithms, (2) their costs differ mostly by percentages rather than by factors, (3) several special cases exist that favor one or the other choice, and (4) there is a strong reason why both hash- and sort-based algorithms should be available in a query-processing system. Our conclusions are supported by experiments performed using the Volcano query execution engine 相似文献
1000.
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 相似文献