首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   41170篇
  免费   3409篇
  国内免费   2110篇
电工技术   2557篇
技术理论   2篇
综合类   2476篇
化学工业   4770篇
金属工艺   2181篇
机械仪表   2061篇
建筑科学   2809篇
矿业工程   887篇
能源动力   937篇
轻工业   2232篇
水利工程   756篇
石油天然气   1598篇
武器工业   345篇
无线电   4217篇
一般工业技术   3645篇
冶金工业   1380篇
原子能技术   517篇
自动化技术   13319篇
  2024年   189篇
  2023年   597篇
  2022年   1138篇
  2021年   1599篇
  2020年   1173篇
  2019年   969篇
  2018年   1095篇
  2017年   1092篇
  2016年   929篇
  2015年   1397篇
  2014年   1903篇
  2013年   2054篇
  2012年   2934篇
  2011年   5390篇
  2010年   3305篇
  2009年   2957篇
  2008年   2565篇
  2007年   2377篇
  2006年   2092篇
  2005年   1935篇
  2004年   1522篇
  2003年   1618篇
  2002年   1429篇
  2001年   1025篇
  2000年   733篇
  1999年   595篇
  1998年   476篇
  1997年   322篇
  1996年   260篇
  1995年   222篇
  1994年   156篇
  1993年   145篇
  1992年   108篇
  1991年   50篇
  1990年   62篇
  1989年   60篇
  1988年   52篇
  1987年   31篇
  1986年   22篇
  1985年   17篇
  1984年   31篇
  1983年   20篇
  1982年   10篇
  1981年   13篇
  1980年   7篇
  1979年   4篇
  1959年   6篇
  1951年   3篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
101.
Fast, large-scale model predictive control by partial enumeration   总被引:1,自引:0,他引:1  
Partial enumeration (PE) is presented as a method for treating large, linear model predictive control applications that are out of reach with available MPC methods. PE uses both a table storage method and online optimization to achieve this goal. Versions of PE are shown to be closed-loop stable. PE is applied to an industrial example with more than 250 states, 32 inputs, and a 25-sample control horizon. The performance is less than 0.01% suboptimal, with average speedup factors in the range of 80-220, and worst-case speedups in the range of 4.9-39.2, compared to an existing MPC method. Small tables with only 25-200 entries were used to obtain this performance, while full enumeration is intractable for this example.  相似文献   
102.
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.  相似文献   
103.
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.  相似文献   
104.
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.  相似文献   
105.
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.  相似文献   
106.
107.
Three dimensional models play an important role in many applications; the problem is how to select the appropriate models from a 3D database rapidly and accurately. In recent years, a variety of shape representations, statistical methods, and geometric algorithms have been proposed for matching 3D shapes or models. In this paper, we propose a 3D shape representation scheme based on a combination of principal plane analysis and dynamic programming. The proposed 3D shape representation scheme consists of three steps. First, a 3D model is transformed into a 2D image by projecting the vertices of the model onto its principal plane. Second, the convex hall of the 2D shape of the model is further segmented into multiple disjoint triangles using dynamic programming. Finally, for each triangle, a projection score histogram and moments are extracted as the feature vectors for similarity searching. Experimental results showed the robustness of the proposed scheme, which resists translation, rotation, scaling, noise, and destructive attacks. The proposed 3D model retrieval method performs fairly well in retrieving models having similar characteristics from a database of 3D models.  相似文献   
108.
厂商动态     
厂商动态3Com公司与Siemens公司携手合作3Com公司和Siemens公司于近日宣布,两家公司已结成战略联盟,以适应集成电话数据网络市场日新月异的发展.两家公司将首先保证Siemens公司的Hicom电信系统与3Com公司的企业数据网络系统可以...  相似文献   
109.
气凝胶──一种结构可控的新型功能材料   总被引:2,自引:0,他引:2  
气凝胶是一种结构可控的新型轻质纳米多孔性非晶固态材料,具有许多特殊性质,因而蕴藏着广阔的应用前景。本文综述了气凝胶材料的制备方法、结构控制原理、性质和各种可能的应用。  相似文献   
110.
从供应商受益角度研究国际供应链合作关系   总被引:11,自引:1,他引:10  
首先指出从供应商受益角度对国际供应链合作关系进行研究的重要意义,接着对国际供应链合作关系的起源及其概念界定进行了综合分析;其次对国际供应链战略伙伴关系下的供应商受益进行了相关研究结论的综合,并对我国供应商参与国际供应链合作的实际受益进行分析,然后将两者进行了比较,最后综合全文探讨得出本文研究的结论。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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