全文获取类型
收费全文 | 16702篇 |
免费 | 4338篇 |
国内免费 | 3333篇 |
专业分类
电工技术 | 1165篇 |
综合类 | 2229篇 |
化学工业 | 404篇 |
金属工艺 | 463篇 |
机械仪表 | 1693篇 |
建筑科学 | 811篇 |
矿业工程 | 373篇 |
能源动力 | 148篇 |
轻工业 | 380篇 |
水利工程 | 209篇 |
石油天然气 | 862篇 |
武器工业 | 200篇 |
无线电 | 2645篇 |
一般工业技术 | 1147篇 |
冶金工业 | 397篇 |
原子能技术 | 48篇 |
自动化技术 | 11199篇 |
出版年
2024年 | 292篇 |
2023年 | 615篇 |
2022年 | 1218篇 |
2021年 | 1124篇 |
2020年 | 1159篇 |
2019年 | 910篇 |
2018年 | 758篇 |
2017年 | 806篇 |
2016年 | 882篇 |
2015年 | 952篇 |
2014年 | 1184篇 |
2013年 | 1095篇 |
2012年 | 1531篇 |
2011年 | 1484篇 |
2010年 | 1207篇 |
2009年 | 1149篇 |
2008年 | 1155篇 |
2007年 | 1243篇 |
2006年 | 1015篇 |
2005年 | 885篇 |
2004年 | 701篇 |
2003年 | 597篇 |
2002年 | 494篇 |
2001年 | 388篇 |
2000年 | 357篇 |
1999年 | 278篇 |
1998年 | 205篇 |
1997年 | 171篇 |
1996年 | 138篇 |
1995年 | 94篇 |
1994年 | 77篇 |
1993年 | 42篇 |
1992年 | 40篇 |
1991年 | 25篇 |
1990年 | 26篇 |
1989年 | 20篇 |
1988年 | 6篇 |
1986年 | 9篇 |
1985年 | 10篇 |
1984年 | 5篇 |
1983年 | 9篇 |
1982年 | 2篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1959年 | 1篇 |
1951年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
马钢一钢厂圆坯连铸机在原有二流基础上,新扩建一流,原自动化控制系统为意大利DANIELI公司设计,新铸流控制系统基于原设计要求进行转化、吸收及再设计,系统新加一套SIEMENS PLC控制系统,用于3^#铸流控制。 相似文献
992.
This study examined how response mapping of features within single- and multiple-feature targets affects decision-based processing and attentional capacity demands. Observers judged the presence or absence of 1 or 2 target features within an object either presented alone or with distractors. Judging the presence of 2 features relative to the less discriminable of these features alone was faster (conjunction benefits) when the task-relevant features differed in discriminability and were consistently mapped to responses. Conjunction benefits were attributed to asynchronous decision priming across attended, task-relevant dimensions. A failure to find conjunction benefits for disjunctive conjunctions was attributed to increased memory demands and variable feature-response mapping for 2- versus single-feature targets. Further, attentional demands were similar between single- and 2-feature targets when response mapping, memory demands, and discriminability of the task-relevant features were equated between targets. Implications of the findings for recent attention models are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
993.
Up-to-date, accurate topographic data are a crucial resource for volcanic research and risk mitigation efforts, in particular, for modeling volcanic flow processes at a detailed spatial resolution. In this paper, we examine the utility of the Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER) instrument currently operating on the NASA Terra satellite, which provides near infrared (VNIR) stereo imaging from which topography can be derived. We wrote software to generate digital elevation models (DEMs) from the ASTER level 1A product, which employs an automated stereo matching technique to calculate the parallax offsets between the images acquired by the nadir- and aft-looking sensors. Comparison of ASTER DEMs with DEMs derived from other sources (digitized 1:50 K topographic maps and aerial interferometric radar) at Ruapehu volcano reveal an RMS error of about 10 m for the ASTER DEM, in the absence of significant atmospheric water vapor. A qualitative assessment of surface features showed that the ASTER DEM is superior to the interpolated 1:50 K map product but falls short of the detail provided by aerial interferometric radar, especially in terms of stream channel preservation. A second ASTER DEM was generated for Taranaki volcano, where previously only 1:50 K topographic map data were available. Although the 2000 Space Shuttle radar topography mission (SRTM) will largely remedy the previous global paucity of adequate topographic data at volcanoes, such as Taranaki, we anticipate the problem that at active volcanoes, the topography may change significantly following activity, rendering the SRTM data inaccurate. With the high temporal coverage of the dataset, ASTER not only provides a means to update significant (>10 m) topographic measurements at active volcanoes via a time-series of DEMs, but also provides a simultaneous means to map surface cover and localized land-use via the near infrared sensors. Thus we demonstrate the potential for up-to-date volcanic economic risk assessment using geographic information systems (GIS) analysis. 相似文献
994.
Application of Kernel-Based Feature Space Transformations and Learning Methods to Phoneme Classification 总被引:1,自引:0,他引:1
This paper examines the applicability of some learning techniques to the classification of phonemes. The methods tested were artificial neural nets (ANN), support vector machines (SVM) and Gaussian mixture modeling (GMM). We compare these methods with a traditional hidden Markov phoneme model (HMM), working with the linear prediction-based cepstral coefficient features (LPCC). We also tried to combine the learners with linear/nonlinear and unsupervised/supervised feature space transformation methods such as principal component analysis (PCA), independent component analysis (ICA), linear discriminant analysis (LDA), springy discriminant analysis (SDA) and their nonlinear kernel-based counterparts. We found that the discriminative learners can attain the efficiency of HMM, and that after the transformations they can retain the same performance in spite of the severe dimension reduction. The kernel-based transformations brought only marginal improvements compared to their linear counterparts. 相似文献
995.
Induction of decision trees is one of the most successful approaches to supervised machine learning. Branching programs are a generalization of decision trees and, by the boosting analysis, exponentially more efficiently learnable than decision trees. However, this advantage has not been seen to materialize in experiments. Decision trees are easy to simplify using pruning. Reduced error pruning is one of the simplest decision tree pruning algorithms. For branching programs no pruning algorithms are known. In this paper we prove that reduced error pruning of branching programs is infeasible. Finding the optimal pruning of a branching program with respect to a set of pruning examples that is separate from the set of training examples is NP-complete. Because of this intractability result, we have to consider approximating reduced error pruning. Unfortunately, it turns out that even finding an approximate solution of arbitrary accuracy is computationally infeasible. In particular, reduced error pruning of branching programs is APX-hard. Our experiments show that, despite the negative theoretical results, heuristic pruning of branching programs can reduce their size without significantly altering the accuracy. 相似文献
996.
997.
In this paper, we propose a novel model-based perceptual grouping algorithm for the line features of 3-D polyhedral objects. Given a 3-D polyhedral model, perceptual grouping is performed to extract a set of 3-D line segments which are geometrically consistent with the 3-D model. Unlike the conventional approaches, grouping is done in 3-D space in a model-based framework. In our unique approach, a decision tree classifier is employed for encoding and retrieving the geometric information of the 3-D model. A Gestalt graph is constructed by classifying input instances into proper Gestalt relations using the decision tree. The Gestalt graph is then decomposed into a few subgraphs, yielding appropriate groups of features. As an application, we suggest a 3-D object recognition system which can be accomplished by selecting a best-matched group. In order to evaluate the performance of the proposed algorithm, experiments are carried out on both synthetic and real scenes. 相似文献
998.
A general feature extraction framework is proposed as an extension of conventional linear discriminant analysis. Two nonlinear feature extraction algorithms based on this framework are investigated. The first is a kernel function feature extraction (KFFE) algorithm. A disturbance term is introduced to regularize the algorithm. Moreover, it is revealed that some existing nonlinear feature extraction algorithms are the special cases of this KFFE algorithm. The second feature extraction algorithm, mean-STD1-norm feature extraction algorithm, is also derived from the framework. Experiments based on both synthetic and real data are presented to demonstrate the performance of both feature extraction algorithms. 相似文献
999.
1000.
The popularity of digital microscopy and tissue microarrays allow the use of high-throughput imaging for pathology research. To coordinate with this new technique, it is essential to automate the process of extracting information from such high amount of images. In this paper, we present a new model called the Subspace Mumford-Shah model for texture segmentation of microscopic endometrial images. The model incorporates subspace clustering techniques into a Mumford-Shah model to solve texture segmentation problems. The method first uses a supervised procedure to determine several optimal subspaces. These subspaces are then embedded into a Mumford-Shah objective function so that each segment of the optimal partition is homogeneous in its own subspace. The method outperforms a widely used method in bioimaging community called k-means segmentation since it can separate textures which are less separated in the full feature space, which confirm the usefulness of subspace clustering in texture segmentation. Experimental results also show that the proposed method is well performed on diagnosing premalignant endometrial disease and is very practical for segmenting image set sharing similar properties. 相似文献