A comparison between PML, infinite elements and an iterative BEM as mesh truncation methods for HP self-adaptive procedures in electromagnetics

Finite element hp-adaptivity is a technology that allows for very accurate numerical solutions. When applied to open region problems such as radar cross section prediction or antenna analysis, a mesh truncation method needs to be used. This paper compares the following mesh truncation methods in the context of hp-adaptive methods: Infinite Elements, Perfectly Matched Layers and an iterative boundary element based methodology. These methods have been selected because they are exact at the continuous level (a desirable feature required by the extreme accuracy delivered by the hp-adaptive strategy) and they are easy to integrate with the logic of hp-adaptivity. The comparison is mainly based on the number of degrees of freedom needed for each method to achieve a given level of accuracy. Computational times are also included. Two-dimensional examples are used, but the conclusions directly extrapolated to the three dimensional case.

Iterative determination of clinical beam phase space from dose measurements

Monte Carlo (MC) method can accurately compute the dose produced by medical linear accelerators. However, these calculations require a reliable description of the electron and/or photon beams delivering the dose, the phase space (PHSP), which is not usually available. A method to derive a phase space model from reference measurements that does not heavily rely on a detailed model of the accelerator head is presented. The iterative optimization process extracts the characteristics of the particle beams which best explains the reference dose measurements in water and air, given a set of constrains

Iterative bit- and power allocation in correlated MIMO systems

In this contribution a novel iterative bit- and power allocation (IBPA) approach has been developed when transmitting a given bit/s/Hz data rate over a correlated frequency non-selective (4× 4) Multiple-Input MultipleOutput (MIMO) channel. The iterative resources allocation algorithm developed in this investigation is aimed at the achievement of the minimum bit-error rate (BER) in a correlated MIMO communication system. In order to achieve this goal, the available bits are iteratively allocated in the MIMO active layers which present the minimum transmit power requirement per time slot.

TROSY in triple-resonance experiments: New perspectives for sequential NMR assignment of large proteins

The NMR assignment of 13C, 15N-labeled proteins with the use of triple resonance experiments is limited to molecular weights below ∼25,000 Daltons, mainly because of low sensitivity due to rapid transverse nuclear spin relaxation during the evolution and recording periods. For experiments that exclusively correlate the amide proton (1HN), the amide nitrogen (15N), and 13C atoms, this size limit has been previously extended by additional labeling with deuterium (2H). The present paper shows that the implementation of transverse relaxation-optimized spectroscopy ([15N,1H]-TROSY) into triple resonance experiments results in several-fold improved sensitivity for 2H/13C/15N-labeled proteins and approximately twofold sensitivity gain for 13C/15N-labeled proteins. Pulse schemes and spectra recorded with deuterated and protonated proteins are presented for the [15N, 1H]-TROSY-HNCA and [15N, 1H]-TROSY-HNCO experiments. A theoretical analysis of the HNCA experiment shows that the primary TROSY effect is on the transverse relaxation of 15N, which is only little affected by deuteration, and predicts sensitivity enhancements that are in close agreement with the experimental data.

Structure-based assignment of the biochemical function of a hypothetical protein: A test case of structural genomics

Many small bacterial, archaebacterial, and eukaryotic genomes have been sequenced, and the larger eukaryotic genomes are predicted to be completely sequenced within the next decade. In all genomes sequenced to date, a large portion of these organisms’ predicted protein coding regions encode polypeptides of unknown biochemical, biophysical, and/or cellular functions. Three-dimensional structures of these proteins may suggest biochemical or biophysical functions. Here we report the crystal structure of one such protein, MJ0577, from a hyperthermophile, Methanococcus jannaschii, at 1.7-Å resolution. The structure contains a bound ATP, suggesting MJ0577 is an ATPase or an ATP-mediated molecular switch, which we confirm by biochemical experiments. Furthermore, the structure reveals different ATP binding motifs that are shared among many homologous hypothetical proteins in this family. This result indicates that structure-based assignment of molecular function is a viable approach for the large-scale biochemical assignment of proteins and for discovering new motifs, a basic premise of structural genomics.

Gene discovery and gene function assignment in filamentous fungi

Filamentous fungi are a large group of diverse and economically important microorganisms. Large-scale gene disruption strategies developed in budding yeast are not applicable to these organisms because of their larger genomes and lower rate of targeted integration (TI) during transformation. We developed transposon-arrayed gene knockouts (TAGKO) to discover genes and simultaneously create gene disruption cassettes for subsequent transformation and mutant analysis. Transposons carrying a bacterial and fungal drug resistance marker are used to mutagenize individual cosmids or entire libraries in vitro. Cosmids are annotated by DNA sequence analysis at the transposon insertion sites, and cosmid inserts are liberated to direct insertional mutagenesis events in the genome. Based on saturation analysis of a cosmid insert and insertions in a fungal cosmid library, we show that TAGKO can be used to rapidly identify and mutate genes. We further show that insertions can create alterations in gene expression, and we have used this approach to investigate an amino acid oxidation pathway in two important fungal phytopathogens.

