全文获取类型
收费全文 | 531756篇 |
免费 | 8118篇 |
国内免费 | 1415篇 |
专业分类
电工技术 | 11334篇 |
综合类 | 1260篇 |
化学工业 | 83596篇 |
金属工艺 | 18849篇 |
机械仪表 | 15874篇 |
建筑科学 | 13469篇 |
矿业工程 | 2007篇 |
能源动力 | 13786篇 |
轻工业 | 48938篇 |
水利工程 | 4805篇 |
石油天然气 | 7102篇 |
武器工业 | 75篇 |
无线电 | 66390篇 |
一般工业技术 | 100501篇 |
冶金工业 | 95927篇 |
原子能技术 | 9656篇 |
自动化技术 | 47720篇 |
出版年
2021年 | 4508篇 |
2019年 | 4301篇 |
2018年 | 6899篇 |
2017年 | 6678篇 |
2016年 | 7191篇 |
2015年 | 5179篇 |
2014年 | 8390篇 |
2013年 | 24700篇 |
2012年 | 13061篇 |
2011年 | 17714篇 |
2010年 | 14237篇 |
2009年 | 16304篇 |
2008年 | 16911篇 |
2007年 | 16679篇 |
2006年 | 15019篇 |
2005年 | 13742篇 |
2004年 | 13321篇 |
2003年 | 13027篇 |
2002年 | 12477篇 |
2001年 | 12591篇 |
2000年 | 12020篇 |
1999年 | 12516篇 |
1998年 | 29225篇 |
1997年 | 21160篇 |
1996年 | 16792篇 |
1995年 | 13111篇 |
1994年 | 11760篇 |
1993年 | 11486篇 |
1992年 | 8867篇 |
1991年 | 8371篇 |
1990年 | 8200篇 |
1989年 | 7788篇 |
1988年 | 7549篇 |
1987年 | 6511篇 |
1986年 | 6511篇 |
1985年 | 7671篇 |
1984年 | 7053篇 |
1983年 | 6537篇 |
1982年 | 5972篇 |
1981年 | 6265篇 |
1980年 | 5768篇 |
1979年 | 5634篇 |
1978年 | 5308篇 |
1977年 | 6294篇 |
1976年 | 7938篇 |
1975年 | 4851篇 |
1974年 | 4657篇 |
1973年 | 4875篇 |
1972年 | 3861篇 |
1971年 | 3503篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
151.
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 相似文献
152.
Graefe G. Linville A. Shapiro L.D. 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(6):934-944
Efficient algorithms for processing large volumes of data are very important both for relational and new object-oriented database systems. Many query-processing operations can be implemented using sort- or hash-based algorithms, e.g. intersections, joins, and duplicate elimination. In the early relational database systems, only sort-based algorithms were employed. In the last decade, hash-based algorithms have gained acceptance and popularity, and are often considered generally superior to sort-based algorithms such as merge-join. In this article, we compare the concepts behind sort- and hash-based query-processing algorithms and conclude that (1) many dualities exist between the two types of algorithms, (2) their costs differ mostly by percentages rather than by factors, (3) several special cases exist that favor one or the other choice, and (4) there is a strong reason why both hash- and sort-based algorithms should be available in a query-processing system. Our conclusions are supported by experiments performed using the Volcano query execution engine 相似文献
153.
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 相似文献
154.
Arguello F. Bruguera J.D. Doallo R. Zapata E.L. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(10):1091-1099
We present an unified parallel architecture for four of the most important fast orthogonal transforms with trigonometric kernel: Complex Valued Fourier (CFFT), Real Valued Fourier (RFFT), Hartley (FHT), and Cosine (FCT). Out of these, only the CFFT has a data flow coinciding with the one generated by the successive doubling method, which can be transformed on a constant geometry flow using perfect unshuffle or shuffle permutations. The other three require some type of hardware modification to guarantee the constant geometry of the successive doubling method. We have defined a generalized processing section (PS), based on a circular CORDIC rotator, for the four transforms. This PS section permits the evaluation of the CFFT and FCT transforms in n data recirculations and the RFFT and FHT transforms in n-1 data recirculations, with n being the number of stages of a transform of length N=rn. Also, the efficiency of the partitioned parallel architecture is optimum because there is no cycle loss in the systolic computation of all the butterflies for each of the four transforms 相似文献
155.
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 相似文献
156.
Michael D. Vose 《Annals of Mathematics and Artificial Intelligence》1994,10(4):423-434
This paper examines the influence of mutation on the behavior of genetic algorithms through a series of examples and experiments. The results provide an existence proof that mutation is a far more profound operator than has ever been recognized. Implications are discussed which point to the importance of open questions concerning genetic algorithms. The paper also reviews the implementation of the infinite population model of Vose which forms the computational basis of this investigation. 相似文献
157.
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 相似文献
158.
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 相似文献
159.
We present the design of E-kernel, an embedding kernel on the Victor V256 message-passing partitionable multiprocessor, developed for the support of program mapping and network reconfiguration. E-kernel supports the embedding of a new network topology onto Victor's 2D mesh and also the embedding of a task graph onto the 2D mesh network or the reconfigured network. In the current implementation, the reconfigured network can be a line or an even-size ring, and the task graphs meshes or tori of a variety of dimensions and shapes or graphs with similar topologies. For application programs having these task graph topologies and that are designed according to the communication model of E-kernel, they can be run without any change on partitions connected by the 2D mesh, line, or ring. Further, E-kernel attempts the communication optimization of these programs on the different networks automatically, thus making both the network topology and the communication optimization attempt completely transparent to the application programs. Many of the embeddings used in E-kernel are optimal or asymptotically optimal (with respect to minimum dilation cost). The implementation of E-kernel translated some of the many theoretical results in graph embeddings into practical tools for program mapping and network reconfiguration in a parallel system. E-kernel is functional on Victor V256. Measurements of E-kernel's performance on V256 are also included 相似文献
160.
The cascade correlation is a very flexible, efficient and fast algorithm for supervised learning. It incrementally builds the network by adding hidden units one at a time, until the desired input/output mapping is achieved. It connects all the previously installed units to the new unit being added. Consequently, each new unit in effect adds a new layer and the fan-in of the hidden and output units keeps on increasing as more units get added. The resulting structure could be hard to implement in VLSI, because the connections are irregular and the fan-in is unbounded. Moreover, the depth or the propagation delay through the resulting network is directly proportional to the number of units and can be excessive. We have modified the algorithm to generate networks with restricted fan-in and small depth (propagation delay) by controlling the connectivity. Our results reveal that there is a tradeoff between connectivity and other performance attributes like depth, total number of independent parameters, and learning time. 相似文献