2,470 research outputs found

    Dimethyl 2,6-dimethyl-1,4-dihydro­pyridine-3,5-dicarboxyl­ate

    Get PDF
    In the crystal of the title compound, C11H15NO4, the mol­ecules are linked into sheets by N—H⋯O and C—H⋯O hydrogen bonds. Within the mol­ecule, the 1,4-dihydro­pyridine ring exhibits a distinctive planar conformation [r.m.s. deviation from the mean plane of 0.009 (3)Å], and the other non-H atoms are almost coplanar [r.m.s. deviation = 0.021 (3) Å] with the 1,4-dihydro­pyridine ring. The conformation of the latter is governed mainly by two intra­molecular C—H⋯O non-classical inter­actions

    Impact of Opinions and Relationships Coevolving on Self-Organization of Opinion Clusters

    Get PDF
    In a social network, individual opinions and interpersonal relationships always interact and coevolve. This continuously leads to self-organization of opinion clusters in the whole network. In this article we study how the coevolution on the two kinds of complex networks and the self-organization of opinion clusters are differently affected by the dynamic parameters, the structural parameters and the propagating parameters. It is found that the two dynamic parameters are homogeneous bringing about the strong and weak relations, while the two structural parameters are heterogeneous having equivalent relations. Moreover, the impact of the propagating parameter has been found only above its threshold

    catena-Poly[[[tetra­aqua­cobalt(II)]-μ-4,4′-bipyridine-κ2 N:N′] pyridine-3,5-dicarboxyl­ate trihydrate]

    Get PDF
    The crystal structure of the title compound, {[Co(C10H8N2)(H2O)4](C7H3NO4)·3H2O}n, consists of CoII polymeric complex cations, uncoordinated pyridine-3,5-dicarboxyl­ate anions and lattice water mol­ecules. The CoII cation is coordinated by two N atoms from two 4,4′-bipyridine ligands and four water mol­ecules in a distorted octa­hedral geometry. The 4,4′-bipyridine ligands bridge Co cations, forming a polymeric chain running along the b axis. The two pyridine rings of the 4,4′-biyridine are twisted to each other by a dihedral angle of 8.95 (9)°. Extensive O—H⋯O hydrogen bonding network is present in the crystal structure

    Study of the cytological features of bone marrow mesenchymal stem cells from patients with neuromyelitis optica.

    Get PDF
    Neuromyelitis optica (NMO) is a refractory autoimmune inflammatory disease of the central nervous system without an effective cure. Autologous bone marrow‑derived mesenchymal stem cells (BM‑MSCs) are considered to be promising therapeutic agents for this disease due to their potential regenerative, immune regulatory and neurotrophic effects. However, little is known about the cytological features of BM‑MSCs from patients with NMO, which may influence any therapeutic effects. The present study aimed to compare the proliferation, differentiation and senescence of BM‑MSCs from patients with NMO with that of age‑ and sex‑matched healthy subjects. It was revealed that there were no significant differences in terms of cell morphology or differentiation capacities in the BM‑MSCs from the patients with NMO. However, in comparison with healthy controls, BM‑MSCs derived from the Patients with NMO exhibited a decreased proliferation rate, in addition to a decreased expression of several cell cycle‑promoting and proliferation‑associated genes. Furthermore, the cell death rate increased in BM‑MSCs from patients under normal culture conditions and an assessment of the gene expression profile further confirmed that the BM‑MSCs from patients with NMO were more vulnerable to senescence. Platelet‑derived growth factor (PDGF), as a major mitotic stimulatory factor for MSCs and a potent therapeutic cytokine in demyelinating disease, was able to overcome the decreased proliferation rate and increased senescence defects in BM‑MSCs from the patients with NMO. Taken together, the results from the present study have enabled the proposition of the possibility of combining the application of autologous BM‑MSCs and PDGF for refractory and severe patients with NMO in order to elicit improved therapeutic effects, or, at the least, to include PDGF as a necessary and standard growth factor in the current in vitro formula for the culture of NMO patient‑derived BM‑MSCs

    Towards verification of computation orchestration

    Get PDF
    Recently, a promising programming model called Orc has been proposed to support a structured way of orchestrating distributed Web Services. Orc is intuitive because it offers concise constructors to manage concurrent communication, time-outs, priorities, failure of Web Services or communication and so forth. The semantics of Orc is precisely defined. However, there is no automatic verification tool available to verify critical properties against Orc programs. Our goal is to verify the orchestration programs (written in Orc language) which invoke web services to achieve certain goals. To investigate this problem and build useful tools, we explore in two directions. Firstly, we define a Timed Automata semantics for the Orc language, which we prove is semantically equivalent to the operational semantics of Orc. Consequently, Timed Automata models are systematically constructed from Orc programs. The practical implication is that existing tool supports for Timed Automata, e.g., Uppaal, can be used to simulate and model check Orc programs. An experimental tool has been implemented to automate this approach. Secondly, we start with encoding the operational semantics of Orc language in Constraint Logic Programming (CLP), which allows a systematic translation from Orc to CLP. Powerful constraint solvers like CLP(R) are then used to prove traditional safety properties and beyond, e.g., reachability, deadlock-freeness, lower or upper bound of a time interval, etc. Counterexamples are generated when properties are not satisfied. Furthermore, the stepwise execution traces can be automatically generated as the simulation steps. The two different approaches give an insight into the verification problem of Web Service orchestration. The Timed Automata approach has its merits in visualized simulation and efficient verification supported by the well developed tools. On the other hand, the CPL approach gives better expressiveness in both modeling and verification. The two approaches complement each other, which gives a complete solution for the simulation and verification of Computation Orchestration

    A modular network model of aging

    Get PDF
    Many fundamental questions on aging are still unanswered or are under intense debate. These questions are frequently not addressable by examining a single gene or a single pathway, but can best be addressed at the systems level. Here we examined the modular structure of the protein–protein interaction (PPI) networks during fruitfly and human brain aging. In both networks, there are two modules associated with the cellular proliferation to differentiation temporal switch that display opposite aging-related changes in expression. During fly aging, another couple of modules are associated with the oxidative–reductive metabolic temporal switch. These network modules and their relationships demonstrate (1) that aging is largely associated with a small number, instead of many network modules, (2) that some modular changes might be reversible and (3) that genes connecting different modules through PPIs are more likely to affect aging/longevity, a conclusion that is experimentally validated by Caenorhabditis elegans lifespan analysis. Network simulations further suggest that aging might preferentially attack key regulatory nodes that are important for the network stability, implicating a potential molecular basis for the stochastic nature of aging

    Specifying and verifying sensor networks: An experiment of formal methods

    Get PDF
    10.1007/978-3-540-88194-0-20Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)5256 LNCS318-33
    corecore