全文获取类型
收费全文 | 368335篇 |
免费 | 3991篇 |
国内免费 | 1217篇 |
专业分类
电工技术 | 5761篇 |
综合类 | 2464篇 |
化学工业 | 56237篇 |
金属工艺 | 16497篇 |
机械仪表 | 11548篇 |
建筑科学 | 8955篇 |
矿业工程 | 2385篇 |
能源动力 | 7814篇 |
轻工业 | 29306篇 |
水利工程 | 4412篇 |
石油天然气 | 7416篇 |
武器工业 | 16篇 |
无线电 | 40435篇 |
一般工业技术 | 72439篇 |
冶金工业 | 53810篇 |
原子能技术 | 7774篇 |
自动化技术 | 46274篇 |
出版年
2021年 | 2098篇 |
2018年 | 17701篇 |
2017年 | 16610篇 |
2016年 | 13605篇 |
2015年 | 3047篇 |
2014年 | 4443篇 |
2013年 | 12196篇 |
2012年 | 9846篇 |
2011年 | 18289篇 |
2010年 | 15534篇 |
2009年 | 13982篇 |
2008年 | 15434篇 |
2007年 | 16306篇 |
2006年 | 7932篇 |
2005年 | 8455篇 |
2004年 | 7875篇 |
2003年 | 7657篇 |
2002年 | 7133篇 |
2001年 | 6587篇 |
2000年 | 6345篇 |
1999年 | 6279篇 |
1998年 | 14795篇 |
1997年 | 11049篇 |
1996年 | 8608篇 |
1995年 | 6532篇 |
1994年 | 5924篇 |
1993年 | 5796篇 |
1992年 | 4490篇 |
1991年 | 4462篇 |
1990年 | 4284篇 |
1989年 | 4301篇 |
1988年 | 4264篇 |
1987年 | 3598篇 |
1986年 | 3595篇 |
1985年 | 4163篇 |
1984年 | 3965篇 |
1983年 | 3620篇 |
1982年 | 3422篇 |
1981年 | 3558篇 |
1980年 | 3422篇 |
1979年 | 3365篇 |
1978年 | 3445篇 |
1977年 | 3923篇 |
1976年 | 5037篇 |
1975年 | 3158篇 |
1974年 | 3007篇 |
1973年 | 3024篇 |
1972年 | 2651篇 |
1971年 | 2473篇 |
1970年 | 2104篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
102.
In order to observe the transport ability of peritoneum to small molecular substances, peritoneal equilibration test (PET) was performed in 52 CAPD patients. By analysing the relationship between peritoneal transport function and dialysis adequacy, we found the average urea KT/V and Cr were significantly lower in high and low transport groups (n = 6 and n = 2) than in high average and low average groups (n = 35 and n = 9). According to the results of PET, we adjusted the dialysis program of 11 patients and the dialysis adequacy was markedly improved. We concluded that PET was helpful for selecting and adjusting CAPD program, and discussed some questions which should be payed more attention in PET operation. 相似文献
103.
For part I see, ibid., p. 134, 1998. The basic approach outlined in the previous article is applied to the difficult problem of computing the optical modes of a vertical-cavity surface-emitting laser. The formulation utilizes a finite difference equation based upon the lowest order term of an infinite series solution of the scalar Helmholtz equation in a local region. This difference equation becomes exact in the one-dimensional (1-D) limit, and is thus ideally suited for nearly 1-D devices such as vertical-cavity lasers. The performance of the resulting code is tested on both a simple cylindrical cavity with known solutions and an oxide-confined vertical-cavity laser structure, and the results compared against second-order-accurate code based upon Crank-Nicolson differencing 相似文献
104.
Local autonomous dynamic channel allocation (LADCA) including power control is essential to accommodating the anticipated explosion of demand for wireless. The authors simulate call performance for users accessing channels in a regular cellular array with a base located at the center of each hexagon. The computer model includes stochastic channel demand and a propagation environment characterized by attenuation with distance as well as shadow fading. The study of LADCA shows that distributed power control and channel access can be combined in an access management policy that achieves satisfactory system capacity and provides desired call performance. The authors report: LADCA/power control is observed to be stable alleviating a major concern about users unaware of the signal to interference problems their presence on a channel might cause to others. There can be substantial inadvertent dropping of calls in progress caused by originating calls. Modeling user time dynamics is essential. LADCA contrasts very favorably with fixed channel allocation (FCA) in a comparative example 相似文献
105.
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. 相似文献
106.
107.
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 相似文献
108.
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 相似文献
109.
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 相似文献
110.
We present new methods for load balancing of unstructured tree computations on large-scale SIMD machines, and analyze the scalability of these and other existing schemes. An efficient formulation of tree search on an SIMD machine consists of two major components: a triggering mechanism, which determines when the search space redistribution must occur to balance the search space over processors, and a scheme to redistribute the search space. We have devised a new redistribution mechanism and a new triggering mechanism. Either of these can be used in conjunction with triggering and redistribution mechanisms developed by other researchers. We analyze the scalability of these mechanisms and verify the results experimentally. The analysis and experiments show that our new load-balancing methods are highly scalable on SIMD architectures. Their scalability is shown to he no worse than that of the best load-balancing schemes on MIMD architectures. We verify our theoretical results by implementing the 15-puzzle problem on a CM-2 SIMD parallel computer 相似文献