开放架构的数字视频管理系统iView研究与实现

iView是我们研制的基于多模态元数据提取,具有开放架构且支持无线移动存取的数字视频全内容管理系统。本文讨论了系统的需求,体系框架设计实现,描述了其中涉及的关键技术思想,并对存在的问题和研究方向做了简单探讨。     

On the busy period of the M/G/1 retrial queue

The M/G/1 queue with repeated attempts is considered. A customer who finds the server busy, leaves the service area and joins a pool of unsatisfied customers. Each customer in the pool repeats his demand after a random amount of time until he finds the server free. We focus on the busy period L of the M/G/1$ retrial queue. The structure of the busy period and its analysis in terms of Laplace transforms have been discussed by several authors. However, this solution has serious limitations in practice. For instance, we cannot compute the first moments of L by direct differentiation. This paper complements the existing work and provides a direct method of calculation for the second moment of L. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 115–127, 2000     

Bayesian testing strategies for software with an operational profile

We consider a software reliability model where the failure rate of each fault depends on the specific operation performed. The software is tested in a given sequence of test cases for fixed durations of time to collect data on failure times. We present a Bayesian analysis of software failure data by treating the initial number of faults as a random variable. Our analysis relies on the Markov Chain Monte Carlo methods and is used for developing optimal testing strategies in an adaptive manner. Two different models involving individual and common faults are analyzed. We illustrate an implementation of our approach by using some simulated failure data. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:747–763, 2001     

Class scheduling algorithms for Navy training schools

The problem of developing good schedules for Navy C-Schools has been modeled as a combinatorial optimization problem. The only complicating feature of the problem is that classes must be grouped together into sequences known as pipelines. An ideal schedule will have all classes in a pipeline scheduled in consecutive weeks. The objective is to eliminate the nonproductive time spent by sailors at C-Schools who are waiting for the next class in a pipeline. In this investigation an implicit enumeration procedure for this problem was developed. The key component of our algorithm is a specialized greedy algorithm which is used to obtain a good initial incumbent. Often this initial incumbent is either an optimal schedule or a near optimal schedule. In an empirical analysis with the only other competing software system, our greedy heuristic found equivalent or better solutions in substantially less computer time. This greedy heuristic was extended and modified for the A-School scheduling problem and was found to be superior to its only competitor. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 533–551, 1998     

A robust regression technique using compound estimation

Least squares fitting of regression models is a widely used technique. The presence of outliers in the data can have an adverse effect on the method of least squares, resulting in a model that does not adequately fit to the bulk of the data. For this situation, robust regression techniques have been proposed as an improvement to the method of least squares. We propose a robust regression procedure that performs well relative to the current robust methods against a variety of dataset types. Evaluations are performed using datasets without outliers (testing efficiency), with a large percentage of outliers (testing breakdown), and with high leverage outliers (testing bounded influence). The datasets are based on 2-level factorial designs that include axial points to evaluate leverage effects. A Monte Carlo simulation approach is used to evaluate the estimating capability of the proposed procedure relative to several competing methods. We also provide an application to estimating costs for government satellites. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 125–139, 1998     

Cost-based due-date assignment with the use of classical and neural-network approaches

Traditional methods of due-date assignment presented in the literature and used in practice generally assume cost-of-earliness and cost-of-tardiness functions that may bear little resemblance to true costs. For example, practitioners using ordinary least-squares (OLS) regression implicitly minimize a quadratic cost function symmetric about the due date, thereby assigning equal second-order costs to early completion and tardy behavior. In this article the consequences of such assumptions are pointed out, and a cost-based assignment scheme is suggested whereby the cost of early completion may differ in form and/or degree from the cost of tardiness. Two classical approaches (OLS regression and mathematical programming) as well as a neural-network methodology for solving this problem are developed and compared on three hypothetical shops using simulation techniques. It is found for the cases considered that: (a) implicitly ignoring cost-based assignments can be very costly; (b) simpler regression-based rules cited in the literature are very poor cost performers; (c) if the earliness and tardiness cost functions are both linear, linear programming and neural networks are the methodologies of choice; and (d) if the form of the earliness cost function differs from that of the tardiness cost function, neural networks are statistically superior performers. Finally, it is noted that neural networks can be used for a wide range of cost functions, whereas the other methodologies are significantly more restricted. © 1997 John Wiley & Sons, Inc.     

On the orbit characteristics of the M/G/ 1 retrial queue

In teletraffic applications of retrial queues only the service zone is observable. Another part of a retrial queue, the orbit, which represents the delay before repeated attempts to get service, cannot be observed. Thus, it is very important to get general results about behavior of the orbit. We investigate two characteristics of the orbit, namely, the orbit busy period and the orbit idle period, which seem to be very useful from this point of view. © 1996 John Wiley & Sons, Inc.     

Operating Costs of Aging Air Force Aircraft: Adjusting for Aggregate Budget Effects

The rate at which operating costs grow as aircraft age is important for setting operating budgets and for deciding when to replace aging systems. While studies using data from the 1990's typically found 1–3 percent real rates of growth in operating costs as aircraft age, studies using data from the 2000's found greater rates, for example in the 4–6 percent range. Growth in the total U.S. Air Force budget during the 2000s appears to explain much of the higher estimated annual growth rates in operating costs per flying hour beyond the growth rate intrinsic to the aging of the fleet.     

Repression Substitution: Shifting Human Rights Violations in Response to UN Naming and Shaming

Does the United Nations naming and shaming of specific violations of human rights decrease government repression? In this article, we argue that international shaming of specific human rights violations can weaken the target government, bringing new challenges and making the government cessation of repression less feasible. When international naming and shaming campaigns target specific repressive tactics, they increase the costs of some – but not all – means of repression. Using original data on naming and shaming by the United Nations Human Rights Council (HRC), we show that the shaming of one physical integrity violation is jointly associated with decreases in that violation and increases in other violations of human rights.