全文获取类型
收费全文 | 613525篇 |
免费 | 7040篇 |
国内免费 | 2503篇 |
专业分类
电工技术 | 11094篇 |
综合类 | 800篇 |
化学工业 | 89962篇 |
金属工艺 | 24708篇 |
机械仪表 | 19339篇 |
建筑科学 | 13500篇 |
矿业工程 | 3344篇 |
能源动力 | 16611篇 |
轻工业 | 45780篇 |
水利工程 | 6554篇 |
石油天然气 | 12160篇 |
武器工业 | 56篇 |
无线电 | 73685篇 |
一般工业技术 | 123871篇 |
冶金工业 | 115676篇 |
原子能技术 | 14390篇 |
自动化技术 | 51538篇 |
出版年
2021年 | 5349篇 |
2020年 | 4069篇 |
2019年 | 5215篇 |
2018年 | 8875篇 |
2017年 | 8914篇 |
2016年 | 9525篇 |
2015年 | 6114篇 |
2014年 | 10168篇 |
2013年 | 28782篇 |
2012年 | 16308篇 |
2011年 | 22115篇 |
2010年 | 17528篇 |
2009年 | 20089篇 |
2008年 | 20519篇 |
2007年 | 20353篇 |
2006年 | 18041篇 |
2005年 | 16356篇 |
2004年 | 15843篇 |
2003年 | 15580篇 |
2002年 | 14867篇 |
2001年 | 14774篇 |
2000年 | 13898篇 |
1999年 | 14620篇 |
1998年 | 37016篇 |
1997年 | 25809篇 |
1996年 | 19809篇 |
1995年 | 14935篇 |
1994年 | 13076篇 |
1993年 | 13198篇 |
1992年 | 9450篇 |
1991年 | 8933篇 |
1990年 | 8799篇 |
1989年 | 8497篇 |
1988年 | 7987篇 |
1987年 | 7062篇 |
1986年 | 7008篇 |
1985年 | 7789篇 |
1984年 | 7136篇 |
1983年 | 6527篇 |
1982年 | 6057篇 |
1981年 | 6157篇 |
1980年 | 5898篇 |
1979年 | 5588篇 |
1978年 | 5591篇 |
1977年 | 6325篇 |
1976年 | 8298篇 |
1975年 | 4749篇 |
1974年 | 4565篇 |
1973年 | 4671篇 |
1972年 | 3919篇 |
排序方式: 共有10000条查询结果,搜索用时 13 毫秒
141.
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 相似文献
142.
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 相似文献
143.
Ju D.-C.R. Chuan-Lin Wu Carini P. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(10):1113-1120
We present a classification scheme for array language primitives that quantifies the variation in parallelism and data locality that results from the fusion of any two primitives. We also present an algorithm based on this scheme that efficiently determines when it is beneficial to fuse any two primitives. Experimental results show that five LINPACK routines report 50% performance improvement from the fusion of array operators 相似文献
144.
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 相似文献
145.
Weight smoothing to improve network generalization 总被引:2,自引:0,他引:2
A weight smoothing algorithm is proposed in this paper to improve a neural network's generalization capability. The algorithm can be used when the data patterns to be classified are presented on an n-dimensional grid (n>/=1) and there exists some correlations among neighboring data points within a pattern. For a fully-interconnected feedforward net, no such correlation information is embedded into the architecture. Consequently, the correlations can only be extracted through sufficient amount of network training. With the proposed algorithm, a smoothing constraint is incorporated into the objective function of backpropagation to reflect the neighborhood correlations and to seek those solutions that have smooth connection weights. Experiments were performed on problems of waveform classification, multifont alphanumeric character recognition, and handwritten numeral recognition. The results indicate that (1) networks trained with the algorithm do have smooth connection weights, and (2) they generalize better. 相似文献
146.
Network information criterion-determining the number of hiddenunits for an artificial neural network model 总被引:6,自引:0,他引:6
The problem of model selection, or determination of the number of hidden units, can be approached statistically, by generalizing Akaike's information criterion (AIC) to be applicable to unfaithful (i.e., unrealizable) models with general loss criteria including regularization terms. The relation between the training error and the generalization error is studied in terms of the number of the training examples and the complexity of a network which reduces to the number of parameters in the ordinary statistical theory of AIC. This relation leads to a new network information criterion which is useful for selecting the optimal network model based on a given training set. 相似文献
147.
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. 相似文献
148.
The paper presents an algebraic specification of net objects. By net objects we mean those that are defined in object-oriented paradigms and those defined with nested relations in complex database models. An algebraic specification is set up that involves structures of net objects, accesses of net objects, and some features of object-oriented programming, such as multiple inheritance and polymorphism. Objects and their relationships are then characterized formally in the modeling, which utilizes the hierarchical approach in the algebraic theory of abstract data types, and is further developed by adding mechanisms from existing object systems. Categories of net objects are presented with the properties of accesses among them 相似文献
149.
Shrivastava S.K. McCue D.L. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(4):421-432
The object-oriented approach to system structuring has found widespread acceptance among designers and developers of robust computing systems. The authors propose a system structure for distributed programming systems that support persistent objects and describe how properties such as persistence and recoverability can be implemented. The proposed structure is modular, permitting easy exploitation of any distributed computing facilities provided by the underlying system. An existing system constructed according to the principles espoused here is examined to illustrate the practical utility of the proposed approach to system structuring 相似文献
150.
A synchronizer is a compiler that transforms a program designed to run in a synchronous network into a program that runs in an asynchronous network. The behavior of a simple synchronizer, which also represents a basic mechanism for distributed computing and for the analysis of marked graphs, was studied by S. Even and S. Rajsbaum (1990) under the assumption that message transmission delays and processing times are constant. We study the behavior of the simple synchronizer when processing times and transmission delays are random. The main performance measure is the rate of a network, i.e., the average number of computational steps executed by a processor in the network per unit time. We analyze the effect of the topology and the probability distributions of the random variables on the behavior of the network. For random variables with exponential distribution, we provide tight (i.e., attainable) bounds and study the effect of a bottleneck processor on the rate 相似文献