全文获取类型
收费全文 | 295篇 |
免费 | 8篇 |
出版年
2021年 | 5篇 |
2019年 | 10篇 |
2018年 | 6篇 |
2017年 | 10篇 |
2016年 | 7篇 |
2014年 | 7篇 |
2013年 | 46篇 |
2011年 | 3篇 |
2010年 | 5篇 |
2009年 | 5篇 |
2008年 | 3篇 |
2006年 | 5篇 |
2005年 | 4篇 |
2004年 | 6篇 |
2003年 | 3篇 |
2002年 | 10篇 |
2001年 | 4篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1998年 | 4篇 |
1997年 | 5篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1993年 | 11篇 |
1992年 | 4篇 |
1991年 | 6篇 |
1989年 | 4篇 |
1988年 | 13篇 |
1987年 | 3篇 |
1986年 | 6篇 |
1985年 | 11篇 |
1984年 | 8篇 |
1983年 | 4篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 7篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 8篇 |
1973年 | 3篇 |
1972年 | 2篇 |
1971年 | 10篇 |
1970年 | 3篇 |
1969年 | 5篇 |
1968年 | 2篇 |
1967年 | 2篇 |
排序方式: 共有303条查询结果,搜索用时 15 毫秒
31.
We consider the integrated problem of optimally maintaining an imperfect, deteriorating sensor and the safety‐critical system it monitors. The sensor's costless observations of the binary state of the system become less informative over time. A costly full inspection may be conducted to perfectly discern the state of the system, after which the system is replaced if it is in the out‐of‐control state. In addition, a full inspection provides the opportunity to replace the sensor. We formulate the problem of adaptively scheduling full inspections and sensor replacements using a partially observable Markov decision process (POMDP) model. The objective is to minimize the total expected discounted costs associated with system operation, full inspection, system replacement, and sensor replacement. We show that the optimal policy has a threshold structure and demonstrate the value of coordinating system and sensor maintenance via numerical examples. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 399–417, 2017 相似文献
32.
Joseph O. Chapa 《Journal of Military Ethics》2017,16(3-4):256-271
In this paper I argue that a remotely piloted aircraft (RPA) pilot’s act of killing remotely, when it is done in the defense of another person, can be viewed as an act of sacrifice. This argument concludes from two premises. First, the RPA pilot faces psychological risk to self by carrying out such an action; second, the RPA pilot is motivated to some significant degree by something other than self-interest. Moreover, I challenge both the view that RPA represent merely an incremental development in technology yielding an incremental expansion of the distance between the war-fighter and the target and the view that RPA is revolutionary in some fundamental sense. I instead argue that, based upon the natural geometric boundary imposed by the earth’s shape, RPA have maximized the physical distance between the war-fighter and the target and, over time, this fact will change, not only the psychological effects on the RPA pilot, but also the way we view killing and distance in general. When taken together, these two broad claims, that other-defense can justify killing in war and that there is a psychological cost paid by remote killers, yield a conception of remote killing as an act of sacrifice that will inform the broader conversation about ethics, risk, killing, and RPA. 相似文献
33.
The correlated improvement in yield and reliability has been observed in the case studies on integrated circuits and electronic assemblies. This paper presents a model that incorporates yield and reliability with the addition of a burn‐in step to explain their correlated improvement. The proposed model includes as special cases several yield and reliability models that have been previously published and thus provides a unifying framework. The model is used to derive a condition for which yield functions can be multiplied to obtain the overall yield. Yield and reliability are compared as a function of operation time, and an analytical condition for burn‐in to be effective is also obtained. Finally, Poisson and negative binomial defects models are further considered to investigate how reliability is based on yield. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
34.
This paper studies capacity expansions for a production facility that faces uncertain customer demand for a single product family. The capacity of the facility is modeled in three tiers, as follows. The first tier consists of a set of upper bounds on production that correspond to different resource types (e.g., machine types, categories of manpower, etc.). These upper bounds are augmented in increments of fixed size (e.g., by purchasing machines of standard types). There is a second‐tier resource that constrains the first‐tier bounds (e.g., clean room floor space). The third‐tier resource bounds the availability of the second‐tier resource (e.g., the total floor space enclosed by the building, land, etc.). The second and third‐tier resources are expanded at various times in various amounts. The cost of capacity expansion at each tier has both fixed and proportional elements. The lost sales cost is used as a measure for the level of customer service. The paper presents a polynomial time algorithm (FIFEX) to minimize the total cost by computing optimal expansion times and amounts for all three types of capacity jointly. It accommodates positive lead times for each type. Demand is assumed to be nondecreasing in a “weak” sense. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
35.
In many location problems, the solution is constrained to lie within a closed set. In this paper, optimal solutions to a special type of constrained location problem are characterized. In particular, the location problem with the solution constrained to be within a maximum distance of each demand point is considered, and an algorithm for its solution is developed and discussed. 相似文献
36.
Let X1 < X2 <… < Xn denote an ordered sample of size n from a Weibull population with cdf F(x) = 1 - exp (?xp), x > 0. Formulae for computing Cov (Xi, Xj) are well known, but they are difficult to use in practice. A simple approximation to Cov(Xi, Xj) is presented here, and its accuracy is discussed. 相似文献
37.
Computerized Scheduling of Seagoing Tankers The tanker scheduling problem considered in this paper is that of the Defense Fuel Supply Center (DFSC) and the Military Sealift Command (MSC) in the worldwide distribution of bulk petroleum products. Routes and cargoes which meet delivery schedule dates for a multiplicity of product requirements at minimum cost are to be determined for a fleet of tankers. A general mathematical programming model is presented, and then a mixed integer model is developed which attempts to reflect the true scheduling task of DFSC and MSC as closely as possible. The problem is kept to within a workable size by the systematic construction of a set of tanker routes which does not contain many possible routes that can be judged unacceptable from practical considerations alone. 相似文献
38.
This paper considers the problem of computing optimal ordering policies for a product that has a life of exactly two periods when demand is random. Initially costs are charged against runouts (stockouts) and outdating (perishing). By charging outdating costs according to the expected amount of outdating one period into the future, a feasible one period model is constructed. The central theorem deals with the n-stage dynamic problem and demonstrates the appropriate cost functions are convex in the decision variable and also provides bounds on certain derivatives. The model is then generalized to include ordering and holding costs. The paper is concluded with a discussion of the infinite horizon problem. 相似文献
39.
Fractional fixed-charge problems arise in numerous applications, where the measure of economic performance is the time rate of earnings or profit (equivalent to an interest rate on capital investment). This paper treats the fractional objective function, after suitable transformation, as a linear parametric fixed-charge problem. It is proved, with wider generality than in the case of Hirsch and Dantzig, that some optimal solution to the generalized linear fixed-charge problem is an extreme point of the polyhedral set defined by the constraints. Furthermore, it is shown that the optimum of the generalized fractional fixed-charge problem is also a vertex of this set. The proof utilizes a suitable penalty function yielding an upper bound on the optimal value of the objective function; this is particularly useful when considering combinations of independent transportation-type networks. Finally, it is shown that the solution of a fractional fixed-charge problem is obtainable through that of a certain linear fixed-charge one. 相似文献
40.
This article is concerned with the optimal location of any number (n) of facilities in relation to any number (m) of destinations on the Euclidean plane. The criterion to be satisfied is the minimization of total weighted distances where the distances are rectangular. The destinations may be either single points, lines or rectangular areas. A gradient reduction solution procedure is described which has the property that the direction of descent is determined by the geometrical properties of the problem. 相似文献