Objective Assessment of Internal Nasal Dimensions and Speech Resonance in Individuals With Repaired Unilateral Cleft Lip and Palate After Rhinoseptoplasty

The objective of the current study was to analyze the effects of rhinoseptoplasty on internal nasal dimensions and speech resonance of individuals with unilateral cleft lip and palate, estimated by acoustic rhinometry and nasometry, respectively. Twenty-one individuals (aged 15-46 years) with previously repaired unilateral cleft lip and palate were analyzed before (PRE), and 6 to 9 (POST1) and 12 to 18 months (POST2) after surgery. Acoustic rhinometry was used to measure the cross-sectional areas (CSAs) of segments corresponding to the nasal valve (CSA1), anterior portion (CSA2), and posterior portion (CSA3) of the lower turbinate, and the volumes at the nasal valve (V1) and turbinate (V2) regions at cleft and noncleft sides, before and after nasal decongestion with a topical vasoconstrictor. Nasometry was used to evaluate speech nasalance during the reading of a set of sentences containing nasal sounds and other devoid of nasal sounds. At the cleft side, before nasal decongestion, there was a significant increase (P < 0.05) in mean CSA1 and V1 values at POST1 and POST2 compared with PRE. After decongestion, increased values were also observed for CSA2 and V2 at POST2. No significant changes were observed at the noncleft side. Mean nasalance values at PRE, POST1, an POST2 were not different from each other in both oral and nasal sentences. The measurement of CSAs and volumes by acoustic rhinometry revealed that rhinoseptoplasty provided, in most cases analyzed, a significant increase in nasal patency, without concomitant changes in speech resonance, as estimated by nasalance assessment.

On the use of rotational splitting asymmetries to probe the internal rotation profile of stars: Application to beta Cephei stars

Rotationally-split modes can provide valuable information about the internal rotation profile of stars. This has been used for years to infer the internal rotation behavior of the Sun. The present work discusses the potential additional information that rotationally splitting asymmetries may provide when studying the internal rotation profile of stars. We present here some preliminary results of a method, currently under development, which intends: 1) to understand the variation of the rotational splitting asymmetries in terms of physical processes acting on the angular momentum distribution in the stellar interior, and 2) how this information can be used to better constrain the internal rotation profile of the stars. The accomplishment of these two objectives should allow us to better use asteroseismology as a test-bench of the different theories describing the angular momentum distribution and evolution in the stellar interiors. (C) 2010 WILEY-VCH Verlag GmbH&Co. KGaA, Weinheim

Comparative Internal Structure of Dorsal Lips and Radiolar Appendages in Sabellidae (Polychaeta) and Phylogenetic Implications

Fan worms (Sabellidae) possess paired modified prostomial structures at the base of the radiolar crown, dorso-lateral to the mouth, called dorsal lips. The dorsal lips are involved in the sorting of particles collected by the radiolar crown. The range of variation in the morphology of dorsal lips is extensive, and probably this is not only due to adaptations to different environments and feeding preferences but also due to phylogenetic constraints. In this study, we describe and compare the morphology of dorsal lips in a range of sabellid taxa based on histological cross-sections of these structures, and compare our data and terminology with those of previous studies. Dorsal lips are maintained erect in most taxa by a modified radiole fused to them known as dorsal radiolar appendage. We suggest that dorsal radiolar appendages with an internal supporting axis (cellular or acellular) and probably also the ventral lips are synapomorphies of the family. J. Morphol. 272: 302-319, 2011. (C) 2010 Wiley-Liss, Inc.

A hybrid approach to learn with imbalanced classes using evolutionary algorithms

