23,087 research outputs found
SunStar: an implementation of the generalized STAR method
Master's Project (M.S.) University of Alaska Fairbanks, 2017STAR ... is a method of computing species trees from gene trees. Later, STAR was generalized and proven to be statistically consistent given a few conditions (Allman, Degnan, and Rhodes 2013). Using these conditions, it is possible to investigate robustness in the species tree inference process, the lack of which will produce instabilities in the tree resulting from STAR. We have developed a software package that estimates support for inferred trees called SunStar
Performance analysis and optimization of the JOREK code for many-core CPUs
This report investigates the performance of the JOREK code on the Intel
Knights Landing and Skylake processor architectures. The OpenMP scaling of the
matrix construction part of the code was analyzed and improved synchronization
methods were implemented. A new switch was implemented to control the number of
threads used for the linear equation solver independently from other parts of
the code. The matrix construction subroutine was vectorized, and the data
locality was also improved. These steps led to a factor of two speedup for the
matrix construction
Sequential weak measurement
The notion of weak measurement provides a formalism for extracting
information from a quantum system in the limit of vanishing disturbance to its
state. Here we extend this formalism to the measurement of sequences of
observables. When these observables do not commute, we may obtain information
about joint properties of a quantum system that would be forbidden in the usual
strong measurement scenario. As an application, we provide a physically
compelling characterisation of the notion of counterfactual quantum
computation
Searching by approximate personal-name matching
We discuss the design, building and evaluation of a method to access theinformation of a person, using his name as a search key, even if it has deformations. We present a similarity function, the DEA function, based
on the probabilities of the edit operations accordingly to the involved
letters and their position, and using a variable threshold. The efficacy
of DEA is quantitatively evaluated, without human relevance judgments,
very superior to the efficacy of known methods. A very efficient
approximate search technique for the DEA function is also presented
based on a compacted trie-tree structure.Postprint (published version
On the Classification of Quasihomogeneous Functions
We give a criterion for the existence of a non-degenerate quasihomogeneous
polynomial in a configuration, i.e. in the space of polynomials with a fixed
set of weights, and clarify the relation of this criterion to the necessary
condition derived from the formula for the Poincar\'e polynomial. We further
prove finiteness of the number of configurations for a given value of the
singularity index. For the value 3 of this index, which is of particular
interest in string theory, a constructive version of this proof implies an
algorithm for the calculation of all non-degenerate configurations.Comment: 12 page
- …