全文获取类型
收费全文 | 3619篇 |
免费 | 478篇 |
国内免费 | 138篇 |
专业分类
电工技术 | 1411篇 |
综合类 | 238篇 |
化学工业 | 211篇 |
金属工艺 | 105篇 |
机械仪表 | 393篇 |
建筑科学 | 23篇 |
矿业工程 | 7篇 |
能源动力 | 343篇 |
轻工业 | 86篇 |
水利工程 | 3篇 |
石油天然气 | 5篇 |
武器工业 | 7篇 |
无线电 | 377篇 |
一般工业技术 | 273篇 |
冶金工业 | 18篇 |
原子能技术 | 3篇 |
自动化技术 | 732篇 |
出版年
2024年 | 27篇 |
2023年 | 179篇 |
2022年 | 171篇 |
2021年 | 198篇 |
2020年 | 228篇 |
2019年 | 163篇 |
2018年 | 167篇 |
2017年 | 208篇 |
2016年 | 302篇 |
2015年 | 210篇 |
2014年 | 257篇 |
2013年 | 306篇 |
2012年 | 401篇 |
2011年 | 228篇 |
2010年 | 175篇 |
2009年 | 126篇 |
2008年 | 76篇 |
2007年 | 254篇 |
2006年 | 242篇 |
2005年 | 91篇 |
2004年 | 32篇 |
2003年 | 26篇 |
2002年 | 23篇 |
2001年 | 21篇 |
2000年 | 18篇 |
1999年 | 17篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1996年 | 4篇 |
1995年 | 6篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 6篇 |
1988年 | 12篇 |
1987年 | 19篇 |
1986年 | 9篇 |
1985年 | 5篇 |
1951年 | 1篇 |
排序方式: 共有4235条查询结果,搜索用时 15 毫秒
71.
72.
Recently, there have been a lot of research efforts on peer-to-peer (P2P) live streaming services. P2P systems can be easily deployed since a participating peer’s resources (i.e., upload link bandwidth) can be exploited to distribute contents. However, how to adapt to leaving peers and how to encourage peers to contribute resources voluntarily are still challenging issues. In this paper, we propose Climber, an adaptive P2P live streaming system with incentives for resilience. Climber is based on the hybrid structure of a tree and a mesh, so as to achieve self-improvement and adaptation to users’ dynamic joining and leaving. Moreover, Climber substantiates an incentive mechanism that provides better resilience for peers with more upload bandwidth allocated. Simulation results reveal that Climber significantly reduces the topology maintenance cost compared to SplitStream and NICE-PRM. Also, simulation and analytical results verify that Climber can bound the level of disruption by dynamically adapting to the user churning rate. 相似文献
73.
This paper studies a multi-goal Q-learning algorithm of cooperative teams. Member of the cooperative teams is simulated by an agent. In the virtual cooperative team, agents adapt its knowledge according to cooperative principles. The multi-goal Q-learning algorithm is approached to the multiple learning goals. In the virtual team, agents learn what knowledge to adopt and how much to learn (choosing learning radius). The learning radius is interpreted in Section 3.1. Five basic experiments are manipulated proving the validity of the multi-goal Q-learning algorithm. It is found that the learning algorithm causes agents to converge to optimal actions, based on agents’ continually updated cognitive maps of how actions influence learning goals. It is also proved that the learning algorithm is beneficial to the multiple goals. Furthermore, the paper analyzes how sensitive the learning performance is affected by the parameter values of the learning algorithm. 相似文献
74.
An improved adaptive genetic algorithm (IAGA) for solving the minimum makespan problem of job-shop scheduling problem (JSP) is presented. Though the traditional genetic algorithm (GA) exhibits implicit parallelism and can retain useful redundant information about what is learned from previous searches by its representation in individuals in the population, yet GA may lose solutions and substructures due to the disruptive effects of genetic operators and is not easy to regulate GA’s convergence. The proposed IAGA is inspired from hormone modulation mechanism, and then the adaptive crossover probability and adaptive mutation probability are designed. The proposed IAGA is characterized by simplifying operations, high search precision, overcoming premature phenomenon and slow evolution. The proposed method by employing operation-based encoding is effectively applied to solve a dynamic job-shop scheduling problem (DJSP) and a complicated contrastive experiment of JSP in manufacturing system. Meanwhile, in order to ensure to create a feasible solution, a new method for crossover operation is adopted, named, partheno-genetic operation (PGO). The computational results validate the effectiveness of the proposed IAGA, which can not only find optimal or close-to-optimal solutions but can also obtain both better and more robust results than the existing genetic algorithms reported recently in the literature. By employing IAGA, machines can be used more efficiently, which means that tasks can be allocated appropriately, production efficiency can be improved, and the production cycle can be shortened efficiently. 相似文献
75.
76.
This paper addresses the problem of adaptive neural control for a class of uncertain stochastic nonlinear strict-feedback systems with time-varying delays. A novel adaptive neural control scheme is presented for this class of systems, based on a combination of the Razumikhin functional approach, the backstepping technique and the neural network (NN) parameterization. The proposed adaptive controller guarantee that all the error variables are 4-Moment semi-globally uniformly ultimately bounded in a compact set while the system output converges to a small neighborhood of the reference signal. Two simulation examples are given to demonstrate the effectiveness of the proposed control schemes. 相似文献
77.
Conjugate gradient methods have many advantages in real numerical experiments, such as fast convergence and low memory requirements. This paper considers a class of conjugate gradient learning methods for backpropagation neural networks with three layers. We propose a new learning algorithm for almost cyclic learning of neural networks based on PRP conjugate gradient method. We then establish the deterministic convergence properties for three different learning modes, i.e., batch mode, cyclic and almost cyclic learning. The two deterministic convergence properties are weak and strong convergence that indicate that the gradient of the error function goes to zero and the weight sequence goes to a fixed point, respectively. It is shown that the deterministic convergence results are based on different learning modes and dependent on different selection strategies of learning rate. Illustrative numerical examples are given to support the theoretical analysis. 相似文献
78.
79.
The stabilization problem of polytopic differential inclusion (PDI) systems is investigated by using sliding mode control. Sliding surface is designed and sufficient conditions for asymptotic stability of sliding mode dynamics are derived. A novel feedback law is established to make the state of system reach the sliding surface in a finite time. Finally, an example is given to illustrate the validity of the proposed design. 相似文献
80.
This paper addresses the sampling period scheduling of Networked Control Systems (NCSs) with multiple control loops. The generalized exponential function is employed to describe Integral Absolute Error (IAE) performance versus sampling period by Truetime toolbox under Matlab environment, and the sampling periods are scheduled to obtain the optimal integrated performance based on Kuhn–Tucker Theorem, which are subject to the stability of every control loop and the bandwidth on available network resource. Numerical examples are given to show the effectiveness of our method. 相似文献