首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   64763篇
  免费   12522篇
  国内免费   8875篇
工业技术   86160篇
  2024年   396篇
  2023年   1167篇
  2022年   2307篇
  2021年   2432篇
  2020年   2699篇
  2019年   2254篇
  2018年   2239篇
  2017年   2627篇
  2016年   3044篇
  2015年   3667篇
  2014年   4728篇
  2013年   4502篇
  2012年   5718篇
  2011年   5953篇
  2010年   4864篇
  2009年   4984篇
  2008年   5247篇
  2007年   5683篇
  2006年   4451篇
  2005年   3646篇
  2004年   2931篇
  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条查询结果,搜索用时 171 毫秒
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.
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.
基于遗传算法的优化排样   总被引:4,自引:0,他引:4  
介绍了遗传算法以及二维不规则图形的计算机优化排样,研究了二维不规则图形排样中如何建立遗传算法的目标函数,如何实现交叉、变异运算等优化过程,找到了运用遗传算法实现二维不规则图形优化排样的方法。通过计算机编制了运用遗传算法进行二维不规则图形优化排样的运算程序,并对部分样形进行了优化排样,结果比较满意。  相似文献   
104.
基于DTW算法的语音识别系统实现   总被引:10,自引:0,他引:10  
动态时间归整(DTW)算法的实现简单有效,在孤立词语音识别系统中得到了广泛的应用.介绍了将DTW算法移植到TMS320VC5402上实现孤立词语音识别的原理、系统硬件组成和软件设计.研究结果表明,系统能满足实时性能要求,识别效果良好.  相似文献   
105.
文章在对软输出维特比算法(SOVA)进行推导的基础上,分析了软信息的提取过程。同时从硬件实现的角度考虑,提出了一种基于滑动窗1:3结构的SOVA算法实现方案,该算法大大降低了算法实现复杂度和译码延迟,同时通过调整滑窗参数,可以取得与非滑窗SOVA算法几乎相同的性能。  相似文献   
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.
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.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号