全文获取类型
收费全文 | 425998篇 |
免费 | 5638篇 |
国内免费 | 1560篇 |
专业分类
电工技术 | 7807篇 |
综合类 | 310篇 |
化学工业 | 60765篇 |
金属工艺 | 14712篇 |
机械仪表 | 11878篇 |
建筑科学 | 10381篇 |
矿业工程 | 1254篇 |
能源动力 | 11331篇 |
轻工业 | 40025篇 |
水利工程 | 3600篇 |
石油天然气 | 4636篇 |
武器工业 | 14篇 |
无线电 | 56141篇 |
一般工业技术 | 78276篇 |
冶金工业 | 89131篇 |
原子能技术 | 6437篇 |
自动化技术 | 36498篇 |
出版年
2021年 | 2918篇 |
2020年 | 2196篇 |
2019年 | 2829篇 |
2018年 | 4439篇 |
2017年 | 4472篇 |
2016年 | 4829篇 |
2015年 | 3519篇 |
2014年 | 5931篇 |
2013年 | 18802篇 |
2012年 | 10535篇 |
2011年 | 14948篇 |
2010年 | 11727篇 |
2009年 | 13396篇 |
2008年 | 14180篇 |
2007年 | 14230篇 |
2006年 | 13057篇 |
2005年 | 12073篇 |
2004年 | 11642篇 |
2003年 | 11475篇 |
2002年 | 10801篇 |
2001年 | 11484篇 |
2000年 | 10459篇 |
1999年 | 11458篇 |
1998年 | 30398篇 |
1997年 | 20591篇 |
1996年 | 15676篇 |
1995年 | 11687篇 |
1994年 | 10159篇 |
1993年 | 10050篇 |
1992年 | 6934篇 |
1991年 | 6584篇 |
1990年 | 6343篇 |
1989年 | 6062篇 |
1988年 | 5759篇 |
1987年 | 4613篇 |
1986年 | 4617篇 |
1985年 | 5486篇 |
1984年 | 4884篇 |
1983年 | 4406篇 |
1982年 | 4058篇 |
1981年 | 4225篇 |
1980年 | 3830篇 |
1979年 | 3552篇 |
1978年 | 3387篇 |
1977年 | 4074篇 |
1976年 | 5279篇 |
1975年 | 2874篇 |
1974年 | 2721篇 |
1973年 | 2755篇 |
1972年 | 2167篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
81.
We study run-time issues, such as site allocation and query scheduling policies, in executing read-only queries in a hierarchical, distributed memory, multicomputer system. The particular architecture considered is based on the hypercube interconnection. The data are stored in a base cube, which is controlled by a control cube and host node hierarchy. Input query trees are transformed into operation sequence trees, and the operation sequences become the units of scheduling. These sequences are scheduled dynamically at run-time. Algorithms for dynamic site allocation are provided. Several query scheduling policies that support interquery concurrency are also studied. Average query completion times and initiation delays are obtained for the various policies using simulations 相似文献
82.
It is well known that the effectiveness of relational database systems is greatly dependent on the efficiency of the data access strategies. For this reason, much work has been devoted to the development of new access techniques, supported by adequate access structures such as the B+trees. The effectiveness of the B +tree also depends on the data distribution characteristics; in particular, poor performance results when the data show strong key value distribution unbalancing. The aim of this paper is to present the partial index: a new access structure that is useful in such cases of unbalancing, as an alternative to the B+tree unclustered indexes. The access structures are built in the physical design phase, and at execution (or compilation) time, the optimizer chooses the most efficient access path. Thus, integration of the partial indexing technique in the design and in the optimization process are also described 相似文献
83.
We propose and evaluate a parallel “decomposite best-first” search branch-and-bound algorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial best-first search branch-and-bound algorithm. This analysis is used in predicting the parallel algorithm speed-up. The proposed algorithm initially decomposes a problem into N subproblems, where N is the number of processors available in a multiprocessor. Afterwards, each processor executes the serial best-first search to find a local feasible solution. Local solutions are broadcasted through the network to compute the final solution. A conflict-free mapping scheme, known as the step-by-step spread, is used for subproblem distribution on the MIN. A speedup expression for the parallel algorithm is then derived using the serial best-first search node evaluation model. Our analysis considers both computation and communication overheads for providing realistic speed-up. Communication modeling is also extended for the parallel global best-first search technique. All the analytical results are validated via simulation. For large systems, when communication overhead is taken into consideration, it is observed that the parallel decomposite best-first search algorithm provides better speed-up compared to other reported schemes 相似文献
84.
in the above paper Yu (IEEE Trans. Neural Networks, vol.3, no.6, p.1019-21 (1992)) claims to prove that local minima do not exist in the error surface of backpropagation networks being trained on data with t distinct input patterns when the network is capable of exactly representing arbitrary mappings on t input patterns. The commenter points out that the proof presented is flawed, so that the resulting claims remain unproved. In reply, Yu points out that the undesired phenomenon that was sited can be avoided by simply imposing the arbitrary mapping capacity of the network on lemma 1 in the article. 相似文献
85.
86.
Different hierarchical models in pattern analysis and recognition are proposed, based on occurrence probability of patterns. As an important application of recognizing handprinted characters, three typical kinds of hierarchical models such asM
89-89,M
89-36 andM
36-36 have been presented, accompanied by the computer algorithms for computing recognition rates of pattern parts. Moreover, a comparative study of their recognition rates has been conducted theoretically; and numerical experiments have been carried out to verify the analytical conclusions made. Various hierarchical models deliberated in this paper can provide users more or better choices of pattern models in practical application, and lead to a uniform computational scheme (or code). The recognition rates of parts can be improved remarkably by a suitable hierarchical model. For the modelM
89-36 in which case some of the Canadian standard handprinted characters have multiple occurrence probabilities, the total mean recognition rates of the given sample may reach 120% of that by the model proposed by Li et al., and 156% of that obtained from the subjective experiments reported by Suen. 相似文献
87.
The paper presents an algebraic specification of net objects. By net objects we mean those that are defined in object-oriented paradigms and those defined with nested relations in complex database models. An algebraic specification is set up that involves structures of net objects, accesses of net objects, and some features of object-oriented programming, such as multiple inheritance and polymorphism. Objects and their relationships are then characterized formally in the modeling, which utilizes the hierarchical approach in the algebraic theory of abstract data types, and is further developed by adding mechanisms from existing object systems. Categories of net objects are presented with the properties of accesses among them 相似文献
88.
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 相似文献
89.
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. 相似文献
90.
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 相似文献