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.展开更多
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.展开更多
Abstract A graph g is k-ordered Hamiltonian, 2 h k h n, if for every ordered sequence S of k distinct vertices of G, there exists a Hamiltonian cycle that encounters S in the given order. In this article, we prove tha...Abstract A graph g is k-ordered Hamiltonian, 2 h k h n, if for every ordered sequence S of k distinct vertices of G, there exists a Hamiltonian cycle that encounters S in the given order. In this article, we prove that if G is a graph on n vertices with degree sum of nonadjacent vertices at least $n+{{3k - 9} \over 2}$, then G is k-ordered Hamiltonian for k=3,4,...,￠${n \over {19}}$?. We also show that the degree sum bound can be reduced to n+ 2 ￠ ${k \over {2}}$ m 2 if $\kappa(G)\ge {{3k - 1} \over 2}$ or '(G) S 5k m 4. Several known results are generalized.展开更多
随着光伏发电系统大规模接入电网,不可避免地带来了严重的谐波污染问题。为了有效监测光伏并网系统输出电流的谐波、间谐波,提出了一种基于改进快速最小二乘法-旋转不变法(total least squares-estimation of signal parameters via rot...随着光伏发电系统大规模接入电网,不可避免地带来了严重的谐波污染问题。为了有效监测光伏并网系统输出电流的谐波、间谐波,提出了一种基于改进快速最小二乘法-旋转不变法(total least squares-estimation of signal parameters via rotational invariance technique,TLS-ESPRIT)与2阶Blackman-Harris自卷积窗相结合的检测方法。首先对待测信号进行三次采样并利用快速TLS-ESPRIT算法检测频率。随后对检测结果基于简化K-means聚类算法进行分析,提取出真实的谐波分量。最后结合2阶Blackman-Harris自卷积窗对信号进行加窗插值计算,准确估算出其幅值、相位信息,实现了谐波、间谐波的高精度检测。仿真算例和现场数据测试结果表明,所提方法相较于传统方法具有更高的谐波、间谐波检测精度,且抗干扰能力更强。展开更多
In probability theory, the mixture distribution M has a density function for the collection of random variables and weighted by w<sub>i</sub> ≥ 0 and . These mixed distributions are used in various discip...In probability theory, the mixture distribution M has a density function for the collection of random variables and weighted by w<sub>i</sub> ≥ 0 and . These mixed distributions are used in various disciplines and aim to enrich the collection distribution to more parameters. A more general mixture is derived by Kadri and Halat, by proving the existence of such mixture by w<sub>i</sub> ∈ R, and maintaining . Kadri and Halat provided many examples and applications for such new mixed distributions. In this paper, we introduce a new mixed distribution of the Generalized Erlang distribution, which is derived from the Hypoexponential distribution. We characterize this new distribution by deriving simply closed expressions for the related functions of the probability density function, cumulative distribution function, moment generating function, reliability function, hazard function, and moments.展开更多
基金This work is supported by the Scientific Research Project(BAP)2020FEBE009,Pamukkale University,Denizli,Turkey.
文摘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.
文摘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.
基金Partially supported by the National Natural Sciences Foundation of China (No.19831080).
文摘Abstract A graph g is k-ordered Hamiltonian, 2 h k h n, if for every ordered sequence S of k distinct vertices of G, there exists a Hamiltonian cycle that encounters S in the given order. In this article, we prove that if G is a graph on n vertices with degree sum of nonadjacent vertices at least $n+{{3k - 9} \over 2}$, then G is k-ordered Hamiltonian for k=3,4,...,￠${n \over {19}}$?. We also show that the degree sum bound can be reduced to n+ 2 ￠ ${k \over {2}}$ m 2 if $\kappa(G)\ge {{3k - 1} \over 2}$ or '(G) S 5k m 4. Several known results are generalized.
文摘随着光伏发电系统大规模接入电网,不可避免地带来了严重的谐波污染问题。为了有效监测光伏并网系统输出电流的谐波、间谐波,提出了一种基于改进快速最小二乘法-旋转不变法(total least squares-estimation of signal parameters via rotational invariance technique,TLS-ESPRIT)与2阶Blackman-Harris自卷积窗相结合的检测方法。首先对待测信号进行三次采样并利用快速TLS-ESPRIT算法检测频率。随后对检测结果基于简化K-means聚类算法进行分析,提取出真实的谐波分量。最后结合2阶Blackman-Harris自卷积窗对信号进行加窗插值计算,准确估算出其幅值、相位信息,实现了谐波、间谐波的高精度检测。仿真算例和现场数据测试结果表明,所提方法相较于传统方法具有更高的谐波、间谐波检测精度,且抗干扰能力更强。
文摘In probability theory, the mixture distribution M has a density function for the collection of random variables and weighted by w<sub>i</sub> ≥ 0 and . These mixed distributions are used in various disciplines and aim to enrich the collection distribution to more parameters. A more general mixture is derived by Kadri and Halat, by proving the existence of such mixture by w<sub>i</sub> ∈ R, and maintaining . Kadri and Halat provided many examples and applications for such new mixed distributions. In this paper, we introduce a new mixed distribution of the Generalized Erlang distribution, which is derived from the Hypoexponential distribution. We characterize this new distribution by deriving simply closed expressions for the related functions of the probability density function, cumulative distribution function, moment generating function, reliability function, hazard function, and moments.
