全文获取类型
收费全文 | 6264篇 |
免费 | 399篇 |
国内免费 | 14篇 |
专业分类
电工技术 | 82篇 |
综合类 | 4篇 |
化学工业 | 1668篇 |
金属工艺 | 74篇 |
机械仪表 | 166篇 |
建筑科学 | 234篇 |
矿业工程 | 9篇 |
能源动力 | 267篇 |
轻工业 | 988篇 |
水利工程 | 74篇 |
石油天然气 | 27篇 |
无线电 | 461篇 |
一般工业技术 | 1040篇 |
冶金工业 | 378篇 |
原子能技术 | 38篇 |
自动化技术 | 1167篇 |
出版年
2024年 | 13篇 |
2023年 | 59篇 |
2022年 | 206篇 |
2021年 | 268篇 |
2020年 | 172篇 |
2019年 | 211篇 |
2018年 | 271篇 |
2017年 | 230篇 |
2016年 | 273篇 |
2015年 | 214篇 |
2014年 | 290篇 |
2013年 | 512篇 |
2012年 | 406篇 |
2011年 | 487篇 |
2010年 | 327篇 |
2009年 | 369篇 |
2008年 | 339篇 |
2007年 | 301篇 |
2006年 | 241篇 |
2005年 | 188篇 |
2004年 | 178篇 |
2003年 | 133篇 |
2002年 | 133篇 |
2001年 | 72篇 |
2000年 | 62篇 |
1999年 | 63篇 |
1998年 | 121篇 |
1997年 | 69篇 |
1996年 | 64篇 |
1995年 | 43篇 |
1994年 | 48篇 |
1993年 | 42篇 |
1992年 | 24篇 |
1991年 | 31篇 |
1990年 | 23篇 |
1989年 | 22篇 |
1988年 | 17篇 |
1987年 | 18篇 |
1986年 | 12篇 |
1985年 | 20篇 |
1984年 | 22篇 |
1983年 | 11篇 |
1982年 | 12篇 |
1980年 | 11篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 6篇 |
1976年 | 12篇 |
1975年 | 7篇 |
1974年 | 4篇 |
排序方式: 共有6677条查询结果,搜索用时 15 毫秒
81.
82.
Ruben Sevilla Sonia Fernández-Méndez Antonio Huerta 《Archives of Computational Methods in Engineering》2011,18(4):441-484
The development of NURBS-Enhanced Finite Element Method (NEFEM) is revisited. This technique allows a seamless integration
of the CAD boundary representation of the domain and the finite element method (FEM). The importance of the geometrical model
in finite element simulations is addressed and the benefits and potential of NEFEM are discussed and compared with respect
to other curved finite element techniques. 相似文献
83.
Bruno H. G. Barbosa Lam T. Bui Hussein A. Abbass Luis A. Aguirre Ant?nio P. Braga 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2011,15(9):1735-1747
This paper presents two new approaches for constructing an ensemble of neural networks (NN) using coevolution and the artificial
immune system (AIS). These approaches are extensions of the CLONal Selection Algorithm for building ENSembles (CLONENS) algorithm.
An explicit diversity promotion technique was added to CLONENS and a novel coevolutionary approach to build neural ensembles
is introduced, whereby two populations representing the gates and the individual NN are coevolved. The former population is
responsible for defining the ensemble size and selecting the members of the ensemble. This population is evolved using the
differential evolution algorithm. The latter population supplies the best individuals for building the ensemble, which is
evolved by AIS. Results show that it is possible to automatically define the ensemble size being also possible to find smaller
ensembles with good generalization performance on the tested benchmark regression problems. More interestingly, the use of
the diversity measure during the evolutionary process did not necessarily improve generalization. In this case, diverse ensembles
may be found using only implicit diversity promotion techniques. 相似文献
84.
Antonio Fernández Anta José Luis López-Presa M. Araceli Lorenzo Pilar Manzano Juan Martinez-Romo Alberto Mozo Christopher Thraves 《Theory of Computing Systems》2011,48(1):1-22
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in
Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized
CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing.
In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining
constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the
remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS)
and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference
is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively
(the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds
we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show
that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call
Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy
is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish,
we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection
of packets. 相似文献
85.
Machine vision represents a particularly attractive solution for sensing and detecting potential collision‐course targets due to the relatively low cost, size, weight, and power requirements of vision sensors (as opposed to radar and Traffic Alert and Collision Avoidance System). This paper describes the development and evaluation of a real‐time, vision‐based collision‐detection system suitable for fixed‐wing aerial robotics. Using two fixed‐wing unmanned aerial vehicles (UAVs) to recreate various collision‐course scenarios, we were able to capture highly realistic vision (from an onboard camera perspective) of the moments leading up to a collision. This type of image data is extremely scarce and was invaluable in evaluating the detection performance of two candidate target detection approaches. Based on the collected data, our detection approaches were able to detect targets at distances ranging from 400 to about 900 m. These distances (with some assumptions about closing speeds and aircraft trajectories) translate to an advance warning of between 8 and 10 s ahead of impact, which approaches the 12.5‐s response time recommended for human pilots. We overcame the challenge of achieving real‐time computational speeds by exploiting the parallel processing architectures of graphics processing units (GPUs) found on commercial‐off‐the‐shelf graphics devices. Our chosen GPU device suitable for integration onto UAV platforms can be expected to handle real‐time processing of 1,024 × 768 pixel image frames at a rate of approximately 30 Hz. Flight trials using manned Cessna aircraft in which all processing is performed onboard will be conducted in the near future, followed by further experiments with fully autonomous UAV platforms. © 2010 Wiley Periodicals, Inc. 相似文献
86.
Fredrik Larsson Pedro Díez Antonio Huerta 《Computer Methods in Applied Mechanics and Engineering》2010,199(37-40):2383-2402
In this contribution, we present an a posteriori error estimator for the incompressible Stokes problem valid for a conventional mixed FE formulation. Due to the saddle-point property of the problem, conventional error estimators developed for pure minimization problems cannot be utilized straight-forwardly. The new estimator is built up by two key ingredients. At first, a computed error approximation, exactly fulfilling the continuity equation for the error, is obtained via local Dirichlet problems. Secondly, we adopt the approach of solving local equilibrated flux-free problems in order to bound the remaining, incompressible, error. In this manner, guaranteed upper and lower bounds, of the velocity “energy norm” of the error as well as goal-oriented (linear) output functionals, with respect to a reference (overkill) mesh are obtained. In particular, it should be noted that this approach requires no computation of hybrid fluxes. Furthermore, the estimator is applicable to mixed FE formulations using continuous pressure approximations, such as the Mini and Taylor–Hood class of elements. In conclusion, a few simple numerical examples are presented, illustrating the accuracy of the error bounds. 相似文献
87.
Current software development often relies on non-trivial coordination logic for combining autonomous services, eventually running on different platforms. As a rule, however, such a coordination layer is strongly woven within the application at source code level. Therefore, its precise identification becomes a major methodological (and technical) problem and a challenge to any program understanding or refactoring process.The approach introduced in this paper resorts to slicing techniques to extract coordination data from source code. Such data are captured in a specific dependency graph structure from which a coordination model can be recovered either in the form of an Orc specification or as a collection of code fragments corresponding to the identification of typical coordination patterns in the system. Tool support is also discussed. 相似文献
88.
89.
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. 相似文献
90.
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. 相似文献