首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   658篇
  免费   89篇
  国内免费   95篇
电工技术   50篇
综合类   43篇
化学工业   33篇
金属工艺   12篇
机械仪表   45篇
建筑科学   49篇
矿业工程   17篇
能源动力   10篇
轻工业   52篇
水利工程   7篇
石油天然气   5篇
武器工业   3篇
无线电   70篇
一般工业技术   52篇
冶金工业   15篇
原子能技术   106篇
自动化技术   273篇
  2024年   6篇
  2023年   12篇
  2022年   28篇
  2021年   25篇
  2020年   28篇
  2019年   25篇
  2018年   24篇
  2017年   29篇
  2016年   29篇
  2015年   33篇
  2014年   48篇
  2013年   75篇
  2012年   46篇
  2011年   69篇
  2010年   47篇
  2009年   44篇
  2008年   40篇
  2007年   39篇
  2006年   37篇
  2005年   43篇
  2004年   24篇
  2003年   20篇
  2002年   15篇
  2001年   11篇
  2000年   5篇
  1999年   8篇
  1998年   5篇
  1997年   1篇
  1996年   3篇
  1995年   7篇
  1994年   5篇
  1992年   2篇
  1990年   1篇
  1988年   1篇
  1987年   2篇
  1985年   1篇
  1981年   1篇
  1959年   3篇
