首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   45231篇
  免费   4458篇
  国内免费   2690篇
工业技术   52379篇
  2024年   210篇
  2023年   742篇
  2022年   1290篇
  2021年   1790篇
  2020年   1493篇
  2019年   1204篇
  2018年   1309篇
  2017年   1496篇
  2016年   1292篇
  2015年   1859篇
  2014年   2392篇
  2013年   2785篇
  2012年   2965篇
  2011年   3102篇
  2010年   2941篇
  2009年   2719篇
  2008年   2880篇
  2007年   2772篇
  2006年   2650篇
  2005年   2033篇
  2004年   1647篇
  2003年   1639篇
  2002年   2018篇
  2001年   1724篇
  2000年   1168篇
  1999年   923篇
  1998年   631篇
  1997年   565篇
  1996年   477篇
  1995年   389篇
  1994年   298篇
  1993年   188篇
  1992年   178篇
  1991年   136篇
  1990年   95篇
  1989年   82篇
  1988年   69篇
  1987年   39篇
  1986年   47篇
  1985年   10篇
  1984年   18篇
  1983年   10篇
  1982年   13篇
  1981年   19篇
  1980年   37篇
  1979年   10篇
  1978年   3篇
  1977年   3篇
  1976年   8篇
  1959年   3篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
The focused ion beam technique was employed to investigate the atmospheric corrosion morphology of AZ91D. It was found that the α matrix of the alloy was preferentially corroded in the areas adjacent to intermetallic phases. The most interesting finding was that the corrosion products in corrosion cavities were pelletlike, which has never been reported before.  相似文献   
3.
讨论了在VMI管理思想下对具有随机需求特性的多客户库存分配问题 ,重点论述了有效近似算法的设计过程 ,最后基于一组模拟数据给出了一个算例。  相似文献   
4.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.  相似文献   
5.
一种基于空间到达角的卫星电子侦察信号分选方法   总被引:1,自引:0,他引:1  
在建立简化的卫星电子侦察空间模型的基础上,提出了一种利用空间到达角分选卫星电子侦察信号的新方法。通过仿真实验验证了这种方法的可行性。该方法可用于密集信号的预处理。  相似文献   
6.
胡桃夹子     
富于节日喜庆气氛的芭蕾舞剧《胡桃夹子》录音、录像繁多。这个伦敦科文特花园歌剧院芭蕾舞团的2000年的现场录像与其它版本比较,  相似文献   
7.
介绍了在波分复用(WDM)系统中分布式光纤拉曼放大器(FRA)的理论分析模型。在此基础上,对增益平坦设计所需考虑的因素进行了分析;最后通过试验证明了它的有效性。  相似文献   
8.
9.
Disturbance-observer (DOB)-based controller design is one of the most popular methods in the field of motion control. In this paper, the generalized disturbance compensation framework, named the robust internal-loop compensator (RIC) is introduced and an advanced design method of a DOB is proposed based on the RIC. The mixed sensitivity optimization problem, which is the main issue of DOB design, is also solved through the parametrization of the DOB in the RIC framework. Differently from conventional methods, the Q-filter is separated from the mixed sensitivity optimization problem and a systematic design law for the DOB is proposed. This guarantees the robustness and optimality of the DOB and enables the design for unstable plants.  相似文献   
10.
方文鹏  郭必新  潘庆军  窦有水 《电焊机》2002,32(1):34-35,46
从一起NSA-500-1型氩弧焊机故障,分析其高压脉冲旁路二极管VD9不同接法对引弧、稳弧及设备安全的影响。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号