Large scale structure in the HI Parkes All-Sky Survey: Filling the Voids with HI galaxies?

We estimate the two-point correlation function in redshift space of the recently compiled HIPASS neutral hydrogen (HI) sources catalogue, which if modeled as a power law, $\xi(r)=(r_{0}/r)^{\gamma}$, the best-fitting parameters for the HI selected galaxies are found to be $r_{0}=3.3 \pm 0.3 h^{-1}$ Mpc with $\gamma=1.38 \pm 0.24$. Fixing the slope to its universal value $\gamma=1.8$, we obtain $r_{0}= 3.2\pm 0.2 h^{-1}$ Mpc. Comparing the measured two point correlation function with the predictions of the concordance cosmological model, we find that at the present epoch the HI selected galaxies are anti-biased with respect to the underlying matter fluctuation field with their bias value being $b_{0}\simeq 0.68$. Furthermore, dividing the HI galaxies into two richness subsamples we find that the low mass HI galaxies have a very low present bias factor ($b_{0}\simeq 0.48$), while the high mass HI galaxies trace the underlying matter distribution as the optical galaxies ($b_{0}\simeq 1$). Using our derived present-day HI galaxy bias we estimate their redshift space distortion parameter, and correct accordingly the correlation function for peculiar motions. The resulting real-space correlation length is $r^{\rm re}_{0}=1.8 \pm 0.2 h^{-1}$Mpc and $r^{\rm re}_{0}=3.9 \pm 0.6 h^{-1}$Mpc for the low and high mass HI galaxies, respectively. The low-mass HI galaxies appear to have the lowest correlation length among all extragalactic populations studied to-date. Also, we have correlated the IRAS-PSCz reconstructed density field, smoothed over scales of 5$h^{-1}$ Mpc, with the positions of the HI galaxies, to find that indeed the HI galaxies are typically found in negative overdensity regions (\delta\rho/\rho_{\rm PSCz} \mincir 0).Comment: 9 pages, 8 figures, MNRAS in pres

Gravitational Mesoscopic Constraints in Cosmological Dark Matter Halos

We present an analysis of the behaviour of the `coarse-grained' (`mesoscopic') rank partitioning of the mean energy of collections of particles composing virialized dark matter halos in a Lambda-CDM cosmological simulation. We find evidence that rank preservation depends on halo mass, in the sense that more massive halos show more rank preservation than less massive ones. We find that the most massive halos obey Arnold's theorem (on the ordering of the characteristic frequencies of the system) more frequently than less massive halos. This method may be useful to evaluate the coarse-graining level (minimum number of particles per energy cell) necessary to reasonably measure signatures of `mesoscopic' rank orderings in a gravitational system.Comment: LaTeX, 15 pages, 3 figures. Accepted for publication in Celestial Mechanics and Dynamical Astronomy Journa

Acoustics of early universe. I. Flat versus open universe models

A simple perturbation description unique for all signs of curvature, and based on the gauge-invariant formalisms is proposed to demonstrate that: (1) The density perturbations propagate in the flat radiation-dominated universe in exactly the same way as electromagnetic or gravitational waves propagate in the epoch of the matter domination. (2) In the open universe, sounds are dispersed by curvature. The space curvature defines the minimal frequency $\omega_{\rm c}$ below which the propagation of perturbations is forbidden. Gaussian acoustic fields are considered and the curvature imprint in the perturbations spectrum is discussed.Comment: The new version extended by 2 sections. Changes in notation. Some important comments adde

Branch and bound based coordinate search filter algorithm for nonsmooth nonconvex mixed-integer nonlinear programming problems

Publicado em "Computational science and its applications – ICCSA 2014...", ISBN 978-3-319-09128-0. Series "Lecture notes in computer science", ISSN 0302-9743, vol. 8580.A mixed-integer nonlinear programming problem (MINLP) is a problem with continuous and integer variables and at least, one nonlinear function. This kind of problem appears in a wide range of real applications and is very difficult to solve. The difficulties are due to the nonlinearities of the functions in the problem and the integrality restrictions on some variables. When they are nonconvex then they are the most difficult to solve above all. We present a methodology to solve nonsmooth nonconvex MINLP problems based on a branch and bound paradigm and a stochastic strategy. To solve the relaxed subproblems at each node of the branch and bound tree search, an algorithm based on a multistart strategy with a coordinate search filter methodology is implemented. The produced numerical results show the robustness of the proposed methodology.This work has been supported by FCT (Fundação para a Ciência e aTecnologia) in the scope of the projects: PEst-OE/MAT/UI0013/2014 and PEst-OE/EEI/UI0319/2014

Investigating the nature of motion in 3D perturbed elliptic oscillators displaying exact periodic orbits

We study the nature of motion in a 3D potential composed of perturbed elliptic oscillators. Our technique is to use the results obtained from the 2D potential in order to find the initial conditions generating regular or chaotic orbits in the 3D potential. Both 2D and 3D potentials display exact periodic orbits together with extended chaotic regions. Numerical experiments suggest, that the degree of chaos increases rapidly, as the energy of the test particle increases. About 97% of the phase plane of the 2D system is covered by chaotic orbits for large energies. The regular or chaotic character of the 2D orbits is checked using the S(c) dynamical spectrum, while for the 3D potential we use the S(c) spectrum, along with the P(f) spectral method. Comparison with other dynamical indicators shows that the S(c) spectrum gives fast and reliable information about the character of motion.Comment: Published in Nonlinear Dynamics (NODY) journa

Multilocal programming and applications

Preprint versionMultilocal programming aims to identify all local minimizers of unconstrained or constrained nonlinear optimization problems. The multilocal programming theory relies on global optimization strategies combined with simple ideas that are inspired in deflection or stretching techniques to avoid convergence to the already detected local minimizers. The most used methods to solve this type of problems are based on stochastic procedures and a population of solutions. In general, population-based methods are computationally expensive but rather reliable in identifying all local solutions. In this chapter, a review on recent techniques for multilocal programming is presented. Some real-world multilocal programming problems based on chemical engineering process design applications are described.Fundação para a Ciência e a Tecnologia (FCT