全文获取类型
收费全文 | 12128篇 |
免费 | 728篇 |
国内免费 | 585篇 |
专业分类
电工技术 | 504篇 |
综合类 | 903篇 |
化学工业 | 324篇 |
金属工艺 | 195篇 |
机械仪表 | 711篇 |
建筑科学 | 280篇 |
矿业工程 | 224篇 |
能源动力 | 251篇 |
轻工业 | 114篇 |
水利工程 | 96篇 |
石油天然气 | 391篇 |
武器工业 | 61篇 |
无线电 | 977篇 |
一般工业技术 | 941篇 |
冶金工业 | 90篇 |
原子能技术 | 38篇 |
自动化技术 | 7341篇 |
出版年
2024年 | 31篇 |
2023年 | 86篇 |
2022年 | 134篇 |
2021年 | 146篇 |
2020年 | 217篇 |
2019年 | 186篇 |
2018年 | 157篇 |
2017年 | 277篇 |
2016年 | 306篇 |
2015年 | 388篇 |
2014年 | 567篇 |
2013年 | 799篇 |
2012年 | 662篇 |
2011年 | 802篇 |
2010年 | 536篇 |
2009年 | 795篇 |
2008年 | 804篇 |
2007年 | 867篇 |
2006年 | 799篇 |
2005年 | 672篇 |
2004年 | 618篇 |
2003年 | 547篇 |
2002年 | 465篇 |
2001年 | 368篇 |
2000年 | 329篇 |
1999年 | 283篇 |
1998年 | 274篇 |
1997年 | 256篇 |
1996年 | 176篇 |
1995年 | 148篇 |
1994年 | 116篇 |
1993年 | 84篇 |
1992年 | 90篇 |
1991年 | 49篇 |
1990年 | 42篇 |
1989年 | 47篇 |
1988年 | 48篇 |
1987年 | 28篇 |
1986年 | 23篇 |
1985年 | 34篇 |
1984年 | 49篇 |
1983年 | 27篇 |
1982年 | 21篇 |
1981年 | 21篇 |
1980年 | 19篇 |
1979年 | 12篇 |
1978年 | 7篇 |
1977年 | 12篇 |
1976年 | 9篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 234 毫秒
31.
One of the problems encountered by automatic feeding devices, such as vibratory bowl feeders, in robotic assembly systems is nesting which leads to inseparability of parts and jamming. In this paper, we describe a design evaluation procedure to determine whether a part is prone to nesting and to quantify the degree of nesting. The proposed methodology reduces the 3-D protrusion-hole polyhedral containment problem of nesting to a 2-D polygon containment problem by employing a loop-based feature recognition scheme. Subsequently, the 3-D containment configuration is reconstructed from that of the 2-D by using a strategy calleddrop, pull and push. In this context, we introduce the notion of axis as a characteristic direction of a feature that facilitates the analysis of generalized 3-D polyhedral containment. The algorithms are applicable to generic B-Rep CAD data, and their time and space complexities are polynomial. 相似文献
32.
通过建立三维有限元模型,对土钉支护的变形和受力性能进行分析,得出土钉力的合理分布。在此基础上,考虑土钉支护的水平位移,采用遗传算法,对土钉支护的结构优化设计进行研究,建立了土钉支护结构的优化设计数学模型,并编制了相应的计算程序。通过算例分析,并与基于极限平衡分析的优化结果相比较,得出合理的土钉支护结构设计的参考结论。 相似文献
33.
Carlos Fernandes Agostinho C. Rosa 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2008,12(10):955-979
Mate selection plays a crucial role in both natural and artificial systems. While traditional Evolutionary Algorithms (EA)
usually engage in random mating strategies, that is, mating chance is independent of genotypic or phenotypic distance between
individuals, in natural systems non-random mating is common, which means that somehow this mechanism has been favored during
the evolutionary process. In non-random mating, the individuals mate according to their parenthood or likeness. Previous studies
indicate that negative assortative mating (AM)—also known as dissortative mating—, which is a specific type of non-random mating, may improve EAs performance by maintaining the genetic diversity of the
population at a higher level during the search process. In this paper we present the Variable Dissortative Mating Genetic Algorithm (VDMGA). The algorithm holds a mechanism that varies the GA’s mating restrictions during the run by means of simple rule
based on the number of chromosomes created in each generation and indirectly influenced by the genetic diversity of the population.
We compare VDMGA not only with traditional Genetic Algorithms (GA) but also with two preceding non-random mating EAs: the
CHC algorithm and the negative Assortative Mating Genetic Algorithm (nAMGA). We intend to study the effects of the different methods in the performance of GAs and verify the reliability of
the proposed algorithm when facing an heterogeneous set of landscapes. In addition, we include the positive Assortative Mating Genetic Algorithm (pAMGA) in the experiments in order test both negative and positive AM mechanisms, and try to understand if and when negative
AM (or DM) speeds up the search process or enables the GAs to escape local optima traps. For these purposes, an extensive
set of optimization test problems was chosen to cover a variety of search landscapes with different characteristics. Our results
confirm that negative AM is effective in leading EAs out of local optima traps, and show that the proposed VDMGA is at least
as efficient as nAMGA when applied to the range of our problems, being more efficient in very hard functions were traditional
GAs usually fail to escape local optima. Also, scalability tests have been made that show VDMGA ability to decrease optimal
population size, thus reducing the amount of evaluations needed to attain global optima. We like to stress that only two parameters
need to be hand-tuned in VDMGA, thus reducing the tuning effort present in traditional GAs and nAMGA. 相似文献
34.
Gabriel Nivasch 《Information Processing Letters》2004,90(3):135-140
We present an algorithm for detecting periodicity in sequences produced by repeated application of a given function. Our algorithm uses logarithmic memory with high probability, runs in linear time, and is guaranteed to stop within the second loop through the cycle. We also present a partitioning technique that offers a time/memory tradeoff. Our algorithm is especially well suited for sequences where the cycle length is typically small compared to the length of the acyclic prefix. 相似文献
35.
36.
37.
基于回归方法的移动通信话务量预测 总被引:2,自引:0,他引:2
针对移动通信话务量与市场用户和相应资费政策相关的特点,采用回归预测方法,建立了基于市场用户数及每用户收入的话务量预测模型,并对模型进行了经济学意义上的检验。根据此模型,对话务量进行了初步的预测分析。 相似文献
38.
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. 相似文献
39.
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. 相似文献
40.
Tibor Gyires 《Applied Intelligence》1991,1(2):145-155
Distributed Problem Solving Networks (DPSN) provide a means for interconnecting intelligent problem solver nodes that can solve only a part of a problem depending on their ability in the problem domain. The decomposition of a problem into subproblems, and the selection of nodes to solve them can be regarded as the generation of an AND/OR tree, and the solution of the problem as a search for a solution tree. Introducing measurements for the cost of a solution tree, we present an algorithm to find one having minimal cost under certain conditions. A Flexible Manufacturing System consisting of a network of flexible workcells is used as an example. 相似文献