In this work we propose efficient codec algorithms for watermarking images that are intended for uploading on the web under intellectual property protection. Headed to this direction, we recently suggested a way in wh...In this work we propose efficient codec algorithms for watermarking images that are intended for uploading on the web under intellectual property protection. Headed to this direction, we recently suggested a way in which an integer number w which being transformed into a self-inverting permutation, can be represented in a two dimensional (2D) object and thus, since images are 2D structures, we have proposed a watermarking algorithm that embeds marks on them using the 2D representation of w in the spatial domain. Based on the idea behind this technique, we now expand the usage of this concept by marking the image in the frequency domain. In particular, we propose a watermarking technique that also uses the 2D representation of self-inverting permutations and utilizes marking at specific areas thanks to partial modifications of the image’s Discrete Fourier Transform (DFT). Those modifications are made on the magnitude of specific frequency bands and they are the least possible additive information ensuring robustness and imperceptiveness. We have experimentally evaluated our algorithms using various images of different characteristics under JPEG compression. The experimental results show an improvement in comparison to the previously obtained results and they also depict the validity of our proposed codec algorithms.展开更多
Fishburn permutations are in bijection with several important combinatorial structures including interval orders.In this paper,we use the method of generating trees to enumerate two classes of pattern-avoiding Fishbur...Fishburn permutations are in bijection with several important combinatorial structures including interval orders.In this paper,we use the method of generating trees to enumerate two classes of pattern-avoiding Fishburn permutations subject to 7 classical statistics simultaneously.The classes of our interest are(321,312)-avoiding and(321,4123)-avoiding Fishburn permutations.The statistics of our interest are ascents,descents,inversions,right-to-left maxima,right-to-left minima,left-to-right maxima and left-to-right minima.Our results generalize a result by Egge.展开更多
In combinatorics, permutations are important objects with many operations. In this paper, we define a coupling product on permutations and prove that the space spanned by permutations is a graded algebra.
The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because o...The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.展开更多
A set of permutations is called sign-balanced if the set contains the same number of even permutations as odd permutations.Let S_(n)(σ_(1),σ_(2),...,σ_(r))denote the set of permutations in the symmetric group S_(n)...A set of permutations is called sign-balanced if the set contains the same number of even permutations as odd permutations.Let S_(n)(σ_(1),σ_(2),...,σ_(r))denote the set of permutations in the symmetric group S_(n)which avoid patternsσ_(1),σ_(2),...,σ_(r).The aim of this paper is to investigate when,for certain patternsσ_(1),σ_(2),...,σ_(r),S_(n)(σ_(1),σ_(2),...,σ_(r))is sign-balanced for every integer n>1.We prove that for any{σ_(1),σ_(2),...,σ_(r)}?S_3,if{σ_(1),σ_(2),...,σ_(r)}is sign-balanced except for{132,213,231,312},then S_(n)(σ_(1),σ_(2),...,σ_(r))is sign-balanced for every integer n>1.In addition,we give some results in the case of avoiding some patterns of length 4.展开更多
Constructing permutation polynomials is a hot topic in finite fields,and permutation polynomials have many applications in dif‐ferent areas.In this paper,by using monomials on the cosets of a subgroup to characterize...Constructing permutation polynomials is a hot topic in finite fields,and permutation polynomials have many applications in dif‐ferent areas.In this paper,by using monomials on the cosets of a subgroup to characterize the permutational property of rational functions onμq+1,we construct a class of permutation quadrinomials with the form f_(r,a,b,c,s,t,u)(x)=x^(r)(1+ax^(s(q-1))+bx^(t(q-1))+cxu(q-1))of F_(q^(2)).展开更多
Quantum algorithms offer more enhanced computational efficiency in comparison to their classical counterparts when solving specific tasks.In this study,we implement the quantum permutation algorithm utilizing a polar ...Quantum algorithms offer more enhanced computational efficiency in comparison to their classical counterparts when solving specific tasks.In this study,we implement the quantum permutation algorithm utilizing a polar molecule within an external electric field.The selection of the molecular qutrit involves the utilization of field-dressed states generated through the pendular modes of SrO.Through the application of multi-target optimal control theory,we strategically design microwave pulses to execute logical operations,including Fourier transform,oracle U_(f)operation,and inverse Fourier transform within a three-level molecular qutrit structure.The observed high fidelity of our outcomes is intricately linked to the concept of the quantum speed limit,which quantifies the maximum speed of quantum state manipulation.Subsequently,we design the optimized pulse sequence to successfully simulate the quantum permutation algorithm on a single SrO molecule,achieving remarkable fidelity.Consequently,a quantum circuit comprising a single qutrit suffices to determine permutation parity with just a single function evaluation.Therefore,our results indicate that the optimal control theory can be well applied to the quantum computation of polar molecular systems.展开更多
The exponential growth of audio data shared over the internet and communication channels has raised significant concerns about the security and privacy of transmitted information.Due to high processing requirements,tr...The exponential growth of audio data shared over the internet and communication channels has raised significant concerns about the security and privacy of transmitted information.Due to high processing requirements,traditional encryption algorithms demand considerable computational effort for real-time audio encryption.To address these challenges,this paper presents a permutation for secure audio encryption using a combination of Tent and 1D logistic maps.The audio data is first shuffled using Tent map for the random permutation.The high random secret key with a length equal to the size of the audio data is then generated using a 1D logistic map.Finally,the Exclusive OR(XOR)operation is applied between the generated key and the shuffled audio to yield the cipher audio.The experimental results prove that the proposed method surpassed the other techniques by encrypting two types of audio files,as mono and stereo audio files with large sizes up to 122 MB,different sample rates 22,050,44,100,48,000,and 96,000 for WAV and 44,100 sample rates for MP3 of size 11 MB.The results show high Mean Square Error(MSE),low Signal-to-Noise Ratio(SNR),spectral distortion,100%Number of Sample Change Rate(NSCR),high Percent Residual Deviation(PRD),low Correlation Coefficient(CC),large key space 2^(616),high sensitivity to a slight change in the secret key and that it can counter several attacks,namely brute force attack,statistical attack,differential attack,and noise attack.展开更多
In this paper,the transferable belief model established on power sets is extended to the permutation event space(PES)and is referred to as the layer-2 transferable belief model.Our goal is to provide a comprehensive a...In this paper,the transferable belief model established on power sets is extended to the permutation event space(PES)and is referred to as the layer-2 transferable belief model.Our goal is to provide a comprehensive approach for handling and modeling uncertainty,capable of representing both quantitative and qualitative information.First,the motivation for proposing the layer-2 transferable belief model and its information processing principles are explored from the perspective of weak propensity.Then,based on these principles,the corresponding information processing methods for the credal and pignistic levels are developed.Finally,the advantages of this model are validated through a classifier that leverages attribute fusion to enhance performance and decision-making accuracy.展开更多
Orthomorphic permutations have good characteristics in cryptosystems. In this paper, by using of knowledge about relation between orthomorphic permutations and multi-output functions, and conceptions of the generalize...Orthomorphic permutations have good characteristics in cryptosystems. In this paper, by using of knowledge about relation between orthomorphic permutations and multi-output functions, and conceptions of the generalized Walsh spectrum of multi-output functions and the auto-correlation function of multi-output functions to investigate the Walsh spectral characteristics and the auto-correlation function characteristics of orthormophic permutations, several results are obtained.展开更多
When solving a mathematical problem, we sometimes encounter a situation where we can not reach a correct answer in spite of acquiring knowledge and formula necessary for the solution. The reason can be attributed to t...When solving a mathematical problem, we sometimes encounter a situation where we can not reach a correct answer in spite of acquiring knowledge and formula necessary for the solution. The reason can be attributed to the lack in metacognitive abilities. Metacognitive abilities consist of comparing the difficulty of problem with own ability, proper plan of solution process, and conscious monitoring and control of solution process. The role and importance of metacognitive ability in mathematical problem solving of permutations and combinations was explored. Participants were required to solve five practical problems related to permutations and combinations. For each problem, the solution process was divided into： （1） understanding （recognition） of mathematical problem; （2） plan of solution; （3） execution of solution. Participants were also required to rate the anticipation whether they could solve it or not, and to rate the confidence of their own answer. According to the total score of five problems, the participants were categorized into the group of the high test score and the group of the low test score. As a result, at the plan and the execution processes, statistically significant differences were detected between the high and the low score groups. As for the rating on the anticipation of result and the confidence of own answer, no significant differences were found between both groups. Moreover, the relationship between the score of plan process and the score of execution process was statistically correlated. In other words, the more proper the plan process was conducted, the more proper solution the participants reached. In such a way, the importance of metacognitive ability in the solving process, especially the plan ability, was suggested.展开更多
Linked partitions were introduced by Dykema(Dykema K J. Multilinear function series and transforms in free probability theory. Adv. Math., 2005, 208(1):351–407) in the study of the unsymmetrized T-transform in free p...Linked partitions were introduced by Dykema(Dykema K J. Multilinear function series and transforms in free probability theory. Adv. Math., 2005, 208(1):351–407) in the study of the unsymmetrized T-transform in free probability theory.Permutation is one of the most classical combinatorial structures. According to the linear representation of linked partitions, Chen et al.(Chen W Y C, Wu S Y J, Yan C H. Linked partitions and linked cycles. European J. Combin., 2008, 29(6): 1408–1426) de?ned the concept of singly covered minimal elements. Let L(n, k) denote the set of linked partitions of [n] with k singly covered minimal elements and let P(n, k) denote the set of permutations of [n] with k cycles. In this paper, we mainly establish two bijections between L(n, k) and P(n, k). The two bijections from a different perspective show the one-to-one correspondence between the singly covered minimal elements in L(n, k) and the cycles in P(n, k).展开更多
In this paper, a sufficient and necessary condition of quick trickle permutations is given from the point of inverse permutations. The bridge is built between quick trickle permutations and m-value logic functions. By...In this paper, a sufficient and necessary condition of quick trickle permutations is given from the point of inverse permutations. The bridge is built between quick trickle permutations and m-value logic functions. By the methods of the Chrestenson spectrum of m-value logic functions and the auto-correlation function of m-value logic functions to investigate the Chrestenson spectral characteristics and the auto-correlation function charac- teristics of inverse permutations of quick trickle permutations, a determinant arithmetic of quick trickle permutations is given. Using the results, it becomes easy to judge that a permutation is a quick trickle permutation or not by using computer. This gives a new pathway to study constructions and enumerations of quick trickle permutations.展开更多
Permutation polynomials is a hot topic in finite fields,they have many applications in different areas.Permutation binomials and trinomials over finite fields were studied recently.In thispaper,by using a powerful lem...Permutation polynomials is a hot topic in finite fields,they have many applications in different areas.Permutation binomials and trinomials over finite fields were studied recently.In thispaper,by using a powerful lemma given by Zieve and some degree 5 and 6 permutation polynomials over Fq,we construct somepermutation binomials over Fqm.展开更多
Let n be a positive integer. A permutation a of the symmetric group of permutations of is called a derangement if for each . Suppose that x and y are two arbitrary permutations of . We say that...Let n be a positive integer. A permutation a of the symmetric group of permutations of is called a derangement if for each . Suppose that x and y are two arbitrary permutations of . We say that a permutation a is a double derangement with respect to x and y if and for each . In this paper, we give an explicit formula for , the number of double derangements with respect to x and y. Let and let and be two subsets of with and . Suppose that denotes the number of derangements x such that . As the main result, we show that if and z is a permutation such that for and for , then where .展开更多
Addressing the challenges posed by the nonlinear and non-stationary vibrations in rotating machinery,where weak fault characteristic signals hinder accurate fault state representation,we propose a novel feature extrac...Addressing the challenges posed by the nonlinear and non-stationary vibrations in rotating machinery,where weak fault characteristic signals hinder accurate fault state representation,we propose a novel feature extraction method that combines the Flexible Analytic Wavelet Transform(FAWT)with Nonlinear Quantum Permutation Entropy.FAWT,leveraging fractional orders and arbitrary scaling and translation factors,exhibits superior translational invariance and adjustable fundamental oscillatory characteristics.This flexibility enables FAWT to provide well-suited wavelet shapes,effectively matching subtle fault components and avoiding performance degradation associated with fixed frequency partitioning and low-oscillation bases in detecting weak faults.In our approach,gearbox vibration signals undergo FAWT to obtain sub-bands.Quantum theory is then introduced into permutation entropy to propose Nonlinear Quantum Permutation Entropy,a feature that more accurately characterizes the operational state of vibration simulation signals.The nonlinear quantum permutation entropy extracted from sub-bands is utilized to characterize the operating state of rotating machinery.A comprehensive analysis of vibration signals from rolling bearings and gearboxes validates the feasibility of the proposed method.Comparative assessments with parameters derived from traditional permutation entropy,sample entropy,wavelet transform(WT),and empirical mode decomposition(EMD)underscore the superior effectiveness of this approach in fault detection and classification for rotating machinery.展开更多
In this paper,we define a new class of control functions through aggregate special functions.These class of control functions help us to stabilize and approximate a tri-additiveψ-functional inequality to get a better...In this paper,we define a new class of control functions through aggregate special functions.These class of control functions help us to stabilize and approximate a tri-additiveψ-functional inequality to get a better estimation for permuting tri-homomorphisms and permuting tri-derivations in unital C*-algebras and Banach algebras by the vector-valued alternative fixed point theorem.展开更多
This paper design the P-permutation with cryptologic properties beyond certain bound based on BCH code and Goppa code, which is the generalization of the design method utilizing the maximum distance separable （MDS） ...This paper design the P-permutation with cryptologic properties beyond certain bound based on BCH code and Goppa code, which is the generalization of the design method utilizing the maximum distance separable （MDS） code, and presents the novel algorithms to generate the P-permutations with the branch number no less than a preset low bound. The new generation algorithms provide a theoretical basis for automation design of the cryptosystem.展开更多
We explore the entanglement features of pure symmetric N-qubit states characterized by N-distinct spinors with a particular focus on the Greenberger-Horne-Zeilinger (GHZ) states and , an equal superposition of W and o...We explore the entanglement features of pure symmetric N-qubit states characterized by N-distinct spinors with a particular focus on the Greenberger-Horne-Zeilinger (GHZ) states and , an equal superposition of W and obverse W states. Along with a comparison of pairwise entanglement and monogamy properties, we explore the geometric information contained in them by constructing their canonical steering ellipsoids. We obtain the volume monogamy relations satisfied by states as a function of number of qubits and compare with the maximal monogamy property of GHZ states.展开更多
In the manufacturing industry,reasonable scheduling can greatly improve production efficiency,while excessive resource consumption highlights the growing significance of energy conservation in production.This paper st...In the manufacturing industry,reasonable scheduling can greatly improve production efficiency,while excessive resource consumption highlights the growing significance of energy conservation in production.This paper studies the problem of energy-efficient distributed heterogeneous permutation flowshop problem with variable processing speed(DHPFSP-VPS),considering both the minimum makespan and total energy consumption(TEC)as objectives.A discrete multi-objective squirrel search algorithm(DMSSA)is proposed to solve the DHPFSPVPS.DMSSA makes four improvements based on the squirrel search algorithm.Firstly,in terms of the population initialization strategy,four hybrid initialization methods targeting different objectives are proposed to enhance the quality of initial solutions.Secondly,enhancements are made to the population hierarchy system and position updating methods of the squirrel search algorithm,making it more suitable for discrete scheduling problems.Additionally,regarding the search strategy,six local searches are designed based on problem characteristics to enhance search capability.Moreover,a dynamic predator strategy based on Q-learning is devised to effectively balance DMSSA’s capability for global exploration and local exploitation.Finally,two speed control energy-efficient strategies are designed to reduce TEC.Extensive comparative experiments are conducted in this paper to validate the effectiveness of the proposed strategies.The results of comparing DMSSA with other algorithms demonstrate its superior performance and its potential for efficient solving of the DHPFSP-VPS problem.展开更多
文摘In this work we propose efficient codec algorithms for watermarking images that are intended for uploading on the web under intellectual property protection. Headed to this direction, we recently suggested a way in which an integer number w which being transformed into a self-inverting permutation, can be represented in a two dimensional (2D) object and thus, since images are 2D structures, we have proposed a watermarking algorithm that embeds marks on them using the 2D representation of w in the spatial domain. Based on the idea behind this technique, we now expand the usage of this concept by marking the image in the frequency domain. In particular, we propose a watermarking technique that also uses the 2D representation of self-inverting permutations and utilizes marking at specific areas thanks to partial modifications of the image’s Discrete Fourier Transform (DFT). Those modifications are made on the magnitude of specific frequency bands and they are the least possible additive information ensuring robustness and imperceptiveness. We have experimentally evaluated our algorithms using various images of different characteristics under JPEG compression. The experimental results show an improvement in comparison to the previously obtained results and they also depict the validity of our proposed codec algorithms.
基金National Natural Science Foundation of China(Grant No.12171362)。
文摘Fishburn permutations are in bijection with several important combinatorial structures including interval orders.In this paper,we use the method of generating trees to enumerate two classes of pattern-avoiding Fishburn permutations subject to 7 classical statistics simultaneously.The classes of our interest are(321,312)-avoiding and(321,4123)-avoiding Fishburn permutations.The statistics of our interest are ascents,descents,inversions,right-to-left maxima,right-to-left minima,left-to-right maxima and left-to-right minima.Our results generalize a result by Egge.
文摘In combinatorics, permutations are important objects with many operations. In this paper, we define a coupling product on permutations and prove that the space spanned by permutations is a graded algebra.
基金supported in part by the National Key Research and Development Program of China under Grant No.2021YFF0901300in part by the National Natural Science Foundation of China under Grant Nos.62173076 and 72271048.
文摘The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.
基金Supported by the National Natural Science Foundation of China(Grant No.12061030)the Natural Science Foundation of Hainan Province(Grant No.122RC652)2023 Excellent Science and Technology Innovation Team of Jiangsu Province Universities(Real-Time Industrial Internet of Things).
文摘A set of permutations is called sign-balanced if the set contains the same number of even permutations as odd permutations.Let S_(n)(σ_(1),σ_(2),...,σ_(r))denote the set of permutations in the symmetric group S_(n)which avoid patternsσ_(1),σ_(2),...,σ_(r).The aim of this paper is to investigate when,for certain patternsσ_(1),σ_(2),...,σ_(r),S_(n)(σ_(1),σ_(2),...,σ_(r))is sign-balanced for every integer n>1.We prove that for any{σ_(1),σ_(2),...,σ_(r)}?S_3,if{σ_(1),σ_(2),...,σ_(r)}is sign-balanced except for{132,213,231,312},then S_(n)(σ_(1),σ_(2),...,σ_(r))is sign-balanced for every integer n>1.In addition,we give some results in the case of avoiding some patterns of length 4.
基金Supported by the National Natural Science Foundation of China(11926344)Science and Technology Research Program of Chongqing Municipal Education Commission(KJZD-K202401601)+1 种基金Doctor Talent Program of Chongqing University of Education(2023BSRC003)Undergraduate Science Research Program of Chongqing University of Education(KY20240046)。
文摘Constructing permutation polynomials is a hot topic in finite fields,and permutation polynomials have many applications in dif‐ferent areas.In this paper,by using monomials on the cosets of a subgroup to characterize the permutational property of rational functions onμq+1,we construct a class of permutation quadrinomials with the form f_(r,a,b,c,s,t,u)(x)=x^(r)(1+ax^(s(q-1))+bx^(t(q-1))+cxu(q-1))of F_(q^(2)).
基金supported by the National Natural Science Foundation of China under Grant Nos.92265209,11174081 and 62305285the Natural Science Foundation of Chongqing under Grant No.CSTB2024NSCQ-MSX0643the Shanghai Municipal Science and Technology Major Project under Grant No.2019SHZDZX01。
文摘Quantum algorithms offer more enhanced computational efficiency in comparison to their classical counterparts when solving specific tasks.In this study,we implement the quantum permutation algorithm utilizing a polar molecule within an external electric field.The selection of the molecular qutrit involves the utilization of field-dressed states generated through the pendular modes of SrO.Through the application of multi-target optimal control theory,we strategically design microwave pulses to execute logical operations,including Fourier transform,oracle U_(f)operation,and inverse Fourier transform within a three-level molecular qutrit structure.The observed high fidelity of our outcomes is intricately linked to the concept of the quantum speed limit,which quantifies the maximum speed of quantum state manipulation.Subsequently,we design the optimized pulse sequence to successfully simulate the quantum permutation algorithm on a single SrO molecule,achieving remarkable fidelity.Consequently,a quantum circuit comprising a single qutrit suffices to determine permutation parity with just a single function evaluation.Therefore,our results indicate that the optimal control theory can be well applied to the quantum computation of polar molecular systems.
文摘The exponential growth of audio data shared over the internet and communication channels has raised significant concerns about the security and privacy of transmitted information.Due to high processing requirements,traditional encryption algorithms demand considerable computational effort for real-time audio encryption.To address these challenges,this paper presents a permutation for secure audio encryption using a combination of Tent and 1D logistic maps.The audio data is first shuffled using Tent map for the random permutation.The high random secret key with a length equal to the size of the audio data is then generated using a 1D logistic map.Finally,the Exclusive OR(XOR)operation is applied between the generated key and the shuffled audio to yield the cipher audio.The experimental results prove that the proposed method surpassed the other techniques by encrypting two types of audio files,as mono and stereo audio files with large sizes up to 122 MB,different sample rates 22,050,44,100,48,000,and 96,000 for WAV and 44,100 sample rates for MP3 of size 11 MB.The results show high Mean Square Error(MSE),low Signal-to-Noise Ratio(SNR),spectral distortion,100%Number of Sample Change Rate(NSCR),high Percent Residual Deviation(PRD),low Correlation Coefficient(CC),large key space 2^(616),high sensitivity to a slight change in the secret key and that it can counter several attacks,namely brute force attack,statistical attack,differential attack,and noise attack.
文摘In this paper,the transferable belief model established on power sets is extended to the permutation event space(PES)and is referred to as the layer-2 transferable belief model.Our goal is to provide a comprehensive approach for handling and modeling uncertainty,capable of representing both quantitative and qualitative information.First,the motivation for proposing the layer-2 transferable belief model and its information processing principles are explored from the perspective of weak propensity.Then,based on these principles,the corresponding information processing methods for the credal and pignistic levels are developed.Finally,the advantages of this model are validated through a classifier that leverages attribute fusion to enhance performance and decision-making accuracy.
基金Supported by State Key Laboratory of InformationSecurity Opening Foundation(01-02) .
文摘Orthomorphic permutations have good characteristics in cryptosystems. In this paper, by using of knowledge about relation between orthomorphic permutations and multi-output functions, and conceptions of the generalized Walsh spectrum of multi-output functions and the auto-correlation function of multi-output functions to investigate the Walsh spectral characteristics and the auto-correlation function characteristics of orthormophic permutations, several results are obtained.
文摘When solving a mathematical problem, we sometimes encounter a situation where we can not reach a correct answer in spite of acquiring knowledge and formula necessary for the solution. The reason can be attributed to the lack in metacognitive abilities. Metacognitive abilities consist of comparing the difficulty of problem with own ability, proper plan of solution process, and conscious monitoring and control of solution process. The role and importance of metacognitive ability in mathematical problem solving of permutations and combinations was explored. Participants were required to solve five practical problems related to permutations and combinations. For each problem, the solution process was divided into： （1） understanding （recognition） of mathematical problem; （2） plan of solution; （3） execution of solution. Participants were also required to rate the anticipation whether they could solve it or not, and to rate the confidence of their own answer. According to the total score of five problems, the participants were categorized into the group of the high test score and the group of the low test score. As a result, at the plan and the execution processes, statistically significant differences were detected between the high and the low score groups. As for the rating on the anticipation of result and the confidence of own answer, no significant differences were found between both groups. Moreover, the relationship between the score of plan process and the score of execution process was statistically correlated. In other words, the more proper the plan process was conducted, the more proper solution the participants reached. In such a way, the importance of metacognitive ability in the solving process, especially the plan ability, was suggested.
基金The NSF(11601020,11501014) of China2017 Commercial Specialty Project(19005757053) of BTBU2018 Postgraduate Research Capacity Improvement Project(19008001491) of BTBU
文摘Linked partitions were introduced by Dykema(Dykema K J. Multilinear function series and transforms in free probability theory. Adv. Math., 2005, 208(1):351–407) in the study of the unsymmetrized T-transform in free probability theory.Permutation is one of the most classical combinatorial structures. According to the linear representation of linked partitions, Chen et al.(Chen W Y C, Wu S Y J, Yan C H. Linked partitions and linked cycles. European J. Combin., 2008, 29(6): 1408–1426) de?ned the concept of singly covered minimal elements. Let L(n, k) denote the set of linked partitions of [n] with k singly covered minimal elements and let P(n, k) denote the set of permutations of [n] with k cycles. In this paper, we mainly establish two bijections between L(n, k) and P(n, k). The two bijections from a different perspective show the one-to-one correspondence between the singly covered minimal elements in L(n, k) and the cycles in P(n, k).
基金the Opening Foundation of State Key Labo-ratory of Information Security (20050102)
文摘In this paper, a sufficient and necessary condition of quick trickle permutations is given from the point of inverse permutations. The bridge is built between quick trickle permutations and m-value logic functions. By the methods of the Chrestenson spectrum of m-value logic functions and the auto-correlation function of m-value logic functions to investigate the Chrestenson spectral characteristics and the auto-correlation function charac- teristics of inverse permutations of quick trickle permutations, a determinant arithmetic of quick trickle permutations is given. Using the results, it becomes easy to judge that a permutation is a quick trickle permutation or not by using computer. This gives a new pathway to study constructions and enumerations of quick trickle permutations.
基金Supported Partially by the National Natural Science Foundation of China(11926344)Science and Technology Research Projects of Chongqing Municipal Education Commission(KJQN201901402,KJQN201900506)Fund Project of Chongqing Normal University(17XWB021)。
文摘Permutation polynomials is a hot topic in finite fields,they have many applications in different areas.Permutation binomials and trinomials over finite fields were studied recently.In thispaper,by using a powerful lemma given by Zieve and some degree 5 and 6 permutation polynomials over Fq,we construct somepermutation binomials over Fqm.
文摘Let n be a positive integer. A permutation a of the symmetric group of permutations of is called a derangement if for each . Suppose that x and y are two arbitrary permutations of . We say that a permutation a is a double derangement with respect to x and y if and for each . In this paper, we give an explicit formula for , the number of double derangements with respect to x and y. Let and let and be two subsets of with and . Suppose that denotes the number of derangements x such that . As the main result, we show that if and z is a permutation such that for and for , then where .
基金supported financially by FundamentalResearch Program of Shanxi Province(No.202103021223056).
文摘Addressing the challenges posed by the nonlinear and non-stationary vibrations in rotating machinery,where weak fault characteristic signals hinder accurate fault state representation,we propose a novel feature extraction method that combines the Flexible Analytic Wavelet Transform(FAWT)with Nonlinear Quantum Permutation Entropy.FAWT,leveraging fractional orders and arbitrary scaling and translation factors,exhibits superior translational invariance and adjustable fundamental oscillatory characteristics.This flexibility enables FAWT to provide well-suited wavelet shapes,effectively matching subtle fault components and avoiding performance degradation associated with fixed frequency partitioning and low-oscillation bases in detecting weak faults.In our approach,gearbox vibration signals undergo FAWT to obtain sub-bands.Quantum theory is then introduced into permutation entropy to propose Nonlinear Quantum Permutation Entropy,a feature that more accurately characterizes the operational state of vibration simulation signals.The nonlinear quantum permutation entropy extracted from sub-bands is utilized to characterize the operating state of rotating machinery.A comprehensive analysis of vibration signals from rolling bearings and gearboxes validates the feasibility of the proposed method.Comparative assessments with parameters derived from traditional permutation entropy,sample entropy,wavelet transform(WT),and empirical mode decomposition(EMD)underscore the superior effectiveness of this approach in fault detection and classification for rotating machinery.
基金partially supported by the Natural Sciences and Engineering Research Council of Canada(2019-03907)。
文摘In this paper,we define a new class of control functions through aggregate special functions.These class of control functions help us to stabilize and approximate a tri-additiveψ-functional inequality to get a better estimation for permuting tri-homomorphisms and permuting tri-derivations in unital C*-algebras and Banach algebras by the vector-valued alternative fixed point theorem.
基金Supported by the National Natural Science Foundation of China (60673071, 60970115, 60970116)
文摘This paper design the P-permutation with cryptologic properties beyond certain bound based on BCH code and Goppa code, which is the generalization of the design method utilizing the maximum distance separable （MDS） code, and presents the novel algorithms to generate the P-permutations with the branch number no less than a preset low bound. The new generation algorithms provide a theoretical basis for automation design of the cryptosystem.
文摘We explore the entanglement features of pure symmetric N-qubit states characterized by N-distinct spinors with a particular focus on the Greenberger-Horne-Zeilinger (GHZ) states and , an equal superposition of W and obverse W states. Along with a comparison of pairwise entanglement and monogamy properties, we explore the geometric information contained in them by constructing their canonical steering ellipsoids. We obtain the volume monogamy relations satisfied by states as a function of number of qubits and compare with the maximal monogamy property of GHZ states.
基金supported by the Key Research and Development Project of Hubei Province(Nos.2020BAB114 and 2023BAB094).
文摘In the manufacturing industry,reasonable scheduling can greatly improve production efficiency,while excessive resource consumption highlights the growing significance of energy conservation in production.This paper studies the problem of energy-efficient distributed heterogeneous permutation flowshop problem with variable processing speed(DHPFSP-VPS),considering both the minimum makespan and total energy consumption(TEC)as objectives.A discrete multi-objective squirrel search algorithm(DMSSA)is proposed to solve the DHPFSPVPS.DMSSA makes four improvements based on the squirrel search algorithm.Firstly,in terms of the population initialization strategy,four hybrid initialization methods targeting different objectives are proposed to enhance the quality of initial solutions.Secondly,enhancements are made to the population hierarchy system and position updating methods of the squirrel search algorithm,making it more suitable for discrete scheduling problems.Additionally,regarding the search strategy,six local searches are designed based on problem characteristics to enhance search capability.Moreover,a dynamic predator strategy based on Q-learning is devised to effectively balance DMSSA’s capability for global exploration and local exploitation.Finally,two speed control energy-efficient strategies are designed to reduce TEC.Extensive comparative experiments are conducted in this paper to validate the effectiveness of the proposed strategies.The results of comparing DMSSA with other algorithms demonstrate its superior performance and its potential for efficient solving of the DHPFSP-VPS problem.
