The Private Sector and HIV/AIDS in Africa: Taking Stock of Six Years of Applied Research

Background: Until recently, little was known about the costs of the HIV/AIDS epidemic to businesses in Africa and business responses to the epidemic. This paper synthesizes the results of a set of studies conducted between 1999 and 2006 and draws conclusions about the role of the private sector in Africa’s response to AIDS. Methods: Detailed human resource, financial, and medical data were collected from 14 large private and parastatal companies in South Africa, Uganda, Kenya, Zambia, and Ethiopia. Surveys of small and medium-sized enterprises (SMEs) were conducted in South Africa, Kenya, and Zambia. Large companies’ responses or potential responses to the epidemic were investigated in South Africa, Uganda, Kenya, Zambia, and Rwanda. Results: Among the large companies, estimated workforce HIV prevalence ranged from 5%¬37%. The average cost per employee lost to AIDS varied from 0.5-5.6 times the average annual compensation of the employee affected. Labor cost increases as a result of AIDS were estimated at anywhere from 0.6%-10.8% but exceeded 3% at only 2 of 14 companies. Treatment of eligible employees with ART at a cost of $360/patient/year was shown to have positive financial returns for most but not all companies. Uptake of employer-provided testing and treatment services varied widely. Among SMEs, HIV prevalence in the workforce was estimated at 10%-26%. SME managers consistently reported low AIDS-related employee attrition, little concern about the impacts of AIDS on their companies, and relatively little interest in taking action, and fewer than half had ever discussed AIDS with their senior staff. AIDS was estimated to increase the average operating costs of small tourism companies in Zambia by less than 1%; labor cost increases in other sectors were probably smaller. Conclusions: Although there was wide variation among the firms studied, clear patterns emerged that will permit some prediction of impacts and responses in the future.

An Infinite Pebble Game and Applications

We generalize the well-known pebble game to infinite dag's, and we use this generalization to give new and shorter proofs of results in different areas of computer science (as diverse as "logic of programs" and "formal language theory"). Our applications here include a proof of a theorem due to Salomaa, asserting the existence of a context-free language with infinite index, and a proof of a theorem due to Tiuryn and Erimbetov, asserting that unbounded memory increases the power of logics of programs. The original proofs by Salomaa, Tiuryn, and Erimbetov, are fairly technical. The proofs by Tiuryn and Erimbetov also involve advanced techniques of model theory, namely, back-and-forth constructions based on a variant of Ehrenfeucht-Fraisse games. By contrast, our proofs are not only shorter, but also elementary. All we need is essentially finite induction and, in the case of the Tiuryn-Erimbetov result, the compactness and completeness of first-order logic.

Active Voodoo Dolls: A Vision Based Input Device for Nonrigid Control

A vision based technique for non-rigid control is presented that can be used for animation and video game applications. The user grasps a soft, squishable object in front of a camera that can be moved and deformed in order to specify motion. Active Blobs, a non-rigid tracking technique is used to recover the position, rotation and non-rigid deformations of the object. The resulting transformations can be applied to a texture mapped mesh, thus allowing the user to control it interactively. Our use of texture mapping hardware allows us to make the system responsive enough for interactive animation and video game character control.

Applied type system

We present a type system that can effectively facilitate the use of types in capturing invariants in stateful programs that may involve (sophisticated) pointer manipulation. With its root in a recently developed framework Applied Type System (ATS), the type system imposes a level of abstraction on program states by introducing a novel notion of recursive stateful views and then relies on a form of linear logic to reason about such views. We consider the design and then the formalization of the type system to constitute the primary contribution of the paper. In addition, we mention a prototype implementation of the type system and then give a variety of examples that attests to the practicality of programming with recursive stateful views.