检索结果-南通市图书馆

Quantum secret sharing between m-party and n-party with six states

在线全文

学校读者我要写书评

暂无评论

science china(Physics,Mechanics & Astronomy) 2009年第8期52卷 1191-1202页

作者： GAO Ting1,yan FengLi2,3 & LI YouCheng2,3 1 college of mathematics and Information science,Hebei Normal university,Shijiazhuang 050016,china 2 college of Physics and Information Engineering,Hebei Normal university,Shijiazhuang 050016,china 3 Hebei Advanced Thin Films Laboratory,Shijiazhuang 050016,china college of mathematics and Information science Hebei Normal University Shijiazhuang 050016 China college of Physics and Information Engineering Hebei Normal University Shijiazhuang 050016 China Hebei Advanced Thin Films Laboratory Shijiazhuang 050016 China

A quantum secret sharing scheme between an m-party group and an n-party group is proposed using three conjugate bases.A sequence of single photons,each of which is prepared in one of the six states,is used directly to encode classical information in the quantum secret sharing *** this scheme,each of all m members in group 1 chooses randomly his/her own secret key individually and independently,and directly encodes his/her respective secret information on the states of single photons via unitary operations,then the last one sends 1/n of the resulting qubits to each member of group *** measuring their respective qubits,all members in group 2 share the secret information shared by all members in group *** renders impossible a Trojan horse attack with a multi-photon signal,a fake-signal attack with EPR pairs,an attack with single photons,and an attack with invisible *** give the upper bounds on the average success probabilities for dishonest agent eavesdropping encryption using the fake-signal attack with any two-particle entangled states.

关键词： quantum secret sharing security EPR pairs

On adjacent-vertex-distinguishing total coloring of graphs

在线全文

学校读者我要写书评

暂无评论

science china mathematics 2005年第3期48卷 289-299页

作者： ZHANG Zhongfu, CHEN Xiang’en, LI Jingwen, YAO Bing, LU Xinzhong & WANG Jianfang college of mathematics and Information science, Northwest Normal university, Lanzhou 730070, china Department of computer, Lanzhou Normal college, Lanzhou 730070, china Institute of Applied mathematics, Lanzhou Jiaotong university, Lanzhou 730070, china college of Information and Electrical Engineering, Lanzhou Jiaotong university, Lanzhou 730070, china Institute of Applied mathematics, Chinese Academy of sciences, Beijing 100080, china 1. college of mathematics and Information science Northwest Normal University 730070 Lanzhou China 2. Department of computer Lanzhou Normal College 730070 Lanzhou China 3. Institute of Applied mathematics Lanzhou Jiaotong University 730070 Lanzhou China 4. college of Information and Electrical Engineering Lanzhou Jiaotong University 730070 Lanzhou China 5. Institute of Applied mathematics Chinese Academy of Sciences 100080 Beijing China

In this paper, we present a new concept of the adjacent-vertex-distinguishing total coloring of graphs (briefly, AVDTC of graphs) and, meanwhile, have obtained the adjacent-vertex-distinguishing total chromatic number... 详细信息

关键词： graph, proper total coloring, adjacent-vertex-distinguishing total coloring, adjacent-vertex-distinguishing total chromatic number.

Minimal regular 2-graphs and applications

在线全文

学校读者我要写书评

暂无评论

science china mathematics 2006年第2期49卷 158-172页

作者： FAN Hongbing, LIU Guizhen & LIU Jiping Department of Physics and computer science, Wilfrid Laurier university, Waterloo, ON., N2L 3C5 Canada School of mathematics and System science, Shandong university, Jinan 250100, china Department of mathematics and computer science, university of Lethbridge, Lethbridge, AB., T1K 3M4, Canada 1. Department of Physics and computer science Wilfrid Laurier University Waterloo ON. N2L 3C5 Canada 2. School of mathematics and System science Shandong University Jinan 250100 China 3. Department of mathematics and computer science University of Lethbridge Lethbridge AB. T1K 3M4 Canada

