An assumption-free convergence analysis for a perturbation of the scaling algorithm for linear programs,with application to the L1 estimation problem

This article is concerned with the scaling variant of Karmarkar's algorithm for linear programming problems. Several researchers have presented convergence analyses for this algorithm under various nondegeneracy types of assumptions, or under assumptions regarding the nature of the sequence of iterates generated by the algorithm. By employing a slight perturbation of the algorithm, which is computationally imperceptible, we are able to prove without using any special assumptions that the algorithm converges finitely to an ε-optimal solution for any chosen ε > 0, from which it can be (polynomically) rounded to an optimum, for ε > 0 small enough. The logarithmic barrier function is used as a construct for this analysis. A rounding scheme which produces an optimal extreme point solution is also suggested. Besides the non-negatively constrained case, we also present a convergence analysis for the case of bounded variables. An application in statistics to the L₁ estimation problem and related computational results are presented.     

A general age replacement model with minimal repair

A general age replacement is introduced which incorporates minimal repair, planned and unplanned replacements, and costs which depend on time. Finite and infinite horizon results are obtained. Various special cases are considered. Furthermore, a shock model with general cost structure is considered.     

Estimation from binomial data with classifiers of known and unknown imperfections

Observations from inspection by a “test” method and a standard method are combined to provide estimators of population proportion, and of probabilities of misclassification for the test method. Results of Hochberg and Tenenbein [3] and of Albers and Veldman [1] are extended to the case where the standard method is not perfect, but its misclassification probabilities have known values. Both moment and maximum-likelihood estimators are considered and some asymptotic properties of the resulting estimators are compared.     

Approximating nonstationary two-priority non-preemptive queueing systems

An approximation for analyzing transient and nonstationary two-priority non-preemptive queueing systems is presented. This system has a three-dimensional state space, and through use of state-space partitioning in conjunction with use of conditional surrogate distributions with constant parameters an approximation is designed. Regardless of system capacity K, the approximation requires the numerical solution of only ten differential equations, compared to the K² + K+1 Kolmogorov-forward equations required for the classic solution. Time-dependent approximations of the mean number of entities of type i and of the probability of a type-i entity being in service are obtained. Empirical test results over a wide range of systems indicate the approximation is quite accurate.     

An (s,S) inventory system with rest periods to the server

We study the (s,S) inventory system in which the server takes a rest when the level of the inventory is zero. The demands are assumed to occur for one unit at a time. The interoccurrence times between successive demands, the lead times, and the rest times are assumed to follow general distributions which are mutually independent. Using renewal and convolution techniques we obtain the state transition probabilities.     

基于可能度的军品供应商选择方法研究

建立军品供应商的选择方法,是当前军事订货与采购制度改革亟需解决的一个重要问题。本文利用Fuzzy AHP制定了军品供应商的选择方法,并提出了一种新的基于中值点的可能度指标作为三角模糊数互补判断矩阵排序的依据。     

Another manifestation of cyber conflict: attaining military objectives through cyber avenues of approach

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.     

Multilateral defense cooperation in the Indo-Asia-Pacific region: Tentative steps toward a regional NATO?

Some U.S. military leaders have asserted that the United States, Japan, Australia, and India and the Republic of Korea are developing multilateral defense cooperation to deter aggression and uphold norms much like North Atlantic Treaty Organization (NATO) has in Europe. Frequent military exercises and China’s threats to freedom of navigation (FoN) and North Korea’s nuclear missiles comprise the motive force for such cooperation. However, cooperation thus far has been trilateral and minimal, given divergent national interests and dispersed geopolitical locations. Cooperation among Japan, Republic of Korea (ROK), and the United States is increasing given the threat, but ROK’s public opinion is divided about Japan. Australia, Japan, and India have increased cooperation with the United States but are reluctant to conduct FoN operations with the United States to challenge China’s expansionism in the South China Sea. If China becomes more aggressive and blocks FoN or seizes territory, development toward an Asian NATO is possible.