An iterative method for extracting energy-like quantities from protein structures.

We present a method (ENERGI) for extracting energy-like quantities from a data base of protein structures. In this paper, we use the method to generate pairwise additive amino acid "energy" scores. These scores are obtained by iteration until they correctly discriminate a set of known protein folds from decoy conformations. The method succeeds in lattice model tests and in the gapless threading problem as defined by Maiorov and Crippen [Maiorov, V. N. & Crippen, G. M. (1992) J. Mol. Biol. 227, 876-888]. A more challenging test of threading a larger set of test proteins derived from the representative set of Hobohm and Sander [Hobohm, U. & Sander, C. (1994) Protein Sci. 3, 522-524] is used as a "workbench" for exploring how the ENERGI scores depend on their parameter sets.

Assignment of Rfp-Y to the chicken major histocompatibility complex/NOR microchromosome and evidence for high-frequency recombination associated with the nucleolar organizer region.

Rfp-Y is a second region in the genome of the chicken containing major histocompatibility complex (MHC) class I and II genes. Haplotypes of Rfp-Y assort independently from haplotypes of the B system, a region known to function as a MHC and to be located on chromosome 16 (a microchromosome) with the single nucleolar organizer region (NOR) in the chicken genome. Linkage mapping with reference populations failed to reveal the location of Rfp-Y, leaving Rfp-Y unlinked in a map containing >400 markers. A possible location of Rfp-Y became apparent in studies of chickens trisomic for chromosome 16 when it was noted that the intensity of restriction fragments associated with Rfp-Y increased with increasing copy number of chromosome 16. Further evidence that Rfp-Y might be located on chromosome 16 was obtained when individuals trisomic for chromosome 16 were found to transmit three Rfp-Y haplotypes. Finally, mapping of cosmid cluster III of the molecular map of chicken MHC genes (containing a MHC class II gene and two rRNA genes) to Rfp-Y validated the assignment of Rfp-Y to the MHC/NOR microchromosome. A genetic map can now be drawn for a portion of chicken chromosome 16 with Rfp-Y, encompassing two MHC class I and three MHC class II genes, separated from the B system by a region containing the NOR and exhibiting highly frequent recombination.

Chaperonin-facilitated protein folding: optimization of rate and yield by an iterative annealing mechanism.

We develop a heuristic model for chaperonin-facilitated protein folding, the iterative annealing mechanism, based on theoretical descriptions of "rugged" conformational free energy landscapes for protein folding, and on experimental evidence that (i) folding proceeds by a nucleation mechanism whereby correct and incorrect nucleation lead to fast and slow folding kinetics, respectively, and (ii) chaperonins optimize the rate and yield of protein folding by an active ATP-dependent process. The chaperonins GroEL and GroES catalyze the folding of ribulose bisphosphate carboxylase at a rate proportional to the GroEL concentration. Kinetically trapped folding-incompetent conformers of ribulose bisphosphate carboxylase are converted to the native state in a reaction involving multiple rounds of quantized ATP hydrolysis by GroEL. We propose that chaperonins optimize protein folding by an iterative annealing mechanism; they repeatedly bind kinetically trapped conformers, randomly disrupt their structure, and release them in less folded states, allowing substrate proteins multiple opportunities to find pathways leading to the most thermodynamically stable state. By this mechanism, chaperonins greatly expand the range of environmental conditions in which folding to the native state is possible. We suggest that the development of this device for optimizing protein folding was an early and significant evolutionary event.

Interaction of GroEL with a highly structured folding intermediate: iterative binding cycles do not involve unfolding.

The GroE proteins are molecular chaperones involved in protein folding. The general mechanism by which they facilitate folding is still enigmatic. One of the central open questions is the conformation of the GroEL-bound nonnative protein. Several suggestions have been made concerning the folding stage at which a protein can interact with GroEL. Furthermore, the possibility exists that binding of the nonnative protein to GroEL results in its unfolding. We have addressed these issues that are basic for understanding the GroE-mediated folding cycle by using folding intermediates of an Fab antibody fragment as molecular probes to define the binding properties of GroEL. We show that, in addition to binding to an early folding intermediate, GroEL is able to recognize and interact with a late quaternary-structured folding intermediate (Dc) without measurably unfolding it. Thus, the prerequisite for binding is not a certain folding stage of a nonnative protein. In contrast, general surface properties of nonnative proteins seem to be crucial for binding. Furthermore, unfolding of a highly structured intermediate does not necessarily occur upon binding to GroEL. Folding of Dc in the presence of GroEL and ATP involves cycles of binding and release. Because in this system no off-pathway reactions or kinetic traps are involved, a quantitative analysis of the reactivation kinetics observed is possible. Our results indicate that the association reaction of Dc and GroEL in the presence of ATP is rather slow, whereas in the absence of ATP association is several orders of magnitude more efficient. Therefore, it seems that ATP functions by inhibiting reassociation rather than promoting release of the bound substrate.

