全文获取类型
收费全文 | 16488篇 |
免费 | 1794篇 |
国内免费 | 1540篇 |
专业分类
电工技术 | 640篇 |
综合类 | 1473篇 |
化学工业 | 180篇 |
金属工艺 | 109篇 |
机械仪表 | 655篇 |
建筑科学 | 192篇 |
矿业工程 | 90篇 |
能源动力 | 187篇 |
轻工业 | 59篇 |
水利工程 | 224篇 |
石油天然气 | 51篇 |
武器工业 | 74篇 |
无线电 | 3203篇 |
一般工业技术 | 980篇 |
冶金工业 | 128篇 |
原子能技术 | 28篇 |
自动化技术 | 11549篇 |
出版年
2024年 | 69篇 |
2023年 | 147篇 |
2022年 | 207篇 |
2021年 | 223篇 |
2020年 | 357篇 |
2019年 | 280篇 |
2018年 | 278篇 |
2017年 | 453篇 |
2016年 | 513篇 |
2015年 | 700篇 |
2014年 | 927篇 |
2013年 | 1199篇 |
2012年 | 1173篇 |
2011年 | 1310篇 |
2010年 | 1007篇 |
2009年 | 1286篇 |
2008年 | 1344篇 |
2007年 | 1377篇 |
2006年 | 1163篇 |
2005年 | 971篇 |
2004年 | 856篇 |
2003年 | 733篇 |
2002年 | 592篇 |
2001年 | 494篇 |
2000年 | 379篇 |
1999年 | 271篇 |
1998年 | 258篇 |
1997年 | 224篇 |
1996年 | 154篇 |
1995年 | 123篇 |
1994年 | 115篇 |
1993年 | 90篇 |
1992年 | 87篇 |
1991年 | 55篇 |
1990年 | 38篇 |
1989年 | 42篇 |
1988年 | 45篇 |
1987年 | 32篇 |
1986年 | 28篇 |
1985年 | 35篇 |
1984年 | 49篇 |
1983年 | 29篇 |
1982年 | 21篇 |
1981年 | 20篇 |
1980年 | 21篇 |
1979年 | 12篇 |
1978年 | 7篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
Mani Azimi Ching-Tsun Chou Akhilesh Kumar Victor W. Lee Phamndra K. Mannava Seungjoon Park 《Formal Methods in System Design》2003,22(2):109-116
In the last three years or so we at Enterprise Platforms Group at Intel Corporation have been applying formal methods to various problems that arose during the process of defining platform architectures for Intel's processor families. In this paper we give an overview of some of the problems we have worked on, the results we have obtained, and the lessons we have learned. The last topic is addressed mainly from the perspective of platform architects. 相似文献
22.
We study epidemic schemes in the context of collaborative data delivery. In this context, multiple chunks of data reside at different nodes, and the challenge is to simultaneously deliver all chunks to all nodes. 相似文献
23.
24.
In this article we propose efficient scan path and BIST schemes for RAMs. Tools for automatic generation of these schemes have been implemented. They reduce the design effort and thus allow the designer to select the more appropriate scheme with respect to various constraints. 相似文献
25.
In this paper we propose a new protocol called time-space label switching protocol (TSL-SP) in optical burst switching (OBS), and define the terms time-space label (TSL) and time-space routing (TSR). An important concept of response time is introduced in the time label mechanism. The TSL-SP is a new technology that can quickly and efficiently forward data with a label on the optical networks. A two-dimension label switched path (TD-LSP) can be set up, that is maintained and deleted by the TSL-SP. For clearly illuminating the operation principles of the TSL-SP, we propose a new approach of orthogonal time-space coordinates in which the vertical coordinate is the space label and the horizontal coordinate is the time label. The proposed TD-LSP can dramatically reduce the routing failure probability and greatly improve the link network efficiency compared with other signaling protocols. Moreover, we define the time-space label control plane that can achieve the higher efficiency. When the TSL-SP is applied to networks, switching performance can be improved by two orders compared to the switching performance with the conventional OBS signaling protocols. The fundamental goal of TSL-SP is to band the signaling and routing functions together closely. Also, the TSL-SP can reduce the complexity of the network, support automatic service offering, and provide traffic engineering. 相似文献
26.
The search for good lineal, or depth-first, spanning trees is an important aspect in the implementation of a wide assortment of graph algorithms. We consider the complexity of findingoptimal lineal spanning trees under various notions of optimality. In particular, we show that several natural problems, such as constructing a shortest or a tallest lineal tree, are NP-hard. We also address the issue of polynomial-time, near-optimization strategies for these difficult problems, showing that efficient absolute approximation algorithms cannot exist unlessP = NP.This author's research was supported in part by the Sandia University Research Program and by the National Science Foundation under Grant M IP-8603879.This author's research was supported in part by the National Science Foundation under Grants ECS-8403859 and MIP-8603879. 相似文献
27.
Diane J. Cook 《Applied Intelligence》1991,1(2):133-144
Analogical planning provides a means of solving engineering problems where other machine learning methods fail. Unlike many machine learning paradigms, analogy does not require numerous previous examples or a rich domain theory. Instead, analogical planners adapt knowledge of solved problems in similar domains to the current problem. Unfortunately, the analogical planning task is an expensive one. While the process of forming correspondences between a known problem and a new problem is complex, the problem of selecting a base case for the analogy is virtually intractable.This paper addresses the issue of efficiently forming analogical plans. The Anagram planning system is described, which takes advantage of the massively parallel architecture of the Connection Machine to perform base selection and map formation. Anagram provides a tractable solution to analogical planning, with a complexity that is sublinear in the size of the plans.This paper describes the Anagram system and its parallel algorithms. The paper also presents theoretical analyses and empirical results of testing the system on a large database of plans from the domain of automatic programming. 相似文献
28.
Celso M. F. Lapa Cludio M. N. A. Pereira Paulo F. Frutuoso e Melo 《Reliability Engineering & System Safety》2003,81(1):103-109
In order to maximize systems average availability during a given period of time, it has recently been developed a non-periodic surveillance test optimization methodology based on genetic algorithms (GA). The fact of allowing non-periodic tests turns the solution space much more flexible and schedules can be better adjusted, providing gains in the overall system average availability, when compared to those obtained by an optimized periodic test scheme. This approach, however, turns the optimization problem more complex. Hence, the use of a powerful optimization technique, such as GA, is required.Considering that some particular features of certain systems can turn it advisable to introduce other specific constraints in the optimization problem, this work investigates the application of seasonal constraints for the set of the Emergency Diesel Generation of a typical four-loop pressurized water reactor in order to planning and optimizing its surveillance test policy. In this analysis, the growth of the blackout accident probability during summer, due to electrical power demand increases, was considered. Here, the used model penalizes surveillance test interventions when the blackout probability is higher.Results demonstrate the ability of the method in adapting the surveillance test policy to seasonal constraints. The knowledge acquired by the GA during the searching process has lead to test schedules that drastically minimize test interventions at periods of high blackout probability. It is compensated by more frequent redistributed tests through the periods of low blackout probability in order to improve on the overall average availability at the system level. 相似文献
29.
30.
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. 相似文献