全文获取类型
收费全文 | 721406篇 |
免费 | 9203篇 |
国内免费 | 1352篇 |
专业分类
电工技术 | 13167篇 |
综合类 | 702篇 |
化学工业 | 114970篇 |
金属工艺 | 28592篇 |
机械仪表 | 22658篇 |
建筑科学 | 16593篇 |
矿业工程 | 5051篇 |
能源动力 | 17907篇 |
轻工业 | 62504篇 |
水利工程 | 8457篇 |
石油天然气 | 17057篇 |
武器工业 | 65篇 |
无线电 | 75916篇 |
一般工业技术 | 143330篇 |
冶金工业 | 127994篇 |
原子能技术 | 17542篇 |
自动化技术 | 59456篇 |
出版年
2021年 | 6608篇 |
2019年 | 6346篇 |
2018年 | 10765篇 |
2017年 | 11003篇 |
2016年 | 11515篇 |
2015年 | 7280篇 |
2014年 | 12284篇 |
2013年 | 32672篇 |
2012年 | 19323篇 |
2011年 | 26128篇 |
2010年 | 20905篇 |
2009年 | 23325篇 |
2008年 | 23754篇 |
2007年 | 23525篇 |
2006年 | 20645篇 |
2005年 | 18556篇 |
2004年 | 17728篇 |
2003年 | 17306篇 |
2002年 | 16836篇 |
2001年 | 16338篇 |
2000年 | 15753篇 |
1999年 | 15542篇 |
1998年 | 36436篇 |
1997年 | 26215篇 |
1996年 | 20413篇 |
1995年 | 15756篇 |
1994年 | 14161篇 |
1993年 | 13862篇 |
1992年 | 10844篇 |
1991年 | 10332篇 |
1990年 | 10367篇 |
1989年 | 10117篇 |
1988年 | 9741篇 |
1987年 | 8711篇 |
1986年 | 8538篇 |
1985年 | 9733篇 |
1984年 | 8948篇 |
1983年 | 8443篇 |
1982年 | 7696篇 |
1981年 | 7827篇 |
1980年 | 7544篇 |
1979年 | 7524篇 |
1978年 | 7446篇 |
1977年 | 8280篇 |
1976年 | 10484篇 |
1975年 | 6724篇 |
1974年 | 6415篇 |
1973年 | 6534篇 |
1972年 | 5587篇 |
1971年 | 5199篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
We develop a characterization for m-fault-tolerant extensions, and for optimal m-fault-tolerant extensions, of a complete multipartite graph. Our formulation shows that this problem is equivalent to an interesting combinatorial problem on the partitioning of integers. This characterization leads to a new procedure for constructing an optimal m-fault-tolerant extension of any complete multipartite graph, for any m⩾0. The proposed procedure is mainly useful when the size of the graph is relatively small, because the search time required is exponential. This exponential search, however, is not always necessary. We prove several necessary conditions that help us, in several cases, to identify some optimal m-fault-tolerant extensions without performing any search 相似文献
992.
Studies the complexity of the problem of allocating m modules to n processors in a distributed system to minimize total communication and execution costs. When the communication graph is a tree, Bokhari has shown that the optimum allocation can be determined in O(mn2) time. Recently, this result has been generalized by Fernandez-Baca, who has proposed an allocation algorithm in O(mnk+1) when the communication graph is a partial k-tree. The author shows that in the case where communication costs are uniform, the module allocation problem can be solved in O(mn) time if the communication graph is a tree. This algorithm is asymptotically optimum 相似文献
993.
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 相似文献
994.
Pipelining and bypassing in a VLIW processor 总被引:1,自引:0,他引:1
This short note describes issues involved in the bypassing mechanism for a very long instruction word (VLIW) processor and its relation to the pipeline structure of the processor. The authors first describe the pipeline structure of their processor and analyze its performance and compare it to typical RISC-style pipeline structures given the context of a processor with multiple functional units. Next they study the performance effects of various bypassing schemes in terms of their effectiveness in resolving pipeline data hazards and their effect on the processor cycle time 相似文献
995.
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 相似文献
996.
We consider the design problem for a class of discrete-time and continuous-time neural networks. We obtain a characterization of all connection weights that store a given set of vectors into the network, that is, each given vector becomes an equilibrium point of the network. We also give sufficient conditions that guarantee the asymptotic stability of these equilibrium points. 相似文献
997.
Nonlinear adaptive filters based on a variety of neural network models have been used successfully for system identification and noise-cancellation in a wide class of applications. An important problem in data communications is that of channel equalization, i.e., the removal of interferences introduced by linear or nonlinear message corrupting mechanisms, so that the originally transmitted symbols can be recovered correctly at the receiver. In this paper we introduce an adaptive recurrent neural network (RNN) based equalizer whose small size and high performance makes it suitable for high-speed channel equalization. We propose RNN based structures for both trained adaptation and blind equalization, and we evaluate their performance via extensive simulations for a variety of signal modulations and communication channel models. It is shown that the RNN equalizers have comparable performance with traditional linear filter based equalizers when the channel interferences are relatively mild, and that they outperform them by several orders of magnitude when either the channel's transfer function has spectral nulls or severe nonlinear distortion is present. In addition, the small-size RNN equalizers, being essentially generalized IIR filters, are shown to outperform multilayer perceptron equalizers of larger computational complexity in linear and nonlinear channel equalization cases. 相似文献
998.
This paper addresses the existence of loop gain-phase shaping (LGPS) solutions for the design of robust digital control systems for SISO, minimum-phase, continuous-time processes with parametric uncertainty. We develop the frequency response properties of LGPS for discrete-time systems using the Δ-transform, a transform method that applies to both continuous-time and discrete-time systems. A theorem is presented which demonstrates that for reasonable specifications there always exists a sampling period such that the robust digital control problem has a solution. Finally, we offer a procedure for estimating the maximum feasible sampling period for LGPS solutions to robust digital control problems. 相似文献
999.
Anthony E. Bentley 《国际强度与非线性控制杂志
》1994,4(1):119-160
》1994,4(1):119-160
Two different control systems were developed using quantitative feedback theory for weld quality improvement. The first application to be discussed was designed for the resistance pinch welding process and uses electrode displacement and force as feedback parameters. A correlation between weld quality and electrode displacement is established for constant electrode force. The system is capable of producing repeatable welds of consistent quality, with wide variations in weld parameters. This is the first time feedback control has been successfully applied to pinch welding. The second example presented in this paper was developed for penetration control of the gas-tungsten-arc welding process. The feedback signal is obtained by measuring the amount of light emitted from the back side of the weld. Welds of constant penetration have been demonstrated in tests with travel speeds varying from 1.5 to 6 inches per minute and with 200 per cent changes in part thickness. 相似文献
1000.
Russel B. Miller Isaac M. Horowitz Constantine H. Houpis A. Finley Barfield 《国际强度与非线性控制杂志
》1994,4(1):211-230
》1994,4(1):211-230
Nonlinear quantitative feedback theory (QFT) and pilot compensation techniques are used to design a 2 × 2 flight control system for the YF-16 aircraft over a large range of plant uncertainty. The design is based on numerical input-output time histories generated with a FORTRAN implemented nonlinear simulation of the YF-16. The first step of the design process is the generation of a set of equivalent linear time-invariant (LTI) plant models to represent the actual nonlinear plant. It has been proven that the solution to the equivalent plant problem is guaranteed to solve the original nonlinear problem. Standard QFT techniques are then used in the design synthesis based on the equivalent plant models. A detailed mathematical development of the method used to develop these equivalent LTI plant models is provided. After this inner-loop design, pilot compensation is developed to reduce the pilot's workload. This outer-loop design is also based on a set of equivalent LTI plant models. This is accomplished by modelling the pilot with parameters that result in good handling qualities ratings, and developing the necessary compensation to force the desired system responses. 相似文献