首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   43059篇
  免费   4619篇
  国内免费   2465篇
工业技术   50143篇
  2024年   229篇
  2023年   583篇
  2022年   1112篇
  2021年   1280篇
  2020年   1488篇
  2019年   1130篇
  2018年   1094篇
  2017年   1468篇
  2016年   1519篇
  2015年   1710篇
  2014年   2814篇
  2013年   2372篇
  2012年   3134篇
  2011年   3441篇
  2010年   2608篇
  2009年   2743篇
  2008年   2396篇
  2007年   3008篇
  2006年   2779篇
  2005年   2337篇
  2004年   1806篇
  2003年   1614篇
  2002年   1314篇
  2001年   1156篇
  2000年   997篇
  1999年   846篇
  1998年   566篇
  1997年   514篇
  1996年   476篇
  1995年   381篇
  1994年   300篇
  1993年   189篇
  1992年   123篇
  1991年   102篇
  1990年   120篇
  1989年   91篇
  1988年   98篇
  1987年   47篇
  1986年   32篇
  1985年   23篇
  1984年   20篇
  1983年   17篇
  1982年   25篇
  1981年   9篇
  1980年   9篇
  1979年   6篇
  1959年   4篇
  1957年   1篇
  1955年   2篇
  1951年   1篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
2.
轧制始极片     
本文介绍了轧制法生产始极片的工艺,比较了轧制法和传统的钛种板生产始极片的优缺点,讨论了采用轧制始极片的经济效益和应用前景。  相似文献   
3.
Frequency Insertion Strategy for Channel Assignment Problem   总被引:1,自引:0,他引:1  
This paper presents a new heuristic method for quickly finding a good feasible solution to the channel assignment problem (CAP). Like many other greedy-type heuristics for CAP, the proposed method also assigns a frequency to a call, one at a time. Hence, the method requires computational time that increases only linear to the number of calls. However, what distinguishes the method from others is that it starts with a narrow enough frequency band so as to provoke violations of constraints that we need to comply with in order to avoid radio interference. Each violation is then resolved by inserting frequencies at the most appropriate positions so that the band of frequencies expands minimally. An extensive computational experiment using a set of randomly generated problems as well as the Philadelphia benchmark instances shows that the proposed method perform statistically better than existing methods of its kind and even yields optimum solutions to most of Philadelphia benchmark instances among which two cases are reported for the first time ever, in this paper. Won-Young Shin was born in Busan, Korea in 1978. He received B.S. in industrial engineering from Pohang University of Science and Technology (POSTECH) in 2001 and M.S in operation research and applied statistics from POSTECH in 2003. Since 2003 he has been a researcher of Agency for Defense Development (ADD) in Korea. He is interested in optimization of communication system and applied statistics. Soo Y. Chang is an associate professor in the Department of Industrial Engineering at Pohang University of Science and Technology (POSTECH), Pohang, Korea. He teaches linear programming, discrete optimization, network flows and operations research courses. His research interests include mathematical programming and scheduling. He has published in several journals including Discrete Applied Mathematics, Computers and Mathematics with Application, IIE Transactions, International Journal of Production Research, and so on. He is a member of Korean IIE, and ORMSS. Jaewook Lee is an assistant professor in the Department of Industrial Engineering at Pohang University of Science and Technology (POSTECH), Pohang, Korea. He received the B.S. degree in mathematics with honors from Seoul National University, and the Ph.D. degree from Cornell University in applied mathematics in 1993 and 1999, respectively. He is currently an assistant professor in the department of industrial engineering at the Pohang University of Science and Technology (POSTECH). His research interests include nonlinear systems, neural networks, nonlinear optimization, and their applications to data mining and financial engineering. Chi-Hyuck Jun was born in Seoul, Korea in 1954. He received B.S. in mineral and petroleum engineering from Seoul National University in 1977, M.S. in industrial engineering from Korea Advanced Institute of Science and Technology in 1979 and Ph.D. in operations research from University of California, Berkeley, in 1986. Since 1987 he has been with the department of industrial engineering, Pohang University of Science and Technology (POSTECH) and he is now a professor and the department head. He is interested in performance analysis of communication and production systems. He has published in several journals including IIE Transactions, IEEE Transactions, Queueing Systems and Chemometrics and Intelligent Laboratory Systems. He is a member of IEEE, INFORMS and ASQ.  相似文献   
4.
3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments. Meanwhile, the optimal number of rake combiners is also analyzed in this paper. This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018.  相似文献   
5.
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.  相似文献   
6.
对CFG桩质量缺陷的探讨   总被引:2,自引:2,他引:0  
张维  吕晶 《山西建筑》2006,32(1):127-129
根据具体工程的概况及水文地质条件,分析了CFG桩在地下水位出现大面积缩颈现象和复合地基载荷试验达不到设计要求的原因,并介绍了地基补强措施,以满足工程质量的要求。  相似文献   
7.
This article presents a method that can be applied to molten AA-6101 alloy to improve electrical properties of the aluminium part of the optical ground wire (OPGW) used in overhead transmission lines to protect phase conductors from lightning strike and to transmit signals and data. AA-6101 alloy in casting of the log as 6 m length and 178 mm diameter for extrusion has been inoculated by AlB2 to decrease detrimental effects of Cr, Ti, V, and Zr on the conductivity of the material. After inoculation, improved billets were extruded as 9.5 mm diameter feedstock. Required wires drawn from the feedstock according to the construction types of OPGW to be tested were exposed to aging at 175°C, 6 h (T-8). Upon completion of the back-twist and performing-type stranding process, resistance, and short-circuit current capacity and breaking load of the OPGW 88/44 constructions with other metal combinations have been examined and tested to show improvement. Results are summarized in tables and graphically.  相似文献   
8.
根据石油开采业对石油机械产品的需求 ,利用机械理论基础知识 ,通过实践设计 ,提出了对几何尺寸长的金属管类进行调质处理后的均匀冷却方法 ,以满足其性能要求。  相似文献   
9.
通过对百色等水文站泥沙资料分析 ,并结合广西河流及泥沙特性和社会对泥沙资料的精度要求 ,得出了在广西实行悬移质泥沙简测的可行性。为满足广西国民经济可持续发展需要 ,提出了在广西改革悬移质泥沙测验方式的必要性和紧迫性  相似文献   
10.
压型钢板组合楼板承载力的有限元分析   总被引:2,自引:1,他引:1  
张宇  冯子才  李海旺 《钢结构》2002,17(6):48-50
压型钢板组合楼板是 2 0世纪发展起来的一种新型结构形式。它具有显著的优势 ,如轻质、高强 ,施工快捷等 ,将在未来的建筑领域中大有作为。组合楼板的承载力主要取决于钢板 -混凝土界面处的抗剪强度。建立了一个二维有限元模型来研究单向组合板的性能。并将计算结果与试验数据进行对比 ,验证了模型的有效性  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号