Decoding urban landscapes through the analysis of place names and imaginaries at a local scale.

Toponomastics is increasingly interested in the subjective role of place names in quotidian life. In the frame of Urban Geography, the interest in this matter is currently growing, as the recently change in modes of habitation has urged our discipline to find new ways of exploring the cities. In this context, the study of how name's significance is connected to a urban society constitutes a very interesting approach. We believe in the importance of place names as tools for decoding urban areas and societies at a local-scale. This consideration has been frequently taken into account in the analysis of exonyms, although in their case they are not exempt of political and practical implications that prevail over the tool function. The study of toponomastic processes helps us understanding how the city works, by analyzing the liaison between urban landscape, imaginaries and toponyms which is reflected in the scarcity of some names, in the biased creation of new toponyms and in the pressure exercised over every place name by tourists, residents and local government for changing, maintaining or eliminating them. Our study-case, Toledo, is one of the oldest cities in Spain, full of myths, stories and histories that can only be understood combined with processes of internal evolution of the city linked to the arrival of new residents and the more and more notorious change of its historical landscape. At a local scale, we are willing to decode the information which is contained in its toponyms about its landscape and its society.

Systematic analysis of the decoding delay on MVC decoders

We present a framework for the analysis of the decoding delay and communication latency in Multiview Video Coding. The application of this framework on MVC decoders allows minimizing the overall delay in immersive video-conference systems.

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.

Decoding temporally encoded sensory input by cortical oscillations and thalamic phase comparators

The temporally encoded information obtained by vibrissal touch could be decoded “passively,” involving only input-driven elements, or “actively,” utilizing intrinsically driven oscillators. A previous study suggested that the trigeminal somatosensory system of rats does not obey the bottom-up order of activation predicted by passive decoding. Thus, we have tested whether this system obeys the predictions of active decoding. We have studied cortical single units in the somatosensory cortices of anesthetized rats and guinea pigs and found that about a quarter of them exhibit clear spontaneous oscillations, many of them around whisking frequencies (≈10 Hz). The frequencies of these oscillations could be controlled locally by glutamate. These oscillations could be forced to track the frequency of induced rhythmic whisker movements at a stable, frequency-dependent, phase difference. During these stimulations, the response intensities of multiunits at the thalamic recipient layers of the cortex decreased, and their latencies increased, with increasing input frequency. These observations are consistent with thalamocortical loops implementing phase-locked loops, circuits that are most efficient in decoding temporally encoded information like that obtained by active vibrissal touch. According to this model, and consistent with our results, populations of thalamic “relay” neurons function as phase “comparators” that compare cortical timing expectations with the actual input timing and represent the difference by their population output rate.

Glu-tRNAGln amidotransferase: A novel heterotrimeric enzyme required for correct decoding of glutamine codons during translation

The three genes, gatC, gatA, and gatB, which constitute the transcriptional unit of the Bacillus subtilis glutamyl-tRNAGln amidotransferase have been cloned. Expression of this transcriptional unit results in the production of a heterotrimeric protein that has been purified to homogeneity. The enzyme furnishes a means for formation of correctly charged Gln-tRNAGln through the transamidation of misacylated Glu-tRNAGln, functionally replacing the lack of glutaminyl-tRNA synthetase activity in Gram-positive eubacteria, cyanobacteria, Archaea, and organelles. Disruption of this operon is lethal. This demonstrates that transamidation is the only pathway to Gln-tRNAGln in B. subtilis and that glutamyl-tRNAGln amidotransferase is a novel and essential component of the translational apparatus.

Nonlinearity in genetic decoding: Homologous DNA replicase genes use alternatives of transcriptional slippage or translational frameshifting

The τ and γ subunits of DNA polymerase III are both encoded by a single gene in Escherichia coli and Thermus thermophilus. γ is two-thirds the size of τ and shares virtually all its amino acid sequence with τ. E. coli and T. thermophilus have evolved very different mechanisms for setting the approximate 1:1 ratio between τ and γ. Both mechanisms put ribosomes into alternate reading frames so that stop codons in the new frame serve to make the smaller γ protein. In E. coli, ≈50% of initiating ribosomes translate the dnaX mRNA conventionally to give τ, but the other 50% shift into the −1 reading frame at a specific site (A AAA AAG) in the mRNA to produce γ. In T. thermophilus ribosomal frameshifting is not required: the dnaX mRNA is a heterogeneous population of molecules with different numbers of A residues arising from transcriptional slippage on a run of nine T residues in the DNA template. Translation of the subpopulation containing nine As (or +/− multiples of three As) yields τ. The rest of the population of mRNAs (containing nine +/− nonmultiples of three As) puts ribosomes into the alternate reading frames to produce the γ protein(s). It is surprising that two rather similar dnaX sequences in E. coli and T. thermophilus lead to very different mechanisms of expression.

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.

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.

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

Iterative and Pade solutions for the water-wave dispersion relation /

"April 1985."

Speeding up computation in two-dimensional iterative arrays /

"UILU-ENG 80 1720."-- Cover, p. 1.

Iterative global flow techniques for detecting program anomalies /

Thesis--Illinois.