全文获取类型
收费全文 | 951篇 |
免费 | 127篇 |
国内免费 | 80篇 |
专业分类
电工技术 | 92篇 |
综合类 | 174篇 |
化学工业 | 46篇 |
金属工艺 | 20篇 |
机械仪表 | 94篇 |
建筑科学 | 37篇 |
矿业工程 | 15篇 |
能源动力 | 28篇 |
轻工业 | 14篇 |
水利工程 | 18篇 |
石油天然气 | 5篇 |
武器工业 | 28篇 |
无线电 | 76篇 |
一般工业技术 | 162篇 |
冶金工业 | 6篇 |
自动化技术 | 343篇 |
出版年
2024年 | 2篇 |
2023年 | 14篇 |
2022年 | 19篇 |
2021年 | 13篇 |
2020年 | 23篇 |
2019年 | 41篇 |
2018年 | 40篇 |
2017年 | 43篇 |
2016年 | 57篇 |
2015年 | 49篇 |
2014年 | 66篇 |
2013年 | 68篇 |
2012年 | 70篇 |
2011年 | 74篇 |
2010年 | 57篇 |
2009年 | 65篇 |
2008年 | 65篇 |
2007年 | 84篇 |
2006年 | 53篇 |
2005年 | 49篇 |
2004年 | 31篇 |
2003年 | 29篇 |
2002年 | 25篇 |
2001年 | 15篇 |
2000年 | 15篇 |
1999年 | 12篇 |
1998年 | 10篇 |
1997年 | 13篇 |
1996年 | 11篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 6篇 |
1991年 | 8篇 |
1990年 | 6篇 |
1989年 | 6篇 |
1988年 | 6篇 |
1987年 | 2篇 |
1986年 | 2篇 |
排序方式: 共有1158条查询结果,搜索用时 15 毫秒
1.
随着VLSI工艺技术的发展和芯片规模的不断增加,尤其是在SOC设计中,原有的那种供电压焊块只能位于芯片边缘的确定益的模式已经不能够满足整个电路性能的需要。在很多情况下,依靠在电源线的拓扑结构确定后的线宽优化,还是无法保证在有限的布线资源下为电路提供可靠的高性能的供电需求。由此,出现了在芯片边缘上浮动放置压焊块及在芯片的顶部放置供电压焊块阵列的方法。文中提出了一种用于SOC设计中新的基于树型结构的浮动压焊块的电源/地线网络优化算法,经过MCNC电路实例测试后得到明显的优化结果。 相似文献
2.
梁昔明 《中南工业大学学报(英文版)》2005,12(1):93-96
An active set truncated-Newton algorithm (ASTNA) is proposed to solve the large-scale bound constrained sub-problems. The global convergence of the algorithm is obtained and two groups of numerical experiments are made for the various large-scale problems of varying size. The comparison results between ASTNA and the subspace limited memory quasi-Newton algorithm and between the modified augmented Lagrange multiplier methods combined with ASTNA and the modified barrier function method show the stability and effectiveness of ASTNA for simultaneous optimization of distillation column. 相似文献
3.
In this paper we have studied the control of linear systems with algebraic-equation constraint. A pole-assignment controller with two-layer structure for such constrained systems has been presented. The objective of the controller is to assign the desired poles to constrained system and simultaneously force the corresponding closed-loop system to satisfy the constraint. The conditions for the existence of pole-assignment controller are discussed in different cases. The implementation algorithm of pole-assignment controller is also presented. An example is given to illustrate the validity of the method in this paper. 相似文献
4.
Ariosto B. Jorge Gabriel O. Ribeiro Timothy S. Fisher 《International journal for numerical methods in engineering》2003,56(1):117-144
This work presents two new error estimation approaches for the BEM applied to 2D potential problems. The first approach involves a local error estimator based on a gradient recovery procedure in which the error function is generated from differences between smoothed and non‐smoothed rates of change of boundary variables in the local tangential direction. The second approach involves the external problem formulation and gives both local and global measures of error, depending on a choice of the external evaluation point. These approaches are post‐processing procedures. Both estimators show consistency with mesh refinement and give similar qualitative results. The error estimator using the gradient recovery approach is more general, as this formulation does not rely on an ‘optimal’ choice of an external parameter. This work presents also the use of a local error estimator in an adaptive mesh refinement procedure. This r‐refinement approach is based on the minimization of the standard deviation of the local error estimate. A non‐linear programming procedure using a feasible‐point method is employed using Lagrange multipliers and a set of active constraints. The optimization procedure produces finer meshes close to a singularity and results that are consistent with the problem physics. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
5.
Berlin Wu 《Computational Economics》1994,7(1):37-53
In this paper, the methods of time series for nonlinearity are briefly surveyed, with particular attention paid to a new test design based on a neural network specification. The proposed integrated expert system contains two main components: an identification environment and a robust forecasting design. The identification environment can be viewed as a integrated dynamic design in which cognitive capabilities arise as a direct consequence of their self-organizational properties. The integrated framework used for discussing the similarities and differences in the nonlinear time series behavior is presented. Moreover, its performance in prediction proves to be superior than the former work. For the investigation of robust forecasting, we perform a simulation study to demonstrate the applicability and the forecasting performance. 相似文献
6.
7.
Finite-time stability in dynamical systems theory involves systems whose trajectories converge to an equilibrium state in finite time. In this paper, we use the notion of finite-time stability to apply it to the problem of coordinated motion in multiagent systems. Specifically, we consider a group of agents described by fully actuated Euler–Lagrange dynamics along with a leader agent with an objective to reach and maintain a desired formation characterized by steady-state distances between the neighboring agents in finite time. We use graph theoretic notions to characterize communication topology in the network determined by the information flow directions and captured by the graph Laplacian matrix. Furthermore, using sliding mode control approach, we design decentralized control inputs for individual agents that use only data from the neighboring agents which directly communicate their state information to the current agent in order to drive the current agent to the desired steady state. Sliding mode control is known to drive the system states to the sliding surface in finite time. The key feature of our approach is in the design of non-smooth sliding surfaces such that, while on the sliding surface, the error states converge to the origin in finite time, thus ensuring finite-time coordination among the agents in the network. In addition, we discuss the case of switching communication topologies in multiagent systems. Finally, we show the efficacy of our theoretical results using an example of a multiagent system involving planar double integrator agents. 相似文献
8.
基于RFID的虚拟标签算法研究与改进 总被引:3,自引:2,他引:1
针对室内定位算法VIRE的定位精度,特别是邻近边界目标的定位精度较低的问题,以RFID标签定位为研究基础,从改变VIRE算法中虚拟标签的插值方式和在边界上加入虚拟标签两个方面进行研究和改进。使用拉格朗日插值代替VIRE算法中的线性插值方式,使虚拟标签的数据更加接近实际环境值;在边界上加入虚拟参考标签能增加已知标签数,防止在计算待定位标签坐标时引入误差标签。实验结果表明,标签定位精度有了明显提高,整体能提高了35%,邻近边界标签定位精度提高较大,可达到50%以上。 相似文献
9.
Zhonglong Zheng Mudan Yu Jiong Jia Huawen Liu Daohong Xiang Xiaoqiao Huang Jie Yang 《Pattern recognition》2014
In this paper, we consider the issue of computing low rank (LR) recovery of matrices with sparse errors. Based on the success of low rank matrix recovery in statistical learning, computer vision and signal processing, a novel low rank matrix recovery algorithm with Fisher discrimination regularization (FDLR) is proposed. Standard low rank matrix recovery algorithm decomposes the original matrix into a set of representative basis with a corresponding sparse error for modeling the raw data. Motivated by the Fisher criterion, the proposed FDLR executes low rank matrix recovery in a supervised manner, i.e., taking the with-class scatter and between-class scatter into account when the whole label information are available. The paper shows that the formulated model can be solved by the augmented Lagrange multipliers and provides additional discriminating power over the standard low rank recovery models. The representative bases learned by the proposed method are encouraged to be closer within the same class, and as far as possible between different classes. Meanwhile, the sparse error recovered by FDLR is not discarded as usual, but treated as a feedback in the following classification tasks. Numerical simulations demonstrate that the proposed algorithm achieves the state of the art results. 相似文献
10.