The Friedmann-Lemaitre-Robertson-Walker Big Bang singularities are well behaved

We show that the Big Bang singularity of the Friedmann-Lemaitre-Robertson-Walker model does not raise major problems to General Relativity. We prove a theorem showing that the Einstein equation can be written in a non-singular form, which allows the extension of the spacetime before the Big Bang. The physical interpretation of the fields used is discussed. These results follow from our research on singular semi-Riemannian geometry and singular General Relativity.Comment: 10 pages, 5 figure

Bringing the power of dynamic languages to hardware control systems

Hardware control systems are normally programmed using high-performance languages like C or C++ and increasingly also Java. All these languages are strongly typed and compiled which brings usually good performance but at the cost of a longer development and testing cycle and the need for more programming expertise. Dynamic languages which were long thought to be too slow and not powerful enough for control purposes are, thanks to modern powerful computers and advanced implementation techniques, fast enough for many of these tasks. We present examples from the LHCb Experiment Control System (ECS), which is based on a commercial SCADA software. We have successfully used Python to integrate hardware devices into the ECS. We present the necessary lightweight middle-ware we have developed, including examples for controlling hardware and software devices. We also discuss the development cycle, tools used and compare the effort to traditional solutions

Flavor states of mixed neutrinos

By resorting to previous results on flavor mixing in Quantum Field Theory, we show how to consistently define flavor states of mixed neutrinos as eigenstates of the flavor charge operators.Comment: 4 pages, presented at 13th International Symposium on Particles, Strings and Cosmology, PASCOS-07, 2-7 July 2007, Imperial College Londo

An integrative approach based on probabilistic modelling and statistical inference for morpho-statistical characterization of astronomical data

This paper describes several applications in astronomy and cosmology that are addressed using probabilistic modelling and statistical inference

GaN and InN nanowires grown by MBE: a comparison

Morphological, optical and transport properties of GaN and InN nanowires grown by molecular beam epitaxy (MBE) have been studied. The differences between the two materials in respect to growth parameters and optimization procedure was stressed. The nanowires crystalline quality has been investigated by means of their optical properties. A comparison of the transport characteristics was given. For each material a band schema was shown, which takes into account transport and optical features and is based on Fermi level pinning at the surface.Comment: 5 pages, 5 figure

Order statistics and heavy-tail distributions for planetary perturbations on Oort cloud comets

This paper tackles important aspects of comets dynamics from a statistical point of view. Existing methodology uses numerical integration for computing planetary perturbations for simulating such dynamics. This operation is highly computational. It is reasonable to wonder whenever statistical simulation of the perturbations can be much more easy to handle. The first step for answering such a question is to provide a statistical study of these perturbations in order to catch their main features. The statistical tools used are order statistics and heavy tail distributions. The study carried out indicated a general pattern exhibited by the perturbations around the orbits of the important planet. These characteristics were validated through statistical testing and a theoretical study based on Opik theory.Comment: 9 pages, 12 figures, submitted for publication in Astronomy and Astrophysic

Computational models for inferring biochemical networks

Biochemical networks are of great practical importance. The interaction of biological compounds in cells has been enforced to a proper understanding by the numerous bioinformatics projects, which contributed to a vast amount of biological information. The construction of biochemical systems (systems of chemical reactions), which include both topology and kinetic constants of the chemical reactions, is NP-hard and is a well-studied system biology problem. In this paper, we propose a hybrid architecture, which combines genetic programming and simulated annealing in order to generate and optimize both the topology (the network) and the reaction rates of a biochemical system. Simulations and analysis of an artificial model and three real models (two models and the noisy version of one of them) show promising results for the proposed method.The Romanian National Authority for Scientific Research, CNDI–UEFISCDI, Project No. PN-II-PT-PCCA-2011-3.2-0917

Isospin Character of the Pygmy Dipole Resonance in 124Sn

The pygmy dipole resonance has been studied in the proton-magic nucleus 124Sn with the (a,a'g) coincidence method at E=136 MeV. The comparison with results of photon-scattering experiments reveals a splitting into two components with different structure: one group of states which is excited in (a,a'g) as well as in (g,g') reactions and a group of states at higher energies which is only excited in (g,g') reactions. Calculations with the self-consistent relativistic quasiparticle time-blocking approximation and the quasiparticle phonon model are in qualitative agreement with the experimental results and predict a low-lying isoscalar component dominated by neutron-skin oscillations and a higher-lying more isovector component on the tail of the giant dipole resonance

Spectral Simplicity of Apparent Complexity, Part I: The Nondiagonalizable Metadynamics of Prediction

Virtually all questions that one can ask about the behavioral and structural complexity of a stochastic process reduce to a linear algebraic framing of a time evolution governed by an appropriate hidden-Markov process generator. Each type of question---correlation, predictability, predictive cost, observer synchronization, and the like---induces a distinct generator class. Answers are then functions of the class-appropriate transition dynamic. Unfortunately, these dynamics are generically nonnormal, nondiagonalizable, singular, and so on. Tractably analyzing these dynamics relies on adapting the recently introduced meromorphic functional calculus, which specifies the spectral decomposition of functions of nondiagonalizable linear operators, even when the function poles and zeros coincide with the operator's spectrum. Along the way, we establish special properties of the projection operators that demonstrate how they capture the organization of subprocesses within a complex system. Circumventing the spurious infinities of alternative calculi, this leads in the sequel, Part II, to the first closed-form expressions for complexity measures, couched either in terms of the Drazin inverse (negative-one power of a singular operator) or the eigenvalues and projection operators of the appropriate transition dynamic.Comment: 24 pages, 3 figures, 4 tables; current version always at http://csc.ucdavis.edu/~cmg/compmech/pubs/sdscpt1.ht