全文获取类型
收费全文 | 400篇 |
免费 | 22篇 |
出版年
2021年 | 11篇 |
2020年 | 6篇 |
2019年 | 10篇 |
2018年 | 6篇 |
2017年 | 7篇 |
2016年 | 10篇 |
2015年 | 11篇 |
2014年 | 8篇 |
2013年 | 59篇 |
2012年 | 4篇 |
2011年 | 8篇 |
2010年 | 5篇 |
2009年 | 9篇 |
2007年 | 10篇 |
2006年 | 4篇 |
2005年 | 6篇 |
2004年 | 11篇 |
2003年 | 7篇 |
2002年 | 10篇 |
2001年 | 8篇 |
2000年 | 6篇 |
1999年 | 14篇 |
1998年 | 7篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 11篇 |
1994年 | 6篇 |
1993年 | 5篇 |
1992年 | 11篇 |
1991年 | 12篇 |
1990年 | 6篇 |
1989年 | 8篇 |
1988年 | 9篇 |
1987年 | 11篇 |
1986年 | 9篇 |
1985年 | 3篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1981年 | 7篇 |
1980年 | 3篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1975年 | 3篇 |
1974年 | 5篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1971年 | 6篇 |
1969年 | 4篇 |
1968年 | 5篇 |
排序方式: 共有422条查询结果,搜索用时 31 毫秒
341.
Validation of a strategy for harbor defense based on the use of a min‐max algorithm receding horizon control law
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We present a validation of a centralized feedback control law for robotic or partially robotic water craft whose task is to defend a harbor from an intruding fleet of water craft. Our work was motivated by the need to provide harbor defenses against hostile, possibly suicidal intruders, preferably using unmanned craft to limit potential casualties. Our feedback control law is a sample‐data receding horizon control law, which requires the solution of a complex max‐min problem at the start of each sample time. In developing this control law, we had to deal with three challenges. The first was to develop a max‐min problem that captures realistically the nature of the defense‐intrusion game. The second was to ensure the solution of this max‐min problem can be accomplished in a small fraction of the sample time that would be needed to control a possibly fast moving craft. The third, to which this article is dedicated, was to validate the effectiveness of our control law first through computer simulations pitting a computer against a computer or a computer against a human, then through the use of model hovercraft in a laboratory, and finally on the Chesapeake Bay, using Yard Patrol boats. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 247–259, 2016 相似文献
342.
Pavel K. Baev 《Contemporary Security Policy》2016,37(1):89-110
High-level declarations in Moscow and Beijing on the steady progress in upgrading their strategic partnership depart increasingly far from the reality of shrinking economic ties and diverging political perspectives. In late 2014, the dynamic development of this partnership appeared to have the potential of becoming a major shift in the fluid security balance in the Asia-Pacific region; in late 2015, however, the concerned neighbours have more reasons to worry about the deformations in the development of Russia–China relations. President Vladimir Putin and President Xi Jinping are eager to demonstrate perfect personal rapport but their mutual trust is open to doubt and their views on priorities of domestic and international order are in fact strikingly dissimilar. The deep contraction of trade and the lack of interest from Chinese investors propels the Russian leadership towards increasing the emphasis on the security dimension of the partnership, and this makes Russia one of the key sources of instability in the Asia-Pacific region and a challenge to the East Asian peace. It is also entirely possible that the Russian challenge to the stability of the world system would result in strengthening of the key institutions of its governance, thus leaving the revisionist Russia in isolation. 相似文献
343.
The paper analyzes the effects of military spending on economic growth in a small open stochastic endogenous growth model involving the supply-side and demand-side effects produced by military spending. We show that a rise in the military spending affects economic growth through four channels, including the crowding-out effect, the spin-off effect, the resource mobilization effect, and the portfolio effect. The net effect which depends on these four channels is ambiguous. Hence, we demonstrate that there exists an optimal defense burden that maximizes the economic growth rate. 相似文献
344.
In this article we have generalized previous models on multiechelon recoverable inventory systems to cover the cases of batch ordering and shipment policy, and when items can either be repaired or condemned. The batch ordering and shipment policy is appropriate when the setup cost for shipment and order and/or the demand rates of the items are relatively high. The operating characteristics of such a system have been studied. Specifically, the probability distribution of backorder levels at the bases are analyzed for different repair-time distributions. An approximation scheme is proposed for this distribution, and is evaluated using extensive simulation results. The results indicate that the scheme is very effective in providing near-optimal stocking levels in such a system. 相似文献
345.
In this paper we study strategies for better utilizing the network capacity of Internet Service Providers (ISPs) when they are faced with stochastic and dynamic arrivals and departures of customers attempting to log‐on or log‐off, respectively. We propose a method in which, depending on the number of modems available, and the arrival and departure rates of different classes of customers, a decision is made whether to accept or reject a log‐on request. The problem is formulated as a continuous time Markov Decision Process for which optimal policies can be readily derived using techniques such as value iteration. This decision maximizes the discounted value to ISPs while improving service levels for higher class customers. The methodology is similar to yield management techniques successfully used in airlines, hotels, etc. However, there are sufficient differences, such as no predefined time horizon or reservations, that make this model interesting to pursue and challenging. This work was completed in collaboration with one of the largest ISPs in Connecticut. The problem is topical, and approaches such as those proposed here are sought by users. © 2001 John Wiley & Sons, Inc., Naval Research Logistics 48:348–362, 2001 相似文献
346.
We investigate the strategy of transshipments in a dynamic deterministic demand environment over a finite planning horizon. This is the first time that transshipments are examined in a dynamic or deterministic setting. We consider a system of two locations which replenish their stock from a single supplier, and where transshipments between the locations are possible. Our model includes fixed (possibly joint) and variable replenishment costs, fixed and variable transshipment costs, as well as holding costs for each location and transshipment costs between locations. The problem is to determine how much to replenish and how much to transship each period; thus this work can be viewed as a synthesis of transshipment problems in a static stochastic setting and multilocation dynamic deterministic lot sizing problems. We provide interesting structural properties of optimal policies which enhance our understanding of the important issues which motivate transshipments and allow us to develop an efficient polynomial time algorithm for obtaining the optimal strategy. By exploring the reasons for using transshipments, we enable practitioners to envision the sources of savings from using this strategy and therefore motivate them to incorporate it into their replenishment strategies. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:386–408, 2001 相似文献
347.
We apply the techniques of response surface methodology (RSM) to approximate the objective function of a two‐stage stochastic linear program with recourse. In particular, the objective function is estimated, in the region of optimality, by a quadratic function of the first‐stage decision variables. The resulting response surface can provide valuable modeling insight, such as directions of minimum and maximum sensitivity to changes in the first‐stage variables. Latin hypercube (LH) sampling is applied to reduce the variance of the recourse function point estimates that are used to construct the response surface. Empirical results show the value of the LH method by comparing it with strategies based on independent random numbers, common random numbers, and the Schruben‐Margolin assignment rule. In addition, variance reduction with LH sampling can be guaranteed for an important class of two‐stage problems which includes the classical capacity expansion model. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 753–776, 1999 相似文献
348.
We address the problem of inventory management in a two‐location inventory system, in which the transshipments are carried out as means of emergency or alternative supply after demand has been realized. This model differs from previous ones as regards its replenishment costs structure, in which nonnegligible fixed replenishment costs and a joint replenishment cost are considered. The single period planning horizon is analyzed, with the form and several properties of the optimal replenishment and transshipment policies developed, discussed and illustrated. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 525–547, 1999 相似文献
349.
The traditional approach to economic design of control charts is based on the assumption that a process is monitored using only a performance variable. If, however, the performance variable is costly to measure and a less expensive surrogate variable is available, the process may be more efficiently controlled by using both performance and surrogate variables. In this article we propose a model for economic design of a two-stage control chart which uses a highly correlated surrogate variable together with a performance variable. The process is assumed to be monitored by the surrogate variable until it signals out-of-control behavior, then by the performance variable until it signals out-of-control behavior or maintains in-control signals for a prespecified amount of time, and the two variables are used in alternating fashion. An algorithm based on the direct search method of Hooke and Jeeves [6] is used to find the optimum values of design parameters. The proposed model is applied to the end-closure welding process for nuclear fuel to compute the amount of reduction in cost compared with the current control procedure. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 958–977, 1999 相似文献
350.
Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph problem (MCG) is to find a connected subgraph with R vertices that maximizes the sum of their weights. MCG has applications to communication network design and facility expansion. The constrained MCG (CMCG) is MCG with a constraint that one predetermined vertex must be included in the solution. In this paper, we introduce a class of decomposition algorithms for MCG. These algorithms decompose MCG into a number of small CMCGs by adding vertices one at a time and building a partial graph. They differ in the ordering of adding vertices. Proving that finding an ordering that gives the minimum number of CMCGs is NP-complete, we present three heuristic algorithms. Experimental results show that these heuristics are very effective in reducing computation and that different orderings can significantly affect the number of CMCGs to be solved. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 817–837, 1998 相似文献