The last Frasnian Atrypida (Brachiopoda) in southern Belgium

The last representatives of the order Atrypida on the southern flank of the Dinant Synclinorium (Vaulx-Nismes area) in Belgium belong to Costatrypa, Spinatrypa, Spinatrypina (?Spinatrypina), Spinatrypina (Exatrypa), Iowatrypa, ?Waiotrypa, Desquamatia (Desquamatia) and Desquamatia (?Seratrypa). Among the thirteen described taxa, five are new: Spinatrypa tumuli sp. n., Iowatrypa circuitionis sp. n., ?Waiotrypa pluvia sp. n., Desquamatia (Desquamatia) quieta sp. n. and Desquamatia (?Seratrypa) derelicta sp. n. Supposed lissatrypid `Glassia drevermanni' Maillieux, 1936 from the late Frasnian Matagne shales is assigned to the Rhynchonellida. On the southern flank of the Dinant Synclinorium and in the Philippeville Massif, the Atrypida become extinct in the Palmatolepis rhenana Zone, significantly below the Frasnian-Famennian (F-F) boundary. Their extinction coincides with the first appearance of the green and black shales of the late Frasnian Matagne Formation, recording a transgressive-hypoxic event. Based on conodont data, this event takes place earlier on the southern flank of the Dinant Synclinorium than in the Philippeville Massif

SlowFuzz: Automated Domain-Independent Detection of Algorithmic Complexity Vulnerabilities

Algorithmic complexity vulnerabilities occur when the worst-case time/space complexity of an application is significantly higher than the respective average case for particular user-controlled inputs. When such conditions are met, an attacker can launch Denial-of-Service attacks against a vulnerable application by providing inputs that trigger the worst-case behavior. Such attacks have been known to have serious effects on production systems, take down entire websites, or lead to bypasses of Web Application Firewalls. Unfortunately, existing detection mechanisms for algorithmic complexity vulnerabilities are domain-specific and often require significant manual effort. In this paper, we design, implement, and evaluate SlowFuzz, a domain-independent framework for automatically finding algorithmic complexity vulnerabilities. SlowFuzz automatically finds inputs that trigger worst-case algorithmic behavior in the tested binary. SlowFuzz uses resource-usage-guided evolutionary search techniques to automatically find inputs that maximize computational resource utilization for a given application.Comment: ACM CCS '17, October 30-November 3, 2017, Dallas, TX, US

Isotope Shifts in Beryllium-, Boron-, Carbon-, and Nitrogen-like Ions from Relativistic Configuration Interaction Calculations

Energy levels, normal and specific mass shift parameters as well as electronic densities at the nucleus are reported for numerous states along the beryllium, boron, carbon, and nitrogen isoelectronic sequences. Combined with nuclear data, these electronic parameters can be used to determine values of level and transition isotope shifts. The calculation of the electronic parameters is done using first-order perturbation theory with relativistic configuration interaction wave functions that account for valence, core-valence and core-core correlation effects as zero-order functions. Results are compared with experimental and other theoretical values, when available.Comment: 56 pages, 1 figure, Atomic Data and Nuclear Data Tables (2014

Exploring Biorthonormal Transformations of Pair-Correlation Functions in Atomic Structure Variational Calculations

Multiconfiguration expansions frequently target valence correlation and correlation between valence electrons and the outermost core electrons. Correlation within the core is often neglected. A large orbital basis is needed to saturate both the valence and core-valence correlation effects. This in turn leads to huge numbers of CSFs, many of which are unimportant. To avoid the problems inherent to the use of a single common orthonormal orbital basis for all correlation effects in the MCHF method, we propose to optimize independent MCHF pair-correlation functions (PCFs), bringing their own orthonormal one-electron basis. Each PCF is generated by allowing single- and double- excitations from a multireference (MR) function. This computational scheme has the advantage of using targeted and optimally localized orbital sets for each PCF. These pair-correlation functions are coupled together and with each component of the MR space through a low dimension generalized eigenvalue problem. Nonorthogonal orbital sets being involved, the interaction and overlap matrices are built using biorthonormal transformation of the coupled basis sets followed by a counter-transformation of the PCF expansions. Applied to the ground state of beryllium, the new method gives total energies that are lower than the ones from traditional CAS-MCHF calculations using large orbital active sets. It is fair to say that we now have the possibility to account for, in a balanced way, correlation deep down in the atomic core in variational calculations

Entanglement Equivalence of NN-qubit Symmetric States

We study the interconversion of multipartite symmetric $N$-qubit states under stochastic local operations and classical communication (SLOCC). We demonstrate that if two symmetric states can be connected with a nonsymmetric invertible local operation (ILO), then they belong necessarily to the separable, W, or GHZ entanglement class, establishing a practical method of discriminating subsets of entanglement classes. Furthermore, we prove that there always exists a symmetric ILO connecting any pair of symmetric $N$-qubit states equivalent under SLOCC, simplifying the requirements for experimental implementations of local interconversion of those states.Comment: Minor correction

Learning a Static Analyzer from Data

To be practically useful, modern static analyzers must precisely model the effect of both, statements in the programming language as well as frameworks used by the program under analysis. While important, manually addressing these challenges is difficult for at least two reasons: (i) the effects on the overall analysis can be non-trivial, and (ii) as the size and complexity of modern libraries increase, so is the number of cases the analysis must handle. In this paper we present a new, automated approach for creating static analyzers: instead of manually providing the various inference rules of the analyzer, the key idea is to learn these rules from a dataset of programs. Our method consists of two ingredients: (i) a synthesis algorithm capable of learning a candidate analyzer from a given dataset, and (ii) a counter-example guided learning procedure which generates new programs beyond those in the initial dataset, critical for discovering corner cases and ensuring the learned analysis generalizes to unseen programs. We implemented and instantiated our approach to the task of learning JavaScript static analysis rules for a subset of points-to analysis and for allocation sites analysis. These are challenging yet important problems that have received significant research attention. We show that our approach is effective: our system automatically discovered practical and useful inference rules for many cases that are tricky to manually identify and are missed by state-of-the-art, manually tuned analyzers

CH in stellar atmospheres: an extensive linelist

The advent of high-resolution spectrographs and detailed stellar atmosphere modelling has strengthened the need for accurate molecular data. Carbon-enhanced metal-poor (CEMP) stars spectra are interesting objects with which to study transitions from the CH molecule. We combine programs for spectral analysis of molecules and stellar-radiative transfer codes to build an extensive CH linelist, including predissociation broadening as well as newly identified levels. We show examples of strong predissociation CH lines in CEMP stars, and we stress the important role played by the CH features in the Bond-Neff feature depressing the spectra of barium stars by as much as 0.2 magnitudes in the $\lambda=$3000 -- 5500 \AA\ range. Because of the extreme thermodynamic conditions prevailing in stellar atmospheres (compared to the laboratory), molecular transitions with high energy levels can be observed. Stellar spectra can thus be used to constrain and improve molecular data.Comment: 33pages, 15 figures, accepted in A&A external data available at http://www.astro.ulb.ac.be/~spectrotools

Extended Calculations of Spectroscopic Data: Energy Levels, Lifetimes and Transition rates for O-like ions from Cr XVII to Zn XXIII

Employing two state-of-the-art methods, multiconfiguration Dirac--Hartree--Fock and second-order many-body perturbation theory, the excitation energies and lifetimes for the lowest 200 states of the $2s^2 2p^4$, $2s 2p^5$, $2p^6$, $2s^2 2p^3 3s$, $2s^2 2p^3 3p$, $2s^2 2p^3 3d$, $2s 2p^4 3s$, $2s 2p^4 3p$, and $2s 2p^4 3d$ configurations, and multipole (electric dipole (E1), magnetic dipole (M1), and electric quadrupole (E2)) transition rates, line strengths, and oscillator strengths among these states are calculated for each O-like ion from Cr XVII to Zn XXIII. Our two data sets are compared with the NIST and CHIANTI compiled values, and previous calculations. The data are accurate enough for identification and deblending of new emission lines from the sun and other astrophysical sources. The amount of data of high accuracy is significantly increased for the $n = 3$ states of several O-like ions of astrophysics interest, where experimental data are very scarce

Trace Spaces: an Efficient New Technique for State-Space Reduction

State-space reduction techniques, used primarily in model-checkers, all rely on the idea that some actions are independent, hence could be taken in any (respective) order while put in parallel, without changing the semantics. It is thus not necessary to consider all execution paths in the interleaving semantics of a concurrent program, but rather some equivalence classes. The purpose of this paper is to describe a new algorithm to compute such equivalence classes, and a representative per class, which is based on ideas originating in algebraic topology. We introduce a geometric semantics of concurrent languages, where programs are interpreted as directed topological spaces, and study its properties in order to devise an algorithm for computing dihomotopy classes of execution paths. In particular, our algorithm is able to compute a control-flow graph for concurrent programs, possibly containing loops, which is "as reduced as possible" in the sense that it generates traces modulo equivalence. A preliminary implementation was achieved, showing promising results towards efficient methods to analyze concurrent programs, with very promising results compared to partial-order reduction techniques

A theoretical study of the C- 4So_3/2 and 2Do_{3/2,5/2} bound states and C ground configuration: fine and hyperfine structures, isotope shifts and transition probabilities

This work is an ab initio study of the 2p3 4So_3/2, and 2Do_{3/2,5/2} states of C- and 2p2 3P_{0,1,2}, 1D_2, and 1S_0 states of neutral carbon. We use the multi-configuration Hartree-Fock approach, focusing on the accuracy of the wave function itself. We obtain all C- detachment thresholds, including correlation effects to about 0.5%. Isotope shifts and hyperfine structures are calculated. The achieved accuracy of the latter is of the order of 0.1 MHz. Intra-configuration transition probabilities are also estimated.Comment: 15 pages, 2 figures, 12 table