A parameterization method for the computation of invariant tori and their whiskers in quasi-periodic maps: explorations and mechanisms for the breakdown of hyperbolicity

In two previous papers [J. Differential Equations, 228 (2006), pp. 530 579; Discrete Contin. Dyn. Syst. Ser. B, 6 (2006), pp. 1261 1300] we have developed fast algorithms for the computations of invariant tori in quasi‐periodic systems and developed theorems that assess their accuracy. In this paper, we study the results of implementing these algorithms and study their performance in actual implementations. More importantly, we note that, due to the speed of the algorithms and the theoretical developments about their reliability, we can compute with confidence invariant objects close to the breakdown of their hyperbolicity properties. This allows us to identify a mechanism of loss of hyperbolicity and measure some of its quantitative regularities. We find that some systems lose hyperbolicity because the stable and unstable bundles approach each other but the Lyapunov multipliers remain away from 1. We find empirically that, close to the breakdown, the distances between the invariant bundles and the Lyapunov multipliers which are natural measures of hyperbolicity depend on the parameters, with power laws with universal exponents. We also observe that, even if the rigorous justifications in [J. Differential Equations, 228 (2006), pp. 530-579] are developed only for hyperbolic tori, the algorithms work also for elliptic tori in Hamiltonian systems. We can continue these tori and also compute some bifurcations at resonance which may lead to the existence of hyperbolic tori with nonorientable bundles. We compute manifolds tangent to nonorientable bundles.

A Database of >20 keV Electron Green's Functions of Interplanetary Transport at 1 AU

We use interplanetary transport simulations to compute a database of electron Green's functions, i.e., differential intensities resulting at the spacecraft position from an impulsive injection of energetic (>20 keV) electrons close to the Sun, for a large number of values of two standard interplanetary transport parameters: the scattering mean free path and the solar wind speed. The nominal energy channels of the ACE, STEREO, and Wind spacecraft have been used in the interplanetary transport simulations to conceive a unique tool for the study of near-relativistic electron events observed at 1 AU. In this paper, we quantify the characteristic times of the Green's functions (onset and peak time, rise and decay phase duration) as a function of the interplanetary transport conditions. We use the database to calculate the FWHM of the pitch-angle distributions at different times of the event and under different scattering conditions. This allows us to provide a first quantitative result that can be compared with observations, and to assess the validity of the frequently used term beam-like pitch-angle distribution.

Protein interaction studies point to new functions for Escherichia coli glyceraldehyde-3-phosphate dehydrogenase

Glyceraldehyde-3-phosphate dehydrogenase (GAPDH) is considered a multifunctional protein with defined functions in numerous mammalian cellular processes. GAPDH functional diversity depends on various factors such as covalent modifications, subcellular localization, oligomeric state and intracellular concentration of substrates or ligands, as well as protein-protein interactions. In bacteria, alternative GAPDH functions have been associated with its extracellular location in pathogens or probiotics. In this study, new intracellular functions of E. coli GAPDH were investigated following a proteomic approach aimed at identifying interacting partners using in vivo formaldehyde cross-linking followed by mass spectrometry. The identified proteins were involved in metabolic processes, protein synthesis and folding or DNA repair. Some interacting proteins were also identified in immunopurification experiments in the absence of cross-linking. Pull-down experiments and overlay immunoblotting were performed to further characterize the interaction with phosphoglycolate phosphatase (Gph). This enzyme is involved in the metabolism of 2-phosphoglycolate formed in the DNA repair of 3"-phosphoglycolate ends generated by bleomycin damage. We show that interaction between Gph and GAPDH increases in cells challenged with bleomycin, suggesting involvement of GAPDH in cellular processes linked to DNA repair mechanisms.

Executive functions profile in extreme eating/weight conditions: from anorexia nervosa to obesity

