全文获取类型
收费全文 | 10862篇 |
免费 | 730篇 |
国内免费 | 566篇 |
专业分类
电工技术 | 482篇 |
综合类 | 810篇 |
化学工业 | 171篇 |
金属工艺 | 117篇 |
机械仪表 | 553篇 |
建筑科学 | 216篇 |
矿业工程 | 67篇 |
能源动力 | 183篇 |
轻工业 | 55篇 |
水利工程 | 70篇 |
石油天然气 | 47篇 |
武器工业 | 52篇 |
无线电 | 919篇 |
一般工业技术 | 809篇 |
冶金工业 | 117篇 |
原子能技术 | 29篇 |
自动化技术 | 7461篇 |
出版年
2024年 | 38篇 |
2023年 | 72篇 |
2022年 | 108篇 |
2021年 | 111篇 |
2020年 | 174篇 |
2019年 | 169篇 |
2018年 | 135篇 |
2017年 | 269篇 |
2016年 | 278篇 |
2015年 | 372篇 |
2014年 | 504篇 |
2013年 | 732篇 |
2012年 | 607篇 |
2011年 | 751篇 |
2010年 | 490篇 |
2009年 | 749篇 |
2008年 | 812篇 |
2007年 | 831篇 |
2006年 | 747篇 |
2005年 | 600篇 |
2004年 | 547篇 |
2003年 | 492篇 |
2002年 | 420篇 |
2001年 | 333篇 |
2000年 | 293篇 |
1999年 | 220篇 |
1998年 | 216篇 |
1997年 | 197篇 |
1996年 | 130篇 |
1995年 | 101篇 |
1994年 | 95篇 |
1993年 | 71篇 |
1992年 | 72篇 |
1991年 | 42篇 |
1990年 | 34篇 |
1989年 | 40篇 |
1988年 | 44篇 |
1987年 | 25篇 |
1986年 | 22篇 |
1985年 | 32篇 |
1984年 | 48篇 |
1983年 | 27篇 |
1982年 | 21篇 |
1981年 | 21篇 |
1980年 | 18篇 |
1979年 | 12篇 |
1978年 | 8篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 156 毫秒
31.
Doratha E Drake 《Information Processing Letters》2003,85(4):211-213
We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [STACS'99, Lecture Notes in Comput. Sci., Vol. 1563, 1999, pp. 259-269]. Our algorithm uses a new approach which is much simpler than the one given by Preis and needs no amortized analysis for its running time. 相似文献
32.
Artem Sokolov Darrell Whitley Andre’ da Motta Salles Barreto 《Genetic Programming and Evolvable Machines》2007,8(3):221-237
This paper evaluates different forms of rank-based selection that are used with genetic algorithms and genetic programming.
Many types of rank based selection have exactly the same expected value in terms of the sampling rate allocated to each member
of the population. However, the variance associated with that sampling rate can vary depending on how selection is implemented.
We examine two forms of tournament selection and compare these to linear rank-based selection using an explicit formula. Because
selective pressure has a direct impact on population diversity, we also examine the interaction between selective pressure
and different mutation strategies. 相似文献
33.
The problem of determining the maximum mean response level crossing rate of a linear system driven by a partially specified Gaussian load process has been considered. The partial specification of the load is given only in terms of its total average energy. The critical input power spectral (PSD) function, which maximizes the mean response level crossing rate, is obtained. The critical input PSD turns out to be highly narrow-banded which fails to capture the erratic nature of the excitation. Consequently, the trade-off curve between the maximum mean response level crossing rate and the maximum disorder in the input process, quantified in terms of its entropy rate, has been generated. The method of Pareto optimization is used to tackle the conflicting objectives of the simultaneous maximization of the mean response level crossing rate and the input entropy rate. The non-linear multi-objective optimization has been carried out using a recently developed multi-criteria genetic algorithm scheme. Illustrative example of determining the critical input of an axially vibrating rod, excited by a partially specified stationary Gaussian load process, has been considered. 相似文献
34.
This paper presents an algorithm that permits the search for dependencies among sets of data (univariate or multivariate time-series, or cross-sectional observations). The procedure is modeled after genetic theories and Darwinian concepts, such as natural selection and survival of the fittest. It permits the discovery of equations of the data-generating process in symbolic form. The genetic algorithm that is described here uses parts of equations as building blocks to breed ever better formulas. Apart from furnishing a deeper understanding of the dynamics of a process, the method also permits global predictions and forecasts. The algorithm is successfully tested with artificial and with economic time-series and also with cross-sectional data on the performance and salaries of NBA players during the 94–95 season. 相似文献
35.
The conventional way of solving the group technology (GT) problem is to start from an assignment of parts to machines and try to find a partitioning of machine cells and part families. The similarity between parts is measured based on commonality of the machines assigned to them. However, parts are assigned to machines based on their operation requirements and the operation capabilities of machines. Similarity between parts should be based on their required operations. In this paper, the authors attempt to solve or facilitate solving the GT problem at the assignment level. An algorithm for assigning parts to machines is provided which utilizes the types of operations required by parts and applies GT principles in producing the assignment. This leads to better partitioning of machine cells and part-families. Furthermore, operation sequences required by parts in determining the similarity between parts have been considered. An algorithm to form part-families based on the operation sequence similarity coefficient has been developed. The resulting families are then used by the assignment algorithm to produce machine assignments to part-families. The use of the algorithm is demonstrated by examples. 相似文献
36.
Summary Algorithms for mutual exclusion that adapt to the current degree of contention are developed. Afilter and a leader election algorithm form the basic building blocks. The algorithms achieve system response times that are independent of the total number of processes and governed instead by the current degree of contention. The final algorithm achieves a constant amortized system response time.
Manhoi Choy was born in 1967 in Hong Kong. He received his B.Sc. in Electrical and Electronic Engineerings from the University of Hong Kong in 1989, and his M.Sc. in Computer Science from the University of California at Santa Barbara in 1991. Currently, he is working on his Ph.D. in Computer Science at the University of California at Santa Barbara. His research interests are in the areas of parallel and distributed systems, and distributed algorithms.
Ambuj K. Singh is an Assistant Professor in the Department of Computer Science at the University of California, Santa Barbara. He received a Ph.D. in Computer Science from the University of Texas at Austin in 1989, an M.S. in Computer Science from Iowa State University in 1984, and a B.Tech. from the Indian Institute of Technology at Kharagpur in 1982. His research interests are in the areas of adaptive resource allocation, concurrent program development, and distributed shared memory.A preliminary version of the paper appeared in the 12th Annual ACM Symposium on Principles of Distributed ComputingWork supported in part by NSF grants CCR-9008628 and CCR-9223094 相似文献
37.
The tree representation of evolutionary relationship oversimplifies the view of the process of evolution as it cannot take into account the events such as horizontal gene transfer, hybridization, homoplasy and genetic recombination. Several algorithms exist for constructing phylogenetic networks which result from events such as horizontal gene transfer, hybridization and homoplasy. Very little work has been published on the algorithmic detail of phylogenetic networks with constrained recombination. The problem of minimizing the number of recombinations in a phylogenetic network, constructed using binary DNA sequences, is NP-hard. In this paper, we propose a pattern recognition-based O(n2) time approach for constructing the phylogenetic network, where n is the number of nodes or sequences in the input data. The network is constructed with the restriction that no two cycles in the network share a common node. 相似文献
38.
A novel dynamic survivable routing in WDM optical networks with/without sparse wavelength conversion
Vinh Trong Le Xiaohong Jiang Son Hong Ngo Susumu Horiguchi Yasushi Inoguchi 《Optical Switching and Networking》2006,3(3-4):173-190
In this paper, we study the dynamic survivable routing problem, both in optical networks without wavelength conversion and in optical networks with sparse wavelength conversion, and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously report cycles (that are formed by two disjoint-link routes) into the routing tables, our new hybrid algorithm can promptly determine the first population of cycles for a new request based on the routing table of its source node, without the time consuming process associated with current GA-based lightpath protection schemes. We further improve the performance of our algorithm by introducing a more advanced fitness function that is suitable for both the above networks. Extensive simulation studies on the ns-2 network simulator show that our hybrid algorithm achieves a significantly lower blocking probability than the conventional survivable routing algorithms for all the cases we studied. 相似文献
39.
从数据结构角度为旅游胜地设计导游系统。向游人提供景点的信息查询服务,根据指定的景点提供相关的景点信息。任意给定起点和终点,查询两点之间的最短路径。 相似文献
40.
Jae-Ha Lee 《Information Processing Letters》2002,81(5):265-270
The k-searcher is a mobile guard whose visibility is limited to k rays emanating from her position, where the direction of each ray can be changed continuously with bounded angular rotation speed. Given a polygonal region P, is it possible for the k-searcher to eventually see a mobile intruder that is arbitrarily faster than the searcher within P? We present O(n2)-time algorithms for constructing a search schedule of the 1-searcher and the 2-searcher, respectively. Our framework for the 1-searcher can be viewed as a modification of that of LaValle et al. [Proc. 16th ACM Symp. on Computational Geometry, 2000, pp. 260-269] and is naturally extended for the 2-searcher. 相似文献