首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   29980篇
  免费   3591篇
  国内免费   2960篇
电工技术   2002篇
技术理论   1篇
综合类   3815篇
化学工业   3237篇
金属工艺   3261篇
机械仪表   1888篇
建筑科学   724篇
矿业工程   499篇
能源动力   573篇
轻工业   849篇
水利工程   206篇
石油天然气   442篇
武器工业   355篇
无线电   3684篇
一般工业技术   5437篇
冶金工业   950篇
原子能技术   237篇
自动化技术   8371篇
  2024年   107篇
  2023年   484篇
  2022年   781篇
  2021年   958篇
  2020年   968篇
  2019年   992篇
  2018年   902篇
  2017年   1171篇
  2016年   1208篇
  2015年   1381篇
  2014年   1817篇
  2013年   2134篇
  2012年   2117篇
  2011年   2203篇
  2010年   1754篇
  2009年   2002篇
  2008年   1766篇
  2007年   2064篇
  2006年   1738篇
  2005年   1511篇
  2004年   1271篇
  2003年   1077篇
  2002年   906篇
  2001年   851篇
  2000年   726篇
  1999年   588篇
  1998年   480篇
  1997年   447篇
  1996年   369篇
  1995年   355篇
  1994年   305篇
  1993年   236篇
  1992年   195篇
  1991年   149篇
  1990年   131篇
  1989年   94篇
  1988年   73篇
  1987年   45篇
  1986年   26篇
  1985年   24篇
  1984年   22篇
  1983年   24篇
  1982年   14篇
  1981年   12篇
  1980年   7篇
  1979年   6篇
  1978年   6篇
  1977年   7篇
  1976年   6篇
  1951年   6篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
