全文获取类型
收费全文 | 678208篇 |
免费 | 10060篇 |
国内免费 | 1987篇 |
专业分类
电工技术 | 12419篇 |
综合类 | 743篇 |
化学工业 | 102562篇 |
金属工艺 | 27522篇 |
机械仪表 | 20832篇 |
建筑科学 | 15891篇 |
矿业工程 | 4119篇 |
能源动力 | 17819篇 |
轻工业 | 55891篇 |
水利工程 | 7542篇 |
石油天然气 | 14732篇 |
武器工业 | 64篇 |
无线电 | 74996篇 |
一般工业技术 | 135947篇 |
冶金工业 | 127816篇 |
原子能技术 | 14851篇 |
自动化技术 | 56509篇 |
出版年
2021年 | 6519篇 |
2020年 | 4764篇 |
2019年 | 6130篇 |
2018年 | 10885篇 |
2017年 | 10820篇 |
2016年 | 11352篇 |
2015年 | 7522篇 |
2014年 | 12294篇 |
2013年 | 30883篇 |
2012年 | 19058篇 |
2011年 | 25610篇 |
2010年 | 20230篇 |
2009年 | 22685篇 |
2008年 | 22974篇 |
2007年 | 22635篇 |
2006年 | 19533篇 |
2005年 | 19156篇 |
2004年 | 17664篇 |
2003年 | 17144篇 |
2002年 | 15743篇 |
2001年 | 15914篇 |
2000年 | 14863篇 |
1999年 | 15552篇 |
1998年 | 39529篇 |
1997年 | 27790篇 |
1996年 | 21208篇 |
1995年 | 15878篇 |
1994年 | 13850篇 |
1993年 | 13726篇 |
1992年 | 9994篇 |
1991年 | 9568篇 |
1990年 | 9284篇 |
1989年 | 8993篇 |
1988年 | 8456篇 |
1987年 | 7525篇 |
1986年 | 7490篇 |
1985年 | 8333篇 |
1984年 | 7785篇 |
1983年 | 7017篇 |
1982年 | 6542篇 |
1981年 | 6594篇 |
1980年 | 6408篇 |
1979年 | 6312篇 |
1978年 | 6100篇 |
1977年 | 7168篇 |
1976年 | 9107篇 |
1975年 | 5382篇 |
1974年 | 5062篇 |
1973年 | 5239篇 |
1972年 | 4371篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
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. 相似文献
992.
993.
The bounded disorder file organization proposed by W. Litwin and D.B. Lomet (1987) uses a combination of hashing and tree indexing. Lomet provided an approximate analysis with the mention of the difficulty involved in exact modeling of data nodes, which motivated this work. In an earlier paper (M.V. Ramakrishna and P. Mukhopadhyay, 1988) we provided an exact model and analysis of the data nodes, which is based on the solution of a classical sequential occupancy problem. After summarizing the analysis of data nodes, an alternate file growth method based on repeated trials using universal hashing is proposed and analyzed. We conclude that the alternate file growth method provides simplicity and significant improvement in storage utilization 相似文献
994.
Kieckhafer R.M. Azadmanesh M.H. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(1):53-63
In a fault-tolerant distributed system, different non-faulty processes may arrive at different values for a given system parameter. To resolve this disagreement, processes must exchange and vote upon their respective local values. Faulty processes may attempt to inhibit agreement by acting in a malicious or “Byzantine” manner. Approximate agreement defines one form of agreement in which the voted values obtained by the non-faulty processes need not be identical. Instead, they need only agree to within a predefined tolerance. Approximate agreement can be achieved by a sequence of convergent voting rounds, in which the range of values held by non-faulty processes is reduced in each round. Historically, each new convergent voting algorithm has been accompanied by ad-hoc proofs of its convergence rate and fault-tolerance, using an overly conservative fault model in which all faults exhibit worst-case Byzantine behavior. This paper presents a general method to quickly determine convergence rate and fault-tolerance for any member of a broad family of convergent voting algorithms. This method is developed under a realistic mixed-mode fault model comprised of asymmetric, symmetric, and benign fault modes. These results are employed to more accurately analyze the properties of several existing voting algorithms, to derive a sub-family of optimal mixed-mode voting algorithms, and to quickly determine the properties of proposed new voting algorithms 相似文献
995.
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 相似文献
996.
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 相似文献
997.
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 相似文献
998.
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 相似文献
999.
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. 相似文献
1000.
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. 相似文献