Inferring Genome Ancestry and Estimating Molecular Relatedness Among 187 Chinese Maize Inbred Lines

The inference of genome ancestry and the estimation of molecular relatedness are of great importance for breeding efficiency and association studies. Seventy SSR loci, evenly distributed in 10 chromosomes, were assayed for polymorphism among 187 commonly used maize （Zea mays L.） inbreds which represent the genetic diversity in China. The identified 290 alleles served as raw data for estimating population structure using the coalescent linked loci, based on the ADMIXTURE model. Population number, K, has been inferred to be between five and seven. Specifying five subpopulations （K = 5） led to a distinct decrease and specifying K to be greater than six resulted in only minimal increases in the likelihood value. Therefore, population number, K, has been inferred into six subpopulations, which are PA, BSSS （includes Reid）, PB, Lan （Lancaster Sure Crop）, LRC （Luda Reb Cob, a Chinese landrace, and its derivatives）, and SPT （Si-ping-tou, a Chinese landrace and its derivatives）. The Kullback-Leibler distance of pairwise subpopulation was also inferred as n × p （187 ×6） Q matrices, which gave a detailed percentage of genetic composition of six subpopulations and molecular relatedness of each line. The genome-wide linkage disequilibrium （LD） indicated that the asso- ciation studies in QTLs and/or candidate genes might avoid nonfunctional and spurious associations, as most of the LD blocks were broken among diverse germplasm. The defined population structure has given us a clear genetic structure of these lines for breeding practice and established a good basis for association analysis.

Some Notes of Property of Distribution Function of Many Variables

In this paper we discuss a step further some convergence and continuity problems of distribution function on R^i. We give the following results: (1)distribution function F(x_1,…,x_k) on R^k is continuous if and only if all marginal distribution functions of F is continuous on R^1. (2)If limF_n(x_1,……,x_k)=F(x_1,…,x_k) and limF_n(x_1—0,…,x_k—0)=F(x_1—0,…,x_k—0) at all non-continuity points of F, then

SOME RESULTSON R_2-EDGE-CONNECTIVITY OF EVEN REGULAR GRAPHS

Let Gbe a connected k(≥3)-regulargraph w ith girth g. A setSofthe edgesin G is called an R2-edge-cutifG- Sis disconnected and contains neither an isolated vertex nor a one- degree vertex. The R2-edge-connectivity of G, denoted by λ″(G), is the m inim um cardinality over allR2-edge-cuts, w hich is an im portantm easure for fault-tolerance of com puter intercon- nection netw orks. In this paper, λ″(G)= g(2k- 2) for any 2k-regular connected graph G(≠ K5) that is either edge-transitive or vertex-transitive and g≥5 is given.

Comparative analysis of online monitoring methods for transformer insulation performance of 330-750kV substation

The online-monitoring methods for insulation performance of current transformers of 330-750 kV substation are analyzed and compared.The effectiveness and availability of each method are discussed.Main features,advantages and disadvantages of each method and its corresponding standard are also described.

On the Decay Number of a Graph

The decay number of a connected graph is defined to be the minimum number of the components of the cotree of the graph. Upper bounds of the decay numbers of graphs are obtained according to their edge connectivities. All the bounds in this paper are tight.Moreover, for each integer k between one and the upper bound, there are infinitely many graphs with the decay number k.

Continuous Multipartite Entangled Representation and Its Wigner Operator and Marginal Distribution

By extending the EPR bipartite entanglement to multipartite case, we briefly introduce a continuous multipartite entangled representation and its canonical conjugate state in the multi-mode Fock space, analyze their Schmidt decompositions and give their entangling operators. Furthermore, based on the above analysis we also find the n-mode Wigner operator. In doing so we may identify the physical meaning of the marginal distribution of the Wigner function.

A MODIFIED EDGE-ORIENTED SPATIAL INTERPOLATION ALGORITHM FOR CONSECUTIVE BLOCKS ERROR CONCEALMENT

This paper proposes a low-complexity spatial-domain Error Concealment (EC) algorithm for recovering consecutive blocks error in still images or Intra-coded (I) frames of video sequences. The proposed algorithm works with the following steps. Firstly the Sobel operator is performed on the top and bottom adjacent pixels to detect the most likely edge direction of current block area. After that one-Dimensional (1D) matching is used on the available block boundaries. Displacement between edge direction candidate and most likely edge direction is taken into consideration as an important factor to improve stability of 1D boundary matching. Then the corrupted pixels are recovered by linear weighting interpolation along the estimated edge direction. Finally the interpolated values are merged to get last recovered picture. Simulation results demonstrate that the proposed algorithms obtain good subjective quality and higher Peak Signal-to-Noise Ratio (PSNR) than the methods in literatures for most images.

