Effect of weak randomness flaws on security evaluation of practical quantum key distribution with distinguishable decoy states

Quantum key distribution provides an unconditional secure key sharing method in theory,but the imperfect factors of practical devices will bring security vulnerabilities.In this paper,we characterize the imperfections of the sender and analyze the possible attack strategies of Eve.Firstly,we present a quantized model for distinguishability of decoy states caused by intensity modulation.Besides,considering that Eve may control the preparation of states through hidden variables,we evaluate the security of preparation in practical quantum key distribution(QKD)scheme based on the weak-randomness model.Finally,we analyze the influence of the distinguishability of decoy state to secure key rate,for Eve may conduct the beam splitting attack and control the channel attenuation of different parts.Through the simulation,it can be seen that the secure key rate is sensitive to the distinguishability of decoy state and weak randomness,especially when Eve can control the channel attenuation.

Vertex-distinguishing IE-total Colorings of Cycles and Wheels

Let G be a simple graph. An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C（u） be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring f of G using k colors, if C（u）=C（v） for any two different vertices u and v of V （G）, then f is called a k-vertex-distinguishing IE-total-coloring of G, or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χievt（G）, and is called the VDIET chromatic number of G. We get the VDIET chromatic numbers of cycles and wheels, and propose related conjectures in this paper.

Vertex-distinguishing E-total Coloring of Complete Bipartite Graph K 7,n when7≤n≤95

Let G be a simple graph. A total coloring f of G is called an E-total coloring if no two adjacent vertices of G receive the same color, and no edge of G receives the same color as one of its endpoints. For an E-total coloring f of a graph G and any vertex x of G, let C（x） denote the set of colors of vertex x and of the edges incident with x, we call C（x） the color set of x. If C（u） ≠ C（v） for any two different vertices u and v of V （G）, then we say that f is a vertex-distinguishing E-total coloring of G or a VDET coloring of G for short. The minimum number of colors required for a VDET coloring of G is denoted by Хvt^e（G） and is called the VDE T chromatic number of G. The VDET coloring of complete bipartite graph K7,n （7 ≤ n ≤ 95） is discussed in this paper and the VDET chromatic number of K7,n （7 ≤ n ≤ 95） has been obtained.

Adjacent Vertex-distinguishing E-total Coloring on Some Join Graphs Cm ∨ Gn

Let G(V, E) be a simple connected graph and k be positive integers. A mapping f from V∪E to {1, 2, ··· , k} is called an adjacent vertex-distinguishing E-total coloring of G(abbreviated to k-AVDETC), if for uv ∈ E(G), we have f(u) ≠ f(v), f(u) ≠ f(uv), f(v) ≠ f(uv), C(u) ≠C(v), where C(u) = {f(u)}∪{f(uv)|uv ∈ E(G)}. The least number of k colors required for which G admits a k-coloring is called the adjacent vertex-distinguishing E-total chromatic number of G is denoted by x^e_(at) (G). In this paper, the adjacent vertexdistinguishing E-total colorings of some join graphs C_m∨G_n are obtained, where G_n is one of a star S_n , a fan F_n , a wheel W_n and a complete graph K_n . As a consequence, the adjacent vertex-distinguishing E-total chromatic numbers of C_m∨G_n are confirmed.

Vertex-distinguishing VE-total Colorings of Cycles and Complete Graphs

Let G be a simple graph of order at least 2.A VE-total-coloring using k colors of a graph G is a mapping f from V (G) E(G) into {1,2,···,k} such that no edge receives the same color as one of its endpoints.Let C(u)={f(u)} {f(uv) | uv ∈ E(G)} be the color-set of u.If C(u)=C(v) for any two vertices u and v of V (G),then f is called a k-vertex-distinguishing VE-total coloring of G or a k-VDVET coloring of G for short.The minimum number of colors required for a VDVET coloring of G is denoted by χ ve vt (G) and it is called the VDVET chromatic number of G.In this paper we get cycle C n,path P n and complete graph K n of their VDVET chromatic numbers and propose a related conjecture.

Vertex-distinguishing IE-total Colorings of Complete Bipartite Graphs K8,n

Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C(u) ≠ C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χ_(vt)^(ie) (G) and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K_(8,n)are discussed in this paper. Particularly, the VDIET chromatic number of K_(8,n) are obtained.

Smarandachely Adjacent-vertex-distinguishing Proper Edge Coloring ofK4 ∨ Kn

