A powerful heuristic for telephone gossiping

A refined heuristic for computing schedules for gossiping in the telephone model is presented. The heuristic is fast: for a network with n nodes and m edges, requiring R rounds for gossiping, the running time is O(R n log(n) m) for all tested classes of graphs. This moderate time consumption allows to compute gossiping schedules for networks with more than 10,000 PUs and 100,000 connections. The heuristic is good: in practice the computed schedules never exceed the optimum by more than a few rounds. The heuristic is versatile: it can also be used for broadcasting and more general information dispersion patterns. It can handle both the unit-cost and the linear-cost model. Actually, the heuristic is so good, that for CCC, shuffle-exchange, butterfly de Bruijn, star and pancake networks the constructed gossiping schedules are better than the best theoretically derived ones. For example, for gossiping on a shuffle-exchange network with 2^{13} PUs, the former upper bound was 49 rounds, while our heuristic finds a schedule requiring 31 rounds. Also for broadcasting the heuristic improves on many formerly known results. A second heuristic, works even better for CCC, butterfly, star and pancake networks. For example, with this heuristic we found that gossiping on a pancake network with 7! PUs can be performed in 15 rounds, 2 fewer than achieved by the best theoretical construction. This second heuristic is less versatile than the first, but by refined search techniques it can tackle even larger problems, the main limitation being the storage capacity. Another advantage is that the constructed schedules can be represented concisely

Science Goals and Overview of the Radiation Belt Storm Probes (RBSP) Energetic Particle, Composition, and Thermal Plasma (ECT) Suite on NASA’s Van Allen Probes Mission

The Radiation Belt Storm Probes (RBSP)-Energetic Particle, Composition, and Thermal Plasma (ECT) suite contains an innovative complement of particle instruments to ensure the highest quality measurements ever made in the inner magnetosphere and radiation belts. The coordinated RBSP-ECT particle measurements, analyzed in combination with fields and waves observations and state-of-the-art theory and modeling, are necessary for understanding the acceleration, global distribution, and variability of radiation belt electrons and ions, key science objectives of NASA’s Living With a Star program and the Van Allen Probes mission. The RBSP-ECT suite consists of three highly-coordinated instruments: the Magnetic Electron Ion Spectrometer (MagEIS), the Helium Oxygen Proton Electron (HOPE) sensor, and the Relativistic Electron Proton Telescope (REPT). Collectively they cover, continuously, the full electron and ion spectra from one eV to 10’s of MeV with sufficient energy resolution, pitch angle coverage and resolution, and with composition measurements in the critical energy range up to 50 keV and also from a few to 50 MeV/nucleon. All three instruments are based on measurement techniques proven in the radiation belts. The instruments use those proven techniques along with innovative new designs, optimized for operation in the most extreme conditions in order to provide unambiguous separation of ions and electrons and clean energy responses even in the presence of extreme penetrating background environments. The design, fabrication and operation of ECT spaceflight instrumentation in the harsh radiation belt environment ensure that particle measurements have the fidelity needed for closure in answering key mission science questions. ECT instrument details are provided in companion papers in this same issue. In this paper, we describe the science objectives of the RBSP-ECT instrument suite on the Van Allen Probe spacecraft within the context of the overall mission objectives, indicate how the characteristics of the instruments satisfy the requirements to achieve these objectives, provide information about science data collection and dissemination, and conclude with a description of some early mission results

Interconnection networks for parallel and distributed computing

