Picking up the Pieces: Self-Healing in reconfigurable networks

We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity in these networks, even in the presence of repeated adversarial node deletion, by carefully adding edges after each attack. We present a new algorithm, DASH, that provably ensures that: 1) the network stays connected even if an adversary deletes up to all nodes in the network; and 2) no node ever increases its degree by more than 2 log n, where n is the number of nodes initially in the network. DASH is fully distributed; adds new edges only among neighbors of deleted nodes; and has average latency and bandwidth costs that are at most logarithmic in n. DASH has these properties irrespective of the topology of the initial network, and is thus orthogonal and complementary to traditional topology- based approaches to defending against attack. We also prove lower-bounds showing that DASH is asymptotically optimal in terms of minimizing maximum degree increase over multiple attacks. Finally, we present empirical results on power-law graphs that show that DASH performs well in practice, and that it significantly outperforms naive algorithms in reducing maximum degree increase.

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This article focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. In particular, the seemingly obvious lower bounds of Ω(m) messages, where m is the number of edges in the network, and Ω(D) time, where D is the network diameter, are nontrivial to show for randomized (Monte Carlo) algorithms. (Recent results, showing that even Ω(n), where n is the number of nodes in the network, is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms, except for the restricted case of comparison algorithms, where it was also required that nodes may not wake up spontaneously and that D and n were not known. We establish these fundamental lower bounds in this article for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (namely, algorithms that work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make any use of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time leader election algorithm is known. A slight adaptation of our lower bound technique gives rise to an Ω(m) message lower bound for randomized broadcast algorithms. 

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. The answer is known to be negative in the deterministic setting. We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that tradeoff messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

Determinants of pediatric cataract program outcomes and follow-up in a large series in Mexico.

PURPOSE:

To report determinants of outcomes and follow-up in a large Mexican pediatric cataract project.

SETTING:

Hospital Luis Sanchez Bulnes, Mexico City, Mexico.

METHODS:

Data were collected prospectively from a pediatric cataract surgery program at the Hospital Luis Sanchez Bulnes, implemented by Helen Keller International. Preoperative data included age, sex, baseline visual acuity, type of cataract, laterality, and presence of conditions such as amblyopia. Surgical data included vitrectomy, capsulotomy, complications, and use of intraocular lenses (IOLs). Postoperative data included final visual acuity, refraction, number of follow-up visits, and program support for follow-up.

RESULTS:

Of 574 eyes of 415 children (mean age 7.1 years +/- 4.7 [SD]), IOLs were placed in 416 (87%). At least 1 follow-up was attended by 408 patients (98.3%) (mean total follow-up 3.5 +/- 1.8 months); 40% of eyes achieved a final visual acuity of 6/18 or better. Children living farther from the hospital had fewer postoperative visits (P = .04), while children receiving program support had more visits (P = .001). Factors predictive of better acuity included receiving an IOL during surgery (P = .04) and provision of postoperative spectacles (P = .001). Predictive of worse acuity were amblyopia (P = .003), postoperative complications (P = .0001), unilateral surgery (P = .0075), and female sex (P = .045).

CONCLUSIONS:

The results underscore the importance of surgical training in reducing complications, early intervention before amblyopia (observed in 40% of patients) can develop, and vigorous treatment if amblyopia is present. The positive impact of program support on follow-up is encouraging, although direct financial support may pose a problem for sustainability. More work is needed to understand reasons for worse outcomes in girls.

Using creative problem solving (CPS) to improve leadership in a non-profit organization

The purpose of this study was to evaluate the effectiveness of the Creative Problem Solving (CPS) method in improving the leadership process in a non-profit organization. The research was designed around an intervention and structured in three stages (pre-consult, intervention and follow-up), with a team designated by management, in order to bring leadership cohesion to both departments of the organization and also between the board and executive management. The results, expressed in the tasks performed and in the interviews to team members, allowed us to conclude on the effectiveness of the CPS method to improve organizational leadership, by establishing a stronger relationship between departments, as well as, in the long term, between the board and executive management. These results highlight possible solutions to improve the leadership of non-profit organizations.

Spitting Up: Is This Normal?

This document written in English and Spanish discusses the problem of babies spitting up.

Curricular Unit: Pharmacotherapy Follow-Up

Objectives: Pharmaceutical care is a patient-centered philosophy of assistential practice in which the pharmacist, as a health care team member, has responsibilities in patient medication. The correct use of medicines will significantly decrease the negative outcomes of pharmacotherapy, namely untreated health problem..

Growing Up in Taiwan: Counterfactual Models of Part-Time Work, Romantic Relationships, and Crime among Taiwanese Youth

Thesis (Ph.D.)--University of Washington, 2015

New insights on integer-programming models for the kidney exchange problem

In recent years several countries have set up policies that allow exchange of kidneys between two or more incompatible patient–donor pairs. These policies lead to what is commonly known as kidney exchange programs. The underlying optimization problems can be formulated as integer programming models. Previously proposed models for kidney exchange programs have exponential numbers of constraints or variables, which makes them fairly difficult to solve when the problem size is large. In this work we propose two compact formulations for the problem, explain how these formulations can be adapted to address some problem variants, and provide results on the dominance of some models over others. Finally we present a systematic comparison between our models and two previously proposed ones via thorough computational analysis. Results show that compact formulations have advantages over non-compact ones when the problem size is large.

Hurry up and slow down : education to close the ingenuity gap /

To explore the idea of education to close the ingenuity gap I use Thomas Homer-Dixon's work to define ingenuity. The notion that the supply of ingenuity to solve our technical and social problems is not keeping pace with the ingenuity required to solve those problems is called the ingenuity gap. Man-made technological developments are increasing the density, intensity, and pace of globalisation. People must reorganise decision-making organisations and problem-solving methods to pragmatically combat the growing ingenuity gap. John Dewey's work illustrates the fundamental attitudes for the thinking and judgment associated with educating for ingenuity. Howard Gardner's idea that truth, beauty, and morality ought to form the core values and tenets of the philosophy of educating for ingenuity is integral to this thesis. The act of teaching facilitates the invitation to the communication necessary to foster ingenuity. John Novak-discusses the five relationships of educational leadership that enhance an environment of ingenuity. The International Baccalaureate (IB) is an existing model of global education, one that defines some of the school experiences and academic development of core values of educating for ingenuity. Expanding upon the structure of the IB and other research within this thesis, I speculate upon what my school, where educating for ingenuity so as to close the ingenuity gap is the goal, would be like.

Using genetic algorithms for the single allocation hub location problem

Hub location problem is an NP-hard problem that frequently arises in the design of transportation and distribution systems, postal delivery networks, and airline passenger flow. This work focuses on the Single Allocation Hub Location Problem (SAHLP). Genetic Algorithms (GAs) for the capacitated and uncapacitated variants of the SAHLP based on new chromosome representations and crossover operators are explored. The GAs is tested on two well-known sets of real-world problems with up to 200 nodes. The obtained results are very promising. For most of the test problems the GA obtains improved or best-known solutions and the computational time remains low. The proposed GAs can easily be extended to other variants of location problems arising in network design planning in transportation systems.

Region Connection Calculus: Composition Tables and Constraint Satisfaction Problems

Qualitative spatial reasoning (QSR) is an important field of AI that deals with qualitative aspects of spatial entities. Regions and their relationships are described in qualitative terms instead of numerical values. This approach models human based reasoning about such entities closer than other approaches. Any relationships between regions that we encounter in our daily life situations are normally formulated in natural language. For example, one can outline one's room plan to an expert by indicating which rooms should be connected to each other. Mereotopology as an area of QSR combines mereology, topology and algebraic methods. As mereotopology plays an important role in region based theories of space, our focus is on one of the most widely referenced formalisms for QSR, the region connection calculus (RCC). RCC is a first order theory based on a primitive connectedness relation, which is a binary symmetric relation satisfying some additional properties. By using this relation we can define a set of basic binary relations which have the property of being jointly exhaustive and pairwise disjoint (JEPD), which means that between any two spatial entities exactly one of the basic relations hold. Basic reasoning can now be done by using the composition operation on relations whose results are stored in a composition table. Relation algebras (RAs) have become a main entity for spatial reasoning in the area of QSR. These algebras are based on equational reasoning which can be used to derive further relations between regions in a certain situation. Any of those algebras describe the relation between regions up to a certain degree of detail. In this thesis we will use the method of splitting atoms in a RA in order to reproduce known algebras such as RCC15 and RCC25 systematically and to generate new algebras, and hence a more detailed description of regions, beyond RCC25.

Top-down and Bottom-up influences on ACC activation: Evaluation of a proposed model of the feedback-related negativity

The Feedback-Related Negativity (FRN) is thought to reflect the dopaminergic prediction error signal from the subcortical areas to the ACC (i.e., a bottom-up signal). Two studies were conducted in order to test a new model of FRN generation, which includes direct modulating influences of medial PFC (i.e., top-down signals) on the ACC at the time of the FRN. Study 1 examined the effects of one’s sense of control (top-down) and of informative cues (bottom-up) on the FRN measures. In Study 2, sense of control and instruction-based (top-down) and probability-based expectations (bottom-up) were manipulated to test the proposed model. The results suggest that any influences of medial PFC on the activity of the ACC that occur in the context of incentive tasks are not direct. The FRN was shown to be sensitive to salient stimulus characteristics. The results of this dissertation partially support the reinforcement learning theory, in that the FRN is a marker for prediction error signal from subcortical areas. However, the pattern of results outlined here suggests that prediction errors are based on salient stimulus characteristics and are not reward specific. A second goal of this dissertation was to examine whether ACC activity, measured through the FRN, is altered in individuals at-risk for problem-gambling behaviour (PG). Individuals in this group were more sensitive to the valence of the outcome in a gambling task compared to not at-risk individuals, suggesting that gambling contexts increase the sensitivity of the reward system to valence of the outcome in individuals at risk for PG. Furthermore, at-risk participants showed an increased sensitivity to reward characteristics and a decreased response to loss outcomes. This contrasts with those not at risk whose FRNs were sensitive to losses. As the results did not replicate previous research showing attenuated FRNs in pathological gamblers, it is likely that the size and time of the FRN does not change gradually with increasing risk of maladaptive behaviour. Instead, changes in ACC activity reflected by the FRN in general can be observed only after behaviour becomes clinically maladaptive or through comparison between different types of gain/loss outcomes.

We need to have a conversation about OpenURL, a close look at a corpus of error reports from the 2013 academic year. Or, How I learned to stop worrying and give up on clean metadata.

Presented at Access 2014, winner of poster contest.

Follow-up of three large community-based programs to reduce anaemia among children 24-59 months in Ghana, Malawi and Tanzania

L'anémie de l'enfant reste un problème d'importance pour la santé mondiale, malgré les décennies de recherche visant à comprendre son étiologie et à développer des interventions efficaces pour réduire sa prévalence et ses conséquences. Bien que les facteurs de risque individuels de l'anémie soient connus, y compris les facteurs liés à la malnutrition et à la morbidité, l'interaction entre lesdits facteurs est moins documentée dans des contextes où les enfants sont fréquemment exposés à plusieurs facteurs en même temps. Cette étude vise à documenter les efforts de lutte contre l'anémie du programme MICAH qui a été mis en oeuvre au Ghana, au Malawi et en Tanzanie. Ensuite, en utilisant les données relatives à la fois au processus et à l'évaluation colligées au cours du programme, elle vise à mieux comprendre les facteurs de risque d'anémie chez les jeunes enfants dans ces contextes et à comprendre comment les relations entre ces facteurs peuvent avoir changé au fil du temps lors de l'intervention. Spécifiquement, cette étude vérifie s‘il y a des preuves d'une réduction de la vulnérabilité des enfants aux facteurs de risque associés à l'anémie dans chaque contexte. Un examen de la documentation a été réalisé afin de caractériser le contexte du programme et des interventions, leur l'intensité et étendue. Les données transversales sur la nutrition et l'état de santé des enfants âgés de 24 à 59 mois (N = 2405) obtenues en 2000 et 2004 à partir des enquêtes d'évaluation du programme MICAH au Ghana, au Malawi et en Tanzanie, ont été utilisées pour décrire la prévalence de l'anémie. Les modèles polynomiaux de régression logistique et linéaire ont été utilisés pour estimer les risques d'anémie légère et d'anémie modérée / sévère et les niveaux d‘hémoglobine associés à des groupes de variables. Les estimations du risque attribuable à une population (RAP) ont aussi été calculées. Une anémie (Hb <110 g/L) a touché au moins 60% des enfants dans les trois pays; l'anémie modérée / sévère (<100 g/L) constituait la majorité des cas. Une forte diminution de l'anémie a été observée entre 2000 et 2004 au Ghana, mais seulement une légère baisse au Malawi et en Tanzanie. Le risque d'anémie modérée / sévère était associé au retard de croissance chez les enfants du Ghana (OR 2,68, IC 95% 1,70-4,23) et du Malawi (OR 1,71; 1,29-2,27) mais pas de la Tanzanie (OR 1,29; 0,87- 1,92). Le paludisme et les maladies récentes étaient associées à une hémoglobine plus basse. Une atténuation de cette association en 2004 a été observée seulement au Malawi pour le paludisme et au Ghana pour les maladies récentes. Le risque d'anémie modérée / sévère était 44% moindre chez les enfants âgés de 48 à 59 mois comparativement aux enfants de 24 à 35 mois dans les trois pays et cela n'a pas changé entre 2000 et 2004. Les RAP estimés ont montré qu‘environ un cinquième des cas d‘anémie modérée à sévère était attribuable au retard de croissance au Ghana et Malawi, mais pas en Tanzanie. Des RAP moindres et dépendants des contextes ont été trouvés pour le paludisme et les maladies récentes. Dans ces zones d‘intervention intégrées de santé et de nutrition la relation de certains facteurs de risque à l'anémie se modifia avec le temps. Le retard de croissance est resté toutefois un facteur de risque indépendant et non mitigé de l'anémie. Une réduction efficace des causes de la malnutrition chronique est nécessaire afin de réduire la vulnérabilité des enfants et de garantir un impact maximum des programmes de lutte contre l'anémie. Une mitigation de l'impact du paludisme peut par contre être visée dans les régions endémiques.

Delimitation of the Right to Life by Healthcare Professionals: Up to what point should the right to life be protected?

This article explores the medical care standard required by law for terminally illpatients and the possibility of limiting therapeutic efforts while respecting the duediligence expected from doctors. To this end, circumstances are identified in whichthe doctor is forced to choose between two possible actions: to guarantee the right tolife by continuing treatment, or to limit the right to healthcare by limiting therapeuticefforts. Two cases taken from English Common Law were reviewed that decided onthe factual problem at hand. In our country, the Constitutional Court established aline of jurisprudence on the role of the doctor in deciding whether or not to continuetreatment for a terminally ill person. Lastly, jurisprudence precedents are presentedalong with a comparative analysis of the solutions given in Great Britain andin Colombia.