期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
ON SOME SHARP CHERNOFF TYPE INEQU ALITIES 被引量:1
1
作者 Yuqi ZHOU Chunna ZENG 《Acta Mathematica Scientia》 2025年第2期540-552,共13页
Two sharp Chernoff type inequalities are derived for star bodies in R2,one is an extension of the dual Chernoff-Ou-Pan inequality,and the other is the reverse Chernoff type inequality.Furthermore,we establish a genera... Two sharp Chernoff type inequalities are derived for star bodies in R2,one is an extension of the dual Chernoff-Ou-Pan inequality,and the other is the reverse Chernoff type inequality.Furthermore,we establish a generalized dual symmetric mixed Chernoff inequality for two planar star bodies.As a direct consequence,a new proof of the dual symmetric mixed isoperimetric inequality is presented. 展开更多
关键词 Chernoff type inequality Fourier series k-order radial function reverse Chernoff type inequality
在线阅读 下载PDF
k-Order Fibonacci Polynomials on AES-Like Cryptology
2
作者 Mustafa Asci Suleyman Aydinyuz 《Computer Modeling in Engineering & Sciences》 SCIE EI 2022年第4期277-293,共17页
The Advanced Encryption Standard(AES)is the most widely used symmetric cipher today.AES has an important place in cryptology.Finite field,also known as Galois Fields,are cornerstones for understanding any cryptography... The Advanced Encryption Standard(AES)is the most widely used symmetric cipher today.AES has an important place in cryptology.Finite field,also known as Galois Fields,are cornerstones for understanding any cryptography.This encryption method on AES is a method that uses polynomials on Galois fields.In this paper,we generalize the AES-like cryptology on 2×2 matrices.We redefine the elements of k-order Fibonacci polynomials sequences using a certain irreducible polynomial in our cryptology algorithm.So,this cryptology algorithm is called AES-like cryptology on the k-order Fibonacci polynomial matrix. 展开更多
关键词 Fibonacci numbers Fibonacci polynomials k-order Fibonacci polynomials Fibonacci matrix k-order Fibonacci polynomial matrix Galois field
在线阅读 下载PDF
DECOMPOSITION THEOREM AND k-HYPERCONNECTION EXPRESSIONS FOR GENERAL k-ORDER COFACTORS
3
作者 黄汝激 《Journal of Electronics(China)》 1991年第4期307-316,共10页
Two k-hyperconnection expressions of a general k-order cofactor Y<sub>(i,j)</sub> are presentedfor the indefinite parameter matrix Y of a linear system by applying directed hypergraph theory,and based on... Two k-hyperconnection expressions of a general k-order cofactor Y<sub>(i,j)</sub> are presentedfor the indefinite parameter matrix Y of a linear system by applying directed hypergraph theory,and based on it a decomposition theorem of Y<sub>(i,j)</sub> is derived.By this theorem,the multi-leveltearing and analysis can be carried out easily for any linear large system.This is a new mul-tilevel topological analysis method.Using proposed method the scale of systems which can betopologically analysed by a computer will be enlarged. 展开更多
关键词 Directed hypergrsph theory k-order COFACTOR k-Hyperconnection MULTILEVEL TOPOLOGICAL analysis
在线阅读 下载PDF
Ordered and Ordered Hamilton Digraphs 被引量:1
4
作者 WANGMU Jiang-shan YUAN Jun +1 位作者 LIN Shang-wei WANG Shi-ying 《Chinese Quarterly Journal of Mathematics》 CSCD 2010年第3期317-326,共10页
A digraph D is k-ordered if for every sequence S:v 1,v 2,…,v k of k distinct vertices,there exists a cycle C such that C encounters the vertices of S in the specified order.In particular,we say that D is k-ordered h... A digraph D is k-ordered if for every sequence S:v 1,v 2,…,v k of k distinct vertices,there exists a cycle C such that C encounters the vertices of S in the specified order.In particular,we say that D is k-ordered hamiltonian if for every sequence S:v 1,v 2,…,v k of k distinct vertices,there exists a hamiltonian cycle C such that the vertices of S are encountered on C in the specified order.In this paper,sufficient conditions for digraphs to be ordered and ordered hamiltonian have been given. 展开更多
关键词 DIGRAPHS k-ordered digraphs k-ordered hamiltonian digraphs
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部