全文获取类型
收费全文 | 621338篇 |
免费 | 8174篇 |
国内免费 | 1906篇 |
专业分类
电工技术 | 11383篇 |
综合类 | 462篇 |
化学工业 | 93949篇 |
金属工艺 | 25065篇 |
机械仪表 | 19582篇 |
建筑科学 | 14005篇 |
矿业工程 | 3581篇 |
能源动力 | 16712篇 |
轻工业 | 49264篇 |
水利工程 | 6644篇 |
石油天然气 | 12854篇 |
武器工业 | 28篇 |
无线电 | 72286篇 |
一般工业技术 | 124819篇 |
冶金工业 | 115819篇 |
原子能技术 | 14214篇 |
自动化技术 | 50751篇 |
出版年
2021年 | 5331篇 |
2020年 | 4119篇 |
2019年 | 5174篇 |
2018年 | 8947篇 |
2017年 | 8875篇 |
2016年 | 9594篇 |
2015年 | 6084篇 |
2014年 | 10087篇 |
2013年 | 29058篇 |
2012年 | 16200篇 |
2011年 | 21991篇 |
2010年 | 17621篇 |
2009年 | 20054篇 |
2008年 | 20550篇 |
2007年 | 20227篇 |
2006年 | 18026篇 |
2005年 | 16408篇 |
2004年 | 15468篇 |
2003年 | 15311篇 |
2002年 | 14742篇 |
2001年 | 14552篇 |
2000年 | 13724篇 |
1999年 | 14183篇 |
1998年 | 35739篇 |
1997年 | 25313篇 |
1996年 | 19535篇 |
1995年 | 14645篇 |
1994年 | 13017篇 |
1993年 | 12905篇 |
1992年 | 9503篇 |
1991年 | 9068篇 |
1990年 | 8976篇 |
1989年 | 8699篇 |
1988年 | 8428篇 |
1987年 | 7204篇 |
1986年 | 7170篇 |
1985年 | 8132篇 |
1984年 | 7575篇 |
1983年 | 6899篇 |
1982年 | 6445篇 |
1981年 | 6563篇 |
1980年 | 6173篇 |
1979年 | 6027篇 |
1978年 | 6150篇 |
1977年 | 7015篇 |
1976年 | 9047篇 |
1975年 | 5398篇 |
1974年 | 5070篇 |
1973年 | 5203篇 |
1972年 | 4424篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
891.
in the above paper Yu (IEEE Trans. Neural Networks, vol.3, no.6, p.1019-21 (1992)) claims to prove that local minima do not exist in the error surface of backpropagation networks being trained on data with t distinct input patterns when the network is capable of exactly representing arbitrary mappings on t input patterns. The commenter points out that the proof presented is flawed, so that the resulting claims remain unproved. In reply, Yu points out that the undesired phenomenon that was sited can be avoided by simply imposing the arbitrary mapping capacity of the network on lemma 1 in the article. 相似文献
892.
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. 相似文献
893.
894.
Volcano-an extensible and parallel query evaluation system 总被引:2,自引:0,他引:2
To investigate the interactions of extensibility and parallelism in database query processing, we have developed a new dataflow query execution system called Volcano. The Volcano effort provides a rich environment for research and education in database systems design, heuristics for query optimization, parallel query execution, and resource allocation. Volcano uses a standard interface between algebra operators, allowing easy addition of new operators and operator implementations. Operations on individual items, e.g., predicates, are imported into the query processing operators using support functions. The semantics of support functions is not prescribed; any data type including complex objects and any operation can be realized. Thus, Volcano is extensible with new operators, algorithms, data types, and type-specific methods. Volcano includes two novel meta-operators. The choose-plan meta-operator supports dynamic query evaluation plans that allow delaying selected optimization decisions until run-time, e.g., for embedded queries with free variables. The exchange meta-operator supports intra-operator parallelism on partitioned datasets and both vertical and horizontal inter-operator parallelism, translating between demand-driven dataflow within processes and data-driven dataflow between processes. All operators, with the exception of the exchange operator, have been designed and implemented in a single-process environment, and parallelized using the exchange operator. Even operators not yet designed can be parallelized using this new operator if they use and provide the interator interface. Thus, the issues of data manipulation and parallelism have become orthogonal, making Volcano the first implemented query execution engine that effectively combines extensibility and parallelism 相似文献
895.
Taking advantage of the structure of logical representations, we report an algorithm that evaluates conjunctive queries in a massively parallel environment under an object-based representation for deductive databases. By distributing objects in a database, we show that parallel evaluation of a query can be achieved in a cooperative way so that the conventional tuple-by-tuple, operation-by-operation evaluation strategy can be replaced by a global, parallel matching approach. With the proposed scheme, all conjuncts of a given query can be examined at the same time, which enables us to eliminate the need of any temporary relation. On the other hand, compared with the interpretive method, we show that any data dependency imposed by shared variables is no longer a major problem in achieving AND-parallelism by the proposed scheme 相似文献
896.
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 相似文献
897.
A standard relation has two dimensions: attributes and tuples. A temporal relation contains two additional orthogonal time dimensions: valid time records when facts are true in the modeled reality, and transaction time records when facts are stored in the temporal relation. Although there are no restrictions between the valid time and transaction time associated with each fact, in many practical applications the valid and transaction times exhibit restricted interrelationships that define several types of specialized temporal relations. This paper examines areas where different specialized temporal relations are present. In application systems with multiple, interconnected temporal relations, multiple time dimensions may be associated with facts as they flow from one temporal relation to another. The paper investigates several aspects of the resulting generalized temporal relations, including the ability to query a predecessor relation from a successor relation. The presented framework for generalization and specialization allows one to precisely characterize and compare temporal relations and the application systems in which they are embedded. The framework's comprehensiveness and its use in understanding temporal relations are demonstrated by placing previously proposed temporal data models within the framework. The practical relevance of the defined specializations and generalizations is illustrated by sample realistic applications in which they occur. The additional semantics of specialized relations are especially useful for improving the performance of query processing 相似文献
898.
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 相似文献
899.
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 相似文献
900.
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 相似文献