Drone logistics is a novel method of distribution that will become prevalent.The advantageous location of the logistics hub enables quicker customer deliveries and lower fuel consumption,resulting in cost savings for ...Drone logistics is a novel method of distribution that will become prevalent.The advantageous location of the logistics hub enables quicker customer deliveries and lower fuel consumption,resulting in cost savings for the company’s transportation operations.Logistics firms must discern the ideal location for establishing a logistics hub,which is challenging due to the simplicity of existing models and the intricate delivery factors.To simulate the drone logistics environment,this study presents a new mathematical model.The model not only retains the aspects of the current models,but also considers the degree of transportation difficulty from the logistics hub to the village,the capacity of drones for transportation,and the distribution of logistics hub locations.Moreover,this paper proposes an improved particle swarm optimization(PSO)algorithm which is a diversity-based hybrid PSO(DHPSO)algorithm to solve this model.In DHPSO,the Gaussian random walk can enhance global search in the model space,while the bubble-net attacking strategy can speed convergence.Besides,Archimedes spiral strategy is employed to overcome the local optima trap in the model and improve the exploitation of the algorithm.DHPSO maintains a balance between exploration and exploitation while better defining the distribution of logistics hub locations Numerical experiments show that the newly proposed model always achieves better locations than the current model.Comparing DHPSO with other state-of-the-art intelligent algorithms,the efficiency of the scheme can be improved by 42.58%.This means that logistics companies can reduce distribution costs and consumers can enjoy a more enjoyable shopping experience by using DHPSO’s location selection.All the results show the location of the drone logistics hub is solved by DHPSO effectively.展开更多
The concept of F-knowledge is presented by employing S-rough sets.By engrafting and penetrating between the F-knowledge generated by S-rough sets and the RSA algorithm,the security transmission and recognition of mult...The concept of F-knowledge is presented by employing S-rough sets.By engrafting and penetrating between the F-knowledge generated by S-rough sets and the RSA algorithm,the security transmission and recognition of multi-agent F-knowledge are proposed,which includes the security transmission of multi-agent F-knowledge with positive direction secret key and the security transmission of multi-agent F-knowledge with reverse direction secret key.Finally,the recognition criterion and the applications of F-knowledge are presented.The security of F-knowledge is a new application research direction of S-rough sets in information systems.展开更多
By using function one direction S-rough sets,the concept of F-interior hiding image is presented; the theorem of F-interior hiding and the recognition criteria of interior hiding are proposed; and the applications of ...By using function one direction S-rough sets,the concept of F-interior hiding image is presented; the theorem of F-interior hiding and the recognition criteria of interior hiding are proposed; and the applications of F-interior hiding image are given. F-interior hiding image is a new application area of function S-rough sets,and function S-rough sets is a new theory and new tools for iconology research.展开更多
In Shamir’s(t,n) threshold of the secret sharing scheme, a secret is divided into n shares by a dealer and is shared among n shareholders in such a way that (a) the secret can be reconstructed when there are t or mor...In Shamir’s(t,n) threshold of the secret sharing scheme, a secret is divided into n shares by a dealer and is shared among n shareholders in such a way that (a) the secret can be reconstructed when there are t or more than t shares;and (b) the secret cannot be obtained when there are fewer than t shares. In the secret reconstruction, participating users can be either legitimate shareholders or attackers. Shamir’s scheme only considers the situation when all participating users are legitimate shareholders. In this paper, we show that when there are more than t users participating and shares are released asynchronously in the secret reconstruction, an attacker can always release his share last. In such a way, after knowing t valid shares of legitimate shareholders, the attacker can obtain the secret and therefore, can successfully impersonate to be a legitimate shareholder without being detected. We propose a simple modification of Shamir’s scheme to fix this security problem. Threshold cryptography is a research of group-oriented applications based on the secret sharing scheme. We show that a similar security problem also exists in threshold cryptographic applications. We propose a modified scheme to fix this security problem as well.展开更多
In this paper,we consider existence of single or multiple positive solutions of three-point boundary value problems involving one-dimensional p-Laplacian.We then study existence of solutions when the problems are in r...In this paper,we consider existence of single or multiple positive solutions of three-point boundary value problems involving one-dimensional p-Laplacian.We then study existence of solutions when the problems are in resonance cases.The proposed approach is based on the Krasnoselskii’s fixed point theorem and the coincidence degree.展开更多
Positive results are proved here about the ability of balanced methods to reproduce the mean square stability of the impulsive stochastic differential equations. It is shown that the balanced methods with strong conve...Positive results are proved here about the ability of balanced methods to reproduce the mean square stability of the impulsive stochastic differential equations. It is shown that the balanced methods with strong convergence can preserve the mean square stability with the sufficiently small stepsize. Weak variants and their mean square stability are also considered. Several numerical experiments are given for illustration and show that the fully implicit methods are superior to those of the explicit methods in terms of mean-square stabilities for relatively large stepsizes especially.展开更多
By using function one direction S-rough sets (function one direction singular rough sets),the concept of one direction rough law is proposed,where one direction rough law is the law pair {w(x)-,w(x)-} composed by w(x)...By using function one direction S-rough sets (function one direction singular rough sets),the concept of one direction rough law is proposed,where one direction rough law is the law pair {w(x)-,w(x)-} composed by w(x)-and w(x)-. If the attribute set {α-,α-} of function one direction S-rough sets changes,then one direction rough law {w(x)-,w(x)-} will change,too. By employing ellipse curves,the concept of one direction rough law security is presented,the security theorem of one direction rough law is proposed and the applications are given. One direction rough law security,which is generated by the intersection and penetration between function one direction S-rough sets and ellipse curves,is a new applied research direction of function S-rough sets.展开更多
In this article,we study the Riemann problem with delta initial data for the one-dimensional Chaplygin gas equations.Under the generalized Rankine-Hugoniot conditions and the entropy condition,we constructively obtain...In this article,we study the Riemann problem with delta initial data for the one-dimensional Chaplygin gas equations.Under the generalized Rankine-Hugoniot conditions and the entropy condition,we constructively obtain the global existence of generalized solutions that explicitly exhibit four kinds of different structures.Moreover,we obtain the stability of generalized solutions by making use of the perturbation of the initial data.展开更多
This paper proposes a lattice Boltzmann model with an amending function for one-dimensional nonlinear partial differential equations (NPDEs) in the form ut+αuux+βunux+γuxx+δuxxx+ζuxxxx=0. This model is different ...This paper proposes a lattice Boltzmann model with an amending function for one-dimensional nonlinear partial differential equations (NPDEs) in the form ut+αuux+βunux+γuxx+δuxxx+ζuxxxx=0. This model is different from existing models because it lets the time step be equivalent to the square of the space step and derives higher accuracy and nonlinear terms in NPDEs. With the Chapman-Enskog expansion, the governing evolution equation is recovered correctly from the continuous Boltzmann equation. The numerical results agree well with the analytical solutions.展开更多
We are concerned with the Cauchy problem regarding the full compressible Navier-Stokes equations in R^(d)(d=2,3).By exploiting the intrinsic structure of the equations and using harmonic analysis tools(especially the ...We are concerned with the Cauchy problem regarding the full compressible Navier-Stokes equations in R^(d)(d=2,3).By exploiting the intrinsic structure of the equations and using harmonic analysis tools(especially the Littlewood-Paley theory),we prove the global solutions to this system with small initial data restricted in the Sobolev spaces.Moreover,the initial temperature may vanish at infinity.展开更多
It is well-known that the general Manakov system is a 2-components nonlinear Schrodinger equation with 4 nonzero real parameters.The analytic property of the general Manakov system has been well-understood though it l...It is well-known that the general Manakov system is a 2-components nonlinear Schrodinger equation with 4 nonzero real parameters.The analytic property of the general Manakov system has been well-understood though it looks complicated.This paper devotes to exploring geometric properties of this system via the prescribed curvature representation in the category of Yang-Mills’theory.Three models of moving curves evolving in the symmetric Lie algebras u(2,1)=k_(α)⊕m_(α)(α=1,2)and u(3)=k_(3)⊕m_(3)are shown to be simultaneously the geometric realization of the general Manakov system.This reflects a new phenomenon in geometric realization of a partial differential equation/system.展开更多
This paper discusses the order-preserving convergence for spectral approximation of the self-adjoint completely continuous operator T.Under the condition that the approximate operator Th converges to T in norm,it is p...This paper discusses the order-preserving convergence for spectral approximation of the self-adjoint completely continuous operator T.Under the condition that the approximate operator Th converges to T in norm,it is proven that the k-th eigenvalue of Th converges to the k-th eigenvalue of T.(We sorted the positive eigenvalues in decreasing order and negative eigenvalues in increasing order.) Then we apply this result to conforming elements,nonconforming elements and mixed elements of self-adjoint elliptic differential operators eigenvalue problems,and prove that the k-th approximate eigenvalue obtained by these methods converges to the k-th exact eigenvalue.展开更多
This paper investigates a linear strategy equilibrium in insider trading in continuous time allowing market makers to know some information on the value of a stock. By the use of filtering theory,the authors prove tha...This paper investigates a linear strategy equilibrium in insider trading in continuous time allowing market makers to know some information on the value of a stock. By the use of filtering theory,the authors prove that in a monopoly market, there exists a unique equilibrium of linear strategy of intensity in a closed form, such that the insider can make positive profits and at which, all of the private information on the value of the stock is released; and the more accurate the information on the value of the stock observed by the market makers, the less the positive profits are made by the insider, and even go to zero. However, there is no Nash equilibrium in a Cournot competition market between two insiders if they both adopt a linear strategy of intensity.展开更多
Let G(V, E) be a graph. A k-adjacent vertex-distinguishing equatable edge coloring of G, k-AVEEC for short, is a proper edge coloring f if (1) C(u)≠C(v) for uv ∈ E(G), where C(u) = {f(uv)|uv ∈ E}, and (2) for any...Let G(V, E) be a graph. A k-adjacent vertex-distinguishing equatable edge coloring of G, k-AVEEC for short, is a proper edge coloring f if (1) C(u)≠C(v) for uv ∈ E(G), where C(u) = {f(uv)|uv ∈ E}, and (2) for any i, j = 1, 2,… k, we have ||Ei| |Ej|| ≤ 1, where Ei = {e|e ∈ E(G) and f(e) = i}. χáve (G) = min{k| there exists a k-AVEEC of G} is called the adjacent vertex-distinguishing equitable edge chromatic number of G. In this paper, we obtain the χáve (G) of some special graphs and present a conjecture.展开更多
We perform detailed computations of Lie algebras of infinitesimal CR-automorphisms associated to three specific model real analytic CR-generic submanifolds in C9by employing differential algebra computer tools—mostly...We perform detailed computations of Lie algebras of infinitesimal CR-automorphisms associated to three specific model real analytic CR-generic submanifolds in C9by employing differential algebra computer tools—mostly within the Maple package DifferentialAlgebra—in order to automate the handling of the arising highly complex linear systems of PDE’s.Before treating these new examples which prolong previous works of Beloshapka,of Shananina and of Mamai,we provide general formulas for the explicitation of the concerned PDE systems that are valid in arbitrary codimension k 1 and in any CR dimension n 1.Also,we show how Ritt’s reduction algorithm can be adapted to the case under interest,where the concerned PDE systems admit so-called complex conjugations.展开更多
Characterization of essential stability of minimum solutions for a class of optimization problems with boundedness and lower pseudocontinuity on a compact metric space is given. It shows that any optimization problem ...Characterization of essential stability of minimum solutions for a class of optimization problems with boundedness and lower pseudocontinuity on a compact metric space is given. It shows that any optimization problem considered here has one essential component(resp. one essential minimum solution) if and only if its minimum solution set is connected(resp. singleton) and that those optimization problems which have a unique minimum solution form a residual set(however, which need not to be dense).展开更多
基金supported by the NationalNatural Science Foundation of China(No.61866023).
文摘Drone logistics is a novel method of distribution that will become prevalent.The advantageous location of the logistics hub enables quicker customer deliveries and lower fuel consumption,resulting in cost savings for the company’s transportation operations.Logistics firms must discern the ideal location for establishing a logistics hub,which is challenging due to the simplicity of existing models and the intricate delivery factors.To simulate the drone logistics environment,this study presents a new mathematical model.The model not only retains the aspects of the current models,but also considers the degree of transportation difficulty from the logistics hub to the village,the capacity of drones for transportation,and the distribution of logistics hub locations.Moreover,this paper proposes an improved particle swarm optimization(PSO)algorithm which is a diversity-based hybrid PSO(DHPSO)algorithm to solve this model.In DHPSO,the Gaussian random walk can enhance global search in the model space,while the bubble-net attacking strategy can speed convergence.Besides,Archimedes spiral strategy is employed to overcome the local optima trap in the model and improve the exploitation of the algorithm.DHPSO maintains a balance between exploration and exploitation while better defining the distribution of logistics hub locations Numerical experiments show that the newly proposed model always achieves better locations than the current model.Comparing DHPSO with other state-of-the-art intelligent algorithms,the efficiency of the scheme can be improved by 42.58%.This means that logistics companies can reduce distribution costs and consumers can enjoy a more enjoyable shopping experience by using DHPSO’s location selection.All the results show the location of the drone logistics hub is solved by DHPSO effectively.
基金supported partly by the Natural Science Foundation of Fujian Province of China(2009J01293)the Natural Science Foundation of Shandong Province of China(Y2007H02).
文摘The concept of F-knowledge is presented by employing S-rough sets.By engrafting and penetrating between the F-knowledge generated by S-rough sets and the RSA algorithm,the security transmission and recognition of multi-agent F-knowledge are proposed,which includes the security transmission of multi-agent F-knowledge with positive direction secret key and the security transmission of multi-agent F-knowledge with reverse direction secret key.Finally,the recognition criterion and the applications of F-knowledge are presented.The security of F-knowledge is a new application research direction of S-rough sets in information systems.
基金Natural Science Foundation of Fujian Province of China ( No.2009J01293)The Open Project of Brain-like Key Laboratory of Fujian Province of China (No. BLISSOS20101015)
文摘By using function one direction S-rough sets,the concept of F-interior hiding image is presented; the theorem of F-interior hiding and the recognition criteria of interior hiding are proposed; and the applications of F-interior hiding image are given. F-interior hiding image is a new application area of function S-rough sets,and function S-rough sets is a new theory and new tools for iconology research.
文摘In Shamir’s(t,n) threshold of the secret sharing scheme, a secret is divided into n shares by a dealer and is shared among n shareholders in such a way that (a) the secret can be reconstructed when there are t or more than t shares;and (b) the secret cannot be obtained when there are fewer than t shares. In the secret reconstruction, participating users can be either legitimate shareholders or attackers. Shamir’s scheme only considers the situation when all participating users are legitimate shareholders. In this paper, we show that when there are more than t users participating and shares are released asynchronously in the secret reconstruction, an attacker can always release his share last. In such a way, after knowing t valid shares of legitimate shareholders, the attacker can obtain the secret and therefore, can successfully impersonate to be a legitimate shareholder without being detected. We propose a simple modification of Shamir’s scheme to fix this security problem. Threshold cryptography is a research of group-oriented applications based on the secret sharing scheme. We show that a similar security problem also exists in threshold cryptographic applications. We propose a modified scheme to fix this security problem as well.
基金Project supported by Foundation of Major Project of ScienceTechnology of Chinese Education Ministy,NSF of Education Committee of Jiangsu Province
文摘In this paper,we consider existence of single or multiple positive solutions of three-point boundary value problems involving one-dimensional p-Laplacian.We then study existence of solutions when the problems are in resonance cases.The proposed approach is based on the Krasnoselskii’s fixed point theorem and the coincidence degree.
基金National Natural Science Foundations of China(Nos.11561028,11101101,11461032,11401267)Natural Science Foundations of Jiangxi Province,China(Nos.20151BAB201013,20151BAB201010,20151BAB201015)
文摘Positive results are proved here about the ability of balanced methods to reproduce the mean square stability of the impulsive stochastic differential equations. It is shown that the balanced methods with strong convergence can preserve the mean square stability with the sufficiently small stepsize. Weak variants and their mean square stability are also considered. Several numerical experiments are given for illustration and show that the fully implicit methods are superior to those of the explicit methods in terms of mean-square stabilities for relatively large stepsizes especially.
基金Natural Science Foundation of Fujian Province of China( No.2009J01293)Open Project of Brain-like Key Laboratory Research of Fujian Province of China (No. BLISSOS20101015)
文摘By using function one direction S-rough sets (function one direction singular rough sets),the concept of one direction rough law is proposed,where one direction rough law is the law pair {w(x)-,w(x)-} composed by w(x)-and w(x)-. If the attribute set {α-,α-} of function one direction S-rough sets changes,then one direction rough law {w(x)-,w(x)-} will change,too. By employing ellipse curves,the concept of one direction rough law security is presented,the security theorem of one direction rough law is proposed and the applications are given. One direction rough law security,which is generated by the intersection and penetration between function one direction S-rough sets and ellipse curves,is a new applied research direction of function S-rough sets.
基金supported by National Natural Science Foundation of China (10871199)
文摘In this article,we study the Riemann problem with delta initial data for the one-dimensional Chaplygin gas equations.Under the generalized Rankine-Hugoniot conditions and the entropy condition,we constructively obtain the global existence of generalized solutions that explicitly exhibit four kinds of different structures.Moreover,we obtain the stability of generalized solutions by making use of the perturbation of the initial data.
基金Supported by the National Baslc Research Programme under Grant No 2005CB321703, and the National Natural Science Foundation of China under Grant Nos 40221503, 10471067 and 40405019.
基金Supported by the National Basic Research Programme of China under Grant No 2005CB321703, the Key Project of NSF of Jiangsu Province under Grant No BK2006725, and the National Natural Science Foundation of China under Grant Nos 10471067 and 40405019.
基金Supported by the National Basic Research Programme of China under Grant No 2005CB321703, the National Natural Science Foundation of China under Grant Nos 10471067 and 40405019, and the Key Project of Jiangsu NSF （BK2006725）.
基金Project supported by the National Natural Science Foundation of China (Grant No. 10661005)Fujian Province Science and Technology Plan Item (Grant No. 2008F5019)
文摘This paper proposes a lattice Boltzmann model with an amending function for one-dimensional nonlinear partial differential equations (NPDEs) in the form ut+αuux+βunux+γuxx+δuxxx+ζuxxxx=0. This model is different from existing models because it lets the time step be equivalent to the square of the space step and derives higher accuracy and nonlinear terms in NPDEs. With the Chapman-Enskog expansion, the governing evolution equation is recovered correctly from the continuous Boltzmann equation. The numerical results agree well with the analytical solutions.
基金supported by the National Natural Science Foundation of China(11801090 and 12161004)Jiangxi Provincial Natural Science Foundation,China(20212BAB211004)+3 种基金supported by the National Natural Science Foundation of China(12171493)supported by the National Natural Science Foundation of China(11601533)Guangdong Provincial Natural Science Foundation,China(2022A1515011977)the Science and Technology Program of Shenzhen under grant 20200806104726001.
文摘We are concerned with the Cauchy problem regarding the full compressible Navier-Stokes equations in R^(d)(d=2,3).By exploiting the intrinsic structure of the equations and using harmonic analysis tools(especially the Littlewood-Paley theory),we prove the global solutions to this system with small initial data restricted in the Sobolev spaces.Moreover,the initial temperature may vanish at infinity.
基金supported by the National Natural Science Foundation of China(Nos.12071080,12141104)the Science Technology Project of Jiangxi Educational Committee(No.GJJ2201202)the Natural Science Foundation of Jiangxi Province(Nos.20212BAB211005,20232BAB201006)。
文摘It is well-known that the general Manakov system is a 2-components nonlinear Schrodinger equation with 4 nonzero real parameters.The analytic property of the general Manakov system has been well-understood though it looks complicated.This paper devotes to exploring geometric properties of this system via the prescribed curvature representation in the category of Yang-Mills’theory.Three models of moving curves evolving in the symmetric Lie algebras u(2,1)=k_(α)⊕m_(α)(α=1,2)and u(3)=k_(3)⊕m_(3)are shown to be simultaneously the geometric realization of the general Manakov system.This reflects a new phenomenon in geometric realization of a partial differential equation/system.
基金supported by the National Natural Science Foundation of China (Grant No. 10761003)Guizhou Province Scientific Research for Senior Personnels
文摘This paper discusses the order-preserving convergence for spectral approximation of the self-adjoint completely continuous operator T.Under the condition that the approximate operator Th converges to T in norm,it is proven that the k-th eigenvalue of Th converges to the k-th eigenvalue of T.(We sorted the positive eigenvalues in decreasing order and negative eigenvalues in increasing order.) Then we apply this result to conforming elements,nonconforming elements and mixed elements of self-adjoint elliptic differential operators eigenvalue problems,and prove that the k-th approximate eigenvalue obtained by these methods converges to the k-th exact eigenvalue.
基金supported by the National Natural Science Foundation of China under Grant No.11161011China Scholarship Council under Grant No.201308525118
文摘This paper investigates a linear strategy equilibrium in insider trading in continuous time allowing market makers to know some information on the value of a stock. By the use of filtering theory,the authors prove that in a monopoly market, there exists a unique equilibrium of linear strategy of intensity in a closed form, such that the insider can make positive profits and at which, all of the private information on the value of the stock is released; and the more accurate the information on the value of the stock observed by the market makers, the less the positive profits are made by the insider, and even go to zero. However, there is no Nash equilibrium in a Cournot competition market between two insiders if they both adopt a linear strategy of intensity.
基金Supported by the National Natural Science Foundation of China(No.10771091No.61163010)Ningxia University Science Research Foundation(No.(E)ndzr09-15)
文摘Let G(V, E) be a graph. A k-adjacent vertex-distinguishing equatable edge coloring of G, k-AVEEC for short, is a proper edge coloring f if (1) C(u)≠C(v) for uv ∈ E(G), where C(u) = {f(uv)|uv ∈ E}, and (2) for any i, j = 1, 2,… k, we have ||Ei| |Ej|| ≤ 1, where Ei = {e|e ∈ E(G) and f(e) = i}. χáve (G) = min{k| there exists a k-AVEEC of G} is called the adjacent vertex-distinguishing equitable edge chromatic number of G. In this paper, we obtain the χáve (G) of some special graphs and present a conjecture.
基金supported by the Center for International Scientific Studies and Collaboration(CISSC)and French Embassy in TehranThe resend of the first and second authors was in part supported by grants from IPM(Grant Nos.91530040 and 92550420)
文摘We perform detailed computations of Lie algebras of infinitesimal CR-automorphisms associated to three specific model real analytic CR-generic submanifolds in C9by employing differential algebra computer tools—mostly within the Maple package DifferentialAlgebra—in order to automate the handling of the arising highly complex linear systems of PDE’s.Before treating these new examples which prolong previous works of Beloshapka,of Shananina and of Mamai,we provide general formulas for the explicitation of the concerned PDE systems that are valid in arbitrary codimension k 1 and in any CR dimension n 1.Also,we show how Ritt’s reduction algorithm can be adapted to the case under interest,where the concerned PDE systems admit so-called complex conjugations.
基金supported by National Natural Science Foundation of China under Grants Nos.11161011and 11161015
文摘Characterization of essential stability of minimum solutions for a class of optimization problems with boundedness and lower pseudocontinuity on a compact metric space is given. It shows that any optimization problem considered here has one essential component(resp. one essential minimum solution) if and only if its minimum solution set is connected(resp. singleton) and that those optimization problems which have a unique minimum solution form a residual set(however, which need not to be dense).