Let f be a proper edge coloring of G using k colors.For each x∈V(G),the set of the colors appearing on the edges incident with x is denoted by S_f(x)or simply S(x)if no confusion arise.If S(u)■S(v)and S(v)■S(u)for any two adjacent vertices u and v,then f is called a Smarandachely adjacent vertex distinguishing proper edge coloring using k colors,or k-SA-edge coloring.The minimum number k for which G has a Smarandachely adjacent-vertex-distinguishing proper edge coloring using k colors is called the Smarandachely adjacent-vertex-distinguishing proper edge chromatic number,or SAedge chromatic number for short,and denoted byχ'_(sa)(G).In this paper,we have discussed the SA-edge chromatic number of K_4∨K_n.

INTEGRAL DISTINGUISHERS OF JH AND GRSTL-512

In December of 2010 NIST selected five SHA-3 finalists-BLAKE,Grstl,JH,Keccak,and Skein to advance to the third (and final) round of the SHA-3 competition.At present most specialists and scholars focus on the design and the attacks on these hash functions.However,it is very significant to study some properties of their primitives and underlying permutations.Because some properties reflect the pseudo-randomness of the structures.Moreover,they help us to find new cryptanalysis for some block cipher structures.In this paper,we analyze the resistance of JH and Grstl-512 against structural properties built on integral distinguishers.And then 31.5 (out of 42) rounds integral distinguishers for JH compression function and 11.5 (out of 14) rounds for Grstl-512 compression function are presented.

The Application of Genetic Algorithms and Multidimensional Distinguishing Model in Forecasting and Evaluating Credits for Mobile Clients

To solve the arrearage problem that puzzled most of the mobile corporations, we propose an approach to forecast and evaluate the credits for mobile clients, devising a method that is of the coalescence of genetic algorithm and multidimensional distinguishing model. In the end of this paper, a result of a testing application in Zhuhai Branch, GMCC was provided. The precision of the forecasting and evaluation of the client’s credit is near 90%. This study is very significant to the mobile communication corporation at all levels. The popularization of the techniques and the result would produce great benefits of both society and economy.

A Distinguishing Method and Distribution Characteristics of Fog and Haze Days in Fuzhou

For data of atmospheric composition missing, fog and haze days were distinguished based on the standard of meteorological industry Observation and Forecasting Levels of Haze （QX/T113-2010） and four user-defined standards, and using data of surface meteorological factors in Fuzhou City, China from 2005 to 2011, temporal distributions of fog and haze days were analyzed respectively to provide methods for fog and haze forecast. The results showed that there were 28.9 fog days and 89.7 haze days per year in Fuzhou. Both fog and haze days were variable, and there might be a day difference of twice to thrice among the years. They were the most in 2007, and then decreased in recent years. Both fog and haze days were more in winter and spring, accounted for 94.1% and 70.1% respectively, while in summer and autumn, they only accounted for 5.9% and 29.9% respectively. In a day, fog mainly occurred from night to early morning, while haze occurred mainly at about noon, which demonstrated that fog and haze are different synoptic phenomena. The mass concentration of PM2.5 in fog days was 34 μg/m^3, while it was 61 μg/m^3 in haze days, and in 22% of haze days it was larger than 75 μg/m3, which was above the national second-grade ambient air quality standard.

On the adjacent vertex-distinguishing acyclic edge coloring of some graphs

A proper edge coloring of a graph G is called adjacent vertex-distinguishing acyclic edge coloring if there is no 2-colored cycle in G and the coloring set of edges incident with u is not equal to the coloring set of edges incident with v, where uv∈ E（G）. The adjacent vertex distinguishing acyclic edge chromatic number of G, denoted by X＇Aa（G）, is the minimal number of colors in an adjacent vertex distinguishing acyclic edge coloring of G. If a graph G has an adjacent vertex distinguishing acyclic edge coloring, then G is called adjacent vertex distinguishing acyclic. In this paper, we obtain adjacent vertex-distinguishing acyclic edge coloring of some graphs and put forward some conjectures.

Genetic types and distinguished characteristics of dolomite and the origin of dolomite reservoirs

To find out the origin of dolomite, the precipitation of primary dolomite, and the formation of pores in dolomite, petrologic and geochemical characteristics of typical samples from Sichuan and Tarim Basin were analyzed based on the previous understandings, and three aspects of results were achieved.(1) A classification of dolomite origins based on petrologic features, forming environment, and time sequence was proposed, which shows clear boundaries of diagenetic and characteristic realms and evolved clues between different types of dolomite.(2) Petrographic and geochemical identification marks for different types of dolomite were presented, revealing that the orderly geochemical variation of different types of dolomite is the response to the change of forming environment of dolomite during continuous time sequence.(3) The contribution of dolomitization to the formation of porosity was re-evaluated, revealing that the porosity in dolomite was mostly attributed to the primary pores and supergene dissolution and burial dissolution, and early dolomitization was conducive to the preservation of primary pores. These understandings are of great theoretical significance for identifying the origins and types of dolomite, and can guide the prediction of dolomite reservoirs.

