全文获取类型
收费全文 | 10349篇 |
免费 | 29篇 |
国内免费 | 138篇 |
专业分类
电工技术 | 131篇 |
综合类 | 1篇 |
化学工业 | 337篇 |
金属工艺 | 434篇 |
机械仪表 | 53篇 |
建筑科学 | 49篇 |
能源动力 | 41篇 |
轻工业 | 15篇 |
水利工程 | 19篇 |
石油天然气 | 14篇 |
无线电 | 326篇 |
一般工业技术 | 154篇 |
冶金工业 | 91篇 |
原子能技术 | 89篇 |
自动化技术 | 8762篇 |
出版年
2023年 | 7篇 |
2022年 | 18篇 |
2021年 | 21篇 |
2020年 | 14篇 |
2019年 | 20篇 |
2018年 | 15篇 |
2017年 | 4篇 |
2016年 | 13篇 |
2015年 | 11篇 |
2014年 | 220篇 |
2013年 | 189篇 |
2012年 | 769篇 |
2011年 | 3080篇 |
2010年 | 1141篇 |
2009年 | 1008篇 |
2008年 | 670篇 |
2007年 | 586篇 |
2006年 | 451篇 |
2005年 | 570篇 |
2004年 | 528篇 |
2003年 | 588篇 |
2002年 | 282篇 |
2001年 | 6篇 |
2000年 | 10篇 |
1999年 | 21篇 |
1998年 | 87篇 |
1997年 | 26篇 |
1996年 | 20篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 6篇 |
1992年 | 9篇 |
1991年 | 5篇 |
1990年 | 10篇 |
1989年 | 6篇 |
1988年 | 10篇 |
1987年 | 8篇 |
1986年 | 12篇 |
1985年 | 6篇 |
1984年 | 24篇 |
1983年 | 12篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1979年 | 2篇 |
1977年 | 3篇 |
1975年 | 2篇 |
1962年 | 1篇 |
1960年 | 1篇 |
1959年 | 1篇 |
1958年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
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. 相似文献
102.
Alireza Karimi Author VitaeAuthor Vitae 《Automatica》2007,43(8):1395-1402
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. 相似文献
103.
Robert Jenssen Author Vitae Deniz Erdogmus Author Vitae Author Vitae Jose C. Principe Author Vitae Author Vitae 《Pattern recognition》2007,40(3):796-806
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. 相似文献
104.
Mohamed Abid Author Vitae 《Computers & Electrical Engineering》2007,33(4):231-232
105.
106.
107.
Chen-Tsung Kuo Author Vitae 《Pattern recognition》2007,40(2):742-755
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.
Sheng-Guo Wang Author Vitae 《Automatica》2003,39(3):525-532
This paper presents a general analysis of robust pole clustering in a good ride quality region (GRQR) of aircraft for matrices with structured uncertainties. This region is an intersection of a ring and a horizontal strip, located in the left half-plane, which is a specific non-Ω-transformable region providing good ride quality of aircraft. The paper applies the Rayleigh principle along the norm theory to analyze robust pole clustering within this region since the generalized Lyapunov theory is not valid for non-Ω-transformable regions. Concerned uncertainties are structured/parametric uncertainties, including interval matrices. The results are useful for robust control analysis and design, especially, of robust good ride quality of aircraft, shuttles, vehicles and space station, as well as some industrial systems. An example of the F-16 dynamics for which GRQR is suitable is included to illustrate the results. 相似文献
109.
Marco A. Arteaga Author Vitae 《Automatica》2003,39(1):67-73
Most adaptive control schemes for rigid robots assume velocities measurements to be available. Although it is possible to measure velocities by using tachometers, this increases costs and the signals delivered may be contaminated with noise. Since the use of encoders allows to read joint position pretty accurately, it is desirable to estimate joint velocities through an observer. This paper presents an adaptive scheme designed in conjunction with a linear observer. Boundedness of the estimated parameters and uniform ultimate boundedness for the tracking and observation errors are guaranteed. Experimental results are included to support the developed theory. 相似文献
110.