oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2020 ( 17 )

2019 ( 89 )

2018 ( 565 )

2017 ( 549 )

Custom range...

Search Results: 1 - 10 of 40402 matches for " Hai Sun "
All listed articles are free for downloading (OA Articles)
Page 1 /40402
Display every page Item
AS-Level Internet Macroscopic Topology Centralization Evolvement Analysis  [PDF]
Jie Song, Hai Zhao, Bo Yang, Huali Sun
Journal of Software Engineering and Applications (JSEA) , 2010, DOI: 10.4236/jsea.2010.310106
Abstract: The As-level topology is a hotspot of the recent reseaches. We can understand the centralization of the network clearly by researching the evolvement trend of the Internet macroscopic topology. The massive data we use in this paper is from CAIDA (The Cooperative Association for Internet Data Analysis) Skitter project. And the time span of the data is from July, 2001 to January, 2008. This paper introduces the background of the AS-level topology at first, then carries out the evolvement of degree, core and layer. It is believed that the influence of the top-degree nodes on the other nodes decreases and the centralization of network is going to fall off with the decrease of the core. And the nucleus status of network declines.
A Semi-Implicit Scheme of Lattice Boltzmann Method for Two Dimensional Cavity Flow Simulation  [PDF]
Lei Zhang, Jun Yao, Hai Sun, Jianguang Zhang
Open Journal of Fluid Dynamics (OJFD) , 2015, DOI: 10.4236/ojfd.2015.51002
Abstract: The calculation sequence of collision, propagation and macroscopic variables is not very clear in lattice Boltzmann method (LBM) code implementation. According to the definition, three steps should be computed on all nodes respectively, which mean three loops are needed. While the “pull” scheme makes the only one loop possible for coding, this is called semi-implicit scheme in this study. The accuracy and efficiency of semi-implicit scheme are discussed in detail through the simulation of lid-driven cavity flow. Non-equilibrium extrapolation scheme is adopted on the boundary of simulation area. The results are compared with two classic articles, which show that semi-implicit scheme has good agreement with the classic scheme. When Re is less than 3000, the iterations steps of semi-scheme can be decreased by about 30% though comparing the semi-implicit scheme with standard scheme containing three loops. As the Re increases into more than 3400, the standard scheme is not converged. On the contrary, the iterations of semi-implicit scheme are approximately linear to Re.
Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
Hai Leong Chieu,Wee Sun Sun Lee
Computer Science , 2014, DOI: 10.1613/jair.2808
Abstract: The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginals over covers that represent clusters of solutions. The SP-y algorithm generalizes SP to work on the maximum satisfiability (Max-SAT) problem, but the cover interpretation of SP does not generalize to SP-y. In this paper, we formulate the relaxed survey propagation (RSP) algorithm, which extends the SP algorithm to apply to the weighted Max-SAT problem. We show that RSP has an interpretation of estimating marginals over covers violating a set of clauses with minimal weight. This naturally generalizes the cover interpretation of SP. Empirically, we show that RSP outperforms SP-y and other state-of-the-art Max-SAT solvers on random Max-SAT instances. RSP also outperforms state-of-the-art weighted Max-SAT solvers on random weighted Max-SAT instances.
Geometric Analysis of Reachability and Observability for Impulsive Systems on Complex Field
Shouwei Zhao,Jitao Sun,Hai Lin
Journal of Applied Mathematics , 2012, DOI: 10.1155/2012/876120
Abstract: Nowadays, quantum systems have become one of the focuses of the ongoing research and they are typical complex systems, whose state variables are defined on the complex field. In this paper, the issue of reachability and observability is addressed for a class of linear impulsive systems on complex field, for simplicity, complex linear impulsive systems. This kind of time-driven impulsive systems allows free impulsive instants, which leads to the limitation of using traditional definitions of reachability and observability directly. New notations about the span reachable set and unobservable set are proposed. Sufficient and necessary conditions for span reachability and observability of such systems are established. Moreover, the explicit characterization of span reachable set and unobservable set is presented by geometric analysis. It is pointed out that the geometric conditions are equivalent to the algebraic ones in known results for special cases. Numerical examples are also presented to show the effectiveness of the proposed methods.
Genetic Diversity of Wild Soybeans from Some Regions of Southern China Based on SSR and SRAP Markers  [PDF]
Bingrui Sun, Chongyun Fu, Cunyi Yang, Qibin Ma, Dajian Pan, Hai Nian
American Journal of Plant Sciences (AJPS) , 2013, DOI: 10.4236/ajps.2013.42034
Abstract: There are rich annual wild soybean (Glycine soja) resources in Southern China, which are the progenitor of cultivated soybean. To evaluate the genetic diversity and differentiation of G. soja in Southern China, we analyzed allelic profiles of 141 annual wild soybean accessions from Southern China and 8 core wild soybean accessions fromNorthern Chinaby using 41 simple sequence repeat (SSR) markers and 18 Sequence-related amplified polymorphism (SRAP) primer combinations. The 41 SSR markers produced a total of 421 alleles (10.27 per locus) with a mean of gene diversity of 0.825 (Simpson index) and 1.987 (Shannon-weaver index). The 18 SRAP primer combinations detected a total of 90 polymorphism bands (5 per primer combination) with a mean of gene diversity of 0.918 (Shannon-weaver index). SSR and SRAP markers detected 43 and 5 rare alleles in 149 wild soybeans, respectively. The wild soybeans from Fujian province showed the highest genetic diversity with Shannon-weaver index of 1.837 (by SSR) and 0.803 (by SRAP), and the highest allelic richness with an average of 8.8 alleles per locus and the most number of rare alleles of 0.68 per locus based on SSR data. An analysis of Molecular Variance (AMOVA) analysis showed that significant variance did exist amongHunan,Fujian, Guangxi andNorthern Chinasubpopulations based on SSR and SRAP data. The unweighted pair-group method of the arithmetic average (UPGMA) cluster analysis indicated that the wild soybeans fromFujianprovince occurred in different clusters based on both SSR and SRAP data. The above results indicated thatFujianprovince could be the major center of genetic diversity for annual wild soybean inSouthern China. In addition, Mantle test showed there was a weak positive linear correlation (r = 0.25) between SSR and SRAP analysis in the study.
Experimental study of aerosol distribution and concentration variation through curved ducts
Sun Ke,Lu Lin,Jiang Hai
Thermal Science , 2012, DOI: 10.2298/tsci1205437s
Abstract: This paper presents an experimental investigation of an aerosol problem by adopting two methods. One approach utilizes scanning electron microscope to study the realistic aerosol deposition status in a typical duct bend. Through scanning electron microscope images and on-site observation, the aerosols tend to deposit and accumulate more on the outer bend wall and bend outlet wall. The other approach is to design systematic experiments to measure aerosol concentration variation and distribution through 90-degree curved ducts. This experimental method is simple for realistic applications. Measured results show that the average particle volume concentration diverges greatly after flowing through the bend. The loading ability decreases significantly for larger particles at bend outlet under higher Dean number.
Ro 20-1724 Ameliorates Learning Deficit and Long-Term Memory Impairment Secondary to Repeated Ketamine Anesthesia in Young Rats  [PDF]
Sheng Peng, Hai Yan Sun, Gong-Jian Liu, Xia Yang, George Mychaskiw II
Neuroscience & Medicine (NM) , 2013, DOI: 10.4236/nm.2013.43025
Abstract:

