全文获取类型
收费全文 | 31270篇 |
免费 | 1194篇 |
国内免费 | 118篇 |
专业分类
电工技术 | 410篇 |
综合类 | 230篇 |
化学工业 | 5865篇 |
金属工艺 | 667篇 |
机械仪表 | 639篇 |
建筑科学 | 1061篇 |
矿业工程 | 95篇 |
能源动力 | 1038篇 |
轻工业 | 4203篇 |
水利工程 | 269篇 |
石油天然气 | 156篇 |
武器工业 | 10篇 |
无线电 | 2436篇 |
一般工业技术 | 4571篇 |
冶金工业 | 6464篇 |
原子能技术 | 244篇 |
自动化技术 | 4224篇 |
出版年
2024年 | 56篇 |
2023年 | 174篇 |
2022年 | 576篇 |
2021年 | 908篇 |
2020年 | 575篇 |
2019年 | 660篇 |
2018年 | 758篇 |
2017年 | 847篇 |
2016年 | 802篇 |
2015年 | 620篇 |
2014年 | 974篇 |
2013年 | 1589篇 |
2012年 | 1434篇 |
2011年 | 1773篇 |
2010年 | 1295篇 |
2009年 | 1360篇 |
2008年 | 1255篇 |
2007年 | 1095篇 |
2006年 | 879篇 |
2005年 | 914篇 |
2004年 | 982篇 |
2003年 | 880篇 |
2002年 | 848篇 |
2001年 | 737篇 |
2000年 | 574篇 |
1999年 | 568篇 |
1998年 | 2113篇 |
1997年 | 1375篇 |
1996年 | 967篇 |
1995年 | 644篇 |
1994年 | 497篇 |
1993年 | 561篇 |
1992年 | 231篇 |
1991年 | 293篇 |
1990年 | 239篇 |
1989年 | 200篇 |
1988年 | 219篇 |
1987年 | 175篇 |
1986年 | 175篇 |
1985年 | 186篇 |
1984年 | 134篇 |
1983年 | 97篇 |
1982年 | 127篇 |
1981年 | 124篇 |
1980年 | 126篇 |
1979年 | 98篇 |
1978年 | 79篇 |
1977年 | 143篇 |
1976年 | 241篇 |
1975年 | 86篇 |
排序方式: 共有10000条查询结果,搜索用时 10 毫秒
291.
Xavier Suau Javier Ruiz-Hidalgo Josep R. Casas 《Computer Vision and Image Understanding》2013,117(3):281-288
End-effectors are usually related to the location of limbs, and their reliable detection enables robust body tracking as well as accurate pose estimation. Recent innovation in depth cameras has re-stated the pose estimation problem. We focus on the information provided by these sensors, for which we borrow the name 2.5D data from the Graphics community. In this paper we propose a human pose estimation algorithm based on topological propagation. Geometric Deformable Models are used to carry out such propagation, implemented according to the Narrow Band Level Set approach. A variant of the latter method is proposed, including a density restriction which helps preserving the topological properties of the object under analysis. Principal end-effectors are extracted from a directed graph weighted with geodesic distances, also providing a skeletal-like structure describing human pose. An evaluation against reference methods is performed with promising results. The proposed solution allows a frame-wise end-effector detection, with no temporal tracking involved, which may be generalized to the tracking of other objects beyond human body. 相似文献
292.
293.
Fuzzy c-means (FCMs) is an important and popular unsupervised partitioning algorithm used in several application domains such as pattern recognition, machine learning and data mining. Although the FCM has shown good performance in detecting clusters, the membership values for each individual computed to each of the clusters cannot indicate how well the individuals are classified. In this paper, a new approach to handle the memberships based on the inherent information in each feature is presented. The algorithm produces a membership matrix for each individual, the membership values are between zero and one and measure the similarity of this individual to the center of each cluster according to each feature. These values can change at each iteration of the algorithm and they are different from one feature to another and from one cluster to another in order to increase the performance of the fuzzy c-means clustering algorithm. To obtain a fuzzy partition by class of the input data set, a way to compute the class membership values is also proposed in this work. Experiments with synthetic and real data sets show that the proposed approach produces good quality of clustering. 相似文献
294.
Anderson da Silva Soares Telma Woerle de Lima Daniel Vitor de LuPcena Rogerio Lopes Salvini GustavoTeodoro Laureano Clarimar Jose Coelho 《计算机技术与应用:英文》2013,(9):466-475
The multiple determination tasks of chemical properties are a classical problem in analytical chemistry. The major problem is concerned in to find the best subset of variables that better represents the compounds. These variables are obtained by a spectrophotometer device. This device measures hundreds of correlated variables related with physicocbemical properties and that can be used to estimate the component of interest. The problem is the selection of a subset of informative and uncorrelated variables that help the minimization of prediction error. Classical algorithms select a subset of variables for each compound considered. In this work we propose the use of the SPEA-II (strength Pareto evolutionary algorithm II). We would like to show that the variable selection algorithm can selected just one subset used for multiple determinations using multiple linear regressions. For the case study is used wheat data obtained by NIR (near-infrared spectroscopy) spectrometry where the objective is the determination of a variable subgroup with information about E protein content (%), test weight (Kg/HI), WKT (wheat kernel texture) (%) and farinograph water absorption (%). The results of traditional techniques of multivariate calibration as the SPA (successive projections algorithm), PLS (partial least square) and mono-objective genetic algorithm are presents for comparisons. For NIR spectral analysis of protein concentration on wheat, the number of variables selected from 775 spectral variables was reduced for just 10 in the SPEA-II algorithm. The prediction error decreased from 0.2 in the classical methods to 0.09 in proposed approach, a reduction of 37%. The model using variables selected by SPEA-II had better prediction performance than classical algorithms and full-spectrum partial least-squares. 相似文献
295.
296.
To study the effects of a tactile feedback signal in a computer mouse on reduction of hovering behaviour and consequently on changes in muscle load, productivity, comfort and user friendliness, a comparative, experimental study with repeated measures was conducted. Fifteen subjects performed five trials with different mouse actions and a standardised task, once with a mouse with the feedback signal and once with a mouse without the feedback signal. Holding the hand just above the mouse caused higher muscle loading than clicking and scrolling. Holding the hand on the mouse caused higher muscle loading than resting the hand on the desk. The feedback signal effectively decreased hovering behaviour. It also led to a more dynamic activation pattern of the extensor muscles of the forearm. The overall opinion of the feedback signal for future use was rated as somewhat variable. No effects on discomfort or productivity were found. The use of a mouse with a tactile vibrating feedback signal seems promising for preventing arm complaints, although more research is needed to establish the clinical relevance. 相似文献
297.
Fractal dimension applied to plant identification 总被引:2,自引:0,他引:2
Odemir Martinez Bruno Rodrigo de Oliveira Plotze Mário de Castro 《Information Sciences》2008,178(12):2722-2733
This article discusses methods to identify plants by analysing leaf complexity based on estimating their fractal dimension. Leaves were analyzed according to the complexity of their internal and external shapes. A computational program was developed to process, analyze and extract the features of leaf images, thereby allowing for automatic plant identification. Results are presented from two experiments, the first to identify plant species from the Brazilian Atlantic forest and Brazilian Cerrado scrublands, using fifty leaf samples from ten different species, and the second to identify four different species from genus Passiflora, using twenty leaf samples for each class. A comparison is made of two methods to estimate fractal dimension (box-counting and multiscale Minkowski). The results are discussed to determine the best approach to analyze shape complexity based on the performance of the technique, when estimating fractal dimension and identifying plants. 相似文献
298.
In this work, we focus on model predictive control of nonlinear systems subject to data losses. The motivation for considering this problem is provided by wireless networked control systems and control of nonlinear systems under asynchronous measurement sampling. In order to regulate the state of the system towards an equilibrium point while minimizing a given performance index, we propose a Lyapunov-based model predictive controller which is designed taking data losses explicitly into account, both in the optimization problem formulation and in the controller implementation. The proposed controller allows for an explicit characterization of the stability region and guarantees that this region is an invariant set for the closed-loop system under data losses, if the maximum time in which the loop is open is shorter than a given constant that depends on the parameters of the system and the Lyapunov-based controller that is used to formulate the optimization problem. The theoretical results are demonstrated through a chemical process example. 相似文献
299.
Santos J.M. de Sa J.M. Alexandre L.A. 《IEEE transactions on pattern analysis and machine intelligence》2008,30(1):62-75
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGCIust) that builds layers of subgraphs based on this matrix and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure, we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones. 相似文献
300.
Jorge M Santos Joaquim Marques de Sa Luis A Alexandre 《IEEE transactions on pattern analysis and machine intelligence》2008,30(1):62-75
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGClust) that builds layers of subgraphs based on this matrix, and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones. 相似文献