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).

Reconstruction of core and surface nanoparticles: The example of Pt(55) and Au(55)

Cuboctahedron (CUB) and icosahedron (ICO) model structures are widely used in the study of transition-metal (TM) nanoparticles (NPs), however, it might not provide a reliable description for small TM NPs such as the Pt(55) and Au(55) systems in gas phase. In this work, we combined density-functional theory calculations with atomic configurations generated by the basin hopping Monte Carlo algorithm within the empirical Sutton-Chen embedded atom potential. We identified alternative lower energy configurations compared with the ICO and CUB model structures, e. g., our lowest energy structures are 5.22 eV (Pt(55)) and 2.01 eV (Au(55)) lower than ICO. The energy gain is obtained by the Pt and Au diffusion from the ICO core region to the NP surface, which is driven by surface compression (only 12 atoms) on the ICO core region. Therefore, in the lowest energy configurations, the core size reduces from 13 atoms (ICO, CUB) to about 9 atoms while the NP surface increases from 42 atoms (ICO, CUB) to about 46 atoms. The present mechanism can provide an improved atom-level understanding of small TM NPs reconstructions.

An alternative to the Pythagorean rule? Reevaluating Problem 1 of cuneiform tablet BM 34 568

The first problem of the Seleucid mathematical cuneiform tablet BM 34 568 calculates the diagonal of a rectangle from its sides without resorting to the Pythagorean rule. For this reason, it has been a source of discussion among specialists ever since its first publication. but so far no consensus in relation to its mathematical meaning has been attained. This paper presents two new interpretations of the scribe`s procedure. based on the assumption that he was able to reduce the problem to a standard Mesopotamian question about reciprocal numbers. These new interpretations are then linked to interpretations of the Old Babylonian tablet Plimpton 322 and to the presence of Pythagorean triples in the contexts of Old Babylonian and Hellenistic mathematics. (C) 2007 Elsevier Inc. All rights reserved.

Street children and their relationship with the police

Background: This paper explores and analyses the experiences of school-age street children. It specifically addresses the relationship of the street children who live on the streets of Sao Paulo (a large Brazilian metropolis), in relation to their experiences, with the policemen. Methods: The paper is a secondary analysis of date previously collected in 1999. The data were collected through individual semi-structured interviews, with 14 school-age children frequenting two city public refuges, with their legal guardians` consent. The text from transcribed interviews was organized according to the validity norms of `thematic analysis`, a technique of contents analysis method. The decomposing and reconstructing process of that analysis gave rise to thematic categories (among which `the police category`) that represented the reconstruction of the difficulties faced by the children in their development. Results and discussion: The children portrayed the police as an enemy, a fearful figure and one of the most agonizing street experiences. Rarely did the police have a positive image to them. According to the children, police violence occurs in three forms: through systematic police persecution in an effort to remove the children from the streets against their will; actions that had the deliberate intent to humiliate them with verbal or physical aggression; and through alleged sexual abuse, revealed by the children in a veiled manner. The authority that is supposedly intended to protect them is portrayed as one of the most feared social agents. Conclusion: The reported hostile behaviour of the policemen shows the state of vulnerability of those children living on the street. This situation must be focused like a health problem because it causes injury to development of children. Nurses can help them through organizing assistance to children in situation of personal and social risk in the school nursing and health institution.

Males still have limb asymmetries in multijoint movement tasks more than 2 years following anterior cruciate ligament reconstruction

More than 2 years after undergoing anterior cruciate ligament (ACL) reconstruction, women still present bilateral asymmetries during multijoint movement tasks. Given the well-known ACL-injury gender bias, the goal of this study was to investigate whether males also present such asymmetries more than 2 years after undergoing ACL reconstruction. This study involved 12 participants submitted to ACL reconstruction in the ACL group and 17 healthy participants in the control group. The mean postoperative period was 37 months. The participants executed bilateral countermovement jumps and load squat tasks. The kinematics and ground reaction forces on each lower limb and pelvis were recorded, and used to compute bilateral peak vertical ground reaction forces, peak knee and hip joint powers in the sagittal plane, and the ratio between these powers. For the jump task, the groups had the same performance in the jump height, but for the ACL group the peak knee joint power on the operated side was 13% lower than on the non-operated side (p = 0.02). For the squat task, the hip-knee joint power ratio on the operated side of the ACL group was 31% greater than on the non-operated side (p = 0.02). The ACL group presented a deficit in the operated knee that had its energy generation over time (joint power) partially substituted by the hip joint power of the same side. The fact that, even after more than 2 years following the ACL reconstruction and returning to regular activity, the ACL group still had neuromuscular asymmetries suggests a need for improvement in the ACL reconstruction surgery procedures and/or rehabilitation protocols.

