Alteraciones respiratorias durante el sueño en niños con Síndrome Down a la altura de Bogotá

Objetivo: determinar la frecuencia de las diferentes alteraciones respiratorias durante el sueño (ARS) e hipertensión pulmonar (HTP) y establecer la saturación de oxígeno (SpO2) en vigilia, sueño y durante los eventos en niños con Síndrome Down (SD) a la altura de Bogotá (2640m) de acuerdo a grupos de edad e IMC. Métodos: estudio descriptivo de corte transversal, se incluyeron todos los niños con SD con sospecha de ARS remitidos a polisonograma (PSG) de octubre de 2011 a enero de 2013 a la Fundación Neumológica Colombina (FNC). Se dividieron en 3 grupos: apnea obstructiva, apnea obstructiva y central, sin apneas. Resultados: 74 niños, el 36,5% mujeres, edad media 4 años. 47,3% presento apnea obstructiva, más frecuente en >2 años, 35,1% apnea obstructiva y central, más frecuente en < 2 años y 17,6 % sin apnea. SpO2 promedio en apnea obstructiva 84,63%, apnea obstructiva y central: 81,8% y sin apnea: 86,85% (p 0,058). 23% presento obesidad, 16% con apnea obstructiva. 53 pacientes tenían ecocardiograma: 28% HTP, 53,3% tuvo apnea obstructiva y 26,7 apnea obstructiva y central, no diferencias significativas. SpO2 promedio en HTP 88,3% vigilia, 86,2% sueño REM, 85,7 % sueño no REM, no diferencia significativa comparada con pacientes sin HTP. Conclusiones: Las ARS son frecuentes en los niños con SD, La desaturación está presente en los niños con SD independiente del tipo de apnea. A todos los niños SD se les debe practicar un PSG en el primer año de vida.

Allocation rules on networks

When allocating a resource, geographical and infrastructural constraints have to be taken into account. We study the problem of distributing a resource through a network from sources endowed with the resource to citizens with claims. A link between a source and an agent depicts the possibility of a transfer from the source to the agent. Given the supplies at each source, the claims of citizens, and the network, the question is how to allocate the available resources among the citizens. We consider a simple allocation problem that is free of network constraints, where the total amount can be freely distributed. The simple allocation problem is a claims problem where the total amount of claims is greater than what is available. We focus on consistent and resource monotonic rules in claims problems that satisfy equal treatment of equals. We call these rules fairness principles and we extend fairness principles to allocation rules on networks. We require that for each pair of citizens in the network, the extension is robust with respect to the fairness principle. We call this condition pairwise robustness with respect to the fairness principle. We provide an algorithm and show that each fairness principle has a unique extension which is pairwise robust with respect to the fairness principle. We give applications of the algorithm for three fairness principles: egalitarianism, proportionality and equal sacrifice.

Asymmetrically fair rules for an indivisible good problem with a budget constraint

We study a particular restitution problem where there is an indivisible good (land or property) over which two agents have rights: the dispossessed agent and the owner. A third party, possibly the government, seeks to resolve the situation by assigning rights to one and compensate the other. There is also a maximum amount of money available for the compensation. We characterize a family of asymmetrically fair rules that are immune to strategic behavior, guarantee minimal welfare levels for the agents, and satisfy the budget constraint.