Motivated by the problems encountered in the operation of the front end of a grocery store, a queuing model is formulated for a variable channel queuing system. A cost structure is superimposed over the queuing model and after examining the customer jockeying properties of the system, an optimal operating policy is generated. The practical aspects of the generation and implementation of an opti...

Brewer and Nash, and immediately updated by this author, introduced Chinese Wall security policy models for commercial security. Applying Pawlak's idea of conflict analysis, this paper introduced a practical way of computing an extended model.

At the 1993 ACSAC conference a previous paper was presented describing the security policy developed for a large, integrated defence procurement, the United Kingdom Royal Air Force Logistics Information Technology System (LITS). The current paper describes some of the practical difficulties encountered in implementing that security policy during subsequent stages of the LITS system development....

In this chapter we discuss inventory systems where several demand classes may be distinguished. In particular, we focus on single-location inventory systems and we analyse the use of a so-called critical level policy. With this policy some inventory is reserved for high-priority demand. A number of practical examples where several demand classes naturally arise are presented, and the implicatio...

We consider the challenging practical problem of optimizing the power production of a complex of hydroelectric power plants, which involves control over three continuous action variables, uncertainty in the amount of water inflows and a variety of constraints that need to be satisfied. We propose a policy-search-based approach coupled with predictive modelling to address this problem. This appr...

Motivated by practical applications, chiefly clinical trials, we study the regret achievable for stochastic bandits under the constraint that the employed policy must split trials into a small number of batches. We propose a simple policy that operates under this contraint and show that a very small number of batches gives close to minimax optimal regret bounds. As a byproduct, we derive optima...

Recent work on complexity theory has significant implications for our conceptions of the nature of social systems and for ideas about how we can gain an understanding and achieve beneficial change of such systems. This paper seeks to identify some of the key implications for our thinking about the role, purpose and practice of evaluation of policy initiatives in complex, dynamic social systems,...

External pressures could be a powerful force that drives the institution of higher education to attain information security policy compliance. Drawing on the Neo-Institutional Theory (NIT), this study examined how the three external expectations: regulative, normative, and cognitive expectations, impel the higher education of the United States to reach information security policy compliance. Th...

Stochastic Constraint Programming is an extension of Constraint Programming for modelling and solving combinatorial problems involving uncertainty. A solution to such a problem is a policy tree that specifies decision variable assignments in each scenario. Several solution methods have been proposed but none seems practical for large multi-stage problems. We propose an incomplete approach: spec...

This article argues that the debate concerning the theoretical characterization of the policy requirement as either an element of crime or an evidentiary relevant circumstance for crimes against humanity is deficient. Comparative case law analysis illustrates that this characterization does not fundamentally affect the position, meaning and scope of the policy underlying crimes against humanity...