REQUIREMENT- AWARE STRATEGIES FOR SCHEDULING MULTIPLE DIVISIBLE LOADS IN CLUSTER ENVIRONMENTS

Ph.DDOCTOR OF PHILOSOPH

Wireless indoor localisation within the 5G internet of radio light

This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonNumerous applications can be enhanced by accurate and efficient indoor localisation using wireless sensor networks, however trade-offs often exist between these two parameters. In this thesis, realworld and simulation data is used to examine the hybrid millimeter wave and Visible Light Communications (VLC) architecture of the 5G Internet of Radio Light (IoRL) Horizon 2020 project. Consequently, relevant localisation challenges within Visible Light Positioning (VLP) and asynchronous sampling networks are identified, and more accurate and efficient solutions are developed. Currently, VLP relies strongly on the assumed Lambertian properties of light sources. However, in practice, not all lights are Lambertian. To support the widespread deployment of VLC technology in numerous environments, measurements from non-Lambertian sources are analysed to provide new insights into the limitations of existing VLP techniques. Subsequently, a novel VLP calibration technique is proposed, and results indicate a 59% accuracy improvement against existing methods. This solution enables high accuracy centimetre level VLP to be achieved with non- Lambertian sources. Asynchronous sampling of range-based measurements is known to impact localisation performance negatively. Various Asynchronous Sampling Localisation Techniques (ASLT) exist to mitigate these effects. While effective at improving positioning performance, the exact suitability of such solutions is not evident due to their additional processes, subsequent complexity, and increased costs. As such, extensive simulations are conducted to study the effectiveness of ASLT under variable sampling latencies, sensor measurement noise, and target trajectories. Findings highlight the computational demand of existing ASLT and motivate the development of a novel solution. The proposed Kalman Extrapolated Least Squares (KELS) method achieves optimal localisation performance with a significant energy reduction of over 50% when compared to current leading ASLT. The work in this thesis demonstrates both the capability for high performance VLP from non- Lambertian sources as well as the potential for energy efficient localisation for sequentially sampled range measurements.Horizon 202

Geometric partitioning algorithms for fair division of geographic resources

University of Minnesota Ph.D. dissertation. July 2014. Major: Industrial and Systems Engineering. Advisor: John Gunnar Carlsson. 1 computer file (PDF): vi, 140 pages, appendices p. 129-140.This dissertation focuses on a fundamental but under-researched problem: how does one divide a piece of territory into smaller pieces in an efficient way? In particular, we are interested in \emph{map segmentation problem} of partitioning a geographic region into smaller subregions for allocating resources or distributing a workload among multiple agents. This work would result in useful solutions for a variety of fundamental problems, ranging from congressional districting, facility location, and supply chain management to air traffic control and vehicle routing. In a typical map segmentation problem, we are given a geographic region $R$, a probability density function defined on $R$ (representing, say population density, distribution of a natural resource, or locations of clients) and a set of points in $R$ (representing, say service facilities or vehicle depots). We seek a \emph{partition} of $R$ that is a collection of disjoint sub-regions $\{R_1, . . . , R_n\}$ such that $\bigcup_i R_i = R$, that optimizes some objective function while satisfying a shape condition. As examples of shape conditions, we may require that all sub-regions be compact, convex, star convex, simply connected (not having holes), connected, or merely measurable.Such problems are difficult because the search space is infinite-dimensional (since we are designing boundaries between sub-regions) and because the shape conditions are generally difficult to enforce using standard optimization methods. There are also many interesting variants and extensions to this problem. It is often the case that the optimal partition for a problem changes over time as new information about the region is collected. In that case, we have an \emph{online} problem and we must re-draw the sub-region boundaries as time progresses. In addition, we often prefer to construct these sub-regions in a \emph{decentralized} fashion: that is, the sub-region assigned to agent $i$ should be computable using only local information to agent $i$ (such as nearby neighbors or information about its surroundings), and the optimal boundary between two sub-regions should be computable using only knowledge available to those two agents.This dissertation is an attempt to design geometric algorithms aiming to solve the above mentioned problems keeping in view the various design constraints. We describe the drawbacks of the current approach to solving map segmentation problems, its ineffectiveness to impose geometric shape conditions and its limited utility in solving the online version of the problem. Using an intrinsically interdisciplinary approach, combining elements from variational calculus, computational geometry, geometric probability theory, and vector space optimization, we present an approach where we formulate the problems geometrically and then use a fast geometric algorithm to solve them. We demonstrate our success by solving problems having a particular choice of objective function and enforcing certain shape conditions. In fact, it turns out that such methods actually give useful insights and algorithms into classical location problems such as the continuous $k$-medians problem, where the aim is to find optimal locations for facilities. We use a map segmentation technique to present a constant factor approximation algorithm to solve the continuous $k$-medians problem in a convex polygon. We conclude this thesis by describing how we intend to build on this success and develop algorithms to solve larger classes of these problems

Dual-Use Space Technology Transfer Conference and Exhibition

This document contains papers presented at the Dual-Use Space Technology Transfer Conference and Exhibition held at the Johnson Space Center February 1-3, 1994. Possible technology transfers covered during the conference were in the areas of information access; innovative microwave and optical applications; materials and structures; marketing and barriers; intelligent systems; human factors and habitation; communications and data systems; business process and technology transfer; software engineering; biotechnology and advanced bioinstrumentation; communications signal processing and analysis; new ways of doing business; medical care; applications derived from control center data systems; human performance evaluation; technology transfer methods; mathematics, modeling, and simulation; propulsion; software analysis and decision tools systems/processes in human support technology; networks, control centers, and distributed systems; power; rapid development perception and vision technologies; integrated vehicle health management; automation technologies; advanced avionics; ans robotics technologies. More than 77 papers, 20 presentations, and 20 exhibits covering various disciplines were presented b experts from NASA, universities, and industry

Scheduling multisource divisible loads on arbitrary networks

10.1109/TPDS.2009.62IEEE Transactions on Parallel and Distributed Systems214520-531ITDS

Abstracts on Radio Direction Finding (1899 - 1995)

The files on this record represent the various databases that originally composed the CD-ROM issue of "Abstracts on Radio Direction Finding" database, which is now part of the Dudley Knox Library's Abstracts and Selected Full Text Documents on Radio Direction Finding (1899 - 1995) Collection. (See Calhoun record https://calhoun.nps.edu/handle/10945/57364 for further information on this collection and the bibliography). Due to issues of technological obsolescence preventing current and future audiences from accessing the bibliography, DKL exported and converted into the three files on this record the various databases contained in the CD-ROM. The contents of these files are: 1) RDFA_CompleteBibliography_xls.zip [RDFA_CompleteBibliography.xls: Metadata for the complete bibliography, in Excel 97-2003 Workbook format; RDFA_Glossary.xls: Glossary of terms, in Excel 97-2003 Workbookformat; RDFA_Biographies.xls: Biographies of leading figures, in Excel 97-2003 Workbook format]; 2) RDFA_CompleteBibliography_csv.zip [RDFA_CompleteBibliography.TXT: Metadata for the complete bibliography, in CSV format; RDFA_Glossary.TXT: Glossary of terms, in CSV format; RDFA_Biographies.TXT: Biographies of leading figures, in CSV format]; 3) RDFA_CompleteBibliography.pdf: A human readable display of the bibliographic data, as a means of double-checking any possible deviations due to conversion