Analysis of F and G subdwarfs. 3 - An abundance analysis of the subdwarf mu Cassiopeia

Model atmospheric abundance analysis of subdwarf micron Cassiopeia constellatio

Optimal Iris Fuzzy Sketches

Fuzzy sketches, introduced as a link between biometry and cryptography, are a way of handling biometric data matching as an error correction issue. We focus here on iris biometrics and look for the best error-correcting code in that respect. We show that two-dimensional iterative min-sum decoding leads to results near the theoretical limits. In particular, we experiment our techniques on the Iris Challenge Evaluation (ICE) database and validate our findings.Comment: 9 pages. Submitted to the IEEE Conference on Biometrics: Theory, Applications and Systems, 2007 Washington D

The instability of stellar structures intermediate between white dwarfs and neutron stars

Instability of stellar structures intermediate between dwarfs and neutron star

The Nature of Hypervelocity Stars and the Time between Their Formation and Ejection

We obtain Keck HIRES spectroscopy of HVS5, one of the fastest unbound stars in the Milky Way halo. We show that HVS5 is a 3.62 ± 0.11 M_☉ main-sequence B star at a distance of 50 ± 5 kpc. The difference between its age and its flight time from the Galactic center is 105 ± 18 (stat) ±30 (sys) Myr; flight times from locations elsewhere in the Galactic disk are similar. This 10^8 yr "arrival time" between formation and ejection is difficult to reconcile with any ejection scenario involving massive stars that live for only 10^7 yr. For comparison, we derive arrival times of 10^7 yr for two unbound runaway B stars, consistent with their disk origin where ejection results from a supernova in a binary system or dynamical interactions between massive stars in a dense star cluster. For HVS5, ejection during the first 10^7 yr of its lifetime is ruled out at the 3σ level. Together with the 10^8 yr arrival times inferred for three other well-studied hypervelocity stars (HVSs), these results are consistent with a Galactic center origin for the HVSs. If the HVSs were indeed ejected by the central black hole, then the Galactic center was forming stars ≃200 Myr ago, and the progenitors of the HVSs took ≃100 Myr to enter the black hole's loss cone

Note on the Kaplan-Yorke dimension and linear transport coefficients

A number of relations between the Kaplan-Yorke dimension, phase space contraction, transport coefficients and the maximal Lyapunov exponents are given for dissipative thermostatted systems, subject to a small external field in a nonequilibrium stationary state. A condition for the extensivity of phase space dimension reduction is given. A new expression for the transport coefficients in terms of the Kaplan-Yorke dimension is derived. Alternatively, the Kaplan-Yorke dimension for a dissipative macroscopic system can be expressed in terms of the transport coefficients of the system. The agreement with computer simulations for an atomic fluid at small shear rates is very good.Comment: 12 pages, 5 figures, submitted to J. Stat. Phy

Algorithms for the workflow satisfiability problem engineered for counting constraints

The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification that satisfies the constraints in the specification. The problem is NP-hard in general, but several subclasses of the problem are known to be fixed-parameter tractable (FPT) when parameterized by the number of steps in the specification. In this paper, we consider the WSP with user-independent counting constraints, a large class of constraints for which the WSP is known to be FPT. We describe an efficient implementation of an FPT algorithm for solving this subclass of the WSP and an experimental evaluation of this algorithm. The algorithm iteratively generates all equivalence classes of possible partial solutions until, whenever possible, it finds a complete solution to the problem. We also provide a reduction from a WSP instance to a pseudo-Boolean SAT instance. We apply this reduction to the instances used in our experiments and solve the resulting PB SAT problems using SAT4J, a PB SAT solver. We compare the performance of our algorithm with that of SAT4J and discuss which of the two approaches would be more effective in practice