This paper studies the problem of functional inequalities for analytic functions in classical geometric function theory.Using the di erential subordination principle and(p,q)-derivative operator,it introduces(p,q)-ana...This paper studies the problem of functional inequalities for analytic functions in classical geometric function theory.Using the di erential subordination principle and(p,q)-derivative operator,it introduces(p,q)-analog of a class of multivalently Bazilevic functions as-sociated with a limacon function,and obtains the corresponding coefficient estimates and the Fekete-Szego inequality,which extend and improve the related results for starlike functions,even q-starlike functions.展开更多
In this paper, the author analyzed some cryptographic properties of a class of logical functions, f(x,y)=(q(x),...,q(x))·y+h(x),over Galois rings and residue rings, presented the relationship between the characte...In this paper, the author analyzed some cryptographic properties of a class of logical functions, f(x,y)=(q(x),...,q(x))·y+h(x),over Galois rings and residue rings, presented the relationship between the character spectrum of f(x,y) and the character speetrum of q(x),h(x) and the relationship between the cryptographic properties of f(x,y) and the cryptographic properties of h(x).展开更多
A new set of binary sequences-Periodic Complementary Binary Sequence Pair (PCSP) is proposed. A new class of block design-Difference Family Pair (DFP) is also proposed.The relationship between PCSP and DFP, the proper...A new set of binary sequences-Periodic Complementary Binary Sequence Pair (PCSP) is proposed. A new class of block design-Difference Family Pair (DFP) is also proposed.The relationship between PCSP and DFP, the properties and existing conditions of PCSP and the recursive constructions for PCSP are given.展开更多
This paper proposes a practical algorithm for systematically generating strong Boolean functions (f:GF(2) n →GF(2)) with cryptographic meaning. This algorithm takes bent function as input and directly outputs the res...This paper proposes a practical algorithm for systematically generating strong Boolean functions (f:GF(2) n →GF(2)) with cryptographic meaning. This algorithm takes bent function as input and directly outputs the resulted Boolean function in terms of truth table sequence. This algorithm was used to develop two classes of balanced Boolean functions, one of which has very good cryptographic properties:nl(f)=2 2k?1?2k+2k?2 (n=2k), with the sum-of-squares avalanche characteristic off satisfying σf=24k+23k+2+23k-2 and the absolute avalanche characteristic off satisfying σf=24k+23k+2+23k-2. This is the best result up to now compared to existing ones. Instead of bent sequences, starting from random Boolean functions was also tested in the algorithm. Experimental results showed that starting from bent sequences is highly superior to starting from random Boolean functions. Key words Boolean functions - Bent sequences - Nonlinearity - GAC - PC - Balancedness Document code A CLC number TP301.6展开更多
One of the advantages of the variational iteration method is the free choice of initial guess. In this paper we use the basic idea of the Jacobian-function method to construct a generalized trial function with some un...One of the advantages of the variational iteration method is the free choice of initial guess. In this paper we use the basic idea of the Jacobian-function method to construct a generalized trial function with some unknown parameters. The Jaulent-Miodek equations are used to illustrate effectiveness and convenience of this method, some new explicit exact travelling wave solutions have been obtained, which include bell-type soliton solution, kink-type soliton solutions, solitary wave solutions, and doubly periodic wave solutions.展开更多
In this paper,dependent and independent variable transformations are introduced to solve the Degasperis-Procesi equation.It is shown that different kinds of solutions can be obtained to the Degasperis-Procesi equation.
A new authentication scheme based on a one-way hash function and Diffie-Hellman key exchange using smart card was propused by Yoon et al. in 2005. They claimed that the proposed protocol is against password guessing a...A new authentication scheme based on a one-way hash function and Diffie-Hellman key exchange using smart card was propused by Yoon et al. in 2005. They claimed that the proposed protocol is against password guessing attack. In this paper, the author demonstrate that Yoon's scheme is vulnerable to the off-line password guessing attack by using a stolen smart card and the DoS attack by computational load at the re, note system. An improvement of Yoon's scheme to resist the above attacks is also proposed.展开更多
The authors investigate the problem of impulse control of a partially observed diffusion process. The authors study the impulse control of Zakai type equations. The associated value function is characterized as the on...The authors investigate the problem of impulse control of a partially observed diffusion process. The authors study the impulse control of Zakai type equations. The associated value function is characterized as the only viscosity solution of the corresponding quasi-variational inequality. The authors show the optimal cost function for the problem with incomplete information can be approximated by a sequence of value functions of the previous type.展开更多
In this paper, we consider the regularity of solution in S for Zakharov-Kuznestov equation in H^s(s>2). Meanwhile, by method of undetermined coefficient we prove that there don't exist and conservative integral...In this paper, we consider the regularity of solution in S for Zakharov-Kuznestov equation in H^s(s>2). Meanwhile, by method of undetermined coefficient we prove that there don't exist and conservative integral include 2 order of higher order derived functions.展开更多
Accuracy of a simulation strongly depends on the grid quality. Here, quality means orthogonality at the boundaries and quasi-orthogonality within the critical regions, smoothness, bounded aspect ratios and solution ad...Accuracy of a simulation strongly depends on the grid quality. Here, quality means orthogonality at the boundaries and quasi-orthogonality within the critical regions, smoothness, bounded aspect ratios and solution adaptive behaviour. It is not recommended to refine the parts of the domain where the solution shows little variation. It is desired to concentrate grid points and cells in the part of the domain where the solution shows strong gradients or variations. We present a simple, effective and com- putationally efficient approach for quadrilateral mesh adaptation. Several numerical examples are presented for supporting our claim.展开更多
The idea of difference sequence spaces was introduced in (Klzmaz, 1981) and this concept was generalized in (Et and Colak, 1995). In this paper we define some difference sequence spaces by a sequence of Orlicz fun...The idea of difference sequence spaces was introduced in (Klzmaz, 1981) and this concept was generalized in (Et and Colak, 1995). In this paper we define some difference sequence spaces by a sequence of Orlicz functions and establish some inclusion relations.展开更多
With results on the infinite servers queue systems with Poisson arrivals - M|G|∞ queues - busy period, it is displayed an application of those queue systems in the unemployment periods time length parameters and di...With results on the infinite servers queue systems with Poisson arrivals - M|G|∞ queues - busy period, it is displayed an application of those queue systems in the unemployment periods time length parameters and distribution function study. These queue systems are adequate to the study of many population processes, and this quality is brought in here. The results presented are mainly on unemployment periods length and their number in a certain time interval. Also, some questions regarding the practical applications of the outlined formulas are briefly discussed.展开更多
Two or more sequences are called an Odd-Periodic Complementary binary sequences Set (OPCS) if the sum of their respective odd-periodic autocorrelation function is a delta function. In this paper, the definition of OPC...Two or more sequences are called an Odd-Periodic Complementary binary sequences Set (OPCS) if the sum of their respective odd-periodic autocorrelation function is a delta function. In this paper, the definition of OPCS is given and the construction method of OPCS is discussed. The relation of the OPCS with the Periodic Complementary binary sequences Set (PCS) is pointed out, and some new PCSs are obtained based on such relation.展开更多
A class of new PN sequence with prime number periods of 4t +1 form (t is an integer)is constructed.The advantage of these PN sequencs over the m(M) sequence is their large number of alternative periods.They hav...A class of new PN sequence with prime number periods of 4t +1 form (t is an integer)is constructed.The advantage of these PN sequencs over the m(M) sequence is their large number of alternative periods.They have good pseudo random characteristics demonstrated by the expression of periodic autocorrelation function found out in this paper.展开更多
In present article a number of results are described in a systematic way concerning both signal and image processing problems with respect to atomic functions theory and Prouhet-Tbue-Morse sequence.
A new algorithm for a novel hash function, based on chaotic tent map with changeable parameter, is proposed and analyzed. The one dimensional and piecewise tent map with changeable parameters decided by the position i...A new algorithm for a novel hash function, based on chaotic tent map with changeable parameter, is proposed and analyzed. The one dimensional and piecewise tent map with changeable parameters decided by the position index of blocked messages is chosen, and blocked massages translated into ASCII code values are employed as the iteration time of the chaotic tent map. The final 128-bit hash value is generated by logical XOR operation on intermediate hash values. Theoretical analysis and computer simulation indicate that the proposed algorithm can satisfy the performance requirements of hash function.展开更多
In this paper, we introduce and study the concept of lacunary invariant convergence for sequences of sets with respect to modulus functionfand give some inclusion relations.
A projected skill is adopted by use of the differential evolution (DE) algorithm to calculate a conditional nonlinear optimal perturbation (CNOP). The CNOP is the maximal value of a constrained optimization problem wi...A projected skill is adopted by use of the differential evolution (DE) algorithm to calculate a conditional nonlinear optimal perturbation (CNOP). The CNOP is the maximal value of a constrained optimization problem with a constraint condition, such as a ball constraint. The success of the DE algorithm lies in its ability to handle a non-differentiable and nonlinear cost function. In this study, the DE algorithm and the traditional optimization algorithms used to obtain the CNOPs are compared by analyzing a theoretical grassland ecosystem model and a dynamic global vegetation model. This study shows that the CNOPs generated by the DE algorithm are similar to those by the sequential quadratic programming (SQP) algorithm and the spectral projected gradients (SPG2) algorithm. If the cost function is non-differentiable, the CNOPs could also be caught with the DE algorithm. The numerical results suggest the DE algorithm can be employed to calculate the CNOP, especially when the cost function is non-differentiable.展开更多
Boolean or switching functions can be associated to finite aligned spaces in a way similar to the way they can be associated to finite topological spaces. We prove a characterization of switching functions associated ...Boolean or switching functions can be associated to finite aligned spaces in a way similar to the way they can be associated to finite topological spaces. We prove a characterization of switching functions associated to aligned spaces which is similar to the one we have given for switching functions associated to finite topological spaces.展开更多
基金Supported by Natural Science Foundation of Ningxia(2023AAC 03001)Natural Science Foundation of China(12261068)
文摘This paper studies the problem of functional inequalities for analytic functions in classical geometric function theory.Using the di erential subordination principle and(p,q)-derivative operator,it introduces(p,q)-analog of a class of multivalently Bazilevic functions as-sociated with a limacon function,and obtains the corresponding coefficient estimates and the Fekete-Szego inequality,which extend and improve the related results for starlike functions,even q-starlike functions.
文摘In this paper, the author analyzed some cryptographic properties of a class of logical functions, f(x,y)=(q(x),...,q(x))·y+h(x),over Galois rings and residue rings, presented the relationship between the character spectrum of f(x,y) and the character speetrum of q(x),h(x) and the relationship between the cryptographic properties of f(x,y) and the cryptographic properties of h(x).
基金Supported by National Natural Science Foundation of China (69972042),Natural Science Fund of Hebei Provice(599245)and Science Foundation of Yanshan University
文摘A new set of binary sequences-Periodic Complementary Binary Sequence Pair (PCSP) is proposed. A new class of block design-Difference Family Pair (DFP) is also proposed.The relationship between PCSP and DFP, the properties and existing conditions of PCSP and the recursive constructions for PCSP are given.
文摘This paper proposes a practical algorithm for systematically generating strong Boolean functions (f:GF(2) n →GF(2)) with cryptographic meaning. This algorithm takes bent function as input and directly outputs the resulted Boolean function in terms of truth table sequence. This algorithm was used to develop two classes of balanced Boolean functions, one of which has very good cryptographic properties:nl(f)=2 2k?1?2k+2k?2 (n=2k), with the sum-of-squares avalanche characteristic off satisfying σf=24k+23k+2+23k-2 and the absolute avalanche characteristic off satisfying σf=24k+23k+2+23k-2. This is the best result up to now compared to existing ones. Instead of bent sequences, starting from random Boolean functions was also tested in the algorithm. Experimental results showed that starting from bent sequences is highly superior to starting from random Boolean functions. Key words Boolean functions - Bent sequences - Nonlinearity - GAC - PC - Balancedness Document code A CLC number TP301.6
基金National Natural Science Foundation of China under Grant No.10172056
文摘One of the advantages of the variational iteration method is the free choice of initial guess. In this paper we use the basic idea of the Jacobian-function method to construct a generalized trial function with some unknown parameters. The Jaulent-Miodek equations are used to illustrate effectiveness and convenience of this method, some new explicit exact travelling wave solutions have been obtained, which include bell-type soliton solution, kink-type soliton solutions, solitary wave solutions, and doubly periodic wave solutions.
基金National Natural Science Foundation of China under Grant Nos.40775040 and 90511009
文摘In this paper,dependent and independent variable transformations are introduced to solve the Degasperis-Procesi equation.It is shown that different kinds of solutions can be obtained to the Degasperis-Procesi equation.
文摘A new authentication scheme based on a one-way hash function and Diffie-Hellman key exchange using smart card was propused by Yoon et al. in 2005. They claimed that the proposed protocol is against password guessing attack. In this paper, the author demonstrate that Yoon's scheme is vulnerable to the off-line password guessing attack by using a stolen smart card and the DoS attack by computational load at the re, note system. An improvement of Yoon's scheme to resist the above attacks is also proposed.
文摘The authors investigate the problem of impulse control of a partially observed diffusion process. The authors study the impulse control of Zakai type equations. The associated value function is characterized as the only viscosity solution of the corresponding quasi-variational inequality. The authors show the optimal cost function for the problem with incomplete information can be approximated by a sequence of value functions of the previous type.
文摘In this paper, we consider the regularity of solution in S for Zakharov-Kuznestov equation in H^s(s>2). Meanwhile, by method of undetermined coefficient we prove that there don't exist and conservative integral include 2 order of higher order derived functions.
文摘Accuracy of a simulation strongly depends on the grid quality. Here, quality means orthogonality at the boundaries and quasi-orthogonality within the critical regions, smoothness, bounded aspect ratios and solution adaptive behaviour. It is not recommended to refine the parts of the domain where the solution shows little variation. It is desired to concentrate grid points and cells in the part of the domain where the solution shows strong gradients or variations. We present a simple, effective and com- putationally efficient approach for quadrilateral mesh adaptation. Several numerical examples are presented for supporting our claim.
文摘The idea of difference sequence spaces was introduced in (Klzmaz, 1981) and this concept was generalized in (Et and Colak, 1995). In this paper we define some difference sequence spaces by a sequence of Orlicz functions and establish some inclusion relations.
文摘With results on the infinite servers queue systems with Poisson arrivals - M|G|∞ queues - busy period, it is displayed an application of those queue systems in the unemployment periods time length parameters and distribution function study. These queue systems are adequate to the study of many population processes, and this quality is brought in here. The results presented are mainly on unemployment periods length and their number in a certain time interval. Also, some questions regarding the practical applications of the outlined formulas are briefly discussed.
文摘Two or more sequences are called an Odd-Periodic Complementary binary sequences Set (OPCS) if the sum of their respective odd-periodic autocorrelation function is a delta function. In this paper, the definition of OPCS is given and the construction method of OPCS is discussed. The relation of the OPCS with the Periodic Complementary binary sequences Set (PCS) is pointed out, and some new PCSs are obtained based on such relation.
文摘A class of new PN sequence with prime number periods of 4t +1 form (t is an integer)is constructed.The advantage of these PN sequencs over the m(M) sequence is their large number of alternative periods.They have good pseudo random characteristics demonstrated by the expression of periodic autocorrelation function found out in this paper.
基金Russian Foundation for Basic Research(No.130212065)
文摘In present article a number of results are described in a systematic way concerning both signal and image processing problems with respect to atomic functions theory and Prouhet-Tbue-Morse sequence.
基金Supported by the National Natural Science Foundation of China (No. 61173178, 61003247, 61070246) and the Fundamental Research Funds for the Central University (No. COJER1018002,cdjerl018003).
文摘A new algorithm for a novel hash function, based on chaotic tent map with changeable parameter, is proposed and analyzed. The one dimensional and piecewise tent map with changeable parameters decided by the position index of blocked messages is chosen, and blocked massages translated into ASCII code values are employed as the iteration time of the chaotic tent map. The final 128-bit hash value is generated by logical XOR operation on intermediate hash values. Theoretical analysis and computer simulation indicate that the proposed algorithm can satisfy the performance requirements of hash function.
文摘In this paper, we introduce and study the concept of lacunary invariant convergence for sequences of sets with respect to modulus functionfand give some inclusion relations.
基金provided by grants from the National Basic Research Program of China (Grant No. 2006CB400503)LASG Free Exploration Fund+1 种基金LASG State Key Laboratory Special Fundthe KZCX3-SW-230 of the Chinese Academy of Sciences
文摘A projected skill is adopted by use of the differential evolution (DE) algorithm to calculate a conditional nonlinear optimal perturbation (CNOP). The CNOP is the maximal value of a constrained optimization problem with a constraint condition, such as a ball constraint. The success of the DE algorithm lies in its ability to handle a non-differentiable and nonlinear cost function. In this study, the DE algorithm and the traditional optimization algorithms used to obtain the CNOPs are compared by analyzing a theoretical grassland ecosystem model and a dynamic global vegetation model. This study shows that the CNOPs generated by the DE algorithm are similar to those by the sequential quadratic programming (SQP) algorithm and the spectral projected gradients (SPG2) algorithm. If the cost function is non-differentiable, the CNOPs could also be caught with the DE algorithm. The numerical results suggest the DE algorithm can be employed to calculate the CNOP, especially when the cost function is non-differentiable.
文摘Boolean or switching functions can be associated to finite aligned spaces in a way similar to the way they can be associated to finite topological spaces. We prove a characterization of switching functions associated to aligned spaces which is similar to the one we have given for switching functions associated to finite topological spaces.