TESTING k-EDGE-CONNECTIVITY OF DIGRAPHS

This paper presents an algorithm that tests whether a given degree-bounded digraph is k-edge-connected or E-far from k-edge-connectivity. This is the first testing algorithm for k-edge- connectivity of digraphs whose running time is independent of the number of vertices and edges. A digraph of n vertices with degree bound d is ε-far from k-edge-connectivity if at least εdn edges have to be added or deleted to make the digraph k-edge-connected, preserving the degree bound. Given a constant error parameter ε and a degree bound d, our algorithm always accepts all k-edge-connected digraphs and reiects all digraphs that is ε-far from k-edge-connectivity with orobabilitv at least 2/3.It runs in O（d（εd^-c）^k logεd^-1O）（c〉1 is a constant）time when input digraphs are restricted to be （k-1）-edge connected and runs in O（d（εd^-ck）^klogεd^-kO）（c〉1 is a constant）time for general digraphs.

On restricted edge-connectivity of replacement product graphs

This paper considers the edge-connectivity and the restricted edge-connectivity of replacement product graphs, gives some bounds on edge-connectivity and restricted edge-connectivity of replacement product graphs and determines the exact values for some special graphs. In particular, the authors further confirm that under certain conditions, the replacement product of two Cayley graphs is also a Cayley graph, and give a necessary and sufficient condition for such Cayley graphs to have maximum restricted edge-connectivity. Based on these results, we construct a Cayley graph with degree d whose restricted edge-connectivity is equal to d + s for given odd integer d and integer s with d 5 and 1 s d- 3, which answers a problem proposed ten years ago.

Weighted Scaling in Non-growth Random Networks

We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in nongrowth random networks. In this model, we use multiple-edges to represent the connections between vertices and define the weight of a multiple-edge as the total weights of all single-edges within it and the strength of a vertex as the sum of weights for those multiple-edges attached to it. The network evolves according to a vertex strength preferential selection mechanism. During the evolution process, the network always holds its totM number of vertices and its total number of single-edges constantly. We show analytically and numerically that a network will form steady scale-free distributions with our model. The results show that a weighted non-growth random network can evolve into scMe-free state. It is interesting that the network also obtains the character of an exponential edge weight distribution. Namely, coexistence of scale-free distribution and exponential distribution emerges.

Mott insulator-superfluid phase transition in a detuned multi-connected Jaynes-Cummings lattice

The connectivity and tunability of superconducting quantum devices provide a rich platform to build quantum simulators and study novel many-body physics. Here we study quantum phase transition in a detuned multi-connected Jaynes-Cummings lattice, which can be constructed with superconducting circuits. This model is composed of alternatively connected qubits and cavity modes.Using a numerical method, we show that by varying the detuning between the qubits and the cavities, a phase transition from the superfluid phase to the Mott insulator phase occurs at commensurate fillings in a one-dimensional array. We study the phase transition in lattices with symmetric and asymmetric couplings, respectively.

Magnetically Controlled Electronic Transport Properties of a Ferromagnetic Junction on the Surface of a Topological Insulator

We have investigated the transport properties of the Dirac fermions through a ferromagnetic barrier junction on the surface of a strong topologicM insulator. The current-voltage characteristic curve and the tunneling conductance are calculated theoretically. Two interesting transport features are predicted： observable negative differential conductances and linear conductances tunable from unit to nearly zero. These features can be magnetically manipulated simply by changing the spacial orientation of the magnetization. Our results may contribute to the development of high-speed switching and functional applications or electricalIy controlled magnetization switching.

Cross-national Buddhism and Identity Construction in Ch＇oe Ch＇iwon＇s ＂Four Mountains Stele＂

This paper aims to evaluate how Chart Buddhism played a part in Buddhist discourses reflecting an increased sense of legitimacy in ninth-century East Asia. It may not surprise us that the sinicisation of Buddhism implies a process of identity construction to place China in the centre. Culture and religion joined together in this process, first in China and then in Korea. However, the location of centrality or marginality was not fixed in Buddhist ontology. Rather, innovative Buddhist intellects such as Ch＇oe Ch＇iwon （b. 857 A.D.） ventured to create a reversal of centre and margin. In Ch＇oe Ch＇iwon＇s inscriptions for four Korean Son schools （the total of nine schools are also known as nine mountains）, an attempt to supersede China through Chan Buddhism is conspicuous. It is particularly inter- esting to note that, in the context of the cross-border transmission of Buddhism, the mobility of ＂Chan patriarchs＂ was essential in maintaining the legitimacy and continuity. This characteristic of the mobility of Chan patriarchs is seen in the Korean masters depicted by Ch＇oe Ch＇iwon＇s, namely Chingam, Ranghye and Chijong.