全文获取类型
收费全文 | 23834篇 |
免费 | 2986篇 |
国内免费 | 2231篇 |
专业分类
电工技术 | 2285篇 |
技术理论 | 1篇 |
综合类 | 2783篇 |
化学工业 | 1102篇 |
金属工艺 | 395篇 |
机械仪表 | 1913篇 |
建筑科学 | 644篇 |
矿业工程 | 330篇 |
能源动力 | 568篇 |
轻工业 | 1138篇 |
水利工程 | 441篇 |
石油天然气 | 511篇 |
武器工业 | 342篇 |
无线电 | 2196篇 |
一般工业技术 | 1819篇 |
冶金工业 | 429篇 |
原子能技术 | 85篇 |
自动化技术 | 12069篇 |
出版年
2024年 | 109篇 |
2023年 | 263篇 |
2022年 | 597篇 |
2021年 | 621篇 |
2020年 | 640篇 |
2019年 | 598篇 |
2018年 | 535篇 |
2017年 | 688篇 |
2016年 | 824篇 |
2015年 | 987篇 |
2014年 | 1275篇 |
2013年 | 1553篇 |
2012年 | 1636篇 |
2011年 | 1874篇 |
2010年 | 1445篇 |
2009年 | 1718篇 |
2008年 | 1880篇 |
2007年 | 2061篇 |
2006年 | 1809篇 |
2005年 | 1458篇 |
2004年 | 1285篇 |
2003年 | 1039篇 |
2002年 | 859篇 |
2001年 | 653篇 |
2000年 | 580篇 |
1999年 | 391篇 |
1998年 | 325篇 |
1997年 | 270篇 |
1996年 | 182篇 |
1995年 | 133篇 |
1994年 | 111篇 |
1993年 | 83篇 |
1992年 | 86篇 |
1991年 | 55篇 |
1990年 | 43篇 |
1989年 | 43篇 |
1988年 | 55篇 |
1987年 | 32篇 |
1986年 | 25篇 |
1985年 | 34篇 |
1984年 | 48篇 |
1983年 | 27篇 |
1982年 | 21篇 |
1981年 | 20篇 |
1980年 | 19篇 |
1979年 | 12篇 |
1978年 | 7篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
一种改进的共同进化遗传算法及其应用 总被引:2,自引:0,他引:2
将共同进化遗传算法应用于临床营养决策优化中,虽然取得了一定成果,但算法中仍存在早熟现象、局部搜索能量弱等问题,为此提出一种改进的共同进化模型。算法使用新的子群体划分方法和交叉算子,引入精英保留策略、信息交换原则和小生境技术。通过对糖尿病营养治疗的仿真表明,改进后的算法在保证群体多样性和避免早熟现象的前提下,提高了算法的局部和全局寻优能力,且膳食配方中营养素达标率符合要求,满足专家建议的糖尿病饮食需求。 相似文献
12.
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. 相似文献
13.
We study epidemic schemes in the context of collaborative data delivery. In this context, multiple chunks of data reside at different nodes, and the challenge is to simultaneously deliver all chunks to all nodes. 相似文献
14.
15.
Yurak Son Takuya Kamano Takashi Yasuno Takayuki Suzuki Hironobu Harada 《Electrical Engineering in Japan》2006,155(1):35-43
This paper describes the generation of adaptive gait patterns using new Central Pattern Generators (CPGs) including motor dynamic models for a quadruped robot under various environments. The CPGs act as the flexible oscillators of the joints and adjust joint angles to required values. The CPGs are interconnected with each other and sets of their coupling parameters are adjusted by a genetic algorithm so that the quadruped robot can realize stable and adequate gait patterns. Generation of gait patterns results in the formation of the CPG networks suitable for the formation of not only a straight walking pattern but also of rotating gait patterns. Experimental results demonstrate that the proposed CPG networks are effective for the automatic adjustment of the adaptive gait patterns for the tested quadruped robot under various environments. Furthermore, the target tracking control based on image processing is achieved by combining the general gait patterns. © 2006 Wiley Periodicals, Inc. Electr Eng Jpn, 155(1): 35–43, 2006; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.20225 相似文献
16.
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. 相似文献
17.
Diane J. Cook 《Applied Intelligence》1991,1(2):133-144
Analogical planning provides a means of solving engineering problems where other machine learning methods fail. Unlike many machine learning paradigms, analogy does not require numerous previous examples or a rich domain theory. Instead, analogical planners adapt knowledge of solved problems in similar domains to the current problem. Unfortunately, the analogical planning task is an expensive one. While the process of forming correspondences between a known problem and a new problem is complex, the problem of selecting a base case for the analogy is virtually intractable.This paper addresses the issue of efficiently forming analogical plans. The Anagram planning system is described, which takes advantage of the massively parallel architecture of the Connection Machine to perform base selection and map formation. Anagram provides a tractable solution to analogical planning, with a complexity that is sublinear in the size of the plans.This paper describes the Anagram system and its parallel algorithms. The paper also presents theoretical analyses and empirical results of testing the system on a large database of plans from the domain of automatic programming. 相似文献
18.
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. 相似文献
19.
The recommendation of the CIE has been followed as closely as possible to evaluate the accuracy of five color gamut mapping algorithms (GMAs)—two nonspatial and three spatial algorithms—by psychophysical experiments with 20 test images, 20 observers, one test done on paper and a second one on display. Even though the results do not show any overall “winner,” one GMA is definitely perceived as not accurate. The importance of a high number of test images to obtain robust evaluation is underlined by the high variability of the results depending on the test images. Significant correlations between the percentage of out‐of‐gamut pixels, the number of distinguishable pairs of GMAs, and the perceived difficulty to distinguish them have been found. The type of observers is also important. The experts, who prefer a spatial GMA, show a stronger consensus and look especially for a good rendering of details, whereas the nonexperts hardly make a difference between the GMAs. © 2008 Wiley Periodicals, Inc. Col Res Appl, 33, 470–476, 2008 相似文献
20.
Sun-Yuan Hsieh 《The Journal of supercomputing》2007,39(1):39-57
A graph is distance-hereditary if the distance stays the same between any of two vertices in every connected induced subgraph containing both. Two well-known
classes of graphs, trees and cographs, both belong to distance-hereditary graphs. In this paper, we first show that the perfect
domination problem can be solved in sequential linear-time on distance-hereditary graphs. By sketching some regular property
of the problem, we also show that it can be easily parallelized on distance-hereditary graphs. 相似文献