Taxonomy of the Common Dolphins of the Eastern Pacific Ocean

Delphinus bairdii Dall is a species of dolphin distinct from D. delphis Linnaeus, with which it has usually been synonymized. D. bairdii has a longer rostrum relative to the zygomatic width of the skull; the ratio of these measurements falls at 1.55 or above for bairdii and 1.53 and below for delphis. In the eastern Pacific Ocean, D. bairdii is found in the Gulf of California and along the west coast of Baja California, Mexico; D. delphis is presently found in the waters off California. Until approximately the beginning of the present century, bairdii occurred farther north in the eastern Pacific Ocean, at least to the Monterey Bay area of California. Restriction of bairdii to more southerly waters, probably as an indirect result of a change in water temperature, may have permitted delphis to move into inshore Californian waters. The Pacific population of D. delphis has a somewhat shorter rostrum than the Atlantic population, and is perhaps subspecifically different. A thorough analysis of the entire genus Delphinus is needed before the relationship of all the populations can be understood and names properly applied.

Obstructive sleep apnea is common among patients referred for coronary artery bypass grafting and can be diagnosed by portable monitoring

Background Obstructive sleep apnea (OSA) is common among patients with coronary artery disease. However, OSA remains largely under recognized. The lack of clinical suspicion and difficulties to access full polysomnography (PSG) are limiting factors. The aim of this study was to evaluate, among patients referred to coronary artery bypass grafting (CABG): (i) the prevalence of OSA, (ii) the association of OSA with clinical symptoms, (iii) the performance of overnight unattended portable monitoring (PM) as an alternative method for the diagnosis of OSA. Methods Consecutive patients referred for CABG were evaluated by standard physical evaluation and validated questionnaires (Berlin questionnaire and Epworth Sleepiness Scale) and underwent full PSG and PM (Stardust II). Results We studied 70 consecutive patients (76% men), age 58 +/- 7 years (mean +/- SD), BMI [median (interquartile range)] 27.6 kg/m(2) (25.8-31.1). The prevalence of OSA (full PSG) using an apnea-hypopnea index of at least 5 events/h was 87%. Commonly used clinical traits for the screening of OSA such as the Epworth Sleepiness Scale and neck circumference had low sensitivities to detect OSA. In contrast, the Berlin questionnaire showed a good sensitivity (72%) to detect OSA. PM showed good sensitivity (92%) and specificity (67%) for the diagnosis of OSA. Conclusion OSA is strikingly common among patients referred for CABG. The Berlin questionnaire, but not symptom of excessive daytime sleepiness is a useful tool to screen OSA. PM is useful for the diagnosis of OSA and therefore is an attractive tool for widespread use among patients with coronary artery disease. Coron Artery Dis 23:31-38 (C) 2011 Wolters Kluwer Health | Lippincott Williams & Wilkins.

Constrained least square pre-distortion scheme for multiuser ultra-wideband

The study proposes a constrained least square (CLS) pre-distortion scheme for multiple-input single-output (MISO) multiple access ultra-wideband (UWB) systems. In such a scheme, a simple objective function is defined, which can be efficiently solved by a gradient-based algorithm. For the performance evaluation, scenarios CM1 and CM3 of the IEEE 802.15.3a channel model are considered. Results show that the CLS algorithm has a fast convergence and a good trade-off between intersymbol interference (ISI) and multiple access interference (MAI) reduction and signal-to-noise ratio (SNR) preservation, performing better than time-reversal (TR) pre-distortion.

SIS: a program to generate draft genome sequence scaffolds for prokaryotes

Background: Decreasing costs of DNA sequencing have made prokaryotic draft genome sequences increasingly common. A contig scaffold is an ordering of contigs in the correct orientation. A scaffold can help genome comparisons and guide gap closure efforts. One popular technique for obtaining contig scaffolds is to map contigs onto a reference genome. However, rearrangements that may exist between the query and reference genomes may result in incorrect scaffolds, if these rearrangements are not taken into account. Large-scale inversions are common rearrangement events in prokaryotic genomes. Even in draft genomes it is possible to detect the presence of inversions given sufficient sequencing coverage and a sufficiently close reference genome. Results: We present a linear-time algorithm that can generate a set of contig scaffolds for a draft genome sequence represented in contigs given a reference genome. The algorithm is aimed at prokaryotic genomes and relies on the presence of matching sequence patterns between the query and reference genomes that can be interpreted as the result of large-scale inversions; we call these patterns inversion signatures. Our algorithm is capable of correctly generating a scaffold if at least one member of every inversion signature pair is present in contigs and no inversion signatures have been overwritten in evolution. The algorithm is also capable of generating scaffolds in the presence of any kind of inversion, even though in this general case there is no guarantee that all scaffolds in the scaffold set will be correct. We compare the performance of SIS, the program that implements the algorithm, to seven other scaffold-generating programs. The results of our tests show that SIS has overall better performance. Conclusions: SIS is a new easy-to-use tool to generate contig scaffolds, available both as stand-alone and as a web server. The good performance of SIS in our tests adds evidence that large-scale inversions are widespread in prokaryotic genomes.