Extreme weight conditions (EWC) groups along a continuum may share some biological risk factors and intermediate neurocognitive phenotypes. A core cognitive trait in EWC appears to be executive dysfunction, with a focus on decision making, response inhibition and cognitive flexibility. Differences between individuals in these areas are likely to contribute to the differences in vulnerability to EWC. The aim of the study was to investigate whether there is a common pattern of executive dysfunction in EWC while comparing anorexia nervosa patients (AN), obese subjects (OB) and healthy eating/weight controls (HC).

The Human Mesenchymal Stromal Cell-Derived Osteocyte Capacity to Modulate Dendritic Cell Functions Is Strictly Dependent on the Culture System.

In vitro differentiation of mesenchymal stromal cells (MSC) into osteocytes (human differentiated osteogenic cells, hDOC) before implantation has been proposed to optimize bone regeneration. However, a deep characterization of the immunological properties of DOC, including their effect on dendritic cell (DC) function, is not available. DOC can be used either as cellular suspension (detached, Det-DOC) or as adherent cells implanted on scaffolds (adherent, Adh-DOC). By mimicking in vitro these two different routes of administration, we show that both Det-DOC and Adh-DOC can modulate DC functions. Specifically, the weak downregulation of CD80 and CD86 caused by Det-DOC on DC surface results in a weak modulation of DC functions, which indeed retain a high capacity to induce T-cell proliferation and to generate CD4(+)CD25(+)Foxp3(+) T cells. Moreover, Det-DOC enhance the DC capacity to differentiate CD4(+)CD161(+)CD196(+) Th17-cells by upregulating IL-6 secretion. Conversely, Adh-DOC strongly suppress DC functions by a profound downregulation of CD80 and CD86 on DC as well as by the inhibition of TGF-β production. In conclusion, we demonstrate that different types of DOC cell preparation may have a different impact on the modulation of the host immune system. This finding may have relevant implications for the design of cell-based tissue-engineering strategies.

Mechanisms of OGT-mediated HCF-1 protein maturation

Post-translational protein modifications are crucial for many fundamental cellular and extracellular processes and greatly contribute to the complexity of organisms. Human HCF-1 is a transcriptional co-regulator that undergoes complex protein maturation involving reversible and irreversible post-translational modifications. Upon synthesis as a large precursor protein, HCF-1 undergoes extensive reversible glycosylation with β-N-acetylglucosamine giving rise to O-linked-β-N-acetylglucosamine (O-GlcNAc) modified serines and threonines. HCF-1 also undergoes irreversible site-specific proteolysis, which is important for one of HCF-1's major functions - the regulation of the cell-division cycle. HCF-1 O-GlcNAcylation and site-specific proteolysis are both catalyzed by a single enzyme with an unusual dual enzymatic activity, the O-GlcNAc transferase (OGT). HCF-1 is cleaved by OGT at any of six highly conserved 26 amino acid repeated sequences (HCF-1PRO repeats), but the mechanisms and the substrate requirements for OGT-mediated cleavage are not understood. In the present work, I characterized substrate requirements for OGT-mediated cleavage and O-GlcNAcylation of HCF-1. I identified key elements within the HCF-1PRO-repeat sequence that are important for proteolysis. Remarkably, an invariant single amino acid side-chain within the HCF-1PRO-repeat sequence displays particular OGT-binding properties and is essential for proteolysis. Additionally, I characterized substrate requirements for proteolysis outside of the HCF-1PRO repeat and identified a novel, highly O-GlcNAcylated OGT-binding sequence that enhances cleavage of the first HCF-1PRO repeat. These results link OGT association and its O-GlcNAcylation activities to HCF-1PRO-repeat proteolysis.

Sidelobe elimination for generalized synthetic discriminant functions by a two-filter correlation and subsequent postprocessing of the intensity distributions

