检索结果-内蒙古大学图书馆

Application of Orthogonal Array and Walsh Transform in Resilient Function

Chinese Journal of Electronics 2018年第2期27卷 281-286页

作者： PANG Shanqi WANG Jing WANG Xunan WANG Xiaoli College of Mathematics and Information Science Henan Normal University Henan Engineering Laboratory for Big Data Statistical Analysis and Optimal Control Henan Normal University

The relationship between Walsh transform of a Boolean function and the orthogonality of some columns of its support table is investigated. This result improves the characterization of the orthogonality of Orthogonal array(OA). Stinson and Massey gave two construction methods of linear resilient functions, one is to use linear code, the other is to utilize the large set of orthogonal arrays and right cosets. And another major contribution is to show the equivalence of two methods.

关键词： Resilient functions Orthogonal array(OA) Linear code Walsh transform

来源：评论

学校读者我要写书评

暂无评论

Construction of Generalized Quantum Boolean Functions

引用

Chinese Journal of Electronics 2019年第3期28卷 508-513页

作者： PANG Shanqi ZHANG Qingjuan LIN Xiao College of Mathematics and Information Science Henan Normal University Henan Engineering Laboratory for Big Data Statistical Analysis and Optimal Control Henan Normal University

The existing construction methods of Quantum Boolean functions(QBFs) are extended and simplified. All QBFs with one qubit and all local QBFs with any qubits are constructed. And we propose the concept of Generalized quantum Boolean functions(GQBFs). We find all GQBFs with one qutrit and all kinds of local GQBFs with any qutrits. The number of each of the four kinds of functions above is uncountably infinitely many. By using diagonal matrices, we obtain uncountably infinitely many non-local QBFs with any qubits and GQBFs with any qutrits. Infinitely many families of GQBFs with any qudits are obtained from the properties of projection matrices of known saturated orthogonal arrays.

关键词： Quantum information Matrix image of orthogonal array Quantum Boolean functions Generalized quantum Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Accurate analysis of Connectivity and Resilience for a Class of Wireless Sensor Networks

引用

Chinese Journal of Electronics 2020年第2期29卷 208-219页

作者： PANG Shanqi HU Xianchao GAO Qiang LI Yongmei XIA Yifan College of Mathematics and Information Science Henan Normal University Henan Engineering Laboratory for Big Data Statistical Analysis and Optimal Control Henan Normal University

Increasing attention is being devoted to network security with the extensive application of wireless sensor networks in various fields. Connectivity and resilience are the crucial metrics of network *** establish precise formulas for obtaining the resilience of a Key predistribution scheme(KPS) obtained from an Orthogonal array(OA). We study the connectivity and resilience of the Broadcast-enhanced key predistribution scheme(BEKPS) based on OAs and improve the existing methods. We also present precise formulas for evaluating the resilience of these schemes based on any number of partitions, completely solving the problem regarding the resilience of this type of BEKPS. We obtain precise formulas for ensuring the connectivity of two partitions under the condition that each pair of trees from different partitions intersects at exactly one node. We present a general approximate formula for evaluating the connectivity of more than two partitions, providing a positive solution to the open problem in Kendall et al.’s paper in ACM Transactions on Sensor Networks(Vol.11,No.1, 2014). Thus, we can conclude that for this type of BEKPS, connectivity increases, whereas resilience remains unchanged as the number of partitions increases. A comparison of the obtained results and the previously reported results reveals the superior performance of the proposed BEKPSs.

关键词： Wireless sensor network Key predistribution scheme Broadcast-enhanced key predistribution scheme Orthogonal array

来源：评论

学校读者我要写书评

暂无评论

Jordan canonical form of three-way tensor with multilinear rank (4,4,3)

引用

Frontiers of Mathematics in China 2019年第2期14卷 281-300页

作者： Lubin Cui Minghui Li Henan Engineering Laboratory for Big Data Statistical Analysis and Optimal Control School of Mathematics and Information Sciences Henan Normal University Xinxiang 453007 China

The Jordan canonical form of matrix is an important concept in linear algebra. And the concept has been extended to three-way arrays case. In this paper, we study the Jordan canonical form of three-way tensor with multilinear rank (4,4,3). For a 4 × 4 × 4 tensor gj with multilinear rank (4,4,3), we show that gj must be turned into the canonical form if the upper triangular entries of the last three slices of gj are nonzero. If some of the upper triangular entries of the last three slices of gj are zeros, we give some conditions to guarantee that gj can be turned into the canonical form.

关键词： Jordan canonical form tensor decomposition multilinear rank

来源：评论

学校读者我要写书评

暂无评论

A NEW SUFFICIENT CONDITION FOR SPARSE RECOVERY WITH MULTIPLE ORTHOGONAL LEAST SQUARES

引用

Acta Mathematica Scientia 2022年第3期42卷 941-956页

作者： Haifeng LI Jing ZHANG Henan Engineering Laboratory for Big Data Statistical Analysis and Optimal Control College of Mathematics and Information ScienceHenan Normal UniversityXinxiang 453007China

A greedy algorithm used for the recovery of sparse signals,multiple orthogonal least squares(MOLS)have recently attracted quite a big of *** this paper,we consider the number of iterations required for the MOLS algorithm for recovery of a K-sparse signal x∈R^(n).We show that MOLS provides stable reconstruction of all K-sparse signals x from y=Ax+w in|6K/ M|iterations when the matrix A satisfies the restricted isometry property(RIP)with isometry constantδ_(7K)≤*** with the existing results,our sufficient condition is not related to the sparsity level K.

