全文获取类型
| 收费全文 | 520篇 |
| 免费 | 0篇 |
专业分类
| 520篇 |
出版年
| 2021年 | 6篇 |
| 2019年 | 12篇 |
| 2018年 | 6篇 |
| 2017年 | 10篇 |
| 2016年 | 15篇 |
| 2015年 | 18篇 |
| 2014年 | 14篇 |
| 2013年 | 111篇 |
| 2012年 | 13篇 |
| 2011年 | 10篇 |
| 2010年 | 9篇 |
| 2009年 | 10篇 |
| 2008年 | 12篇 |
| 2007年 | 14篇 |
| 2006年 | 12篇 |
| 2005年 | 13篇 |
| 2004年 | 9篇 |
| 2003年 | 14篇 |
| 2002年 | 12篇 |
| 2001年 | 8篇 |
| 2000年 | 8篇 |
| 1999年 | 8篇 |
| 1997年 | 5篇 |
| 1996年 | 7篇 |
| 1994年 | 5篇 |
| 1993年 | 10篇 |
| 1992年 | 6篇 |
| 1991年 | 7篇 |
| 1989年 | 7篇 |
| 1988年 | 5篇 |
| 1987年 | 4篇 |
| 1986年 | 6篇 |
| 1985年 | 8篇 |
| 1984年 | 5篇 |
| 1983年 | 4篇 |
| 1982年 | 5篇 |
| 1981年 | 4篇 |
| 1980年 | 8篇 |
| 1979年 | 7篇 |
| 1978年 | 8篇 |
| 1976年 | 7篇 |
| 1975年 | 10篇 |
| 1974年 | 6篇 |
| 1973年 | 8篇 |
| 1972年 | 5篇 |
| 1971年 | 4篇 |
| 1970年 | 5篇 |
| 1969年 | 4篇 |
| 1968年 | 5篇 |
| 1967年 | 3篇 |
排序方式： 共有520条查询结果，搜索用时 0 毫秒
71.
Mean residual life is a useful dynamic characteristic to study reliability of a system. It has been widely considered in the literature not only for single unit systems but also for coherent systems. This article is concerned with the study of mean residual life for a coherent system that consists of multiple types of dependent components. In particular, the survival signature based generalized mixture representation is obtained for the survival function of a coherent system and it is used to evaluate the mean residual life function. Furthermore, two mean residual life functions under different conditional events on components’ lifetimes are also defined and studied. 相似文献
72.
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. 相似文献
73.
Kenton G. Fasana 《Defence Studies》2018,18(2):167-187
Cyberspace is an avenue of approach through which a military force can attain objectives of value. Through these cyber avenues of approach, military forces can engage, vet, organize, and direct human agents to accomplish specific activities. Although the objectives of these activities could differ from traditional military objectives, they still have military relevance. This particular manifestation of cyber conflict is neither a new domain of war nor something outside of warfare. Rather, it can be viewed as an emerging avenue of approach in the larger context of military operations, auguring benefits in the integration of cyber activities with operations. 相似文献
74.
We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation. 相似文献
75.
Christopher G. Pernin Angela O’Mahony Thomas S. Szayna Derek Eaton Katharina Ley Best Elizabeth Bodine-Baron 《Defense & Security Analysis》2017,33(3):209-222
US national security guidance, as well as the US Army’s operational experiences since 2001, emphasizes the importance of working closely with partner countries to achieve US strategic objectives. The US Army has introduced the global landpower network (GLN) concept as a means to integrate, sustain and advance the Army’s considerable ongoing efforts to meet US national security guidance. This study develops the GLN concept further, and addresses three questions. What benefits can the GLN provide the Army? What are the essential components of the GLN? What options exist for implementing the GLN concept? By developing the GLN concept, the Army has the opportunity to transition the GLN from an often ad hoc and reactive set of relationships to one that the Army more self-consciously prioritizes and leverages as a resource to meet US strategic objectives. 相似文献
76.
We study the supplier relationship choice for a buyer that invests in transferable capacity operated by a supplier. With a long‐term relationship, the buyer commits to source from a supplier over a long period of time. With a short‐term relationship, the buyer leaves open the option of switching to a new supplier in the future. The buyer has incomplete information about a supplies efficiency, and thus uses auctions to select suppliers and determine the contracts. In addition, the buyer faces uncertain demand for the product. A long‐term relationship may be beneficial for the buyer because it motivates more aggressive bidding at the beginning, resulting a lower initial price. A short‐term relationship may be advantageous because it allows switching, with capacity transfer at some cost, to a more efficient supplier in the future. We find that there exists a critical level of the switching cost above which a long‐term relationship is better for the buyer than a short‐term relationship. In addition, this critical switching cost decreases with demand uncertainty, implying a long‐term relationship is more favorable for a buyer facing volatile demand. Finally, we find that in a long‐term relationship, capacity can be either higher or lower than in a short‐term relationship. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
77.
The client‐contractor bargaining problem addressed here is in the context of a multi‐mode resource constrained project scheduling problem with discounted cash flows, which is formulated as a progress payments model. In this model, the contractor receives payments from the client at predetermined regular time intervals. The last payment is paid at the first predetermined payment point right after project completion. The second payment model considered in this paper is the one with payments at activity completions. The project is represented on an Activity‐on‐Node (AON) project network. Activity durations are assumed to be deterministic. The project duration is bounded from above by a deadline imposed by the client, which constitutes a hard constraint. The bargaining objective is to maximize the bargaining objective function comprised of the objectives of both the client and the contractor. The bargaining objective function is expected to reflect the two‐party nature of the problem environment and seeks a compromise between the client and the contractor. The bargaining power concept is introduced into the problem by the bargaining power weights used in the bargaining objective function. Simulated annealing algorithm and genetic algorithm approaches are proposed as solution procedures. The proposed solution methods are tested with respect to solution quality and solution times. Sensitivity analyses are conducted among different parameters used in the model, namely the profit margin, the discount rate, and the bargaining power weights. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
78.
An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
79.
We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
80.
We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献