A general lower bound for collaborative tree exploration

We consider collaborative graph exploration with a set of $k$ agents. All agents start at a common vertex of an initially unknown graph and need to collectively visit all other vertices. We assume agents are deterministic, vertices are distinguishable, moves are simultaneous, and we allow agents to communicate globally. For this setting, we give the first non-trivial lower bounds that bridge the gap between small ($k \leq \sqrt n$) and large ($k \geq n$) teams of agents. Remarkably, our bounds tightly connect to existing results in both domains. First, we significantly extend a lower bound of $\Omega(\log k / \log\log k)$ by Dynia et al. on the competitive ratio of a collaborative tree exploration strategy to the range $k \leq n \log^c n$ for any $c \in \mathbb{N}$. Second, we provide a tight lower bound on the number of agents needed for any competitive exploration algorithm. In particular, we show that any collaborative tree exploration algorithm with $k = Dn^{1+o(1)}$ agents has a competitive ratio of $\omega(1)$, while Dereniowski et al. gave an algorithm with $k = Dn^{1+\varepsilon}$ agents and competitive ratio $O(1)$, for any $\varepsilon > 0$ and with $D$ denoting the diameter of the graph. Lastly, we show that, for any exploration algorithm using $k = n$ agents, there exist trees of arbitrarily large height $D$ that require $\Omega(D^2)$ rounds, and we provide a simple algorithm that matches this bound for all trees

Psychological response and quality of life after transplantation: a comparison between heart, lung, liver and kidney recipients

PRINCIPLES: Various non-specific questionnaires were used to measure quality of life and psychological wellbeing of patients after organ transplantation. At present cross-organ studies dealing specifically with the psychological response to a transplanted organ are non-existent in German-speaking countries. METHODS: The Transplant Effects Questionnaire TxEQ-D and the SF-36 Quality of Life Questionnaire were used to examine the psychological response and quality of life of 370 patients after heart, lung, liver or kidney transplantation. The organ groups were compared with regard to psychosocial parameters. RESULTS: 72% of patients develop a feeling of responsibility for the received organ and its function. This feeling is even stronger towards the patient's key relationships i.e. family, friends, the treatment team and the donor. 11.6% worry about the transplanted organ. Heart and lung patients report significantly fewer concerns than liver and kidney patients. Overall, only a minority of patients report feelings of guilt towards the donor (2.7%), problems in disclosing their transplant to others (2.4%), or difficulties in complying with medical orders (3.5%). Lung transplant patients show significantly better adherence. CONCLUSIONS: A feeling of responsibility towards those one is close to and towards the donor is a common psychological phenomenon after transplantation of an organ. Conscious feelings of guilt and shame are harboured by only a minority of patients. The fact that heart and lung patients worry less about their transplant might have primarily to do with the greater medical and psychosocial support in this group

A stochastic method for the energy management in hybrid electric vehicles

There are many approaches addressing the problem of optimal energy management in hybrid electric vehicles; however, most of them optimise the control strategy for particular driving cycles. This paper takes into account that the driving cycle is not a priori known to obtain a near-optimal solution. The proposed method is based on analysing the power demands in a given receding horizon to estimate future driving conditions and minimise the fuel consumption while cancelling the expected battery energy consumption after a defined time horizon. Simulations show that the proposed method allows charge sustainability providing near-optimal results. (C) 2014 Elsevier Ltd. All rights reserved.This research has been partially supported by Ministerio de Ciencia e Innovacion through Project TRA2010-16205 uDiesel and by the Conselleria de Educacio Cultura i Esports de la Generalitat Valenciana through Project GV/2103/044 AECOSPH.Payri González, F.; Guardiola, C.; Plá Moreno, B.; Blanco-Rodriguez, D. (2014). A stochastic method for the energy management in hybrid electric vehicles. Control Engineering Practice. 29:257-265. https://doi.org/10.1016/j.conengprac.2014.01.004S2572652

Anonymous Graph Exploration with Binoculars

