Plausible home stars of the interstellar object 'Oumuamua found in Gaia DR2

The first detected interstellar object 'Oumuamua that passed within 0.25au of the Sun on 2017 September 9 was presumably ejected from a stellar system. We use its newly determined non-Keplerian trajectory together with the reconstructed Galactic orbits of 7 million stars from Gaia DR2 to identify past close encounters. Such an "encounter" could reveal the home system from which 'Oumuamua was ejected. The closest encounter, at 0.60pc (0.53-0.67pc, 90% confidence interval), was with the M2.5 dwarf HIP 3757 at a relative velocity of 24.7km/s, 1Myr ago. A more distant encounter (1.6pc) but with a lower encounter (ejection) velocity of 10.7km/s was with the G5 dwarf HD 292249, 3.8Myr ago. Two more stars have encounter distances and velocities intermediate to these. The encounter parameters are similar across six different non-gravitational trajectories for 'Oumuamua. Ejection of 'Oumuamua by scattering from a giant planet in one of the systems is plausible, but requires a rather unlikely configuration to achieve the high velocities found. A binary star system is more likely to produce the observed velocities. None of the four home candidates have published exoplanets or are known to be binaries. Given that the 7 million stars in Gaia DR2 with 6D phase space information is just a small fraction of all stars for which we can eventually reconstruct orbits, it is a priori unlikely that our current search would find 'Oumuamua's home star system. As 'Oumuamua is expected to pass within 1pc of about 20 stars and brown dwarfs every Myr, the plausibility of a home system depends also on an appropriate (low) encounter velocity.Comment: Accepted to The Astronomical Journa

Database Engineering Processes with DB-MAIN

Software engineering needs more and more to be supported by CASE tools. Since databases are at the heart of information systems, they deserve a particular attention. More and more CASE tools allow method engineers to implement their own methodology and they allow users to record all their actions, with their rationales, in order to improve the quality of the design and the quality of the documentation of the design. DBMAIN is such a database oriented tool with a method description and a documentation generation facilities. But it has its particularities like its procedural non-deterministic Method Description Language, its well integrated multilevel histories and its userfriendly methodological engine

Etude des plaques de Peyer de l'intestin du souriceau nouveau-né comme voie possible de pénétration du virus du cancer mammaire de la souris (MMTV)

Peer reviewe

A Direct Symbolic Execution of SQL Code for Testing of Data-Oriented Applications

Symbolic execution is a technique which enables automatically generating test inputs (and outputs) exercising a set of execution paths within a program to be tested. If the paths cover a sufficient part of the code under test, the test data offer a representative view of the program's actual behaviour, which notably enables detecting errors and correcting faults. Relational databases are ubiquitous in software, but symbolic execution of pieces of code that manipulate them remains a non-trivial problem, particularly because of the complex structure of such databases and the complex behaviour of SQL statements. In this work, we define a direct symbolic execution for database manipulation code and integrate it with a more traditional symbolic execution of normal program code. The database tables are represented by relational symbols and the SQL statements by relational constraints over these symbols and the symbols representing the normal variables of the program. An algorithm based on these principles is presented for the symbolic execution of Java methods that implement business use cases by reading and writing in a relational database, the latter subject to data integrity constraints. The algorithm is integrated in a test generation tool and experimented over sample code. The target language for the constraints produced by the tool is the SMT-Lib standard and the used solver is Microsoft Z3. The results show that the proposed approach enables generating meaningful test data, including valid database content, in reasonable time. In particular, the Z3 solver is shown to be more scalable than the Alloy solver, used in our previous work, for solving relational constraints

Simulations of the Population of Centaurs I: The Bulk Statistics

Large-scale simulations of the Centaur population are carried out. The evolution of 23328 particles based on the orbits of 32 well-known Centaurs is followed for up to 3 Myr in the forward and backward direction under the influence of the 4 massive planets. The objects exhibit a rich variety of dynamical behaviour with half-lives ranging from 540 kyr (1996 AR20) to 32 Myr (2000 FZ53). The mean half-life of the entire sample of Centaurs is 2.7 Myr. The data are analyzed using a classification scheme based on the controlling planets at perihelion and aphelion, previously given in Horner et al (2003). Transfer probabilities are computed and show the main dynamical pathways of the Centaur population. The total number of Centaurs with diameters larger than 1 km is estimated as roughly 44300, assuming an inward flux of one new short-period comet every 200 yrs. The flux into the Centaur region from the Edgeworth-Kuiper belt is estimated to be 1 new object every 125 yrs. Finally, the flux from the Centaur region to Earth-crossing orbits is 1 new Earth-crosser every 880 yrsComment: 15 pages, 2 figures, MNRAS in pres

Relational symbolic execution of SQL code for unit testing of database programs

Symbolic execution is a technique enabling the automatic generation of test inputs that exercise a set of execution paths within a code unit to be tested. If the paths cover a sufficient part of the code under test, the test data offer a representative view of the actual behaviour of this code. This notably enables detecting errors and correcting faults. Relational databases are ubiquitous in software, but symbolic execution of code units that manipulate them remains a non-trivial problem, particularly because of the complex structure of such databases and the complex behaviour of SQL statements. Finding errors in such code units is yet critical, as it can avoid corrupting important data. In this work, we define a symbolic execution translating database manipulation code directly into constraints and integrate it with a more traditional symbolic execution of normal program code. The database tables are represented by relational symbols and the SQL statements by relational constraints over these symbols. An algorithm based on these principles is presented for the symbolic execution of simple Java methods that implement transactional use cases by reading and writing in a relational database, the latter subject to data integrity constraints. The algorithm is integrated in a test generation tool and experimented over sample code. The target language for the constraints produced by the tool is the SMT-Lib standard and the used solver is Microsoft Z3. The results show that the proposed approach enables generating meaningful test data, including valid database content, in reasonable time. In particular, the Z3 solver is shown to be more scalable than the Alloy solver, used in our previous work, for solving relational constraints