全文获取类型
收费全文 | 23758篇 |
免费 | 3059篇 |
国内免费 | 2230篇 |
专业分类
电工技术 | 2284篇 |
技术理论 | 1篇 |
综合类 | 2783篇 |
化学工业 | 1102篇 |
金属工艺 | 395篇 |
机械仪表 | 1913篇 |
建筑科学 | 643篇 |
矿业工程 | 330篇 |
能源动力 | 568篇 |
轻工业 | 1138篇 |
水利工程 | 441篇 |
石油天然气 | 511篇 |
武器工业 | 342篇 |
无线电 | 2195篇 |
一般工业技术 | 1819篇 |
冶金工业 | 429篇 |
原子能技术 | 85篇 |
自动化技术 | 12068篇 |
出版年
2024年 | 108篇 |
2023年 | 263篇 |
2022年 | 597篇 |
2021年 | 621篇 |
2020年 | 639篇 |
2019年 | 597篇 |
2018年 | 535篇 |
2017年 | 687篇 |
2016年 | 824篇 |
2015年 | 987篇 |
2014年 | 1275篇 |
2013年 | 1553篇 |
2012年 | 1636篇 |
2011年 | 1874篇 |
2010年 | 1445篇 |
2009年 | 1718篇 |
2008年 | 1880篇 |
2007年 | 2061篇 |
2006年 | 1809篇 |
2005年 | 1458篇 |
2004年 | 1285篇 |
2003年 | 1039篇 |
2002年 | 859篇 |
2001年 | 653篇 |
2000年 | 580篇 |
1999年 | 391篇 |
1998年 | 325篇 |
1997年 | 270篇 |
1996年 | 182篇 |
1995年 | 133篇 |
1994年 | 111篇 |
1993年 | 83篇 |
1992年 | 86篇 |
1991年 | 55篇 |
1990年 | 43篇 |
1989年 | 43篇 |
1988年 | 55篇 |
1987年 | 32篇 |
1986年 | 25篇 |
1985年 | 34篇 |
1984年 | 48篇 |
1983年 | 27篇 |
1982年 | 21篇 |
1981年 | 20篇 |
1980年 | 19篇 |
1979年 | 12篇 |
1978年 | 7篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
应用遗传算法设计和开发了针对爱立信GSM900系统的频率规划软件。在设计中,采用了交叉点存储、变异回退以及分割分步降维的方法,从而提高遗传算法的执行速度。 相似文献
22.
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… 相似文献
23.
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. 相似文献
24.
基于遗传算法的服装工序编排规划 总被引:2,自引:0,他引:2
本文讨论了建立服装工序编排系统的必要性,在进行服装工序拆分、合并的基础上,应用遗传算法建立了以流水线平衡为目标的服装工序编排模型. 相似文献
25.
改进型遗传算法在加载天线设计中的运用 总被引:5,自引:2,他引:3
遗传算法是一种全新的优化搜索方法,可以用来解决各种复杂的实际问题。针对简单型遗传算法的一些不足之处,介绍了一种改进型的遗传算法,并阐述了其在短波宽带集总加载天线优化设计中的运用。 相似文献
26.
遗传算法在期货市场创新决策中的应用 总被引:1,自引:0,他引:1
研究了遗传算法在期货市场创新决策中的应用问题,在期货市场的保值者和投资者数目以及期货合约结构模型的基础上,设计了期货市场创新的染色体表达和遗传操作并进行了仿真研究。 相似文献
27.
An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods.
Recommended by: Patrick Valduriez 相似文献
28.
提出了一种实时心电图ECG数据压缩算法。它是将自适应变门限算法与转折点算法相结合。自适应变门限算法是对AZTEC算法的改进.它计算ECG信号的几个统计参数来确定可变门限值。转折点算法是分析采样点的趋势并只存储每对连续的采样点中的一个。它保留信号的斜坡标志发生变化的峰点和谷点。本文算法兼有这两种算法的优点。这种算法在较高压缩比的情况下重建心电图信号失真较小. 相似文献
29.
心电地图仪中工频干扰的一种滤除方法 总被引:1,自引:0,他引:1
在心电地图仪中记录到的体表心电信号往往由于电磁的影响而引进工频干扰.基于体表心电信号中工频干扰的特点,作者提出了一种滤除工频干扰的方法,即就单独—胸导联信号通过提高频谱的分辨率来估计工频干扰的频率;基于最小均方误差准则来估计各导联信号中工频干扰的幅度和相位。文中还给出了该算法的流程图和滤波性能分析。模拟结果表明了该算法的有效性。应用该算法对心电地图仪中的工频干扰进行对消,取得了满意的结果。 相似文献
30.
BP算法的改进及用模拟电路实现的神经网络分类器 总被引:1,自引:0,他引:1
基于用模拟电路实现神经网络分类器的目的,对多层静态前馈神经网络的BP算法做了改进,采用线性限幅函数代替Sigmoid函数作为神经元的激活函数,给出了改进的BP算法。对该算法性能的实验研究表明:这种改进算法不但方便了用线性模拟集成运算放大电路实现神经网络,而且具有学习速度快,映射能力强等优点。根据本文算法设计的神经网络分类器,无论是计算机仿真,还是模拟电路实现,都得到了比较高的识别率。 相似文献