International audienceWe investigate the exploration of networks by a mobile agent. It is long known that, without global information about the graph, it is not possible to make the agent halts after the exploration except if the graph is a tree. We therefore endow the agent with binoculars, a sensing device that can show the local structure of the environment at a constant distance of the agent current location.We show that, with binoculars, it is possible to explore and halt in a large class of non-tree networks. We give a complete characterization of the class of networks that can be explored using binoculars using standard notions of discrete topology. This class is much larger than the class of trees: it contains in particular chordal graphs, plane triangulations and triangulations of the projective plane. Our characterization is constructive, we present an Exploration algorithm that is universal; this algorithm explores any network explorable with binoculars, and never halts in non-explorable networks

Ordering a sparse graph to minimize the sum of right ends of edges

Motivated by a warehouse logistics problem we study mappings of the vertices of a graph onto prescribed points on the real line that minimize the sum (or equivalently, the average) of the coordinates of the right ends of all edges. We focus on graphs whose edge numbers do not exceed the vertex numbers too much, that is, graphs with few cycles. Intuitively, dense subgraphs should be placed early in the ordering, in order to finish many edges soon. However, our main “calculation trick” is to compare the objective function with the case when (almost) every vertex is the right end of exactly one edge. The deviations from this case are described by “charges” that can form “dipoles”. This reformulation enables us to derive polynomial algorithms and NP-completeness results for relevant special cases, and FPT results

Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks

Abstract. The Minimum Energy Broadcast problem consists in finding the minimum-energy range assignment for a given set S of n stations of an ad hoc wireless network that allows a source station to perform broadcast operations over S. We prove a nearly tight asymptotical bound on the optimal cost for the Minimum Energy Broadcast problem on square grids. We emphasize that finding tight bounds for this problem restriction is far to be easy: it involves the Gauss’s Circle problem and the Apollonian Circle Packing. We also derive near-tight bounds for the Bounded-Hop version of this problem. Our results imply that the best-known heuristic, the MST-based one, for the Minimum Energy Broadcast problem is far to achieve optimal solutions (even) on very regular, well-spread instances: its worst-case approximation ratio is about pi and it yields Ω( n) hops. As a by product, we get nearly tight bounds for the Minimum Disk Cover problem and for its restriction in which the allowed disks must have non-constant radius. Finally, we emphasize that our upper bounds are obtained via polynomial time constructions.

HPV infection and pre-term birth: a data-linkage study using Scottish Health Data

Background: We aimed to investigate whether infection with high-risk (HR) types of human papilloma virus (HPV) or HPV-associated cervical disease were associated with preterm birth (<37 weeks gestation). In a sub-group of younger women who were eligible for the HPV vaccine, we aimed to determine whether prior vaccination against the specific HPV-types, HPV-16 and -18 modified preterm birth risk. Methods: This was a data-linkage study, which linked HPV-associated viral and pathological information (from the Scottish HPV Archive) from women aged 16-45 years to routinely collected NHS maternity- and hospital-admission records from 1999–2015. Pregnancy outcomes from 5,598 women with term live birth (≥37 weeks gestation, n=4,942), preterm birth (<37 weeks gestation, n=386) or early miscarriage (<13 weeks gestation, n=270). Of these, data from HPV vaccine-eligible women (n=3,611, aged 16-25 years) were available, of whom 588 had been vaccinated. HPV-associated disease status was defined as: HR HPV-positive no disease, low-grade abnormalities or high-grade disease. Results: High-grade HPV-associated cervical disease was associated with preterm birth (odds ratio=1.843 [95% confidence interval 1.101–3.083], p=0.020) in adjusted binary logistic regression analysis, in all women, but there were no associations with HR HPV-infection alone or with low-grade abnormalities. No associations between any HPV parameter and preterm birth were seen in vaccine-eligible women, nor was there any effect of prior vaccination. Conclusions: HPV-associated high-grade cervical disease was associated with preterm birth, but there were no associations with HR HPV-infection or low-grade cervical disease. Thus HPV-infection alone (in the absence of cervical disease) does not appear to be an independent risk factor for preterm birth. For women who have undergone treatment for CIN and become pregnant, these results demonstrate the need to monitor for signs of preterm birth