全文获取类型
收费全文 | 26699篇 |
免费 | 2664篇 |
国内免费 | 1904篇 |
专业分类
电工技术 | 2292篇 |
技术理论 | 2篇 |
综合类 | 2184篇 |
化学工业 | 1431篇 |
金属工艺 | 501篇 |
机械仪表 | 1393篇 |
建筑科学 | 1644篇 |
矿业工程 | 715篇 |
能源动力 | 481篇 |
轻工业 | 829篇 |
水利工程 | 716篇 |
石油天然气 | 694篇 |
武器工业 | 152篇 |
无线电 | 2704篇 |
一般工业技术 | 1787篇 |
冶金工业 | 817篇 |
原子能技术 | 74篇 |
自动化技术 | 12851篇 |
出版年
2024年 | 127篇 |
2023年 | 303篇 |
2022年 | 605篇 |
2021年 | 601篇 |
2020年 | 730篇 |
2019年 | 628篇 |
2018年 | 575篇 |
2017年 | 780篇 |
2016年 | 853篇 |
2015年 | 1046篇 |
2014年 | 1701篇 |
2013年 | 1798篇 |
2012年 | 2036篇 |
2011年 | 2228篇 |
2010年 | 1632篇 |
2009年 | 1827篇 |
2008年 | 1830篇 |
2007年 | 1940篇 |
2006年 | 1651篇 |
2005年 | 1354篇 |
2004年 | 1175篇 |
2003年 | 1039篇 |
2002年 | 905篇 |
2001年 | 692篇 |
2000年 | 555篇 |
1999年 | 419篇 |
1998年 | 350篇 |
1997年 | 319篇 |
1996年 | 252篇 |
1995年 | 189篇 |
1994年 | 175篇 |
1993年 | 129篇 |
1992年 | 111篇 |
1991年 | 74篇 |
1990年 | 57篇 |
1989年 | 59篇 |
1988年 | 61篇 |
1987年 | 36篇 |
1986年 | 32篇 |
1985年 | 56篇 |
1984年 | 60篇 |
1983年 | 40篇 |
1982年 | 34篇 |
1981年 | 30篇 |
1980年 | 27篇 |
1979年 | 18篇 |
1977年 | 15篇 |
1976年 | 13篇 |
1965年 | 13篇 |
1955年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
Timothy Thomasma Kurt Hilbrecht 《International Journal of Flexible Manufacturing Systems》1991,3(3-4):231-250
Good methods are needed to specify, test, and debug material-handling control logic. This article surveys a number of representative methods for defining and describing control algorithms for programmable material-handling equipment used in flexible manufacturing systems. The methods are evaluated with regard to their suitability for communication between people and as bases for interfaces to automatic program generators. It is concluded that no single method is entirely satisfactory. Three methods (position diagrams, function block diagrams, and operation networks) have potential to be combined into an effective hybrid approach that minimizes the need for the user to switch between various conceptual models. 相似文献
2.
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. 相似文献
3.
Results from applying the model on a sample of contractors, the majority of whom were international and operating in Egypt, reinforces the credibility of the developed methodology, claim the authors. 相似文献
4.
Siba Prasada Panigrahi Santanu Kumar Nayak Sasmita Kumari Padhy 《International Journal of Adaptive Control and Signal Processing》2008,22(7):705-716
This paper presents a neuro‐fuzzy network (NFN) where all its parameters can be tuned simultaneously using genetic algorithms (GAs). The approach combines the merits of fuzzy logic theory, neural networks and GAs. The proposed NFN does not require a priori knowledge about the system and eliminates the need for complicated design steps such as manual tuning of input–output membership functions, and selection of fuzzy rule base. Although, only conventional GAs have been used, convergence results are very encouraging. A well‐known numerical example derived from literature is used to evaluate and compare the performance of the network with other equalizing approaches. Simulation results show that the proposed neuro‐fuzzy controller, all parameters of which have been tuned simultaneously using GAs, offers advantages over existing equalizers and has improved performance. From the perspective of application and implementation, this paper is very interesting as it provides a new method for performing blind equalization. The main contribution of this paper is the use of learning algorithms to train a feed‐forward neural network for M‐ary QAM and PSK signals. This paper also provides a platform for researchers of the area for further development. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
5.
本文简要介绍了国外在开发超酸性气体过程中遇到的材料选择、腐蚀监测、水化物堵塞、超酸性气的处理和加工等问题所采取的措施和办法。 相似文献
6.
文章较全面的介绍了如何根据设备、装置、构件所处的工作环境及使用条件进行防腐蚀设计,及其防腐蚀设计的内容和注意事项,选择合适的防腐蚀材料,确保产品的使用寿命 相似文献
8.
9.
The search for good lineal, or depth-first, spanning trees is an important aspect in the implementation of a wide assortment of graph algorithms. We consider the complexity of findingoptimal lineal spanning trees under various notions of optimality. In particular, we show that several natural problems, such as constructing a shortest or a tallest lineal tree, are NP-hard. We also address the issue of polynomial-time, near-optimization strategies for these difficult problems, showing that efficient absolute approximation algorithms cannot exist unlessP = NP.This author's research was supported in part by the Sandia University Research Program and by the National Science Foundation under Grant M IP-8603879.This author's research was supported in part by the National Science Foundation under Grants ECS-8403859 and MIP-8603879. 相似文献
10.
Paolo Detti 《Journal of Scheduling》2008,11(3):205-212
A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C=2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the number of scheduled
jobs. 相似文献