To study 3D nuclear distributions of epigenetic hist one modifications such as H3(K9) acetylation, H3(K4) dimethylation, H3(K9) dimethylation, and H3(K27) trimethylation, and of histone methyltransferase Suv39H1, we used advanced image analysis methods, comb ined with Nipkow disk confocal microscopy. Total fluorescence intensity and distributions of fluorescently labelled proteins were analyzed in formaldehyde-fixed interphase nuclei. Our data showed reduced fluorescent signals of H3(K9) acetylation and H3(K4) dimethylation (di-me) at the nuclear periphery, while di-meH3(K9) was also abundant in chromatin regions closely associated with the nuclear envelope. Little overlapping (intermingling) was observed for di-meH3(K4) and H3(K27) trimethylation (tri-me), and for di-meH3(K9) and Suv39H1. The histone modifications studied were absent in the nucleolar compartment with the exception of H3(K9) dimethylation that was closely associated with perinucleolar regions which are formed by centromeres of acrocentric chromosomes. Using immunocytochemistry, no di-meH3(K4) but only dense di-meH3(K9) was found for the human acrocentric chromosomes 14 and 22. The active X chromosome was observed to be partially acetylated, while the inactive X was more condensed, located in a very peripheral part of the interphase nuclei, and lacked H3(K9) acetylation. Our results confirmed specific interphase patterns of histone modifications within the interphase nuclei as well as within their chromosome territories., M. Skalníková, E. Bártová, V. Ulman, P. Matula, D. Svoboda, A. Harničarová, M. Kozubek, S. Kozubek., and Obsahuje bibliografii a bibliografické odkazy
Gestational diabetes mellitus (GDM) and polycystic ovary syndrome (PCOS) are distinct pathologies with impaired insulin sensitivity as a common feature. The aim of this study was to evaluate the response of fat tissue adipokines and gastrointestinal incretins to glucose load in patients diagnosed with one of the two disorders and to compare it with healthy controls. Oral glucose tolerance test (oGTT) was performed in 77 lean young women: 22 had positive history of GDM, 19 were PCOS patients, and 36 were healthy controls. Hormones were evaluated in fasting and in 60 min intervals during the 3 h oGTT using Bio-Plex ProHuman Diabetes 10-Plex Assay for C-peptide, ghrelin, GIP, GLP1, glucagon, insulin, leptin, total PAI1, resistin, visfatin and Bio-Plex ProHuman Diabetes Adipsin and Adiponectin Assays (Bio-Rad). Despite lean body composition, both PCOS and GDM women were more insulin resistant than controls. Significant postchallenge differences between the GDM and PCOS groups were observed in secretion of adipsin, leptin, glucagon, visfatin, ghrelin, GIP, and also GLP1 with higher levels in GDM. Conversely, PCOS was associated with the highest resistin, C-peptide, and PAI1 levels. Our data suggest that decreased insulin sensitivity observed in lean women with GDM and PCOS is associated with distinct hormonal response of fat and gastrointestinal tissue to glucose load., D. Vejrazkova, O. Lischkova, M. Vankova, S. Stanicka, J. Vrbikova, P. Lukasova, J. Vcelak, G. Vacinova, B. Bendlova., and Obsahuje bibliografii
The distinguished completion $E(G)$ of a lattice ordered group $G$ was investigated by Ball [1], [2], [3]. An analogous notion for $MV$-algebras was dealt with by the author [7]. In the present paper we prove that if a lattice ordered group $G$ is a direct product of lattice ordered groups $G_i$ $(i\in I)$, then $E(G)$ is a direct product of the lattice ordered groups $E(G_i)$. From this we obtain a generalization of a result of Ball [3].
In this paper, we focus on an aggregative optimization problem under the communication bottleneck. The aggregative optimization is to minimize the sum of local cost functions. Each cost function depends on not only local state variables but also the sum of functions of global state variables. The goal is to solve the aggregative optimization problem through distributed computation and local efficient communication over a network of agents without a central coordinator. Using the variable tracking method to seek the global state variables and the quantization scheme to reduce the communication cost spent in the optimization process, we develop a novel distributed quantized algorithm, called D-QAGT, to track the optimal variables with finite bits communication. Although quantization may lose transmitting information, our algorithm can still achieve the exact optimal solution with linear convergence rate. Simulation experiments on an optimal placement problem is carried out to verify the correctness of the theoretical results.
One of the problems during a great disaster is the breakdown of communication infra structure. One of the solutions is the use of mobile ad-hoc networks (MANET). In this paper, we consider the situation in a building after a big fire, explosion or earthquake. Rescue workers equipped with PDAs, which are wireless connected, explore the dynamically changing world. Each individual builds up a local world map based on their local exploration and observation. The local maps are fused via the MANET structure and provide an up to date map of the dynamically changing world. Such maps can be used for mitigation, escape or rescue work.
In this paper, we investigate multi-agent consensus problem with discrete-time linear dynamics under directed interaction topology. By assumption that all agents can only access the measured outputs of its neighbor agents and itself, a kind of distributed reduced-order observer-based protocols are proposed to solve the consensus problem. A multi-step algorithm is provided to construct the gain matrices involved in the protocols. By using of graph theory, modified discrete-time algebraic Riccati equation and Lyapunov method, the proposed protocols can be proved to solve the discrete-time consensus problem. Furthermore, the proposed protocol is generalized to solve the model-reference consensus problem. Finally, a simulation example is given to illustrate the effectiveness of our obtained results.
Optimization of sensors position is a challenging problem in wireless sensor networks since the processing process significantly affects energy consumption, surveillance ability and network lifetime. Vectorbased algorithm (VEC) and Voronoi-based algorithm (VOR) are two existing approaches. However, VEC is sensitive to initial deployment, while VOR always moves to the coverage holes. Moreover, the nodes in a network may oscillate for a long time before they reach the equilibrium state. This paper presents an initially central deployment model that is cost effective and easy to implement. In this model, we present a new distributed deployment algorithm based on boundary expansion and virtual force (BEVF). The proposed scheme enables nodes to move to the boundary rapidly and ultimately reach equilibrium quickly. For a node, only the location of its nearby nodes and boundary information are needed in the algorithm, thereby avoiding communication cost for transmitting global information. The distance threshold is adopted to limit node movement and to avoid node oscillations. Finally, we compare BEVF with existing algorithms Results show that the proposed algorithm achieves a much larger coverage and consumes lower energy.
This paper is concerned with solving the distributed resource allocation optimization problem by multi-agent systems over undirected graphs. The optimization objective function is a sum of local cost functions associated to individual agents, and the optimization variable satisfies a global network resource constraint. The local cost function and the network resource are the private data for each agent, which are not shared with others. A novel gradient-based continuous-time algorithm is proposed to solve the distributed optimization problem. We take an event-triggered communication strategy and an event-triggered gradient measurement strategy into account in the algorithm. With strongly convex cost functions and locally Lipschitz gradients, we show that the agents can find the optimal solution by the proposed algorithm with exponential convergence rate, based on the construction of a suitable Lyapunov function. Finally, a numerical example is provided to demonstrate the effectiveness of the proposed scheme.
As embedded microprocessors are applied widerly to multi-agent systems, control scheduling and time-delay problems arose in the case of limited energy and computational ability. It has been shown that the event-triggered actuation strategy is an effective methodology for designing distributed control of multi-agent systems with limited computational resources. In this paper, a tracking control problem of leader-follower multi-agent systems with/without communication delays is formulated and a distributed dynamic tracking control is designed by employing event-triggered technique. Then, the input-to-state stability of the closed-loop multi-agent system with directed interconnections is analyzed. Finally, a numerical example is given to validate the proposed control.