首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   72751篇
  免费   15979篇
  国内免费   8166篇
电工技术   9116篇
技术理论   1篇
综合类   8948篇
化学工业   1715篇
金属工艺   1499篇
机械仪表   5972篇
建筑科学   1558篇
矿业工程   1075篇
能源动力   1839篇
轻工业   939篇
水利工程   1199篇
石油天然气   867篇
武器工业   1213篇
无线电   13060篇
一般工业技术   4737篇
冶金工业   577篇
原子能技术   355篇
自动化技术   42226篇
  2025年   13篇
  2024年   1904篇
  2023年   1922篇
  2022年   2721篇
  2021年   2987篇
  2020年   3169篇
  2019年   2730篇
  2018年   2584篇
  2017年   2997篇
  2016年   3407篇
  2015年   3931篇
  2014年   5086篇
  2013年   4962篇
  2012年   6170篇
  2011年   6380篇
  2010年   5152篇
  2009年   5310篇
  2008年   5586篇
  2007年   6027篇
  2006年   4743篇
  2005年   3917篇
  2004年   3151篇
  2003年   2494篇
  2002年   1881篇
  2001年   1470篇
  2000年   1257篇
  1999年   1019篇
  1998年   842篇
  1997年   669篇
  1996年   521篇
  1995年   372篇
  1994年   318篇
  1993年   247篇
  1992年   229篇
  1991年   114篇
  1990年   145篇
  1989年   103篇
  1988年   64篇
  1987年   30篇
  1986年   41篇
  1985年   42篇
  1984年   26篇
  1983年   28篇
  1982年   26篇
  1981年   15篇
  1980年   23篇
  1979年   13篇
  1978年   11篇
  1975年   9篇
  1959年   9篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