Maximum Series-Parallel Subgraph

Consider the NP-hard problem of, given a simple graph G, to find a series-parallel subgraph of G with the maximum number of edges. The algorithm that, given a connected graph G, outputs a spanning tree of G, is a 1/2-approximation. Indeed, if n is the number of vertices in G, any spanning tree in G has n-1 edges and any series-parallel graph on n vertices has at most 2n-3 edges. We present a 7/12 -approximation for this problem and results showing the limits of our approach.

Strategies in identifying individuals in a segregant population of common bean and implications of genotype x environment interaction in the success of selection

The objective of this study was to compare the BLUP selection method with different selection strategies in F-2:4 and assess the efficiency of this method on the early choice of the best common bean (Phaseolus vulgaris) lines. Fifty-one F-2:4 progenies were produced from a cross between the CVIII8511 x RP-26 lines. A randomized block design was used with 20 replications and one-plant field plots. Character data on plant architecture and grain yield were obtained and then the sum of the standardized variables was estimated for simultaneous selection of both traits. Analysis was carried out by mixed models (BLUP) and the least squares method to compare different selection strategies, like mass selection, stratified mass selection and between and within progeny selection. The progenies selected by BLUP were assessed in advanced generations, always selecting the greatest and smallest sum of the standardized variables. Analyses by the least squares method and BLUP procedure ranked the progenies in the same way. The coincidence of the individuals identified by BLUP and between and within progeny selection was high and of the greatest magnitude when BLUP was compared with mass selection. Although BLUP is the best estimator of genotypic value, its efficiency in the response to long term selection is not different from any of the other methods, because it is also unable to predict the future effect of the progenies x environments interaction. It was inferred that selection success will always depend on the most accurate possible progeny assessment and using alternatives to reduce the progenies x environments interaction effect.

A Chaotic Approach of Differential Evolution Optimization Applied to Loudspeaker Design Problem

Over the past few years, the field of global optimization has been very active, producing different kinds of deterministic and stochastic algorithms for optimization in the continuous domain. These days, the use of evolutionary algorithms (EAs) to solve optimization problems is a common practice due to their competitive performance on complex search spaces. EAs are well known for their ability to deal with nonlinear and complex optimization problems. Differential evolution (DE) algorithms are a family of evolutionary optimization techniques that use a rather greedy and less stochastic approach to problem solving, when compared to classical evolutionary algorithms. The main idea is to construct, at each generation, for each element of the population a mutant vector, which is constructed through a specific mutation operation based on adding differences between randomly selected elements of the population to another element. Due to its simple implementation, minimum mathematical processing and good optimization capability, DE has attracted attention. This paper proposes a new approach to solve electromagnetic design problems that combines the DE algorithm with a generator of chaos sequences. This approach is tested on the design of a loudspeaker model with 17 degrees of freedom, for showing its applicability to electromagnetic problems. The results show that the DE algorithm with chaotic sequences presents better, or at least similar, results when compared to the standard DE algorithm and other evolutionary algorithms available in the literature.

A regional multirnodulus algorithm for blind equalization of QAM signals: Introduction and steady-state analysis

It is well known that constant-modulus-based algorithms present a large mean-square error for high-order quadrature amplitude modulation (QAM) signals, which may damage the switching to decision-directed-based algorithms. In this paper, we introduce a regional multimodulus algorithm for blind equalization of QAM signals that performs similar to the supervised normalized least-mean-squares (NLMS) algorithm, independently of the QAM order. We find a theoretical relation between the coefficient vector of the proposed algorithm and the Wiener solution and also provide theoretical models for the steady-state excess mean-square error in a nonstationary environment. The proposed algorithm in conjunction with strategies to speed up its convergence and to avoid divergence can bypass the switching mechanism between the blind mode and the decision-directed mode. (c) 2012 Elsevier B.V. All rights reserved.