关键词： Sparse signal recovery multiple orthogonal least squares(MOLS) sufficient condition restricted isometry property(RIP)

来源：评论

学校读者我要写书评

暂无评论

Generalized Latin Matrix and Construction of Orthogonal Arrays

引用

Acta Mathematicae Applicatae Sinica 2017年第4期33卷 1083-1092页

作者： Shan-qi PANG Li-yan CHEN College of Mathematics and Information Science Henan Engineering Laboratory for Big Data Statistical Analysis and Optimal Control Henan Normal University Xinxiang 453007 China Anyang Preschool Education College Anyang 456150 China

In this paper, generalized Latin matrix and orthogonal generalized Latin matrices are proposed. By using the property of orthogonal array, some methods for checking orthogonal generalized Latin matrices are presented. We study the relation between orthogonal array and orthogonal generalized Latin matrices and obtain some useful theorems for their construction. An example is given to illustrate applications of main theorems and a new class of mixed orthogonal arrays are obtained.

关键词： orthogonal array generalized Latin matrix orthogonal generalized Latin matrices matrix image generalized permutation difference matrix

来源：评论

学校读者我要写书评

暂无评论

The James Constant for the l_3-l_1 Space

引用

Acta Mathematica Sinica,English Series 2016年第9期32卷 1075-1079页

作者： Chang Sen YANG Hai Ying LI He'nan Engineering Laboratory for Big Data Statistical Analysis and Optimal Control School of Mathematics and Information SciencesHe'nan Normal University

In this note, the exact value of the James constant for the l3 - l1 space is obtained, J（l3 - l0 = 1.5573.... This result improves the known inequality, J（13 - 11） ≤4/3√10,which was given by Dhompongsa, Piraisang... 详细信息

关键词： James constant modulus of convexity l3 - l1 space

来源：评论

学校读者我要写书评

暂无评论

A Novel Genetic Algorithm for Global Optimization

引用

Acta Mathematicae Applicatae Sinica 2020年第2期36卷 482-491页

作者： Chun-feng WANG Kui LIU Pei-ping SHEN College of Mathematics and Information.Henan Normal University Xinxiang 453007China Henan Engineering Laboratory for Big Data Statistical Analysis and Optimal Control School of Mathematics and Information SciencesHenan Normal UniversityXinxiang 453007 China

This paper presents a novel genetic algorithm for globally solving un-constraint optimization *** this algorithm,a new real coded crossover operator is proposed ***,for improving the convergence speed and the searching ability of our algorithm,the good point set theory rather than random selection is used to generate the initial population,and the chaotic search operator is adopted in the best solution of the current *** experimental results tested on numerical benchmark functions show that this algorithm has excellent solution quality and convergence characteristics,and performs better than some algorithms.

关键词： genetic algorithm good point set chaotic search continuous optimization

来源：评论

学校读者我要写书评

暂无评论

Cubic Semisymmetric Graphs of Order 2qp^2

引用

Acta Mathematicae Applicatae Sinica 2019年第3期35卷 629-637页

作者： Xiao-hui HUA Song-tao GUO Li CHEN Henan Engineering Laboratory for Big Data Statistical Analysis and Optimal Control College of Mathematics and Information ScienceHenan Normal UniversityXinxiang 453007China School of Mathematics and Statistics Henan University of Science and TechnologyLuoyang 471003China

A regular edge-transitive graph is said to be semisymmetric if it is not *** p be a *** Folkman[*** 3(1967),215–232],there is no cubic semisymmetric graph of order 2p or 2p^2,and by Hua et al.[Science in China A 54(2011),1937–1949],there is no cubic semisymmetric graph of order 4p^*** et al.[Science in China A 47(2004),11–17]classified connected cubic semisymmetric graphs of order 6p^*** this paper,for p>q≥5 two distinct odd primes,it is shown that the sufficient and necessary conditions which a connected cubic edge transitive bipartite graph of order 2qp^2 is semisymmetric.

关键词： Bi-Cayley graph edge-transitive graph semisymmetric graph regular covering

来源：评论

学校读者我要写书评

暂无评论

The Existence of a Class of Balanced Multi-output Rotation Symmetric Boolean Functions

引用

Chinese Journal of Electronics 2018年第5期27卷 995-1001页

作者： DU Jiao FU Shaojing QU Longjiang LI Chao PANG Shanqi College of Mathematics and Information Science Henan Normal University Henan Engineering Laboratory for Big Data Statistical Analysis and Optimal Control Henan Normal University College of Computer Science National University of Defense Technology College of Liberal Arts and Science National University of Defense Technology

A new characterization of balanced rotation symmetric（n, m）-functions is presented. Based on the characterization, the nonexistence of balanced rotation symmetric（pr, m）-functions is determined, where p is an odd prime and m ≥ 2. And there exist balanced rotation symmetric（2r, m）-functions for 2 ≤ m ≤ 2r-r. With the help of these results, we also prove that there exist rotation symmetric resilient（2r, m）-functions for 2 ≤ m ≤ 2r-r-1.

关键词： Cryptography Rotation symmetric Orbit matrix Correlation immune Resilient functions

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：