Fringe visibility and distinguishability in two-path interferometer with an asymmetric beam splitter

We study the fringe visibility and the distinguishability of a general Mach-Zehnder interferometer with an asymmetric beam splitter. Both the fringe visibility V and the distinguishability D are affected by the input state of the particle characterized by the Bloch vector S =(S_x, S_y, S_z) and the second asymmetric beam splitter characterized by the paramterβ. For the total system is initially in a pure state, it is found that the fringe visibility reaches the upper bound and the distinguishability reaches the lower bound when cosβ=-S_x, The fringe visibility obtain the maximum only if S_x = 0 and β = π/2 when the input particle is initially in a mixed state. The complementary relationship V^2 +D^2 ≤ 1 is proved in a general Mach-Zehnder interferometer with an asymmetric beam splitter, and the conditions for the equality are also presented.

A fuzzy distinguishability on species composition similarities of pelagic fishes in different years in the southern Taiwan Strait

A fuzzy mathematical method is used to discriminate the similarities of pelagic fishes land- ed in the 9180 hauls by 10 light-seine information vessels in the southern Fujian waters from 1989 to 1998. The results indicate that the dominant species of the communities had an obvious alternation and the fuzzy adjacency of annual species composition varied between 0. 659 and 0. 923 with an average value of 0. 791. The fuzzy clustering analysis indicates that the annual fuzzy adjacency in general remains good although the species composition of the pelagic fishes has changed to a certain degree since 1992. This paper concludes that the community structure of pelagic fishes in the southern Taiwan Strait remains rel- atively stable and the state of fish stocks shows a good potentiality for a larger utilization.

The Distinguished Features of Longman Dictionary of Contemporary English (edition 3)

Longman Dictionary of Contemporary English is one of the commonly-used dictionaries for English learners,in order to help English learners learn more about the Longman Dictionary and make use of it better,the main common features of the Longman Dictionary of Contemporary English group are summarized in this essay and based on that,the distinguished features and the deficiencies of the Longman Dictionary of Contemporary English(edition 3) are analyzed.

Deterministically distinguishing a remote Bell state

It has been proven that, with a single copy provided, the four Bell states cannot be distinguished by local operations and classical communications （LOCC）. Traditionally, a Bell basis projective measurement is needed to distinguish the four Bell states, which is usually carried out with a local interference between two particles. This paper presents an interesting protocol that allows two remote parties to distinguish four Bell states deterministically. We prove that our protocol of distinguishing remote Bell states is beyond LOCC.

Local distinguishability by projective measurement

This paper proves that a set of orthogonal pure states are indistinguishable by restricted local projective measurement and classical communication if the sum of their Schmidt ranks is larger than the dimension of their joint Hilbert space. This result is useful in determining the local distinguishability of quantum states and is stronger in some respects than that of Hayashi et al [Phys. Rev. Lett. 96, 040501]. In addition, it presents a new method to determine the local distinguishability of orthogonal states by projecting measurement operators into their subspaces.

ON EQUITABLE VERTEX DISTINGUISHING EDGE COLORINGS OF TREES

It has been known that determining the exact value of vertex distinguishing edge index X ＇8（G） of a graph G is difficult, even for simple classes of graphs such as paths, cycles, bipartite complete graphs, complete, graphs, and graphs with maximum degree 2. Let rid（G） denote the number of vertices of degree d in G, and let X＇es（G） be the equitable vertex distinguishing edge index of G. We show that a tree T holds nl （T） ≤ X ＇s （T） ≤ n1 （T） ＋ 1 and X＇s（T） = X＇es（T） if T satisfies one of the following conditions （i） n2（T） ≤△（T） or （ii） there exists a constant c with respect to 0 〈 c 〈 1 such that n2（T） △ cn1（T） and ∑3 ≤d≤△（T）nd（T） ≤ （1 - c）n1（T） ＋ 1.

A fast computing method to distinguish the hyperbolic trajectory of an non-autonomous system

Attempting to find a fast computing method to DHT （distinguished hyperbolic trajectory）, this study first proves that the errors of the stable DHT can be ignored in normal direction when they are computed as the trajectories extend. This conclusion means that the stable flow with perturbation will approach to the real trajectory as it extends over time. Based on this theory and combined with the improved DHT computing method, this paper reports a new fast computing method to DHT, which magnifies the DHT computing speed without decreasing its accuracy.