Comparison of roving-window and search-window techniques for characterising landscape morphometry

Brazil`s State of Sao Paulo Research Foundation

Discovery of VVV CL001 A low-mass globular cluster next to UKS 1 in the direction of the Galactic bulge

Context. It is not known how many globular clusters may remain undetected towards the Galactic bulge. Aims. One of the aims of the VISTA Variables in the Via Lactea (VVV) Survey is to accurately measure the physical parameters of the known globular clusters in the inner regions of the Milky Way and search for new ones, hidden in regions of large extinction. Methods. From deep near-infrared images, we derive deep JHK(S)-band photometry of a region surrounding the known globular cluster UKS 1 and reveal a new low-mass globular cluster candidate that we name VVV CL001. Results. We use the horizontal-branch red clump to measure E(B-V) similar to 2.2 mag, (m - M)(0) = 16.01 mag, and D = 15.9 kpc for the globular cluster UKS 1. On the basis of near-infrared colour-magnitude diagrams, we also find that VVV CL001 has E(B-V) similar to 2.0, and that it is at least as metal-poor as UKS 1, although its distance remains uncertain. Conclusions. Our finding confirms the previous projection that the central region of the Milky Way harbours more globular clusters. VVV CL001 and UKS 1 are good candidates for a physical cluster binary, but follow-up observations are needed to decide if they are located at the same distance and have similar radial velocities.

Search for Lorentz Invariance and CPT Violation with the MINOS Far Detector

We searched for a sidereal modulation in the MINOS far detector neutrino rate. Such a signal would be a consequence of Lorentz and CPT violation as described by the standard-model extension framework. It also would be the first detection of a perturbative effect to conventional neutrino mass oscillations. We found no evidence for this sidereal signature, and the upper limits placed on the magnitudes of the Lorentz and CPT violating coefficients describing the theory are an improvement by factors of 20-510 over the current best limits found by using the MINOS near detector.

Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil

In this paper, we consider a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries that occurs in a major Brazilian retail group. A single depot attends 519 stores of the group distributed in 11 Brazilian states. To find good solutions to this problem, we propose heuristics as initial solutions and a scatter search (SS) approach. Next, the produced solutions are compared with the routes actually covered by the company. Our results show that the total distribution cost can be reduced significantly when such methods are used. Experimental testing with benchmark instances is used to assess the merit of our proposed procedure. (C) 2008 Published by Elsevier B.V.

Charles Wilkes, a US Exploring Expedition and the US` search for its place in the world (1838-1842)

The main focus of this essay is the first American round-the-world scientific voyage, the U. S Exploring Expedition, which took place between 1838 and 1841 and was lead by Lieutenant Charles Wilkes. Here, I discuss the purposes of this expedition in the context of the voyages of circumnavigation accomplished by the various European powers during the same period.

Exact Search Directions for Optimization of Linear and Nonlinear Models Based on Generalized Orthonormal Functions

A novel technique for selecting the poles of orthonormal basis functions (OBF) in Volterra models of any order is presented. It is well-known that the usual large number of parameters required to describe the Volterra kernels can be significantly reduced by representing each kernel using an appropriate basis of orthonormal functions. Such a representation results in the so-called OBF Volterra model, which has a Wiener structure consisting of a linear dynamic generated by the orthonormal basis followed by a nonlinear static mapping given by the Volterra polynomial series. Aiming at optimizing the poles that fully parameterize the orthonormal bases, the exact gradients of the outputs of the orthonormal filters with respect to their poles are computed analytically by using a back-propagation-through-time technique. The expressions relative to the Kautz basis and to generalized orthonormal bases of functions (GOBF) are addressed; the ones related to the Laguerre basis follow straightforwardly as a particular case. The main innovation here is that the dynamic nature of the OBF filters is fully considered in the gradient computations. These gradients provide exact search directions for optimizing the poles of a given orthonormal basis. Such search directions can, in turn, be used as part of an optimization procedure to locate the minimum of a cost-function that takes into account the error of estimation of the system output. The Levenberg-Marquardt algorithm is adopted here as the optimization procedure. Unlike previous related work, the proposed approach relies solely on input-output data measured from the system to be modeled, i.e., no information about the Volterra kernels is required. Examples are presented to illustrate the application of this approach to the modeling of dynamic systems, including a real magnetic levitation system with nonlinear oscillatory behavior.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.