Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments

We develop and analyze algorithms for dispersing a swarm of primitive robots in an unknown environment, R. The primary objective is to minimize the makespan, that is, the time to fill the entire region. An environment is composed of pixels that form a connected subset of the integer grid. There is at most one robot per pixel and robots move horizontally or vertically at unit speed. Robots enter R by means of k>=1 door pixels Robots are primitive finite automata, only having local communication, local sensors, and a constant-sized memory. We first give algorithms for the single-door case (i.e., k=1), analyzing the algorithms both theoretically and experimentally. We prove that our algorithms have optimal makespan 2A-1, where A is the area of R. We next give an algorithm for the multi-door case (k>1), based on a wall-following version of the leader-follower strategy. We prove that our strategy is O(log(k+1))-competitive, and that this bound is tight for our strategy and other related strategies.Comment: 17 pages, 4 figures, Latex, to appear in Workshop on Algorithmic Foundations of Robotics, 200

Women with endometriosis have higher comorbidities: Analysis of domestic data in Taiwan

AbstractEndometriosis, defined by the presence of viable extrauterine endometrial glands and stroma, can grow or bleed cyclically, and possesses characteristics including a destructive, invasive, and metastatic nature. Since endometriosis may result in pelvic inflammation, adhesion, chronic pain, and infertility, and can progress to biologically malignant tumors, it is a long-term major health issue in women of reproductive age. In this review, we analyze the Taiwan domestic research addressing associations between endometriosis and other diseases. Concerning malignant tumors, we identified four studies on the links between endometriosis and ovarian cancer, one on breast cancer, two on endometrial cancer, one on colorectal cancer, and one on other malignancies, as well as one on associations between endometriosis and irritable bowel syndrome, one on links with migraine headache, three on links with pelvic inflammatory diseases, four on links with infertility, four on links with obesity, four on links with chronic liver disease, four on links with rheumatoid arthritis, four on links with chronic renal disease, five on links with diabetes mellitus, and five on links with cardiovascular diseases (hypertension, hyperlipidemia, etc.). The data available to date support that women with endometriosis might be at risk of some chronic illnesses and certain malignancies, although we consider the evidence for some comorbidities to be of low quality, for example, the association between colon cancer and adenomyosis/endometriosis. We still believe that the risk of comorbidity might be higher in women with endometriosis than that we supposed before. More research is needed to determine whether women with endometriosis are really at risk of these comorbidities

Wireless Charging Deployment in Sensor Networks

Charging schemes utilizing mobile wireless chargers can be applied to prolong the lifespan of a wireless sensor network. In considering charging schemes with mobile chargers, most current studies focus on charging each sensor from a single position, then optimizing the moving paths of the chargers. However, in reality, a wireless charger may charge the same sensor from several positions in its path. In this paper we consider this fact and seek to minimize both the number of charging locations and the total required charging time. Two charging plans are developed. The first plan considers the charging time required by each sensor and greedily selects the charging service positions. The second one is a two-phase plan, where the number of charging positions is first minimized, then minimum charging times are assigned to every position according to the charging requirements of the nearby sensors. This paper also corrects a problem neglected by some studies in minimizing the number of charging service positions and further provides a corresponding solution. Empirical studies show that compared with other minimal clique partition (MCP)-based methods, the proposed charging plan may save up to 60% in terms of both the number of charging positions and the total required charging time