Parallel computers are generally either shared-memory machines or distributed- memory machines. There are currently technological limitations on shared-memory architectures and so parallel computers utilizing a large number of processors tend tube distributed-memory machines. We are concerned solely with distributed-memory multiprocessors. In such machines, the dominant factor inhibiting faster global computations is inter-processor communication. Communication is dependent upon the topology of the interconnection network, the routing mechanism, the flow control policy, and the method of switching. We are concerned with issues relating to the topology of the interconnection network. The choice of how we connect processors in a distributed-memory multiprocessor is a fundamental design decision. There are numerous, often conflicting, considerations to bear in mind. However, there does not exist an interconnection network that is optimal on all counts and trade-offs have to be made. A multitude of interconnection networks have been proposed with each of these networks having some good (topological) properties and some not so good. Existing noteworthy networks include trees, fat-trees, meshes, cube-connected cycles, butterflies, Möbius cubes, hypercubes, augmented cubes, k-ary n-cubes, twisted cubes, n-star graphs, (n, k)-star graphs, alternating group graphs, de Bruijn networks, and bubble-sort graphs, to name but a few. We will mainly focus on k-ary n-cubes and (n, k)-star graphs in this thesis. Meanwhile, we propose a new interconnection network called augmented k-ary n- cubes. The following results are given in the thesis.1. Let k ≥ 4 be even and let n ≥ 2. Consider a faulty k-ary n-cube Q(^k_n) in which the number of node faults f(_n) and the number of link faults f(_e) are such that f(_n) + f(_e) ≤ 2n - 2. We prove that given any two healthy nodes s and e of Q(^k_n), there is a path from s to e of length at least k(^n) - 2f(_n) - 1 (resp. k(^n) - 2f(_n) - 2) if the nodes s and e have different (resp. the same) parities (the parity of a node Q(^k_n) in is the sum modulo 2 of the elements in the n-tuple over 0, 1, ∙∙∙ , k - 1 representing the node). Our result is optimal in the sense that there are pairs of nodes and fault configurations for which these bounds cannot be improved, and it answers questions recently posed by Yang, Tan and Hsu, and by Fu. Furthermore, we extend known results, obtained by Kim and Park, for the case when n = 2.2. We give precise solutions to problems posed by Wang, An, Pan, Wang and Qu and by Hsieh, Lin and Huang. In particular, we show that Q(^k_n) is bi-panconnected and edge-bipancyclic, when k ≥ 3 and n ≥ 2, and we also show that when k is odd, Q(^k_n) is m-panconnected, for m = (^n(k - 1) + 2k - 6’ / ‘_2), and (k -1) pancyclic (these bounds are optimal). We introduce a path-shortening technique, called progressive shortening, and strengthen existing results, showing that when paths are formed using progressive shortening then these paths can be efficiently constructed and used to solve a problem relating to the distributed simulation of linear arrays and cycles in a parallel machine whose interconnection network is Q(^k_n) even in the presence of a faulty processor.3. We define an interconnection network AQ(^k_n) which we call the augmented k-ary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional hypercube to an n-dimensional augmented cube. We prove that the augmented k-ary n-cube Q(^k_n) has a number of attractive properties (in the context of parallel computing). For example, we show that the augmented k-ary n-cube Q(^k_n) - is a Cayley graph (and so is vertex-symmetric); has connectivity 4n - 2, and is such that we can build a set of 4n - 2 mutually disjoint paths joining any two distinct vertices so that the path of maximal length has length at most max{{n- l)k- (n-2), k + 7}; has diameter [(^k) / (_3)] + [(^k - 1) /( _3)], when n = 2; and has diameter at most (^k) / (_4) (n+ 1), for n ≥ 3 and k even, and at most [(^k)/ (_4) (n + 1) + (^n) / (_4), for n ^, for n ≥ 3 and k odd.4. We present an algorithm which given a source node and a set of n - 1 target nodes in the (n, k)-star graph S(_n,k) where all nodes are distinct, builds a collection of n - 1 node-disjoint paths, one from each target node to the source. The collection of paths output from the algorithm is such that each path has length at most 6k - 7, and the algorithm has time complexity O(k(^3)n(^4))

Optimal broadcasting in treelike graphs

Broadcasting is an information dissemination problem in a connected network, in which one node, called the originator , disseminates a message to all other nodes by placing a series of calls along the communication lines of the network. Once informed, the nodes aid the originator in distributing the message. Finding the broadcast time of a vertex in an arbitrary graph is NP-complete. The problem is solved polynomially only for a few classes of graphs. In this thesis we study the broadcast problem in different classes of graphs which have various similarities to trees. The unicyclic graph is the simplest graph family after trees, it is a connected graph with only one cycle in it. We provide a linear time solution for the broadcast problem in unicyclic graphs. We also studied graphs with increasing number of cycles and complexity and provide again polynomial time solutions. These graph families are: tree of cycles, necklace graphs, and 2-restricted cactus graphs. We also define the fully connected tree graphs and provide a polynomial solution and use these results to obtain polynomial solution for the broadcast problem in tree of cliques and a constant approximation algorithm for the hierarchical tree cluster networks

Aquatic Invasions: Causes, Consequences, And Solutions

Invasive species represent a global threat to ecosystems, human health, and the economy. A basic knowledge of invasive species biology is crucial to understand current and future impacts and implications. The purpose of this book is to provide a broad background on invasive species, and also details on specific examples through case studies. The students in the course Aquatic Invasive Species (MAR 442) at the University of New England in Biddeford, Maine, have researched and reviewed scientific literature to educate readers about these issues. The class, comprised of twelve junior and senior Marine Science, Marine Affairs, Applied Mathematics, and Environmental Sciences students, selected the different topics, presented the material, wrote the chapters, and assembled the final versions into this book. This book cannot be all inclusive, but we think this book will provide an excellent broad overview of the most important aspects of Invasive Species Biology and might stimulate the reader to dive deeper into the material.https://dune.une.edu/marinesci_studproj/1002/thumbnail.jp

Properties and algorithms of the (n, k)-star graphs

The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was proposed as an attractive alternative to the popular hypercube. The major advantage of the (n, k )-star network is its scalability, which makes it more flexible than the n-star as an interconnection network. In this thesis, we will focus on finding graph theoretical properties of the (n, k )-star as well as developing parallel algorithms that run on this network. The basic topological properties of the (n, k )-star are first studied. These are useful since they can be used to develop efficient algorithms on this network. We then study the (n, k )-star network from algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms for basic communication, prefix computation, and sorting, etc. A literature review of the state-of-the-art in relation to the (n, k )-star network as well as some open problems in this area are also provided

Multi-Modal Topic Sentiment Analytics for Twitter

Title from PDF of title page viewed February 1, 2019Thesis advisor: Yugyung LeeVitaIncludes bibliographical references (pages 50-53)Thesis (M.S.)--School of Computing and Engineering, University of Missouri--Kansas City, 2018Sentiment analysis has proven to be very successful in text applications. Social media is also considered a quite rich source to get data regarding user’s behaviors and preference. Identifying social context would make the sentiment analysis more meaningful to the applications. Due to the limited contextual information in social media, it would be quite challenging to conduct context-aware sentiment analysis with social media. Promising frameworks such as CoreNLP, Text Blob, and Vader have been introduced to identify sentiments in the text. However, it seems to not be adequate to contextual sentiment analysis in social media like Twitter. In this thesis, we present a contextual sentiment framework that is designed to leverage the power of the multiple models in the social context. The framework aims to classify contextual sentiment from the Twitter data as well as to discover hidden trends and topics (context) using topic modeling techniques like Latent Dirichlet Allocation (LDA). We have focused on the mismatch cases among multiple models in which different experts (models) have different opinions on social media sentiments. We have identified the five mismatch types in the social sentiment through the analysis of diverse experiments ( human machine model, and machine-machine model). We have implemented the mismatch detection among the three models (i.e., Vader, Text Blob, and CoreNLP) and automatically corrected them by applying semantic rules to sentiment models. We compared our approach against a traditional single model approach concerning a performance metric (accuracy) and Kappa (evaluating consensus among multi-models) on three benchmarks datasets and our dataset we collected from a health dieting domain. The proposed framework showed notable performance improvement in comparison with the traditional one concerning both evaluation metrics.Introduction -- Background and related work -- Proposed framework -- Results and evaluations -- Conclusion and future wor

Properties and algorithms of the (n, k)-arrangement graphs

The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is more flexible in degree and diameter. However, there are few algorithms designed for the (n, k)-arrangement graph up to present. In this thesis, we will focus on finding graph theoretical properties of the (n, k)- arrangement graph and developing parallel algorithms that run on this network. The topological properties of the arrangement graph are first studied. They include the cyclic properties. We then study the problems of communication: broadcasting and routing. Embedding problems are also studied later on. These are very useful to develop efficient algorithms on this network. We then study the (n, k )-arrangement network from the algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms such as prefix sums computation, sorting, merging and basic geometry computation: finding convex hull on the (n, k )-arrangement graph. A literature review of the state-of-the-art in relation to the (n, k)-arrangement network is also provided, as well as some open problems in this area

Representation and execution of human know-how on the Web

Structured data has been a major component of web resources since the very beginning of the web. Metadata that was originally mostly meant for display purposes gradually expanded to incorporate the semantic content of a page. Until now semantic data on the web has mostly focused on factual knowledge, namely trying to capture “what humans know”. This thesis instead focuses on procedural knowledge, or in other words, “how humans do things”, and in particular on step-by-step instructions. I will present a semantic framework to capture the meaning of sets of instructions with respect to their potential execution. This framework is based on a logical model which I evaluated in terms of its expressiveness and it compatibility with existing languages. I will show how this type of procedural knowledge can be automatically acquired from human-generated instructions on the web, while at the same time bridging the semantic gap, from unstructured to structured, by mapping these resources into a formal process description language. I will demonstrate how procedural and factual data on the web can be integrated automatically using Linked Data, and how this integration results in an overall richer semantic representation. To validate these claims I have conducted large scale knowledge acquisition and integration experiments on two prominent instructional websites and evaluated the results against a human benchmark. Finally, I will demonstrate how existing web technologies allow for this data to seamlessly enrich existing web resources and to be used on the web without the need for centralisation. I have explored the potential uses of formalised instructions by the implementation and testing of concrete prototypes which enable human users to explore know-how and collaborate with machines in novel ways

Randomised Algorithms on Networks

Networks form an indispensable part of our lives. In particular, computer networks have ranked amongst the most influential networks in recent times. In such an ever-evolving and fast growing network, the primary concern is to understand and analyse different aspects of the network behaviour, such as the quality of service and efficient information propagation. It is also desirable to predict the behaviour of a large computer network if, for example, one of the computers is infected by a virus. In all of the aforementioned cases, we need protocols that are able to make local decisions and handle the dynamic changes in the network topology. Here, randomised algorithms are preferred because many deterministic algorithms often require a central control. In this thesis, we investigate three network-based randomised algorithms, threshold load balancing with weighted tasks, the pull-Moran process and the coalescing-branching random walk. Each of these algorithms has extensive applicability within networks and computational complexity within computer science. In this thesis we investigate threshold-based load balancing protocols. We introduce a generalisation of protocols in [2, 3] to weighted tasks. This thesis also analyses an evolutionary-based process called the death-birth update, defined here as the Pull-Moran process. We show that a class of strong universal amplifiers does not exist for the Pull-Moran process. We show that any class of selective amplifiers in the (standard) Moran process is a class of selective suppressors under the Pull-Moran process. We then introduce a class of selective amplifiers called Punk graphs. Finally, we improve the broadcasting time of the coalescing-branching (COBRA) walk analysed in [4], for random regular graphs. Here, we look into the COBRA approach as a randomised rumour spreading protocol