One of the most important problems in optical pattern recognition by correlation is the appearance of sidelobes in the correlation plane, which causes false alarms. We present a method that eliminate sidelobes of up to a given height if certain conditions are satisfied. The method can be applied to any generalized synthetic discriminant function filter and is capable of rejecting lateral peaks that are even higher than the central correlation. Satisfactory results were obtained in both computer simulations and optical implementation.

On the computation of reducible invariant tori on a parallel computer

We present an algorithm for the computation of reducible invariant tori of discrete dynamical systems that is suitable for tori of dimensions larger than 1. It is based on a quadratically convergent scheme that approximates, at the same time, the Fourier series of the torus, its Floquet transformation, and its Floquet matrix. The Floquet matrix describes the linearization of the dynamics around the torus and, hence, its linear stability. The algorithm presents a high degree of parallelism, and the computational effort grows linearly with the number of Fourier modes needed to represent the solution. For these reasons it is a very good option to compute quasi-periodic solutions with several basic frequencies. The paper includes some examples (flows) to show the efficiency of the method in a parallel computer. In these flows we compute invariant tori of dimensions up to 5, by taking suitable sections.

Biological interpretation of genome-wide association studies using predicted gene functions.

The main challenge for gaining biological insights from genetic associations is identifying which genes and pathways explain the associations. Here we present DEPICT, an integrative tool that employs predicted gene functions to systematically prioritize the most likely causal genes at associated loci, highlight enriched pathways and identify tissues/cell types where genes from associated loci are highly expressed. DEPICT is not limited to genes with established functions and prioritizes relevant gene sets for many phenotypes.

Implementing Role Based Access Control into the Enterprise Environment to Support Business and IT Functions

The thesis studies role based access control and its suitability in the enterprise environment. The aim is to research how extensively role based access control can be implemented in the case organization and how it support organization’s business and IT functions. This study points out the enterprise’s needs for access control, factors of access control in the enterprise environment and requirements for implementation and the benefits and challenges it brings along. To find the scope how extensively role based access control can be implemented into the case organization, firstly is examined the actual state of access control. Secondly is defined a rudimentary desired state (how things should be) and thirdly completed it by using the results of the implementation of role based access control application. The study results the role model for case organization unit, and the building blocks and the framework for the organization wide implementation. Ultimate value for organization is delivered by facilitating the normal operations of the organization whilst protecting its information assets.

New kernel functions and learning methods for text and data mining

Recent advances in machine learning methods enable increasingly the automatic construction of various types of computer assisted methods that have been difficult or laborious to program by human experts. The tasks for which this kind of tools are needed arise in many areas, here especially in the fields of bioinformatics and natural language processing. The machine learning methods may not work satisfactorily if they are not appropriately tailored to the task in question. However, their learning performance can often be improved by taking advantage of deeper insight of the application domain or the learning problem at hand. This thesis considers developing kernel-based learning algorithms incorporating this kind of prior knowledge of the task in question in an advantageous way. Moreover, computationally efficient algorithms for training the learning machines for specific tasks are presented. In the context of kernel-based learning methods, the incorporation of prior knowledge is often done by designing appropriate kernel functions. Another well-known way is to develop cost functions that fit to the task under consideration. For disambiguation tasks in natural language, we develop kernel functions that take account of the positional information and the mutual similarities of words. It is shown that the use of this information significantly improves the disambiguation performance of the learning machine. Further, we design a new cost function that is better suitable for the task of information retrieval and for more general ranking problems than the cost functions designed for regression and classification. We also consider other applications of the kernel-based learning algorithms such as text categorization, and pattern recognition in differential display. We develop computationally efficient algorithms for training the considered learning machines with the proposed kernel functions. We also design a fast cross-validation algorithm for regularized least-squares type of learning algorithm. Further, an efficient version of the regularized least-squares algorithm that can be used together with the new cost function for preference learning and ranking tasks is proposed. In summary, we demonstrate that the incorporation of prior knowledge is possible and beneficial, and novel advanced kernels and cost functions can be used in algorithms efficiently.