检索结果-南通市图书馆

Quantum self-attention neural networks for text classification

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(information sciences) 2024年第4期67卷 301-313页

作者： guangxi LI Xuanqiang ZHAO Xin WANG Institute for Quantum Computing Baidu Research Centre for Quantum Software and information University of Technology Sydney QICI Quantum information and Computation Initiative Department of Computer ScienceThe University of Hong Kong Thrust of Artificial Intelligence Information HubHong Kong University of Science and Technology(Guangzhou)

An emerging direction of quantum computing is to establish meaningful quantum applications in various fields of artificial intelligence, including natural language processing(NLP). Although some efforts based on syntactic analysis have opened the door to research in quantum NLP(QNLP), limitations such as heavy syntactic preprocessing and syntax-dependent network architecture make them impracticable on larger and real-world data sets. In this paper, we propose a new simple network architecture, called the quantum selfattention neural network(QSANN), which can compensate for these limitations. Specifically, we introduce the self-attention mechanism into quantum neural networks and then utilize a Gaussian projected quantum self-attention serving as a sensible quantum version of self-attention. As a result, QSANN is effective and scalable on larger data sets and has the desirable property of being implementable on near-term quantum devices. In particular, our QSANN outperforms the best existing QNLP model based on syntactic analysis as well as a simple classical self-attention neural network in numerical experiments of text classification tasks on public data sets. We further show that our method exhibits robustness to low-level quantum noises and showcases resilience to quantum neural network architectures.

关键词： quantum neural networks self-attention natural language processing text classification parameterized quantum circuits

The existence of balanced (v, {3,6}, 1) difference families

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(information sciences) 2010年第8期53卷 1584-1590页