该文主要介绍了袜机数据的整合及对整合的效率进行了分析,有效的减小了数据所占用的位数;根据袜机数据的特点且存在大量的重复性字符,我们应用无损编码技术对袜机数据冗余部分进行压缩,通过比较几种无损编码技术的平均压缩率,得出了最适合袜机数据的压缩方式。  相似文献   
62.
B/S架构的信息系统开发中,一般情况下,根据用户的选择,n个条件的输入组合数是2n个。但是,该文中提出的算法,其组合数仅为n到n(n+1)/2,大大简化了编程。  相似文献   
63.
In this paper, we propose an new error estimate algorithm (NEEA) for stereophonic acoustic echo cancellation (SAEC) that is based on the error estimation algorithm (EEA) in [Nguyen-Ky T, Leis J, Xiang W. An improved error estimate algorithm for stereophonic acoustic echo cancellation system. In: International conference on signal processing and communication systems, ICSPCS’2007, Australia; December 2007]. In the EEA and NEEA, with the minimum error signal fixed, we compute the filter lengths so that the error signal may approximate the minimum error signal. When the echo paths change, the adaptive filter automatically adjusts the filter lengths to the optimum values. We also investigate the difference between the adaptive filter lengths. In contrast with the conclusions in [Khong AWH, Naylor PA. Stereophonic acoustic echo cancellation employing selective-tap adaptive algorithms. IEEE Trans Audio, Speech, Lang Process 2006;14(3):785-96, Gansler T, Benesty J. Stereophonic acoustic echo cancellation and two channel adaptive filtering: an overview. Int J Adapt Control Signal Process 2000;4:565-86, Benesty J, Gansler T. A multichannel acoustic echo canceler double-talk detector based on a normalized cross-correlation matrix. Acoust Echo Noise Control 2002;13(2):95-101, Gansler T, Benesty J. A frequency-domain double-talk detector based on a normalized cross-correlation vector. Signal Process 2001;81:1783-7, Eneroth P, Gay SL, Gansler T, Benesty J. A real-time implementation of a stereophonic acoustic echo canceler. IEEE Trans. Speech Audio Process 2001;9(5):513-23, Gansler T, Benesty J. New insights into the stereophonic acoustic echo cancellation problem and an adaptive nonlinearity solution. IEEE Trans. Speech Audio Process 2002; 10(5):257-67, Benesty J, Gansler T, Morgan DR, Sondhi MM, Gay SL. Advances in network and acoustic echo cancellation. Berlin: Springer-Verlag; 2001], our simulation results have shown that the filter lengths can be different. Our simulation results also confirm that the NEEA is better than EEA and SM-NLMS algorithm in terms of echo return loss enhancement.  相似文献   
64.
This study presents a novel weight-based multiobjective artificial immune system (WBMOAIS) based on opt-aiNET, the artificial immune system algorithm for multi-modal optimization. The proposed algorithm follows the elementary structure of opt-aiNET, but has the following distinct characteristics: (1) a randomly weighted sum of multiple objectives is used as a fitness function. The fitness assignment has a much lower computational complexity than that based on Pareto ranking, (2) the individuals of the population are chosen from the memory, which is a set of elite solutions, and a local search procedure is utilized to facilitate the exploitation of the search space, and (3) in addition to the clonal suppression algorithm similar to that used in opt-aiNET, a new truncation algorithm with similar individuals (TASI) is presented in order to eliminate similar individuals in memory and obtain a well-distributed spread of non-dominated solutions. The proposed algorithm, WBMOAIS, is compared with the vector immune algorithm (VIS) and the elitist non-dominated sorting genetic system (NSGA-II) that are representative of the state-of-the-art in multiobjective optimization metaheuristics. Simulation results on seven standard problems (ZDT6, SCH2, DEB, KUR, POL, FON, and VNT) show WBMOAIS outperforms VIS and NSGA-II and can become a valid alternative to standard algorithms for solving multiobjective optimization problems.  相似文献   
65.
A scanning electron microscope (SEM) is a sophisticated equipment employed for fine imaging of a variety of surfaces. In this study, prediction models of SEM were constructed by using a generalized regression neural network (GRNN) and genetic algorithm (GA). The SEM components examined include condenser lens 1 and 2 and objective lens (coarse and fine) referred to as CL1, CL2, OL-Coarse, and OL-Fine. For a systematic modeling of SEM resolution (R), a face-centered Box–Wilson experiment was conducted. Two sets of data were collected with or without the adjustment of magnification. Root-mean-squared prediction error of optimized GRNN models are GA 0.481 and 1.96×10-12 for non-adjusted and adjusted data, respectively. The optimized models demonstrated a much improved prediction over statistical regression models. The optimized models were used to optimize parameters particularly under best tuned SEM environment. For the variations in CL2 and OL-Coarse, the highest R could be achieved at all conditions except a larger CL2 either at smaller or larger OL-Coarse. For the variations in CL1 and CL2, the highest R was obtained at all conditions but larger CL2 and smaller CL1.  相似文献   
66.
基于蚁群算法的网格资源发现模型研究   总被引:1,自引:0,他引:1  
本文通过对传统的网格资源发现存在的问题进行分析,针对其不足,引入蚁群算法,提出基于蚁群算法的网格资源发现模型(AA_GRRM),设计并分析AA_GRRM的体系结构,并对其关键模块分析设计,以提高网格资源发现效率。  相似文献   
67.
随着网络技术的飞速发展和接入性能的不断提高,如今全世界的互联主干网络呈现出一种高速网络的特性。在这种网络特性下,传统网络中的TCP拥塞控制协议已经开始显现出不适应性,发现了FAST TCP协议中"持续拥塞"的形成机制,建立了数学模型来准确的描述"持续拥塞"所导致数据流之间带宽分配不公平的问题,进一步利用优先服务队列的方法解决了FAST TCP在网络中的持续拥塞现象。  相似文献   
68.
Determination of deformation modulus and coefficient of subgrade reaction of soils have major importance, whether the projects are in design, and construction or compaction assessment stage of earth filling structures. Plate load test is one of the frequently used method to directly determine the parameters but the method is both costly and time consuming. For this reason, this paper is concerned with the applications of artificial neural networks (ANN) and simple-multiple regression analysis to predict deformation modulus and coefficient of subgrade reaction of compacted soils from compaction parameters (such as maximum dry density (MDD) and optimum moisture content (OMC), field dry density (FDD), and field moisture content (FMC)). Regression analysis and artificial neural network estimation indicated that there are acceptable correlations between deformation modulus and coefficient of subgrade reaction and these parameters. Artificial neural networks model exhibits higher performance than traditional statistical model for predicting deformation modulus and coefficient of subgrade reaction.  相似文献   
69.
混沌权值变异的Huffman树图像加密算法   总被引:1,自引:0,他引:1  
提出一种采用混沌权值变异的Huff man树的图像加密算法.此算法在熵编码过程中,以基本的Huffman树为标准,利用双耦合混沌序列1对DC系数进行树的结构未变异、路径值变异的加密;再利用双耦合混沌序列2对AC系数进行码字序号的加密.论文对算法进行了仿真,并对安全性、计算复杂度、压缩比性能进行了分析.实验结果表明,该算法基本上不影响压缩效率,且计算复杂度低、安全性高和实时性好,可用于网络上的图像服务.  相似文献   
70.
In this paper, we investigate an inexact hybrid projection-proximal method for solving a class of generalized mixed variational inequalities in Hilbert spaces. We construct a general inexact hybrid projection-proximal point algorithm, in which an inexact relaxed proximal point step is followed by a suitable orthogonal projection onto a hyperplane. Under some suitable conditions concerned with the pseudomonotone set-valued mapping T, the nonsmooth convex function f and the step size λk, we prove the convergence of the inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities in Hilbert spaces.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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