全文获取类型
收费全文 | 603092篇 |
免费 | 8021篇 |
国内免费 | 1869篇 |
专业分类
电工技术 | 10252篇 |
综合类 | 2822篇 |
化学工业 | 88895篇 |
金属工艺 | 24446篇 |
机械仪表 | 18110篇 |
建筑科学 | 14709篇 |
矿业工程 | 2803篇 |
能源动力 | 15582篇 |
轻工业 | 50289篇 |
水利工程 | 6398篇 |
石油天然气 | 9658篇 |
武器工业 | 37篇 |
无线电 | 68576篇 |
一般工业技术 | 116522篇 |
冶金工业 | 105889篇 |
原子能技术 | 10776篇 |
自动化技术 | 67218篇 |
出版年
2022年 | 3167篇 |
2021年 | 4905篇 |
2020年 | 3488篇 |
2019年 | 4564篇 |
2018年 | 21337篇 |
2017年 | 20106篇 |
2016年 | 17310篇 |
2015年 | 6127篇 |
2014年 | 9430篇 |
2013年 | 24221篇 |
2012年 | 17510篇 |
2011年 | 28920篇 |
2010年 | 23444篇 |
2009年 | 22867篇 |
2008年 | 24354篇 |
2007年 | 24970篇 |
2006年 | 15604篇 |
2005年 | 15296篇 |
2004年 | 14614篇 |
2003年 | 14468篇 |
2002年 | 13128篇 |
2001年 | 12913篇 |
2000年 | 12029篇 |
1999年 | 12644篇 |
1998年 | 32860篇 |
1997年 | 22917篇 |
1996年 | 17485篇 |
1995年 | 13041篇 |
1994年 | 11295篇 |
1993年 | 10980篇 |
1992年 | 7922篇 |
1991年 | 7440篇 |
1990年 | 7262篇 |
1989年 | 7013篇 |
1988年 | 6476篇 |
1987年 | 5766篇 |
1986年 | 5655篇 |
1985年 | 6266篇 |
1984年 | 5900篇 |
1983年 | 5170篇 |
1982年 | 4900篇 |
1981年 | 4966篇 |
1980年 | 4705篇 |
1979年 | 4609篇 |
1978年 | 4409篇 |
1977年 | 5334篇 |
1976年 | 6972篇 |
1975年 | 3797篇 |
1974年 | 3550篇 |
1973年 | 3665篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
Cresswell M.W. Allen R.A. Guthrie W.F. Sniegowski J.J. Ghoshtagore R.N. Linholm L.W. 《Semiconductor Manufacturing, IEEE Transactions on》1998,11(2):182-193
The physical widths of reference features incorporated into electrical linewidth test structures patterned in films of monocrystalline silicon have been determined from Kelvin voltage measurements. The films in which the test structures are patterned are electrically insulated from the bulk-silicon substrate by a layer of silicon dioxide provided by SIMOX (Separation by the IMplantation of OXygen) processing. The motivation is to facilitate the development of linewidth reference materials for critical-dimension (CD) metrology-instrument calibration. The selection of the (110) orientation of the starting silicon and the orientation of the structures' features relative to the crystal lattice enable a lattice-plane-selective etch to generate reference-feature properties of rectangular cross section and atomically planar sidewalls. These properties are highly desirable for CD applications in which feature widths are certified with nanometer-level uncertainty for use by a diverse range of CD instruments. End applications include the development and calibration of new generations of CD instruments directed at controlling processes for manufacturing devices having sub-quarter-micrometer features 相似文献
92.
Photonic networks based on the optical path concept and wavelength division multiplexing (WDM) technology require unique operation, administration, and maintenance (OAM) functions. In order to realize the required OAM functions, the optical path network must support an effective management information transfer method. The method that superimposes a pilot tone on the optical signal appears very interesting for optical path overhead transfer. The pilot tone transmission capacity is determined by the carrier to noise ratio which depends on the power spectral density of the optical signal. The pilot tone transmission capacity of an optical path network employing WDM technology is elucidated; 4.5 kb/s transmission can be realized when the pilot tone modulation index is set at 3% 相似文献
93.
Jan van Eijck 《Formal Aspects of Computing》1994,6(1):766-787
Presuppositions of utterances are the pieces of information you convey with an utterance no matter whether your utterance is true or not. We first study presupposition in a very simple framework of updating propositional information, with examples of how presuppositions of complex propositional updates can be calculated. Next we move on to presuppositions and quantification, in the context of a dynamic version of predicate logic, suitably modified to allow for presupposition failure. In both the propositional and the quantificational case, presupposition failure can be viewed as error abortion of procedures. Thus, a dynamic assertion logic which describes the preconditions for error abortion is the suitable tool for analysing presupposition. 相似文献
94.
95.
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 相似文献
96.
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 相似文献
97.
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 相似文献
98.
A constant-time algorithm for labeling the connected components of an N×N image on a reconfigurable network of N3 processors is presented. The main contribution of the algorithm is a novel constant-time technique for determining the minimum-labeled PE in each component. The number of processors used by the algorithm can be reduced to N/sup 2+(1/d/), for any 1⩽d⩽log N, if O(d) time is allowed 相似文献
99.
Moser L.E. Melliar-Smith P.M. Agrawala V. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(5):459-473
Presents protocols for determining processor membership in asynchronous distributed systems that are subject to processor and communication faults. These protocols depend on the placement of a total order on broadcast messages. The types of systems for which each of these protocols is applicable are characterized by the properties of the communication mechanisms and by the availability of stable storage. In the absence of stable storage or of a mechanism for distinguishing promptly delivered messages, the authors show that no membership protocol can exist. They also discuss their experience in implementing these membership protocols 相似文献
100.
McKinley P.K. Xu H. Esfahanian A.-H. Ni L.M. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(12):1252-1265
Multicast communication, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is being increasingly demanded in parallel computing. System supported multicast services can potentially offer improved performance, increased functionality, and simplified programming, and may in turn be used to support various higher-level operations for data movement and global process control. This paper presents efficient algorithms to implement multicast communication in wormhole-routed direct networks, in the absence of hardware multicast support, by exploiting the properties of the switching technology. Minimum-time multicast algorithms are presented for n-dimensional meshes and hypercubes that use deterministic, dimension-ordered routing of unicast messages. Both algorithms can deliver a multicast message to m-1 destinations in [log 2 m] message passing steps, while avoiding contention among the constituent unicast messages. Performance results of implementations on a 64-node nCUBE-2 hypercube and a 168-node Symult 2010 2-D mesh are given 相似文献