作者： WU DianHua 1 , CHENG MinQuan 1,2 , CHEN ZhiLin 1 & LUO HaiPeng 3.1 Department of Mathematics, guangxi normal university, guilin 541004, china 2 Institute of Policy and Planning {3.s, university of Tsukuba, Tsukuba, Ibaraki 3.5-8573. Japan 3.guangxi Academy of {3., Nanning 53.007, china Department of Mathematics Guangxi Normal University Guilin China Institute of Policy and Planning sciences University of Tsukuba Tsukuba Ibaraki Japan guangxi Academy of science Nanning China

Optimal frequency-hopping sequences can be constructed from cyclic (v, K, 1)-PBDs. A (v, K, 1) difference family can be used to construct a (v, K, 1)-PBD. A lot of work has been done on the existence of (v, k, 1) difference families when K = {k} is a singleton. For K = {3. 4}, it is proved that for each prime power v ≡ 1 (mod 18) and v 19, there exists a balanced (v, K, 1) difference family. In this paper, it is proved that there exists a balanced (v, {3. 6}, 1) difference family for each prime power v ≡ 1 (mod 3.) and v 3.. An infinite class of optimal frequency-hopping sequence is then obtained.

关键词： pairwise balanced design difference family character sum optimal frequency-hopping sequence

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 {3. university,Shijiazhuang 050016,china 2 college of Physics and information Engineering,Hebei {3. 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

Key technology of mine underground mobile positioning based on LiDAR and coded sequence pattern

在线全文

学校读者我要写书评

暂无评论

中国有色金属学会会刊：英文版 2011年第S3期21卷 570-576页

作者： WANG Zhi1, 2, WU Li-xin1, 2, LI Hui-ying3.1. college of Resources and Civil Engineering, Northeastern university, Shenyang 110004, china 2. Academy of Disaster Reduction and Emergency Management, Ministry of Civil Affairs and Ministry of Education, Beijing {3. university, Beijing 100875, china 3. college of computer science and Technology, Jilin university, Changchun 13.012, china [a] college of Resources and Civil Engineering Northeastern University Shenyang 110004 China [b] Academy of Disaster Reduction and Emergency Management Ministry of Civil Affairs and Ministry of Education Beijing Normal University Beijing 100875 China [c] college of computer science and Technology Jilin University Changchun 130012 China

Technologies of underground mobile positioning were proposed based on LiDAR data and coded sequence pattern landmarks for mine shafts and tunnels environment to meet the needs of fast and accurate positioning and navigation of equipments in the mine underground without satellite navigation signals. A coded sequence pattern was employed for automatic matching of 3. scans. The methods of SIFT feature, Otsu segmentation and fast hough transformation were described for the identification, positioning and interpretation of the coded sequence patterns, respectively. The POSIT model was presented for speeding up computation of the translation and rotation parameters of LiDAR point data, so as to achieve automatic 3. mapping of mine shafts and tunnels. The moving positioning experiment was applied to evaluating the accuracy of proposed pose estimation method from LiDAR scans and coded sequence pattern landmarks acquired in an indoor environment. The performance was evaluated using ground truth data of the indoor setting so as to measure derivations with six degrees of freedom.

关键词： LiDAR coded sequence pattern mobile positioning SLAM algorithm POSIT algorithm

Quantum secret sharing between multiparty and multiparty with four states

在线全文

学校读者我要写书评

暂无评论

science china(Physics,Mechanics & Astronomy) 2007年第5期50卷 572-580页

作者： YAN FengLi1, GAO Ting2 & LI YouCheng1 1 college of Physics and information Engineering, Hebei normal {3., Shijiazhuang 050016, china 2 college of Mathematics and information science, Hebei normal {3., Shijiazhuang 050016, china 1. college of Physics and information Engineering Hebei Normal University Shijiazhuang 050016 China 2. college of Mathematics and information science Hebei Normal University Shijiazhuang 050016 China

A protocol of quantum secret sharing between multiparty and multiparty with four states was presented. It was shown that this protocol can nullify the Trojan horse attack with a multi-photon signal, the fake-signal attack with Einstein-Podolsky- Rosen pairs, the attack with single photons, and the attack with invisible photons. In addition, the upper bounds of the average success probabilities were given for dishonest agent eavesdropping encryption using the fake-signal attack with any two-particle entangled states.

关键词： quantum secret sharing, security, Einstein-Podolsky-Rosen pairs

Finite automata based on quantum logic and monadic second-order quantum logic

在线全文

学校读者我要写书评

暂无评论

science china(information sciences) 2010年第1期53卷 101-114页

作者： LI YongMing college of computer science, Shaanxi {3. university, Xi’an 710062, china 1. college of computer science Shaanxi Normal University Xi’an 710062 China

We introduce monadic second-order quantum logic and prove that the behaviors of finite automata based on quantum logic are precisely the quantum languages definable with sentences of our monadic secondorder quantum logic. This generalizes Büchi’s and Elgot’s fundamental theorems to quantum logic setting. We also consider first-order quantum logic and show that star-free quantum languages and aperiodic quantum languages introduced here coincide with the first-order quantum definable ones. This generalizes Schützenberger’s fundamental theorems to quantum logic setting. The determinazation of finite automata based on quantum logic is studied by introducing the generalized subset construction method. Then the Kleene theorem in the frame of quantum logic is presented here.

关键词： quantum logic finite automaton monadic second quantum logic quantum language quantum computation Kleene theorem

λ-fold indecomposable large sets of Steiner triple systems

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china Mathematics 2010年第11期53卷 2877-2888页

作者： JI LiJun1, TIAN ZiHong2, & KANG QingDe2 1Department of Mathematics, Suzhou university, Suzhou 215006, china 2college of Mathematics and {3. science, Hebei normal university, Shijiazhuang 050016, china 1. Department of Mathematics Suzhou University Suzhou 215006 China2. College of Mathematics and Information Science Hebei Normal University Shijiazhuang 050016 China

A family (X, B1), (X, B2), . . . , (X, Bq) of q STS(v)s is a λ-fold large set of STS(v) and denoted by LSTSλ(v) if every 3.subset of X is contained in exactly λ STS(v)s of the collection. It is indecomposable and denoted by IDLSTSλ(v) if there exists no LSTSλ (v) contained in the collection for any λ 1 and orders v ≡ 1, 3.(mod 6) do there exist IDLSTSλ(v)? In this paper, we use partitionable candelabra systems (PCSs) and holey λ-fold large set of STS(v) (HLSTSλ(v)) as auxiliary designs to establish a recursive construction for IDLSTSλ(v) and show that there exists an IDLSTSλ(v) for λ = 2, 3. 4 and v ≡ 1, 3.(mod 6).

关键词： Steiner triple system large set candelabra system indecomposable

Cluster based node scheduling method for wireless sensor networks

在线全文

学校读者我要写书评

暂无评论

science china(information sciences) 2012年第4期55卷 755-764页

作者： WANG Lei 1,2,WEI RuiZhong 2 & TIAN ZiHong 2,3.1 college of Software,Hunan university,Changsha 410082,china 2 Department of {3. science,Lakehead university,Thunder Bay P7B 5E1,Canada 3.Mathematics and information science college,Hebei normal university,Shijiazhuang 050016,china 1. college of Software Hunan University Changsha 410082 China2. Department of Computer Science Lakehead University Thunder Bay P7B 5E1 Canada3. Mathematics and Information Science College Hebei Normal University Shijiazhuang 050016 China

By researching on the node scheduling problem of m-covered and connected sensor networks,a new concept of two-hops-cluster is proposed in this paper,and based on it,a new distributed node scheduling algorithm THCNS for allocating all nodes in the sensor network into k(k≤m) different groups {0,1,...,k 1} is designed,without requiring location *** algorithm guarantees that each group to be connected and maintains the coverage ratio with high *** analysis and simulation results show that it has better performance than previous randomized scheduling scheme,and can prolong the lifetime of the sensor network effectively.

关键词： node scheduling lifetime wireless sensor network two-hops-cluster

A NEWε-GENERALIZED PROJECTION METHOD OF STRONGLY SUB-FEASIBLE DIRECTIONS FOR INEQUALITY CONSTRAINED OPTIMIZATION

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems science & Complexity 2011年第3期24卷 604-618页

作者： Jinbao JIAN Guodong MA Chuanhao GUO college of Mathematics and information science Guangxi University Nanning 530004 China Department of Mathematics and computer science Yulin Normal University Yulin 537000 China college of science Shanghai University Shanghai 200444 China.

In this paper, the nonlinear optimization problems with inequality constraints are discussed. Combining the ideas of the strongly sub-feasible directions method and the s-generalized projection technique, a new algorithm starting with an arbitrary initial iteration point for the discussed problems is presented. At each iteration, the search direction is generated by a new s-generalized projection explicit formula, and the step length is yielded by a new Armijo line search. Under some necessary assumptions, not only the algorithm possesses global and strong convergence, but also the iterative points always get into the feasible set after finite iterations. Finally, some preliminary numerical results are reported.

关键词： E-generalized projection global and strong convergence inequality constraints method of strongly sub-feasible directions optimization.