全文获取类型
收费全文 | 67929篇 |
免费 | 12841篇 |
国内免费 | 9148篇 |
专业分类
电工技术 | 8392篇 |
技术理论 | 1篇 |
综合类 | 8883篇 |
化学工业 | 1422篇 |
金属工艺 | 1318篇 |
机械仪表 | 5336篇 |
建筑科学 | 1442篇 |
矿业工程 | 984篇 |
能源动力 | 1418篇 |
轻工业 | 691篇 |
水利工程 | 1200篇 |
石油天然气 | 832篇 |
武器工业 | 1219篇 |
无线电 | 12419篇 |
一般工业技术 | 4417篇 |
冶金工业 | 502篇 |
原子能技术 | 276篇 |
自动化技术 | 39166篇 |
出版年
2024年 | 540篇 |
2023年 | 1265篇 |
2022年 | 2369篇 |
2021年 | 2535篇 |
2020年 | 2842篇 |
2019年 | 2359篇 |
2018年 | 2368篇 |
2017年 | 2744篇 |
2016年 | 3181篇 |
2015年 | 3764篇 |
2014年 | 4892篇 |
2013年 | 4747篇 |
2012年 | 5872篇 |
2011年 | 6126篇 |
2010年 | 5026篇 |
2009年 | 5155篇 |
2008年 | 5407篇 |
2007年 | 5864篇 |
2006年 | 4638篇 |
2005年 | 3808篇 |
2004年 | 3068篇 |
2003年 | 2401篇 |
2002年 | 1781篇 |
2001年 | 1380篇 |
2000年 | 1184篇 |
1999年 | 926篇 |
1998年 | 764篇 |
1997年 | 618篇 |
1996年 | 495篇 |
1995年 | 348篇 |
1994年 | 302篇 |
1993年 | 210篇 |
1992年 | 218篇 |
1991年 | 113篇 |
1990年 | 150篇 |
1989年 | 100篇 |
1988年 | 75篇 |
1987年 | 25篇 |
1986年 | 41篇 |
1985年 | 34篇 |
1984年 | 27篇 |
1983年 | 22篇 |
1982年 | 25篇 |
1981年 | 17篇 |
1980年 | 22篇 |
1979年 | 9篇 |
1978年 | 13篇 |
1977年 | 12篇 |
1975年 | 9篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
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. 相似文献
92.
介绍了一个计算机远程控制系统的设计与实现,该系统采用客户机/服务器模式,实现远程屏幕的实时传输,采用LZW压缩算法对图像进行压缩传输,在接受方进行解码并且实现了远程文件创建和删除、显示被控制端的主机信息、发送实时消息等功能。采用鼠标,键盘的模拟方式对计算机进行实时控制。 相似文献
93.
天然气管网输配气量优化研究 总被引:2,自引:0,他引:2
天然气管网系统管理部门为了明确天然气管网的输气能力和提高天然气管网的利用率,需要对天然气管网系统的输配气量进行优化。为此,以天然气管网系统的最大流量为目标函数,同时考虑了管道强度、节点压力和流量限制等约束条件,建立了天然气管网输配气量优化的数学模型。在研究遗传算法和模拟退火算法的基础上,提出了一种由二者结合构成的具有全域搜索、快速收敛和鲁棒性强等特点的混合遗传算法。结合实例,采用这一新算法求解了天然气管网输配气量优化的数学模型。实例优化结果表明,所建立的数学模型和采用的混合遗传算法是可行和有效的,能够对天然气管网系统输配气量的调度运行起到指导作用。 相似文献
94.
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. 相似文献
95.
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. 相似文献
96.
The main difficulty with EM algorithm for mixture model concerns the number of components, say g. This is the question of model selection, and the EM algorithm itself could not estimate g. On the contrary, the algorithm requires g to be specified before the remaining parameters can be estimated. To solve this problem, a new algorithm, which is called stepwise split-and-merge EM (SSMEM) algorithm, is proposed. The SSMEM algorithm alternately splits and merges components, estimating g and other parameters of components simultaneously. Also, two novel criteria are introduced to efficiently select the components for split or merge. Experimental results on simulated and real data demonstrate the effectivity of the proposed algorithm. 相似文献
97.
Automated currency validation requires a decision to be made regarding the authenticity of a banknote presented to the validation system. This decision often has to be made with little or no information regarding the characteristics of possible counterfeits as is the case for issues of new currency. A method for automated currency validation is presented which segments the whole banknote into different regions, builds individual classifiers on each region and then combines a small subset of the region specific classifiers to provide an overall decision. The segmentation and combination of region specific classifiers to provide optimized false positive and false negative rates is achieved by employing a genetic algorithm. Experiments based on high value notes of Sterling currency were carried out to assess the effectiveness of the proposed solution. 相似文献
98.
Minglun Gong Author Vitae Author Vitae 《Pattern recognition》2004,37(8):1723-1733
Many computer vision problems can be formulated as optimization problems. Presented in this paper is a new framework based on the quadtree-based genetic algorithm that can be applied to solve many of these problems. The proposed algorithm incorporates the quadtree structure into the conventional genetic algorithm. The solutions of image-related problems are encoded through encoding the corresponding quadtrees, and therefore, the 2D locality within a solution can be preserved. Examples addressed using the proposed framework include image segmentation, stereo vision, and motion estimation. In all cases, encouraging results are obtained. 相似文献
99.
100.