全文获取类型
收费全文 | 5370篇 |
免费 | 367篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 67篇 |
综合类 | 3篇 |
化学工业 | 1522篇 |
金属工艺 | 59篇 |
机械仪表 | 150篇 |
建筑科学 | 211篇 |
矿业工程 | 9篇 |
能源动力 | 237篇 |
轻工业 | 866篇 |
水利工程 | 67篇 |
石油天然气 | 25篇 |
无线电 | 370篇 |
一般工业技术 | 850篇 |
冶金工业 | 205篇 |
原子能技术 | 29篇 |
自动化技术 | 1076篇 |
出版年
2024年 | 13篇 |
2023年 | 57篇 |
2022年 | 194篇 |
2021年 | 250篇 |
2020年 | 163篇 |
2019年 | 189篇 |
2018年 | 226篇 |
2017年 | 198篇 |
2016年 | 251篇 |
2015年 | 189篇 |
2014年 | 258篇 |
2013年 | 465篇 |
2012年 | 370篇 |
2011年 | 442篇 |
2010年 | 291篇 |
2009年 | 322篇 |
2008年 | 293篇 |
2007年 | 259篇 |
2006年 | 207篇 |
2005年 | 167篇 |
2004年 | 150篇 |
2003年 | 115篇 |
2002年 | 115篇 |
2001年 | 51篇 |
2000年 | 45篇 |
1999年 | 38篇 |
1998年 | 65篇 |
1997年 | 42篇 |
1996年 | 38篇 |
1995年 | 34篇 |
1994年 | 32篇 |
1993年 | 27篇 |
1992年 | 19篇 |
1991年 | 20篇 |
1990年 | 19篇 |
1989年 | 13篇 |
1988年 | 12篇 |
1987年 | 16篇 |
1986年 | 8篇 |
1985年 | 10篇 |
1984年 | 19篇 |
1983年 | 8篇 |
1982年 | 10篇 |
1980年 | 9篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1976年 | 6篇 |
1975年 | 5篇 |
1974年 | 4篇 |
排序方式: 共有5746条查询结果,搜索用时 15 毫秒
91.
92.
Luis V. Santana-Quintero Alfredo G. Hernández-Díaz Julián Molina Carlos A. Coello Coello Rafael Caballero 《Computers & Operations Research》2010,37(3):470-480
The aim of this paper is to show how the hybridization of a multi-objective evolutionary algorithm (MOEA) and a local search method based on the use of rough set theory is a viable alternative to obtain a robust algorithm able to solve difficult constrained multi-objective optimization problems at a moderate computational cost. This paper extends a previously published MOEA [Hernández-Díaz AG, Santana-Quintero LV, Coello Coello C, Caballero R, Molina J. A new proposal for multi-objective optimization using differential evolution and rough set theory. In: 2006 genetic and evolutionary computation conference (GECCO’2006). Seattle, Washington, USA: ACM Press; July 2006], which was limited to unconstrained multi-objective optimization problems. Here, the main idea is to use this sort of hybrid approach to approximate the Pareto front of a constrained multi-objective optimization problem while performing a relatively low number of fitness function evaluations. Since in real-world problems the cost of evaluating the objective functions is the most significant, our underlying assumption is that, by aiming to minimize the number of such evaluations, our MOEA can be considered efficient. As in its previous version, our hybrid approach operates in two stages: in the first one, a multi-objective version of differential evolution is used to generate an initial approximation of the Pareto front. Then, in the second stage, rough set theory is used to improve the spread and quality of this initial approximation. To assess the performance of our proposed approach, we adopt, on the one hand, a set of standard bi-objective constrained test problems and, on the other hand, a large real-world problem with eight objective functions and 160 decision variables. The first set of problems are solved performing 10,000 fitness function evaluations, which is a competitive value compared to the number of evaluations previously reported in the specialized literature for such problems. The real-world problem is solved performing 250,000 fitness function evaluations, mainly because of its high dimensionality. Our results are compared with respect to those generated by NSGA-II, which is a MOEA representative of the state-of-the-art in the area. 相似文献
93.
Luis de-Marcos José Ramón Hilera Roberto Barchino Lourdes Jiménez José Javier Martínez José Antonio Gutiérrez José María Gutiérrez Salvador Otón 《Computers & Education》2010
Mobile learning is considered an evolution of e-learning that embraces the ubiquitous nature of current computational systems in order to improve teaching and learning. Within this context it is possible to develop mobile applications oriented to learning, but it is also important to assess to what extent such applications actually work. In this paper we present a new tool designed to reinforce students’ knowledge by means of self-assessment. Improvement in student achievement was evaluated and an attitudinal survey was also carried out to measure student attitudes towards this new tool. Three different experimental groups were selected for this research, with students aged from 14 to 21 years old, including high-school and university students. Results show that this kind of tool improves student achievement, especially amongst younger learners, with a relatively low impact on current teaching activities and methodology. 相似文献
94.
Soledad Escolar Díaz Florin Isaila Alejandro Calderón Mateos Luis Miguel Sanchez García David E. Singh 《The Journal of supercomputing》2010,51(1):76-93
In the last years the Wireless Sensor Networks’ (WSN) technology has been increasingly employed in various application domains.
The extensive use of WSN posed new challenges in terms of both scalability and reliability. This paper proposes Sensor Node
File System (SENFIS), a novel file system for sensor nodes, which addresses both scalability and reliability concerns. SENFIS
can be mainly used in two broad scenarios. First, it can transparently be employed as a permanent storage for distributed
TinyDB queries, in order to increase the reliability and scalability. Second, it can be directly used by a WSN application
for permanent storage of data on the WSN nodes. The experimental section shows that SENFIS implementation makes an efficient
use of resources in terms of energy consumption, memory footprint, flash wear levelling, while achieving execution times similarly
with existing WSN file systems. 相似文献
95.
David Schleicher Luis M. Bergasa Manuel Ocaña Rafael Barea Elena López 《Robotics and Autonomous Systems》2010,58(8):991-1002
In this paper we present a new real-time hierarchical (topological/metric) Visual SLAM system focusing on the localization of a vehicle in large-scale outdoor urban environments. It is exclusively based on the visual information provided by a cheap wide-angle stereo camera. Our approach divides the whole map into local sub-maps identified by the so-called fingerprints (vehicle poses). At the sub-map level (low level SLAM), 3D sequential mapping of natural landmarks and the robot location/orientation are obtained using a top-down Bayesian method to model the dynamic behavior. A higher topological level (high level SLAM) based on fingerprints has been added to reduce the global accumulated drift, keeping real-time constraints. Using this hierarchical strategy, we keep the local consistency of the metric sub-maps, by mean of the EKF, and global consistency by using the topological map and the MultiLevel Relaxation (MLR) algorithm. Some experimental results for different large-scale outdoor environments are presented, showing an almost constant processing time. 相似文献
96.
Miguel Juliá Óscar Reinoso Arturo Gil Mónica Ballesta Luis Payá 《Engineering Applications of Artificial Intelligence》2010,23(4):473-486
In this paper we present a hybrid reactive/deliberative approach to the multi-robot integrated exploration problem. In contrast to other works, the design of the reactive and deliberative processes is exclusively oriented to the exploration having both the same importance level. The approach is based on the concepts of expected safe zone and gateway cell. The reactive exploration of the expected safe zone of the robot by means of basic behaviours avoids the presence of local minima. Simultaneously, a planner builds up a decision tree in order to decide between exploring the current expected safe zone or changing to other zone by means of travelling to a gateway cell. Furthermore, the model takes into account the degree of localization of the robots to return to previously explored areas when it is necessary to recover the certainty in the position of the robots. Several simulations demonstrate the validity of the approach. 相似文献
97.
Tuttle C Nonato LG Silva CT 《IEEE transactions on visualization and computer graphics》2010,16(6):1063-1072
Public genealogical databases are becoming increasingly populated with historical data and records of the current population's ancestors. As this increasing amount of available information is used to link individuals to their ancestors, the resulting trees become deeper and more dense, which justifies the need for using organized, space-efficient layouts to display the data. Existing layouts are often only able to show a small subset of the data at a time. As a result, it is easy to become lost when navigating through the data or to lose sight of the overall tree structure. On the contrary, leaving space for unknown ancestors allows one to better understand the tree's structure, but leaving this space becomes expensive and allows fewer generations to be displayed at a time. In this work, we propose that the H-tree based layout be used in genealogical software to display ancestral trees. We will show that this layout presents an increase in the number of displayable generations, provides a nicely arranged, symmetrical, intuitive and organized fractal structure, increases the user's ability to understand and navigate through the data, and accounts for the visualization requirements necessary for displaying such trees. Finally, user-study results indicate potential for user acceptance of the new layout. 相似文献
98.
Francisco J. Rubio Francisco J. Valero Jose Luis Suñer Vicente Mata 《Asian journal of control》2010,12(4):468-479
This paper addresses the solution of smooth trajectory planning for industrial robots in environments with obstacles using a direct method, creating the trajectory gradually as the robot moves. The presented method deals with the uncertainties associated with the lack of knowledge of kinematic properties of intermediate via‐points since they are generated as the algorithm evolves looking for the solution. Several cost functions are also proposed, which use the time that has been calculated to guide the robot motion. The method has been applied successfully to a PUMA 560 robot and four operational parameters (execution time, computational time, distance travelled and number of configurations) have been computed to study the properties and influence of each cost function on the trajectory obtained. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society 相似文献
99.
This article proposes an optimization–simulation model for planning the transport of supplies to large public infrastructure
works located in congested urban areas. The purpose is to minimize their impact on the environment and on private transportation
users on the local road network. To achieve this goal, the authors propose and solve an optimization problem for minimizing
the total system cost made up of operating costs for various alternatives for taking supplies to the worksite and the costs
supported by private vehicle users as a result of increased congestion due to the movement of heavy goods vehicles transporting
material to the worksite. The proposed optimization problem is a bi-level Math Program model. The upper level defines the
total cost of the system, which is minimized taking into account environmental constraints on atmospheric and noise pollution.
The lower level defines the optimization problem representing the private transportation user behavior, assuming they choose
the route that minimizes their total individual journey costs. Given the special characteristics of the problem, a heuristic
algorithm is proposed for finding optimum solutions. Both the model developed and the specific solution algorithm are applied
to the real case of building a new port at Laredo (Northern Spain). A series of interesting conclusions are obtained from
the corresponding sensitivity analysis. 相似文献
100.