A taxonomic review of the neotropical genus \u3ci\u3eCoprophanaeus\u3c/i\u3e Olsoufieff, 1924 (Coleoptera: Scarabaeidae, Scarabaeinae

The Neotropical genus Coprophanaeus Olsoufieff (1924), as classified here, comprises 38 species distributed among three subgenera (Megaphanaeus Olsoufieff, Metallophanaeus Olsoufieff, and Coprophanaeus s. str. ) and eight species groups. Keys presented help to identify supraspecific and species taxa, all of which are illustrated and diagnosed. Lectotypes are designated for Phanaeus ignecinctus Felsche and Phanaeus ohausi Felsche. Coprophanaeus corythus (Harold), formerly regarded as a subspecies of C. telamon (Erichson), assumes species status. Coprophanaeus magnoi Arnaud, described as a subspecies of C. milon (Blanchard), is raised to species status. New taxonomic interpretations result in 10 new subjective synonymies (junior synonym listed first): Phanaeus machadoi Pereira and d’Andretta = Coprophanaeus saphirinus (Perty); Phanaeus costatus Olsoufieff = Coprophanaeus cyanescens (Olsoufieff); Phanaeus worontzowi Pessôa and Lane = Coprophanaeus cyanescens (Olsoufieff); Coprophanaeus kohlmanni Arnaud = Coprophanaeus morenoi Arnaud; Coprophanaeus pluto nogueirai Arnaud = Coprophanaeus pluto (Harold); Coprophanaeus edmondsi Arnaud = Coprophanaeus conocephalus (Olsoufieff); Coprophanaeus uhleri Malý and Pokorný = Coprophanaeus chiriquensis (Olsoufieff); Coprophanaeus henryi Malý and Pokorný = Coprophanaeus gilli Arnaud; Phanaeus perseus Harold = Coprophanaeus corythus (Harold); Coprophanaeus telamon nevinsoni Arnaud and Gámez = Coprophanaeus corythus; and Coprophanaeus florenti Arnaud = Coprophanaeus ohausi (Felsche). The status of the following names remains unresolved: Phanaeus strandi Balthasar; Coprophanaeus rigoutorum Arnaud; C. terrali Arnaud; C. lichyi Arnaud; C. lecromi Arnaud; C. larseni Arnaud; and C. vazdemeloi Arnaud

On Multilingual Training of Neural Dependency Parsers

We show that a recently proposed neural dependency parser can be improved by joint training on multiple languages from the same family. The parser is implemented as a deep neural network whose only input is orthographic representations of words. In order to successfully parse, the network has to discover how linguistically relevant concepts can be inferred from word spellings. We analyze the representations of characters and words that are learned by the network to establish which properties of languages were accounted for. In particular we show that the parser has approximately learned to associate Latin characters with their Cyrillic counterparts and that it can group Polish and Russian words that have a similar grammatical function. Finally, we evaluate the parser on selected languages from the Universal Dependencies dataset and show that it is competitive with other recently proposed state-of-the art methods, while having a simple structure.Comment: preprint accepted into the TSD201

Reconstructing a Simple Polytope from its Graph

Blind and Mani (1987) proved that the entire combinatorial structure (the vertex-facet incidences) of a simple convex polytope is determined by its abstract graph. Their proof is not constructive. Kalai (1988) found a short, elegant, and algorithmic proof of that result. However, his algorithm has always exponential running time. We show that the problem to reconstruct the vertex-facet incidences of a simple polytope P from its graph can be formulated as a combinatorial optimization problem that is strongly dual to the problem of finding an abstract objective function on P (i.e., a shelling order of the facets of the dual polytope of P). Thereby, we derive polynomial certificates for both the vertex-facet incidences as well as for the abstract objective functions in terms of the graph of P. The paper is a variation on joint work with Michael Joswig and Friederike Koerner (2001).Comment: 14 page

Probing anisotropies of gravitational-wave backgroundswith a space-based interferometer II: Perturbative reconstruction of a low-frequency skymap

We present a perturbative reconstruction method to make a skymap of gravitational-wave backgrounds (GWBs) observed via space-based interferometer. In the presence of anisotropies in GWBs, the cross-correlated signals of observed GWBs are inherently time-dependent due to the non-stationarity of the gravitational-wave detector. Since the cross-correlated signal is obtained through an all-sky integral of primary signals convolving with the antenna pattern function of gravitational-wave detectors, the non-stationarity of cross-correlated signals, together with full knowledge of antenna pattern functions, can be used to reconstruct an intensity map of the GWBs. Here, we give two simple methods to reconstruct a skymap of GWBs based on the perturbative expansion in low-frequency regime. The first one is based on harmonic-Fourier representation of data streams and the second is based on "direct" time-series data. The latter method enables us to create a skymap in a direct manner. The reconstruction technique is demonstrated in the case of the Galactic gravitational wave background observed via planned space interferometer, LISA. Although the angular resolution of low-frequency skymap is rather restricted, the methodology presented here would be helpful in discriminating the GWBs of galactic origins by those of the extragalactic and/or cosmological origins.Comment: 23 pages, 12 figures, Phys.Rev.D (2005) in pres

Towards practical classical processing for the surface code: timing analysis

Topological quantum error correction codes have high thresholds and are well suited to physical implementation. The minimum weight perfect matching algorithm can be used to efficiently handle errors in such codes. We perform a timing analysis of our current implementation of the minimum weight perfect matching algorithm. Our implementation performs the classical processing associated with an nxn lattice of qubits realizing a square surface code storing a single logical qubit of information in a fault-tolerant manner. We empirically demonstrate that our implementation requires only O(n^2) average time per round of error correction for code distances ranging from 4 to 512 and a range of depolarizing error rates. We also describe tests we have performed to verify that it always obtains a true minimum weight perfect matching.Comment: 13 pages, 13 figures, version accepted for publicatio

Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems

We consider geometric instances of the Maximum Weighted Matching Problem (MWMP) and the Maximum Traveling Salesman Problem (MTSP) with up to 3,000,000 vertices. Making use of a geometric duality relationship between MWMP, MTSP, and the Fermat-Weber-Problem (FWP), we develop a heuristic approach that yields in near-linear time solutions as well as upper bounds. Using various computational tools, we get solutions within considerably less than 1% of the optimum. An interesting feature of our approach is that, even though an FWP is hard to compute in theory and Edmonds' algorithm for maximum weighted matching yields a polynomial solution for the MWMP, the practical behavior is just the opposite, and we can solve the FWP with high accuracy in order to find a good heuristic solution for the MWMP.Comment: 20 pages, 14 figures, Latex, to appear in Journal of Experimental Algorithms, 200

Imaginary in all directions: an elegant formulation of special relativity and classical electrodynamics

A suitable parameterization of space-time in terms of one complex and three quaternionic imaginary units allows Lorentz transformations to be implemented as multiplication by complex-quaternionic numbers rather than matrices. Maxwell's equations reduce to a single equation.Comment: 8 page

Semi-relativistic description of quasielastic neutrino reactions and superscaling in a continuum shell model

The so-called semi-relativistic expansion of the weak charged current in powers of the initial nucleon momentum is performed to describe charge-changing, quasielastic neutrino reactions $(\nu_\mu,\mu^-)$ at intermediate energies. The quality of the expansion is tested by comparing with the relativistic Fermi gas model using several choices of kinematics of interest for ongoing neutrino oscillation experiments. The new current is then implemented in a continuum shell model together with relativistic kinematics to investigate the scaling properties of $(e,e')$ and $(\nu_\mu,\mu^-)$ cross sections.Comment: 33 pages, 10 figures, to appear in PR