首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   331篇
  免费   170篇
  国内免费   25篇
  2024年   3篇
  2023年   6篇
  2022年   6篇
  2021年   7篇
  2020年   10篇
  2019年   7篇
  2018年   10篇
  2017年   16篇
  2016年   21篇
  2015年   24篇
  2014年   34篇
  2013年   30篇
  2012年   34篇
  2011年   41篇
  2010年   22篇
  2009年   29篇
  2008年   24篇
  2007年   29篇
  2006年   15篇
  2005年   31篇
  2004年   16篇
  2003年   17篇
  2002年   15篇
  2001年   12篇
  2000年   12篇
  1999年   8篇
  1998年   15篇
  1997年   9篇
  1996年   4篇
  1994年   3篇
  1993年   3篇
  1992年   4篇
  1991年   1篇
  1990年   3篇
  1989年   3篇
  1988年   2篇
排序方式: 共有526条查询结果,搜索用时 15 毫秒
151.
Abstract

Terms like ‘support’ and ‘collaboration’ are often used interchangeably to denote a loose set of acts or attitudes that benefit non-state armed groups (NSAGs). However, these terms are seldom defined, and the alternatives available to civilians are rarely identified. Moreover, existing approaches overlook that the interaction between civilians and NSAGs is often one between ruler and ruled, which makes obedience and resistance central. This paper proposes to conceptualize the choices available to civilians as forms of cooperation and non-cooperation, offers a typology, and discusses the implications for theory building on civilian and NSAG behavior, and on the functioning of armed social orders.  相似文献   
152.
文章介绍了一种基于n阶布拉格衍射的新型冷原子干涉重力仪,可以进一步提高现有拉曼跃迁型原子干涉重力仪的测量灵敏度和稳定度。在介绍布拉格衍射型原子干涉重力仪基本原理的基础上,建立了原子平行驻波入射的时间型布拉格衍射冷原子干涉重力仪理论模型,分析了实验所需的关键条件,包括原子团纵向温度,布拉格激光直径、曲率半径、频率、强度以及时序等。与已有实验数据的对比结果表明,本文所建模型合理,所得结论能够为实际构造一台布拉格衍射型冷原子干涉重力仪提供有意义的指导。  相似文献   
153.
高性能计算系统的复杂性和规模的不断增长使得系统的平均无故障时间越来越短,因此系统的硬软件故障导致并行程序运行出错的概率随之增加。此外,并行程序本身可能存在的编程错误也会导致运行出错。由于处理上述两类故障原因的措施迥异,所以在程序运行出现故障时,用户需要关注故障原因的类别。针对这一问题,设计和实现了一种基于作业管理系统Slurm的并行程序运行故障原因识别系统。通过对Slurm进行扩展,监控作业状态,重提交和重运行作业。根据作业运行结果,区分故障原因类别。故障注入方式进行的实验表明,该系统具有较高的识别准确率。  相似文献   
154.
可室温运转的高灵敏度太赫兹探测器是该领域的难点。热电原理的太赫兹探测器为解决室温下的宽频段、高灵敏探测提供可能。通过利用石墨烯和钙钛矿等新型微纳材料的高载流子迁移率和优异的热电性能,制备出高性能室温运转的太赫兹光电探测器,探测的光电响应度最高可达到271 mA/W,响应时间小于20 ms。研究表明,石墨烯和钙钛矿等光热电探测器有望成为太赫兹频段新一代高性能探测器。  相似文献   
155.
鉴于建筑外保温层火灾蔓延速度快,烟雾生成量大、毒性强,易形成隐匿燃烧,受室外风影响较大,且火场交通条件差,移动灭火装备使用受限等特点,提出快速调集处置力量,充分利用固定消防设施,设置中转水囊,合理选择水枪阵地,正确处理内攻和外攻关系,搞好战勤保障及现场清理等火灾扑救对策,为消防部队扑救此类火灾提供一定的战术指导和借鉴.  相似文献   
156.
二维离散余弦/反余弦变换是图像处理算法的核心。基于DSP处理器或软件实现速度较低,以及ASIC实现芯片的面积和功耗都较大,本文研究了一种基于行列分解结构的二维DCT/IDCT变换,在两级一维DCT/IDCT变换之间插入双RAM结构,通过乒乓操作保证了前后级DCT/IDCT运算的并行性,提高了运算速度。电路结构在QuartusII中进行了逻辑综合,通过Modelsim编写激励对逻辑功能进行了仿真验证,并将仿真结果与Mat—lab仿真结果进行了比较。结果表明该模块功能正确,能够为图像处理提供良好的处理性能。  相似文献   
157.
非相参多点源诱偏技术是对抗反辐射导弹(ARM)的有效手段。以ARM目标分辨的二分组理论和双点源诱偏的仿真结果为依据,对等功率三点源诱偏的2种经典布局的ARM落点整体分布进行预测。通过对ARM落点和系统被击中概率曲线的分析及拟合处理,验证了预测的正确性及系统被击中概率与占地面积的相关性,为通信辐射源抗ARM的布设提供一定的参考。  相似文献   
158.
针对校验矩阵形如准循环双对角阵的结构化LDPC码,对比研究了两类高效的编码算法:矩阵分解编码算法和分项累加递归编码算法,证明了两类算法从实现角度是等价的,但分项累加递归编码算法推导更为直观,且便于硬件并行实现。基于分项累加编码算法,提出了一种适合准循环双对角LDPC码的部分并行编码结构,设计实现了IEEE 802.11n标准中的LDPC码编码器。FPGA实现结果表明,所设计的LDPC编码器具有硬件开销较小、吞吐率高的优点,在码长为1944bit、码率为5/6时信息比特吞吐率最高可达13Gbps。  相似文献   
159.
We consider the problem of assessing the value of demand sharing in a multistage supply chain in which the retailer observes stationary autoregressive moving average demand with Gaussian white noise (shocks). Similar to previous research, we assume each supply chain player constructs its best linear forecast of the leadtime demand and uses it to determine the order quantity via a periodic review myopic order‐up‐to policy. We demonstrate how a typical supply chain player can determine the extent of its available information in the presence of demand sharing by studying the properties of the moving average polynomials of adjacent supply chain players. The retailer's demand is driven by the random shocks appearing in the autoregressive moving average representation for its demand. Under the assumptions we will make in this article, to the retailer, knowing the shock information is equivalent to knowing the demand process (assuming that the model parameters are also known). Thus (in the event of sharing) the retailer's demand sequence and shock sequence would contain the same information to the retailer's supplier. We will show that, once we consider the dynamics of demand propagation further up the chain, it may be that a player's demand and shock sequences will contain different levels of information for an upstream player. Hence, we study how a player can determine its available information under demand sharing, and use this information to forecast leadtime demand. We characterize the value of demand sharing for a typical supply chain player. Furthermore, we show conditions under which (i) it is equivalent to no sharing, (ii) it is equivalent to full information shock sharing, and (iii) it is intermediate in value to the two previously described arrangements. Although it follows from existing literature that demand sharing is equivalent to full information shock sharing between a retailer and supplier, we demonstrate and characterize when this result does not generalize to upstream supply chain players. We then show that demand propagates through a supply chain where any player may share nothing, its demand, or its full information shocks (FIS) with an adjacent upstream player as quasi‐ARMA in—quasi‐ARMA out. We also provide a convenient form for the propagation of demand in a supply chain that will lend itself to future research applications. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 515–531, 2014  相似文献   
160.
The problem of finding a strict total order for a finite set of multiple criteria alternatives is considered. Our research extends previous work by us, which considered finding a partial order for a finite set of alternatives. We merge the preference information extracted from the preference cones and corresponding polyhedral sets, with the information derived from pairwise comparisons of two alternatives, yielding a preference matrix. This preference matrix is used as input to an integer programming model to obtain a strict total order that provides a transitive ranking for the set of alternatives. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 155–163, 2014  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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