全文获取类型
收费全文 | 707020篇 |
免费 | 11453篇 |
国内免费 | 2983篇 |
专业分类
电工技术 | 13694篇 |
技术理论 | 5篇 |
综合类 | 1652篇 |
化学工业 | 107716篇 |
金属工艺 | 27528篇 |
机械仪表 | 20585篇 |
建筑科学 | 17640篇 |
矿业工程 | 3648篇 |
能源动力 | 18392篇 |
轻工业 | 63421篇 |
水利工程 | 7235篇 |
石油天然气 | 13409篇 |
武器工业 | 280篇 |
无线电 | 78930篇 |
一般工业技术 | 135349篇 |
冶金工业 | 138437篇 |
原子能技术 | 14071篇 |
自动化技术 | 59464篇 |
出版年
2021年 | 6644篇 |
2020年 | 4744篇 |
2019年 | 5975篇 |
2018年 | 9958篇 |
2017年 | 9742篇 |
2016年 | 10382篇 |
2015年 | 7576篇 |
2014年 | 12265篇 |
2013年 | 32425篇 |
2012年 | 19894篇 |
2011年 | 27218篇 |
2010年 | 21503篇 |
2009年 | 23593篇 |
2008年 | 24681篇 |
2007年 | 24453篇 |
2006年 | 21438篇 |
2005年 | 19248篇 |
2004年 | 18030篇 |
2003年 | 17526篇 |
2002年 | 16958篇 |
2001年 | 17053篇 |
2000年 | 15865篇 |
1999年 | 16604篇 |
1998年 | 41746篇 |
1997年 | 29605篇 |
1996年 | 22550篇 |
1995年 | 16888篇 |
1994年 | 14929篇 |
1993年 | 14568篇 |
1992年 | 10707篇 |
1991年 | 10057篇 |
1990年 | 9958篇 |
1989年 | 9740篇 |
1988年 | 9042篇 |
1987年 | 7959篇 |
1986年 | 7901篇 |
1985年 | 8787篇 |
1984年 | 8345篇 |
1983年 | 7446篇 |
1982年 | 6925篇 |
1981年 | 7150篇 |
1980年 | 6677篇 |
1979年 | 6709篇 |
1978年 | 6433篇 |
1977年 | 7457篇 |
1976年 | 9867篇 |
1975年 | 5681篇 |
1974年 | 5284篇 |
1973年 | 5440篇 |
1972年 | 4466篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
We describe a binding environment for the AND and OR parallel execution of logic programs that is suitable for both shared and nonshared memory multiprocessors. The binding environment was designed with a view of rendering a compiler using this binding environment machine independent. The binding environment is similar to closed environments proposed by J. Conery. However, unlike Conery's scheme, it supports OR and independent AND parallelism on both types of machines. The term representation, the algorithms for unification and the join algorithms for parallel AND branches are presented in this paper. We also detail the differences between our scheme and Conery's scheme. A compiler based on this binding environment has been implemented on a platform for machine independent parallel programming called the Chare Kernel 相似文献
992.
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 相似文献
993.
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 相似文献
994.
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 相似文献
995.
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 相似文献
996.
Recurrent neural networks and robust time series prediction 总被引:22,自引:0,他引:22
We propose a robust learning algorithm and apply it to recurrent neural networks. This algorithm is based on filtering outliers from the data and then estimating parameters from the filtered data. The filtering removes outliers from both the target function and the inputs of the neural network. The filtering is soft in that some outliers are neither completely rejected nor accepted. To show the need for robust recurrent networks, we compare the predictive ability of least squares estimated recurrent networks on synthetic data and on the Puget Power Electric Demand time series. These investigations result in a class of recurrent neural networks, NARMA(p,q), which show advantages over feedforward neural networks for time series with a moving average component. Conventional least squares methods of fitting NARMA(p,q) neural network models are shown to suffer a lack of robustness towards outliers. This sensitivity to outliers is demonstrated on both the synthetic and real data sets. Filtering the Puget Power Electric Demand time series is shown to automatically remove the outliers due to holidays. Neural networks trained on filtered data are then shown to give better predictions than neural networks trained on unfiltered time series. 相似文献
997.
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. 相似文献
998.
999.
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. 相似文献
1000.