首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   453篇
  免费   134篇
  国内免费   17篇
  2024年   1篇
  2023年   7篇
  2022年   8篇
  2021年   13篇
  2020年   9篇
  2019年   13篇
  2018年   9篇
  2017年   26篇
  2016年   24篇
  2015年   15篇
  2014年   43篇
  2013年   33篇
  2012年   24篇
  2011年   43篇
  2010年   35篇
  2009年   31篇
  2008年   36篇
  2007年   26篇
  2006年   25篇
  2005年   27篇
  2004年   24篇
  2003年   24篇
  2002年   16篇
  2001年   22篇
  2000年   20篇
  1999年   9篇
  1998年   4篇
  1997年   4篇
  1996年   8篇
  1995年   4篇
  1994年   1篇
  1993年   3篇
  1992年   4篇
  1991年   3篇
  1990年   4篇
  1989年   2篇
  1988年   3篇
  1987年   1篇
排序方式: 共有604条查询结果,搜索用时 15 毫秒
21.
高可靠、强实时分布式系统的切换技术研究   总被引:1,自引:0,他引:1  
本文首先给出某高可靠、强实时分布式系统及系统的两种切换方案的简要描述,然后对切换技术的实现进行讨论;最后,在建立强实时双工系统的可靠性模型基础上,对系统的两种切换方案进行分析与比较。研究结果表明:对于本系统,机组级切换优于结点机级切换,且可以减少程序的复杂度,提高系统的可靠性与实时性。  相似文献   
22.
We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
23.
针对全球导航卫星系统接收机面临的分布式间歇干扰威胁,全面准确地分析了基于采样矩阵直接求逆方法的空时自适应处理(space-time adaptive processing, STAP)的抗干扰性能。在建立性能分析模型的基础上,根据间歇干扰造成的采样协方差矩阵不匹配情况,通过分类评估、梳理归纳、理论推导全面分析了不同情况下STAP的性能。分析结果表明在采样长度小于闪烁周期且使用预采用处理方法时,空时自适应处理器会出现漏采样,干扰抑制性能会急剧下降,漏采样出现的频率为各干扰闪烁频率之和。数值和仿真分析验证了理论分析的结果,在此基础上讨论了考虑分布式间歇干扰时STAP的优化设计。  相似文献   
24.
针对智能反射面(intelligent reflecting surface, IRS)辅助的无线网络传输设计的目标是通过联合设计基站处的发送波束形成向量和IRS的反射系数,在满足基站发射功率和IRS单位模约束的条件下,使多个地面用户的加权和速率最大化。为了求解非凸的目标函数,提出一种交替优化方法,其中采用黎曼流形梯度(Riemannian manifold gradient, RMG)方法来优化反射系数,使用二分搜索法优化发送波束形成向量。此外,为了降低RMG方法的复杂度,设计了一种智能元素块坐标下降方法。仿真结果验证了所提算法的有效性,并且表明通过优化设计反射系数,IRS可显著提高无线网络的频谱效率。  相似文献   
25.
针对以常规母联开关互联的交流电网线路变压器容量无法合理利用的问题,提出了依靠由背靠背电压源变流器组成的新型大功率柔性互联装置实现两侧交流电网有功功率互济的协调控制方法。介绍了新型柔性互联装置的拓扑结构与基本的控制原理,为实现两侧线路变压器容量合理的目标制定了一种生成有功功率参考的方法,并基于PSCAD/EMTDC搭建了一套仿真算例,对新型柔性互联装置的基本控制与所提出的有功互济的协调控制方法进行了验证。仿真结果表明,在柔性互联装置采用所提方法时能够实现两侧交流线路的有功功率互济,解决了线路变压器容量无法合理分配的问题。  相似文献   
26.
信息战建模的分析与探讨   总被引:1,自引:0,他引:1  
通过对信息战建模的分析与总结,指出了一个完善的信息战建模方法应具备的基本功能;给出了这种建模方法的结构流图,并分析了结构流图的构成.该方法建立的信息战模型,能有效地识别信息战的效果,对信息战的理论发展和具体实施都有较重要的指导作用.  相似文献   
27.
正弦波型直流无刷电动机位置伺服系统的变结构控制   总被引:1,自引:0,他引:1  
在分析正弦波型直流无刷电动机数学模型的基础上,采用比例等速变速控制策略(PCV)设计控制器,应用于正弦波型直流无刷电动机位置伺服系统.仿真结果表明:与传统PI控制器比较,PCV控制策略可以明显改善系统的品质,并增强系统的鲁棒性.  相似文献   
28.
舷外有源诱饵反导方法研究   总被引:1,自引:0,他引:1  
为提高电子战反导水平和导弹突防能力,根据反导电子战装备发展的趋势,介绍了舷外有源诱饵的原理和特点,分析了欺骗干扰、压制干扰和组合干扰3种舷外有源诱饵作战使用的典型模式,从实际试验和仿真2方面研究了舷外有源诱饵对抗反击导弹的效果.研究内容对反导电子战装备的研发和作战使用以及反舰导弹突防研究具有一定参考价值.  相似文献   
29.
We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
30.
We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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