An Analysis of Some Refractive Error Trends in US Air Force Pilots and Navigators

Refractive error trends with age in US Air Force pilots and navigator

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

The visual standards for the selection and retention of astronauts, part 2

In preparation for the various studies planned for assessing visual capabilities and tasks in order to set vision standards for astronauts, the following pieces of equipment have been assembled and tested: a spectacle obstruction measuring device, a biometric glare susceptibility tester, a variable vergence amplitude testing device, an eye movement recorder, a lunar illumination simulation chamber, a night myopia testing apparatus, and retinal adaption measuring devices

The visual standards for the selection and retention of astronauts

Literature search with abstracts on visual performance standards for selection and retention of astronaut

A fine grained heuristic to capture web navigation patterns

In previous work we have proposed a statistical model to capture the user behaviour when browsing the web. The user navigation information obtained from web logs is modelled as a hypertext probabilistic grammar (HPG) which is within the class of regular probabilistic grammars. The set of highest probability strings generated by the grammar corresponds to the user preferred navigation trails. We have previously conducted experiments with a Breadth-First Search algorithm (BFS) to perform the exhaustive computation of all the strings with probability above a specified cut-point, which we call the rules. Although the algorithm’s running time varies linearly with the number of grammar states, it has the drawbacks of returning a large number of rules when the cut-point is small and a small set of very short rules when the cut-point is high. In this work, we present a new heuristic that implements an iterative deepening search wherein the set of rules is incrementally augmented by first exploring trails with high probability. A stopping parameter is provided which measures the distance between the current rule-set and its corresponding maximal set obtained by the BFS algorithm. When the stopping parameter takes the value zero the heuristic corresponds to the BFS algorithm and as the parameter takes values closer to one the number of rules obtained decreases accordingly. Experiments were conducted with both real and synthetic data and the results show that for a given cut-point the number of rules induced increases smoothly with the decrease of the stopping criterion. Therefore, by setting the value of the stopping criterion the analyst can determine the number and quality of rules to be induced; the quality of a rule is measured by both its length and probability

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

Computing the entropy of user navigation in the web

Navigation through the web, colloquially known as "surfing", is one of the main activities of users during web interaction. When users follow a navigation trail they often tend to get disoriented in terms of the goals of their original query and thus the discovery of typical user trails could be useful in providing navigation assistance. Herein, we give a theoretical underpinning of user navigation in terms of the entropy of an underlying Markov chain modelling the web topology. We present a novel method for online incremental computation of the entropy and a large deviation result regarding the length of a trail to realize the said entropy. We provide an error analysis for our estimation of the entropy in terms of the divergence between the empirical and actual probabilities. We then indicate applications of our algorithm in the area of web data mining. Finally, we present an extension of our technique to higher-order Markov chains by a suitable reduction of a higher-order Markov chain model to a first-order one

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