全文获取类型
收费全文 | 529112篇 |
免费 | 7291篇 |
国内免费 | 1481篇 |
专业分类
电工技术 | 9586篇 |
综合类 | 531篇 |
化学工业 | 79427篇 |
金属工艺 | 20046篇 |
机械仪表 | 15265篇 |
建筑科学 | 12874篇 |
矿业工程 | 2277篇 |
能源动力 | 14641篇 |
轻工业 | 47387篇 |
水利工程 | 5251篇 |
石油天然气 | 9348篇 |
武器工业 | 38篇 |
无线电 | 60252篇 |
一般工业技术 | 102449篇 |
冶金工业 | 104112篇 |
原子能技术 | 10581篇 |
自动化技术 | 43819篇 |
出版年
2022年 | 3214篇 |
2021年 | 4996篇 |
2020年 | 3537篇 |
2019年 | 4637篇 |
2018年 | 7918篇 |
2017年 | 7699篇 |
2016年 | 8047篇 |
2015年 | 5648篇 |
2014年 | 9367篇 |
2013年 | 24293篇 |
2012年 | 14847篇 |
2011年 | 20405篇 |
2010年 | 16003篇 |
2009年 | 17915篇 |
2008年 | 18337篇 |
2007年 | 17994篇 |
2006年 | 15686篇 |
2005年 | 14405篇 |
2004年 | 13722篇 |
2003年 | 13512篇 |
2002年 | 12756篇 |
2001年 | 12895篇 |
2000年 | 11918篇 |
1999年 | 12644篇 |
1998年 | 32856篇 |
1997年 | 22942篇 |
1996年 | 17499篇 |
1995年 | 13074篇 |
1994年 | 11325篇 |
1993年 | 11011篇 |
1992年 | 7942篇 |
1991年 | 7438篇 |
1990年 | 7294篇 |
1989年 | 7044篇 |
1988年 | 6493篇 |
1987年 | 5801篇 |
1986年 | 5687篇 |
1985年 | 6294篇 |
1984年 | 5919篇 |
1983年 | 5194篇 |
1982年 | 4924篇 |
1981年 | 4978篇 |
1980年 | 4717篇 |
1979年 | 4618篇 |
1978年 | 4418篇 |
1977年 | 5337篇 |
1976年 | 6977篇 |
1975年 | 3801篇 |
1974年 | 3553篇 |
1973年 | 3668篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
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 相似文献
102.
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 相似文献
103.
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 相似文献
104.
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 相似文献
105.
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. 相似文献
106.
107.
108.
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 相似文献
109.
Conclusion In the optimization problem [f
0(x)│hi(x)<-0,i=1,…,l] relaxation of the functionf
0(x)+Nh+(x) does not produce, as we know [6, 7], αk=1 in Newton's method with the auxiliary problem (5), (6), whereF(x)=f
0′(x). For this reason, Newton type methods based on relaxation off
0(x)+Nh+(x) are not superlinearly convergent (so-called Maratos effect). The results of this article indicate that if (F(x)=f
0′(x), then replacement of the initial optimization problem with a larger equivalent problem (7) eliminates the Maratos effect
in the proposed quasi-Newton method. This result is mainly of theoretical interest, because Newton type optimization methods
in the space of the variablesx ∈R
n are less complex. However to the best of our knowledge, the difficulties with nonlocal convergence arising in these methods
(choice of parameters, etc.) have not been fully resolved [10, 11]. The discussion of these difficulties and comparison with
the proposed method fall outside the scope of the present article, which focuses on solution of variational inequalities (1),
(2) for the general caseF′(x)≠F′
T(x).
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 78–91, November–December, 1994. 相似文献
110.
First break picking is a pattern recognition problem in seismic signal processing, one that requires much human effort and is difficult to automate. The authors' goal is to reduce the manual effort in the picking process and accurately perform the picking. Feedforward neural network first break pickers have been developed using backpropagation training algorithms applied either to an encoded version of the raw data or to derived seismic attributes which are extracted from the raw data. The authors summarize a study in which they applied a backpropagation fuzzy logic system (BPFLS) to first break picking. The authors use derived seismic attributes as features, and take lateral variations into account by using the distance to a piecewise linear guiding function as a new feature. Experimental results indicate that the BPFLS achieves about the same picking accuracy as a feedforward neural network that is also trained using a backpropagation algorithm; however, the BPFLS is trained in a much shorter time, because there is a systematic way in which the initial parameters of the BPFLS can be chosen, versus the random way in which the weights of the neural network are chosen 相似文献