首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
  示例: 沙坡头地区,人工植被区,变化  检索词用空格隔开表示必须包含全部检索词,用“,”隔开表示只需满足任一检索词即可!
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   315篇
  免费   89篇
  国内免费   5篇
  409篇
  2024年   3篇
  2023年   3篇
  2022年   6篇
  2021年   3篇
  2020年   7篇
  2019年   12篇
  2018年   11篇
  2017年   25篇
  2016年   26篇
  2015年   25篇
  2014年   16篇
  2013年   27篇
  2012年   21篇
  2011年   26篇
  2010年   19篇
  2009年   22篇
  2008年   20篇
  2007年   14篇
  2006年   15篇
  2005年   12篇
  2004年   11篇
  2003年   7篇
  2002年   8篇
  2001年   10篇
  2000年   9篇
  1999年   9篇
  1998年   9篇
  1997年   9篇
  1996年   5篇
  1995年   1篇
  1994年   5篇
  1993年   1篇
  1992年   1篇
  1991年   5篇
  1990年   2篇
  1989年   3篇
  1988年   1篇
排序方式: 共有409条查询结果,搜索用时 0 毫秒
31.
推进国家治理体系和治理能力现代化   总被引:1,自引:0,他引:1  
党的十八届三中全会首次提出“推进国家治理体系和治理能力现代化”,并将其作为全面深化改革的总目标。本文从国家治理理念的转变、国家治理现代化的核心内容和本质特征三个方面,阐释了在当代中国完善和发展中国特色社会主义制度,必须推进国家治理体系和治理能力现代化。  相似文献   
32.
针对电子对抗装备天线伺服系统驱动器可用度评估问题,考虑其具有优先使用权冷贮备冗余设计的特点,运用马尔可夫过程分析的方法,研究修理工人数不同情况下伺服驱动器稳态可用度和瞬时可用度,建立相应的数学模型,最后进行实例验证,绘出不同维修策略下系统瞬时可用度随时间变化的曲线.  相似文献   
33.
“国家审计免疫系统论”是新时期从战略的高度对审计本质所作出的精辟、简洁、鲜明的表述,体现了时代精神,揭示了中国审计的根本性质就是保护与防御。这一理论具有创新精神,它把审计上升到了国家安全的高度,其目的是为国家“强身健体”。正确认识“审计免疫系统论”的内涵、本质、功能,对于指导我国审计理论和审计工作发展具有重要的理论意义和实践意义。  相似文献   
34.
线性系统的鲁棒容错控制设计方法   总被引:1,自引:0,他引:1  
考虑了线性故障系统的鲁棒容错控制问题。利用状态反馈特征结构配置参数化结果,提出了一种鲁棒容错控制设计方法。该方法将故障系统的鲁棒容错控制问题转化为含有约束的最小化问题。数值算例及其仿真结果验证了所设计方法的简单性和有效性。  相似文献   
35.
Rendezvous search finds the strategies that players should use in order to find one another when they are separated in a region. Previous papers have concentrated on the case where there are two players searching for one another. This paper looks at the problem when there are more than two players and concentrates on what they should do if some but not all of them meet together. It looks at two strategies—the stick together one and the split up and meet again one. This paper shows that the former is optimal among the class of strategies which require no memory and are stationary, and it gives a method of calculating the expected rendezvous time under it. However, simulation results comparing both strategies suggest that in most situations the split up and meet again strategy which requires some memory leads to faster expected rendezvous times. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:710–721, 2001  相似文献   
36.
本文基于模糊理论,建立一种信号检测的模糊模型,并实际运用于连续波多普勒测速雷达目标速度的提取,取得了满意的结果  相似文献   
37.
    
This paper studies load balancing for many-server (N servers) systems. Each server has a buffer of size b ? 1, and can have at most one job in service and b ? 1 jobs in the buffer. The service time of a job follows the Coxian-2 distribution. We focus on steady-state performance of load balancing policies in the heavy traffic regime such that the normalized load of system is λ = 1 ? N?α for 0 < α < 0.5. We identify a set of policies that achieve asymptotic zero waiting. The set of policies include several classical policies such as join-the-shortest-queue (JSQ), join-the-idle-queue (JIQ), idle-one-first (I1F) and power-of-d-choices (Po d) with d = O(Nα log N). The proof of the main result is based on Stein's method and state space collapse. A key technical contribution of this paper is the iterative state space collapse approach that leads to a simple generator approximation when applying Stein's method.  相似文献   
38.
    
It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.  相似文献   
39.
Abstract

Libya in 2011 witnessed a real process of political change, though different from all the policy-oriented jargon equating transition with a teleological transition to democracy. Due to the resilience of the Qadhafi regime in power and with the essential role of NATO intervention, the process was eased out by a eight-month civil war. Governance in post-Qadhafi Libya was not done through the rebuilding of centralized authorities. But it took the specific form of the emergence of multiple non-state actors embedded in local dynamics and then connected with weakened central authorities that had access to the huge Libyan resources. That raised complex questions about the quality of this mode of governance, especially at a time of pressing problems for Libya and its neighbors, whether direct ones (Tunisia, Egypt, Mali) or farther countries across the Mediterranean sea: terrorism with the expansion of Da’esh into the country and flows of refugees crossing Libya’s uncontrolled borders and flowing into Italy and then Europe by thousands.  相似文献   
40.
空中进攻作战出动计划涉及多种复杂因素,大规模空中进攻作战出动计划不仅计算量大、出动强度高、架次多,而且当战场形势发生变化时,必须及时对飞机出动计划做出调整,采用手工方式制定和修改作战计划已难以适应未来空中进攻作战的要求。从分析制定空中进攻作战航空兵出动计划所涉及的诸要素出发,提出了一个较为合理的作战出动计划模型,并采用禁忌搜索求解模型的优良解,为实现计算机制定和及时修正空中进攻作战出动计划提出了一种有效的解决方法。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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