全文获取类型
收费全文 | 71418篇 |
免费 | 13283篇 |
国内免费 | 9520篇 |
专业分类
电工技术 | 8317篇 |
技术理论 | 2篇 |
综合类 | 8701篇 |
化学工业 | 1454篇 |
金属工艺 | 1839篇 |
机械仪表 | 6507篇 |
建筑科学 | 1316篇 |
矿业工程 | 993篇 |
能源动力 | 1459篇 |
轻工业 | 961篇 |
水利工程 | 1110篇 |
石油天然气 | 793篇 |
武器工业 | 1196篇 |
无线电 | 12591篇 |
一般工业技术 | 4351篇 |
冶金工业 | 532篇 |
原子能技术 | 267篇 |
自动化技术 | 41832篇 |
出版年
2024年 | 540篇 |
2023年 | 1408篇 |
2022年 | 2590篇 |
2021年 | 2786篇 |
2020年 | 3028篇 |
2019年 | 2491篇 |
2018年 | 2473篇 |
2017年 | 2872篇 |
2016年 | 3311篇 |
2015年 | 3953篇 |
2014年 | 5114篇 |
2013年 | 4901篇 |
2012年 | 6155篇 |
2011年 | 6484篇 |
2010年 | 5199篇 |
2009年 | 5336篇 |
2008年 | 5582篇 |
2007年 | 6084篇 |
2006年 | 4840篇 |
2005年 | 3943篇 |
2004年 | 3186篇 |
2003年 | 2535篇 |
2002年 | 1914篇 |
2001年 | 1475篇 |
2000年 | 1263篇 |
1999年 | 998篇 |
1998年 | 809篇 |
1997年 | 653篇 |
1996年 | 505篇 |
1995年 | 359篇 |
1994年 | 300篇 |
1993年 | 231篇 |
1992年 | 215篇 |
1991年 | 108篇 |
1990年 | 137篇 |
1989年 | 96篇 |
1988年 | 67篇 |
1987年 | 24篇 |
1986年 | 34篇 |
1985年 | 34篇 |
1984年 | 26篇 |
1983年 | 26篇 |
1982年 | 28篇 |
1981年 | 17篇 |
1980年 | 20篇 |
1979年 | 10篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1975年 | 9篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 29 毫秒
71.
径向基函数神经网络的再学习算法及其应用 总被引:3,自引:1,他引:2
谭建辉 《微电子学与计算机》2006,23(5):115-117,120
为了应用径向基函数神经网络逐步地识别待研究系统,文章针对径向基函数神经网络的再学习算法开展了深入的研究.应用严格的数学推理方法,将径向基函数神经网络的再学习问题转化为矩阵求逆的附加运算.详细给出了径向基函数神经网络再学习算法中增加新训练样本和增加新基函数的数学公式,同时对如何获取新的训练样本进行了研究. 相似文献
72.
目前需求预测在整个印制电路板产业的生产活动控制中正扮演着越来越重要的角色。分析了影响印制电路板需求的因素和现有的预测方法,提出了一种适用于PCB产业需求预测的有效方法——遗传/BP—神经网络。实验表明该方法能够进一步改善印制电路板预测的准确度和减少生产成本的消耗。 相似文献
73.
嵌入式GPS车载系统定位数据压缩算法的实现 总被引:2,自引:0,他引:2
根据嵌入式系统的特征,分析数据压缩模型工作原理,结合GPS定位数据的格式和特点,创造性地提出了嵌入式GPS定位数据的实时压缩的新算法,并通过模拟仿真得到验证,效果显著。 相似文献
74.
应用遗传算法设计和开发了针对爱立信GSM900系统的频率规划软件。在设计中,采用了交叉点存储、变异回退以及分割分步降维的方法,从而提高遗传算法的执行速度。 相似文献
75.
An Improved Immune Genetic Algorithm for Solving the Optimization Problems of Computer Communication Networks 总被引:4,自引:0,他引:4
1 IntroductionIndesigningacomputercommunicationnet work ,thenetworkaveragedelayisanimportantpa rameterinthenetworkperformance .Inthispaper,weonlyconsiderM /M/1networks,whichmeansthatthemessageprocessingtimeisaprobabilisticdensityfunctionwithnegativepower,thegroupar rivalandsendingisofPoissiondistributionwithasinglequeue .Supposethatthenetworktopologicalstructureandtheestimatesoftheexternaltrafficrequirementsaregiven ,howtoselecttheoptimalroutestobeusedbythecommunicatingnodesinthenetworksoast… 相似文献
76.
77.
A. Kaveh V. Kalatjari 《International journal for numerical methods in engineering》2003,58(5):771-791
In this article size/topology optimization of trusses is performed using a genetic algorithm (GA), the force method and some concepts of graph theory. One of the main difficulties with optimization with a GA is that the parameters involved are not completely known and the number of operations needed is often quite high. Application of some concepts of the force method, together with theory of graphs, make the generation of a suitable initial population well‐matched with critical paths for the transformation of internal forces feasible. In the process of optimization generated topologically unstable trusses are identified without any matrix manipulation and highly penalized. Identifying a suitable range for the cross‐section of each member for the ground structure in the list of profiles, the length of the substrings representing the cross‐sectional design variables are reduced. Using a contraction algorithm, the length of the strings is further reduced and a GA is performed in a smaller domain of design space. The above process is accompanied by efficient methods for selection, and by using a suitable penalty function in order to reduce the number of numerical operations and to increase the speed of the optimization toward a global optimum. The efficiency of the present method is illustrated using some examples, and compared to those of previous studies. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
78.
Chih-Ming Chen Hahn-Ming Lee Chia-Chen Tan 《Engineering Applications of Artificial Intelligence》2006,19(8):967-978
The explosion of on-line information has given rise to many manually constructed topic hierarchies (such as Yahoo!!). But with the current growth rate in the amount of information, manual classification in topic hierarchies results in an immense information bottleneck. Therefore, developing an automatic classifier is an urgent need. However, classifiers suffer from enormous dimensionality, since the dimensionality is determined by the number of distinct keywords in a document corpus. More seriously, most classifiers are either working slowly or they are constructed subjectively without any learning ability. In this paper, we address these problems with a fair feature-subset selection (FFSS) algorithm and an adaptive fuzzy learning network (AFLN) for classification. The FFSS algorithm is used to reduce the enormous dimensionality. It not only gives fair treatment to each category but also has ability to identify useful features, including both positive and negative features. On the other hand, the AFLN provides extremely fast learning ability to model the uncertain behavior for classification so as to correct the fuzzy matrix automatically. Experimental results show that both FFSS algorithm and the AFLN lead to a significant improvement in document classification, compared to alternative approaches. 相似文献
79.
80.
In this paper, we propose a new reduced-complexity decoding algorithm of Low-Density Parity-Check (LDPC) codes, called Belief-Propagation-Approximated (BPA) algorithm, which utilizes the idea of normalization and translates approximately the intricate nonlinear operation in the check nodes of the original BP algorithm to only one operation of looking up the table. The normalization factors can be obtained by simulation, or theoretically. Simulation results demonstrate that BPA algorithm exhibits fairly satisfactory bit error performance on the Additive White Gaussian Noise (AWGN) channel. 相似文献