A 2-graph is a hypergraph with edge sizes of at most two. A regular 2-graph is said to be minimal if it does not contain a proper regular factor. Let f2(n) be the maximum value of degrees over all minimal regular 2-graphs of n vertices. In this paper, we provide a structure property of minimal regular 2-graphs, and consequently, prove that f2(n) = n+3-i/3, where 1 ≤ i ≤ 6, i ≡ n (mod 6) and n ≥ 7, which solves a conjecture posed by Fan, Liu, Wu and Wong. As applications in graph theory, we are able to characterize unfactorable regular graphs and provide the best possible factor existence theorem on degree conditions. Moreover, fa(n) and the minimal 2-graphs can be used in the universal switch box designs, which originally motivated this study.

关键词： graph regular factor 2-graph switch box design.

Accumulation of Pathogenesis-related Type-5 Like Proteins in Phytoplasma-infected Garland Chrysanthemum Chrysanthemum coronarium

在线全文

学校读者我要写书评

暂无评论

Acta Biochimica et Biophysica Sinica 2004年第11期36卷 773-779页

作者： Bo-Xiong ZHONG and yan-Wei SHENDepartment of Bioresource science, college of Animal science, Zhejiang university, Hangzhou 310029, china Department of Bioresource science College of Animal Science Zhejiang University Hangzhou 310029 Chin

Soluble proteins extracted from leaves, apical shoots, axillary shoots, and stems of garland chrysanthemum plants infected by onion yellows phytoplasma were analyzed by two-dimensional gel electrophoresis. computerized matching analysis revealed that at least six soluble proteins were accumulated specifically in phytoplasma-infected garland chrysanthemum. N-terminal amino acids sequences of these soluble

关键词： phytoplasma garland chrysanthemum Chrysanthemum coronarium pathogenesis-related proteins thaumatin osmotin

Scenario simulation and forecast of land use/cover in northern china

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese science Bulletin 2008年第9期53卷 1401-1412页

作者： LI YueChen 1,2,3 & HE Chunyang 3 1 college of Geographical science, Chongqing Normal university, Chongqing 400047, china 2 college of Resources and Environmental science, Chongqing university, Chongqing 400044, china 3 college of Resources science & Technology, Beijing Normal university, Beijing 100875, china college of Geographical science Chongqing Normal University Chongqing 400047 China college of Resources and Environmental science Chongqing University Chongqing 400044 China college of Resources science & Technology Beijing Normal University Beijing 100875 China

Modeling land use/cover scenario changes and its potential impacts on structure and functions of ecosystem in typical regions are helpful to understanding the interactive mechanism between land use/cover system and ecosystem. Based on the analysis of the existing land use/cover simulation and forecast models, a land use/cover scenario dynamics model by the integration of System Dynamics (SD) model, Back Propagation Neural Network (BPNN) and Cellular Automata (CA) model is developed with land use/cover scenario changes in northern china in the next 30 years and simulated in this paper. The model is to simulate the land use/cover scenario demands by using a SD model at first, and then allocating the land use scenario patterns at the local scale with the considerations of land use/cover suitability, inheritance ability and neighborhood effect by using BPNN-CA model to satisfy the balance between land use/cover scenario demands and supplies. It integrates the advantages of SD, BPNN and CA. Macro-driving factors and the micro-spatial pattern are also fully taken into account. The BPNN simplifies the identification of the factors’ weights used in CA model and improves the reliability of the simulation results. The simulation accuracy of the model developed in this paper was found to be about 74%. It suggests that the model has the ability to reflect the complexity of land use/cover system at different scales to some extent and it is a useful tool for assessing the potential impacts of land use system on ecosystem. The simulated results also indicate that the urban land, water area and forest will increase significantly, and farmland and unable land will decrease gradually. Obvious land use/cover changes will take place in the farming-pastoral zone and the southeast area of northern china.

关键词：土地利用中国北方细胞自动机系统动力学

Asymptotic normality and strong consistency of maximum quasi-likelihood estimates in generalized linear models

在线全文

学校读者我要写书评

暂无评论

science china mathematics 2006年第2期49卷 145-157页

