全文获取类型
收费全文 | 2987篇 |
免费 | 77篇 |
国内免费 | 13篇 |
专业分类
电工技术 | 46篇 |
综合类 | 2篇 |
化学工业 | 437篇 |
金属工艺 | 88篇 |
机械仪表 | 171篇 |
建筑科学 | 61篇 |
矿业工程 | 3篇 |
能源动力 | 116篇 |
轻工业 | 87篇 |
水利工程 | 28篇 |
石油天然气 | 8篇 |
无线电 | 536篇 |
一般工业技术 | 536篇 |
冶金工业 | 368篇 |
原子能技术 | 18篇 |
自动化技术 | 572篇 |
出版年
2023年 | 31篇 |
2022年 | 69篇 |
2021年 | 69篇 |
2020年 | 60篇 |
2019年 | 61篇 |
2018年 | 80篇 |
2017年 | 72篇 |
2016年 | 90篇 |
2015年 | 59篇 |
2014年 | 76篇 |
2013年 | 189篇 |
2012年 | 105篇 |
2011年 | 143篇 |
2010年 | 112篇 |
2009年 | 106篇 |
2008年 | 112篇 |
2007年 | 105篇 |
2006年 | 97篇 |
2005年 | 80篇 |
2004年 | 61篇 |
2003年 | 57篇 |
2002年 | 66篇 |
2001年 | 55篇 |
2000年 | 63篇 |
1999年 | 58篇 |
1998年 | 118篇 |
1997年 | 83篇 |
1996年 | 85篇 |
1995年 | 50篇 |
1994年 | 49篇 |
1993年 | 45篇 |
1992年 | 46篇 |
1991年 | 35篇 |
1990年 | 40篇 |
1989年 | 39篇 |
1988年 | 32篇 |
1987年 | 30篇 |
1986年 | 27篇 |
1985年 | 35篇 |
1984年 | 22篇 |
1983年 | 32篇 |
1982年 | 27篇 |
1981年 | 29篇 |
1980年 | 30篇 |
1979年 | 34篇 |
1978年 | 17篇 |
1977年 | 17篇 |
1976年 | 22篇 |
1975年 | 11篇 |
1973年 | 11篇 |
排序方式: 共有3077条查询结果,搜索用时 187 毫秒
61.
The present work demonstrates a new variant of the harmony search (HS) algorithm where bandwidth (BW) is one of the deciding factors for the time complexity and the performance of the algorithm. The BW needs to have both explorative and exploitative characteristics. The ideology is to use a large BW to search in the full domain and to adjust the BW dynamically closer to the optimal solution. After trying a series of approaches, a methodology inspired by the functioning of a low-pass filter showed satisfactory results. This approach was implemented in the self-adaptive improved harmony search (SIHS) algorithm and tested on several benchmark functions. Compared to the existing HS algorithm and its variants, SIHS showed better performance on most of the test functions. Thereafter, the algorithm was applied to geometric parameter optimization of a friction stir welding tool. 相似文献
62.
After being poisoned by eating the mushroom species Cortinarius speciosissimus, a twin developed interstitial nephritis with acute renal failure. He received a renal transplant from his living twin brother, who was presumed dizygotic on phenotypic grounds. Fifteen years later, the twins were zygosity tested by DNA "fingerprint analysis" and found to be monozygotic, despite important phenotypic discordances. The recipient has discontinued immunosuppression therapy and remains well after 9 months. We suggest that, for medical and other reasons, zygosity should be determined at birth on all like-sexed twins. 相似文献
63.
Classification of Text Documents 总被引:14,自引:0,他引:14
64.
PVC-Based 2,2,2-Cryptand Sensor for Zinc Ions 总被引:1,自引:0,他引:1
A PVC-based membrane of 2,2,2-cryptand exhibits a very good response for Zn(2+) in a wide concentration range (from 2.06 ppm to 6.54 × 10(3) ppm) with a slope of 22.0 mV/decade of Zn(2+) concentration. The response time of the sensor is <10 s, and the membrane can be used for more than 3 months without any observed divergence in potentials. The proposed sensor exhibits very good selectivity for Zn(2+) over other cations and can be used in a wide pH range (2.8-7.0). It has also been possible to use this assembly as an indicator electrode in potentiometric titrations involving zinc ions. 相似文献
65.
Jain A 《Multibody System Dynamics》2011,26(3):335-365
This second part of a two part paper uses concepts from graph theory to obtain a deeper understanding of the mathematical
foundations of multibody dynamics. The first part (Jain in Graph theoretic foundations of multibody dynamics. Part I. Structural
properties, 2010) established the block-weighted adjacency (BWA) matrix structure of spatial operators associated with serial- and tree-topology multibody system dynamics, and introduced
the notions of spatial kernel operators (SKO) and spatial propagation operators (SPO). This paper builds upon these connections to show that key analytical results and computational algorithms are a direct
consequence of these structural properties and require minimal assumptions about the specific nature of the underlying multibody
system. We formalize this notion by introducing the notion of SKO models for general tree-topology multibody systems. We show that key analytical results, including mass-matrix factorization, inversion,
and decomposition hold for all SKO models. It is also shown that key low-order scatter/gather recursive computational algorithms
follow directly from these abstract-level analytical results. Application examples to illustrate the concrete application
of these general results are provided. The paper also describes a general recipe for developing SKO models. The abstract nature
of SKO models allows for the application of these techniques to a very broad class of multibody systems. 相似文献
66.
67.
This article addresses the issue of visual landmark recognition in autonomous robot navigation along known routes, by intuitively
exploiting the functions of the human visual system and its navigational ability. A feedforward–feedbackward architecture
has been developed for recognising visual landmarks in real time. It integrates the theoretical concepts from the pre-attentive
and attentive stages in the human visual system, the selective attention adaptive resonance theory neural network and its
derivatives, and computational approaches towards object recognition in computer vision. The architecture mimics the pre-attentive
and attentive stages in the context of object recognition, embedding neural network processing paradigm into a computational
template-matching approach in computer vision. The real-time landmark recognition capability is achieved by mimicking the
pre-attentive stage, where it models a selective attention mechanism for optimal computational resource allocation, focusing
only on the regions of interest to address the computational restrictive nature of current computer processing power. Similarly,
the recognition of visual landmarks in both clean and cluttered backgrounds is implemented in the attentive stage by developing
a memory feedback modulation (MFM) mechanism that enables knowledge from the memory to interact and enhance the efficiency
of earlier stages in the architecture. Furthermore, it also incorporates both top-down and bottom-up facilitatory and inhibition
pathways between the memory and the earlier stages to enable the architecture to recognise a 2D landmark, which is partially
occluded by adjacent features in the surroundings. The results show that the architecture is able to recognise objects in
cluttered backgrounds using real-images in both indoor and outdoor scenes. Furthermore, the architecture application in autonomous
robot navigation has been demonstrated through a number of real-time trials in both indoor and outdoor environments. 相似文献
68.
Clubfoot is a challenging structural foot abnormality in babies and generally occurs at birth or during childhood. Due to this the abnormal posturing of the foot causes the babies to turn the ankle inward and walk along the outside edges of the foot. In medical science it is known as “congenital talipes equino varus” (CTEV). Computer modeling of prosthesis and orthosis is a perspective method for optimal design and gait is a terminology related to walking patterns of human subject. 相似文献
69.
70.
We introduce the concert (or cafeteria) queueing problem: A finite but large number of customers arrive into a queueing system
that starts service at a specified opening time. Each customer is free to choose her arrival time (before or after opening
time), and is interested in early service completion with minimal wait. These goals are captured by a cost function which
is additive and linear in the waiting time and service completion time, with coefficients that may be class dependent. We
consider a fluid model of this system, which is motivated as the fluid-scale limit of the stochastic system. In the fluid
setting, we explicitly identify the unique Nash-equilibrium arrival profile for each class of customers. Our structural results
imply that, in equilibrium, the arrival rate is increasing up until the closing time where all customers are served. Furthermore,
the waiting queue is maximal at the opening time, and monotonically decreases thereafter. In the simple single class setting,
we show that the price of anarchy (PoA, the efficiency loss relative to the socially optimal solution) is exactly two, while
in the multi-class setting we develop tight upper and lower bounds on the PoA. In addition, we consider several mechanisms
that may be used to reduce the PoA. The proposed model may explain queueing phenomena in diverse settings that involve a pre-assigned
opening time. 相似文献