Compressed Data Structures for Dynamic Sequences

We consider the problem of storing a dynamic string $S$ over an alphabet $\Sigma=\{\,1,\ldots,\sigma\,\}$ in compressed form. Our representation supports insertions and deletions of symbols and answers three fundamental queries: $\mathrm{access}(i,S)$ returns the $i$-th symbol in $S$, $\mathrm{rank}_a(i,S)$ counts how many times a symbol $a$ occurs among the first $i$ positions in $S$, and $\mathrm{select}_a(i,S)$ finds the position where a symbol $a$ occurs for the $i$-th time. We present the first fully-dynamic data structure for arbitrarily large alphabets that achieves optimal query times for all three operations and supports updates with worst-case time guarantees. Ours is also the first fully-dynamic data structure that needs only $nH_k+o(n\log\sigma)$ bits, where $H_k$ is the $k$-th order entropy and $n$ is the string length. Moreover our representation supports extraction of a substring $S[i..i+\ell]$ in optimal $O(\log n/\log\log n + \ell/\log_{\sigma}n)$ time

Succinct Dictionary Matching With No Slowdown

The problem of dictionary matching is a classical problem in string matching: given a set S of d strings of total length n characters over an (not necessarily constant) alphabet of size sigma, build a data structure so that we can match in a any text T all occurrences of strings belonging to S. The classical solution for this problem is the Aho-Corasick automaton which finds all occ occurrences in a text T in time O(|T| + occ) using a data structure that occupies O(m log m) bits of space where m <= n + 1 is the number of states in the automaton. In this paper we show that the Aho-Corasick automaton can be represented in just m(log sigma + O(1)) + O(d log(n/d)) bits of space while still maintaining the ability to answer to queries in O(|T| + occ) time. To the best of our knowledge, the currently fastest succinct data structure for the dictionary matching problem uses space O(n log sigma) while answering queries in O(|T|log log n + occ) time. In this paper we also show how the space occupancy can be reduced to m(H0 + O(1)) + O(d log(n/d)) where H0 is the empirical entropy of the characters appearing in the trie representation of the set S, provided that sigma < m^epsilon for any constant 0 < epsilon < 1. The query time remains unchanged.Comment: Corrected typos and other minor error

The Quantum Geometric Phase between Orthogonal States

We show that the geometric phase between any two states, including orthogonal states, can be computed and measured using the notion of projective measurement, and we show that a topological number can be extracted in the geometric phase change in an infinitesimal loop near an orthogonal state. Also, the Pancharatnam phase change during the passage through an orthogonal state is shown to be either $\pi$ or zero (mod $2\pi$). All the off-diagonal geometric phases can be obtained from the projective geometric phase calculated with our generalized connection

BOSS-LDG: A Novel Computational Framework that Brings Together Blue Waters, Open Science Grid, Shifter and the LIGO Data Grid to Accelerate Gravitational Wave Discovery

We present a novel computational framework that connects Blue Waters, the NSF-supported, leadership-class supercomputer operated by NCSA, to the Laser Interferometer Gravitational-Wave Observatory (LIGO) Data Grid via Open Science Grid technology. To enable this computational infrastructure, we configured, for the first time, a LIGO Data Grid Tier-1 Center that can submit heterogeneous LIGO workflows using Open Science Grid facilities. In order to enable a seamless connection between the LIGO Data Grid and Blue Waters via Open Science Grid, we utilize Shifter to containerize LIGO's workflow software. This work represents the first time Open Science Grid, Shifter, and Blue Waters are unified to tackle a scientific problem and, in particular, it is the first time a framework of this nature is used in the context of large scale gravitational wave data analysis. This new framework has been used in the last several weeks of LIGO's second discovery campaign to run the most computationally demanding gravitational wave search workflows on Blue Waters, and accelerate discovery in the emergent field of gravitational wave astrophysics. We discuss the implications of this novel framework for a wider ecosystem of Higher Performance Computing users.Comment: 10 pages, 10 figures. Accepted as a Full Research Paper to the 13th IEEE International Conference on eScienc

Chain walking of allylrhodium species towards esters during rhodium-catalyzed nucleophilic allylations of imines

Allylrhodium species derived from δ-trifluoroboryl β,γ-unsaturated esters undergo chain walking towards the ester moiety.The resulting allylrhodium species react with imines to give products containing two new stereocenters and a Z-alkene. By using a chiral diene ligand, products can be obtained with high enantioselectivities, where a pronounced matched/mismatched effect with the chirality of the allyltrifluoroborate is evident

