首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   13513篇
  免费   2360篇
  国内免费   1598篇
电工技术   619篇
技术理论   1篇
综合类   1552篇
化学工业   473篇
金属工艺   219篇
机械仪表   718篇
建筑科学   374篇
矿业工程   250篇
能源动力   116篇
轻工业   193篇
水利工程   116篇
石油天然气   312篇
武器工业   1165篇
无线电   5007篇
一般工业技术   1077篇
冶金工业   400篇
原子能技术   372篇
自动化技术   4507篇
  2024年   119篇
  2023年   301篇
  2022年   601篇
  2021年   598篇
  2020年   571篇
  2019年   522篇
  2018年   449篇
  2017年   505篇
  2016年   622篇
  2015年   729篇
  2014年   929篇
  2013年   932篇
  2012年   1099篇
  2011年   1177篇
  2010年   915篇
  2009年   963篇
  2008年   903篇
  2007年   1024篇
  2006年   787篇
  2005年   694篇
  2004年   544篇
  2003年   509篇
  2002年   366篇
  2001年   314篇
  2000年   245篇
  1999年   198篇
  1998年   147篇
  1997年   112篇
  1996年   126篇
  1995年   76篇
  1994年   83篇
  1993年   56篇
  1992年   44篇
  1991年   38篇
  1990年   42篇
  1989年   24篇
  1988年   20篇
  1987年   14篇
  1986年   10篇
  1985年   7篇
  1984年   8篇
  1983年   7篇
  1982年   7篇
  1981年   3篇
  1962年   3篇
  1961年   2篇
  1960年   2篇
  1959年   7篇
  1956年   3篇
  1955年   2篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
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.  相似文献   
2.
针对不同地质目标的叠前时间偏移成像解释评价   总被引:3,自引:0,他引:3  
凌云  高军  孙德胜  林吉祥 《石油物探》2006,45(3):217-229
随着计算机硬件和地震勘探成像技术的发展,叠前时间偏移正逐步替代常规的NMO加DMO加叠后时间偏移成为地震数据成像处理方法的主流。但对于不同的地质目标,叠前时间偏移的成像效果是否优于常规NMO加DMO加叠后时间偏移的成像效果呢?为此,从地震数据成像处理方法、处理流程和处理参数等方面进行了讨论,并基于某地区三维数据常规处理结果和叠前时间偏移处理结果,针对不同地质目标进行了剖析与评价。认为:叠前时间偏移成像的垂向分辨率较常规处理明显降低,但对于空间波阻抗变化明显的河流和断层,叠前时间偏移成像的空间分辨率要高于常规处理;对于小于1/4波长的叠置薄储层,叠前时间偏移成像的垂向和空间分辨率低于常规处理结果。  相似文献   
3.
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.  相似文献   
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.
从国际上通行的油气勘探评价工作重点,中国石油所面临的"已逐步进入一个不断在老区范围内开展精细勘探、在老区范围内开展新区块、新层系勘探以获得主要的储量增长"的新的勘探形势,现有地质研究中各专题研究与具体勘探目标评价脱节等多个方面,论述了在中国石油内部建立一套动态勘探目标评价体系的迫切必要性;并在此基础上阐述了一个完整的动态勘探目标评价体系应包括的主要内容;最后对该体系的建设进行了可行性分析。  相似文献   
6.
基于扩展分形和CFAR特征融合的SAR图像目标识别   总被引:3,自引:0,他引:3  
研究了多信息融合技术在SAR图像目标识别中的应用。将扩展分形特征(Extended Fractal)与双参数恒虚警特征(Double Parameter CFAR)形成的多信息进行融合处理。运用Dempster-Shafer证据理论,在决策层对SAR图像中的像素进行识别分类。实验结果表明通过融合对像素分类的准确性明显好于单特征的检测结果,减少了虚警概率,提高了系统的识别能力。  相似文献   
7.
Thirty patients who had undergone either a right or left unilateral temporal lobectomy (14 RTL; 16 LTL) and 16 control participants were tested on a computerized human analogue of the Morris Water Maze. The procedure was designed to compare allocentric and egocentric spatial memory. In the allocentric condition, participants searched for a target location on the screen, guided by object cues. Between trials, participants had to walk around the screen, which disrupted egocentric memory representation. In the egocentric condition, participants remained in the same position, but the object cues were shifted between searches to prevent them from using allocentric memory. Only the RTL group was impaired on the allocentric condition, and neither the LTL nor RTL group was impaired on additional tests of spatial working memory or spatial manipulation. The results support the notion that the right anterior temporal lobe stores long-term allocentric spatial memories. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
8.
定向探测引信技术分析   总被引:2,自引:1,他引:1  
从提高引信与战斗部配合效率出发 ,根据定向战斗部的战术技术性能 ,介绍了一种能够识别弹体周围 4个方向目标的定向探测引信 .分析了定向探测器的工作原理和目标方位识别的关键技术 ,并对探测天线的设计做了详细的分析和计算 .  相似文献   
9.
Tracking targets of interest is one of the major research areas in radar surveillance systems. We formulate the problem as incomplete data estimation and apply EM to the MAP estimate. The resulting filter has a recursive structure analogous to the Kalman filter. The advantage is that the measurement‐update deals with multiple measurements in parallel and the parameter‐update estimates the system parameters on the fly. Experiments tracking separate targets in parallel show that tracking maintenance ratio of the proposed system is better than that of NNF and RMS position error is smaller than that of PDAF. Also, the system parameters are correctly obtained even from incorrect initial values. Copyright © 2001 John Wiley & Sons, Ltd.  相似文献   
10.
高分辨率合成孔径雷达图像舰船检测方法   总被引:7,自引:0,他引:7  
寻找针对高分辨率SAR图像的舰船目标检测算法。利用KSW双阈值分割技术,其效果比传统检测方法好,有利于进一步的目标分类和识别。且必须根据SAR图像分辨率来选择舰船检测算法。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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