全文获取类型
收费全文 | 4876篇 |
免费 | 417篇 |
国内免费 | 55篇 |
专业分类
电工技术 | 115篇 |
综合类 | 21篇 |
化学工业 | 1368篇 |
金属工艺 | 127篇 |
机械仪表 | 177篇 |
建筑科学 | 212篇 |
矿业工程 | 10篇 |
能源动力 | 304篇 |
轻工业 | 359篇 |
水利工程 | 88篇 |
石油天然气 | 70篇 |
武器工业 | 5篇 |
无线电 | 446篇 |
一般工业技术 | 795篇 |
冶金工业 | 249篇 |
原子能技术 | 36篇 |
自动化技术 | 966篇 |
出版年
2024年 | 18篇 |
2023年 | 88篇 |
2022年 | 159篇 |
2021年 | 316篇 |
2020年 | 268篇 |
2019年 | 332篇 |
2018年 | 381篇 |
2017年 | 356篇 |
2016年 | 329篇 |
2015年 | 214篇 |
2014年 | 361篇 |
2013年 | 523篇 |
2012年 | 362篇 |
2011年 | 409篇 |
2010年 | 242篇 |
2009年 | 238篇 |
2008年 | 147篇 |
2007年 | 89篇 |
2006年 | 100篇 |
2005年 | 61篇 |
2004年 | 41篇 |
2003年 | 43篇 |
2002年 | 36篇 |
2001年 | 24篇 |
2000年 | 19篇 |
1999年 | 17篇 |
1998年 | 26篇 |
1997年 | 15篇 |
1996年 | 20篇 |
1995年 | 13篇 |
1994年 | 8篇 |
1993年 | 12篇 |
1991年 | 8篇 |
1990年 | 9篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 5篇 |
1984年 | 7篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1976年 | 2篇 |
1975年 | 7篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1965年 | 1篇 |
排序方式: 共有5348条查询结果,搜索用时 15 毫秒
81.
Facial features under variant-expressions and partial occlusions could have degrading effect on overall face recognition performance. As a solution, we suggest that the contribution of these features on final classification should be determined. In order to represent facial features contribution according to their variations, we propose a feature selection process that describes facial features as local independent component analysis(ICA) features. These local features are acquired using locally lateral subspace(LLS) strategy.Then, through linear discriminant analysis(LDA) we investigate the intraclass and interclass representation of each local ICA feature and express each feature s contribution via a weighting process. Using these weights, we define the contribution of each feature at local classifier level. In order to recognize faces under single sample constraint, we implement LLS strategy on locally linear embedding(LLE) along with the proposed feature selection. Additionally, we highlight the efficiency of the implementation of LLS strategy. The overall accuracy achieved by our approach on datasets with different facial expressions and partial occlusions such as AR, JAFFE,FERET and CK+ is 90.70%. We present together in this paper survey results on face recognition performance and physiological feature selection performed by human subjects. 相似文献
82.
Richard O. Sinnott Christopher Bayliss Andrew Bromage Gerson Galang Yikai Gong Philip Greenwood Glenn Jayaputera Davis Marques Luca Morandini Ghazal Nogoorani Hossein Pursultani Muhammad Sarwar William Voorsluys Ivo Widjaja 《Journal of Grid Computing》2016,14(4):603-618
Big data technologies and a range of Government open data initiatives provide the basis for discovering new insights into cities; how they are planned, how they managed and the day-to-day challenges they face in health, transport and changing population profiles. The Australian Urban Research Infrastructure Network (AURIN – www.aurin.org.au) project is one example of such a big data initiative that is currently running across Australia. AURIN provides a single gateway providing online (live) programmatic access to over 2000 data sets from over 70 major and typically definitive data-driven organizations across federal and State government, across industry and across academia. However whilst open (public) data is useful to bring data-driven intelligence to cities, more often than not, it is the data that is not-publicly accessible that is essential to understand city challenges and needs. Such sensitive (unit-level) data has unique requirements on access and usage to meet the privacy and confidentiality demands of the associated organizations. In this paper we highlight a novel geo-privacy supporting solution implemented as part of the AURIN project that provides seamless and secure access to individual (unit-level) data from the Department of Health in Victoria. We illustrate this solution across a range of typical city challenges in localized contexts around Melbourne. We show how unit level data can be combined with other data in a privacy-protecting manner. Unlike other secure data access and usage solutions that have been developed/deployed, the AURIN solution allows any researcher to access and use the data in a manner that meets all of the associated privacy and confidentiality concerns, without obliging them to obtain ethical approval or any other hurdles that are normally put in place on access to and use of sensitive data. This provides a paradigm shift in secure access to sensitive data with geospatial content. 相似文献
83.
84.
Ghazanfar Shahgholian Amir Movahedi Jawad Faiz 《International Journal of Control, Automation and Systems》2015,13(2):398-409
Thyristor controlled series capacitor (TCSC) can regulate line impedance and therefore increase transferred power of the system. On the other hand power system stabilizer (PSS) increases dynamic stability of generator. To enhance the stability, combination of TCSC and PSS can be applied, and in such a case coordination of TCSC and PSS is essential. This paper applies this combined controller in order to enhance the stability of multi-machine system. Parameters of these controllers are optimized by velocity update relaxation particle swarm optimization (VURPSO) algorithm and Genetic algorithm (GA). The simulation results show that the combination of VURPSO algorithm and GA leads to a better design and stability. 相似文献
85.
Fouzhan Hosseini Amir Fijany Saeed Safari Jean-Guy Fontaine 《Journal of Real-Time Image Processing》2013,8(4):421-435
In this paper, we present faster than real-time implementation of a class of dense stereo vision algorithms on a low-power massively parallel SIMD architecture, the CSX700. With two cores, each with 96 Processing Elements, this SIMD architecture provides a peak computation power of 96 GFLOPS while consuming only 9 Watts, making it an excellent candidate for embedded computing applications. Exploiting full features of this architecture, we have developed schemes for an efficient parallel implementation with minimum of overhead. For the sum of squared differences (SSD) algorithm and for VGA (640 × 480) images with disparity ranges of 16 and 32, we achieve a performance of 179 and 94 frames per second (fps), respectively. For the HDTV (1,280 × 720) images with disparity ranges of 16 and 32, we achieve a performance of 67 and 35 fps, respectively. We have also implemented more accurate, and hence more computationally expensive variants of the SSD, and for most cases, particularly for VGA images, we have achieved faster than real-time performance. Our results clearly demonstrate that, by developing careful parallelization schemes, the CSX architecture can provide excellent performance and flexibility for various embedded vision applications. 相似文献
86.
Amir Khakbaz Ali S. Nookabadi S. Nader Shetab-bushehri 《Networks and Spatial Economics》2013,13(1):43-66
Traffic congestion is one of the main problems in large cities for which several approaches have been proposed. Park-and-ride is one of the best approaches that can remove traffic from the traffic network. Park-and-ride facilities are an important part of urban mass transit systems, effectively extending the service area and attracting commuters and other people who may not otherwise have used mass transit. However, its efficiency depends on its location in the urban network. In this research, we focus on travel time of shortest paths instead of the distance criterion for computing network traffic and develop a model for finding the best location(s) for siting park-and-ride systems so as to minimize the network traffic. The model is formulated based on population points, potential sites for park-and-ride establishment, and several Central Business District (CBDs). Then we present a Genetic algorithm that has been proved to be efficient in solving large size problems. Finally, the proposed model is used to locate park-and-ride facilities in the city of Isfahan, Iran. 相似文献
87.
Hossein Karshenas Roberto Santana Concha Bielza Pedro Larrañaga 《Applied Soft Computing》2013,13(5):2412-2432
Regularization is a well-known technique in statistics for model estimation which is used to improve the generalization ability of the estimated model. Some of the regularization methods can also be used for variable selection that is especially useful in high-dimensional problems. This paper studies the use of regularized model learning in estimation of distribution algorithms (EDAs) for continuous optimization based on Gaussian distributions. We introduce two approaches to the regularized model estimation and analyze their effect on the accuracy and computational complexity of model learning in EDAs. We then apply the proposed algorithms to a number of continuous optimization functions and compare their results with other Gaussian distribution-based EDAs. The results show that the optimization performance of the proposed RegEDAs is less affected by the increase in the problem size than other EDAs, and they are able to obtain significantly better optimization values for many of the functions in high-dimensional settings. 相似文献
88.
This paper investigates the use of time-adaptive self-organizing map (TASOM)-based active contour models (ACMs) for detecting the boundaries of the human eye sclera and tracking its movements in a sequence of images. The task begins with extracting the head boundary based on a skin-color model. Then the eye strip is located with an acceptable accuracy using a morphological method. Eye features such as the iris center or eye corners are detected through the iris edge information. TASOM-based ACM is used to extract the inner boundary of the eye. Finally, by tracking the changes in the neighborhood characteristics of the eye-boundary estimating neurons, the eyes are tracked effectively. The original TASOM algorithm is found to have some weaknesses in this application. These include formation of undesired twists in the neuron chain and holes in the boundary, lengthy chain of neurons, and low speed of the algorithm. These weaknesses are overcome by introducing a new method for finding the winning neuron, a new definition for unused neurons, and a new method of feature selection and application to the network. Experimental results show a very good performance for the proposed method in general and a better performance than that of the gradient vector field (GVF) snake-based method. 相似文献
89.
90.
Amir Shpilka 《Computational Complexity》2009,18(4):495-525
In this work we give two new constructions of ε-biased generators. Our first construction significantly extends a result of
Mossel et al. (Random Structures and Algorithms 2006, pages 56-81), and our second construction answers an open question of
Dodis and Smith (STOC 2005, pages 654-663). In particular we obtain the following results:
The paper also contains an appendix by Venkatesan Guruswami that provides an explicit construction of a family of error correcting
codes of rate 1/2 that has efficient encoding and decoding algorithms and whose dual codes are also good codes. 相似文献
1. | For every k = o(log n) we construct an ε-biased generator G : {0, 1}m ? {0, 1}nG : \{0, 1\}^{m} \rightarrow \{0, 1\}^n that is implementable by degree k polynomials (namely, every output bit of the generator is a degree k polynomial in the input bits). For any constant k we get that n = W(m/log(1/ e))kn = \Omega(m/{\rm log}(1/ \epsilon))^k, which is nearly optimal. Our result also separates degree k generators from generators in NC0k, showing that the stretch of the former can be much larger than the stretch of the latter. The problem of constructing degree k generators was introduced by Mossel et al. who gave a construction only for the case of k = 2. |
2. | We construct a family of asymptotically good binary codes such that the codes in our family are also ε-biased sets for an exponentially small ε. Our encoding algorithm runs in polynomial time in the block length of the code. Moreover, these codes have a polynomial time decoding algorithm. This answers an open question of Dodis and Smith. |