There is an increasing interest in the application of Evolutionary Algorithms (EAs) to induce classification rules. This hybrid approach can benefit areas where classical methods for rule induction have not been very successful. One example is the induction of classification rules in imbalanced domains. Imbalanced data occur when one or more classes heavily outnumber other classes. Frequently, classical machine learning (ML) classifiers are not able to learn in the presence of imbalanced data sets, inducing classification models that always predict the most numerous classes. In this work, we propose a novel hybrid approach to deal with this problem. We create several balanced data sets with all minority class cases and a random sample of majority class cases. These balanced data sets are fed to classical ML systems that produce rule sets. The rule sets are combined creating a pool of rules and an EA is used to build a classifier from this pool of rules. This hybrid approach has some advantages over undersampling, since it reduces the amount of discarded information, and some advantages over oversampling, since it avoids overfitting. The proposed approach was experimentally analysed and the experimental results show an improvement in the classification performance measured as the area under the receiver operating characteristics (ROC) curve.

Partial spectral projected gradient method with active-set strategy for linearly constrained optimization

A method for linearly constrained optimization which modifies and generalizes recent box-constraint optimization algorithms is introduced. The new algorithm is based on a relaxed form of Spectral Projected Gradient iterations. Intercalated with these projected steps, internal iterations restricted to faces of the polytope are performed, which enhance the efficiency of the algorithm. Convergence proofs are given and numerical experiments are included and commented. Software supporting this paper is available through the Tango Project web page: http://www.ime.usp.br/similar to egbirgin/tango/.

Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms

J.A. Ferreira Neto, E.C. Santos Junior, U. Fra Paleo, D. Miranda Barros, and M.C.O. Moreira. 2011. Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms. Cien. Inv. Agr. 38(2): 169-178. The objective of this manuscript is to develop a new procedure to achieve optimal land subdivision using genetic algorithms (GA). The genetic algorithm was tested in the rural settlement of Veredas, located in Minas Gerais, Brazil. This implementation was based on the land aptitude and its productivity index. The sequence of tests in the study was carried out in two areas with eight different agricultural aptitude classes, including one area of 391.88 ha subdivided into 12 lots and another of 404.1763 ha subdivided into 14 lots. The effectiveness of the method was measured using the shunting line standard value of a parceled area lot`s productivity index. To evaluate each parameter, a sequence of 15 calculations was performed to record the best individual fitness average (MMI) found for each parameter variation. The best parameter combination found in testing and used to generate the new parceling with the GA was the following: 320 as the generation number, a population of 40 individuals, 0.8 mutation tax, and a 0.3 renewal tax. The solution generated rather homogeneous lots in terms of productive capacity.

Ideal internal kink modes in a differentially rotating cylindrical plasma

The Velikhov effect leading to magnetorotational instability (MRI) is incorporated into the theory of ideal internal kink modes in a differentially rotating cylindrical plasma column. It is shown that this effect can play a stabilizing role for suitably organized plasma rotation profiles, leading to suppression of MHD (magnetohydrodynamic) instabilities in magnetic confinement systems. The role of this effect in the problem of the Suydam and the m = 1 internal kink modes is elucidated, where m is the poloidal mode number.

Extending the use of canonical and microcanonical Monte Carlo algorithms to spin models

We describe the canonical and microcanonical Monte Carlo algorithms for different systems that can be described by spin models. Sites of the lattice, chosen at random, interchange their spin values, provided they are different. The canonical ensemble is generated by performing exchanges according to the Metropolis prescription whereas in the microcanonical ensemble, exchanges are performed as long as the total energy remains constant. A systematic finite size analysis of intensive quantities and a comparison with results obtained from distinct ensembles are performed and the quality of results reveal that the present approach may be an useful tool for the study of phase transitions, specially first-order transitions. (C) 2009 Elsevier B.V. All rights reserved.

Internal Residual Stress Measurements in a Bioactive Glass-Ceramic Using Vickers Indentation

The residual stress distribution that arises in the glass matrix during cooling of a partially crystallized 17.2Na(2)O-32.1CaO-48.1SiO(2)-2.5P(2)O(5) (mol%) bioactive glass-ceramic was measured using the Vickers indentation method proposed by Zeng and Rowcliffe (ZR). The magnitude of the determined residual stress at the crystal/glass boundary was 1/4-1/3 of the values measured using X-ray diffraction (within the crystals) and calculated using Selsing`s model. A correction for the crack geometry factor, assuming a semi-elliptical shape, is proposed and then good agreement between experimental and theoretical values is found. Thus, if the actual crack geometry is taken into account, the indentation technique of ZR can be successfully used. In addition, a numerical model for the calculation of residual stresses that takes into account the hemispherical shape of the crystalline precipitates at a free surface was developed. The result is that near the sample surface, the radial component of the residual stress is increased by 70% in comparison with the residual stress calculated by Selsing`s model.

A novel MAP-MRF approach for multispectral image contextual classification using combination of suboptimal iterative algorithms

In this paper we present a novel approach for multispectral image contextual classification by combining iterative combinatorial optimization algorithms. The pixel-wise decision rule is defined using a Bayesian approach to combine two MRF models: a Gaussian Markov Random Field (GMRF) for the observations (likelihood) and a Potts model for the a priori knowledge, to regularize the solution in the presence of noisy data. Hence, the classification problem is stated according to a Maximum a Posteriori (MAP) framework. In order to approximate the MAP solution we apply several combinatorial optimization methods using multiple simultaneous initializations, making the solution less sensitive to the initial conditions and reducing both computational cost and time in comparison to Simulated Annealing, often unfeasible in many real image processing applications. Markov Random Field model parameters are estimated by Maximum Pseudo-Likelihood (MPL) approach, avoiding manual adjustments in the choice of the regularization parameters. Asymptotic evaluations assess the accuracy of the proposed parameter estimation procedure. To test and evaluate the proposed classification method, we adopt metrics for quantitative performance assessment (Cohen`s Kappa coefficient), allowing a robust and accurate statistical analysis. The obtained results clearly show that combining sub-optimal contextual algorithms significantly improves the classification performance, indicating the effectiveness of the proposed methodology. (C) 2010 Elsevier B.V. All rights reserved.

