An Efficient Representation for Filtrations of Simplicial Complexes

A filtration over a simplicial complex $K$ is an ordering of the simplices of $K$ such that all prefixes in the ordering are subcomplexes of $K$. Filtrations are at the core of Persistent Homology, a major tool in Topological Data Analysis. In order to represent the filtration of a simplicial complex, the entire filtration can be appended to any data structure that explicitly stores all the simplices of the complex such as the Hasse diagram or the recently introduced Simplex Tree [Algorithmica '14]. However, with the popularity of various computational methods that need to handle simplicial complexes, and with the rapidly increasing size of the complexes, the task of finding a compact data structure that can still support efficient queries is of great interest. In this paper, we propose a new data structure called the Critical Simplex Diagram (CSD) which is a variant of the Simplex Array List (SAL) [Algorithmica '17]. Our data structure allows one to store in a compact way the filtration of a simplicial complex, and allows for the efficient implementation of a large range of basic operations. Moreover, we prove that our data structure is essentially optimal with respect to the requisite storage space. Finally, we show that the CSD representation admits fast construction algorithms for Flag complexes and relaxed Delaunay complexes.Comment: A preliminary version appeared in SODA 201

Building Efficient and Compact Data Structures for Simplicial Complexes

The Simplex Tree (ST) is a recently introduced data structure that can represent abstract simplicial complexes of any dimension and allows efficient implementation of a large range of basic operations on simplicial complexes. In this paper, we show how to optimally compress the Simplex Tree while retaining its functionalities. In addition, we propose two new data structures called the Maximal Simplex Tree (MxST) and the Simplex Array List (SAL). We analyze the compressed Simplex Tree, the Maximal Simplex Tree, and the Simplex Array List under various settings.Comment: An extended abstract appeared in the proceedings of SoCG 201

Enforcing public data archiving policies in academic publishing: A study of ecology journals

To improve the quality and efficiency of research, groups within the scientific community seek to exploit the value of data sharing. Funders, institutions, and specialist organizations are developing and implementing strategies to encourage or mandate data sharing within and across disciplines, with varying degrees of success. Academic journals in ecology and evolution have adopted several types of public data archiving policies requiring authors to make data underlying scholarly manuscripts freely available. Yet anecdotes from the community and studies evaluating data availability suggest that these policies have not obtained the desired effects, both in terms of quantity and quality of available datasets. We conducted a qualitative, interview-based study with journal editorial staff and other stakeholders in the academic publishing process to examine how journals enforce data archiving policies. We specifically sought to establish who editors and other stakeholders perceive as responsible for ensuring data completeness and quality in the peer review process. Our analysis revealed little consensus with regard to how data archiving policies should be enforced and who should hold authors accountable for dataset submissions. Themes in interviewee responses included hopefulness that reviewers would take the initiative to review datasets and trust in authors to ensure the completeness and quality of their datasets. We highlight problematic aspects of these thematic responses and offer potential starting points for improvement of the public data archiving process.Comment: 35 pages, 1 figure, 1 tabl

TECHNIQUES TO FACILITATE REDUNDANCY FOR DYNAMIC TELEMETRY SUBSCRIPTIONS IN A NETWORK ENVIRONMENT

Network administrators often desire redundancy when creating telemetry subscriptions in order to ensure that updates are not lost if a particular receiver fails. However, dynamic telemetry subscriptions do not offer a natural way to achieve such a redundancy. Proposed herein are techniques to facilitate redundancy for dynamic telemetry subscriptions through which multiple telemetry data receivers, that each initiate a dynamic telemetry subscription Remote Procedure Call (RPC) towards a device, can be attached to an existing subscription initiated by a first receiver as long as parameters for the subscription RPCs initiated by the receivers are identical to parameters for the existing subscription initiated by the first receiver. Such techniques can be utilized to reduce duplication in collecting data from a backend and also to enable higher scaling

Building Efficient and Compact Data Structures for Simplicial Complexes

The Simplex Tree (ST) is a recently introduced data structure that can represent abstract simplicial complexes of any dimension and allows efficient implementation of a large range of basic operations on simplicial complexes. In this paper, we show how to optimally compress the Simplex Tree while retaining its functionalities. In addition, we propose two new data structures called Maximal Simplex Tree (MxST) and Simplex Array List (SAL). We analyze the compressed Simplex Tree, the Maximal Simplex Tree, and the Simplex Array List under various settings

