全文获取类型
收费全文 | 215篇 |
免费 | 9篇 |
出版年
2020年 | 2篇 |
2019年 | 9篇 |
2018年 | 11篇 |
2017年 | 10篇 |
2016年 | 7篇 |
2015年 | 7篇 |
2014年 | 9篇 |
2013年 | 53篇 |
2012年 | 4篇 |
2011年 | 3篇 |
2010年 | 2篇 |
2009年 | 8篇 |
2008年 | 2篇 |
2004年 | 2篇 |
2003年 | 6篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 4篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 5篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1986年 | 5篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 6篇 |
1973年 | 2篇 |
1972年 | 4篇 |
1971年 | 4篇 |
1970年 | 4篇 |
1969年 | 4篇 |
1968年 | 3篇 |
1966年 | 1篇 |
1948年 | 1篇 |
排序方式: 共有224条查询结果,搜索用时 140 毫秒
71.
72.
Gerhard Kümmel 《战略研究杂志》2013,36(2):7-28
The debate on the civil–military gap and especially the TISS findings are viewed with a focus on Germany. After outlining the historical development of civil–military relations, the question of a civil–military gap is explored with data from 2001. The study finds similarities and differences in the attitudes of the civilian and the military population on several issues. Overall, there is a broad overlap of attitudes, yet differences do exist, especially on issues of foreign policy and things military. It is argued that at the beginning of the twenty-first century, civil–military relations in Germany are largely uncontested, but will become more strained. 相似文献
73.
B.K. GREENER-BARCHAM 《Small Wars & Insurgencies》2013,24(1):90-112
Some scholars would have us believe that the distinctions between military and policing roles, methods and objectives have become increasingly blurred by the security demands of a post-Cold War and post-11 September global and domestic order. This article explores the current state of the police–military divide through a conceptual and case study analysis. It concludes that, in this case, there is some conflation occurring at a macro-level as international and domestic affairs have become increasingly indistinct, but the article also demonstrates that the actual ethos and practice of these agencies still differs strongly. Most importantly, the article argues that this distinction is in fact a very useful one in planning for future peace support operations 相似文献
74.
Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
75.
Bayes假设检验及样本数量问题研究 总被引:1,自引:0,他引:1
针对Bayes方法在工程实践中未能得到广泛应用的实际情况分析了Bayes方法存在的问题,以正态总体期望为背景研究并改进了Bayes方法,进一步推导了Bayes假设检验样本数量确定方法。 相似文献
76.
This study addresses the design of a three‐stage production/distribution system where the first stage includes the set of established retailers and the second and third stages include the sets of potential distribution centers (DCs) and potential capacitated suppliers, respectively. In this problem, in addition to the fixed location/operating costs associated with locating DCs and suppliers, we consider the coordinated inventory replenishment decisions at the located DCs and retailers along with the appropriate inventory costs explicitly. In particular, we account for the replenishment and holding costs at the retailers and selected DCs, and the fixed plus distance‐based transportation costs between the selected plants and their assigned DCs, and between the selected DCs and their respective retailers, explicitly. The resulting formulation is a challenging mixed‐integer nonlinear programming model for which we propose efficient heuristic solution approaches. Our computational results demonstrate the performance of the heuristic approaches as well as the value of integrated decision‐making by verifying that significant cost savings are realizable when the inventory decisions and costs are incorporated in the production distribution system design. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 172–195, 2012 相似文献
77.
采用MMW-1万能摩擦磨损试验机,考察了磨合预处理工况(时间、载荷)对两种有机钼添加剂在CF-4 15W-40柴油机油中抗磨减摩性能的影响。采用扫描电子显微镜和能谱仪分析了磨斑表面形貌和表面元素组成。结果表明,适当的磨合预处理可有效增强有机钼添加剂在柴油机油中的抗磨减摩性能,且经过磨合预处理的磨斑表面形貌较没有处理时平整,添加剂主要功能元素在摩擦表面的质量分数增加。 相似文献
78.
We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
79.
Gerald G. Brown Kelly J. Cormican Siriphong Lawphongpanich Daniel B. Widdis 《海军后勤学研究》1997,44(4):301-318
Submarine berthing plans reserve mooring locations for inbound U.S. Navy nuclear submarines prior to their port entrance. Once in port, submarines may be shifted to different berthing locations to allow them to better receive services they require or to make way for other shifted vessels. However, submarine berth shifting is expensive, labor intensive, and potentially hazardous. This article presents an optimization model for submarine berth planning and demonstrates it with Naval Submarine Base, San Diego. After a berthing plan has been approved and published, changed requests for services, delays, and early arrival of inbound submarines are routine events, requiring frequent revisions. To encourage trust in the planning process, the effect on the solution of revisions in the input is kept small by incorporating a persistence incentive in the optimization model. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 301–318, 1997. 相似文献
80.
Multiple-facility loading (MFL) involves the allocation of products among a set of finite-capacity facilities. Applications of MFL arise naturally in a variety of production scheduling environments. MFL models typically assume that capacity is consumed as a linear function of products assigned to a facility. Product similarities and differences, however, result in capacity-based economies or diseconomies of scope, and thus the effective capacity of the facility is often a (nonlinear) function of the set of tasks assigned to the facility. This article addresses the multiple-facility loading problem under capacity-based economies (and diseconomies) of scope (MFLS). We formulate MFLS as a nonlinear 0–1 mixed-integer programming problem, and we discuss some useful properties. MFLS generalizes many well-known combinatorial optimization problems, such as the capacitated facility location problem and the generalized assignment problem. We also define a tabu-search heuristic and a branch-and-bound algorithm for MFLS. The tabu-search heuristic alternates between two search phases, a regional search and a diversification search, and offers a novel approach to solution diversification. We also report computational experience with the procedures. In addition to demonstrating MFLS problem tractability, the computational results indicate that the heuristic is an effective tool for obtaining high-quality solutions to MFLS. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 229–256, 1997 相似文献