全文获取类型
收费全文 | 20250篇 |
免费 | 3561篇 |
国内免费 | 2504篇 |
专业分类
电工技术 | 1243篇 |
综合类 | 2135篇 |
化学工业 | 569篇 |
金属工艺 | 296篇 |
机械仪表 | 1004篇 |
建筑科学 | 444篇 |
矿业工程 | 310篇 |
能源动力 | 220篇 |
轻工业 | 230篇 |
水利工程 | 184篇 |
石油天然气 | 356篇 |
武器工业 | 1214篇 |
无线电 | 5504篇 |
一般工业技术 | 1616篇 |
冶金工业 | 680篇 |
原子能技术 | 382篇 |
自动化技术 | 9928篇 |
出版年
2024年 | 204篇 |
2023年 | 463篇 |
2022年 | 859篇 |
2021年 | 867篇 |
2020年 | 869篇 |
2019年 | 784篇 |
2018年 | 701篇 |
2017年 | 880篇 |
2016年 | 990篇 |
2015年 | 1185篇 |
2014年 | 1454篇 |
2013年 | 1499篇 |
2012年 | 1663篇 |
2011年 | 1788篇 |
2010年 | 1378篇 |
2009年 | 1445篇 |
2008年 | 1446篇 |
2007年 | 1524篇 |
2006年 | 1155篇 |
2005年 | 989篇 |
2004年 | 784篇 |
2003年 | 658篇 |
2002年 | 533篇 |
2001年 | 449篇 |
2000年 | 369篇 |
1999年 | 252篇 |
1998年 | 193篇 |
1997年 | 162篇 |
1996年 | 149篇 |
1995年 | 101篇 |
1994年 | 87篇 |
1993年 | 75篇 |
1992年 | 56篇 |
1991年 | 46篇 |
1990年 | 35篇 |
1989年 | 36篇 |
1988年 | 24篇 |
1987年 | 17篇 |
1986年 | 15篇 |
1985年 | 12篇 |
1984年 | 7篇 |
1983年 | 14篇 |
1982年 | 16篇 |
1981年 | 12篇 |
1980年 | 12篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1976年 | 5篇 |
1975年 | 7篇 |
1959年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
杜昱 《数字社区&智能家居》2006,(8):15-15,57
文章首先概述了当前大多数的搜索引擎的主要的弊端;然后着重介绍了智能检索系统的运行基本思路和售用算法,以及该算法在检索领域中运用的优点;最后指出,神经网络运用在检索领域,可解决网络管理中的诸多难题。 相似文献
42.
Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times 总被引:3,自引:0,他引:3
In this article we study thetabu search (TS) method in an application for solving an important class of scheduling problems. Tabu search is characterized by integrating artificial intelligence and optimization principles, with particular emphasis on exploiting flexible memory structures, to yield a highly effective solution procedure. We first discuss the problem of minimizing the sum of the setup costs and linear delay penalties when N jobs, arriving at time zero, are to be scheduled for sequential processing on a continuously available machine. A prototype TS method is developed for this problem using the common approach of exchanging the position of two jobs to transform one schedule into another. A more powerful method is then developed that employs insert moves in combination with swap moves to search the solution space. This method and the best parameters found for it during the preliminary experimentation with the prototype procedure are used to obtain solutions to a more complex problem that considers setup times in addition to setup costs. In this case, our procedure succeeded in finding optimal solutions to all problems for which these solutions are known and a better solution to a larger problem for which optimizing procedures exceeded a specified time limit (branch and bound) or reached a memory overflow (branch and bound/dynamic programming) before normal termination. These experiments confirm not only the effectiveness but also the robustness of the TS method, in terms of the solution quality obtained with a common set of parameter choices for two related but different problems. 相似文献
43.
Markovian and semi-Markovian random processes are used to analyze the problem of optimal search for signals in a multichannel
communication system with arbitrarily distributed random outputs. The search efficiency factor is found in explicit form based
on state space merging, and a mathematical programming problem is set up to find a numerical suboptimal solution.
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 144–150, May–June 2007. 相似文献
44.
In this paper we present an efficient technique for piecewise cubic Bézier approximation of digitized curve. An adaptive breakpoint detection method divides a digital curve into a number of segments and each segment is approximated by a cubic Bézier curve so that the approximation error is minimized. Initial approximated Bézier control points for each of the segments are obtained by interpolation technique i.e. by the reverse recursion of De Castaljau's algorithm. Two methods, two-dimensional logarithmic search algorithm (TDLSA) and an evolutionary search algorithm (ESA), are introduced to find the best-fit Bézier control points from the approximate interpolated control points. ESA based refinement is proved to be better experimentally. Experimental results show that Bézier approximation of a digitized curve is much more accurate and uses less number of points compared to other approximation techniques. 相似文献
45.
The concept of combinatorial objects is formalized. It allows strict definition of a combinatorial optimization problem (COP).
An efficient metaheuristic method to solve COPs (H-method) is considered. It includes stochastic local search algorithms as
a built-in procedure. A parallel implementation of the H-method is set forth and analyzed. The results from a numerical experiment
and solution of some well-known COPs on personal computers and on the SKIT cluster supercomputer are presented.
The study was supported by INTAS (Project 06-1000017-8909).
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 70–79, November–December 2007. 相似文献
46.
47.
48.
真空阴极弧离子镀类金刚石碳(DLC)膜的碳弧稳定性研究 总被引:1,自引:0,他引:1
选用氩气、氩气加氢气、氩气加乙炔等气体作为介质,石墨作为靶材进行真空阴极弧离子镀来制备类金刚石碳膜。石墨电弧有其独特的电弧特性曲线,不同气体介质对碳弧特性的影响不同,磁场的大小对电弧的稳定性有很大作用,碳弧下基片偏流随电弧电压的增加而减小,试验得到表面光滑的类金刚石碳(DLC)膜,对膜的表面进行了SEM分析。 相似文献
49.
本文介绍以数字搜索树表示的二值图象的一种几何变换算法,文中讨论了四分区与正四边区的基本关系,输出DST结点成立的充分条件,给出了完整的几何变换算法并对算法的复杂性作了分析。 相似文献
50.
盛仲飙 《计算机与数字工程》2012,40(10):26-27,80
线性规划是运筹学中研究较早、发展较快、应用广泛、方法成熟的一个重要分支,它是辅助人们进行科学管理的一种重要的数学方法.文章首先介绍了线性规划的基本概念及标准形式,着重讨论了线性规划问题的三种常用解法:单纯形法、直接搜索法以及遗传算法,最后在Matlab R2009a环境下进行了仿真.通过结果可以看出,用Matlab求解线性规划问题,可以避免手工的烦琐计算,大大地提高工作效率和结果的准确性. 相似文献