Induction, development and regulation of trimolters: Great progress in the domesticated silkworm (Bombyx mori L.)

As the only truly agricultural and great economic domesticated insect, the silkworm is not only value as a model for genetics and rmolecular biology research, but it also has great value for new silk materials. Induction and regulation of trimolter induced by anti-juvenile hormone have shown vast potential to be significant patterns in silkworm research, especially after the further studies on the regulation mechanism of trimolters. This paper reviews the great progress of the induction technique of trimolter silkworms, particularly focusing on its cocoon quality, cocoon filament and the production of advanced silk materials. This review also presents the control technology of fine filament size and the regulatory mechanism of trimolters during the developmental stages.Key words: Silkworm, trimolter, chemical induction, development, filament control, regulatory mechanism

Incremental graph pattern matching

Graph pattern matching has become a routine process in emerging applications such as social networks. In practice a data graph is typically large, and is frequently updated with small changes. It is often prohibitively expensive to recom-pute matches from scratch via batch algorithms when the graph is updated. With this comes the need for incremental algorithms that compute changes to the matches in response to updates, to minimize unnecessary recomputation. This paper investigates incremental algorithms for graph pattern matching defined in terms of graph simulation, bounded sim-ulation and subgraph isomorphism. (1) For simulation, we provide incremental algorithms for unit updates and certain graph patterns. These algorithms are optimal: in linear time in the size of the changes in the input and output, which characterizes the cost that is inherent to the problem itself. For general patterns we show that the incremental match-ing problem is unbounded, i.e., its cost is not determined by the size of the changes alone. (2) For bounded simula-tion, we show that the problem is unbounded even for unit updates and path patterns. (3) For subgraph isomorphism, we show that the problem is intractable and unbounded for unit updates and path patterns. (4) For multiple updates, we develop an incremental algorithm for each of simulation, bounded simulation and subgraph isomorphism. We exper-imentally verify that these incremental algorithms signifi-cantly outperform their batch counterparts in response to small changes, using real-life data and synthetic data. Categories and Subject Descriptors: F.2 [Analysis of algorithms and problem complexity]: Nonnumerical algo-rithms and problems[pattern matching

Incremental graph pattern matching

Graph pattern matching has become a routine process in emerging applications such as social networks. In practice a data graph is typically large, and is frequently updated with small changes. It is often prohibitively expensive to recom-pute matches from scratch via batch algorithms when the graph is updated. With this comes the need for incremental algorithms that compute changes to the matches in response to updates, to minimize unnecessary recomputation. This paper investigates incremental algorithms for graph pattern matching defined in terms of graph simulation, bounded sim-ulation and subgraph isomorphism. (1) For simulation, we provide incremental algorithms for unit updates and certain graph patterns. These algorithms are optimal: in linear time in the size of the changes in the input and output, which characterizes the cost that is inherent to the problem itself. For general patterns we show that the incremental match-ing problem is unbounded, i.e., its cost is not determined by the size of the changes alone. (2) For bounded simula-tion, we show that the problem is unbounded even for unit updates and path patterns. (3) For subgraph isomorphism, we show that the problem is intractable and unbounded for unit updates and path patterns. (4) For multiple updates, we develop an incremental algorithm for each of simulation, bounded simulation and subgraph isomorphism. We exper-imentally verify that these incremental algorithms signifi-cantly outperform their batch counterparts in response to small changes, using real-life data and synthetic data. Categories and Subject Descriptors: F.2 [Analysis of algorithms and problem complexity]: Nonnumerical algo-rithms and problems[pattern matching

A review on modelling methods, tools and service of integrated energy systems in China

An integrated energy system (IES) is responsible for aggregating various energy carriers, such as electricity, gas, heating, and cooling, with a focus on integrating these components to provide an efficient, low-carbon, and reliable energy supply. This paper aims to review the modeling methods, tools, and service modes of IES in China to evaluate opportunities for improving current practices. The models reviewed in this paper are classified as demand forecasting or energy system optimization models based on their modeling progress. Additionally, the main components involved in the IES modeling process are presented, and typical domestic tools utilized in the modeling processes are discussed. Finally, based on a review of several demonstration projects of IES, future development directions of IES are summarized as the integration of data-driven and engineering models, improvements in policies and mechanisms, the establishment of regional energy management centers, and the promotion of new energy equipment

A Magnetic Bead-Integrated Chip for the Large Scale Manufacture of Normalized esiRNAs

The chemically-synthesized siRNA duplex has become a powerful and widely used tool for RNAi loss-of-function studies, but suffers from a high off-target effect problem. Recently, endoribonulease-prepared siRNA (esiRNA) has been shown to be an attractive alternative due to its lower off-target effect and cost effectiveness. However, the current manufacturing method for esiRNA is complicated, mainly in regards to purification and normalization on a large-scale level. In this study, we present a magnetic bead-integrated chip that can immobilize amplification or transcription products on beads and accomplish transcription, digestion, normalization and purification in a robust and convenient manner. This chip is equipped to manufacture ready-to-use esiRNAs on a large-scale level. Silencing specificity and efficiency of these esiRNAs were validated at the transcriptional, translational and functional levels. Manufacture of several normalized esiRNAs in a single well, including those silencing PARP1 and BRCA1, was successfully achieved, and the esiRNAs were subsequently utilized to effectively investigate their synergistic effect on cell viability. A small esiRNA library targeting 68 tyrosine kinase genes was constructed for a loss-of-function study, and four genes were identified in regulating the migration capability of Hela cells. We believe that this approach provides a more robust and cost-effective choice for manufacturing esiRNAs than current approaches, and therefore these heterogeneous RNA strands may have utility in most intensive and extensive applications

Drivers of cropland abandonment in mountainous areas: A household decision model on farming scale and a case study of Southwest China

Cropland abandonment has emerged as a prevalent phenomenon in the mountainous areas of China.While there is a general understanding that this new trend is driven by the rising opportunity cost of rural labor, rigorous theoretical and empirical analyses are largely absent. This paper first develops a theoretical model to investigate household decisions on farming scale when off-farm labor market is accessible and there is heterogeneity of farmland productivity and distribution. The model is capable of explaining the hidden reasons of cropland abandonment in sloping and agriculturally less-favored locations. The model also unveils the impacts of heterogeneity of household labor on fallow decisions and the efficiency loss due to an imperfect labor market. The model is empirically tested by applying the Probit and Logit estimators to a unique household and land-plot survey dataset which contains 5258 plots of599 rural households in Chongqing, a provincial level municipality, in Southwest China. The survey shows that more than 30% of the sample plots have been abandoned, mainly since 1992. The econometric results are consistent with our theoretical expectations. This work would help policy-makers and stakeholders to identify areas with a high probability of land abandonment and farming practice which is less sustainable in the mountainous areas

Minimally invasive stereotactic puncture and thrombolysis therapy improves long-term outcome after acute intracerebral hemorrhage

The purpose of this study was to judge the clinical value of minimally invasive stereotactic puncture and thrombolysis therapy (MISPTT) for acute intracerebral hemorrhage (ICH). A randomized control clinical trial was undertaken. According to the enrollment criteria, 122 acute ICH cases were analyzed, of which 64 cases received MISPTT (MISPTT group, MG) and 58 cases received conventional craniotomy (CC group, CG). The Glasgow coma scale (GCS) scores, postoperative complications (PC), and rebleeding incidences were compared. Moreover, 1 year postoperation, the long-term outcomes of patients with regard to hematoma volume (HV) <50 mL and HV ≥50 mL were judged, respectively, by the Glasgow outcome scale (GOS), Barthel index (BI), modified Rankin Scale (mRS), and case fatality (CF). MG patients showed obvious amelioration in GCS score compared with that of CG patients. The total incidence of PC in MG decreased compared with that of CG. The incidences of rebleeding in MG and CG were 9.4 and 17.2%, respectively (P = 0.243). There were no obvious differences between the CFs of MG and CG (17.2 and 25.9%, respectively, P = 0.199). The GOS, BI, and mRS representing long-term outcome for both HV <50 mL and HV ≥50 mL in MG were ameliorated significantly greater than that in CG patients (all P < 0.05). These data suggest that there are advantages with MISPTT not only in trauma and safety, but the MISPTT group had fewer complications and a trend toward improved short-term and long-term outcomes

Discovering Cooperative Relationships of Chromatin Modifications in Human T Cells Based on a Proposed Closeness Measure

BACKGROUND: Eukaryotic transcription is accompanied by combinatorial chromatin modifications that serve as functional epigenetic markers. Composition of chromatin modifications specifies histone codes that regulate the associated gene. Discovering novel chromatin regulatory relationships are of general interest. METHODOLOGY/PRINCIPAL FINDINGS: Based on the premise that the interaction of chromatin modifications is hypothesized to influence CpG methylation, we present a closeness measure to characterize the regulatory interactions of epigenomic features. The closeness measure is applied to genome-wide CpG methylation and histone modification datasets in human CD4+T cells to select a subset of potential features. To uncover epigenomic and genomic patterns, CpG loci are clustered into nine modules associated with distinct chromatin and genomic signatures based on terms of biological function. We then performed Bayesian network inference to uncover inherent regulatory relationships from the feature selected closeness measure profile and all nine module-specific profiles respectively. The global and module-specific network exhibits topological proximity and modularity. We found that the regulatory patterns of chromatin modifications differ significantly across modules and that distinct patterns are related to specific transcriptional levels and biological function. DNA methylation and genomic features are found to have little regulatory function. The regulatory relationships were partly validated by literature reviews. We also used partial correlation analysis in other cells to verify novel regulatory relationships. CONCLUSIONS/SIGNIFICANCE: The interactions among chromatin modifications and genomic elements characterized by a closeness measure help elucidate cooperative patterns of chromatin modification in transcriptional regulation and help decipher complex histone codes