全文获取类型
收费全文 | 75630篇 |
免费 | 13903篇 |
国内免费 | 9839篇 |
专业分类
电工技术 | 10093篇 |
技术理论 | 1篇 |
综合类 | 10032篇 |
化学工业 | 1739篇 |
金属工艺 | 1638篇 |
机械仪表 | 6550篇 |
建筑科学 | 2009篇 |
矿业工程 | 1260篇 |
能源动力 | 1983篇 |
轻工业 | 860篇 |
水利工程 | 1367篇 |
石油天然气 | 1139篇 |
武器工业 | 1370篇 |
无线电 | 12697篇 |
一般工业技术 | 5083篇 |
冶金工业 | 607篇 |
原子能技术 | 291篇 |
自动化技术 | 40653篇 |
出版年
2024年 | 522篇 |
2023年 | 1295篇 |
2022年 | 2581篇 |
2021年 | 2756篇 |
2020年 | 3066篇 |
2019年 | 2535篇 |
2018年 | 2518篇 |
2017年 | 3004篇 |
2016年 | 3460篇 |
2015年 | 4124篇 |
2014年 | 5366篇 |
2013年 | 5180篇 |
2012年 | 6552篇 |
2011年 | 6859篇 |
2010年 | 5531篇 |
2009年 | 5617篇 |
2008年 | 5888篇 |
2007年 | 6497篇 |
2006年 | 5110篇 |
2005年 | 4231篇 |
2004年 | 3389篇 |
2003年 | 2726篇 |
2002年 | 2059篇 |
2001年 | 1647篇 |
2000年 | 1440篇 |
1999年 | 1117篇 |
1998年 | 907篇 |
1997年 | 726篇 |
1996年 | 562篇 |
1995年 | 412篇 |
1994年 | 363篇 |
1993年 | 262篇 |
1992年 | 262篇 |
1991年 | 151篇 |
1990年 | 155篇 |
1989年 | 104篇 |
1988年 | 87篇 |
1987年 | 31篇 |
1986年 | 35篇 |
1985年 | 35篇 |
1984年 | 26篇 |
1983年 | 27篇 |
1982年 | 31篇 |
1981年 | 14篇 |
1980年 | 24篇 |
1979年 | 13篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1975年 | 12篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 234 毫秒
101.
目前采用的视频流调度算法,没有充分利用补丁流满足服务率高而占用系统资源少的优势,系统效率较低.为了提高效率,提出了一种基于MFQ的补丁优先算法,并给出了该算法的系统流程。通过对实验结果的比较,该算法在用户请求撤销率、节目调度不公平性和用户等待时间方面有明显的优越性. 相似文献
102.
A. Kaveh H. A. Rahimi Bondarabady 《International journal for numerical methods in engineering》2004,60(11):1803-1815
This paper presents an algorithm for nodal numbering in order to obtain a small wavefront. Element clique graphs are employed as the mathematical models of finite element meshes. A priority function containing five vectors is used, which can be viewed as a generalization of Sloan's function. These vectors represent different connectivity properties of the graph models. Unlike Sloan's algorithm, which uses two fixed coefficients, here, five coefficients are employed, based on an evaluation by artificial neural networks. The networks weights are obtained using a simple genetic algorithm. Examples are included to illustrate the performance of the present hybrid method. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
103.
In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
104.
In this paper, we present a control methodology for a class of discrete time nonlinear systems that depend on a possibly exogenous scheduling variable. This class of systems consists of an interpolation of nonlinear dynamic equations in strict feedback form, and it may represent systems with a time-varying nonlinear structure. Moreover, this class of systems is able to represent some cases of gain scheduling control, Takagi-Sugeno fuzzy systems, as well as input-output realizations of nonlinear systems which are approximated via localized linearizations. We present two control theorems, one using what we call a “global” approach (akin to traditional backstepping), and a “local” approach, our main result, where backstepping is again used but the control law is an interpolation of local control terms. An aircraft wing rock regulation problem with varying angle of attack is used to illustrate and compare the two approaches. 相似文献
105.
变频器在暖通空调行业中的应用 总被引:1,自引:0,他引:1
本文提出中央空调系统的一种变频调速改造方案,介绍了该系统的结构组成及运行原理,对系统各部分的作用进行了讨论。 相似文献
106.
从应用的角度出发,介绍合理设计应用电路和合理选择数字电位器的种类与型号,来克服数字电位器普遍存在的主要缺点的方法。文章具有较强的针对性和可操作性,对数字电位器的应用实践具有指导作用。 相似文献
107.
介绍了一个计算机远程控制系统的设计与实现,该系统采用客户机/服务器模式,实现远程屏幕的实时传输,采用LZW压缩算法对图像进行压缩传输,在接受方进行解码并且实现了远程文件创建和删除、显示被控制端的主机信息、发送实时消息等功能。采用鼠标,键盘的模拟方式对计算机进行实时控制。 相似文献
108.
天然气管网输配气量优化研究 总被引:2,自引:0,他引:2
天然气管网系统管理部门为了明确天然气管网的输气能力和提高天然气管网的利用率,需要对天然气管网系统的输配气量进行优化。为此,以天然气管网系统的最大流量为目标函数,同时考虑了管道强度、节点压力和流量限制等约束条件,建立了天然气管网输配气量优化的数学模型。在研究遗传算法和模拟退火算法的基础上,提出了一种由二者结合构成的具有全域搜索、快速收敛和鲁棒性强等特点的混合遗传算法。结合实例,采用这一新算法求解了天然气管网输配气量优化的数学模型。实例优化结果表明,所建立的数学模型和采用的混合遗传算法是可行和有效的,能够对天然气管网系统输配气量的调度运行起到指导作用。 相似文献
109.
Lie‐Fern Hsu 《Quality and Reliability Engineering International》2007,23(2):269-272
He and Grigoryan (Quality and Reliability Engineering International 2002; 18 :343–355) formulated the design of a double‐sampling (DS) s control chart as an optimization problem and solved it with a genetic algorithm. They concluded that the DS s control charts can be a more economically preferable alternative in detecting small shifts than traditional s control charts. We explain that, since they only considered the average sample size when the process is in control, their conclusion is questionable. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
110.
Akiyoshi Wakatani 《Parallel Computing》2004,30(12):1345-1359
It is hard to implement the ADI method in an efficient way on distributed-memory parallel computers. We propose “P-scheme” which parallelizes a tridiagonal linear system of equations for the ADI method, but its effectiveness is limited to the cases where the problem size is large enough mainly because of the communication cost of the propagation phase of the scheme.
In order to overcome this difficulty, we propose an improved version of the P-scheme with “message vectorization” which aggregates several communication messages into one and alleviates the communication cost. Also we evaluate the effectiveness of message vectorization for the ADI method and show that the improved version of the P-scheme works well even for smaller problems and linear and super-linear speedups can be achieved for 8194 × 8194 and 16,386 × 16,386 problems, respectively. 相似文献