作者： YIN Changming, ZHAO Lincheng & WEI Chengdong School of mathematics and Information science, Guangxi university, Manning 530004, china Department of Statistics and Finance, university of science and Technology of china, Hefei 230026, china Department of mathematics, Guangxi Teacher college, Manning 530001, china 1. School of mathematics and Information science Guangxi University Nanning 530004 China 2. Department of Statistics and Finance University of Science and Technology of China Hefei 230026 China 3. Department of mathematics Guangxi Teacher College Nanning 530001 China

In a generalized linear model with q x 1 responses, the bounded and fixed (or adaptive) p × q regressors Zi and the general link function, under the most general assumption on the minimum eigenvalue of ZiZ'i,the moment condition on responses as weak as possible and the other mild regular conditions, we prove that the maximum quasi-likelihood estimates for the regression parameter vector are asymptotically normal and strongly consistent.

关键词： generalized linear models quasi-likelihood estimates asymptotic normality strong consistency.

A polynomial algorithm for finding (g,f)-colorings orthogonal to stars in bipartite graphs

在线全文

学校读者我要写书评

暂无评论

science china mathematics 2005年第3期48卷 322-332页

作者： LIU Guizhen & DENG Xiaotie Department of mathematics, Shandong university, Jinan 250100, china Department of computer science, The City university of Hong Kong, Hong Kong, china 1. Department of mathematics Shandong University 250100 Jinan China 2. Department of computer science The City University of Hong Kong Hong Kong China

Let G be a bipartite graph with vertex set V(G) and edge set E(G), and let g and f be two nonnegative integer-valued functions defined on V(G) such that g(x) ≤f(x)for every vertex x of V(G). A(g,f)-coloring of G is a generalized edge-coloring in which each color appears at each vertex x at least g(x) and at most f(x) times. In this paper a polynomial algorithm to find a(g, f)-coloring of a bipartite graph with some constraints using the minimum number of colors is given. Furthermore, we show that the results in this paper are best possible.

关键词： bipartite graph, (g, f)-coloring, (g, f)-factor, orthogonal coloring.

Partitioning series-parallel multigraphs into υ*-excluding edge covers

在线全文

学校读者我要写书评

暂无评论

science china mathematics 2006年第8期49卷 1082-1093页

作者： LIU Guizhen, DENG Xiaotie & XU Changqing School of mathematics and System science, Shandong university, Jinan 250100, china Department of computer science, City university of Hong Kong, Kowloon, Hong Kong, china Department of Applied mathematics, Hebei university of Technology, Tianjin 300130, china School of mathematics and System science Shandong University Jinan 250100 China Department of computer science City University of Hong Kong Kowloon Hong Kong Hong Kong Department of Applied mathematics Hebei University of Technology Tianjin 300130 China

We prove that, for any given vertexν* in a series-parallel graph G, its edge set can be partitioned into k= min{k′(G) + 1,δ(G)} subsets such that each subset covers all the vertices of G possibly except forν*, whereδ(G) is the minimum degree of G and k′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.

关键词： series-parallel graph, edge-connectivity, edge cover coloring, min-max theorem.

A Hybrid of Theorems of Goldbach and Piatetski-Shapiro

在线全文

学校读者我要写书评

暂无评论

Chinese Annals of mathematics,Series B 2006年第3期27卷 341-352页

作者： Xianmeng MENG Mingqiang WANG School of computer science and Technology, Shandong university, Jinan 250100, china Department of Statistics and mathematics, Shandong Finance Institute, Jinan 250014, china. School of computer science and Technology, Shandong university, Jinan 250100, china Department of mathematics, Qufu Normal university, Qufu 273165, Shandong, china. School of computer science and Technology Shandong University Jinan 250100 China Department of Statistics and mathematics Shandong Finance Institute Jinan 250014 China Department of mathematics Qufu Normal University Qufu 273165 Shandong China

It is proved that for almost all sufficiently large even integers n, the prime variable equation n = p1 ＋ p2, p1 ∈ Pγ is solvable, with 13/15 〈γ≤ 1, where Pγ = {p ｜p = [m^1/γ], for integer m and prime p} is t... 详细信息

关键词： Circle method Sieve method Goldbach problem