首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   282篇
  免费   5篇
  2021年   2篇
  2020年   3篇
  2019年   5篇
  2018年   4篇
  2017年   7篇
  2016年   7篇
  2015年   6篇
  2013年   58篇
  2011年   4篇
  2009年   6篇
  2008年   4篇
  2007年   2篇
  2006年   3篇
  2005年   7篇
  2004年   7篇
  2003年   4篇
  2002年   2篇
  2000年   3篇
  1999年   4篇
  1998年   2篇
  1997年   2篇
  1996年   8篇
  1995年   3篇
  1994年   7篇
  1993年   3篇
  1992年   5篇
  1991年   12篇
  1989年   5篇
  1987年   3篇
  1986年   9篇
  1985年   12篇
  1984年   3篇
  1983年   3篇
  1980年   3篇
  1979年   3篇
  1978年   3篇
  1977年   5篇
  1976年   4篇
  1975年   1篇
  1974年   5篇
  1973年   2篇
  1972年   8篇
  1971年   5篇
  1970年   8篇
  1969年   4篇
  1968年   4篇
  1967年   5篇
  1966年   3篇
  1949年   1篇
  1948年   1篇
排序方式: 共有287条查询结果,搜索用时 265 毫秒
251.
252.
ABSTRACT

This paper challenges recent claims that competitive market dynamics incentivize Private Military and Security Companies (PMSCs) to fully commit to providing effective services, thereby reducing the duration of civil war. Our assessment of a most-likely case scenario for this argument – Sierra Leone – reveals four critical problems. First, there is rarely direct competition, even if numerous companies are present. Second, the presence of multiple PMSCs usually represents a collaboration among subsidiaries providing distinct services, often under the same corporate umbrella. Third, data aggregation obfuscates the overlap of PMSC presence, inflating the amount of perceived competition. Finally, we raise concerns regarding how quantitative analyses can conflate conflict intensity with conflict termination.  相似文献   
253.
Advances in the study of civil war have led to the proliferation of event count data, and to a corresponding increase in the use of (zero-inflated) count models for the quantitative analysis of civil conflict events. Our ability to effectively use these techniques is met with two current limitations. First, researchers do not yet have a definitive answer as to whether zero-inflated count models are a verifiably better approach to civil conflict modeling than are ‘less assuming’ approaches such as negative binomial count models. Second, the accurate analysis of conflict-event counts with count models – zero-inflated or otherwise – is severely limited by the absence of an effective framework for the evaluation of predictive accuracy, which is an empirical approach that is of increasing importance to conflict modelers. This article rectifies both of these deficiencies. Specifically, this study presents count forecasting techniques for the evaluation and comparison of count models' predictive accuracies. Using these techniques alongside out-of-sample forecasts, it then definitively verifies – for the first time – that zero-inflated count models are superior to comparable non-inflated models for the study of intrastate conflict events.  相似文献   
254.
The issue that this paper tackles is the assessment of the relative security benefits that Cyprus and Greece derive in the context of their cooperation on defence matters. This form of cooperation, known as the ‘Integrated Defence Space Doctrine’, aims at defending their interests in the Aegean Sea and the broader East Mediterranean theatre. The paper relies heavily on earlier research on this topic, which deals with the Greek–Cypriot alliance facing an arms race against Turkey, and uses a coefficient especially designed to assess the optimal levels of security and the associated defence expenditure of the two allies. A comparison of the relative security coefficient values for the two allies suggests that the security benefit that Greece derives thanks to its alliance with Cyprus exceeds the corresponding Cypriot benefit by far. Given the importance assigned to human resources by this index, in conjunction with the demographic problems of Greece, this conclusion justifies the recent Greek defence policy revision, emphasizing quality, capital equipment and flexibility of forces. This revision aims at satisfying the security requirements of the alliance and the increasing demands of an arms race against Turkey.  相似文献   
255.
Guinea-Bissau's transition toward democracy has been violent and disruptive. Despite holding elections and attempts to promote economic and social development, the latest government, under President Yala, is not equipped to bring stability or even a more democratic state. A politicised military, inexperienced opposition and corrupt government officials have contributed to the current poverty and instability. Although unlikely to be deposed by the fragmented opposition, Yala is not secure within his own party and is likely to use his position to weaken his opponents. As a Catholic, Yala has been careful to avoid religious conflict by reassuring Muslim citizens that they will not be marginalised. The economy is precarious and poverty has not been addressed. Guinea-Bissau is dependent on foreign donors for its financial needs. Guinea-Bissau has begun military operations against rebels opposing the Senegalese government and the battles seem likely to continue to cause regional instability. Without external intervention political and economic development looks remote.  相似文献   
256.
257.
258.
Resource-constrained project scheduling with cash flows occurs in many settings, ranging from research and development to commercial and residential construction. Although efforts have been made to develop efficient optimal procedures to maximize the net present value of cash flows for resource-constrained projects, the inherent intractability of the problem has led to the development of a variety of heuristic methods to aid in the development of near-optimal schedules for large projects. This research focuses on the use of insights gained from the solution of a relaxed optimization model in developing heuristic procedures to schedule projects with multiple constrained resources. It is shown that a heuristic procedure with embedded priority rules that uses information from the revised solution of a relaxed optimization model increases project net present value. The heuristic procedure and nine different embedded priority rules are tested in a variety of project environments that account for different network structures, levels of resource constrainedness, and cash-flow parameters. Extensive testing with problems ranging in size from 21 to 1000 activities shows that the new heuristic procedures dominate heuristics using information from the critical path method (CPM), and in most cases outperform heuristics from previous research. The best performing heuristic rules classify activities into priority and secondary queues according to whether they lead to immediate progress payments, thus front loading the project schedule. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 365–381, 1997  相似文献   
259.
Previous studies criticize the general use of the normal approximation of lead-time demand on the grounds that it can lead to serious errors in safety stock. We reexamine this issue for the distribution of fast-moving finished goods. We first determine the optimal reorder points and quantities by using the classical normal-approximation method and a theoretically correct procedure. We then evaluate the misspecification error of the normal approximation solution with respect to safety stock, logistics-system costs, total costs (logistics costs, including acquisition costs), and fill rates. The results provide evidence that the normal approximation is robust with respect to both cost and service for seven major industry groups. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 165–186, 1997  相似文献   
260.
We consider a routing problem where the objective is to maximize the sum of the rewards collected at the nodes visited. Node rewards are decreasing linear functions of time. Time is spent when traveling between pairs of nodes, and while visiting the nodes. We propose a penalty-based greedy (heuristic) algorithm and a branch-and-bound (optimal) algorithm for this problem. The heuristic is very effective in obtaining good solutions. We can solve problems with up to 20 nodes optimally on a microcomputer using the branch-and-bound algorithm. We report our computational experience with this problem. © 1996 John Wiley & Sons, Inc.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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