Properties of nonaqueous electrolytes Sixth summary report, 20 Sep. 1967 - 19 Mar. 1968

Physical properties and structural studies on propylene carbonate, dimethyl formamide, and acetonitrile solvent electrolyte

Economic evidence for the prevention and treatment of atopic eczema: a protocol for a systematic review

Background: Eczema, synonymous with atopic eczema or atopic dermatitis, is a chronic skin disease that has a similar impact on health-related quality of life as other chronic diseases. The proposed research aims to provide a comprehensive systematic assessment of the economic evidence base available to inform economic modelling and decision making on interventions to prevent and treat eczema at any stage of the life course. Whilst the Global Resource of Eczema Trials (GREAT) database collects together the effectiveness evidence for eczema there is currently no such systematic resource on the economics of eczema. It is important to gain an overview of the current state of the art of economic methods in the field of eczema in order to strengthen the economic evidence base further. Methods/design: The proposed study is a systematic review of the economic evidence surrounding interventions for the prevention and treatment of eczema. Relevant search terms will be used to search MEDLINE, EMBASE, Database of Abstracts of Reviews of Effects, Cochrane Database of Systematic Reviews, Cochrane Central Register of Controlled Trials, NHS Economic Evaluation Database, Health Technology Assessment, Cumulative Index to Nursing and Allied Health Literature, Econ Lit, Scopus, Cost-Effectiveness Analysis Registry and Web of Science in order to identify relevant evidence. To be eligible for inclusion studies will be primary empirical studies evaluating the cost, utility or full economic evaluation of interventions for preventing or treating eczema. Two reviewers will independently assess studies for eligibility and perform data abstraction. Evidence tables will be produced presenting details of study characteristics, costing methods, outcome methods and quality assessment. The methodological quality of studies will be assessed using accepted checklists. Discussion: The systematic review is being undertaken to identify the type of economic evidence available, summarise the results of the available economic evidence and critically appraise the quality of economic evidence currently available to inform future economic modelling and resource allocation decisions about interventions to prevent or treat eczema. We aim to use the review to offer guidance about how to gather economic evidence in studies of eczema and/or what further research is necessary in order to inform this

Repurposing Albendazole: new potential as a chemotherapeutic agent with preferential activity against HPV-negative head and neck squamous cell cancer.

Albendazole is an anti-helminthic drug that has been shown to exhibit anti-cancer properties, however its activity in head and neck squamous cell cancer (HNSCC) was unknown. Using a series of in vitro assays, we assessed the ability of albendazole to inhibit proliferation in 20 HNSCC cell lines across a range of albendazole doses (1 nM-10 μM). Cell lines that responded to treatment were further examined for cell death, inhibition of migration and cell cycle arrest. Thirteen of fourteen human papillomavirus-negative HNSCC cell lines responded to albendazole, with an average IC50 of 152 nM. In contrast, only 3 of 6 human papillomavirus-positive HNSCC cell lines responded. Albendazole treatment resulted in apoptosis, inhibition of cell migration, cell cycle arrest in the G2/M phase and altered tubulin distribution. Normal control cells were not measurably affected by any dose tested. This study indicates that albendazole acts to inhibit the proliferation of human papillomavirus-negative HNSCC cell lines and thus warrants further study as a potential chemotherapeutic agent for patients suffering from head and neck cancer

Efficient Representation of Multidimensional Data over Hierarchical Domains

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-46049-9_19[Abstract] We consider the problem of representing multidimensional data where the domain of each dimension is organized hierarchically, and the queries require summary information at a different node in the hierarchy of each dimension. This is the typical case of OLAP databases. A basic approach is to represent each hierarchy as a one-dimensional line and recast the queries as multidimensional range queries. This approach can be implemented compactly by generalizing to more dimensions the k2k2 -treap, a compact representation of two-dimensional points that allows for efficient summarization queries along generic ranges. Instead, we propose a more flexible generalization, which instead of a generic quadtree-like partition of the space, follows the domain hierarchies across each dimension to organize the partitioning. The resulting structure is much more efficient than a generic multidimensional structure, since queries are resolved by aggregating much fewer nodes of the tree.Ministerio de Economía, Industria y Competitividad; TIN2013-46238-C4-3-RMinisterio de Economía, Industria y Competitividad; IDI-20141259Ministerio de Economía, Industria y Competitividad; ITC-20151305Ministerio de Economía y Competitividad; ITC-20151247Xunta de Galicia; GRC2013/053Chile.Fondo Nacional de Desarrollo Científico y Tecnológico; 1-140796COST. IC130