SILLi 1.0: A 1D Numerical Tool Quantifying the Thermal Effects of Sill Intrusions

Igneous intrusions in sedimentary basins may have a profound effect on the thermal structure and physical properties of the hosting sedimentary rocks. These include mechanical effects such as deformation and uplift of sedimentary layers, generation of overpressure, mineral reactions and porosity evolution, and fracturing and vent formation following devolatilization reactions and the generation of CO2 and CH4. The gas generation and subsequent migration and venting may have contributed to several of the past climatic changes such as the end-Permian event and the Paleocene-Eocene Thermal Maximum. Additionally, the generation and expulsion of hydrocarbons and cracking of pre-existing oil reservoirs around a hot magmatic intrusion is of significant interest to the energy industry. In this paper, we present a user-friendly 1D FEM based tool, SILLi, which calculates the thermal effects of sill intrusions on the enclosing sedimentary stratigraphy. The model is accompanied by three case studies of sills emplaced in two different sedimentary basins, the Karoo Basin in South Africa and the Vøring Basin offshore Norway. Input data for the model is the present-day well log or sedimentary column with an Excel input file and includes rock parameters such as thermal conductivity, total organic carbon (TOC) content, porosity, and latent heats. The model accounts for sedimentation and burial based on a rate calculated by the sedimentary layer thickness and age. Erosion of the sedimentary column is also included to account for realistic basin evolution. Multiple sills can be emplaced within the system with varying ages. The emplacement of a sill occurs instantaneously. The model can be applied to volcanic sedimentary basins occurring globally. The model output includes the thermal evolution of the sedimentary column through time, and the changes that take place following sill emplacement such as TOC changes, thermal maturity, and the amount of organic and carbonate-derived CO2. The TOC and vitrinite results can be readily benchmarked within the tool to present-day values measured within the sedimentary column. This allows the user to determine the conditions required to obtain results that match observables and leads to a better understanding of metamorphic processes in sedimentary basins

PhyNetLab: An IoT-Based Warehouse Testbed

Future warehouses will be made of modular embedded entities with communication ability and energy aware operation attached to the traditional materials handling and warehousing objects. This advancement is mainly to fulfill the flexibility and scalability needs of the emerging warehouses. However, it leads to a new layer of complexity during development and evaluation of such systems due to the multidisciplinarity in logistics, embedded systems, and wireless communications. Although each discipline provides theoretical approaches and simulations for these tasks, many issues are often discovered in a real deployment of the full system. In this paper we introduce PhyNetLab as a real scale warehouse testbed made of cyber physical objects (PhyNodes) developed for this type of application. The presented platform provides a possibility to check the industrial requirement of an IoT-based warehouse in addition to the typical wireless sensor networks tests. We describe the hardware and software components of the nodes in addition to the overall structure of the testbed. Finally, we will demonstrate the advantages of the testbed by evaluating the performance of the ETSI compliant radio channel access procedure for an IoT warehouse

Scrambling and quantum chaos indicators from long-time properties of operator distributions

Scrambling is a key concept in the analysis of nonequilibrium properties of quantum many-body systems. Most studies focus on its characterization via out-of-time-ordered correlation functions (OTOCs), particularly through the early-time decay of the OTOC. However, scrambling is a complex process which involves operator spreading and operator entanglement, and a full characterization requires one to access more refined information on the operator dynamics at several timescales. In this work we analyze operator scrambling by expanding the target operator in a complete basis and studying the structure of the expansion coefficients treated as a coarse-grained probability distribution in the space of operators. We study different features of this distribution, such as its mean, variance, and participation ratio, for the Ising model with longitudinal and transverse fields, kicked collective spin models, and random circuit models. We show that the long-time properties of the operator distribution display common features across these cases, and discuss how these properties can be used as a proxy for the onset of quantum chaos. Finally, we discuss the connection with OTOCs and analyze the cost of probing the operator distribution experimentally using these correlation functions.Comment: Main text: 14 pages, 7 figures. Appendices: 3 pages, 3 figure