全文获取类型
收费全文 | 64834篇 |
免费 | 12490篇 |
国内免费 | 8888篇 |
专业分类
电工技术 | 8132篇 |
技术理论 | 1篇 |
综合类 | 8472篇 |
化学工业 | 1301篇 |
金属工艺 | 1233篇 |
机械仪表 | 5156篇 |
建筑科学 | 1167篇 |
矿业工程 | 915篇 |
能源动力 | 1370篇 |
轻工业 | 644篇 |
水利工程 | 1075篇 |
石油天然气 | 762篇 |
武器工业 | 1176篇 |
无线电 | 11764篇 |
一般工业技术 | 4029篇 |
冶金工业 | 379篇 |
原子能技术 | 259篇 |
自动化技术 | 38377篇 |
出版年
2024年 | 407篇 |
2023年 | 1167篇 |
2022年 | 2308篇 |
2021年 | 2439篇 |
2020年 | 2699篇 |
2019年 | 2255篇 |
2018年 | 2239篇 |
2017年 | 2629篇 |
2016年 | 3045篇 |
2015年 | 3670篇 |
2014年 | 4732篇 |
2013年 | 4506篇 |
2012年 | 5719篇 |
2011年 | 5956篇 |
2010年 | 4871篇 |
2009年 | 4988篇 |
2008年 | 5249篇 |
2007年 | 5683篇 |
2006年 | 4453篇 |
2005年 | 3646篇 |
2004年 | 2930篇 |
2003年 | 2317篇 |
2002年 | 1711篇 |
2001年 | 1330篇 |
2000年 | 1139篇 |
1999年 | 887篇 |
1998年 | 712篇 |
1997年 | 565篇 |
1996年 | 435篇 |
1995年 | 296篇 |
1994年 | 256篇 |
1993年 | 193篇 |
1992年 | 188篇 |
1991年 | 89篇 |
1990年 | 122篇 |
1989年 | 80篇 |
1988年 | 57篇 |
1987年 | 21篇 |
1986年 | 30篇 |
1985年 | 30篇 |
1984年 | 22篇 |
1983年 | 22篇 |
1982年 | 24篇 |
1981年 | 13篇 |
1980年 | 20篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1977年 | 8篇 |
1975年 | 9篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
Automated currency validation requires a decision to be made regarding the authenticity of a banknote presented to the validation system. This decision often has to be made with little or no information regarding the characteristics of possible counterfeits as is the case for issues of new currency. A method for automated currency validation is presented which segments the whole banknote into different regions, builds individual classifiers on each region and then combines a small subset of the region specific classifiers to provide an overall decision. The segmentation and combination of region specific classifiers to provide optimized false positive and false negative rates is achieved by employing a genetic algorithm. Experiments based on high value notes of Sterling currency were carried out to assess the effectiveness of the proposed solution. 相似文献
102.
Minglun Gong Author Vitae Author Vitae 《Pattern recognition》2004,37(8):1723-1733
Many computer vision problems can be formulated as optimization problems. Presented in this paper is a new framework based on the quadtree-based genetic algorithm that can be applied to solve many of these problems. The proposed algorithm incorporates the quadtree structure into the conventional genetic algorithm. The solutions of image-related problems are encoded through encoding the corresponding quadtrees, and therefore, the 2D locality within a solution can be preserved. Examples addressed using the proposed framework include image segmentation, stereo vision, and motion estimation. In all cases, encouraging results are obtained. 相似文献
103.
104.
105.
106.
We are concerned with the detection of edges—the location and amplitudes of jump discontinuities of piecewise smooth data realized in terms of its discrete grid values. We discuss the interplay between two approaches. One approach, realized in the physical space, is based on local differences and is typically limited to low-order of accuracy. An alternative approach developed in our previous work [Gelb and Tadmor, Appl. Comp. Harmonic Anal., 7, 101–135 (1999)] and realized in the dual Fourier space, is based on concentration factors; with a proper choice of concentration factors one can achieve higher-orders—in fact in [Gelb and Tadmor, SIAM J. Numer. Anal., 38, 1389–1408 (2001)] we constructed exponentially accurate edge detectors. Since the stencil of these highly-accurate detectors is global, an outside threshold parameter is required to avoid oscillations in the immediate neighborhood of discontinuities. In this paper we introduce an adaptive edge detection procedure based on a cross-breading between the local and global detectors. This is achieved by using the minmod limiter to suppress spurious oscillations near discontinuities while retaining high-order accuracy away from the jumps. The resulting method provides a family of robust, parameter-free edge-detectors for piecewise smooth data. We conclude with a series of one- and two-dimensional simulations.To David Gottlieb, on his 60th birthday, with friendship and appreciation. 相似文献
107.
A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized
data (Chojnacki, W., et al. in IEEE Trans. Pattern Anal. Mach. Intell. 25(9):1172–1177, 2003) relies upon adoption of a certain model for statistical data distribution. Under this model, the cost function that underlies
the algorithm operating on the normalized data is statistically more advantageous than the cost function that underpins the
algorithm using unnormalized data. Here we extend this explanation by introducing a more refined, structured model for data
distribution. Under the extended model, the normalized eight-point algorithm turns out to be approximately consistent in a
statistical sense. The proposed extension provides a link between the existing statistical rationalization of the normalized
eight-point algorithm and the approach of Mühlich and Mester for enhancing total least squares estimation methods via equilibration.
The paper forms part of a wider effort to rationalize and interrelate foundational methods in vision parameter estimation. 相似文献
108.
Gilles Celeux Author VitaeFlorence ForbesAuthor Vitae Nathalie Peyrard Author Vitae 《Pattern recognition》2003,36(1):131-144
Image segmentation using Markov random fields involves parameter estimation in hidden Markov models for which the EM algorithm is widely used. In practice, difficulties arise due to the dependence structure in the models and approximations are required. Using ideas from the mean field approximation principle, we propose a class of EM-like algorithms in which the computation reduces to dealing with systems of independent variables. Within this class, the simulated field algorithm is a new stochastic algorithm which appears to be the most promising for its good performance and speed, on synthetic and real image experiments. 相似文献
109.
110.
梁昔明 《中南工业大学学报(英文版)》2005,12(1):93-96
An active set truncated-Newton algorithm (ASTNA) is proposed to solve the large-scale bound constrained sub-problems. The global convergence of the algorithm is obtained and two groups of numerical experiments are made for the various large-scale problems of varying size. The comparison results between ASTNA and the subspace limited memory quasi-Newton algorithm and between the modified augmented Lagrange multiplier methods combined with ASTNA and the modified barrier function method show the stability and effectiveness of ASTNA for simultaneous optimization of distillation column. 相似文献