101.
传统基于干扰噪声协方差矩阵(interference-plus-noise covariance matrix,INCM)重构的鲁棒自适应波束形成(robust adaptive beamformer,RAB)算法在多种样本数据协方差矩阵误差和信号导向向量误差的失配环境中具有较强的鲁棒性,但目前主流的INCM重构法都是对信号和干扰的导向向量通过建立凸优化模型来估计,这带来了很高的计算复杂度。为了解决这个问题,提出了一种低复杂度的基于INCM重构的RAB算法。该算法首先将干扰信号的导向向量分解为对应标称项和误差项的和,然后通过一种子空间方法估计得到误差项的单位向量。接下来对一个Capon空间谱功率最大问题进行求解,得到误差项的模值,以此得到重构的INCM。同时利用Capon空间谱中残差噪声的存在,使用交替投影法估计得到期望信号的导向向量,最后得到所提算法的权重向量。仿真实验表明所提算法在多种误差环境下具有较强鲁棒性的同时,还具有较低的计算复杂度。  相似文献   
102.
彭丹 《控制工程》2012,19(3):438-442
针对一类由局部状态空间(LSS)Fornasini-Marchesini(FM)第二模型描述的,具有时变状态滞后的2-D离散系统,其中时变滞后项的上、下界均为正实数,研究了其稳定性和控制综合问题。首先,利用Lyapunov-Krasovski泛函方法,提出了系统的稳定性准则。再根据这一准则,分别设计状态反馈和动态输出反馈控制器保证系统的稳定性。状态反馈控制律和输出反馈矩阵可由线性矩阵不等式(LMI)求得。最后,通过数值算例说明所得结果的有效性。  相似文献   
103.
In this paper, we propose and investigate a new general model of fuzzy genetic regulatory networks described by the Takagi–Sugeno (T‐S) fuzzy model with time‐varying delays. By using a Lyapunov functional approach and linear matrix inequality (LMI) techniques, the stability criteria for the delayed fuzzy genetic regulatory networks are expressed as a set of LMIs, which can be solved numerically by LMI toolbox in Matlab. Two fuzzy genetic network example are given to verify the effectiveness and applicability of the proposed approach. Copyright © 2011 John Wiley & Sons, Ltd.  相似文献   
104.
This paper is concerned with the problem of positive observer synthesis for positive systems with both interval parameter uncertainties and time delay. Conventional observers may no longer be applicable for such kind of systems due to the positivity constraint on the observers, and they only provide an estimate of the system state in an asymptotic way. A pair of positive observers with state‐bounding feature is proposed to estimate the state of positive systems at all times in this paper. A necessary and sufficient condition for the existence of desired observers is first established, and the observer matrices can be obtained easily through the solutions of a set of linear matrix inequalities (LMIs). Then, to reduce the error signal between the system state and its estimates, an iterative LMI algorithm is developed to compute the optimized state‐bounding observer matrices. Finally, a numerical example is presented to show the effectiveness and applicability of the theoretical results. Copyright © 2011 John Wiley & Sons, Ltd.  相似文献   
105.
This paper deals with the problem of reliable control for discrete time systems with actuator failures. The actuator is assumed to fail occasionally and can recover over a time interval. During the time of suffering failures, the considered closed‐loop system is assumed unstable. Using an average dwell time method and under the condition that the activation time ratio between the system without actuator failures and the system with actuator failures is not less than a specified constant, an observer‐based feedback controller is developed in terms of linear matrix inequalities such that the resulting closed‐loop system is exponentially stable. An example is included to demonstrate the effectiveness of the proposed approach.  相似文献   
106.
This paper studies the robustness problem of the min–max model predictive control (MPC) scheme for constrained nonlinear time‐varying delay systems subject to bounded disturbances. The notion of the input‐to‐state stability (ISS) of nonlinear time‐delay systems is introduced. Then by using the Lyapunov–Krasovskii method, a delay‐dependent sufficient condition is derived to guarantee input‐to‐state practical stability (ISpS) of the closed‐loop system by way of nonlinear matrix inequalities (NLMI). In order to lessen the online computational demand, the non‐convex min‐max optimization problem is then converted to a minimization problem with linear matrix inequality (LMI) constraints and a suboptimal MPC algorithm is provided. Finally, an example of a truck‐trailer is used to illustrate the effectiveness of the proposed results. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society  相似文献   
107.
This paper is concerned with the neutral‐delay‐dependent and discrete‐delay‐dependent stability for uncertain neutral systems with mixed delays and norm‐bounded uncertainties. Through constructing a new augmented Lyapunov‐Krasovskii functional and proving its positive definiteness, introducing some slack matrices and using integral inequality, the improved delay‐dependent stability criteria are derived in terms of linear matrix inequalities. Numerical examples are given to illustrate the significant improvement on the conservatism of the delay bound over some existing results. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society  相似文献   
108.
A unique substrate MCPM (Mitsubishi Copper Polyimide Metal-base) technology has been developed by applying our basic copper/polyimide technology.1 This new substrate technology MCPM is suited for a high-density, multi-layer, multi-chip, high-power module/package, such as used for a computer. The new MCPM was processed using a copper metal base (110 × 110 mm), full copper system (all layers) with 50-μm fine lines. As for pad metallizations for the IC assembly, we evaluated both Ni/Au for chip and wire ICs and solder for TAB ICs. The total number of assembled ICs is 25. To improve the thermal dispersion, copper thermal vias are simultaneously formed by electro-plating. This thermal via is located between the IC chip and copper metal base, and promotes heat dispersion. We employed one large thermal via (4.5 mm?) and four small vias (1.0 mm?) for each IC pad. The effect of thermal vias and/or base metal is simulated by a computer analysis and compared with an alumina base substrate. The results show that the thermal vias are effective at lowering the temperature difference between the IC and base substrate, and also lowering the temperature rise of the IC chip. We also evaluated the substrate’s reliability by adhesion test, pressure cooker test, etc.  相似文献   
109.
In solving a mathematical problem numerically, we frequently need to operate on a vector by an operator that can be expressed asf(A), whereA is anN ×N matrix [e.g., exp(A), sin(A), A–-]. Except for very simple matrices, it is impractical to construct the matrixf (A) explicitly. Usually an approximation to it is used. This paper develops an algorithm based upon a polynomial approximation tof (A). First the problem is reduced to a problem of approximatingf (z) by a polynomial in z, where z belongs to a domainD in the complex plane that includes all the eigenvalues ofA. This approximation problem is treated by interpolatingf (z) in a certain set of points that is known to have some maximal properties. The approximation thus achieved is almost best. Implementing the algorithm to some practical problems is described. Since a solution to a linear systemAx=b isx=A –1 b, an iterative solution algorithm can be based upon a polynomial approximation tof (A)=A –1. We give special attention to this important problem.  相似文献   
110.
本文依据破圈法的原理提出了求图的最优树的一种新算法,并给出了具体的实现步骤。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号