We present an exhaustive search of all families of convex pentagons which tile the plane. This research shows that there are no more than the already 15 known families. In particular, this implies that there is no convex polygon which allows only non-periodic tilings.

This paper presents SplitQuest, a controlled and exhaustive search protocol that relies on a hybrid network structure to avoid unnecessary query replication and to speed up query propagation in P2P networks. In SplitQuest, peers are organized in replication groups, in which each peer shares its contents with all members, and queries are propagated only once to a group. By avoiding query duplica...

High-availability of software systems requires automated handling of crashes in presence of errors. Failure-oblivious computing is one technique that aims to achieve high availability. We note that failure-obliviousness has not been studied in depth yet, and there is very few study that helps understand why failureoblivious techniques work. In order to make failure-oblivious computing to have a...

HHsenser is the first server to offer exhaustive intermediate profile searches, which it combines with pairwise comparison of hidden Markov models. Starting from a single protein sequence or a multiple alignment, it can iteratively explore whole superfamilies, producing few or no false positives. The output is a multiple alignment of all detected homologs. HHsenser's sensitivity should make it ...

Multimaterial optical coatings are a promising viable option to meet the challenging requirements (in terms of transmittance, absorbance and thermal noise) next generation gravitational wave detector mirrors. In this paper we focus on ternary consisting quarter-wavelength thick layers, where third material (H') is added two presently in use, namely Silica (L) Titania-doped Tantala (H), featurin...

Conservation strategies routinely use optimization methods to identify the smallest number of units required to represent a set of features that need to be conserved, including biomes, species, and populations. In this study, we provide R scripts to facilitate exhaustive search for solutions that represent all of the alleles in networks with the smallest possible number of populations. The scri...

Successful search and versatile query support are two important requirements for peer-to-peer (P2P) search applications. Replication strategy is an effective approach to improve the search performance of unstructured P2P systems. However, existing replication strategies either adapt only to popular queries or incur excessive replication cost for unpopular queries. In this work, we propose HRS, ...