首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   373篇
  免费   80篇
  国内免费   14篇
  2024年   1篇
  2023年   3篇
  2022年   4篇
  2021年   7篇
  2020年   10篇
  2019年   7篇
  2018年   6篇
  2017年   13篇
  2016年   13篇
  2015年   24篇
  2014年   17篇
  2013年   70篇
  2012年   19篇
  2011年   24篇
  2010年   21篇
  2009年   27篇
  2008年   27篇
  2007年   27篇
  2006年   17篇
  2005年   20篇
  2004年   16篇
  2003年   12篇
  2002年   11篇
  2001年   13篇
  2000年   10篇
  1999年   11篇
  1998年   7篇
  1997年   8篇
  1996年   4篇
  1995年   1篇
  1994年   3篇
  1993年   1篇
  1992年   1篇
  1991年   3篇
  1990年   3篇
  1989年   2篇
  1988年   2篇
  1987年   1篇
  1969年   1篇
排序方式: 共有467条查询结果,搜索用时 375 毫秒
121.
针对目前基于模糊函数提取的几何学特征,在低信噪比时表征能力弱,导致识别准确率不高的问题,提出了一种基于EEMD降噪和模糊函数奇异值向量的识别方法.选取合适的EEMD参数,对时域信号进行降噪,提取模糊函数矩阵奇异值向量,求解其交叉熵作为特征,实现雷达辐射源信号识别.仿真实验表明,信噪比大于-5 dB时,所提方法对于BPS...  相似文献   
122.
In this paper, we present an O(nm log(U/n)) time maximum flow algorithm. If U = O(n) then this algorithm runs in O(nm) time for all values of m and n. This gives the best available running time to solve maximum flow problems satisfying U = O(n). Furthermore, for unit capacity networks the algorithm runs in O(n2/3m) time. It is a two‐phase capacity scaling algorithm that is easy to implement and does not use complex data structures. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 511–520, 2000  相似文献   
123.
文中介绍了IRM-PC机上多功能仿真软件GASP/PC的开发,叙述了GASP/PC仿真语言的形成以及对于连续、离散和复合仿真模型的GASP/PC语言的结构与仿真方法。  相似文献   
124.
为了使非线性纯反馈系统满足更高的性能要求,提出了一种新的预定性能自适应控制算法。为了解决状态中的非仿射结构引入了新的坐标变换,满足系统预定性能,设计了简单的Lyapunov函数,通过反步法,给出了一种新的自适应控制算法来解决参数未知问题。仿真表明在设计的控制器保证了系统预定性能的同时,也使得闭环系统所有信号有界。  相似文献   
125.
基于低轨道卫星通信技术,针对高空长航时无人机系统,建立以卫星中继的通信数据链模型.从传统数据链入手,分析其存在的弊端和使用的局限性,并融合现代通信技术,在引用新型编码技术的基础上,给出了新的无人机通信数据链路方案.该设计方案以无人机作战使用实际为基础,极大地提高信息传输能力和信息安全性.  相似文献   
126.
随着隐身技术在军用飞机上的广泛应用,反隐身技术成为赢取未来高技术战争必须研究的课题.以F-117 A和B-2飞机为例,分析了现有的飞机红外隐身技术措施,对红外隐身前后系统作用距离进行估算,重点阐述了未来反红外隐身飞机的技术措施,对飞机反隐身技术的发展提出了展望.  相似文献   
127.
We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
128.
Since a system and its components usually deteriorate with age, preventive maintenance (PM) is often performed to restore or keep the function of a system in a good state. Furthermore, PM is capable of improving the health condition of the system and thus prolongs its effective age. There has been a vast amount of research to find optimal PM policies for deteriorating repairable systems. However, such decisions involve numerous uncertainties and the analyses are typically difficult to perform because of the scarcity of data. It is therefore important to make use of all information in an efficient way. In this article, a Bayesian decision model is developed to determine the optimal number of PM actions for systems which are maintained according to a periodic PM policy. A non‐homogeneous Poisson process with a power law failure intensity is used to describe the deteriorating behavior of the repairable system. It is assumed that the status of the system after a PM is somewhere between as good as new for a perfect repair and as good as old for a minimal repair, and for failures between two preventive maintenances, the system undergoes minimal repairs. Finally, a numerical example is given and the results of the proposed approach are discussed after performing sensitivity analysis. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
129.
This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003  相似文献   
130.
我国思想政治工作者在实践中总结出来的"晓之以理、动之以情、持之以恒、导之以行"的十六字方针,是对思想政治工作规律的反映,其中的"理"、"情"、"意"、"行"是做好思想政治工作的四个基本因素,它们在思想政治工作中起着各自不可替代的作用.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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