全文获取类型
收费全文 | 17147篇 |
免费 | 1021篇 |
国内免费 | 59篇 |
专业分类
电工技术 | 291篇 |
综合类 | 72篇 |
化学工业 | 4495篇 |
金属工艺 | 345篇 |
机械仪表 | 500篇 |
建筑科学 | 635篇 |
矿业工程 | 48篇 |
能源动力 | 738篇 |
轻工业 | 2907篇 |
水利工程 | 200篇 |
石油天然气 | 130篇 |
无线电 | 1166篇 |
一般工业技术 | 2653篇 |
冶金工业 | 1168篇 |
原子能技术 | 101篇 |
自动化技术 | 2778篇 |
出版年
2024年 | 53篇 |
2023年 | 187篇 |
2022年 | 533篇 |
2021年 | 798篇 |
2020年 | 533篇 |
2019年 | 630篇 |
2018年 | 707篇 |
2017年 | 680篇 |
2016年 | 752篇 |
2015年 | 511篇 |
2014年 | 755篇 |
2013年 | 1382篇 |
2012年 | 1097篇 |
2011年 | 1286篇 |
2010年 | 891篇 |
2009年 | 982篇 |
2008年 | 871篇 |
2007年 | 726篇 |
2006年 | 590篇 |
2005年 | 430篇 |
2004年 | 426篇 |
2003年 | 412篇 |
2002年 | 425篇 |
2001年 | 283篇 |
2000年 | 209篇 |
1999年 | 193篇 |
1998年 | 346篇 |
1997年 | 268篇 |
1996年 | 205篇 |
1995年 | 154篇 |
1994年 | 125篇 |
1993年 | 114篇 |
1992年 | 80篇 |
1991年 | 64篇 |
1990年 | 67篇 |
1989年 | 49篇 |
1988年 | 64篇 |
1987年 | 35篇 |
1986年 | 34篇 |
1985年 | 36篇 |
1984年 | 35篇 |
1983年 | 20篇 |
1982年 | 20篇 |
1981年 | 16篇 |
1980年 | 24篇 |
1979年 | 15篇 |
1978年 | 12篇 |
1977年 | 18篇 |
1976年 | 37篇 |
1975年 | 14篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
Mathematical simulation has been widely used in biomedical and biological sciences. In the case of the surface electromyographic (SEMG) activity, some models have been proposed aiming to study muscle contraction strategies that are used during different tasks and conditions. Most of SEMG simulators are based on energy modulation of a Gaussian noise. This work proposes a novel simulator in which the user-defined parameters are associated with the motor units (MUs) recruitment and their firing rate. Comparison between the mean spectrum of real SEMG signals collected in isometric contraction of the muscle biceps brachii and the mean spectrum obtained from simulated SEMG signals showed a good agreement, pointing the proposed simulator seems to be capable to generate consistent electromyographic signals in time and frequency domains and that can be used in many studies, in particular in the evaluation of automatic methods aimed to detect muscular contraction. 相似文献
102.
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G=(V,E) with node set V={0,1,…,n} and edge set E, two integer weights, a cost ce and a delay we associated with each edge e of E, and a natural (time limit) number H, we wish to find a spanning tree T of the graph with minimum total cost and such that the unique path from a specified root node, node 0, to any other node has total delay not greater than H. This problem generalizes the well known hop-constrained spanning tree problem and arises in the design of centralized networks with quality of service constraints and also in package shipment with service guarantee constraints. We present three theoretically equivalent modeling approaches, a column generation scheme, a Lagrangian relaxation combined with subgradient optimization procedure, both based on a path formulation of the problem, and a shortest path (compact) reformulation of the problem which views the underlying subproblem as defined in a layered extended graph. We present results for complete graph instances with up to 40 nodes. Our results indicate that the layered graph path reformulation model is still quite good when the arc weights are reasonably small. Lagrangian relaxation combined with subgradient optimization procedure appears to work much better than column generation and seems to be a quite reasonable approach to the problem for large weight, and even small weight, instances. 相似文献
103.
104.
This research introduces a new optimality criterion for motion planning of wheeled mobile robots based on a cost index that assesses the nearness to singularity of forward and
inverse kinematic models. Slip motions, infinite estimation error and impossible control actions are avoided escaping from singularities. In addition, high amplification of wheel velocity errors and high wheel velocity values are
also avoided by moving far from the singularity. The proposed cost index can be used directly to complement path-planning and motion-planning techniques (e.g. tree graphs, roadmaps, etc.) in order to select the optimal collision-free path or trajectory among several possible solutions. To illustrate the applications of the proposed
approach, an industrial forklift, equivalent to a tricycle-like mobile robot, is considered in a simulated environment. In particular, several results are
validated for the proposed optimality criterion, which are extensively compared to those obtained with other classical optimality criteria, such as shortest-path, time-optimal and minimum-energy. 相似文献
105.
A steady-state interval operability methodology is introduced here for multivariable non-square systems with fewer inputs than output variables to be used in the design of model-based constrained controllers (MPC, DMC). For such systems, set-point control is not possible for all the outputs and interval control is needed. The proposed iterative approach enables the selection of the needed interval constraints systematically, so that the tightest possible control is achieved without rendering the control problem infeasible. The application of this methodology to high-dimensional industrial problems characterizing processes of Air Products and Chemicals and DuPont shows that very significant reduction of the constrained region can be achieved from the steady-state point of view. Ratios of the initial to the calculated volume of the constrained regions examined range between 104 and 108. 相似文献
106.
Huiguang Liang Ransi Nilaksha De Silva Wei Tsang Ooi Mehul Motani 《Multimedia Tools and Applications》2009,45(1-3):163-190
We collected mobility traces of avatars spanning multiple regions in Second Life, a popular user-created virtual world. We analyzed the traces to characterize the dynamics of the avatars’ mobility and behavior, both temporally and spatially. We discuss the implications of our findings on the design of peer-to-peer architecture, interest management, mobility modeling of avatars, server load balancing and zone partitioning, caching, and prefetching for user-created virtual worlds. 相似文献
107.
Guilherme T. de Assis Alberto H. F. Laender Marcos André Gonçalves Altigran S. da Silva 《World Wide Web》2009,12(3):285-319
Focused crawlers have as their main goal to crawl Web pages that are relevant to a specific topic or user interest, playing
an important role for a great variety of applications. In general, they work by trying to find and crawl all kinds of pages
deemed as related to an implicitly declared topic. However, users are often not simply interested in any document about a
topic, but instead they may want only documents of a given type or genre on that topic to be retrieved. In this article, we
describe an approach to focused crawling that exploits not only content-related information but also genre information present
in Web pages to guide the crawling process. This approach has been designed to address situations in which the specific topic
of interest can be expressed by specifying two sets of terms, the first describing genre aspects of the desired pages and
the second related to the subject or content of these pages, thus requiring no training or any kind of preprocessing. The
effectiveness, efficiency and scalability of the proposed approach are demonstrated by a set of experiments involving the
crawling of pages related to syllabi of computer science courses, job offers in the computer science field and sale offers
of computer equipments. These experiments show that focused crawlers constructed according to our genre-aware approach achieve
levels of F1 superior to 88%, requiring the analysis of no more than 65% of the visited pages in order to find 90% of the
relevant pages. In addition, we experimentally analyze the impact of term selection on our approach and evaluate a proposed
strategy for semi-automatic generation of such terms. This analysis shows that a small set of terms selected by an expert
or a set of terms specified by a typical user familiar with the topic is usually enough to produce good results and that such
a semi-automatic strategy is very effective in supporting the task of selecting the sets of terms required to guide a crawling
process. 相似文献
108.
Luis Rodero-Merino Antonio Fernández Anta Luis López Vicent Cholvi 《Computer Networks》2009,53(10):1722-1736
The problem of efficient resource location is an important open issue in P2P systems. This paper introduces DANTE, a self-adapting P2P system that changes its peer links to form topologies where resources are located in an efficient manner via random walks. Additionally, this same self-adaptation capacity makes DANTE capable of reacting to events like changes in the system load or attacks on well-connected nodes by adjusting the topology to the new scenario. This adaptive behavior emerges as the global result of the individual work of nodes, without the intervention of any central entity or the need for global knowledge. Simulations show that this adaptation process makes the system scalable, resilient to attacks, and tolerant to a high transitivity of peers. Simulations are also used to compare this solution with other well-known self-adapting P2P system. From these results it can be concluded that the topologies achieved by DANTE offer better performance. 相似文献
109.
Luis Gracia Carlos Perez-Vidal 《International Journal of Control, Automation and Systems》2009,7(5):764-776
This research presents a new control scheme for visual servoing that takes into account the delay introduced by image acquisition
and image processing. Firstly, previous control schemes for visual servoing are discussed and then a new control scheme is
proposed and fully described. Afterwards, the capabilities (steady-state errors, stability margins, step time response, etc.)
of the proposed control scheme and of previous ones are analytically analyzed and compared. Next, several simulations and
experimental results are provided to validate the analytical results and to illustrate the benefits of the proposed control
scheme. In particular, it is shown that this new control scheme clearly improves the performance of the previous ones. 相似文献
110.
Da Silva LB Barbee TW Cauble R Celliers P Ciarlo D Moreno JC Mrowka S Trebes JE Wan AS Weber F 《Applied optics》1995,34(28):6389-6392
The development of multilayer mirror technology capable of operating in the range of 3-30 nm and the construction of thin membranes with excellent uniformity and strength have made it possible to design and implement a Mach-Zehnder interferometer operating at 15.5 nm. We have tested this interferometer by using a soft x-ray laser as a source, and we show its use in probing high-density plasmas. 相似文献