全文获取类型
收费全文 | 9247篇 |
免费 | 134篇 |
国内免费 | 145篇 |
专业分类
电工技术 | 38篇 |
综合类 | 5篇 |
化学工业 | 807篇 |
金属工艺 | 464篇 |
机械仪表 | 91篇 |
建筑科学 | 84篇 |
矿业工程 | 7篇 |
能源动力 | 80篇 |
轻工业 | 123篇 |
水利工程 | 31篇 |
石油天然气 | 63篇 |
武器工业 | 1篇 |
无线电 | 383篇 |
一般工业技术 | 779篇 |
冶金工业 | 177篇 |
原子能技术 | 132篇 |
自动化技术 | 6261篇 |
出版年
2023年 | 24篇 |
2022年 | 82篇 |
2021年 | 109篇 |
2020年 | 77篇 |
2019年 | 81篇 |
2018年 | 87篇 |
2017年 | 75篇 |
2016年 | 80篇 |
2015年 | 57篇 |
2014年 | 139篇 |
2013年 | 201篇 |
2012年 | 331篇 |
2011年 | 1573篇 |
2010年 | 1127篇 |
2009年 | 1075篇 |
2008年 | 728篇 |
2007年 | 673篇 |
2006年 | 528篇 |
2005年 | 641篇 |
2004年 | 599篇 |
2003年 | 404篇 |
2002年 | 138篇 |
2001年 | 29篇 |
2000年 | 29篇 |
1999年 | 49篇 |
1998年 | 119篇 |
1997年 | 50篇 |
1996年 | 27篇 |
1995年 | 16篇 |
1994年 | 20篇 |
1993年 | 22篇 |
1992年 | 23篇 |
1991年 | 23篇 |
1990年 | 19篇 |
1989年 | 20篇 |
1988年 | 14篇 |
1987年 | 19篇 |
1986年 | 19篇 |
1985年 | 17篇 |
1984年 | 30篇 |
1983年 | 22篇 |
1982年 | 13篇 |
1981年 | 16篇 |
1980年 | 7篇 |
1979年 | 8篇 |
1977年 | 12篇 |
1976年 | 10篇 |
1975年 | 7篇 |
1974年 | 7篇 |
1972年 | 10篇 |
排序方式: 共有9526条查询结果,搜索用时 15 毫秒
101.
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. 相似文献
102.
Mohamed Abid Author Vitae 《Computers & Electrical Engineering》2007,33(4):231-232
103.
104.
105.
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. 相似文献
106.
Henry D.I. Abarbanel Lev Korzinov Alistair I. Mees Igor M. Starobinets 《Systems & Control Letters》1997,31(5):820-276
Using optimal control techniques we derive and demonstrate the use of an explicit single-step control method for directing a nonlinear system to a target orbit and keeping it there. We require that control values remain near the uncontrolled settings. The full nonlinearity of the problem in state space variables is retained. The “one-step” of the control is typically a composition of known or learned maps over (a) the time required to learn the state, (b) the time to compute the control and (c) the time to apply the control. No special targeting is required, yet the time to control is quite rapid. Working with the dynamics of a well-studied nonlinear electrical circuit, we show how this method works efficiently and accurately in two situations: when the known circuit equations are used, and when control is performed only on a Poincaré section of the reconstructed phase space. In each case, because the control rule is known analytically, the control strategy is computationally efficient while retaining high accuracy. The target locations on the selected target trajectory at each control stage are determined dynamically by the initial conditions and the system dynamics, and the target trajectory is an approximation to an unstable periodic orbit of the uncontrolled system. A linear stability analysis shows that dissipation in the dynamical system is essential for reaching a controllable state. 相似文献
107.
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. 相似文献
108.
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. 相似文献
109.
Register allocation for write activity minimization on non-volatile main memory for embedded systems
Yazhi Huang Author VitaeTiantian Liu Author Vitae Chun Jason XueAuthor Vitae 《Journal of Systems Architecture》2012,58(1):13-23
Non-volatile memories are good candidates for DRAM replacement as main memory in embedded systems and they have many desirable characteristics. Nevertheless, the disadvantages of non-volatile memory co-exist with its advantages. First, the lifetime of some of the non-volatile memories is limited by the number of erase operations. Second, read and write operations have asymmetric speed or power consumption in non-volatile memory. This paper focuses on the embedded systems using non-volatile memory as main memory. We propose register allocation technique with re-computation to reduce the number of store instructions. When non-volatile memory is applied as the main memory, reducing store instructions will reduce write activities on non-volatile memory. To re-compute the spills effectively during register allocation, a novel potential spill selection strategy is proposed. During this process, live range splitting is utilized to split certain long live ranges such that they are more likely to be assigned into registers. In addition, techniques for re-computation overhead reduction is proposed on systems with multiple functional units. With the proposed approach, the lifetime of non-volatile memory is extended accordingly. The experimental results demonstrate that the proposed technique can efficiently reduce the number of store instructions on systems with non-volatile memory by 33% on average. 相似文献
110.
M.C. Lucas-EstañAuthor Vitae J. GozalvezAuthor VitaeJ. Sanchez-SorianoAuthor Vitae 《Computer Networks》2012,56(1):112-126
Wireless systems will be characterized by the coexistence of heterogeneous Radio Access Technologies (RATs) with different, but also complementary, performance and technical characteristics. These heterogeneous wireless networks will provide network operators the possibility to efficiently and coordinately use the heterogeneous radio resources, for which novel Joint Radio Resource Management (JRRM) policies need to be designed. In this context, this work proposes and evaluates a JRRM policy that simultaneously determines for each user an adequate combination of RAT and number of radio resources within such RAT to guarantee the user/service QoS requirements, and efficiently distribute the radio resources considering a user fairness approach aimed at maximizing the system capacity. To this aim, the JRRM algorithm, which takes into account the discrete nature of radio resources, is based on integer linear programming optimization mechanisms. 相似文献