首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   9908篇
  免费   81篇
  国内免费   5篇
电工技术   128篇
综合类   4篇
化学工业   420篇
金属工艺   296篇
机械仪表   69篇
建筑科学   58篇
矿业工程   1篇
能源动力   48篇
轻工业   117篇
水利工程   7篇
石油天然气   5篇
无线电   434篇
一般工业技术   252篇
冶金工业   61篇
原子能技术   93篇
自动化技术   8001篇
  2024年   1篇
  2023年   33篇
  2022年   36篇
  2021年   88篇
  2020年   57篇
  2019年   57篇
  2018年   59篇
  2017年   44篇
  2016年   86篇
  2015年   38篇
  2014年   239篇
  2013年   231篇
  2012年   828篇
  2011年   2321篇
  2010年   1143篇
  2009年   974篇
  2008年   693篇
  2007年   599篇
  2006年   454篇
  2005年   587篇
  2004年   519篇
  2003年   580篇
  2002年   276篇
  2001年   4篇
  2000年   2篇
  1999年   1篇
  1998年   3篇
  1997年   5篇
  1996年   5篇
  1995年   2篇
  1993年   4篇
  1992年   1篇
  1991年   2篇
  1990年   2篇
  1989年   1篇
  1988年   1篇
  1987年   1篇
  1986年   1篇
  1985年   3篇
  1984年   1篇
  1983年   3篇
  1982年   1篇
  1981年   1篇
  1980年   1篇
  1979年   2篇
  1978年   2篇
  1977年   2篇
排序方式: 共有9994条查询结果,搜索用时 15 毫秒
101.
In this paper we present an efficient technique for piecewise cubic Bézier approximation of digitized curve. An adaptive breakpoint detection method divides a digital curve into a number of segments and each segment is approximated by a cubic Bézier curve so that the approximation error is minimized. Initial approximated Bézier control points for each of the segments are obtained by interpolation technique i.e. by the reverse recursion of De Castaljau's algorithm. Two methods, two-dimensional logarithmic search algorithm (TDLSA) and an evolutionary search algorithm (ESA), are introduced to find the best-fit Bézier control points from the approximate interpolated control points. ESA based refinement is proved to be better experimentally. Experimental results show that Bézier approximation of a digitized curve is much more accurate and uses less number of points compared to other approximation techniques.  相似文献   
102.
This study compares the performances of various statistical pattern recognition techniques for the differentiation of commonly encountered features in indoor environments, possibly with different surface properties, using simple infrared (IR) sensors. The intensity measurements obtained from such sensors are highly dependent on the location, geometry, and surface properties of the reflecting feature in a way that cannot be represented by a simple analytical relationship, therefore complicating the differentiation process. We construct feature vectors based on the parameters of angular IR intensity scans from different targets to determine their geometry and/or surface type. Mixture of normals classifier with three components correctly differentiates three types of geometries with different surface properties, resulting in the best performance (100%) in geometry differentiation. Parametric differentiation correctly identifies six different surface types of the same planar geometry, resulting in the best surface differentiation rate (100%). However, this rate is not maintained with the inclusion of more surfaces. The results indicate that the geometrical properties of the targets are more distinctive than their surface properties, and surface recognition is the limiting factor in differentiation. The results demonstrate that simple IR sensors, when coupled with appropriate processing and recognition techniques, can be used to extract substantially more information than such devices are commonly employed for.  相似文献   
103.
A novel subspace identification method is presented which is able to reconstruct the deterministic part of a multivariable state-space LPV system with affine parameter dependence, in the presence of process and output noise. It is assumed that the identification data is generated with the scheduling variable varying periodically during the course of the identification experiment. This allows to use methods from LTI subspace identification to determine the column space of the time-varying observability matrices. It is shown that the crucial step in determining the original LPV system is to ensure the obtained observability matrices are defined with respect to the same state basis. Once the LPV model has been identified, it is valid for other nonperiodic scheduling sequences as well.  相似文献   
104.
Generalized adaptive notch filters are used for identification/tracking of quasi-periodically varying dynamic systems and can be considered an extension, to the system case, of classical adaptive notch filters. For general patterns of frequency variation the generalized adaptive notch filtering algorithms yield biased frequency estimates. We show that when system frequencies change slowly in a smooth way, the estimation bias can be substantially reduced by means of post-filtering of the frequency estimates. The modified (debiased) algorithm has better tracking capabilities than the original algorithm.  相似文献   
105.
In this paper we introduce a new symmetry feature named “symmetry kernel” (SK) to support a measure of symmetry. Given any symmetry transform S, SK of a pattern P is the maximal included symmetric sub-set of P for all directions and shifts. We provide a first algorithm to exhibit this kernel where the centre of symmetry is assumed to be the centre of mass. Then we prove that, in any direction, the optimal axis corresponds to the maximal correlation of a pattern with its symmetric version. That leads to a second algorithm. The associated symmetry measure is a modified difference between the respective surfaces of a pattern and its kernel. A series of experiments supports the actual algorithm validation.  相似文献   
106.
Robust control synthesis of linear time-invariant SISO polytopic systems is investigated using the polynomial approach. A convex set of all stabilizing controllers for a polytopic system is given over an infinite-dimensional space. A finite-dimensional approximation of this set is obtained using the orthonormal basis functions and represented by a set of LMIs thanks to the KYP lemma. Then, an LMI based convex optimization problem for robust pole placement with sensitivity function shaping in two- and infinity-norm is proposed. The simulation results show the effectiveness of the proposed method.  相似文献   
107.
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between probability density functions. We propose to optimize the Information Cut using a gradient descent-based approach. Our algorithm has several advantages compared to many other graph-based methods in terms of determining an appropriate affinity measure, computational complexity, memory requirements and coping with different data scales. We show that our method may produce clustering and image segmentation results comparable or better than the state-of-the art graph-based methods.  相似文献   
108.
109.
110.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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