QUADRANT-SEARCHING: A NEW TECHNIQUE TO REDUCE THE SEARCH SPACE OF THE INVERSE PROBLEM OF EIT USING BEM TO THE DIRECT PROBLEM

The image reconstruction using the EIT (Electrical Impedance Tomography) technique is a nonlinear and ill-posed inverse problem which demands a powerful direct or iterative method. A typical approach for solving the problem is to minimize an error functional using an iterative method. In this case, an initial solution close enough to the global minimum is mandatory to ensure the convergence to the correct minimum in an appropriate time interval. The aim of this paper is to present a new, simple and low cost technique (quadrant-searching) to reduce the search space and consequently to obtain an initial solution of the inverse problem of EIT. This technique calculates the error functional for four different contrast distributions placing a large prospective inclusion in the four quadrants of the domain. Comparing the four values of the error functional it is possible to get conclusions about the internal electric contrast. For this purpose, initially we performed tests to assess the accuracy of the BEM (Boundary Element Method) when applied to the direct problem of the EIT and to verify the behavior of error functional surface in the search space. Finally, numerical tests have been performed to verify the new technique.

Bjorling problem for timelike surfaces in the Lorentz-Minkowski space

We solve the Bjorling problem for timelike surfaces in the Lorentz-Minkowski space through a split-complex representation formula obtained for this kind of surface. Our approach uses the split-complex numbers and natural split-holomorphic extensions. As applications, we show that the minimal timelike surfaces of revolution as well as minimal ruled timelike surfaces can be characterized as solutions of certain adequate Bjorling problems in the Lorentz-Minkowski space. (C) 2010 Elsevier Inc. All rights reserved.

A FREE BOUNDARY ISOPERIMETRIC PROBLEM IN HYPERBOLIC 3-SPACE BETWEEN PARALLEL HOROSPHERES

We investigate the isoperimetric problem of finding the regions of prescribed volume with minimal boundary area between two parallel horospheres in hyperbolic 3-space (the part of the boundary contained in the horospheres is not included). We reduce the problem to the study of rotationally invariant regions and obtain the possible isoperimetric solutions by studying the behavior of the profile curves of the rotational surfaces with constant mean curvature in hyperbolic 3-space. We also classify all the connected compact rotational surfaces M of constant mean curvature that are contained in the region between two horospheres, have boundary partial derivative M either empty or lying on the horospheres, and meet the horospheres perpendicularly along their boundary.

Transiting exoplanets from the CoRoT space mission XVIII. CoRoT-18b: a massive hot Jupiter on a prograde, nearly aligned orbit

We report the detection of CoRoT-18b, a massive hot Jupiter transiting in front of its host star with a period of 1.9000693 +/- 0.0000028 days. This planet was discovered thanks to photometric data secured with the CoRoT satellite combined with spectroscopic and photometric ground-based follow-up observations. The planet has a mass M(p) = 3.47 +/- 0.38 M(Jup), a radius R(p) = 1.31 +/- 0.18 R(Jup), and a density rho(p) = 2.2 +/- 0.8 g cm(-3). It orbits a G9V star with a mass M(*) = 0.95 +/- 0.15 M(circle dot), a radius R(*) = 1.00 +/- 0.13 R(circle dot), and a rotation period P(rot) = 5.4 +/- 0.4 days. The age of the system remains uncertain, with stellar evolution models pointing either to a few tens Ma or several Ga, while gyrochronology and lithium abundance point towards ages of a few hundred Ma. This mismatch potentially points to a problem in our understanding of the evolution of young stars, with possibly significant implications for stellar physics and the interpretation of inferred sizes of exoplanets around young stars. We detected the RossiterMcLaughlin anomaly in the CoRoT-18 system thanks to the spectroscopic observation of a transit. We measured the obliquity psi = 20 degrees +/- 20 degrees +/- (sky-projected value lambda = -10 degrees +/- 20 degrees), indicating that the planet orbits in the same way as the star is rotating and that this prograde orbit is nearly aligned with the stellar equator.

TESTING STATISTICAL HYPOTHESIS ON RANDOM TREES AND APPLICATIONS TO THE PROTEIN CLASSIFICATION PROBLEM

Efficient automatic protein classification is of central importance in genomic annotation. As an independent way to check the reliability of the classification, we propose a statistical approach to test if two sets of protein domain sequences coming from two families of the Pfam database are significantly different. We model protein sequences as realizations of Variable Length Markov Chains (VLMC) and we use the context trees as a signature of each protein family. Our approach is based on a Kolmogorov-Smirnov-type goodness-of-fit test proposed by Balding et at. [Limit theorems for sequences of random trees (2008), DOI: 10.1007/s11749-008-0092-z]. The test statistic is a supremum over the space of trees of a function of the two samples; its computation grows, in principle, exponentially fast with the maximal number of nodes of the potential trees. We show how to transform this problem into a max-flow over a related graph which can be solved using a Ford-Fulkerson algorithm in polynomial time on that number. We apply the test to 10 randomly chosen protein domain families from the seed of Pfam-A database (high quality, manually curated families). The test shows that the distributions of context trees coming from different families are significantly different. We emphasize that this is a novel mathematical approach to validate the automatic clustering of sequences in any context. We also study the performance of the test via simulations on Galton-Watson related processes.

