全文获取类型
收费全文 | 38619篇 |
免费 | 3544篇 |
国内免费 | 2405篇 |
专业分类
电工技术 | 3425篇 |
技术理论 | 1篇 |
综合类 | 3512篇 |
化学工业 | 1876篇 |
金属工艺 | 3652篇 |
机械仪表 | 7107篇 |
建筑科学 | 1190篇 |
矿业工程 | 1991篇 |
能源动力 | 582篇 |
轻工业 | 3002篇 |
水利工程 | 387篇 |
石油天然气 | 640篇 |
武器工业 | 296篇 |
无线电 | 2559篇 |
一般工业技术 | 2528篇 |
冶金工业 | 1534篇 |
原子能技术 | 89篇 |
自动化技术 | 10197篇 |
出版年
2024年 | 180篇 |
2023年 | 731篇 |
2022年 | 1270篇 |
2021年 | 1412篇 |
2020年 | 1382篇 |
2019年 | 1014篇 |
2018年 | 895篇 |
2017年 | 1118篇 |
2016年 | 1319篇 |
2015年 | 1469篇 |
2014年 | 2462篇 |
2013年 | 1979篇 |
2012年 | 2907篇 |
2011年 | 3018篇 |
2010年 | 2189篇 |
2009年 | 2197篇 |
2008年 | 2034篇 |
2007年 | 2629篇 |
2006年 | 2506篇 |
2005年 | 2134篇 |
2004年 | 1688篇 |
2003年 | 1475篇 |
2002年 | 1240篇 |
2001年 | 1071篇 |
2000年 | 871篇 |
1999年 | 672篇 |
1998年 | 518篇 |
1997年 | 428篇 |
1996年 | 332篇 |
1995年 | 312篇 |
1994年 | 260篇 |
1993年 | 181篇 |
1992年 | 123篇 |
1991年 | 97篇 |
1990年 | 86篇 |
1989年 | 93篇 |
1988年 | 79篇 |
1987年 | 33篇 |
1986年 | 28篇 |
1985年 | 18篇 |
1984年 | 14篇 |
1983年 | 23篇 |
1982年 | 17篇 |
1981年 | 6篇 |
1980年 | 6篇 |
1979年 | 8篇 |
1978年 | 6篇 |
1963年 | 4篇 |
1959年 | 4篇 |
1957年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 93 毫秒
991.
DMM:A dynamic memory mapping model for virtual machines 总被引:2,自引:0,他引:2
CHEN HaoGang WANG XiaoLin WANG ZhenLin ZHANG BinBin LUO YingWei & LI XiaoMing 《中国科学:信息科学(英文版)》2010,(6):1097-1108
Memory virtualization is an important part in the design of virtual machine monitors(VMM).In this paper,we proposed dynamic memory mapping(DMM) model,a mechanism that allows the VMM to change the mapping between a virtual machine's physical memory and the underlying hardware resource while the virtual machine is running.By utilizing DMM,the VMM can implement many novel memory management policies,such as Demand Paging,Swapping,Ballooning,Memory Sharing and Copy-On-Write,while preserving compatibility with va... 相似文献
992.
Bae Jun Young 《Information Sciences》2009,179(24):4284-1770
The idea of (faithful) intuitionistic fuzzy transformation semigroup, intuitionistic admissible relation, and intuitionistic (strong) homomorphism are introduced and their basic properties are examined. 相似文献
993.
When an implementation under test (IUT) is state-based, and its expected abstract behavior is given in terms of a finite state machine (FSM), a checking sequence generated from a specification FSM and applied to an IUT for testing can provide us with high-level confidence in the correct functional behavior of our implementation. One of the issues here is to generate efficient checking sequences in terms of their lengths. As a major characteristics, a checking sequence must contain all β-sequences for transition verification. In this paper, we discuss the possibility of reducing the lengths of checking sequences by making use of the invertible transitions in the specification FSM to increase the choice of β-sequences to be considered for checking sequence generation. We present a sufficient condition for adopting alternative β-sequences and illustrate typical ways of incorporating these alternative β-sequences into existing methods for checking sequence generation to reduce the lengths. Compared to the direct use of three existing methods, our experiments show that most of the time the saving gained by adopting alternative β-sequences falls in the range of 10–40%. 相似文献
994.
We present in this work a two-step sparse classifier called IP-LSSVM which is based on Least Squares Support Vector Machine (LS-SVM). The formulation of LS-SVM aims at solving the learning problem with a system of linear equations. Although this solution is simpler, there is a loss of sparseness in the feature vectors. Many works on LS-SVM are focused on improving support vectors representation in the least squares approach, since they correspond to the only vectors that must be stored for further usage of the machine, which can also be directly used as a reduced subset that represents the initial one. The proposed classifier incorporates the advantages of either SVM and LS-SVM: automatic detection of support vectors and a solution obtained simply by the solution of systems of linear equations. IP-LSSVM was compared with other sparse LS-SVM classifiers from literature, and RRS+LS-SVM. The experiments were performed on four important benchmark databases in Machine Learning and on two artificial databases created to show visually the support vectors detected. The results show that IP-LSSVM represents a viable alternative to SVMs, since both have similar features, supported by literature results and yet IP-LSSVM has a simpler and more understandable formulation. 相似文献
995.
Breast cancer is one of the most common cancers diagnosed in women. Large margin classifiers like the support vector machine (SVM) have been reported effective in computer-assisted diagnosis systems for breast cancers. However, since the separating hyperplane determination exclusively relies on support vectors, the SVM is essentially a local classifier and its performance can be further improved. In this work, we introduce a structured SVM model to determine if each mammographic region is normal or cancerous by considering the cluster structures in the training set. The optimization problem in this new model can be solved efficiently by being formulated as one second order cone programming problem. Experimental evaluation is performed on the Digital Database for Screening Mammography (DDSM) dataset. Various types of features, including curvilinear features, texture features, Gabor features, and multi-resolution features, are extracted from the sample images. We then select the salient features using the recursive feature elimination algorithm. The structured SVM achieves better detection performance compared with a well-tested SVM classifier in terms of the area under the ROC curve. 相似文献
996.
Adaptive binary tree for fast SVM multiclass classification 总被引:1,自引:0,他引:1
This paper presents an adaptive binary tree (ABT) to reduce the test computational complexity of multiclass support vector machine (SVM). It achieves a fast classification by: (1) reducing the number of binary SVMs for one classification by using separating planes of some binary SVMs to discriminate other binary problems; (2) selecting the binary SVMs with the fewest average number of support vectors (SVs). The average number of SVs is proposed to denote the computational complexity to exclude one class. Compared with five well-known methods, experiments on many benchmark data sets demonstrate our method can speed up the test phase while remain the high accuracy of SVMs. 相似文献
997.
A knowledge-based decision support system to analyze the debris-flow problems at Chen-Yu-Lan River, Taiwan 总被引:5,自引:0,他引:5
Decision-making for the debris-flow management involves multiple decision-makers often with concerning geomorphological and hydraulic conditions. Spatial decision support systems (SDSS) can be developed to improve our understanding of the relations among the natural and socio-economic variables to the occurrence/non-occurrence samples of debris-flow. Accordingly, the goal of this study is to development a debris-flow decision support system to manage and monitor the debris-flows in Nan-Tou County, Taiwan. The present study, more specifically, combines a spatial information system with an advanced Data Mining technique to investigate the debris-flow problem. In the first stage, our spatial information system integrates remote sensing, DEM, and aerial photos as three different resources to generate our spatial database. Each of the geomorphological and hydraulic attributes are obtained automatically through our spatial database. Then, a Data Mining classifier (hybrid model of decision tree (D.T.) + support vector machine (S.V.M.)) will be used to analyze and resolve the classification of occurrence of debris-flow. The contribution of this study has found that watershed area and NDVI (Normalized Difference Vegetation Index) are the crucial factors governing debris-flow by means of decision tree analysis. Further, the performance of prediction accuracy on testing samples through support vector machine is 73% which could be helpful for us to have better understanding of debris-flow problem. 相似文献
998.
Ming-Huwi Horng 《Expert systems with applications》2009,36(4):8124-8133
This article proposes an effort to apply the multi-class support vector machine classifiers to classify the supraspinatus image into different disease groups that are normal, tendon inflammation, calcific tendonitis and supraspinatus tear. The supraspinatus tendon is often involved in the above-mentioned disease groups. Four different texture analysis methods – texture feature coding method, gray-level co-occurrence matrix, fractal dimension evaluation and texture spectrum – are used to extract features of tissue characteristic in the ultrasonic supraspinatus images. The mutual information criterion is adopted to select the powerful features from ones generated from the above-mentioned four texture analysis methods in the training stage, meanwhile, the five implementations of multi-class support vector machine classifiers are also designed to discriminate each image into one of the four disease groups in the classification stage. In experiments, the most commonly used performance measures including sensitivity, specificity, classification accuracy and false-negative rate are applied to evaluate the classification of the five implantations of multi-class support vector machines. In addition, the receiver operating characteristics analysis is also used to analyze the classification capability. The present results demonstrate that the implementation of multi-class fuzzy support vector machine can achieve 90% classification accuracy, and performance measures of this implementation are significantly superior to the others. 相似文献
999.
1000.