Reliability, Availability, Dependability and Performability: A User-centered View

Reliability and availability have long been considered twin system properties that could be enhanced by distribution. Paradoxically, the traditional definitions of these properties do not recognize the positive impact of recovery as distinct from simple repair and restart on reliability, nor the negative effect of recovery, and of internetworking of clients and servers, on availability. As a result of employing the standard definitions, reliability would tend to be underestimated, and availability overestimated. We offer revised definitions of these two critical metrics, which we call service reliability and service availability, that improve the match between their formal expression, and intuitive meaning. A fortuitous advantage of our approach is that the product of our two metrics yields a highly meaningful figure of merit for the overall dependability of a system. But techniques that enhance system dependability exact a performance cost, so we conclude with a cohesive definition of performability that rewards the system for performance that is delivered to its client applications, after discounting the following consequences of failure: service denial and interruption, lost work, and recovery cost.

Unicast Routing: Cost-Performance Tradeoffs

The objective of unicast routing is to find a path from a source to a destination. Conventional routing has been used mainly to provide connectivity. It lacks the ability to provide any kind of service guarantees and smart usage of network resources. Improving performance is possible by being aware of both traffic characteristics and current available resources. This paper surveys a range of routing solutions, which can be categorized depending on the degree of the awareness of the algorithm: (1) QoS/Constraint-based routing solutions are aware of traffic requirements of individual connection requests; (2) Traffic-aware routing solutions assume knowledge of the location of communicating ingress-egress pairs and possibly the traffic demands among them; (3) Routing solutions that are both QoS-aware as (1) and traffic-aware as (2); (4) Best-effort solutions are oblivious to both traffic and QoS requirements, but are adaptive only to current resource availability. The best performance can be achieved by having all possible knowledge so that while finding a path for an individual flow, one can make a smart choice among feasible paths to increase the chances of supporting future requests. However, this usually comes at the cost of increased complexity and decreased scalability. In this paper, we discuss such cost-performance tradeoffs by surveying proposed heuristic solutions and hybrid approaches.

Accessibility, availability and affordability of anti-malarials in a rural district in Kenya after implementation of a national subsidy scheme.

BACKGROUND: Poor access to prompt and effective treatment for malaria contributes to high mortality and severe morbidity. In Kenya, it is estimated that only 12% of children receive anti-malarials for their fever within 24 hours. The first point of care for many fevers is a local medicine retailer, such as a pharmacy or chemist. The role of the medicine retailer as an important distribution point for malaria medicines has been recognized and several different strategies have been used to improve the services that these retailers provide. Despite these efforts, many mothers still purchase ineffective drugs because they are less expensive than effective artemisinin combination therapy (ACT). One strategy that is being piloted in several countries is an international subsidy targeted at anti-malarials supplied through the retail sector. The goal of this strategy is to make ACT as affordable as ineffective alternatives. The programme, called the Affordable Medicines Facility - malaria was rolled out in Kenya in August 2010. METHODS: In December 2010, the affordability and accessibility of malaria medicines in a rural district in Kenya were evaluated using a complete census of all public and private facilities, chemists, pharmacists, and other malaria medicine retailers within the Webuye Demographic Surveillance Area. Availability, types, and prices of anti-malarials were assessed. There are 13 public or mission facilities and 97 medicine retailers (registered and unregistered). RESULTS: The average distance from a home to the nearest public health facility is 2 km, but the average distance to the nearest medicine retailer is half that. Quinine is the most frequently stocked anti-malarial (61% of retailers). More medicine retailers stocked sulphadoxine-pyramethamine (SP; 57%) than ACT (44%). Eleven percent of retailers stocked AMFm subsidized artemether-lumefantrine (AL). No retailers had chloroquine in stock and only five were selling artemisinin monotherapy. The mean price of any brand of AL, the recommended first-line drug in Kenya, was $2.7 USD. Brands purchased under the AMFm programme cost 40% less than non-AMFm brands. Artemisinin monotherapies cost on average more than twice as much as AMFm-brand AL. SP cost only $0.5, a fraction of the price of ACT. CONCLUSIONS: AMFm-subsidized anti-malarials are considerably less expensive than unsubsidized AL, but the price difference between effective and ineffective therapies is still large.