ON THE THREE-DIMENSIONAL BLASCHKE-LEBESGUE PROBLEM

The width of a closed convex subset of n-dimensional Euclidean space is the distance between two parallel supporting hyperplanes. The Blaschke-Lebesgue problem consists of minimizing the volume in the class of convex sets of fixed constant width and is still open in dimension n >= 3. In this paper we describe a necessary condition that the minimizer of the Blaschke-Lebesgue must satisfy in dimension n = 3: we prove that the smooth components of the boundary of the minimizer have their smaller principal curvature constant and therefore are either spherical caps or pieces of tubes (canal surfaces).

Infinite horizon MPC with non-minimal state space feedback

In the MPC literature, stability is usually assured under the assumption that the state is measured. Since the closed-loop system may be nonlinear because of the constraints, it is not possible to apply the separation principle to prove global stability for the Output feedback case. It is well known that, a nonlinear closed-loop system with the state estimated via an exponentially converging observer combined with a state feedback controller can be unstable even when the controller is stable. One alternative to overcome the state estimation problem is to adopt a non-minimal state space model, in which the states are represented by measured past inputs and outputs [P.C. Young, M.A. Behzadi, C.L. Wang, A. Chotai, Direct digital and adaptative control by input-output, state variable feedback pole assignment, International journal of Control 46 (1987) 1867-1881; C. Wang, P.C. Young, Direct digital control by input-output, state variable feedback: theoretical background, International journal of Control 47 (1988) 97-109]. In this case, no observer is needed since the state variables can be directly measured. However, an important disadvantage of this approach is that the realigned model is not of minimal order, which makes the infinite horizon approach to obtain nominal stability difficult to apply. Here, we propose a method to properly formulate an infinite horizon MPC based on the output-realigned model, which avoids the use of an observer and guarantees the closed loop stability. The simulation results show that, besides providing closed-loop stability for systems with integrating and stable modes, the proposed controller may have a better performance than those MPC controllers that make use of an observer to estimate the current states. (C) 2008 Elsevier Ltd. All rights reserved.

Slicing the metric space to provide quick indexing of complex data in the main memory

Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper. we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests. (C) 2010 Elsevier B.V. All rights reserved.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

Influence of the length of remaining root canal filling and post space preparation on the coronal leakage of Enterococcus faecalis

This study evaluated the sealing ability of different lengths of remaining root canal filling and post space preparation against coronal leakage of Enterococcus faecalis. Forty-one roots of maxillary incisors were biomechanically prepared, maintaining standardized canal diameter at the middle and coronal thirds. The roots were autoclaved and all subsequent steps were undertaken in a laminar flow chamber. The canals of 33 roots were obturated with AH Plus sealer and gutta-percha. The root canal fillings were reduced to 3 predetermined lengths (n=11): G1=6 mm, G2=4 mm and G3=2 mm. The remaining roots served as positive and negative controls. Bacterial leakage test apparatuses were fabricated with the roots attached to Eppendorf tubes keeping 2 mm of apex submerged in BHI in glass flasks. The specimens received an E. faecalis inoculum of 1 x 107 cfu/mL every 3 days and were observed for bacterial leakage daily during 60 days. Data were submitted to ANOVA, Tukey's test and Fisher's test. At 60 days, G1 (6 mm) and G2 (4 mm) presented statistically similar results (p>0.05) (54.4% of specimens with bacterial leakage) and both groups differed significantly (p<0.01) from G3 (2 mm), which presented 100% of specimens with E. faecalis leakage. It may be concluded that the shortest endodontic obturation remnant leaked considerably more than the other lengths, although none of the tested conditions avoids coronal leakage of E. faecalis.

O uso de sondagens dipolo-dipolo em estudos hidrogeológicos e de depósitos de resíduos

