全文获取类型
收费全文 | 254259篇 |
免费 | 2136篇 |
国内免费 | 376篇 |
专业分类
电工技术 | 4454篇 |
综合类 | 287篇 |
化学工业 | 41984篇 |
金属工艺 | 9592篇 |
机械仪表 | 7621篇 |
建筑科学 | 5934篇 |
矿业工程 | 1431篇 |
能源动力 | 6120篇 |
轻工业 | 25475篇 |
水利工程 | 2701篇 |
石油天然气 | 5135篇 |
武器工业 | 32篇 |
无线电 | 26097篇 |
一般工业技术 | 47481篇 |
冶金工业 | 46559篇 |
原子能技术 | 6039篇 |
自动化技术 | 19829篇 |
出版年
2021年 | 2629篇 |
2020年 | 1978篇 |
2019年 | 2500篇 |
2018年 | 3793篇 |
2017年 | 3685篇 |
2016年 | 4122篇 |
2015年 | 2582篇 |
2014年 | 4362篇 |
2013年 | 10769篇 |
2012年 | 6776篇 |
2011年 | 8930篇 |
2010年 | 7133篇 |
2009年 | 7779篇 |
2008年 | 8203篇 |
2007年 | 8307篇 |
2006年 | 7229篇 |
2005年 | 6313篇 |
2004年 | 6060篇 |
2003年 | 5828篇 |
2002年 | 5883篇 |
2001年 | 5702篇 |
2000年 | 5519篇 |
1999年 | 5461篇 |
1998年 | 12848篇 |
1997年 | 9128篇 |
1996年 | 7013篇 |
1995年 | 5457篇 |
1994年 | 4851篇 |
1993年 | 4741篇 |
1992年 | 3735篇 |
1991年 | 3462篇 |
1990年 | 3666篇 |
1989年 | 3531篇 |
1988年 | 3361篇 |
1987年 | 2953篇 |
1986年 | 2976篇 |
1985年 | 3427篇 |
1984年 | 3272篇 |
1983年 | 2936篇 |
1982年 | 2780篇 |
1981年 | 2854篇 |
1980年 | 2759篇 |
1979年 | 2644篇 |
1978年 | 2722篇 |
1977年 | 2988篇 |
1976年 | 3883篇 |
1975年 | 2406篇 |
1974年 | 2264篇 |
1973年 | 2395篇 |
1972年 | 1987篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Yan R Zhang J Yang J Hauptmann AG 《IEEE transactions on pattern analysis and machine intelligence》2006,28(4):578-593
To deal with the problem of insufficient labeled data in video object classification, one solution is to utilize additional pairwise constraints that indicate the relationship between two examples, i.e., whether these examples belong to the same class or not. In this paper, we propose a discriminative learning approach which can incorporate pairwise constraints into a conventional margin-based learning framework. Different from previous work that usually attempts to learn better distance metrics or estimate the underlying data distribution, the proposed approach can directly model the decision boundary and, thus, require fewer model assumptions. Moreover, the proposed approach can handle both labeled data and pairwise constraints in a unified framework. In this work, we investigate two families of pairwise loss functions, namely, convex and nonconvex pairwise loss functions, and then derive three pairwise learning algorithms by plugging in the hinge loss and the logistic loss functions. The proposed learning algorithms were evaluated using a people identification task on two surveillance video data sets. The experiments demonstrated that the proposed pairwise learning algorithms considerably outperform the baseline classifiers using only labeled data and two other pairwise learning algorithms with the same amount of pairwise constraints. 相似文献
992.
Learning vector quantization with training data selection 总被引:2,自引:0,他引:2
Pedreira CE 《IEEE transactions on pattern analysis and machine intelligence》2006,28(1):157-162
In this paper, we propose a method that selects a subset of the training data points to update LVQ prototypes. The main goal is to conduct the prototypes to converge at a more convenient location, diminishing misclassification errors. The method selects an update set composed by a subset of points considered to be at the risk of being captured by another class prototype. We associate the proposed methodology to a weighted norm, instead of the Euclidean, in order to establish different levels of relevance for the input attributes. The technique was implemented on a controlled experiment and on Web available data sets. 相似文献
993.
Yu. I. Zhuravlev I. B. Gurevich E. M. Romanov H. Niemann V. A. Ivanov 《Pattern Recognition and Image Analysis》2006,16(4):656-658
Proceedings of the 7th International Conference on Pattern Recognition and Image Analysis: New Information Technologies (PRIA-7-2004)18–23 October, 2004, St. Petersburg, Russian Federation Revised papers
From the editors 相似文献994.
We investigate a method to exploit the symmetry inherent to many discrete-event systems in order to reduce the computational complexity of the supervisory control problem (SCP). We characterize symmetry using notions of group theory and derive conditions under which there exists a quotient (reduced) automaton representation for a language with, in general, a much smaller state space than the original minimal (in number of states) automaton representation for the language. We then propose an algorithm to synthesize a solution to the SCP which is similar to the classical one, but performed on reduced automata. Special attention is given to the particular case of systems whose models contain similar components. The approach is illustrated by an example of control of a small production line 相似文献
995.
Information theory in ecology. 总被引:4,自引:0,他引:4
R E Ulanowicz 《Computers & chemistry》2001,25(4):393-399
996.
997.
998.
The generalized Landweber iteration with a variable shaping matrix is used to solve the large linear system of equations arising in the image reconstruction problem of emission tomography. The method is based on the property that once a spatial frequency image component is almost recovered within in in the generalized Landweber iteration, this component will still stay within in during subsequent iterations with a different shaping matrix, as long as this shaping matrix satisfies the convergence criterion for the component. Two different shaping matrices are used: the first recovers low-frequency image components; and the second may be used either to accelerate the reconstruction of high-frequency image components, or to attenuate these components to filter the image. The variable shaping matrix gives results similar to truncated inverse filtering, but requires much less computation and memory, since it does not rely on the singular value decomposition. 相似文献
999.
I. M. Kozlov G. S. Romanov A. E. Suvorov 《Journal of Engineering Physics and Thermophysics》1993,65(3):861-866
A generalization of the Harten TVD-scheme in the form of a predictor-corrector-type scheme of second-order accuracy in time and space is proposed for the flows with spherical and cylindrical symmetry. The scheme does not require introducing components with artificial viscosity and describes discontinuities in the solution without the appearance of nonphysical oscillations for a Courant number less than 0.8.Academic Scientific Complex A. V. Luikov Heat and Mass Transfer Institute of the Academy of Sciences of Belarus, Minsk. Translated from Inzhenerno-Fizicheskii Zhurnal, Vol. 65, No. 3, pp. 296–301, September, 1993. 相似文献
1000.
E Viscogliosi H Philippe A Baroin R Perasso G Brugerolle 《Canadian Metallurgical Quarterly》1993,40(4):411-421
Several domains of large subunit rRNA from nine trichomonad species have been sequenced. Molecular phylogenies obtained with parsimony and distance methods demonstrate the trichomonads are a monophyletic group which branches very early in the eukaryotic tree. The topology of the trees is in general agreement with traditional views on evolutionary and systematic relationships of trichomonads. A clear dichotomy is noted between the subfamily Trichomonadinae and the subfamily Tritrichomonadinae. In the latter subfamily, a second division separates the "Tritrichomonas muris-type" species from the "Tritrichomonas augusta-type" ones. Previous evolutionary schemes in which the Monocercomonadidae were regarded as the most "primitive" and the Trichomonadidae as more "evolved" are not in agreement with our molecular data. The emergence of Monocercomonas and Hypotrichomonas at the base of the Tritrichomonas lineage suggests a secondary loss of some cytoskeletal structures, the costa and undulating membrane in these genera. This is corroborated by the early branching position of Trichomitus, which possesses a costa and an undulating membrane and has usually been placed among the Trichomonadidae on the basis of cytological characters. A cladistic analysis was applied to the available morphological characters in order to produce a hierarchical grouping of the taxa reflecting their morphological diversity. 相似文献