Real-Time Decision Making and Aggressive Behavior in Youth: A Heuristic Model of Response Evaluation and Decision (RED).

Considerable scientific and intervention attention has been paid to judgment and decision-making systems associated with aggressive behavior in youth. However, most empirical studies have investigated social-cognitive correlates of stable child and adolescent aggressiveness, and less is known about real-time decision making to engage in aggressive behavior. A model of real-time decision making must incorporate both impulsive actions and rational thought. The present paper advances a process model (response evaluation and decision; RED) of real-time behavioral judgments and decision making in aggressive youths with mathematic representations that may be used to quantify response strength. These components are a heuristic to describe decision making, though it is doubtful that individuals always mentally complete these steps. RED represents an organization of social-cognitive operations believed to be active during the response decision step of social information processing. The model posits that RED processes can be circumvented through impulsive responding. This article provides a description and integration of thoughtful, rational decision making and nonrational impulsivity in aggressive behavioral interactions.

Variability in water and nitrogen availability at plot scale and its effect on Maize (Zea Mays L.) production

p.21-30

Variability in water and nitrogen availability at plot scale and its effect on Maize (Zea Mays L.) production

p.21-30

Analyzing and selecting tasks for mathematics teaching: a heuristic

In planning units and lessons every day, teachers face the problem of designing a sequence of activities to promote learning. In particular, they are expected to foster the development of learning goals in their students. Based on the idea of learning path of a task, we describe a heuristic procedure to enable teachers to characterize a learning goal in terms of its cognitive requirements and to analyze and select tasks based on this characterization. We then present an example of how a group of future teachers used this heuristic in a preservice teachers training course and discuss its contributions and constraints.

A new heuristic for three-machine flow shop scheduling

This paper considers the problem of sequencing n jobs in a three-machine flow shop with the objective of minimizing the makespan, which is the completion time of the last job. An O(n log n) time heuristic that is based on Johnson's algorithm is presented. It is shown to generate a schedule with length at most 5/3 times that of an optimal schedule, thereby reducing the previous best available worst-case performance ratio of 2. An application to the general flow shop is also discussed.

A nested location-routing heuristic using route length estimation

A nested heuristic approach that uses route length approximation is proposed to solve the location-routing problem. A new estimation formula for route length approximation is also developed. The heuristic is evaluated empirically against the sequential method and a recently developed nested method for location routing problems. This testing is carried out on a set of problems of 400 customers and around 15 to 25 depots with good results.

Intelligent technologies for nuclear power systems: heuristic and neural tools

The consecutive, partly overlapping emergence of expert systems and then neural computation methods among intelligent technologies, is reflected in the evolving scene of their application to nuclear engineering. This paper provides a bird's eye view of the state of the application in the domain, along with a review of a particular task, the one perhaps economically more important: refueling design in nuclear power reactors.

Nested heuristic methods for the location-routeing problem

The concept of 'nested methods' is adopted to solve the location-routeing problem. Unlike the sequential and iterative approaches, in this method we treat the routeing element as a sub-problem within the larger problem of location. Efficient techniques that take into account the above concept and which use a neighbourhood structure inspired from computational geometry are presented. A simple version of tabu search is also embedded into our methods to improve the solutions further. Computational testing is carried out on five sets of problems of 400 customers with five levels of depot fixed costs, and the results obtained are encouraging.

A greedy open shop heuristic with job priorities

The paper presents an improved version of the greedy open shop approximation algorithm with pre-ordering of jobs. It is shown that the algorithm compares favorably with the greedy algorithm with no pre-ordering by reducing either its absolute or relative error. In the case of three machines, the new algorithm creates a schedule with the makespan that is at most 3/2 times the optimal value.

A heuristic algorithm for two-machine re-entrant shop scheduling

This paper considers the problem of sequencing n jobs in a two‐machine re‐entrant shopwith the objective of minimizing the maximum completion time. The shop consists of twomachines, M1 and M2 , and each job has the processing route (M1 , M2 , M1 ). An O(n log n)time heuristic is presented which generates a schedule with length at most 4/3 times that ofan optimal schedule, thereby improving the best previously available worst‐case performanceratio of 3/2.