Ensaios de sondagem e caminhamento elétrico têm sido realizados globalmente na avaliação de uma grande variedade de problemas em exploração mineral e hidrogeologia, bem como na caracterização de locais com risco de contaminação. A despeito da utilidade de ensaios geoelétricos em estudos hidrogeológicos e na caracterização de depósitos de resíduos desativados, um problema na utilização de sondagens elétricas ocorre em conseqüência da falta de espaço para aquisição de dados nessas áreas. Em áreas urbanas, isto constitui uma limitação importante devido à existência de construções, o que muitas vezes interrompe o desenvolvimento de ensaios de campo com arranjos de comprimentos adequados. Embora investigações rasas tendam a ser eficazes em caracterização geoambiental, a estimativa de parâmetros-chave pode depender da investigação de porções mais profundas. Entretanto, uma profundidade de investigação ligeiramente maior é obtida pelo arranjo dipolo-dipolo em comparação aos arranjos Schlumberger e Wenner de mesmo comprimento. Essa característica do arranjo dipolo-dipolo pode ser observada em vários estudos, mas provavelmente devido à tradição e à relação sinal-ruído, a grande maioria das sondagens elétricas é feita com os arranjos Schlumberger e Wenner.O arranjo dipolo-dipolo é mais utilizado em ensaios 2D. Até onde se sabe, essa maior capacidade de investigação em profundidade do arranjo dipolo-dipolo 1D não foi explorada em estudos geoambientais e nem em estudos hidrogeológicos em áreas urbanas. Este trabalho apresenta resultados de ensaios de campo que ressaltam a utilidade de sondagens dipolo-dipolo na investigação de tais áreas.

A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over

This paper addresses the capacitated lot sizing problem (CLSP) with a single stage composed of multiple plants, items and periods with setup carry-over among the periods. The CLSP is well studied and many heuristics have been proposed to solve it. Nevertheless, few researches explored the multi-plant capacitated lot sizing problem (MPCLSP), which means that few solution methods were proposed to solve it. Furthermore, to our knowledge, no study of the MPCLSP with setup carry-over was found in the literature. This paper presents a mathematical model and a GRASP (Greedy Randomized Adaptive Search Procedure) with path relinking to the MPCLSP with setup carry-over. This solution method is an extension and adaptation of a previously adopted methodology without the setup carry-over. Computational tests showed that the improvement of the setup carry-over is significant in terms of the solution value with a low increase in computational time.

Quasinormal modes of black holes in anti-de Sitter space: A numerical study of the eikonal limit

Using series solutions and time-domain evolutions, we probe the eikonal limit of the gravitational and scalar-field quasinormal modes of large black holes and black branes in anti-de Sitter backgrounds. These results are particularly relevant for the AdS/CFT correspondence, since the eikonal regime is characterized by the existence of long-lived modes which (presumably) dominate the decay time scale of the perturbations. We confirm all the main qualitative features of these slowly damped modes as predicted by Festuccia and Liu [G. Festuccia and H. Liu, arXiv:0811.1033.] for the scalar-field (tensor-type gravitational) fluctuations. However, quantitatively we find dimensional-dependent correction factors. We also investigate the dependence of the quasinormal mode frequencies on the horizon radius of the black hole (brane) and the angular momentum (wave number) of vector- and scalar-type gravitational perturbations.

Two dimensional analysis of inflatable structures by the positional FEM

This paper presents a, simple two dimensional frame formulation to deal with structures undergoing large motions due to dynamic actions including very thin inflatable structures, balloons. The proposed methodology is based on the minimum potential energy theorem written regarding nodal positions. Velocity, acceleration and strain are achieved directly from positions, not. displacements, characterizing the novelty of the proposed technique. A non-dimensional space is created and the deformation function (change of configuration) is written following two independent mappings from which the strain energy function is written. The classical New-mark equations are used to integrate time. Dumping and non-conservative forces are introduced into the mechanical system by a rheonomic energy function. The final formulation has the advantage of being simple and easy to teach, when compared to classical Counterparts. The behavior of a bench-mark problem (spin-up maneuver) is solved to prove the formulation regarding high circumferential speed applications. Other examples are dedicated to inflatable and very thin structures, in order to test the formulation for further analysis of three dimensional balloons.

AVERAGE CONTINUOUS CONTROL OF PIECEWISE DETERMINISTIC MARKOV PROCESSES

This paper deals with the long run average continuous control problem of piecewise deterministic Markov processes (PDMPs) taking values in a general Borel space and with compact action space depending on the state variable. The control variable acts on the jump rate and transition measure of the PDMP, and the running and boundary costs are assumed to be positive but not necessarily bounded. Our first main result is to obtain an optimality equation for the long run average cost in terms of a discrete-time optimality equation related to the embedded Markov chain given by the postjump location of the PDMP. Our second main result guarantees the existence of a feedback measurable selector for the discrete-time optimality equation by establishing a connection between this equation and an integro-differential equation. Our final main result is to obtain some sufficient conditions for the existence of a solution for a discrete-time optimality inequality and an ordinary optimal feedback control for the long run average cost using the so-called vanishing discount approach. Two examples are presented illustrating the possible applications of the results developed in the paper.