GEOCHEMISTRY AND U-PB ZIRCON AGE OF THE INTERNAL OSSA-MORENA ZONE OPHIOLITE SEQUENCES: A REMNANT OF RHEIC OCEAN IN SW IBERIA

The Early Paleozoic geodynamic evolution in SW Iberia is believed to have been dominated by the opening of the Rheic Ocean. The Rheic Ocean is generally accepted to have resulted from the drift of peri-Gondwanan terranes such as Avalonia from the northern margin of Gondwana during Late Cambrian-Early Ordovician times. The closure of the Rheic Ocean was the final result of a continent-continent collision between Gondwana and Laurussia that produced the Variscan orogen. The Ossa-Morena Zone is a peri-Gondwana terrane, which preserves spread fragments of ophiolites - the Internal Ossa-Morena Zones Ophiolite Sequences (IOMZOS). The final patchwork of the IOMZOS shows a complete oceanic lithospheric sequence with geochemical characteristics similar to the ocean-floor basalts, without any orogenic fingerprint and/or crustal contamination. The IOMZOS were obducted and imbricated with high pressure lithologies. Based on structural, petrological and whole-rock geochemical data, the authors argue that the IOMZOS represent fragments of the oceanic lithosphere from the Rheic Ocean. Zircon SHRIMP U-Pb geochronological data on metagabbros point to an age of ca. 480 Ma for IOMZOS, providing evidence of a well-developed ocean in SW Iberia during this period, reinforcing the interpretation of the Rheic Ocean as a wide ocean among the peri-Gondwanan terranes during Early Ordovician times.

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.

Approximation algorithms and hardness results for the clique packing problem

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.

Algorithms for Maximum Independent Set in Convex Bipartite Graphs

A bipartite graph G = (V, W, E) is convex if there exists an ordering of the vertices of W such that, for each v. V, the neighbors of v are consecutive in W. We describe both a sequential and a BSP/CGM algorithm to find a maximum independent set in a convex bipartite graph. The sequential algorithm improves over the running time of the previously known algorithm and the BSP/CGM algorithm is a parallel version of the sequential one. The complexity of the algorithms does not depend on |W|.

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.