Reflexivity of the translation-dilation algebras on L^2(R)

The hyperbolic algebra A_h, studied recently by Katavolos and Power, is the weak star closed operator algebra on L^2(R) generated by H^\infty(R), as multiplication operators, and by the dilation operators V_t, t \geq 0, given by V_t f(x) = e^{t/2} f(e^t x). We show that A_h is a reflexive operator algebra and that the four dimensional manifold Lat A_h (with the natural topology) is the reflexive hull of a natural two dimensional subspace.Comment: 10 pages, no figures To appear in the International Journal of Mathematic

A stochastic model for the evolution of the web allowing link deletion

Recently several authors have proposed stochastic evolutionary models for the growth of the web graph and other networks that give rise to power-law distributions. These models are based on the notion of preferential attachment leading to the ``rich get richer'' phenomenon. We present a generalisation of the basic model by allowing deletion of individual links and show that it also gives rise to a power-law distribution. We derive the mean-field equations for this stochastic model and show that by examining a snapshot of the distribution at the steady state of the model, we are able to tell whether any link deletion has taken place and estimate the link deletion probability. Our model enables us to gain some insight into the distribution of inlinks in the web graph, in particular it suggests a power-law exponent of approximately 2.15 rather than the widely published exponent of 2.1

Quantifying the efficiency and biases of forest Saccharomyces sampling strategies

Saccharomyces yeasts are emerging as model organisms for ecology and evolution, and researchers need environmental Saccharomyces isolates to test ecological and evolutionary hypotheses. However, methods for isolating Saccharomyces from nature have not been standardized and isolation methods may influence the genotypes and phenotypes of studied strains. We compared the effectiveness and potential biases of an established enrichment culturing method against a newly developed direct plating method for isolating forest floor Saccharomyces spp. In a European forest, enrichment culturing was both less successful at isolating S. paradoxus per sample collected and less labor intensive per isolated S. paradoxus colony than direct isolation. The two methods sampled similar S. paradoxus diversity: the number of unique genotypes sampled (i.e., genotypic diversity) per S. paradoxus isolate and average growth rates of S. paradoxus isolates did not differ between the two methods, and growth rate variances (i.e., phenotypic diversity) only differed in one of three tested environments. However, enrichment culturing did detect rare S. cerevisiae in the forest habitat, and also found two S. paradoxus isolates with outlier phenotypes. Our results validate the historically common method of using enrichment culturing to isolate representative collections of environmental Saccharomyces. We recommend that researchers choose a Saccharomyces sampling method based on resources available for sampling and isolate screening. Researchers interested in discovering new Saccharomyces phenotypes or rare Saccharomyces species from natural environments may also have more success using enrichment culturing. We include step-by-step sampling protocols in the supplemental materials

A Two-Player Game of Life

We present a new extension of Conway's game of life for two players, which we call p2life. P2life allows one of two types of token, black or white, to inhabit a cell, and adds competitive elements into the birth and survival rules of the original game. We solve the mean-field equation for p2life and determine by simulation that the asymptotic density of p2life approaches 0.0362.Comment: 7 pages, 3 figure

1-Hyperreflexivity and Complete Hyperreflexivity

The subspaces and subalgebras of B(H) which are hyperreflexive with constant 1 are completely classified. It is shown that there are 1-hyperreflexive subspaces for which the complete hyperreflexivity constant is strictly greater than 1. The constants for \bC T \otimes B(H) are analyzed in detail.Comment: 41 page

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

An introduction to Graph Data Management

A graph database is a database where the data structures for the schema and/or instances are modeled as a (labeled)(directed) graph or generalizations of it, and where querying is expressed by graph-oriented operations and type constructors. In this article we present the basic notions of graph databases, give an historical overview of its main development, and study the main current systems that implement them

A stochastic evolutionary model for capturing human dynamics

The recent interest in human dynamics has led researchers to investigate the stochastic processes that explain human behaviour in various contexts. Here we propose a generative model to capture the dynamics of survival analysis, traditionally employed in clinical trials and reliability analysis in engineering. We derive a general solution for the model in the form of a product, and then a continuous approximation to the solution via the renewal equation describing age-structured population dynamics. This enables us to model a wide range of survival distributions, according to the choice of the mortality distribution. We provide empirical evidence for the validity of the model from a longitudinal data set of popular search engine queries over 114 months, showing that the survival function of these queries is closely matched by the solution for our model with power-law mortality

Topological interactions in systems of mutually interlinked polymer rings

The topological interaction arising in interlinked polymeric rings such as DNA catenanes is considered. More specifically, the free energy for a pair of linked random walk rings is derived where the distance $R$ between two segments each of which is part of a different ring is kept constant. The topology conservation is imposed by the Gauss invariant. A previous approach (M.Otto, T.A. Vilgis, Phys.Rev.Lett. {\bf 80}, 881 (1998)) to the problem is refined in several ways. It is confirmed, that asymptotically, i.e. for large $R\gg R_G$ where $R_G$ is average size of single random walk ring, the effective topological interaction (free energy) scales $\propto R^4$.Comment: 16 pages, 3 figur

Standard errors and confidence intervals in within-subjects designs: Generalizing Loftus and Masson (1994) and avoiding the biases of alternative accounts

Repeated measures designs are common in experimental psychology. Because of the correlational structure in these designs, the calculation and interpretation of confidence intervals is nontrivial. One solution was provided by Loftus and Masson (Psychonomic Bulletin & Review 1:476–490, 1994). This solution, although widely adopted, has the limitation of implying same-size confidence intervals for all factor levels, and therefore does not allow for the assessment of variance homogeneity assumptions (i.e., the circularity assumption, which is crucial for the repeated measures ANOVA). This limitation and the method’s perceived complexity have sometimes led scientists to use a simplified variant, based on a per-subject normalization of the data (Bakeman & McArthur, Behavior Research Methods, Instruments, & Computers 28:584–589, 1996; Cousineau, Tutorials in Quantitative Methods for Psychology 1:42–45, 2005; Morey, Tutorials in Quantitative Methods for Psychology 4:61–64, 2008; Morrison & Weaver, Behavior Research Methods, Instruments, & Computers 27:52–56, 1995). We show that this normalization method leads to biased results and is uninformative with regard to circularity. Instead, we provide a simple, intuitive generalization of the Loftus and Masson method that allows for assessment of the circularity assumption