排序方式: 共有842条查询结果,搜索用时 15 毫秒
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.5代移动通信中的链路自适应技术使用自适应调制编码和快速混合重传技术替代了3代中使用的功率控制技术。仿真结果比较了这两种新技术与功率控制技术的性能,证明了这两个新技术显著地提高了网络平均的吞吐量。  相似文献   
3.
出租车拼车计费系统硬件设计采用单片机PK10N512VLL10为主控芯片,TPC7062KW组态触摸屏为监控操作界面,显示部分为64*16点阵;在软件上将乘车状态划分为单乘状态和拼车状态,同时根据当地物价水平设定计费方案,计算出不同乘客的车费,车内车费的显示采用实时刷新的方法;该系统样机已经成型,经测试操作简单、稳定且成本较低。  相似文献   
4.
为了实现资源和系统环境的隔离,近年来新兴了多种虚拟化工具,容器便是其中之一。在超算资源上运行的问题通常是由软件配置引起的。容器的一个作用就是将依赖打包进轻量级可移植的环境中,这样可以提高超算应用程序的部署效率。为了解基于IB网的CPU-GPU异构超算平台上容器虚拟化技术的性能特征,使用标准基准测试工具对Docker容器进行了全面的性能评估。该方法能够评估容器在虚拟化宿主机过程中产生的性能开销,包括文件系统访问性能、并行通信性能及GPU计算性能。结果表明,容器具备近乎原生宿主机的性能,文件系统I/O开销及GPU计算开销与原生宿主机差别不大。随着网络负载的增大,容器的并行通信开销也相应增大。根据评估结果,提出了一种能够发挥超算平台容器性能的方法,为使用者有针对性地进行系统配置、合理设计应用程序提供依据。  相似文献   
5.
6.
黄嵩  沈重 《传感器与微系统》2015,(4):137-139,143
为了降低节点能耗,提高能量的利用率,提出了一种高效节能的基于速龙码( RC)的传输功率控制( RC-TPC)重编程协议。该协议分两个阶段完成数据传输,第一阶段各个节点更新自己的位置信息,形成最优化的拓扑结构。进入第二阶段后,根据优化的拓扑结构通过调整发送节点的传输功率和中继节点的累计选择次数,Sink节点选择适当的中继节点,使中继节点的传输功率和RC的开销达到最优化。此外,RC的编码方式使传输数据包发生的错误概率更小,减少了重编程过程中的冗余以保证网络负载的均匀分布,有效地实现了高效节能,从而提高整个网络的生存周期。理论分析与实验结果表明:与MNP协议和ATPC协议相比,RC-TPC协议用于传输的平均能量消耗降低17.2%。  相似文献   
7.
K-栅栏覆盖是无线传感器网络覆盖控制的研究热点之一。本文构建了强栅栏覆盖模型,提出了分区强K-栅栏覆盖构建算法PMNSB,用最少的节点形成强栅栏。首先把监控区域分成多个子区域,通过匈牙利算法选用移动距离之和最少的网格集合为基准1-栅栏覆盖,缺少移动节点的子区域,选择附近区域的剩余移动节点修补形成1-栅栏覆盖。水平相邻的两个子区域之间构建竖直栅栏,这些1-栅栏合起来构成强K-栅栏覆盖。仿真结果证明了该方法的有效性,本文的研究对提升无线传感器网络的性能具有重要的理论与实际意义。  相似文献   
8.
针对基于最小方差的性能评价准则由于只考虑时滞引起的性能限制,不适合对PID控制回路进行性能评价的问题,本文采用PID能实现最小方差控制准则,对四水箱控制系统进行性能分析,得到的性能指标比传统最小方差准则明显提高,控制器参数大大改善了过程的输出方差。实验表明,PID能实现最小方差准则能够为PID控制器的性能评价提供一个合理的评价基准,更说明其对特定类型控制器性能评价所具有的实际意义。  相似文献   
9.
In an organization operating in the bancassurance sector we identified a low-risk IT subportfolio of 84 IT projects comprising together 16,500 function points, each project varying in size and duration, for which we were able to quantify its requirements volatility. This representative portfolio stems from a much larger portfolio of IT projects. We calculated the volatility from the function point countings that were available to us. These figures were aggregated into a requirements volatility benchmark. We found that maximum requirements volatility rates depend on size and duration, which refutes currently known industrial averages. For instance, a monthly growth rate of 5% is considered a critical failure factor, but in our low-risk portfolio we found more than 21% of successful projects with a volatility larger than 5%. We proposed a mathematical model taking size and duration into account that provides a maximum healthy volatility rate that is more in line with the reality of low-risk IT portfolios. Based on the model, we proposed a tolerance factor expressing the maximal volatility tolerance for a project or portfolio. For a low-risk portfolio its empirically found tolerance is apparently acceptable, and values exceeding this tolerance are used to trigger IT decision makers. We derived two volatility ratios from this model, the π-ratio and the ρ-ratio. These ratios express how close the volatility of a project has approached the danger zone when requirements volatility reaches a critical failure rate. The volatility data of a governmental IT portfolio were juxtaposed to our bancassurance benchmark, immediately exposing a problematic project, which was corroborated by its actual failure. When function points are less common, e.g. in the embedded industry, we used daily source code size measures and illustrated how to govern the volatility of a software product line of a hardware manufacturer. With the three real-world portfolios we illustrated that our results serve the purpose of an early warning system for projects that are bound to fail due to excessive volatility. Moreover, we developed essential requirements volatility metrics that belong on an IT governance dashboard and presented such a volatility dashboard.  相似文献   
10.
The search for food stimulated by hunger is a common phenomenon in the animal world. Mimicking the concept, recently, an optimization algorithm Hunger Games Search (HGS) has been proposed for global optimization. On the other side, the Whale Optimization Algorithm (WOA) is a commonly utilized nature-inspired algorithm portrayed by a straightforward construction with easy parameters imitating the hunting behavior of humpback whales. However, due to minimum exploration of the search space, WOA has a high chance of trapping into local solutions, and more exploitation leads it towards premature convergence. The concept of hunger from HGS is merged with the food searching techniques of the whale to lessen the inherent drawbacks of WOA. Two weights of HGS are adaptively designed for every whale using the respective hunger level for balancing search strategies. Performance verification of the proposed hunger search-based whale optimization algorithm (HSWOA) is done by comparing it with 10 state-of-the-art algorithms, including three very recently developed algorithms on 30 classical benchmark functions. Comparison with some basic algorithms, recently modified algorithms, and WOA variants is performed using IEEE CEC 2019 function set. Statistical performance of the proposed algorithm is verified with Friedman's test, boxplot analysis, and Nemenyi multiple comparison test. The operating speed of the algorithm is determined and tested with complexity analysis and convergence analysis. Finally, seven real-world engineering problems are solved and compared with a list of metaheuristic algorithms. Numerical and statistical performance comparison with state-of-the-art algorithms confirms the efficacy of the newly designed algorithm.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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