全文获取类型
收费全文 | 440496篇 |
免费 | 5162篇 |
国内免费 | 1117篇 |
专业分类
电工技术 | 8300篇 |
综合类 | 2887篇 |
化学工业 | 63198篇 |
金属工艺 | 19433篇 |
机械仪表 | 16930篇 |
建筑科学 | 10827篇 |
矿业工程 | 2067篇 |
能源动力 | 10033篇 |
轻工业 | 34723篇 |
水利工程 | 4409篇 |
石油天然气 | 5236篇 |
武器工业 | 8篇 |
无线电 | 53322篇 |
一般工业技术 | 87699篇 |
冶金工业 | 63498篇 |
原子能技术 | 6624篇 |
自动化技术 | 57581篇 |
出版年
2021年 | 2274篇 |
2019年 | 2153篇 |
2018年 | 22865篇 |
2017年 | 22378篇 |
2016年 | 15815篇 |
2015年 | 3528篇 |
2014年 | 4706篇 |
2013年 | 14493篇 |
2012年 | 12074篇 |
2011年 | 24966篇 |
2010年 | 21495篇 |
2009年 | 19665篇 |
2008年 | 20662篇 |
2007年 | 23140篇 |
2006年 | 8668篇 |
2005年 | 12198篇 |
2004年 | 10347篇 |
2003年 | 9822篇 |
2002年 | 8314篇 |
2001年 | 7691篇 |
2000年 | 7461篇 |
1999年 | 7607篇 |
1998年 | 17699篇 |
1997年 | 12856篇 |
1996年 | 10145篇 |
1995年 | 7890篇 |
1994年 | 7234篇 |
1993年 | 6932篇 |
1992年 | 5307篇 |
1991年 | 5105篇 |
1990年 | 4933篇 |
1989年 | 4782篇 |
1988年 | 4682篇 |
1987年 | 3887篇 |
1986年 | 4009篇 |
1985年 | 4717篇 |
1984年 | 4275篇 |
1983年 | 4021篇 |
1982年 | 3601篇 |
1981年 | 3761篇 |
1980年 | 3456篇 |
1979年 | 3418篇 |
1978年 | 3225篇 |
1977年 | 3814篇 |
1976年 | 4847篇 |
1975年 | 2780篇 |
1974年 | 2660篇 |
1973年 | 2675篇 |
1972年 | 2215篇 |
1971年 | 1963篇 |
排序方式: 共有10000条查询结果,搜索用时 281 毫秒
991.
992.
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”. 相似文献
993.
Somsak Vanit-Anunchai Jonathan Billington Guy Edward Gallasch 《International Journal on Software Tools for Technology Transfer (STTT)》2008,10(1):29-56
State space explosion is a key problem in the analysis of finite state systems. The sweep-line method is a state exploration
method which uses a notion of progress to allow states to be deleted from memory when they are no longer required. This reduces
the peak number of states that need to be stored, while still exploring the full state space. The technique shows promise
but has never achieved reductions greater than about a factor of 10 in the number of states stored in memory for industrially
relevant examples. This paper discusses sweep-line analysis of the connection management procedures of a new Internet standard,
the Datagram Congestion Control Protocol (DCCP). As the intuitive approaches to sweep-line analysis are not effective, we
introduce new variables to track progress. This creates further state explosion. However, when used with the sweep-line, the
peak number of states is reduced by over two orders of magnitude compared with the original. Importantly, this allows DCCP
to be analysed for larger parameter values.
Somsak Vanit-Anunchai was partially supported by an Australian Research Council Discovery Grant (DP0559927) and Suranaree
University of Technology.
Guy Edward Gallasch was supported by an Australian Research Council Discovery Grant (DP0559927). 相似文献
994.
Takeshi Shiofuku Norihiro Abe Yoshihiro Tabuchi Hirokazu Taki Shoujie He 《Artificial Life and Robotics》2008,13(1):290-293
This paper presents an approach of measuring in real-time the vector of finger that is pointing to an object. DSP is used
in the operation processing unit in order to do the real-time processing. The steps include the extraction of flesh-colored
regions from an image, the labeling of the flesh-colored regions, and the detection of two characteristic positions on the
finger so that the direction that the finger is pointing at will be calculated. The entire process takes about 29 msec, which
makes it possible to have the frame rate of 34 fps. With this frame rate, this measurement approach is considered real-time
and promising to be merged into other application systems.
This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January
31–February 2, 2008 相似文献
995.
996.
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 相似文献
997.
Amnon H. Eden 《Minds and Machines》2007,17(1):121-123
998.
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. 相似文献
999.
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. 相似文献
1000.
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. 相似文献