全文获取类型
收费全文 | 331361篇 |
免费 | 2605篇 |
国内免费 | 669篇 |
专业分类
电工技术 | 4827篇 |
综合类 | 2406篇 |
化学工业 | 51471篇 |
金属工艺 | 19888篇 |
机械仪表 | 13072篇 |
建筑科学 | 6310篇 |
矿业工程 | 4349篇 |
能源动力 | 4957篇 |
轻工业 | 13231篇 |
水利工程 | 5337篇 |
石油天然气 | 13359篇 |
武器工业 | 28篇 |
无线电 | 29270篇 |
一般工业技术 | 78551篇 |
冶金工业 | 34714篇 |
原子能技术 | 11393篇 |
自动化技术 | 41472篇 |
出版年
2021年 | 2778篇 |
2019年 | 2744篇 |
2018年 | 19608篇 |
2017年 | 18798篇 |
2016年 | 15868篇 |
2015年 | 3667篇 |
2014年 | 5566篇 |
2013年 | 10302篇 |
2012年 | 10387篇 |
2011年 | 18150篇 |
2010年 | 15432篇 |
2009年 | 13573篇 |
2008年 | 14811篇 |
2007年 | 15514篇 |
2006年 | 6495篇 |
2005年 | 6736篇 |
2004年 | 6570篇 |
2003年 | 6438篇 |
2002年 | 5660篇 |
2001年 | 5048篇 |
2000年 | 5131篇 |
1999年 | 4324篇 |
1998年 | 7242篇 |
1997年 | 5875篇 |
1996年 | 4465篇 |
1995年 | 3664篇 |
1994年 | 3433篇 |
1993年 | 3631篇 |
1992年 | 3226篇 |
1991年 | 3381篇 |
1990年 | 3482篇 |
1989年 | 3370篇 |
1988年 | 3278篇 |
1987年 | 3260篇 |
1986年 | 3157篇 |
1985年 | 3314篇 |
1984年 | 3254篇 |
1983年 | 3147篇 |
1982年 | 2996篇 |
1981年 | 3047篇 |
1980年 | 3072篇 |
1979年 | 3259篇 |
1978年 | 3493篇 |
1977年 | 3460篇 |
1976年 | 3913篇 |
1975年 | 3210篇 |
1974年 | 3297篇 |
1973年 | 3343篇 |
1972年 | 2987篇 |
1971年 | 2754篇 |
排序方式: 共有10000条查询结果,搜索用时 8 毫秒
41.
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. 相似文献
42.
43.
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 相似文献
44.
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 相似文献
45.
Implementing a neural network on a digital or mixed analog and digital chip yields the quantization of the synaptic weights dynamics. This paper addresses this topic in the case of Kohonen's self-organizing maps. We first study qualitatively how the quantization affects the convergence and the properties, and deduce from this analysis the way to choose the parameters of the network (adaptation gain and neighborhood). We show that a spatially decreasing neighborhood function is far more preferable than the usually rectangular neighborhood function, because of the weight quantization. Based on these results, an analog nonlinear network, integrated in a standard CMOS technology, and implementing this spatially decreasing neighborhood function is then presented. It can be used in a mixed analog and digital circuit implementation. 相似文献
46.
The bounded disorder file organization proposed by W. Litwin and D.B. Lomet (1987) uses a combination of hashing and tree indexing. Lomet provided an approximate analysis with the mention of the difficulty involved in exact modeling of data nodes, which motivated this work. In an earlier paper (M.V. Ramakrishna and P. Mukhopadhyay, 1988) we provided an exact model and analysis of the data nodes, which is based on the solution of a classical sequential occupancy problem. After summarizing the analysis of data nodes, an alternate file growth method based on repeated trials using universal hashing is proposed and analyzed. We conclude that the alternate file growth method provides simplicity and significant improvement in storage utilization 相似文献
47.
We describe a binding environment for the AND and OR parallel execution of logic programs that is suitable for both shared and nonshared memory multiprocessors. The binding environment was designed with a view of rendering a compiler using this binding environment machine independent. The binding environment is similar to closed environments proposed by J. Conery. However, unlike Conery's scheme, it supports OR and independent AND parallelism on both types of machines. The term representation, the algorithms for unification and the join algorithms for parallel AND branches are presented in this paper. We also detail the differences between our scheme and Conery's scheme. A compiler based on this binding environment has been implemented on a platform for machine independent parallel programming called the Chare Kernel 相似文献
48.
This paper proposes a system based on a parallel genetic algorithm with enhanced encoding and operational abilities. The system, used to evolve feedforward artificial neural networks, has been applied to two widely different problem areas: Boolean function learning and robot control. It is shown that the good results obtained in both cases are due to two factors: first, the enhanced exploration abilities provided by the search-space reducing evolution of both coding granularity and network topology, and, second, the enhanced exploitational abilities due to a recently proposed cooperative local optimizing genetic operator. 相似文献
49.
What is the implication for business when information technology (IT) changes in the workplace without a commensurate change in the composition of business programs educating tomorrow's employees? A survey of MBA graduates forms the basis of this article on the IT skills needed in the marketplace. 相似文献
50.