首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1495篇
  免费   40篇
  国内免费   38篇
电工技术   19篇
综合类   55篇
化学工业   45篇
金属工艺   34篇
机械仪表   120篇
建筑科学   36篇
矿业工程   13篇
能源动力   16篇
轻工业   23篇
水利工程   1篇
石油天然气   24篇
武器工业   2篇
无线电   88篇
一般工业技术   77篇
冶金工业   12篇
原子能技术   16篇
自动化技术   992篇
  2024年   4篇
  2023年   6篇
  2022年   8篇
  2021年   12篇
  2020年   6篇
  2019年   14篇
  2018年   18篇
  2017年   21篇
  2016年   35篇
  2015年   39篇
  2014年   75篇
  2013年   65篇
  2012年   63篇
  2011年   112篇
  2010年   54篇
  2009年   126篇
  2008年   141篇
  2007年   97篇
  2006年   89篇
  2005年   83篇
  2004年   81篇
  2003年   58篇
  2002年   63篇
  2001年   32篇
  2000年   31篇
  1999年   21篇
  1998年   38篇
  1997年   31篇
  1996年   25篇
  1995年   22篇
  1994年   23篇
  1993年   8篇
  1992年   5篇
  1991年   6篇
  1990年   8篇
  1989年   9篇
  1988年   7篇
  1987年   7篇
  1986年   3篇
  1985年   4篇
  1984年   2篇
  1983年   7篇
  1982年   1篇
  1981年   4篇
  1980年   2篇
  1979年   3篇
  1976年   1篇
  1973年   1篇
  1972年   1篇
  1971年   1篇
排序方式: 共有1573条查询结果,搜索用时 15 毫秒
1.
V. Chepoi  Y. Vaxes 《Algorithmica》2002,33(2):243-262
Given a graph G=(V,E) and a positive integer D , we consider the problem of finding a minimum number of new edges E' such that the augmented graph G'=(V,E\cup E') is biconnected and has diameter no greater than D. In this note we show that this problem is NP-hard for all fixed D , by employing a reduction from the DOMINATING SET problem. We prove that the problem remains NP-hard even for forests and trees, but in this case we present approximation algorithms with worst-case bounds 3 (for even D ) and 6 (for odd D ). A closely related problem of finding a minimum number of edges such that the augmented graph has diameter no greater than D has been shown to be NP-hard by Schoone et al. [21] when D=3 , and by Li et al. [17] when D=2. Received April 19, 1999; revised June 5, 2001.  相似文献   
2.
We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [STACS'99, Lecture Notes in Comput. Sci., Vol. 1563, 1999, pp. 259-269]. Our algorithm uses a new approach which is much simpler than the one given by Preis and needs no amortized analysis for its running time.  相似文献   
3.
AVO分析和应用   总被引:1,自引:0,他引:1  
  相似文献   
4.
Corrosion fatigue tests were carried out on extruded AZ31 (3% Al, 1% Zn, 0.3% Mn, Mg—the rest), AM50 (5% Al, 0.4% Mn, Mg—the rest) and ZK60 (5% Zn, 0.5% Zr, Mg—the rest) Mg alloys in air, NaCl-based and borate solutions. Nsol/Nair ratios (the relative fatigue life) were used for the analysis of the corrosion fatigue behavior of Mg alloys in various environments, where Nsol and Nair are the numbers of cycles to failure in the solution and in air, respectively. Extruded ZK60 alloy reveals very high fatigue and corrosion fatigue properties in comparison with other alloys. However, it has the lowest relative fatigue life (Nsol/Nair 10−3–10−2) or the highest sensitivity to the action of NaCl-based solutions in comparison with that of AM50 and AZ31 alloys (Nsol/Nair 10−2–10−1). Under the same stress, the corrosion fatigue life of extruded alloys is significantly longer than that of die-cast alloys (Nsol for extruded AM50 in NaCl is two to three times longer than that of die-cast AM50).  相似文献   
5.
The search for good lineal, or depth-first, spanning trees is an important aspect in the implementation of a wide assortment of graph algorithms. We consider the complexity of findingoptimal lineal spanning trees under various notions of optimality. In particular, we show that several natural problems, such as constructing a shortest or a tallest lineal tree, are NP-hard. We also address the issue of polynomial-time, near-optimization strategies for these difficult problems, showing that efficient absolute approximation algorithms cannot exist unlessP = NP.This author's research was supported in part by the Sandia University Research Program and by the National Science Foundation under Grant M IP-8603879.This author's research was supported in part by the National Science Foundation under Grants ECS-8403859 and MIP-8603879.  相似文献   
6.
In this paper, the effectiveness of the approximate motion equations of a flexible structure, obtained by the RitzKantorovich method, is analysed by using Lyapunov functions. The analysis, which is restricted to the case of a single flexible beam for the sake of simplicity, is carried out under the assumption that a partial dissipation is present, affecting only the first degrees of freedom of the system. By means of suitable Lyapunov functions, an overbounding estimate of the quadratic approximation error is determined as a decreasing function of the approximation order. The analysis is completed by considering the two ‘extreme’ cases: the theoretical absence of dissipation and the presence of structural dissipation, affecting all the infinite degrees of freedom.  相似文献   
7.
The three-dimensional packing problem can be stated as follows. Given a list of boxes, each with a given length, width, and height, the problem is to pack these boxes into a rectangular box of fixed-size bottom and unbounded height, so that the height of this packing is minimized. The boxes have to be packed orthogonally and oriented in all three dimensions. We present an approximation algorithm for this problem and show that its asymptotic performance bound is between 2.5 and 2.67. This result answers a question raised by Li and Cheng [5] about the existence of an algorithm for this problem with an asymptotic performance bound less than 2.89. This research was partially supported by FAPESP (proc. 93/0603-1) and by CNPq/ProTeM-CC, project ProComb (proc. 680065/94-6).  相似文献   
8.
This paper addresses the problem of finding the parameters of the arrival law which most significantly influence expected occupation and loss of a finite capacity queue. The input process is supposed to be ergodic and wide sense stationary. We show that it is mostly possible to fit an MMPP(2) to the decisive parameters of observational data. Numerical examples illustrate the importance of the decisive parameters, called key parameters, and also show the accuracy of the proposed fitting procedure. Finally, in the appendix we present the solution of the finite capacity queueing problem with Special Semi Markov Process (SSMP) arrivals and a general service strategy.  相似文献   
9.
Development and implementation of a NURBS curve motion interpolator   总被引:4,自引:0,他引:4  
This paper deals with the issues of development and implementation of a real-time NURBS interpolator for a six-axis robot. Using an open-architecture controller system as a testbed, a real-time NURBS curve interpolator was developed, implemented and tested. Sample runs were conducted with the resulting trajectories measured in real-time during robot motion. The resulting trajectories are analyzed, discussed and compared with those from a commonly used point-to-point approximation technique. The real-time NURBS curve interpolator's feasibility, advantages and related issues are also discussed.  相似文献   
10.
主离合器分离杆螺栓是一个重要安全件,使用中经常发生断裂。经过失效分析确定断裂原因是由其配件引起。提高配件的冷加工质量及改进结构,可解决分离杆螺栓的断裂问题。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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