全文获取类型
收费全文 | 665067篇 |
免费 | 8672篇 |
国内免费 | 1914篇 |
专业分类
电工技术 | 12001篇 |
综合类 | 645篇 |
化学工业 | 99115篇 |
金属工艺 | 25461篇 |
机械仪表 | 19320篇 |
建筑科学 | 16085篇 |
矿业工程 | 3303篇 |
能源动力 | 18111篇 |
轻工业 | 58318篇 |
水利工程 | 6805篇 |
石油天然气 | 11922篇 |
武器工业 | 43篇 |
无线电 | 75560篇 |
一般工业技术 | 128814篇 |
冶金工业 | 130963篇 |
原子能技术 | 13766篇 |
自动化技术 | 55421篇 |
出版年
2021年 | 5958篇 |
2020年 | 4311篇 |
2019年 | 5549篇 |
2018年 | 9461篇 |
2017年 | 9289篇 |
2016年 | 9752篇 |
2015年 | 6752篇 |
2014年 | 11219篇 |
2013年 | 30458篇 |
2012年 | 17813篇 |
2011年 | 24620篇 |
2010年 | 19450篇 |
2009年 | 21914篇 |
2008年 | 22400篇 |
2007年 | 22066篇 |
2006年 | 19259篇 |
2005年 | 17671篇 |
2004年 | 16958篇 |
2003年 | 16754篇 |
2002年 | 15735篇 |
2001年 | 15958篇 |
2000年 | 14989篇 |
1999年 | 15885篇 |
1998年 | 40665篇 |
1997年 | 28644篇 |
1996年 | 21971篇 |
1995年 | 16348篇 |
1994年 | 14370篇 |
1993年 | 13956篇 |
1992年 | 10201篇 |
1991年 | 9630篇 |
1990年 | 9377篇 |
1989年 | 9149篇 |
1988年 | 8570篇 |
1987年 | 7591篇 |
1986年 | 7338篇 |
1985年 | 8293篇 |
1984年 | 7770篇 |
1983年 | 6966篇 |
1982年 | 6443篇 |
1981年 | 6624篇 |
1980年 | 6212篇 |
1979年 | 6189篇 |
1978年 | 6014篇 |
1977年 | 7104篇 |
1976年 | 9484篇 |
1975年 | 5169篇 |
1974年 | 4871篇 |
1973年 | 4950篇 |
1972年 | 4062篇 |
排序方式: 共有10000条查询结果,搜索用时 16 毫秒
131.
Weijia Shang O'Keefe M.T. Fortes J.A.B. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(2):193-204
This paper describes several loop transformation techniques for extracting parallelism from nested loop structures. Nested loops can then be scheduled to run in parallel so that execution time is minimized. One technique is called selective cycle shrinking, and the other is called true dependence cycle shrinking. It is shown how selective shrinking is related to linear scheduling of nested loops and how true dependence shrinking is related to conflict-free mappings of higher dimensional algorithms into lower dimensional processor arrays. Methods are proposed in this paper to find the selective and true dependence shrinkings with minimum total execution time by applying the techniques of finding optimal linear schedules and optimal and conflict-free mappings proposed by W. Shang and A.B. Fortes 相似文献
132.
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 相似文献
133.
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 相似文献
134.
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. 相似文献
135.
136.
Neural network control of communications systems 总被引:1,自引:0,他引:1
Neural networks appear well suited to applications in the control of communications systems for two reasons: adaptivity and high speed. This paper describes application of neural networks to two problems, admission control and switch control, which exploit the adaptivity and speed property, respectively. The admission control problem is the selective admission of a set of calls from a number of inhomogeneous call classes, which may have widely differing characteristics as to their rate and variability of traffic, onto a network. It is usually unknown in advance which combinations of calls can be simultaneously accepted so as to ensure satisfactory performance. The approach adopted is that key network performance parameters are observed while carrying various combinations of calls, and their relationship is learned by a neural network structure. The network model chosen has the ability to interpolate or extrapolate from the past results and the ability to adapt to new and changing conditions. The switch control problem is the service policy used by a switch controller in transmitting packets. In a crossbar switch with input queueing, significant loss of throughput can occur when head-of-line service order is employed. A solution can be based on an algorithm which maximizes throughput. However since this solution is typically required in less than one microsecond, software implementation policy is infeasible. We will carry out an analysis of the benefits of such a policy, describe some existing proposed schemes for its implementation, and propose a further scheme that provides this submicrosecond optimization. 相似文献
137.
Control law design for rotorcraft fly-by-wire systems normally attempts to decouple the angular responses using fixed-gain crossfeeds. This approach can lead to poor decoupling over the frequency range of pilot inputs and increase the load on the feedback loops. In order to improve the decoupling performance, dynamic crossfeeds should be adopted. Moreover, because of the large changes that occur in the aircraft dynamics due to small changes about the nominal design condition, especially for near-hovering flight, the crossfeed design must be ‘robust’. A new low-order matching method is presented here to design robust crossfeed compensators for multi-input, multi-output (MIMO) systems. The technique minimizes cross-coupling given an anticipated set of parameter variations for the range of flight conditions of concern. Results are presented in this paper of an analysis of the pitch/roll coupling of the UH-60 Black Hawk helicopter in near-hovering flight. A robust crossfeed is designed that shows significant improvement in decoupling perfomance and robustness over the fixed-gain or single point dynamic compensators. The design method and results are presented in an easily used graphical format that lends significant physical insight to the design procedure. This plant precompensation technique is an appropriate preliminary step to the design of robust feedback control laws for rotorcraft. 相似文献
138.
139.
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. 相似文献
140.
Although not well known, the University of Toronto had a very early computer-development program and in 1952 was one of the first few institutions with an operable computer in North America. This article describes the university's initial attempt to build the UTEC computer and how it acquired the pioneering Ferut machine 相似文献