Author(s):  
Bryan Wilder

Social and behavioral interventions are a critical tool for governments and communities to tackle deep-rooted societal challenges such as homelessness, disease, and poverty. However, real-world interventions are almost always plagued by limited resources and limited data, which creates a computational challenge: how can we use algorithmic techniques to enhance the targeting and delivery of social and behavioral interventions? The goal of my thesis is to provide a unified study of such questions, collectively considered under the name "algorithmic social intervention". This proposal introduces algorithmic social intervention as a distinct area with characteristic technical challenges, presents my published research in the context of these challenges, and outlines open problems for future work. A common technical theme is decision making under uncertainty: how can we find actions which will impact a social system in desirable ways under limitations of knowledge and resources? The primary application area for my work thus far is public health, e.g. HIV or tuberculosis prevention. For instance, I have developed a series of algorithms which optimize social network interventions for HIV prevention. Two of these algorithms have been pilot-tested in collaboration with LA-area service providers for homeless youth, with preliminary results showing substantial improvement over status-quo approaches. My work also spans other topics in infectious disease prevention and underlying algorithmic questions in robust and risk-aware submodular optimization.


Author(s):  
Ana Filipa Nogueira ◽  
José Carlos Bregieiro Ribeiro ◽  
Francisco Fernández de Vega ◽  
Mário Alberto Zenha-Rela

In object-oriented evolutionary testing, metaheuristics are employed to select or generate test data for object-oriented software. Techniques that analyse program structures are predominant among the panoply of studies available in current literature. For object-oriented evolutionary testing, the common objective is to reach some coverage criteria, usually in the form of statement or branch coverage. This chapter explores, reviews, and contextualizes relevant literature, tools, and techniques in this area, while identifying open problems and setting ground for future work.


2000 ◽  
pp. 127-135
Author(s):  
Raimondas Lencevicius
Keyword(s):  

Author(s):  
Ataul Bari ◽  
Arunita Jaekel

A sensor network consists of tiny, low-powered and multifunctional sensor devices and is able to perform complex tasks through the collaborative efforts of a large number of sensor nodes that are densely deployed within the sensing field. Maintaining connectivity and maximizing the network lifetime are among the critical considerations in designing sensor networks and its protocols. Conservation of limited energy reserves at each sensor node is one of the greatest challenges in a sensor network. It has been suggested that mobility of some nodes/entities in a sensor network can be exploited to improve network performance in a number of areas, including coverage, lifetime, connectivityy, and fault-tolerance. In this context, techniques for effectively utilizing the unique capabilities of mobile nodes have been attracting increasing research attention in the past few years. In this chapter, the authors focus on some of the new and innovative techniques that have been recently proposed to handle a number of important problems in this field. It also presents a number of open problems and some developing trends and directions for future work in this emerging research area.


Author(s):  
Elliot Anshelevich ◽  
Aris Filos-Ratsikas ◽  
Nisarg Shah ◽  
Alexandros A. Voudouris

The notion of distortion in social choice problems has been defined to measure the loss in efficiency---typically measured by the utilitarian social welfare, the sum of utilities of the participating agents---due to having access only to limited information about the preferences of the agents. We survey the most significant results of the literature on distortion from the past 15 years, and highlight important open problems and the most promising avenues of ongoing and future work.


1998 ◽  
Vol 5 (31) ◽  
Author(s):  
Glynn Winskel

A metalanguage for concurrent process languages is introduced.<br />Within it a range of process languages can be defined, including<br />higher-order process languages where processes are passed and received as arguments. (The process language has, however, to be linear, in the sense that a process received as an argument can be run at most once, and not include name generation as in the Pi-Calculus.) The metalanguage is provided with two interpretations both of which can be understood as categorical models of a variant of linear logic. One interpretation is in a<br />simple category of nondeterministic domains; here a process will denote its set of traces. The other interpretation, obtained by direct analogy with the nondeterministic domains, is in a category of presheaf categories; the nondeterministic branching behaviour of a process is captured in its denotation as a presheaf. Every presheaf category possesses a notion of (open-map) bisimulation, preserved by terms of the metalanguage. The<br />conclusion summarises open problems and lines of future work.


2012 ◽  
Vol 22 (03) ◽  
pp. 243-275 ◽  
Author(s):  
GIOVANNI VIGLIETTA

THE SEARCHLIGHT SCHEDULING PROBLEM was first studied in 2-dimensional polygons, where the goal is for point guards in fixed positions to rotate searchlights to catch an evasive intruder. Here the problem is extended to 3-dimensional polyhedra, with the guards now boundary segments who rotate half-planes of illumination. After carefully detailing the 3-dimensional model, several results are established. The first is a nearly direct extension of the planar one-way sweep strategy using what filling guards, a generalization that succeeds despite there being no well-defined we call notion in 3-dimensional space of planar "clockwise rotation." Next follow two results: every polyhedron with r > 0 reflex edges can be searched by at most r2 suitably placed boundary guards, whereas just r edguards suffice if the polyhedron is orthogonal. (Mini-mizing the number of guards to search a given polyhedron is easily seen to be NP-hard.) Finally we show that deciding whether a given set of boundary guards has a successful search schedule is strongly NP-hard. A number of peripheral results are proved en route to these central theorems, and several open problems remain for future work.


2016 ◽  
Vol 26 (1) ◽  
pp. 17-32 ◽  
Author(s):  
Héctor Cancela ◽  
Franco Robledo ◽  
Pablo Romero ◽  
Pablo Sartor

We are given a graph G = (V, E), terminal set K ? V and diameter d > 0. Links fail stochastically and independently with known probabilities. The diameter-constrained reliability (DCR for short), is the probability that the K-diameter is not greater than d in the subgraph induced by non-failed links. The contributions of this paper are two-fold. First, the computational complexity of DCR-subproblems is discussed in terms of the number of terminals k = jKj and diameter d. Here, we prove that when d > 2 the problem is NP-Hard when K = V. Second, we compute the DCR efficiently for Ladders and Spanish Fans. Open problems and trends for future work are discussed in the conclusions.


Sign in / Sign up

Export Citation Format

Share Document