A STUDY OF PENALTY FORMULATIONS USED IN THE NUMERICAL APPROXIMATION OF A RADIALLY SYMMETRIC ELASTICITY PROBLEM

We consider a class of two-dimensional problems in classical linear elasticity for which material overlapping occurs in the absence of singularities. Of course, material overlapping is not physically realistic, and one possible way to prevent it uses a constrained minimization theory. In this theory, a minimization problem consists of minimizing the total potential energy of a linear elastic body subject to the constraint that the deformation field must be locally invertible. Here, we use an interior and an exterior penalty formulation of the minimization problem together with both a standard finite element method and classical nonlinear programming techniques to compute the minimizers. We compare both formulations by solving a plane problem numerically in the context of the constrained minimization theory. The problem has a closed-form solution, which is used to validate the numerical results. This solution is regular everywhere, including the boundary. In particular, we show numerical results which indicate that, for a fixed finite element mesh, the sequences of numerical solutions obtained with both the interior and the exterior penalty formulations converge to the same limit function as the penalization is enforced. This limit function yields an approximate deformation field to the plane problem that is locally invertible at all points in the domain. As the mesh is refined, this field converges to the exact solution of the plane problem.

The random barrier-crossing problem

This paper addresses the time-variant reliability analysis of structures with random resistance or random system parameters. It deals with the problem of a random load process crossing a random barrier level. The implications of approximating the arrival rate of the first overload by an ensemble-crossing rate are studied. The error involved in this so-called ""ensemble-crossing rate"" approximation is described in terms of load process and barrier distribution parameters, and in terms of the number of load cycles. Existing results are reviewed, and significant improvements involving load process bandwidth, mean-crossing frequency and time are presented. The paper shows that the ensemble-crossing rate approximation can be accurate enough for problems where load process variance is large in comparison to barrier variance, but especially when the number of load cycles is small. This includes important practical applications like random vibration due to impact loadings and earthquake loading. Two application examples are presented, one involving earthquake loading and one involving a frame structure subject to wind and snow loadings. (C) 2007 Elsevier Ltd. All rights reserved.

Volumetric reconstruction of the mean flow around circular cylinders fitted with strakes

The volumetric reconstruction technique presented in this paper employs a two-camera stereoscopic particle image velocimetry (SPIV) system in order to reconstruct the mean flow behind a fixed cylinder fitted with helical strakes, which are commonly used to suppress vortex-induced vibrations (VIV). The technique is based on the measurement of velocity fields at equivalent adjacent planes that results in pseudo volumetric fields. The main advantage over proper volumetric techniques is the avoidance of additional equipment and complexity. The averaged velocity fields behind the straked cylinders and the geometrical periodicity of the three-start configuration are used to further simplify the reconstruction process. Two straked cylindrical models with the same pitch (p = 10d) and two different heights (h = 0.1 and 0.2d) are tested. The reconstructed flow shows that the strakes introduce in the wake flow a well-defined wavelength of one-third of the pitch. Measurements of hydrodynamic forces, fluctuating velocity, vortex formation length, and vortex shedding frequency show the interdependence of the wake parameters. The vortex formation length is increased by the strakes, which is an important effect for the suppression of vortex-induced vibrations. The results presented complement previous investigations concerning the effectiveness of strakes as VIV suppressors and provide a basis of comparison to numerical simulations.

Recycling Krylov subspaces for efficient large-scale electrical impedance tomography

