全文获取类型
收费全文 | 68104篇 |
免费 | 12500篇 |
国内免费 | 9073篇 |
专业分类
电工技术 | 8277篇 |
技术理论 | 1篇 |
综合类 | 8573篇 |
化学工业 | 1631篇 |
金属工艺 | 1299篇 |
机械仪表 | 5197篇 |
建筑科学 | 1189篇 |
矿业工程 | 943篇 |
能源动力 | 1501篇 |
轻工业 | 680篇 |
水利工程 | 1088篇 |
石油天然气 | 773篇 |
武器工业 | 1186篇 |
无线电 | 12736篇 |
一般工业技术 | 4611篇 |
冶金工业 | 502篇 |
原子能技术 | 294篇 |
自动化技术 | 39196篇 |
出版年
2024年 | 544篇 |
2023年 | 1276篇 |
2022年 | 2386篇 |
2021年 | 2571篇 |
2020年 | 2843篇 |
2019年 | 2375篇 |
2018年 | 2370篇 |
2017年 | 2762篇 |
2016年 | 3174篇 |
2015年 | 3747篇 |
2014年 | 4912篇 |
2013年 | 4673篇 |
2012年 | 5871篇 |
2011年 | 6172篇 |
2010年 | 5019篇 |
2009年 | 5159篇 |
2008年 | 5473篇 |
2007年 | 5834篇 |
2006年 | 4591篇 |
2005年 | 3738篇 |
2004年 | 3019篇 |
2003年 | 2384篇 |
2002年 | 1778篇 |
2001年 | 1376篇 |
2000年 | 1214篇 |
1999年 | 922篇 |
1998年 | 750篇 |
1997年 | 607篇 |
1996年 | 465篇 |
1995年 | 321篇 |
1994年 | 279篇 |
1993年 | 211篇 |
1992年 | 204篇 |
1991年 | 110篇 |
1990年 | 135篇 |
1989年 | 94篇 |
1988年 | 66篇 |
1987年 | 23篇 |
1986年 | 32篇 |
1985年 | 31篇 |
1984年 | 23篇 |
1983年 | 23篇 |
1982年 | 24篇 |
1981年 | 13篇 |
1980年 | 20篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1977年 | 8篇 |
1975年 | 9篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 10 毫秒
91.
In this paper, a direct self‐structured adaptive fuzzy control is introduced for the class of nonlinear systems with unknown dynamic models. Control is accomplished by an adaptive fuzzy system with a fixed number of rules and adaptive membership functions. The reference signal and state errors are used to tune the membership functions and update them instantaneously. The Lyapunov synthesis method is also used to guarantee the stability of the closed loop system. The proposed control scheme is applied to an inverted pendulum and a magnetic levitation system, and its effectiveness is shown via simulation. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society 相似文献
92.
In recent years, there has been a considerable growth of application of group technology in cellular manufacturing. This has led to investigation of the primary cell formation problem (CFP), both in classical and soft-computing domain. Compared to more well-known and analytical techniques like mathematical programming which have been used rigorously to solve CFPs, heuristic approaches have yet gained the same level of acceptance. In the last decade we have seen some fruitful attempts to use evolutionary techniques like genetic algorithm (GA) and Ant Colony Optimization to find solutions of the CFP. The primary aim of this study is to investigate the applicability of a fine grain variant of the predator-prey GA (PPGA) in CFPs. The algorithm has been adapted to emphasize local selection strategy and to maintain a reasonable balance between prey and predator population, while avoiding premature convergence. The results show that the algorithm is competitive in identifying machine-part clusters from the initial CFP matrix with significantly less number of iterations. The algorithm scaled efficiently for large size problems with competitive performance. Optimal cluster identification is then followed by removal of the bottleneck elements to give a final solution with minimum inter-cluster transition cost. The results give considerable impetus to study similar NP-complete combinatorial problems using fine-grain GAs in future. 相似文献
93.
Simultaneous solving of balancing and sequencing problems with station-dependent assembly times for mixed-model assembly lines 总被引:1,自引:0,他引:1
In spite of many studies, investigating balancing and sequencing problems in Mixed-Model Assembly Line (MMAL) individually, this paper solves them simultaneously aiming to minimize total utility work. A new Mixed-Integer Linear Programming (MILP) model is developed to provide the exact solution of the problem with station-dependent assembly times. Because of NP-hardness, a Simulated Annealing (SA) is applied and compared to the Co-evolutionary Genetic Algorithm (Co-GA) from the literature. To strengthen the search process, two main hypotheses, namely simultaneous search and feasible search, are developed contrasting Co-GA. Various parameters of SA are reviewed to calibrate the algorithm by means of Taguchi design of experiments. Numerical results statistically show the efficiency and effectiveness of the proposed SA in terms of both the quality of solution and the time of achieving the best solution. Finally, the contribution of each hypothesis in this superiority is analyzed. 相似文献
94.
Fault detection and isolation in rotating machinery is very important from an industrial viewpoint as it can help in maintenance activities and significantly reduce the down-time of the machine, resulting in major cost savings. Traditional methods have been found to be not very accurate. Soft computing based methods are now being increasingly employed for the purpose. The proposed method is based on a genetic programming technique which is known as gene expression programming (GEP). GEP is somewhat a new member of the genetic programming family. The main objective of this paper is to compare the classification accuracy of the proposed evolutionary computing based method with other pattern classification approaches such as support vector machine (SVM), Wavelet-GEP, and proximal support vector machine (PSVM). For this purpose, six states viz., normal, bearing fault, impeller fault, seal fault, impeller and bearing fault together, cavitation are simulated on centrifugal pump. Decision tree algorithm is used to select the features. The results obtained using GEP is compared with the performance of Wavelet-GEP, support vector machine (SVM) and proximal support vector machine (PSVM) based classifiers. It is observed that both GEP and SVM equally outperform the other two classifiers (PSVM and Wavelet-GEP) considered in the present study. 相似文献
95.
In this paper we analyze the average-case performance of the Modified Harmonic algorithm for on-line bin packing. We first analyze the average-case performance for arbitrary distribution of item sizes over (0,1]. This analysis is based on the following result. Letf
1 andf
2 be two linear combinations of random variables {N
i
}
i=1
k
where theN
i
's have a joint multinomial distribution for eachn=
i=1
k
,N
i
. LetE(f
1) O andE(f
2) 0. Then limn
E(max(f
1,f
2
))/n = lim
n
max(E(f
1),E(f
2))/n. We then consider the special case when the item sizes are uniformly distributed over (0,1]. For specific values of the parameters, the Modified Harmonic algorithm turns out to be better than the other two linear-time on-line algorithms—Next Fit and Harmonic—in both the worst case as well as the average case. We also obtain optimal values for the parameters of the algorithm from the average-case standpoint. For these values of the parameters, the average-case performance ratio is less than 1.19. This compares well with the performance ratios 1.333. and 1.2865. of the Next Fit algorithm and the Harmonic algorithm, respectively. 相似文献
97.
Summary Byzantine Agreement is important both in the theory and practice of distributed computing. However, protocols to reach Byzantine Agreement are usually expensive both in the time required as well as in the number of messages exchanged. In this paper, we present a self-adjusting approach to the problem. The Mostly Byzantine Agreement is proposed as a more restrictive agreement problem that requires that in the consecutive attempts to reach agreement, the number of disagreements (i.e., failures to reach Byzantine Agreement) is finite. Fort faulty processes, we give an algorithm that has at mostt disagreements for 4t or more processes. Another algorithm is given forn3t+1 processes with the number of disagreements belowt
2/2. Both algorithms useO(n
3) message bits for binary value agreement.
Yi Zhao is currently working on his Ph.D. degree in Computer Science at University of Houston. His research interests include fault tolerance, distributed computing, parallel computation and neural networks. He obtained his M.S. from University of Houston in 1988 and B.S. from Beijing University of Aeronautics and Astronautics in 1984, both in computer science.
Farokh B. Bastani received the B. Tech. degree in electrical engineering from the Indian Institute of Technology, Bombay, India, and the M.S. and Ph.D. degrees in electrical engineering and computer science from the University of California, Berkeley. He joined the University of Houston in 1980, where he is currently an Associate Professor of Computer Science. His research interests include software design and validation techniques, distributed systems, and fault-tolerant systems. He is a member of the ACM and the IEEE and is on the editorial board of theIEEE Transactions on Software Engineering. 相似文献
98.
99.
阐述了恒模算法(CMA)、修正恒模算法(MCMA)和判决引导(DD)算法的基本原理。针对CMA和MCMA收敛速度慢,固定步长条件下收敛速度和剩余误差之间存在矛盾的缺陷,在分析CMA误差特性的基础上,利用DD算法误差函数的模值和判决器输出构造新的误差函数,提出了一种新的变步长MCMA。新算法在加快收敛速度的同时保持小的剩余误差。仿真结果表明,新算法比CMA和MCMA收敛速度快,均衡输出剩余码间干扰(ISI)小而且能克服相位偏移,具有很好的实用性。 相似文献
100.
栅栏覆盖是近年来无线传感器网络的研究热点之一,如何延长生存周期是无线传感器网络研究的一个重要问题。针对无线传感器网络的栅栏覆盖应用,设计了两种最大化网络生存周期的调度算法:集中式的Greedy调度算法和分布式的DBCS调度算法。仿真实验表明:两种算法显著地延长了网络的生存周期;在较稀疏的网络中,DBCS算法与Greedy算法性能接近,分布式的DBCS算法适合应用于大规模传感器网络。 相似文献