FOOD AID

Abstract

This paper seeks to critically appraise Africa's position within the United Nations Security Council from the inception of the UN in 1945 until the end of 2010, spanning the entire history of the world body. A few factors make such an appraisal a useful exercise. These include the ongoing debates about the reform of the Council in particular and the UN as a whole, and the growing interest that many African students and observers of and actors in international relations seem to have developed in recent years in the working of the world body. In this appraisal, emphasis will be placed on the origin and rationale behind the establishment of the Security Council as well as the use of the veto power by its permanent members, with a special reference to Africa.     

TWENTY YEARS OF CYBERWAR

For many years after its introduction in the early 1990s, the cyberwar concept - which outlined a new mode of conflict that would emphasize disruption of information systems and flows - was given little credence. Over the past several years, however, cyberwars of both irregular and somewhat more conventional types have erupted (e.g., see respectively Estonia in 2007 and Georgia in 2008). Global awareness of cyberwar has risen sharply, and many nation-states are preparing their defenses, as well as their capabilities for mounting offensive operations. The American military's declaration in 2011 that cyberspace is a 'warfighting domain' highlights a need to explore the ethical implications and nuances of cyberwar. This article finds that classic jus ad bellum constructs come under great pressure from cyberwar, while jus in bello concerns may prove more manageable. Another key theme is that disproportionate attention is given to the notion of employing cyberwar 'strategically' (i.e., to strike directly at other nations' infrastructures), where its use is less likely to achieve 'victory' and is more problematic ethically. Instead, a focus on the application of cyberwar techniques in battle may lead to shorter, less bloody, 'more ethical' conflicts.     

OTHER-THAN-INTERNET (OTI) CYBERWARFARE: CHALLENGES FOR ETHICS,LAW, AND POLICY

Almost all discussions of cyberwarfare, other cyber-attacks, and cyber-espionage have focused entirely on the Internet as the chief means of damage – the Internet as a ‘vector,’ using a term from the theory of infectious diseases. However there are a variety of means, some of which have already been used, that involve cyber-exploitation using vectors other than the Internet. Malware can be installed in the integrated circuits of computers and servers, but also in any devices attached to them – thumb drives, CDs, printers, scanners, and so on. One can also use various forms of electromagnetic radiation at a distance of meters or more to exfiltrate data or to infiltrate corrupt data. I call this large and diverse family of unwanted interference with the functioning of information processing systems other-than-Internet (OTI) attacks on information systems. Stuxnet, and probably the 2007 Israeli corruption of Syrian air defenses, were OTI attacks. Such OTI techniques are more difficult to develop than creating malware, requiring electronic manufacturing facilities or novel technologies, and are thus accessible only to larger corporations and technologically sophisticated countries. Particularly vulnerable would be countries (like the United States and Europe) whose information processing devices are mainly produced outside of the country. Once exploitations via the Internet become harder to perpetrate, OTI exploitations are certain to grow dramatically, eventually requiring equipment for critical uses to be expensively fabricated in (and transported using) secure facilities; expensive detection measures will have to be instituted. This will create challenges for policy, law, and ethics, as well as greatly increasing the cost of many electronic devices.     

Evaluating appointment postponement in scheduling patients at a diagnostic clinic

Diagnostic clinics are among healthcare facilities that suffer from long waiting times which can worsen medical outcomes and increase patient no-shows. Reducing waiting times without significant capital investments is a challenging task. We tackle this challenge by proposing a new appointment scheduling policy that does not require significant investments for diagnostic clinics. The clinic in our study serves outpatients, inpatients, and emergency patients. Emergency patients must be seen on arrival, and inpatients must be given next day appointments. Outpatients, however, can be given later appointments. The proposed policy takes advantage of this by allowing the postponement of the acceptance of appointment requests from outpatients. The appointment scheduling process is modeled as a two-stage stochastic programming problem where a portion of the clinic capacity is allocated to inpatients and emergency patients in the first stage. In the second stage, outpatients are scheduled based on their priority classes. After a detailed analysis of the solutions obtained from the two-stage stochastic model, we develop a simple, non-anticipative policy for patient scheduling. We evaluate the performance of this proposed, easy-to-implement policy in a simulation study which shows significant improvements in outpatient indirect waiting times.     

Deterrence and overseas stability

The use of conventional armed forces in a deterrent role merits close consideration. Instability in weak or failing states can have global ramifications, while efforts to build stability take time. In principle, conventional deterrence can be used to buy the time required for such stabilization efforts. Attempts at deterrence will, however, need to overcome credibility problems stemming from the technical limitations associated with conventional armed forces, and with the likely requirement for multiple external actors to deter multiple intrastate audiences. While deterrence might work under certain circumstances, it will not play as central a role in strategy as it did during the Cold War.     

On optimal system designs in reliability‐economics frameworks

Reliability Economics is a field that can be defined as the collection of all problems in which there is tension between the performance of systems of interest and their cost. Given such a problem, the aim is to resolve the tension through an optimization process that identifies the system which maximizes some appropriate criterion function (e.g. expected lifetime per unit cost). In this paper, we focus on coherent systems of n independent and identically distributed (iid) components and mixtures thereof, and characterize both a system's performance and cost as functions of the system's signature vector (Samaniego, IEEE Trans Reliabil (1985) 69–72). For a given family of criterion functions, a variety of optimality results are obtained for systems of arbitrary order n. Approximations are developed and justified when the underlying component distribution is unknown. Assuming the availability of an auxiliary sample of N component failure times, the asymptotic theory of L‐estimators is adapted for the purpose of establishing the consistency and asymptotic normality of the proposed estimators of the expected ordered failure times of the n components of the systems under study. These results lead to the identification of ε‐optimal systems relative to the chosen criterion function. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Exact expected values of variance estimators for simulation

We formulate exact expressions for the expected values of selected estimators of the variance parameter (that is, the sum of covariances at all lags) of a steady‐state simulation output process. Given in terms of the autocovariance function of the process, these expressions are derived for variance estimators based on the simulation analysis methods of nonoverlapping batch means, overlapping batch means, and standardized time series. Comparing estimator performance in a first‐order autoregressive process and the M/M/1 queue‐waiting‐time process, we find that certain standardized time series estimators outperform their competitors as the sample size becomes large. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Pricing bridges to cross a river

We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007