Electrical impedance tomography (EIT) captures images of internal features of a body. Electrodes are attached to the boundary of the body, low intensity alternating currents are applied, and the resulting electric potentials are measured. Then, based on the measurements, an estimation algorithm obtains the three-dimensional internal admittivity distribution that corresponds to the image. One of the main goals of medical EIT is to achieve high resolution and an accurate result at low computational cost. However, when the finite element method (FEM) is employed and the corresponding mesh is refined to increase resolution and accuracy, the computational cost increases substantially, especially in the estimation of absolute admittivity distributions. Therefore, we consider in this work a fast iterative solver for the forward problem, which was previously reported in the context of structural optimization. We propose several improvements to this solver to increase its performance in the EIT context. The solver is based on the recycling of approximate invariant subspaces, and it is applied to reduce the EIT computation time for a constant and high resolution finite element mesh. In addition, we consider a powerful preconditioner and provide a detailed pseudocode for the improved iterative solver. The numerical results show the effectiveness of our approach: the proposed algorithm is faster than the preconditioned conjugate gradient (CG) algorithm. The results also show that even on a standard PC without parallelization, a high mesh resolution (more than 150,000 degrees of freedom) can be used for image estimation at a relatively low computational cost. (C) 2010 Elsevier B.V. All rights reserved.

Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have to be scheduled without knowledge of what jobs will come afterwards. The processing times and the due dates become known when the order is placed. The order release date occurs only at the beginning of periodic intervals. A customized approximate dynamic programming method is introduced for this problem. The authors also present numerical experiments that assess the reliability of the new approach and show that it performs better than a myopic policy.

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.

AUTOMATIC CORONARY WALL SEGMENTATION IN INTRAVASCULAR ULTRASOUND IMAGES USING BINARY MORPHOLOGICAL RECONSTRUCTION

Intravascular ultrasound (IVUS) image segmentation can provide more detailed vessel and plaque information, resulting in better diagnostics, evaluation and therapy planning. A novel automatic segmentation proposal is described herein; the method relies on a binary morphological object reconstruction to segment the coronary wall in IVUS images. First, a preprocessing followed by a feature extraction block are performed, allowing for the desired information to be extracted. Afterward, binary versions of the desired objects are reconstructed, and their contours are extracted to segment the image. The effectiveness is demonstrated by segmenting 1300 images, in which the outcomes had a strong correlation to their corresponding gold standard. Moreover, the results were also corroborated statistically by having as high as 92.72% and 91.9% of true positive area fraction for the lumen and media adventitia border, respectively. In addition, this approach can be adapted easily and applied to other related modalities, such as intravascular optical coherence tomography and intravascular magnetic resonance imaging. (E-mail: matheuscardosomg@hotmail.com) (C) 2011 World Federation for Ultrasound in Medicine & Biology.

A Separation Principle for the Continuous-Time LQ-Problem With Markovian Jump Parameters

In this paper, we devise a separation principle for the finite horizon quadratic optimal control problem of continuous-time Markovian jump linear systems driven by a Wiener process and with partial observations. We assume that the output variable and the jump parameters are available to the controller. It is desired to design a dynamic Markovian jump controller such that the closed loop system minimizes the quadratic functional cost of the system over a finite horizon period of time. As in the case with no jumps, we show that an optimal controller can be obtained from two coupled Riccati differential equations, one associated to the optimal control problem when the state variable is available, and the other one associated to the optimal filtering problem. This is a separation principle for the finite horizon quadratic optimal control problem for continuous-time Markovian jump linear systems. For the case in which the matrices are all time-invariant we analyze the asymptotic behavior of the solution of the derived interconnected Riccati differential equations to the solution of the associated set of coupled algebraic Riccati equations as well as the mean square stabilizing property of this limiting solution. When there is only one mode of operation our results coincide with the traditional ones for the LQG control of continuous-time linear systems.

On the Filtering Problem for Continuous-Time Markov Jump Linear Systems with no Observation of the Markov Chain

We consider in this paper the optimal stationary dynamic linear filtering problem for continuous-time linear systems subject to Markovian jumps in the parameters (LSMJP) and additive noise (Wiener process). It is assumed that only an output of the system is available and therefore the values of the jump parameter are not accessible. It is a well known fact that in this setting the optimal nonlinear filter is infinite dimensional, which makes the linear filtering a natural numerically, treatable choice. The goal is to design a dynamic linear filter such that the closed loop system is mean square stable and minimizes the stationary expected value of the mean square estimation error. It is shown that an explicit analytical solution to this optimal filtering problem is obtained from the stationary solution associated to a certain Riccati equation. It is also shown that the problem can be formulated using a linear matrix inequalities (LMI) approach, which can be extended to consider convex polytopic uncertainties on the parameters of the possible modes of operation of the system and on the transition rate matrix of the Markov process. As far as the authors are aware of this is the first time that this stationary filtering problem (exact and robust versions) for LSMJP with no knowledge of the Markov jump parameters is considered in the literature. Finally, we illustrate the results with an example.