全文获取类型
收费全文 | 741026篇 |
免费 | 10685篇 |
国内免费 | 2275篇 |
专业分类
电工技术 | 12650篇 |
综合类 | 2933篇 |
化学工业 | 109737篇 |
金属工艺 | 31361篇 |
机械仪表 | 22801篇 |
建筑科学 | 17584篇 |
矿业工程 | 4434篇 |
能源动力 | 18753篇 |
轻工业 | 58545篇 |
水利工程 | 8453篇 |
石油天然气 | 14688篇 |
武器工业 | 53篇 |
无线电 | 82525篇 |
一般工业技术 | 147290篇 |
冶金工业 | 129266篇 |
原子能技术 | 14948篇 |
自动化技术 | 77965篇 |
出版年
2021年 | 6254篇 |
2020年 | 4555篇 |
2019年 | 5869篇 |
2018年 | 23436篇 |
2017年 | 22298篇 |
2016年 | 19711篇 |
2015年 | 7533篇 |
2014年 | 11871篇 |
2013年 | 30280篇 |
2012年 | 21091篇 |
2011年 | 33505篇 |
2010年 | 27231篇 |
2009年 | 27151篇 |
2008年 | 28584篇 |
2007年 | 29167篇 |
2006年 | 19256篇 |
2005年 | 18645篇 |
2004年 | 17679篇 |
2003年 | 17552篇 |
2002年 | 16122篇 |
2001年 | 15934篇 |
2000年 | 14827篇 |
1999年 | 15455篇 |
1998年 | 39454篇 |
1997年 | 27686篇 |
1996年 | 21225篇 |
1995年 | 15891篇 |
1994年 | 13859篇 |
1993年 | 13727篇 |
1992年 | 10005篇 |
1991年 | 9588篇 |
1990年 | 9268篇 |
1989年 | 8996篇 |
1988年 | 8465篇 |
1987年 | 7523篇 |
1986年 | 7491篇 |
1985年 | 8334篇 |
1984年 | 7781篇 |
1983年 | 7016篇 |
1982年 | 6550篇 |
1981年 | 6599篇 |
1980年 | 6412篇 |
1979年 | 6316篇 |
1978年 | 6106篇 |
1977年 | 7179篇 |
1976年 | 9118篇 |
1975年 | 5386篇 |
1974年 | 5064篇 |
1973年 | 5250篇 |
1972年 | 4386篇 |
排序方式: 共有10000条查询结果,搜索用时 718 毫秒
991.
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. 相似文献
992.
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. 相似文献
993.
994.
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 相似文献
995.
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 相似文献
996.
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 相似文献
997.
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 相似文献
998.
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 相似文献
999.
Considers the applicability of algorithm based fault tolerance (ABET) to massively parallel scientific computation. Existing ABET schemes can provide effective fault tolerance at a low cost For computation on matrices of moderate size; however, the methods do not scale well to floating-point operations on large systems. This short note proposes the use of a partitioned linear encoding scheme to provide scalability. Matrix algorithms employing this scheme are presented and compared to current ABET schemes. It is shown that the partitioned scheme provides scalable linear codes with improved numerical properties with only a small increase in hardware and time overhead 相似文献
1000.
Nicol D.M. Greenberg A.G. Lubachevsky B.D. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(8):849-859
Considers the use of massively parallel architectures to execute a trace-driven simulation of a single cache set. A method is presented for the least-recently-used (LRU) policy, which, regardless of the set size C, runs in time O(log N) using N processors on the EREW (exclusive read, exclusive write) parallel model. A simpler LRU simulation algorithm is given that runs in O(C log N) time using N/log N processors. We present timings of this algorithm's implementation on the MasPar MP-1, a machine with 16384 processors. A broad class of reference-based line replacement policies are considered, which includes LRU as well as the least-frequently-used (LFU) and random replacement policies. A simulation method is presented for any such policy that, on any trace of length N directed to a C line set, runs in O(C log N) time with high probability using N processors on the EREW model. The algorithms are simple, have very little space overhead, and are well suited for SIMD implementation 相似文献