全文获取类型
收费全文 | 6200篇 |
免费 | 351篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 81篇 |
综合类 | 5篇 |
化学工业 | 1521篇 |
金属工艺 | 94篇 |
机械仪表 | 98篇 |
建筑科学 | 210篇 |
矿业工程 | 21篇 |
能源动力 | 252篇 |
轻工业 | 1123篇 |
水利工程 | 37篇 |
石油天然气 | 21篇 |
无线电 | 334篇 |
一般工业技术 | 989篇 |
冶金工业 | 548篇 |
原子能技术 | 34篇 |
自动化技术 | 1186篇 |
出版年
2024年 | 14篇 |
2023年 | 57篇 |
2022年 | 232篇 |
2021年 | 229篇 |
2020年 | 146篇 |
2019年 | 201篇 |
2018年 | 245篇 |
2017年 | 221篇 |
2016年 | 235篇 |
2015年 | 199篇 |
2014年 | 268篇 |
2013年 | 443篇 |
2012年 | 422篇 |
2011年 | 459篇 |
2010年 | 371篇 |
2009年 | 321篇 |
2008年 | 344篇 |
2007年 | 286篇 |
2006年 | 246篇 |
2005年 | 198篇 |
2004年 | 153篇 |
2003年 | 144篇 |
2002年 | 139篇 |
2001年 | 71篇 |
2000年 | 73篇 |
1999年 | 74篇 |
1998年 | 151篇 |
1997年 | 122篇 |
1996年 | 78篇 |
1995年 | 82篇 |
1994年 | 32篇 |
1993年 | 49篇 |
1992年 | 25篇 |
1991年 | 26篇 |
1990年 | 20篇 |
1989年 | 25篇 |
1988年 | 11篇 |
1987年 | 12篇 |
1986年 | 13篇 |
1985年 | 17篇 |
1984年 | 16篇 |
1983年 | 12篇 |
1982年 | 6篇 |
1980年 | 5篇 |
1979年 | 7篇 |
1978年 | 6篇 |
1977年 | 6篇 |
1976年 | 11篇 |
1975年 | 11篇 |
1974年 | 5篇 |
排序方式: 共有6554条查询结果,搜索用时 31 毫秒
51.
M. Lucena A. L. Martínez-Carrillo J. M. Fuertes F. Carrascosa A. Ruiz 《Multimedia Tools and Applications》2016,75(7):3677-3691
We present a decision support system to help archaeologists in classifying wheel-made pottery pieces by its profile. A novel shape characterization method, using Mathematical Morphology, is introduced for this purpose. Each profile is represented as a vector, obtained by sampling the so called morphological curves (erosion, dilation, opening and closing), and Euclidean Distance is used as a similarity measure. We show results of our method applied to a profile database of Iberian Pottery from the upper valley of Guadalquivir River (Spain). 相似文献
52.
Jose Garcia-Rodriguez Sergio Orts-Escolano Anastassia Angelopoulou Alexandra Psarrou Jorge Azorin-Lopez Juan Manuel Garcia-Chamizo 《Journal of Real-Time Image Processing》2016,11(4):731-749
This work describes a neural network based architecture that represents and estimates object motion in videos. This architecture addresses multiple computer vision tasks such as image segmentation, object representation or characterization, motion analysis and tracking. The use of a neural network architecture allows for the simultaneous estimation of global and local motion and the representation of deformable objects. This architecture also avoids the problem of finding corresponding features while tracking moving objects. Due to the parallel nature of neural networks, the architecture has been implemented on GPUs that allows the system to meet a set of requirements such as: time constraints management, robustness, high processing speed and re-configurability. Experiments are presented that demonstrate the validity of our architecture to solve problems of mobile agents tracking and motion analysis. 相似文献
53.
Nada Abdulkareem Philipp Skroblin Marjan Jahangiri Manuel Mayr 《Proteomics. Clinical applications》2013,7(7-8):504-515
Aortic aneurysm is a deceptively indolent disease that can cause severe complications such as aortic rupture and dissection. In the normal aorta, vascular smooth muscle cells within the medial layer produce and sustain the extracellular matrix (ECM) that provides structural support but also retains soluble growth factors and regulates their distribution. Although the ECM is an obvious target to identify molecular processes leading to structural failure within the vessel wall, an in-depth proteomics analysis of this important sub-proteome has not been performed. Most proteomics analyses of the vasculature to date used homogenized tissue devoid of spatial information. In such homogenates, quantitative proteomics comparisons are hampered by the heterogeneity of clinical samples (i.e. cellular composition) and the dynamic range limitations stemming from highly abundant cellular proteins. An unbiased proteomics discovery approach targeting the ECM instead of the cellular proteome may decipher the complex, multivalent signals that are presented to cells during aortic remodelling. A better understanding of the ECM in healthy and diseased vessels will provide important pathogenic insights and has potential to reveal novel biomarkers. 相似文献
54.
Basil Mohammed Al-Hadithi Antonio Javier Barragán José Manuel Andújar Agustín Jiménez 《Applied Soft Computing》2013,13(12):4802-4812
In this paper, a fuzzy based Variable Structure Control (VSC) with guaranteed stability is presented. The main objective is to obtain an improved performance of highly non-linear unstable systems. The main contribution of this work is that, firstly, new functions for chattering reduction and error convergence without sacrificing invariant properties are proposed, which is considered the main drawback of the VSC control. Secondly, the global stability of the controlled system is guaranteed.The well known weighting parameters approach, is used in this paper to optimize local and global approximation and modeling capability of T-S fuzzy model.A one link robot is chosen as a nonlinear unstable system to evaluate the robustness, effectiveness and remarkable performance of optimization approach and the high accuracy obtained in approximating nonlinear systems in comparison with the original T-S model. Simulation results indicate the potential and generality of the algorithm. The application of the proposed FLC-VSC shows that both alleviation of chattering and robust performance are achieved with the proposed FLC-VSC controller. The effectiveness of the proposed controller is proven infront of disturbances and noise effects. 相似文献
55.
56.
In order to forecast time evolution of a binary response variable from a related continuous time series a functional logit model is proposed. The estimation of this model from discrete time observations of the predictor is solved by using functional principal component analysis and ARIMA modelling of the associated discrete time series of principal components. The proposed model is applied to forecast the risk of drought from El Niño phenomenon. 相似文献
57.
In this work, a review and comprehensive evaluation of heuristics and metaheuristics for the m-machine flowshop scheduling problem with the objective of minimising total tardiness is presented. Published reviews about this objective usually deal with a single machine or parallel machines and no recent methods are compared. Moreover, the existing reviews do not use the same benchmark of instances and the results are difficult to reproduce and generalise. We have implemented a total of 40 different heuristics and metaheuristics and we have analysed their performance under the same benchmark of instances in order to make a global and fair comparison. In this comparison, we study from the classical priority rules to the most recent tabu search, simulated annealing and genetic algorithms. In the evaluations we use the experimental design approach and careful statistical analyses to validate the effectiveness of the different methods tested. The results allow us to clearly identify the state-of-the-art methods. 相似文献
58.
We develop a novel approach for computing the circle Hough transform entirely on graphics hardware (GPU). A primary role is assigned to vertex processors and the rasterizer, overshadowing the traditional foreground of pixel processors and enhancing parallel processing. Resources like the vertex cache or blending units are studied too, with our set of optimizations leading to extraordinary peak gain factors exceeding 358x over a typical CPU execution. Software optimizations, like the use of precomputed tables or gradient information and hardware improvements, like hyperthreading and multicores are explored on CPUs as well. Overall, the GPU exhibits better scalability and much greater parallel performance to become a solid alternative for computing the classical circle Hough transform versus those optimal methods run on emerging multicore architectures. 相似文献
59.
Alberto Ros Ricardo Fernández-Pascual Manuel E. Acacio José M. García 《Journal of Parallel and Distributed Computing》2008
In glueless shared-memory multiprocessors where cache coherence is usually maintained using a directory-based protocol, the fast access to the on-chip components (caches and network router, among others) contrasts with the much slower main memory. Unfortunately, directory-based protocols need to obtain the sharing status of every memory block before coherence actions can be performed. This information has traditionally been stored in main memory, and therefore these cache coherence protocols are far from being optimal. In this work, we propose two alternative designs for the last-level private cache of glueless shared-memory multiprocessors: the lightweight directory and the SGluM cache. Our proposals completely remove directory information from main memory and store it in the home node’s L2 cache, thus reducing both the number of accesses to main memory and the directory memory overhead. The main characteristics of the lightweight directory are its simplicity and the significant improvement in the execution time for most applications. Its drawback, however, is that the performance of some particular applications could be degraded. On the other hand, the SGluM cache offers more modest improvements in execution time for all the applications by adding some extra structures that cope with the cases in which the lightweight directory fails. 相似文献
60.
Yolanda Blanco-Fernndez Jos J. Pazos-Arias Alberto Gil-Solla Manuel Ramos-Cabrer Martín Lpez-Nores Jorge García-Duque Ana Fernndez-Vilas Rebeca P. Díaz-Redondo Jesús Bermejo-Muoz 《Knowledge》2008,21(4):305-320
Recommender systems arose with the goal of helping users search in overloaded information domains (like e-commerce, e-learning or Digital TV). These tools automatically select items (commercial products, educational courses, TV programs, etc.) that may be appealing to each user taking into account his/her personal preferences. The personalization strategies used to compare these preferences with the available items suffer from well-known deficiencies that reduce the quality of the recommendations. Most of the limitations arise from using syntactic matching techniques because they miss a lot of useful knowledge during the recommendation process. In this paper, we propose a personalization strategy that overcomes these drawbacks by applying inference techniques borrowed from the Semantic Web. Our approach reasons about the semantics of items and user preferences to discover complex associations between them. These semantic associations provide additional knowledge about the user preferences, and permit the recommender system to compare them with the available items in a more effective way. The proposed strategy is flexible enough to be applied in many recommender systems, regardless of their application domain. Here, we illustrate its use in AVATAR, a tool that selects appealing audiovisual programs from among the myriad available in Digital TV. 相似文献