全文获取类型
收费全文 | 380133篇 |
免费 | 4378篇 |
国内免费 | 763篇 |
专业分类
电工技术 | 7827篇 |
综合类 | 645篇 |
化学工业 | 55587篇 |
金属工艺 | 16325篇 |
机械仪表 | 14413篇 |
建筑科学 | 9226篇 |
矿业工程 | 1604篇 |
能源动力 | 9136篇 |
轻工业 | 32214篇 |
水利工程 | 3593篇 |
石油天然气 | 4945篇 |
武器工业 | 8篇 |
无线电 | 46465篇 |
一般工业技术 | 76887篇 |
冶金工业 | 62112篇 |
原子能技术 | 6467篇 |
自动化技术 | 37820篇 |
出版年
2021年 | 2289篇 |
2019年 | 2159篇 |
2018年 | 11666篇 |
2017年 | 12142篇 |
2016年 | 8070篇 |
2015年 | 3102篇 |
2014年 | 4553篇 |
2013年 | 14379篇 |
2012年 | 9925篇 |
2011年 | 18195篇 |
2010年 | 15677篇 |
2009年 | 15711篇 |
2008年 | 15900篇 |
2007年 | 17867篇 |
2006年 | 8599篇 |
2005年 | 11483篇 |
2004年 | 9677篇 |
2003年 | 9070篇 |
2002年 | 7964篇 |
2001年 | 7617篇 |
2000年 | 7344篇 |
1999年 | 7579篇 |
1998年 | 17675篇 |
1997年 | 12846篇 |
1996年 | 10119篇 |
1995年 | 7891篇 |
1994年 | 7238篇 |
1993年 | 6929篇 |
1992年 | 5306篇 |
1991年 | 5090篇 |
1990年 | 4941篇 |
1989年 | 4786篇 |
1988年 | 4683篇 |
1987年 | 3895篇 |
1986年 | 4010篇 |
1985年 | 4721篇 |
1984年 | 4276篇 |
1983年 | 4025篇 |
1982年 | 3604篇 |
1981年 | 3761篇 |
1980年 | 3459篇 |
1979年 | 3422篇 |
1978年 | 3226篇 |
1977年 | 3814篇 |
1976年 | 4853篇 |
1975年 | 2781篇 |
1974年 | 2662篇 |
1973年 | 2678篇 |
1972年 | 2220篇 |
1971年 | 1965篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
921.
922.
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. 相似文献
923.
R. A. Borzooei M. Bakhshi M. Mashinchi 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2008,12(8):739-749
In this paper, we study the lattice structure of some fuzzy algebraic systems such as (G-)fuzzy groups, some fuzzy ordered
algebras and fuzzy hyperstructures. We prove that under suitable conditions, these structures form a distributive or modular
lattice.
This research partially is supported by the “ Fuzzy Systems and its Applications Center of Excelence, Shahid Bahonar University
of Kerman, Iran”. 相似文献
924.
925.
S. Kazemi M. Fotuhi-Firuzabad R. Billinton 《Generation, Transmission & Distribution, IET》2007,1(2):223-233
Automation can greatly enhance distribution-network reliability by speeding up service restoration and thus significantly reduce customer-outage time. The paper presents an approach to assess quantitatively the adequacy of a particular automated distribution scheme designated as the `low interruption system' (LIS). Owing to the use of a high-speed communication system and line sensors, this automated scheme can reduce drastically the number of interruptions, the service interruption time and also the area affected by the fault. This scheme provides a simple and cost-effective way to automate distribution systems in which the remotely controlled switches speed up isolation of faulted sections and the restoration of healthy sections through alternative routes. The step-by-step calculation procedure is presented using a typical small automated distribution system. The proposed technique is then applied to a larger distribution system to examine the effectiveness of the technique and also to examine the level of reliability improvement achieved by automation 相似文献
926.
Amnon H. Eden 《Minds and Machines》2007,17(1):121-123
927.
ABSTRACT Postmortem structural changes in titin and nebulin filaments were investigated by incubating isolated myofibrils in a solution containing 0.1 mM calcium ions and various concentrations of a protease inhibitor. The inhibition curves showed 2 abnormal steps with increases in the concentration of leupeptin or calpastatin domain I. While the amounts of unchanged titin and nebulin were constant in the 1st step, the 2nd occurred at higher protease inhibitor concentrations. These facts indicated that excess amounts of leupeptin and calpastatin domain I caused deterioration in titin and nebulin properties, thus interfering with the binding of calcium ions. We concluded that the severance of titin and nebulin filaments in the 1st step were induced by calcium ions at 0.1 mM. 相似文献
928.
Entrainment and musicality in the human system interface 总被引:1,自引:1,他引:0
Satinder P. Gill 《AI & Society》2007,21(4):567-605
What constitutes our human capacity to engage and be in the same frame of mind as another human? How do we come to share a sense of what ‘looks good’ and what ‘makes sense’? How do we handle differences and come to coexist with them? How do we come to feel that we understand what someone else is experiencing? How are we able to walk in silence with someone familiar and be sharing a peaceful space? All of these aspects are part of human ‘interaction’. In designing interactive technologies designers have endeavoured to explicate, analyse and simulate, our capacity for social adaptation. Their motivations are mixed and include the desires to improve efficiency, improve consumption, to connect people, to make it easier for people to work together, to improve education and learning. In these endeavours to explicate, analyse and simulate, there is a fundamental human capacity that is beyond technology and that facilitates these aspects of being, feeling and thinking with others. That capacity, we suggest, is human entrainment. This is our ability to coordinate the timing of our behaviours and rhythmically synchronise our attentional resources. Expressed within the movements of our bodies and voices, it has a quality that is akin to music. In this paper, disparate domains of research such as pragmatics, social psychology, behaviourism, cognitive science, computational linguistics, gesture, are brought together, and considered in light of the developments in interactive technology, in order to shape a conceptual framework for understanding entrainment in everyday human interaction. 相似文献
929.
We present a new algorithm,
called MCS-M,
for computing minimal triangulations of graphs.
Lex-BFS, a seminal algorithm for recognizing chordal graphs,
was the genesis for two other classical algorithms:
LEX M and MCS.
LEX M extends the fundamental concept used in Lex-BFS,
resulting in an algorithm that not only recognizes chordality,
but also computes a minimal triangulation of an arbitrary graph.
MCS simplifies the fundamental concept used in Lex-BFS,
resulting in a simpler algorithm for recognizing chordal graphs.
The new algorithm MCS-M combines
the extension of LEX M with the simplification of MCS,
achieving all the results of LEX M in the same time complexity. 相似文献
930.
Abstract A comparison of three different but related numerical methods for control constrained optimal control of the Burgers equation is carried out. We develop the principal ideas of the different strategies considered and present detailed numerical examples. Lastly, conclusions about the behavior of the approaches are obtained. 相似文献