Reliable identification of mycobacterial species by PCR-restriction enzyme analysis (PRA)-hsp65 in a reference laboratory and elaboration of a sequence-based extended algorithm of PRA-hsp65 patterns

Abstract Background Identification of nontuberculous mycobacteria (NTM) based on phenotypic tests is time-consuming, labor-intensive, expensive and often provides erroneous or inconclusive results. In the molecular method referred to as PRA-hsp65, a fragment of the hsp65 gene is amplified by PCR and then analyzed by restriction digest; this rapid approach offers the promise of accurate, cost-effective species identification. The aim of this study was to determine whether species identification of NTM using PRA-hsp65 is sufficiently reliable to serve as the routine methodology in a reference laboratory. Results A total of 434 NTM isolates were obtained from 5019 cultures submitted to the Institute Adolpho Lutz, Sao Paulo Brazil, between January 2000 and January 2001. Species identification was performed for all isolates using conventional phenotypic methods and PRA-hsp65. For isolates for which these methods gave discordant results, definitive species identification was obtained by sequencing a 441 bp fragment of hsp65. Phenotypic evaluation and PRA-hsp65 were concordant for 321 (74%) isolates. These assignments were presumed to be correct. For the remaining 113 discordant isolates, definitive identification was based on sequencing a 441 bp fragment of hsp65. PRA-hsp65 identified 30 isolates with hsp65 alleles representing 13 previously unreported PRA-hsp65 patterns. Overall, species identification by PRA-hsp65 was significantly more accurate than by phenotype methods (392 (90.3%) vs. 338 (77.9%), respectively; p < .0001, Fisher's test). Among the 333 isolates representing the most common pathogenic species, PRA-hsp65 provided an incorrect result for only 1.2%. Conclusion PRA-hsp65 is a rapid and highly reliable method and deserves consideration by any clinical microbiology laboratory charged with performing species identification of NTM.

Species identification, distributioin and reproductive interactions of common smoot-hound and blackspotted smooth-hound shark (Genus mustelus) in the Adriatic Sea

Longstanding taxonomic ambiguity and uncertainty exist in the identification of the common (M. mustelus) and blackspotted (M. punctulatus) smooth-hound in the Adriatic Sea. The lack of a clear and accurate method of morphological identification, leading to frequent misidentification, prevents the collation of species-specific landings and survey data for these fishes and hampers the delineation of the distribution ranges and stock boundaries of the species. In this context, adequate species-specific conservation and management strategies can not be applied without risks of population declining and local extinction. In this thesis work I investigated the molecular ecology of the two smooth-hound sharks which are abundant in the demersal trawl surveys carried out in the NC Adriatic Sea to monitor and assess the fishery resources. Ecological and evolutionary relationships were assessed by two molecular tests: a DNA barcoding analysis to improve species identification (and consequently the knowledge of their spatial ecology and taxonomy) and a hybridization assay based on the nuclear codominant marker ITS2 to evaluate reproductive interactions (hybridization or gene introgression). The smooth-hound sharks (N=208) were collected during the MEDITS 2008 and 2010 campaigns along the Italian and Croatian coasts of the Adriatic Sea, in the Sicilian Channel and in the Algerian fisheries. Since the identification based on morphological characters is not strongly reliable, I performed a molecular identification of the specimens producing for each one the cytochrome oxidase subunit 1 (COI) gene sequence (ca. 640 bp long) and compared them with reference sequences from different databases (GenBank and BOLD). From these molecular ID data I inferred the distribution of the two target species in the NC Adriatic Sea. In almost the totality of the MEDITS hauls I found no evidence of species sympatry. The data collected during the MEDITS survey showed an almost different distribution of M. mustelus (confined along the Italian coasts) and M. punctulatus (confined along the Croatian coasts); just one sample (Gulf of Venice, where probably the ranges of the species overlap) was found to have catches of both the species. Despite these data results suggested no interaction occurred between my two target species at least during the summertime (the period in which MEDITS survey is carried out), I still wanted to know if there were inter-species reproductive interactions so I developed a simple molecular genetic method to detect hybridization. This method is based on DNA sequence polymorphism among species in the nuclear ribosomal Internal Transcribed Spacer 2 locus (ITS2). Its application to the 208 specimens collected raised important questions regarding the ecology of this two species in the Adriatic Sea. In fact results showed signs of hybridization and/or gene introgression in two sharks collected during the trawl survey of 2008 and one collected during the 2010 one along the Italian and Croatian coasts. In the case that it will be confirmed the hybrid nature of these individuals, a spatiotemporal overlapping of the mating behaviour and ecology must occur. At the spatial level, the northern part of the Adriatic Sea (an area where the two species occur with high frequency of immature individuals) could likely play the role of a common nursery area for both species.

New regularization method for EXAFS analysis: Application to uranium and plutonium sorption onto kaolinite

Die Röntgenabsorptionsspektroskopie (Extended X-ray absorption fine structure (EXAFS) spectroscopy) ist eine wichtige Methode zur Speziation von Schwermetallen in einem weiten Bereich von umweltrelevanten Systemen. Um Strukturparameter wie Koordinationszahl, Atomabstand und Debye-Waller Faktoren für die nächsten Nachbarn eines absorbierenden Atoms zu bestimmen, ist es für experimentelle EXAFS-Spektren üblich, unter Verwendung von Modellstrukturen einen „Least-Squares-Fit“ durchzuführen. Oft können verschiedene Modellstrukturen mit völlig unterschiedlicher chemischer Bedeutung die experimentellen EXAFS-Daten gleich gut beschreiben. Als gute Alternative zum konventionellen Kurven-Fit bietet sich das modifizierte Tikhonov-Regularisationsverfahren an. Ergänzend zur Tikhonov-Standardvariationsmethode enthält der in dieser Arbeit vorgestellte Algorithmus zwei weitere Schritte, nämlich die Anwendung des „Method of Separating Functionals“ und ein Iterationsverfahren mit Filtration im realen Raum. Um das modifizierte Tikhonov-Regularisationsverfahren zu testen und zu bestätigen wurden sowohl simulierte als auch experimentell gemessene EXAFS-Spektren einer kristallinen U(VI)-Verbindung mit bekannter Struktur, nämlich Soddyit (UO2)2SiO4 x 2H2O, untersucht. Die Leistungsfähigkeit dieser neuen Methode zur Auswertung von EXAFS-Spektren wird durch ihre Anwendung auf die Analyse von Proben mit unbekannter Struktur gezeigt, wie sie bei der Sorption von U(VI) bzw. von Pu(III)/Pu(IV) an Kaolinit auftreten. Ziel der Dissertation war es, die immer noch nicht voll ausgeschöpften Möglichkeiten des modifizierten Tikhonov-Regularisationsverfahrens für die Auswertung von EXAFS-Spektren aufzuzeigen. Die Ergebnisse lassen sich in zwei Kategorien einteilen. Die erste beinhaltet die Entwicklung des Tikhonov-Regularisationsverfahrens für die Analyse von EXAFS-Spektren von Mehrkomponentensystemen, insbesondere die Wahl bestimmter Regularisationsparameter und den Einfluss von Mehrfachstreuung, experimentell bedingtem Rauschen, etc. auf die Strukturparameter. Der zweite Teil beinhaltet die Speziation von sorbiertem U(VI) und Pu(III)/Pu(IV) an Kaolinit, basierend auf experimentellen EXAFS-Spektren, die mit Hilfe des modifizierten Tikhonov-Regularisationsverfahren ausgewertet und mit Hilfe konventioneller EXAFS-Analyse durch „Least-Squares-Fit“ bestätigt wurden.

Coordination and Control of Autonomous Mobile Robots Swarms by using Particle Swarm Optimization Algorithm and Consensus Theory

This thesis presents some different techniques designed to drive a swarm of robots in an a-priori unknown environment in order to move the group from a starting area to a final one avoiding obstacles. The presented techniques are based on two different theories used alone or in combination: Swarm Intelligence (SI) and Graph Theory. Both theories are based on the study of interactions between different entities (also called agents or units) in Multi- Agent Systems (MAS). The first one belongs to the Artificial Intelligence context and the second one to the Distributed Systems context. These theories, each one from its own point of view, exploit the emergent behaviour that comes from the interactive work of the entities, in order to achieve a common goal. The features of flexibility and adaptability of the swarm have been exploited with the aim to overcome and to minimize difficulties and problems that can affect one or more units of the group, having minimal impact to the whole group and to the common main target. Another aim of this work is to show the importance of the information shared between the units of the group, such as the communication topology, because it helps to maintain the environmental information, detected by each single agent, updated among the swarm. Swarm Intelligence has been applied to the presented technique, through the Particle Swarm Optimization algorithm (PSO), taking advantage of its features as a navigation system. The Graph Theory has been applied by exploiting Consensus and the application of the agreement protocol with the aim to maintain the units in a desired and controlled formation. This approach has been followed in order to conserve the power of PSO and to control part of its random behaviour with a distributed control algorithm like Consensus.

An integral conservative gridding--algorithm using Hermitian curve interpolation

The problem of re-sampling spatially distributed data organized into regular or irregular grids to finer or coarser resolution is a common task in data processing. This procedure is known as 'gridding' or 're-binning'. Depending on the quantity the data represents, the gridding-algorithm has to meet different requirements. For example, histogrammed physical quantities such as mass or energy have to be re-binned in order to conserve the overall integral. Moreover, if the quantity is positive definite, negative sampling values should be avoided. The gridding process requires a re-distribution of the original data set to a user-requested grid according to a distribution function. The distribution function can be determined on the basis of the given data by interpolation methods. In general, accurate interpolation with respect to multiple boundary conditions of heavily fluctuating data requires polynomial interpolation functions of second or even higher order. However, this may result in unrealistic deviations (overshoots or undershoots) of the interpolation function from the data. Accordingly, the re-sampled data may overestimate or underestimate the given data by a significant amount. The gridding-algorithm presented in this work was developed in order to overcome these problems. Instead of a straightforward interpolation of the given data using high-order polynomials, a parametrized Hermitian interpolation curve was used to approximate the integrated data set. A single parameter is determined by which the user can control the behavior of the interpolation function, i.e. the amount of overshoot and undershoot. Furthermore, it is shown how the algorithm can be extended to multidimensional grids. The algorithm was compared to commonly used gridding-algorithms using linear and cubic interpolation functions. It is shown that such interpolation functions may overestimate or underestimate the source data by about 10-20%, while the new algorithm can be tuned to significantly reduce these interpolation errors. The accuracy of the new algorithm was tested on a series of x-ray CT-images (head and neck, lung, pelvis). The new algorithm significantly improves the accuracy of the sampled images in terms of the mean square error and a quality index introduced by Wang and Bovik (2002 IEEE Signal Process. Lett. 9 81-4).

Parallel algorithm for solving integer linear programs

Linear programs, or LPs, are often used in optimization problems, such as improving manufacturing efficiency of maximizing the yield from limited resources. The most common method for solving LPs is the Simplex Method, which will yield a solution, if one exists, but over the real numbers. From a purely numerical standpoint, it will be an optimal solution, but quite often we desire an optimal integer solution. A linear program in which the variables are also constrained to be integers is called an integer linear program or ILP. It is the focus of this report to present a parallel algorithm for solving ILPs. We discuss a serial algorithm using a breadth-first branch-and-bound search to check the feasible solution space, and then extend it into a parallel algorithm using a client-server model. In the parallel mode, the search may not be truly breadth-first, depending on the solution time for each node in the solution tree. Our search takes advantage of pruning, often resulting in super-linear improvements in solution time. Finally, we present results from sample ILPs, describe a few modifications to enhance the algorithm and improve solution time, and offer suggestions for future work.

International Common Otology Database: taste disturbance after stapes surgery

OBJECTIVE: To use a study on dysgeusia to assess the usefulness of an otology database. STUDY DESIGN: Data were extracted from the international Common Otology Database. INTERVENTION: Primary stapes operations. MAIN OUTCOME MEASURE AND RESULTS: From a cohort of 14 otologists, only 8 (57%) were able to satisfy external validation and maintain data input for a period of at least 6 months. The rates of dysgeusia varied from 0 to 39% at 3 months and 0 to 27% at 6 months. The percentages of patients with taste disturbance at 6 months in the "nerve-cut" and "nerve-preserved" groups were 22.7 and 10.9%, respectively, although this was not statistically significant (chi2; p = 0.325). CONCLUSION: Many surgeons found it difficult to maintain a prospective otology database. The rates of certain subjective symptoms such as dysgeusia are influenced by how vigorously the reviewers prompt the response from the patients. Dysgeusia after stapes surgery is common even if the chorda tympani nerve is preserved. Many patients whose chorda tympani nerve is divided may not complain of dysgeusia.