kappa-Opioid receptor in humans: cDNA and genomic cloning, chromosomal assignment, functional expression, pharmacology, and expression pattern in the central nervous system.

Using the mouse delta-opioid receptor cDNA as a probe, we have isolated genomic clones encoding the human mu- and kappa-opioid receptor genes. Their organization appears similar to that of the human delta receptor gene, with exon-intron boundaries located after putative transmembrane domains 1 and 4. The kappa gene was mapped at position q11-12 in human chromosome 8. A full-length cDNA encoding the human kappa-opioid receptor has been isolated. The cloned receptor expressed in COS cells presents a typical kappa 1 pharmacological profile and is negatively coupled to adenylate cyclase. The expression of kappa-opioid receptor mRNA in human brain, as estimated by reverse transcription-polymerase chain reaction, is consistent with the involvement of kappa-opioid receptors in pain perception, neuroendocrine physiology, affective behavior, and cognition. In situ hybridization studies performed on human fetal spinal cord demonstrate the presence of the transcript specifically in lamina II of the dorsal horn. Some divergences in structural, pharmacological, and anatomical properties are noted between the cloned human and rodent receptors.

The assignment of credit through bills of exchange and transmission documents in Andalusi Law

The exchange traffic was a practice that suited the modus vivendi of caravanners and traders in the Islamic world. The inclusion of the Iberian.Peninsula into the most important commercial routes of Muslims – such as the silk route through the North Africa – provides a very solid reason to deepen in the study of the sources that have been preserved about the role that certain credit instruments, which represented an alternative to the coin, might have played in trade centres.

Sequential and parallel synchronous alternating iterative methods

The so-called parallel multisplitting nonstationary iterative Model A was introduced by Bru, Elsner, and Neumann [Linear Algebra and its Applications 103:175-192 (1988)] for solving a nonsingular linear system Ax = b using a weak nonnegative multisplitting of the first type. In this paper new results are introduced when A is a monotone matrix using a weak nonnegative multisplitting of the second type and when A is a symmetric positive definite matrix using a P -regular multisplitting. Also, nonstationary alternating iterative methods are studied. Finally, combining Model A and alternating iterative methods, two new models of parallel multisplitting nonstationary iterations are introduced. When matrix A is monotone and the multisplittings are weak nonnegative of the first or of the second type, both models lead to convergent schemes. Also, when matrix A is symmetric positive definite and the multisplittings are P -regular, the schemes are also convergent.

Convergence analysis and validation of low cost distance metrics for computational cost reduction of the Iterative Closest Point algorithm

The Iterative Closest Point algorithm (ICP) is commonly used in engineering applications to solve the rigid registration problem of partially overlapped point sets which are pre-aligned with a coarse estimate of their relative positions. This iterative algorithm is applied in many areas such as the medicine for volumetric reconstruction of tomography data, in robotics to reconstruct surfaces or scenes using range sensor information, in industrial systems for quality control of manufactured objects or even in biology to study the structure and folding of proteins. One of the algorithm’s main problems is its high computational complexity (quadratic in the number of points with the non-optimized original variant) in a context where high density point sets, acquired by high resolution scanners, are processed. Many variants have been proposed in the literature whose goal is the performance improvement either by reducing the number of points or the required iterations or even enhancing the complexity of the most expensive phase: the closest neighbor search. In spite of decreasing its complexity, some of the variants tend to have a negative impact on the final registration precision or the convergence domain thus limiting the possible application scenarios. The goal of this work is the improvement of the algorithm’s computational cost so that a wider range of computationally demanding problems from among the ones described before can be addressed. For that purpose, an experimental and mathematical convergence analysis and validation of point-to-point distance metrics has been performed taking into account those distances with lower computational cost than the Euclidean one, which is used as the de facto standard for the algorithm’s implementations in the literature. In that analysis, the functioning of the algorithm in diverse topological spaces, characterized by different metrics, has been studied to check the convergence, efficacy and cost of the method in order to determine the one which offers the best results. Given that the distance calculation represents a significant part of the whole set of computations performed by the algorithm, it is expected that any reduction of that operation affects significantly and positively the overall performance of the method. As a result, a performance improvement has been achieved by the application of those reduced cost metrics whose quality in terms of convergence and error has been analyzed and validated experimentally as comparable with respect to the Euclidean distance using a heterogeneous set of objects, scenarios and initial situations.

Fast iterative solvers for Cahn-Hilliard problems

Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik, Dissertation, 2016