To investigate effects and possible mechanism of Ro 20-1724, a PDE4 inhibitor, on long-time learning and memory ability following repeated ketamine exposure in immature rats. Methods: Sixty 21-day-old SD rats were randomly divided into five groups (n = 12): C: Normal control group, S: Saline control group, K: Ketamine, K + Ro: Ketamine + Ro 20-1724, K + E: Ketamine + ethanol vehicle. Ro 20-1724 (0.5 mg·kg-1) or its vehicle (ethanol) was administered intraperitoneally 30 minutes after ketamine anesthesia (70 mg·kg-1), daily for seven days. Nine weeks after birth, the Morris water maze was used to test the ability of learning and spatial localization memory on the

Damped Population Oscillation in a Spontaneously Decaying Two-Level Atom Coupled to a Monochromatic Field
Sun Kyung Lee,Hai-Woong Lee
Physics , 2006, DOI: 10.1103/PhysRevA.74.063817
Abstract: We investigate the time evolution of atomic population in a two-level atom driven by a monochromatic radiation field, taking spontaneous emission into account. The Rabi oscillation exhibits amplitude damping in time caused by spontaneous emission. We show that the semiclassical master equation leads in general to an overestimation of the damping rate and that a correct quantitative description of the damped Rabi oscillation can thus be obtained only with a full quantum mechanical theory.
Decentralized Supervisory Control of Discrete Event Systems for Bisimulation Equivalence
Yajuan Sun,Hai Lin,Ben. M. Chen
Computer Science , 2011,
Abstract: In decentralized systems, branching behaviors naturally arise due to communication, unmodeled dynamics and system abstraction, which can not be adequately captured by the traditional sequencing-based language equivalence. As a finer behavior equivalence than language equivalence, bisimulation not only allows the full set of branching behaviors but also explicitly specifies the properties in terms of temporal logic such as CTL* and mu-calculus. This observation motivates us to consider the decentralized control of discrete event systems (DESs) for bisimulation equivalence in this paper, where the plant and the specification are taken to be nondeterministic and the supervisor is taken to be deterministic. An automata-based control framework is formalized, upon which we develop three architectures with respect to different decision fusion rules for the decentralized bisimilarity control, named a conjunctive architecture, a disjunctive architecture and a general architecture. Under theses three architectures, necessary and sufficient conditions for the existence of decentralized bisimilarity supervisors are derived respectively, which extend the traditional results of supervisory control from language equivalence to bisimulation equivalence. It is shown that these conditions can be verified with exponential complexity. Furthermore, the synthesis of bisimilarity supervisors is presented when the existence condition holds.
Computation for Supremal Simulation-Based Controllable and Strong Observable Subautomata
Yajuan Sun,Hai Lin,Fuchun Liu
Computer Science , 2011,
Abstract: Bisimulation relation has been successfully applied to computer science and control theory. In our previous work, simulation-based controllability and simulation-based observability are proposed, under which the existence of bisimilarity supervisor is guaranteed. However, a given specification automaton may not satisfy these conditions, and a natural question is how to compute a maximum permissive subspecification. This paper aims to answer this question and investigate the computation of the supremal simulation-based controllable and strong observable subautomata with respect to given specifications by the lattice theory. In order to achieve the supremal solution, three monotone operators, namely simulation operator, controllable operator and strong observable operator, are proposed upon the established complete lattice. Then, inequalities based on these operators are formulated, whose solution is the simulation-based controllable and strong observable set. In particular, a su?cient condition is presented to guarantee the existence of the supremal simulation-based controllable and strong observable subautomata. Furthermore, an algorithm is proposed to compute such subautomata.
Page 1 /40402
Display every page Item


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