全文获取类型
收费全文 | 483874篇 |
免费 | 5612篇 |
国内免费 | 1219篇 |
专业分类
电工技术 | 9115篇 |
综合类 | 679篇 |
化学工业 | 73591篇 |
金属工艺 | 19189篇 |
机械仪表 | 14802篇 |
建筑科学 | 11239篇 |
矿业工程 | 2882篇 |
能源动力 | 12355篇 |
轻工业 | 40953篇 |
水利工程 | 5137篇 |
石油天然气 | 10357篇 |
武器工业 | 30篇 |
无线电 | 57058篇 |
一般工业技术 | 96597篇 |
冶金工业 | 86446篇 |
原子能技术 | 11266篇 |
自动化技术 | 39009篇 |
出版年
2021年 | 4003篇 |
2019年 | 3868篇 |
2018年 | 6714篇 |
2017年 | 6624篇 |
2016年 | 6963篇 |
2015年 | 4418篇 |
2014年 | 7606篇 |
2013年 | 21480篇 |
2012年 | 12010篇 |
2011年 | 16136篇 |
2010年 | 12805篇 |
2009年 | 14572篇 |
2008年 | 15023篇 |
2007年 | 14986篇 |
2006年 | 13105篇 |
2005年 | 12153篇 |
2004年 | 11607篇 |
2003年 | 11260篇 |
2002年 | 10925篇 |
2001年 | 11233篇 |
2000年 | 10631篇 |
1999年 | 10979篇 |
1998年 | 26256篇 |
1997年 | 18912篇 |
1996年 | 14771篇 |
1995年 | 11356篇 |
1994年 | 10169篇 |
1993年 | 10156篇 |
1992年 | 7777篇 |
1991年 | 7523篇 |
1990年 | 7369篇 |
1989年 | 7213篇 |
1988年 | 7077篇 |
1987年 | 6038篇 |
1986年 | 6200篇 |
1985年 | 7164篇 |
1984年 | 6558篇 |
1983年 | 6198篇 |
1982年 | 5580篇 |
1981年 | 5724篇 |
1980年 | 5475篇 |
1979年 | 5443篇 |
1978年 | 5311篇 |
1977年 | 6019篇 |
1976年 | 7378篇 |
1975年 | 4695篇 |
1974年 | 4451篇 |
1973年 | 4551篇 |
1972年 | 3947篇 |
1971年 | 3529篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
151.
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 相似文献
152.
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. 相似文献
153.
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. 相似文献
154.
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 相似文献
155.
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 相似文献
156.
We present a method for analyzing the convergence properties of nonlinear dynamical systems yielding second-order bounds on the domain of attraction of an asymptotically stable equilibrium point and on the time of convergence in the estimated domain. We show that under certain conditions on the system, there exists an analytic solution to the corresponding optimization problem. The method is applied in analyzing the dynamics of a neural network model. 相似文献
157.
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. 相似文献
158.
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. 相似文献
159.
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. 相似文献
160.
Matthew R. James 《国际强度与非线性控制杂志
》1994,4(6):791-806
》1994,4(6):791-806
In this paper we present a numerical method for estimating the current state of a nonlinear control system. We use finite differences to discretize a modified version of the finite-time observer equations in James. The discretized equations are simple and easily programmed. The convergence and accuracy of the scheme is proved, and the scheme enjoys a number of important properties: availability of rate of convergence estimates, good robustness characteristics, and the ability to handle certain types of discontinuities in the observations. The major disadvantage is that the number of grid points required increases exponentially with the number of state dimensions. 相似文献