External-Memory Graph Algorithms

We present a collection of new techniques for designing and analyzing efficient external-memory algorithms for graph problems and illustrate how these techniques can be applied to a wide variety of specific problems. Our results include: Proximate-neighboring. We present a simple method for deriving external-memory lower bounds via reductions from a problem we call the “proximate neighbors” problem. We use this technique to derive non-trivial lower bounds for such problems as list ranking, expression tree evaluation, and connected components. PRAM simulation. We give methods for efficiently simulating PRAM computations in external memory, even for some cases in which the PRAM algorithm is not work-optimal. We apply this to derive a number of optimal (and simple) external-memory graph algorithms. Time-forward processing. We present a general technique for evaluating circuits (or “circuit-like” computations) in external memory. We also usethis in a deterministic list ranking algorithm. Deterministic 3-coloring of a cycle. We give several optimal methods for 3-coloring a cycle, which can be used as a subroutine for finding large independent sets for list ranking. Our ideas go beyond a straightforward PRAM simulation, and may be of independent interest. External depth-first search. We discuss a method for performing depth first search and solving related problems efficiently in external memory. Our technique can be used in conjunction with ideas due to Ullman and Yannakakis in order to solve graph problems involving closed semi-ring computations even when their assumption that vertices fit in main memory does not hold. Our techniques apply to a number of problems, including list ranking, which we discuss in detail, finding Euler tours, expression-tree evaluation, centroid decomposition of a tree, least-common ancestors, minimum spanning tree verification, connected and biconnected components, minimum spanning forest, ear decomposition, topological sorting, reachability, graph drawing, and visibility representation

A physically meaningful method for the comparison of potential energy functions

In the study of the conformational behavior of complex systems, such as proteins, several related statistical measures are commonly used to compare two different potential energy functions. Among them, the Pearson's correlation coefficient r has no units and allows only semi-quantitative statements to be made. Those that do have units of energy and whose value may be compared to a physically relevant scale, such as the root mean square deviation (RMSD), the mean error of the energies (ER), the standard deviation of the error (SDER) or the mean absolute error (AER), overestimate the distance between potentials. Moreover, their precise statistical meaning is far from clear. In this article, a new measure of the distance between potential energy functions is defined which overcomes the aforementioned difficulties. In addition, its precise physical meaning is discussed, the important issue of its additivity is investigated and some possible applications are proposed. Finally, two of these applications are illustrated with practical examples: the study of the van der Waals energy, as implemented in CHARMM, in the Trp-Cage protein (PDB code 1L2Y) and the comparison of different levels of the theory in the ab initio study of the Ramachandran map of the model peptide HCO-L-Ala-NH2.Comment: 30 pages, 7 figures, LaTeX, BibTeX. v2: A misspelling in the author's name has been corrected. v3: A new application of the method has been added at the end of section 9 and minor modifications have also been made in other sections. v4: Journal reference and minor corrections adde

RFID Localisation For Internet Of Things Smart Homes: A Survey

The Internet of Things (IoT) enables numerous business opportunities in fields as diverse as e-health, smart cities, smart homes, among many others. The IoT incorporates multiple long-range, short-range, and personal area wireless networks and technologies into the designs of IoT applications. Localisation in indoor positioning systems plays an important role in the IoT. Location Based IoT applications range from tracking objects and people in real-time, assets management, agriculture, assisted monitoring technologies for healthcare, and smart homes, to name a few. Radio Frequency based systems for indoor positioning such as Radio Frequency Identification (RFID) is a key enabler technology for the IoT due to its costeffective, high readability rates, automatic identification and, importantly, its energy efficiency characteristic. This paper reviews the state-of-the-art RFID technologies in IoT Smart Homes applications. It presents several comparable studies of RFID based projects in smart homes and discusses the applications, techniques, algorithms, and challenges of adopting RFID technologies in IoT smart home systems.Comment: 18 pages, 2 figures, 3 table

Simple and Nearly Optimal Polynomial Root-finding by Means of Root Radii Approximation

We propose a new simple but nearly optimal algorithm for the approximation of all sufficiently well isolated complex roots and root clusters of a univariate polynomial. Quite typically the known root-finders at first compute some crude but reasonably good approximations to well-conditioned roots (that is, those isolated from the other roots) and then refine the approximations very fast, by using Boolean time which is nearly optimal, up to a polylogarithmic factor. By combining and extending some old root-finding techniques, the geometry of the complex plane, and randomized parametrization, we accelerate the initial stage of obtaining crude to all well-conditioned simple and multiple roots as well as isolated root clusters. Our algorithm performs this stage at a Boolean cost dominated by the nearly optimal cost of subsequent refinement of these approximations, which we can perform concurrently, with minimum processor communication and synchronization. Our techniques are quite simple and elementary; their power and application range may increase in their combination with the known efficient root-finding methods.Comment: 12 pages, 1 figur