全文获取类型
收费全文 | 11451篇 |
免费 | 46篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 134篇 |
综合类 | 1篇 |
化学工业 | 519篇 |
金属工艺 | 371篇 |
机械仪表 | 104篇 |
建筑科学 | 125篇 |
矿业工程 | 10篇 |
能源动力 | 74篇 |
轻工业 | 170篇 |
水利工程 | 19篇 |
石油天然气 | 7篇 |
无线电 | 414篇 |
一般工业技术 | 413篇 |
冶金工业 | 941篇 |
原子能技术 | 96篇 |
自动化技术 | 8100篇 |
出版年
2022年 | 13篇 |
2021年 | 14篇 |
2020年 | 11篇 |
2018年 | 25篇 |
2017年 | 21篇 |
2016年 | 29篇 |
2015年 | 25篇 |
2014年 | 231篇 |
2013年 | 253篇 |
2012年 | 818篇 |
2011年 | 2344篇 |
2010年 | 1153篇 |
2009年 | 987篇 |
2008年 | 724篇 |
2007年 | 648篇 |
2006年 | 516篇 |
2005年 | 620篇 |
2004年 | 576篇 |
2003年 | 636篇 |
2002年 | 343篇 |
2001年 | 45篇 |
2000年 | 48篇 |
1999年 | 68篇 |
1998年 | 219篇 |
1997年 | 135篇 |
1996年 | 98篇 |
1995年 | 65篇 |
1994年 | 64篇 |
1993年 | 78篇 |
1992年 | 29篇 |
1991年 | 21篇 |
1990年 | 36篇 |
1989年 | 30篇 |
1988年 | 35篇 |
1987年 | 35篇 |
1986年 | 30篇 |
1985年 | 30篇 |
1984年 | 37篇 |
1983年 | 35篇 |
1982年 | 32篇 |
1981年 | 32篇 |
1980年 | 17篇 |
1979年 | 21篇 |
1978年 | 27篇 |
1977年 | 26篇 |
1976年 | 46篇 |
1975年 | 23篇 |
1974年 | 17篇 |
1973年 | 20篇 |
1972年 | 19篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
Aerial photographs and images are used by a variety of industries, including farming, landscaping, surveying, and agriculture, as well as academic researchers including archaeologists and geologists. Aerial imagery can provide a valuable resource for analyzing sites of interest and gaining information about the structure, layout, and composition of large areas of land that would be unavailable otherwise. Current methods of acquiring aerial images rely on techniques such as satellite imagery, manned aircraft, or more recently unmanned aerial vehicles (UAVs) and micro‐UAV technologies. These solutions, while accurate and reliable, have several drawbacks. Using satellite imagery or UAVs can prove to be very expensive, costing tens of thousands for images. They can also prove to be time‐consuming and in some cases have constraints on use, such as no‐fly zones. In this paper, we present an alternative low‐cost, versatile solution to these methods, an intelligent kite aerial photography platform (iKAPP), for the purpose of acquiring aerial images and monitoring sites of interest. We show how this system provides flexibility in application, and we detail the system's design, mechanical operation, and initial flight experiments for a low‐cost, lightweight, intelligent platform capable of acquiring high‐resolution images. Finally, we demonstrate the system by acquiring images of a local site, showing how the system functions and the quality of images it can capture. The application of the system and its capabilities in terms of capture rates, image quality, and limitations are also presented. The system offers several improvements over traditional KAP systems, including onboard “intelligent” processing and communications. The intelligent aspect of this system stems from the use of self‐image stabilization of the camera, the advantage being that one is able to configure the system to capture large areas of a site automatically, and one can see the site acquisition in real time, all of which are not possible with previous methods of AP. © 2013 Wiley Periodicals, Inc. 相似文献
102.
An effective dual watermark scheme for image tamper detection and recovery is proposed in this paper. In our algorithm, each block in the image contains watermark of other two blocks. That is to say, there are two copies of watermark for each non-overlapping block in the image. Therefore, we maintain two copies of watermark of the whole image and provide second chance for block recovery in case one copy is destroyed. A secret key, which is transmitted along with the watermarked image, and a public chaotic mixing algorithm are used to extract the watermark for tamper recovery. By using our algorithm, a 90% tampered image can be recovered to a dim yet still recognizable condition (PSNR ). Experimental results demonstrate that our algorithm is superior to the compared techniques, especially when the tampered area is large. 相似文献
103.
Hugo Zanghi Author Vitae Christophe Ambroise Author Vitae 《Pattern recognition》2008,41(12):3592-3599
In the context of graph clustering, we consider the problem of simultaneously estimating both the partition of the graph nodes and the parameters of an underlying mixture of affiliation networks. In numerous applications the rapid increase of data size over time makes classical clustering algorithms too slow because of the high computational cost. In such situations online clustering algorithms are an efficient alternative to classical batch algorithms. We present an original online algorithm for graph clustering based on a Erd?s-Rényi graph mixture. The relevance of the algorithm is illustrated, using both simulated and real data sets. The real data set is a network extracted from the French political blogosphere and presents an interesting community organization. 相似文献
104.
Aleix M. Martinez Author Vitae Onur C. Hamsici Author Vitae 《Pattern recognition》2008,41(11):3436-3441
Many problems in paleontology reduce to finding those features that best discriminate among a set of classes. A clear example is the classification of new specimens. However, these classifications are generally challenging because the number of discriminant features and the number of samples are limited. This has been the fate of LB1, a new specimen found in the Liang Bua Cave of Flores. Several authors have attributed LB1 to a new species of Homo, H. floresiensis. According to this hypothesis, LB1 is either a member of the early Homo group or a descendent of an ancestor of the Asian H. erectus. Detractors have put forward an alternate hypothesis, which stipulates that LB1 is in fact a microcephalic modern human. In this paper, we show how we can employ a new Bayes optimal discriminant feature extraction technique to help resolve this type of issues. In this process, we present three types of experiments. First, we use this Bayes optimal discriminant technique to develop a model of morphological (shape) evolution from Australopiths to H. sapiens. LB1 fits perfectly in this model as a member of the early Homo group. Second, we build a classifier based on the available cranial and mandibular data appropriately normalized for size and volume. Again, LB1 is most similar to early Homo. Third, we build a brain endocast classifier to show that LB1 is not within the normal range of variation in H. sapiens. These results combined support the hypothesis of a very early shared ancestor for LB1 and H. erectus, and illustrate how discriminant analysis approaches can be successfully used to help classify newly discovered specimens. 相似文献
105.
This paper presents a new extension of Gaussian mixture models (GMMs) based on type-2 fuzzy sets (T2 FSs) referred to as T2 FGMMs. The estimated parameters of the GMM may not accurately reflect the underlying distributions of the observations because of insufficient and noisy data in real-world problems. By three-dimensional membership functions of T2 FSs, T2 FGMMs use footprint of uncertainty (FOU) as well as interval secondary membership functions to handle GMMs uncertain mean vector or uncertain covariance matrix, and thus GMMs parameters vary anywhere in an interval with uniform possibilities. As a result, the likelihood of the T2 FGMM becomes an interval rather than a precise real number to account for GMMs uncertainty. These interval likelihoods are then processed by the generalized linear model (GLM) for classification decision-making. In this paper we focus on the role of the FOU in pattern classification. Multi-category classification on different data sets from UCI repository shows that T2 FGMMs are consistently as good as or better than GMMs in case of insufficient training data, and are also insensitive to different areas of the FOU. Based on T2 FGMMs, we extend hidden Markov models (HMMs) to type-2 fuzzy HMMs (T2 FHMMs). Phoneme classification in the babble noise shows that T2 FHMMs outperform classical HMMs in terms of the robustness and classification rate. We also find that the larger area of the FOU in T2 FHMMs with uncertain mean vectors performs better in classification when the signal-to-noise ratio is lower. 相似文献
106.
Brais Martinez Author Vitae Author Vitae 《Pattern recognition》2008,41(12):3682-3691
Since the multiple kernel representation opened in tracking the possibility of representing several features of the target in the same model, tracking multiple features using kernel-based methods has received a great attention. In spite of these efforts, the formulation has been reduced to tracking planar targets or targets rotating inside a plane parallel to the image plane. The aim of this paper is to extend the multi-kernel tracking to cope with situations different to those. To this end, we consider the triangular mesh described by the centers of the kernels and we develop the estimation of a set of affine transforms, one at each mesh triangle, subject to the constraints that each affine transform of a triangle must be compatible with the affine transforms coming from contiguous triangles. The method is applied to sequences including face and car tracking. Results show an outperformance respect to previous kernel tracking methods, which generally work with a too restricted set of movements. 相似文献
107.
In this paper, we investigate the applicability of graph cuts to the SFS (shape-from-shading) problem. We propose a new semi-global method for SFS using graph cuts. The new algorithm combines the local method proposed by Lee and Rosenfeld [C.H. Lee, A. Rosenfeld, Improved methods of estimating shape from shading using the light source coordinate system, Artif. Intell. 26 (1985) 125-143] and a global method using an energy minimization technique. By employing a new global energy minimization formulation, the convex/concave ambiguity problem of Lee and Rosenfeld's method can be resolved efficiently. A new combinatorial optimization technique, the graph cuts method, is used for the minimization of the proposed energy functional. Experimental results on a variety of synthetic and real-world images show that the proposed algorithm reconstructs the 3-D shape of objects very efficiently. 相似文献
108.
Hamidreza Rashidy Kanan Author Vitae 《Pattern recognition》2008,41(12):3799-3812
Though numerous approaches have been proposed for face recognition, little attention is given to the moment-based face recognition techniques. In this paper we propose a novel face recognition approach based on adaptively weighted patch pseudo Zernike moment array (AWPPZMA) when only one exemplar image per person is available. In this approach, a face image is represented as an array of patch pseudo Zernike moments (PPZM) extracted from a partitioned face image containing moment information of local areas instead of global information of a face. An adaptively weighting scheme is used to assign proper weights to each PPZM to adjust the contribution of each local area of a face in terms of the quantity of identity information that a patch contains and the likelihood of a patch is occluded. An extensive experimental investigation is conducted using AR and Yale face databases covering face recognition under controlled/ideal conditions, different illumination conditions, different facial expressions and partial occlusion. The system performance is compared with the performance of four benchmark approaches. The encouraging experimental results demonstrate that moments can be used for face recognition and patch-based moment array provides a novel way for face representation and recognition in single model databases. 相似文献
109.
We present a method for object class detection in images based on global shape. A distance measure for elastic shape matching is derived, which is invariant to scale and rotation, and robust against non-parametric deformations. Starting from an over-segmentation of the image, the space of potential object boundaries is explored to find boundaries, which have high similarity with the shape template of the object class to be detected. An extensive experimental evaluation is presented. The approach achieves a remarkable detection rate of 83-91% at 0.2 false positives per image on three challenging data sets. 相似文献
110.
Bo Li Author Vitae Chun-Hou Zheng Author Vitae Author Vitae 《Pattern recognition》2008,41(12):3813-3821
In this paper an efficient feature extraction method named as locally linear discriminant embedding (LLDE) is proposed for face recognition. It is well known that a point can be linearly reconstructed by its neighbors and the reconstruction weights are under the sum-to-one constraint in the classical locally linear embedding (LLE). So the constrained weights obey an important symmetry: for any particular data point, they are invariant to rotations, rescalings and translations. The latter two are introduced to the proposed method to strengthen the classification ability of the original LLE. The data with different class labels are translated by the corresponding vectors and those belonging to the same class are translated by the same vector. In order to cluster the data with the same label closer, they are also rescaled to some extent. So after translation and rescaling, the discriminability of the data will be improved significantly. The proposed method is compared with some related feature extraction methods such as maximum margin criterion (MMC), as well as other supervised manifold learning-based approaches, for example ensemble unified LLE and linear discriminant analysis (En-ULLELDA), locally linear discriminant analysis (LLDA). Experimental results on Yale and CMU PIE face databases convince us that the proposed method provides a better representation of the class information and obtains much higher recognition accuracies. 相似文献