全文获取类型
| 收费全文 | 948篇 |
| 免费 | 27篇 |
| 国内免费 | 7篇 |
专业分类
| 982篇 |
出版年
| 2025年 | 6篇 |
| 2024年 | 11篇 |
| 2023年 | 13篇 |
| 2022年 | 10篇 |
| 2021年 | 19篇 |
| 2020年 | 21篇 |
| 2019年 | 17篇 |
| 2018年 | 15篇 |
| 2017年 | 32篇 |
| 2016年 | 42篇 |
| 2015年 | 33篇 |
| 2014年 | 55篇 |
| 2013年 | 62篇 |
| 2012年 | 62篇 |
| 2011年 | 64篇 |
| 2010年 | 37篇 |
| 2009年 | 67篇 |
| 2008年 | 33篇 |
| 2007年 | 45篇 |
| 2006年 | 65篇 |
| 2005年 | 55篇 |
| 2004年 | 42篇 |
| 2003年 | 32篇 |
| 2002年 | 16篇 |
| 2001年 | 22篇 |
| 2000年 | 27篇 |
| 1999年 | 13篇 |
| 1998年 | 16篇 |
| 1997年 | 5篇 |
| 1996年 | 7篇 |
| 1995年 | 8篇 |
| 1994年 | 4篇 |
| 1993年 | 3篇 |
| 1992年 | 2篇 |
| 1991年 | 9篇 |
| 1990年 | 10篇 |
| 1989年 | 2篇 |
排序方式： 共有982条查询结果，搜索用时 0 毫秒
941.
对模糊多目标群决策的装备采办问题,根据模糊数学理论和多目标决策理论方法,综合现有各种方法的优点,给出了无约束条件下模糊多目标群决策的装备采办问题的一般解法,并通过实例说明了该方法的有效性及通用性。 相似文献
942.
J. Thomas Moriarty 《Small Wars & Insurgencies》2013,24(3):476-497
The purpose of this paper is to provide a better conceptualization of insurgent strategies. Specifically, I shall examine Che Guevara's ‘Foco’ theory of insurgency, as it is one of the most theoretically popular and most pervasive strategies of insurgency currently practiced throughout the world. After briefly examining the origins, objectives, and theoretical strengths of the Foco theory (also known as the Vanguard Theory), I will argue that Guevara's theory suffers from an internal tension that I term the ‘Vanguard's Dilemma’. The significance of this dilemma creates a tension within the Vanguard Theory that can be fatal for insurgents if properly exploited by counterinsurgent operations. This paper will examine in detail this dilemma and show how it can be exploited. Given that several insurgent groups within Iraq and Afghanistan currently adhere to the Vanguard Theory of insurgency, a proper understanding of this insurgent strategy is an essential first step in the long road towards confronting and winning asymmetrical conflicts. 相似文献
943.
潘学萍 《武警工程学院学报》2013,(5):93-95
当前,军队院校的政治理论课教学,以教员课堂讲授为主,重课堂理论教学、轻社会实践锻炼的现象比较严重。这种传统的教学模式不利于创新型人才培养和教育转型的需要。政治理论课必须向基地教学延伸。 相似文献
944.
The purpose of this paper is to investigate the problem of constructing an appointment template for scheduling patients at a specific type of multidisciplinary outpatient clinic called an integrated practice unit (IPU). The focus is on developing and solving a stochastic optimization model for a back pain IPU in the face of random arrivals, an uncertain patient mix, and variable service times. The deterministic version of the problem is modeled as a mixed integer program with the objective of minimizing a weighted combination of clinic closing time (duration) and total patient waiting time (length of stay). A two‐stage stochastic program is then derived to account for the randomness and the sequential nature of the decisions. Although it was not possible to solve the two‐stage problem for even a limited number of scenarios, the wait‐and‐see (WS) problem was sufficiently tractable to provide a lower bound on the stochastic solution. The introduction of valid inequalities, limiting indices, and the use of special ordered sets helped to speed up the computations. A greedy heuristic was also developed to obtain solutions much more quickly. Out of practical considerations, it was necessary to develop appointment templates with time slots at fixed intervals, which are not available from the WS solution. The first to be derived was the expected value (EV) template that is used to find the expected value of the EV solution (EEV). This solution provides an upper bound on the objective function value of the two‐stage stochastic program. The average gap between the EEV and WS solutions was 18%. Results from extensive computational testing are presented for the EV template and for our adaptation of three other templates found in the literature. Depending on the relative importance of the two objective function metrics, the results demonstrate the trade‐off that exists between them. For the templates investigated, the “closing time” ranged from an average of 235 to 275 minutes for a 300‐minute session, while the corresponding “total patient time in clinic” ranged from 80 to 71 minutes. 相似文献
945.
Jovana Davidovic 《Journal of Military Ethics》2019,18(4):269-286
ABSTRACTThe legal equality of combatants (LEC) is a fixture of international law and just war theory. Both scholars who embrace and those who reject the moral equality of combatants seem committed to the legal equality of combatants. Their reasons usually include pragmatic worries about unjust combatants committing even more harm if they were to be simply prohibited from fighting. In this article I argue that this sweeping commitment to the legal equality of combatants is mistaken and that it is often grounded in a misunderstanding of the way international law governs behavior. 相似文献
946.
Philipp Münch 《Small Wars & Insurgencies》2018,29(4):709-734
Ethnicity and ideology are frequently used to determine whether an armed group is hostile or friendly vis-à-vis the state. By contrast, I argue that the social structure of insurgent movements holds more explanatory power for their respective positions than ethnicity or ideology. To illustrate this, I apply Pierre Bourdieu’s concept of a contest between forces of ‘conservation’ and forces of ‘heresy’ to the current Afghanistan war. I demonstrate that the social structure of the Taleban renders them prone to ‘heresy’, while the formerly second biggest insurgent group, Gulbuddin Hekmatyar’s party, has rather been an impeded force of ‘conservation.’ 相似文献
947.
948.
以多个地基雷达协同探测空间目标为背景,针对传统以整个可探测弧段为决策变量的协同规划方法存在的探测效率不高问题,建立了多传感器协同探测调度模型,提出了一种能够同时确定探测弧段和探测起始时间的自适应免疫遗传算法。考虑空间目标属性、类型、发射时间、雷达散射面积等级、用途等多种因素,构建了多层次模糊综合评价模型,并运用1-9标度法得到空间目标的优先级。以优先级最大化为目标,考虑探测时长、传感器容量等约束条件,采用自适应免疫遗传算法求解,并从探测资源消耗率和任务完成率两方面对规划方法性能进行评价。与改进的启发式算法以及传统进化算法的对比仿真表明,所提算法能够在提高任务完成率的同时降低资源消耗率。 相似文献
949.
针对工作流作业调度问题,提出使用关键路径法进行工作流的执行时间预测和资源分配。工作流执行时间预测算法使用并行应用有向无环图描述工作流中子作业的执行顺序。基于此顺序,为子作业进行系统资源的逻辑分配。根据子作业的特征和资源分配信息,使用梯度提升决策树进行子作业执行时间预测,并计算工作流的关键路径。关键路径上所有子作业的完成时间之和即为工作流的执行时间。若预测的工作流执行时间满足用户要求,则根据子作业执行顺序和资源分配方案进行作业调度,执行工作流。对比实验表明,两个工作流的执行时间预测误差分别为5.72%和1.57%。与Spark默认调度算法相比,工作流调度算法将两个工作流的完成时间分别缩短了15.71%和15.44%。 相似文献
950.