全文获取类型
收费全文 | 30176篇 |
免费 | 4232篇 |
国内免费 | 2408篇 |
专业分类
电工技术 | 4466篇 |
技术理论 | 1篇 |
综合类 | 2679篇 |
化学工业 | 473篇 |
金属工艺 | 195篇 |
机械仪表 | 1078篇 |
建筑科学 | 8203篇 |
矿业工程 | 277篇 |
能源动力 | 606篇 |
轻工业 | 152篇 |
水利工程 | 378篇 |
石油天然气 | 307篇 |
武器工业 | 260篇 |
无线电 | 4222篇 |
一般工业技术 | 872篇 |
冶金工业 | 212篇 |
原子能技术 | 80篇 |
自动化技术 | 12355篇 |
出版年
2024年 | 294篇 |
2023年 | 690篇 |
2022年 | 1038篇 |
2021年 | 1179篇 |
2020年 | 1336篇 |
2019年 | 1047篇 |
2018年 | 779篇 |
2017年 | 913篇 |
2016年 | 917篇 |
2015年 | 1161篇 |
2014年 | 2079篇 |
2013年 | 1714篇 |
2012年 | 2179篇 |
2011年 | 2212篇 |
2010年 | 1807篇 |
2009年 | 1982篇 |
2008年 | 2131篇 |
2007年 | 2298篇 |
2006年 | 1856篇 |
2005年 | 1765篇 |
2004年 | 1518篇 |
2003年 | 1254篇 |
2002年 | 953篇 |
2001年 | 776篇 |
2000年 | 644篇 |
1999年 | 515篇 |
1998年 | 347篇 |
1997年 | 244篇 |
1996年 | 205篇 |
1995年 | 212篇 |
1994年 | 155篇 |
1993年 | 106篇 |
1992年 | 102篇 |
1991年 | 79篇 |
1990年 | 48篇 |
1989年 | 44篇 |
1988年 | 55篇 |
1987年 | 27篇 |
1986年 | 25篇 |
1985年 | 38篇 |
1984年 | 32篇 |
1983年 | 14篇 |
1982年 | 10篇 |
1981年 | 5篇 |
1980年 | 9篇 |
1979年 | 10篇 |
1978年 | 6篇 |
1977年 | 2篇 |
1959年 | 1篇 |
1955年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 19 毫秒
11.
This paper presents a control design for the one‐phase Stefan problem under actuator delay via a backstepping method. The Stefan problem represents a liquid‐solid phase change phenomenon which describes the time evolution of a material's temperature profile and the interface position. The actuator delay is modeled by a first‐order hyperbolic partial differential equation (PDE), resulting in a cascaded transport‐diffusion PDE system defined on a time‐varying spatial domain described by an ordinary differential equation (ODE). Two nonlinear backstepping transformations are utilized for the control design. The setpoint restriction is given to guarantee a physical constraint on the proposed controller for the melting process. This constraint ensures the exponential convergence of the moving interface to a setpoint and the exponential stability of the temperature equilibrium profile and the delayed controller in the norm. Furthermore, robustness analysis with respect to the delay mismatch between the plant and the controller is studied, which provides analogous results to the exact compensation by restricting the control gain. 相似文献
12.
13.
This paper considers a novel distributed iterative learning consensus control algorithm based on neural networks for the control of heterogeneous nonlinear multiagent systems. The system's unknown nonlinear function is approximated by suitable neural networks; the approximation error is countered by a robust term in the control. Two types of control algorithms, both of which utilize distributed learning laws, are provided to achieve consensus. In the provided control algorithms, the desired reference is considered to be an unknown factor and then estimated using the associated learning laws. The consensus convergence is proven by the composite energy function method. A numerical simulation is ultimately presented to demonstrate the efficacy of the proposed control schemes. 相似文献
14.
由于AD HOC网络自身的特点,其网络管理很多方面与固定网络不同,如移动性管理和体系结构管理等。讨论了AD HOC网络管理的各个方面,并列举了各个方面的设计思路和已有的相关算法的简介。 相似文献
15.
范文跃 《信息安全与通信保密》2006,(8):66-68
在分析移动智能平台安全需求基础上,从逻辑原理、硬件组成、软件系统三个层面提出了移动智能平台的可信计算体系结构,之后提出了包含十种可信计算应用功能的全景图。 相似文献
16.
基于mobile agent的分布式网络自管理模型 总被引:2,自引:1,他引:1
为了解决大规模、异构网络环境下基于“管理员密集”的传统网络管理模式带来的低效率和高出错率问题,提出了一种网络自管理模型,从网络管理的自动初始化和动态自管理两个方面实现对网络自动、自主、自适应的管理;提出了管理定位服务这一关键技术,在多个管理站协同工作的分布式网络环境中为设备自动定位出合适的管理站及初始的管理任务;采用可伸缩的分布式体系结构,适应了大规模网络的规模可变性等特点;基于mobile agent的管理框架进一步提高了管理的自适应性和灵活性。 相似文献
17.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
18.
简要论述了集散控制系统的发展 ,根据火力发电厂的现场环境及实际情况 ,提出了火力发电厂集散控制系统的设计原则 ,并展望了集散控制系统的发展 相似文献
19.
20.