全文获取类型
收费全文 | 4000篇 |
免费 | 231篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 56篇 |
综合类 | 2篇 |
化学工业 | 1047篇 |
金属工艺 | 53篇 |
机械仪表 | 100篇 |
建筑科学 | 158篇 |
矿业工程 | 5篇 |
能源动力 | 137篇 |
轻工业 | 684篇 |
水利工程 | 31篇 |
石油天然气 | 21篇 |
无线电 | 252篇 |
一般工业技术 | 573篇 |
冶金工业 | 156篇 |
原子能技术 | 19篇 |
自动化技术 | 946篇 |
出版年
2024年 | 11篇 |
2023年 | 60篇 |
2022年 | 153篇 |
2021年 | 188篇 |
2020年 | 140篇 |
2019年 | 166篇 |
2018年 | 163篇 |
2017年 | 147篇 |
2016年 | 186篇 |
2015年 | 144篇 |
2014年 | 192篇 |
2013年 | 343篇 |
2012年 | 277篇 |
2011年 | 318篇 |
2010年 | 249篇 |
2009年 | 235篇 |
2008年 | 203篇 |
2007年 | 179篇 |
2006年 | 148篇 |
2005年 | 111篇 |
2004年 | 90篇 |
2003年 | 71篇 |
2002年 | 82篇 |
2001年 | 40篇 |
2000年 | 42篇 |
1999年 | 39篇 |
1998年 | 38篇 |
1997年 | 25篇 |
1996年 | 29篇 |
1995年 | 26篇 |
1994年 | 16篇 |
1993年 | 25篇 |
1992年 | 13篇 |
1991年 | 11篇 |
1990年 | 9篇 |
1989年 | 8篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 5篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1982年 | 3篇 |
1981年 | 6篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 5篇 |
1976年 | 2篇 |
1974年 | 3篇 |
1973年 | 5篇 |
排序方式: 共有4240条查询结果,搜索用时 0 毫秒
41.
Time series prediction is a complex problem that consists of forecasting the future behavior of a set of data with the only
information of the previous data. The main problem is the fact that most of the time series that represent real phenomena
include local behaviors that cannot be modelled by global approaches. This work presents a new procedure able to find predictable
local behaviors, and thus, attaining a better level of total prediction. This new method is based on a division of the input
space into Voronoi regions by means of Evolution Strategies. Our method has been tested using different time series domains.
One of them that represents the water demand in a water tank, through a long period of time. The other two domains are well
known examples of chaotic time series (Mackey-Glass) and natural phenomenon time series (Sunspot). Results prove that, in
most of cases, the proposed algorithm obtain better results than other algorithms commonly used. 相似文献
42.
MELM-GRBF: A modified version of the extreme learning machine for generalized radial basis function neural networks 总被引:3,自引:0,他引:3
Francisco Fernández-NavarroAuthor Vitae César Hervás-MartínezAuthor VitaeJavier Sanchez-MonederoAuthor Vitae Pedro Antonio GutiérrezAuthor Vitae 《Neurocomputing》2011,74(16):2502-2510
In this paper, we propose a methodology for training a new model of artificial neural network called the generalized radial basis function (GRBF) neural network. This model is based on generalized Gaussian distribution, which parametrizes the Gaussian distribution by adding a new parameter τ. The generalized radial basis function allows different radial basis functions to be represented by updating the new parameter τ. For example, when GRBF takes a value of τ=2, it represents the standard Gaussian radial basis function. The model parameters are optimized through a modified version of the extreme learning machine (ELM) algorithm. In the methodology proposed (MELM-GRBF), the centers of each GRBF were taken randomly from the patterns of the training set and the radius and τ values were determined analytically, taking into account that the model must fulfil two constraints: locality and coverage. An thorough experimental study is presented to test its overall performance. Fifteen datasets were considered, including binary and multi-class problems, all of them taken from the UCI repository. The MELM-GRBF was compared to ELM with sigmoidal, hard-limit, triangular basis and radial basis functions in the hidden layer and to the ELM-RBF methodology proposed by Huang et al. (2004) [1]. The MELM-GRBF obtained better results in accuracy than the corresponding sigmoidal, hard-limit, triangular basis and radial basis functions for almost all datasets, producing the highest mean accuracy rank when compared with these other basis functions for all datasets. 相似文献
43.
This paper presents a new approach to Particle Swarm Optimization, called Michigan Approach PSO (MPSO), and its application
to continuous classification problems as a Nearest Prototype (NP) classifier. In Nearest Prototype classifiers, a collection
of prototypes has to be found that accurately represents the input patterns. The classifier then assigns classes based on
the nearest prototype in this collection. The MPSO algorithm is used to process training data to find those prototypes. In
the MPSO algorithm each particle in a swarm represents a single prototype in the solution and it uses modified movement rules
with particle competition and cooperation that ensure particle diversity. The proposed method is tested both with artificial
problems and with real benchmark problems and compared with several algorithms of the same family. Results show that the particles
are able to recognize clusters, find decision boundaries and reach stable situations that also retain adaptation potential.
The MPSO algorithm is able to improve the accuracy of 1-NN classifiers, obtains results comparable to the best among other
classifiers, and improves the accuracy reported in literature for one of the problems.
相似文献
Pedro IsasiEmail: |
44.
Most real‐coded genetic algorithm research has focused on developing effective crossover operators, and as a result, many different types of crossover operators have been proposed. Some forms of crossover operators are more suitable to tackle certain problems than others, even at the different stages of the genetic process in the same problem. For this reason, techniques that combine multiple crossovers, called hybrid crossover operators, have been suggested as alternative schemes to the common practice of applying only one crossover model to all the elements in the population. On the other hand, there are operators with multiple offsprings, more than two descendants from two parents, which present a better behavior than the operators with only two descendants, and achieve a good balance between exploration and exploitation. © 2009 Wiley Periodicals, Inc. 相似文献
45.
In this work, we present an approach that introduces requirements traceability capabilities in the context of model-driven development of Web applications. This aspect allows us to define model-to-model transformations that not only provide a software artifact of lower abstraction (as model-to-model transformations usually do) but also to provide feedback about how they are applied. This feedback helps us to validate whether transformations are correctly applied. In particular, we present a model-to-model transformation that allows us to obtain navigational models of the Web engineering method OOWS from a requirements model. This transformation is defined as a set of mappings between these two models that have been implemented by means of graph transformations. The use of graph transformations allows us to develop a tool-supported strategy for applying mappings automatically. In addition, mechanisms for tracing requirements are also included in the definition of graph transformations. These mechanisms allow us to link each conceptual element to the requirements from which it is derived. In particular, we focus on tracing requirements throughout the navigational model, which describe the navigational structure of a Web application. To take advantage of these traceability mechanisms, we have developed a tool that obtains traceability reports after applying transformations. These reports help us to study aspects such as whether requirements are all supported, the impact of changing a requirement, or how requirements are modelled. 相似文献
46.
47.
Jesus?BrialesEmail authorView authors OrcID profile Javier?Gonzalez-Jimenez 《Journal of Mathematical Imaging and Vision》2016,55(3):266-283
We provide a simple closed-form solution to the Perspective three orthogonal angles (P3oA) problem: given the projection of three orthogonal lines in a calibrated camera, find their 3D directions. Upon this solution, an algorithm for the estimation of the camera relative rotation between two frames is proposed. The key idea is to detect triplets of orthogonal lines in a hypothesize-and-test framework and use all of them to compute the camera rotation in a robust way. This approach is suitable for human-made environments where numerous groups of orthogonal lines exist. We evaluate the numerical stability of the P3oA solution and the estimation of the relative rotation with synthetic and real data, comparing our results to other state-of-the-art approaches. 相似文献
48.
Rita Cunha Carlos Silvestre João Hespanha A. Pedro AguiarAuthor vitae 《Automatica》2011,(5):1020-1027
This paper addresses the problem of stabilizing to a desired equilibrium point an eye-in-hand system, which consists of a single camera mounted on a rigid body free to move on . It is assumed that there is a collection of landmarks fixed in the environment and that the image coordinates of those landmarks are provided to the system by an on-board CCD camera. The proposed method addresses not only the problem of stabilization but also that of maintaining feature visibility along the system’s trajectory. The resulting solution consists of a feedback control law based on the current and desired image coordinates and reconstructed attitude and depth ratio information, which guarantees that (i) the desired equilibrium point is an almost global attractor; (ii) a set of necessary conditions for feature visibility holds throughout the system’s trajectories; and (iii) the image of a predefined feature point is kept inside the camera’s field of view. 相似文献
49.
50.
Jesus Nuevo Luis M. Bergasa David F. Llorca Manuel Ocaña 《Image and vision computing》2011,29(4):209-218
This paper describes an active model with a robust texture model built on-line. The model uses one camera and it is able to operate without active illumination. The texture model is defined by a series of clusters, which are built in a video sequence using previously encountered samples. This model is used to search for the corresponding element in the following frames. An on-line clustering method, named leaderP is described and evaluated on an application of face tracking. A 20-point shape model is used. This model is built offline, and a robust fitting function is used to restrict the position of the points. Our proposal is to serve as one of the stages in a driver monitoring system. To test it, a new set of sequences of drivers recorded outdoors and in a realistic simulator has been compiled. Experimental results for typical outdoor driving scenarios, with frequent head movement, turns and occlusions are presented. Our approach is tested and compared with the Simultaneous Modeling and Tracking (SMAT) [1], and the recently presented Stacked Trimmed Active Shape Model (STASM) [2], and shows better results than SMAT and similar fitting error levels to STASM, with much faster execution times and improved robustness. 相似文献