全文获取类型
收费全文 | 10630篇 |
免费 | 54篇 |
国内免费 | 140篇 |
专业分类
电工技术 | 131篇 |
综合类 | 1篇 |
化学工业 | 371篇 |
金属工艺 | 436篇 |
机械仪表 | 58篇 |
建筑科学 | 55篇 |
能源动力 | 77篇 |
轻工业 | 45篇 |
水利工程 | 26篇 |
石油天然气 | 8篇 |
无线电 | 371篇 |
一般工业技术 | 234篇 |
冶金工业 | 65篇 |
原子能技术 | 95篇 |
自动化技术 | 8851篇 |
出版年
2024年 | 4篇 |
2023年 | 9篇 |
2022年 | 15篇 |
2021年 | 33篇 |
2020年 | 31篇 |
2019年 | 43篇 |
2018年 | 36篇 |
2017年 | 33篇 |
2016年 | 20篇 |
2015年 | 20篇 |
2014年 | 241篇 |
2013年 | 221篇 |
2012年 | 803篇 |
2011年 | 3090篇 |
2010年 | 1163篇 |
2009年 | 1027篇 |
2008年 | 694篇 |
2007年 | 608篇 |
2006年 | 458篇 |
2005年 | 579篇 |
2004年 | 531篇 |
2003年 | 582篇 |
2002年 | 273篇 |
2001年 | 9篇 |
2000年 | 6篇 |
1999年 | 23篇 |
1998年 | 86篇 |
1997年 | 23篇 |
1996年 | 16篇 |
1995年 | 3篇 |
1994年 | 7篇 |
1993年 | 7篇 |
1992年 | 10篇 |
1991年 | 7篇 |
1990年 | 11篇 |
1989年 | 10篇 |
1988年 | 13篇 |
1987年 | 6篇 |
1986年 | 12篇 |
1985年 | 8篇 |
1984年 | 24篇 |
1983年 | 11篇 |
1982年 | 6篇 |
1981年 | 7篇 |
1980年 | 1篇 |
1975年 | 3篇 |
1974年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
101.
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. 相似文献
102.
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. 相似文献
103.
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. 相似文献
104.
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. 相似文献
105.
In this paper, a novel one-dimensional correlation filter based class-dependence feature analysis (1D-CFA) method is presented for robust face recognition. Compared with original CFA that works in the two dimensional (2D) image space, 1D-CFA encodes the image data as vectors. In 1D-CFA, a new correlation filter called optimal extra-class origin output tradeoff filter (OEOTF), which is designed in the low-dimensional principal component analysis (PCA) subspace, is proposed for effective feature extraction. Experimental results on benchmark face databases, such as FERET, AR, and FRGC, show that OEOTF based 1D-CFA consistently outperforms other state-of-the-art face recognition methods. This demonstrates the effectiveness and robustness of the novel method. 相似文献
106.
Pilsung Kang Author Vitae Author Vitae 《Pattern recognition》2008,41(11):3507-3518
Instance-based learning (IBL), so called memory-based reasoning (MBR), is a commonly used non-parametric learning algorithm. k-nearest neighbor (k-NN) learning is the most popular realization of IBL. Due to its usability and adaptability, k-NN has been successfully applied to a wide range of applications. However, in practice, one has to set important model parameters only empirically: the number of neighbors (k) and weights to those neighbors. In this paper, we propose structured ways to set these parameters, based on locally linear reconstruction (LLR). We then employed sequential minimal optimization (SMO) for solving quadratic programming step involved in LLR for classification to reduce the computational complexity. Experimental results from 11 classification and eight regression tasks were promising enough to merit further investigation: not only did LLR outperform the conventional weight allocation methods without much additional computational cost, but also LLR was found to be robust to the change of k. 相似文献
107.
Kayo Suzuki Author Vitae Author Vitae Hiroaki Ikeda Author Vitae Author Vitae Fumio Adachi Author Vitae 《Computers & Electrical Engineering》2008,34(1):21-37
This paper focuses on a practical design for an efficient scalable image database and retrieval system over broadband networks. It describes a concrete solution for the implementation of HD/SHD (high-definition/super-high-definition) still image retrieval services which can be used in different applications. The structure of the complete system, consisting of a directory server, an image server, and MMI (man-machine interface) devices, has been presented, detailing each element and their corresponding functions. The desired HD/SHD image is displayed on the HD-PDP (plasma display panel) with the aid of image matching. The proposed system generates image index automatically, eliminating special skills in preparing index images and crucially reducing the processing time (from 35 min to 110 s), and does not use keywords. It has been also shown that these indices can be used for quite accurate image retrieval, i.e., the system provides high precision rates (currently up to 98%) to the user, eliminating troubles encountered in the image retrieval operations due to limitation on the user’s age, culture, knowledge, and languages.The broadband IP networks currently have a number of issues from the viewpoint of practical system operations, and so the requirements and issues needed for the networks are discussed from the viewpoint of in-service performance, differentiation among different types of services, secure connections, and so on, focusing on handling of HD/SHD still images. 相似文献
108.
Christopher B. Smith Author VitaeAuthor Vitae Eugene John Author Vitae 《Computers & Electrical Engineering》2008,34(3):192-201
This paper presents a statistical approach to estimating the performance of a superscalar processor. Traditional trace-driven simulators can take a large amount time to conduct a performance evaluation of a machine, especially as the number of instructions increases. The result of this type of simulation is typically tied to the particular trace that was run. Elements such as dependencies, delays, and stalls are all a direct result of the particular trace being run, and can differ from trace to trace. This paper describes a model designed to separate simulation results from a specific trace. Rather than running a trace-driven simulation, a statistical model is employed, more specifically a Poisson distribution, to predict how these types of delay affects performance. Through the use of this statistical model, a performance evaluation can be conducted using a general code model, with specific stall rates, rather than a particular code trace. This model allows simulations to quickly run tens of millions of instructions and evaluate the performance of a particular micro-architecture while at the same time, allowing the flexibility to change the structure of the architecture. 相似文献
109.
Shujun Li Author Vitae Chengqing Li Author Vitae Author Vitae Kwok-Tung Lo Author Vitae 《Journal of Systems and Software》2008,81(7):1130-1143
Recently, a chaos-based image encryption scheme called RCES (also called RSES) was proposed. This paper analyses the security of RCES, and points out that it is insecure against the known/chosen-plaintext attacks: the number of required known/chosen plain-images is only one or two to succeed an attack. In addition, the security of RCES against the brute-force attack was overestimated. Both theoretical and experimental analyses are given to show the performance of the suggested known/chosen-plaintext attacks. The insecurity of RCES is due to its special design, which makes it a typical example of insecure image encryption schemes. A number of lessons are drawn from the reported cryptanalysis of RCES, consequently suggesting some common principles for ensuring a high level of security of an image encryption scheme. 相似文献
110.
Jake Cobb Author Vitae Author Vitae 《Journal of Systems and Software》2008,81(9):1539-1558
Web proxy caches are used to reduce the strain of contemporary web traffic on web servers and network bandwidth providers. In this research, a novel approach to web proxy cache replacement which utilizes neural networks for replacement decisions is developed and analyzed. Neural networks are trained to classify cacheable objects from real world data sets using information known to be important in web proxy caching, such as frequency and recency. Correct classification ratios between 0.85 and 0.88 are obtained both for data used for training and data not used for training. Our approach is compared with Least Recently Used (LRU), Least Frequently Used (LFU) and the optimal case which always rates an object with the number of future requests. Performance is evaluated in simulation for various neural network structures and cache conditions. The final neural networks achieve hit rates that are 86.60% of the optimal in the worst case and 100% of the optimal in the best case. Byte-hit rates are 93.36% of the optimal in the worst case and 99.92% of the optimal in the best case. We examine the input-to-output mappings of individual neural networks and analyze the resulting caching strategy with respect to specific cache conditions. 相似文献