MiRNAs are essential mediators of many biological processes. The aim of this study was to investigate the dynamics of miRNA-mRNA regulatory networks during exercise and the subsequent recovery period.
Here we monitored the transcriptome changes using microarray analysis of the whole blood of eight highly trained athletes before and after 30 min of moderate exercise followed by 30 min and 60 min of recovery period. We combined expression profiling and bioinformatics and analysed metabolic pathways enriched with differentially expressed mRNAs and mRNAs which are known to be validated targets of differentially expressed miRNAs. Finally we revealed four dynamically regulated networks comprising differentially expressed miRNAs and their known target mRNAs with anti-correlated expression profiles over time. The data suggest that hsa-miR-21-5p regulated TGFBR3, PDGFD and PPM1L mRNAs. Hsa-miR-24-2-5p was likely to be responsible for MYC andKCNJ2 genes and hsa-miR-27a-5p for ST3GAL6. The targets of hsa-miR-181a-5p included ROPN1L and SLC37A3. All these mRNAs are involved in processes highly relevant to exercise response, including immune function, apoptosis, membrane traffic of proteins and transcription regulation.
We have identified metabolic pathways involved in response to exercise and revealed four miRNA-mRNA networks dynamically regulated following exercise. This work is the first study to monitor miRNAs and mRNAs in parallel into the recovery period. The results provide a novel insight into the regulatory role of miRNAs in stress adaptation.
This paper presents an approach to dynamic component composition that facilitates creating new composed components using existing ones at runtime and without any code generation. The dynamic abilities are supported by extended type notion and implementation based on additional superstructure provided with its Java API and corresponding JavaBeans components. The new component composition is performed by building the composed prototype object that can be dynamically transformed into the new instantiable type (component). That approach demonstrates interrelations between prototype-based and class-based component-oriented programming. The component model proposed can be used when implementing user-defined types in declarative languages for event-driven applications programming.
We assess the problem of choosing optimal direct topology for InfiniBand networks in terms of performance. Newest topologies like Dragonfly, Flattened butterfly and Slim Fly are considered, as well as standard Tori and Hypercubes.We consider some reasonable extensions to InfiniBand hardware which could be implemented by vendors easily and may allow reasonable routing algorithms for such topologies. A number of routing algorithms are proposed and compared for various traffic patterns. Mapping algorithms for Dragonfly and Flattened Butterfly are proposed. Based on this research it has been decided to use Flattened Butterfly topology for system #22 in November 2014 Top 500 list.
The structural and morphological features of samples containing titanium dioxide, obtained by the sulfate method in the presence of methylene blue dye MeB (sample with η-TiO2) and in its absence (sample with anatase), have been determined using a complex of analytical methods. For the sample with η-TiO2, the sizes of titanium dioxide crystallites (5.0(2) nm) are smaller than the nanoparticle sizes (5.5–9.0 nm), which does not exclude their defect structure. This sample exhibited a higher tendency of nanoparticles to agglomeration (the presence of strong bonds between nanoparticles) and a low tendency to aggregation (the presence of weak bonds). It is shown that a MeB-modified sample with η-TiO2 has high photocatalytic activity in the visible spectral range in the model reaction of methyl orange dye decomposition. © 2015, Pleiades Publishing, Inc.
The notion of a tolerance of an element of a combinatorial optimization problem is often used for stability analysis of an optimal solution and it is a base for design branch-and-bound algorithms solving such problems. In this paper we show that for the weighted independent set problem on trees with n vertices all upper and lower tolerances related to this solution can be computed with O(n) time.
Предложен подход к эффективной реализации Российского национального стандарта цифровой подписи ГОСТ Р 34.10 в связи с его новыми модификациями. Используются современные алгоритмы скалярного умножения и различные представления эллиптических кривых над простыми полями. Приводятся результаты вычислительных экспериментов и рекомендации по выбору параметров описанных алгоритмов.