首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5412篇
  免费   362篇
  国内免费   31篇
电工技术   104篇
综合类   5篇
化学工业   1565篇
金属工艺   177篇
机械仪表   149篇
建筑科学   196篇
矿业工程   12篇
能源动力   298篇
轻工业   543篇
水利工程   40篇
石油天然气   88篇
无线电   524篇
一般工业技术   994篇
冶金工业   327篇
原子能技术   35篇
自动化技术   748篇
  2023年   51篇
  2022年   145篇
  2021年   179篇
  2020年   145篇
  2019年   208篇
  2018年   291篇
  2017年   211篇
  2016年   226篇
  2015年   189篇
  2014年   223篇
  2013年   477篇
  2012年   253篇
  2011年   334篇
  2010年   279篇
  2009年   272篇
  2008年   257篇
  2007年   182篇
  2006年   198篇
  2005年   124篇
  2004年   122篇
  2003年   153篇
  2002年   118篇
  2001年   90篇
  2000年   107篇
  1999年   81篇
  1998年   128篇
  1997年   69篇
  1996年   53篇
  1995年   46篇
  1994年   39篇
  1993年   36篇
  1992年   26篇
  1991年   28篇
  1990年   21篇
  1989年   24篇
  1988年   27篇
  1987年   46篇
  1986年   27篇
  1985年   26篇
  1984年   26篇
  1983年   27篇
  1982年   15篇
  1981年   19篇
  1980年   26篇
  1979年   17篇
  1978年   21篇
  1977年   24篇
  1976年   28篇
  1975年   21篇
  1973年   19篇
排序方式: 共有5805条查询结果,搜索用时 0 毫秒
91.
92.
93.
94.
We report the spectral characterization of proton-exchanged lithium niobate (PE:LiNbO(3)) waveguides in terms of the variation of the refractive-index difference between the waveguiding layer and the substrate. The dispersion of the extraordinary refractive-index increase (deltan(e)) is measured from 405 to 1319 nm with several light sources. Two types of proton-exchanged waveguide, prepared under different conditions, are studied. These measurements should be of use in the optimization of PE:LiNbO(3) waveguides for nonlinear optical applications, particularly in second-harmonic generation in the blue-green wavelength region.  相似文献   
95.
A growing number of patients are recognised to have chronic kidney disease (CKD). However, only a minority will progress to end-stage renal disease requiring dialysis or transplantation. Currently available diagnostic and staging tools frequently fail to identify those at higher risk of progression or death. Furthermore within specific disease entities there are shortcomings in the prediction of the need for therapeutic interventions or the response to different forms of therapy. Kidney and urine proteomic biomarkers are considered as promising diagnostic tools to predict CKD progression early in diabetic nephropathy, facilitating timely and selective intervention that may reduce the related health-care expenditures. However, independent groups have not validated these findings and the technique is not currently available for routine clinical care. Furthermore, there are gaps in our understanding of predictors of progression or need for therapy in non-diabetic CKD. Presumably, a combination of tissue and urine biomarkers will be more informative than individual markers. This review identifies clinical questions in need of an answer, summarises current information on proteomic biomarkers and CKD, and describes the European Kidney and Urine Proteomics initiative that has been launched to carry out a clinical study aimed at identifying urinary proteomic biomarkers distinguishing between fast and slow progressors among patients with biopsy-proven primary glomerulopathies.  相似文献   
96.
In various information processing tasks obtaining regularized versions of a noisy or corrupted image data is often a prerequisite for successful use of classical image analysis algorithms. Image restoration and decomposition methods need to be robust if they are to be useful in practice. In particular, this property has to be verified in engineering and scientific applications. By robustness, we mean that the performance of an algorithm should not be affected significantly by small deviations from the assumed model. In image processing, total variation (TV) is a powerful tool to increase robustness. In this paper, we define several concepts that are useful in robust restoration and robust decomposition. We propose two extended total variation models, weighted total variation (WTV) and extended total variation (ETV). We state generic approaches. The idea is to replace the TV penalty term with more general terms. The motivation is to increase the robustness of ROF (Rudin, Osher, Fatemi) model and to prevent the staircasing effect due to this method. Moreover, rewriting the non-convex sublinear regularizing terms as WTV, we provide a new approach to perform minimization via the well-known Chambolle's algorithm. The implementation is then more straightforward than the half-quadratic algorithm. The behavior of image decomposition methods is also a challenging problem, which is closely related to anisotropic diffusion. ETV leads to an anisotropic decomposition close to edges improving the robustness. It allows to respect desired geometric properties during the restoration, and to control more precisely the regularization process. We also discuss why compression algorithms can be an objective method to evaluate the image decomposition quality.  相似文献   
97.
In this paper, we propose a video watermarking algorithm which embeds different parts of a single watermark into different shots of a video under the wavelet domain. Based on a Motion Activity Analysis, different regions of the original video are separated into perceptually distinct categories according to motion information and region complexity. Thus, the localizations of the watermark are adjusted adaptively in accordance with the human visual system and signal characteristics, which makes them perceptually invisible and less vulnerable to automated removal. In addition, contrary to traditional methods where the watermark remains at a fixed position on the screen, the watermark moves along with moving objects and thus motion artefacts can be avoid. The multi-frame based extraction strategy ensures that the watermark can be correctly recovered from a very short segment of video. Individual frames extracted from the video also contain watermark information. Experimental results show that the inserted watermark is not only less perceptible but also robust against common video processing attacks.  相似文献   
98.
We describe a quasi-Monte Carlo method for the simulation of discrete time Markov chains with continuous multi-dimensional state space. The method simulates copies of the chain in parallel. At each step the copies are reordered according to their successive coordinates. We prove the convergence of the method when the number of copies increases. We illustrate the method with numerical examples where the simulation accuracy is improved by large factors compared with Monte Carlo simulation.  相似文献   
99.
100.
Editors’ note     

Editorial Note

Editors’ note  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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