Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 75 )

2018 ( 709 )

2017 ( 645 )

2016 ( 554 )

Custom range...

Search Results: 1 - 10 of 42250 matches for " Xin He "
All listed articles are free for downloading (OA Articles)
Page 1 /42250
Display every page Item
On W_2 lifting of Frobenius of Algebraic Surfaces
He Xin
Mathematics , 2013,
Abstract: We completely decide which minimal algebraic surfaces in positive characteristics allow a lifting of their Frobenius over the trucated witt rings of lengh 2.
Frobenius splitting of projective toric bundles
He Xin
Mathematics , 2014,
Abstract: We give several mild conditions on a toric bundle on a nonsingular toric variety under which the projectivization of the toric bundle is Frobenius split.
Conditioning Galton-Watson trees on large maximal out-degree
Xin He
Mathematics , 2014,
Abstract: We propose a new way to condition random trees, that is, condition random trees to have large maximal out-degree. Under this new conditioning, we show that conditioned critical Galton-Watson trees converge locally to size-biased trees with a unique infinite spine. For the sub-critical case, we obtain local convergence to size-biased trees with a unique infinite node. We also study tail of the maximal out-degree of sub-critical Galton-Watson trees, which is essential for the proof of the local convergence.
Local convergence of critical random trees and continuous-state branching processes
Xin He
Mathematics , 2015,
Abstract: We study the local convergence of critical Galton-Watson trees and Levy trees under various conditionings. Assuming a very general monotonicity property on the functional of random trees, we show that random trees conditioned to have large functional values always converge locally to immortal trees. We also derive a very general ratio limit property for functionals of random trees satisfying the monotonicity property. Then we move on to study the local convergence of critical continuous-state branching processes, and prove a similar result. Finally we give a definition of continuum condensation trees, which should be the correct local limits for certain subcritical Levy trees under suitable conditionings.
A note on the maximal out-degree of Galton-Watson trees
Xin He
Mathematics , 2015,
Abstract: In this note we consider both the local maximal out-degree and the global maximal out-degree of Galton-Watson trees. In particular, we show that the tail of any local maximal out-degree and that of the offspring distribution are asymptotically of the same order. However for the global maximal out-degree, this is only true in the subcritical case.
Lebesgue approximation of $(2,β)$-superprocesses
Xin He
Mathematics , 2012,
Abstract: Let $\xi=(\xi_t)$ be a locally finite $(2,\beta)$-superprocess in $\RR^d$ with $\beta<1$ and $d>2/\beta$. Then for any fixed $t>0$, the random measure $\xi_t$ can be a.s. approximated by suitably normalized restrictions of Lebesgue measure to the $\varepsilon$-neighborhoods of ${\rm supp}\,\xi_t$. This extends the Lebesgue approximation of Dawson-Watanabe superprocesses. Our proof is based on a truncation of $(\alpha,\beta)$-superprocesses and uses bounds and asymptotics of hitting probabilities.
MORPH: Probabilistic Alignment Combined with Hidden Markov Models of cis-Regulatory Modules
Saurabh Sinha ,Xin He
PLOS Computational Biology , 2007, DOI: 10.1371/journal.pcbi.0030216
Abstract: The discovery and analysis of cis-regulatory modules (CRMs) in metazoan genomes is crucial for understanding the transcriptional control of development and many other biological processes. Cross-species sequence comparison holds much promise for improving computational prediction of CRMs, for elucidating their binding site composition, and for understanding how they evolve. Current methods for analyzing orthologous CRMs from multiple species rely upon sequence alignments produced by off-the-shelf alignment algorithms, which do not exploit the presence of binding sites in the sequences. We present here a unified probabilistic framework, called MORPH, that integrates the alignment task with binding site predictions, allowing more robust CRM analysis in two species. The framework sums over all possible alignments of two sequences, thus accounting for alignment ambiguities in a natural way. We perform extensive tests on orthologous CRMs from two moderately diverged species Drosophila melanogaster and D. mojavensis, to demonstrate the advantages of the new approach. We show that it can overcome certain computational artifacts of traditional alignment tools and provide a different, likely more accurate, picture of cis-regulatory evolution than that obtained from existing methods. The burgeoning field of cis-regulatory evolution, which is amply supported by the availability of many related genomes, is currently thwarted by the lack of accurate alignments of regulatory regions. Our work will fill in this void and enable more reliable analysis of CRM evolution.
The Impact of Stochastic Lead Time: the Mean or the Variance
Xin James He
Lecture Notes in Engineering and Computer Science , 2009,
Changes of SOD, GSH and MDA in renal tissues of diabetic hyperlipidemia rats
CAO He-Xin
Zhong Xi Yi Jie He Xue Bao , 2004,
Abstract: Objective: To study the changes of SOD, GSH and MDA in the renal tissues of diabetes rat models through the comparison of their metabolic features. Methods: Two types of diabetes rat models were established by feeding high-lipid food along with small dose injecting of streptozotocin (STZ) (model group 1) and repeated small dose injecting of STZ with complete Freund's adjuvant (CFA) (model group 2). And changes of the following were observed: body weight, urine volume, blood sugar, blood lipid, serum insulin, insulin sensitive index (ISI), superoxide dismutase (SOD), glutathione (GSH) and malondialdehyde (MDA) of the renal tissues. Results: The body weight of the two model groups of rats decreased, while the urine volume and the blood sugar increased predominantly. These indexes of the two model groups were significantly different from those of the normal group (P<0.05). The renal tissue MDA level increased while the SOD and GSH level decreased in both model group 1 and model group 2, but the changes in model group 1 were more obvious than those in the model group 2. The serum insulin level which decreased in model group 2 did not decrease significantly in model group 1, but the ISI in model group 1 decreased more significantly than that in model group 2 (P<0.05). Conclusion: The antioxidase activity decreased in renal tissues of diabetes rats and hyperlipidemia was the main cause of the corresponding oxidations.
The Localized Area Coverage algorithm Based on Game-Theory for WSN
Xin He,Xiaolin Gui
Journal of Networks , 2009, DOI: 10.4304/jnw.4.10.1001-1008
Abstract: The Coverage Control Technology is one of the basic technologies of wireless sensor network, and is mainly concerned about how to prolong the network lifetime on the basis of meeting users’ perception demand. Among this, in the study of area coverage, the set K-cover algorithm is broadly accepted because that it can prolong network lifetime rather well. However, the existing set K-cover algorithms are centralized, and can not adapt to the large-scale sensor network applications and expansion. Game theory is a kind of decision theory, which is concerned with the situation where players directly interact with each other and can from the angle of participant’s rational favor look for root of influence on macro-construction. It is very suitable for characteristic of node in wireless sensor network, which is only to know its own and neighbors’ local state information and according to local information to implement behavior decision, making it convenient to realize distribution algorithm. In the previous work, the maximum coverage set calculated algorithm is proposed by us. So, this paper utilizes the number of maximum coverage set as the upper limit of coverage node set division. On the basis of this maximum, it takes number of minimum layer overlapping subfields, which satisfy division condition, as node’s utility function. Thus, this paper uses game theory model realizes maximization of network lifetime at the same time of ensuring area overall coverage.
Page 1 /42250
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.