全文获取类型
收费全文 | 476088篇 |
免费 | 15279篇 |
国内免费 | 6891篇 |
专业分类
电工技术 | 13474篇 |
技术理论 | 9篇 |
综合类 | 11122篇 |
化学工业 | 75282篇 |
金属工艺 | 23006篇 |
机械仪表 | 19612篇 |
建筑科学 | 17208篇 |
矿业工程 | 5737篇 |
能源动力 | 9775篇 |
轻工业 | 37459篇 |
水利工程 | 6714篇 |
石油天然气 | 14142篇 |
武器工业 | 1081篇 |
无线电 | 50266篇 |
一般工业技术 | 84113篇 |
冶金工业 | 57604篇 |
原子能技术 | 10127篇 |
自动化技术 | 61527篇 |
出版年
2022年 | 5800篇 |
2021年 | 8107篇 |
2020年 | 5997篇 |
2019年 | 5843篇 |
2018年 | 21869篇 |
2017年 | 21288篇 |
2016年 | 17824篇 |
2015年 | 8232篇 |
2014年 | 11016篇 |
2013年 | 18734篇 |
2012年 | 18216篇 |
2011年 | 26999篇 |
2010年 | 22699篇 |
2009年 | 20579篇 |
2008年 | 22032篇 |
2007年 | 22600篇 |
2006年 | 14005篇 |
2005年 | 13172篇 |
2004年 | 11392篇 |
2003年 | 11189篇 |
2002年 | 10732篇 |
2001年 | 9760篇 |
2000年 | 9102篇 |
1999年 | 8524篇 |
1998年 | 15101篇 |
1997年 | 10968篇 |
1996年 | 8761篇 |
1995年 | 6987篇 |
1994年 | 6116篇 |
1993年 | 5784篇 |
1992年 | 4778篇 |
1991年 | 4376篇 |
1990年 | 4548篇 |
1989年 | 4334篇 |
1988年 | 4089篇 |
1987年 | 3604篇 |
1986年 | 3573篇 |
1985年 | 3967篇 |
1984年 | 3809篇 |
1983年 | 3441篇 |
1982年 | 3287篇 |
1981年 | 3371篇 |
1980年 | 3234篇 |
1979年 | 3255篇 |
1978年 | 3321篇 |
1977年 | 3569篇 |
1976年 | 4435篇 |
1975年 | 2951篇 |
1974年 | 2813篇 |
1973年 | 2949篇 |
排序方式: 共有10000条查询结果,搜索用时 9 毫秒
111.
112.
超媒体系统中的人工智能方法 总被引:3,自引:0,他引:3
一、什么是超媒体近年来迅速崛起的多媒体(multimedia)技术,是一种使计算机具有交互式地综合处理和管理文字、图形、图象、声音、视频等多种媒体能力的技术,必将使计算机技术发生一 相似文献
113.
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. 相似文献
114.
115.
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 相似文献
116.
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 相似文献
117.
Arguello F. Bruguera J.D. Doallo R. Zapata E.L. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(10):1091-1099
We present an unified parallel architecture for four of the most important fast orthogonal transforms with trigonometric kernel: Complex Valued Fourier (CFFT), Real Valued Fourier (RFFT), Hartley (FHT), and Cosine (FCT). Out of these, only the CFFT has a data flow coinciding with the one generated by the successive doubling method, which can be transformed on a constant geometry flow using perfect unshuffle or shuffle permutations. The other three require some type of hardware modification to guarantee the constant geometry of the successive doubling method. We have defined a generalized processing section (PS), based on a circular CORDIC rotator, for the four transforms. This PS section permits the evaluation of the CFFT and FCT transforms in n data recirculations and the RFFT and FHT transforms in n-1 data recirculations, with n being the number of stages of a transform of length N=rn. Also, the efficiency of the partitioned parallel architecture is optimum because there is no cycle loss in the systolic computation of all the butterflies for each of the four transforms 相似文献
118.
Fernandez E.B. Gudes E. Haiyan Song 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(2):275-292
The integration of object-oriented programming concepts with databases is one of the most significant advances in the evolution of database systems. Many aspects of such a combination have been studied, but there are few models to provide security for this richly structured information. We develop an authorization model for object-oriented databases. This model consists of a set of policies, a structure for authorization rules, and algorithms to evaluate access requests against the authorization rules. User access policies are based on the concept of inherited authorization applied along the class structure hierarchy. We propose also a set of administrative policies that allow the control of user access and its decentralization. Finally, we study the effect of class structuring changes on authorization 相似文献
119.
Malloy B.A. Lloyd E.L. Soffa M.L. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(5):498-508
A new approach is given for scheduling a sequential instruction stream for execution “in parallel” on asynchronous multiprocessors. The key idea in our approach is to exploit the fine grained parallelism present in the instruction stream. In this context, schedules are constructed by a careful balancing of execution and communication costs at the level of individual instructions, and their data dependencies. Three methods are used to evaluate our approach. First, several existing methods are extended to the fine grained situation. Our approach is then compared to these methods using both static schedule length analyses, and simulated executions of the scheduled code. In each instance, our method is found to provide significantly shorter schedules. Second, by varying parameters such as the speed of the instruction set, and the speed/parallelism in the interconnection structure, simulation techniques are used to examine the effects of various architectural considerations on the executions of the schedules. These results show that our approach provides significant speedups in a wide-range of situations. Third, schedules produced by our approach are executed on a two-processor Data General shared memory multiprocessor system. These experiments show that there is a strong correlation between our simulation results, and these actual executions, and thereby serve to validate the simulation studies. Together, our results establish that fine grained parallelism can be exploited in a substantial manner when scheduling a sequential instruction stream for execution “in parallel” on asynchronous multiprocessors 相似文献
120.
We present the design of E-kernel, an embedding kernel on the Victor V256 message-passing partitionable multiprocessor, developed for the support of program mapping and network reconfiguration. E-kernel supports the embedding of a new network topology onto Victor's 2D mesh and also the embedding of a task graph onto the 2D mesh network or the reconfigured network. In the current implementation, the reconfigured network can be a line or an even-size ring, and the task graphs meshes or tori of a variety of dimensions and shapes or graphs with similar topologies. For application programs having these task graph topologies and that are designed according to the communication model of E-kernel, they can be run without any change on partitions connected by the 2D mesh, line, or ring. Further, E-kernel attempts the communication optimization of these programs on the different networks automatically, thus making both the network topology and the communication optimization attempt completely transparent to the application programs. Many of the embeddings used in E-kernel are optimal or asymptotically optimal (with respect to minimum dilation cost). The implementation of E-kernel translated some of the many theoretical results in graph embeddings into practical tools for program mapping and network reconfiguration in a parallel system. E-kernel is functional on Victor V256. Measurements of E-kernel's performance on V256 are also included 相似文献