In this paper, we give a criterion of the absolutely Cesàro bounded weighted backward shift in spirit of the comparison method. Our approach is to construct the proper product of weight functions <img src=&quo...In this paper, we give a criterion of the absolutely Cesàro bounded weighted backward shift in spirit of the comparison method. Our approach is to construct the proper product of weight functions <img src="Edit_7232e0dc-07ab-41c5-8657-a49f0463b47c.bmp" alt="" />by the fraction of two monomials of the indexes, then we apply proper scaling to give Cesàro boundedness. In particular, we present a new example of non Cesàro bounded weighted backward shift on <img src="Edit_799dadb7-40ab-48f9-bae3-191378f96164.bmp" alt="" />.展开更多
It is demonstrated that the recently introduced semantic intelligence spontaneously maintains bounded logical and quantal error on each and every semantic trajectory, unlike its algorithmic counterpart which is not ab...It is demonstrated that the recently introduced semantic intelligence spontaneously maintains bounded logical and quantal error on each and every semantic trajectory, unlike its algorithmic counterpart which is not able to. This result verifies the conclusion about the assignment of equal evolutionary value to the motion on the set of all the semantic trajectories sharing the same homeostatic pattern. The evolutionary value of permanent and spontaneous maintenance of boundedness of logical and quantal error on each and every semantic trajectory is to make available spontaneous maintenance of the notion of a kind intact in the long run.展开更多
This work aims to reduce queries on big data to computations on small data,and hence make querying big data possible under bounded resources.A query Q is boundedly evaluable when posed on any big dataset D,there exist...This work aims to reduce queries on big data to computations on small data,and hence make querying big data possible under bounded resources.A query Q is boundedly evaluable when posed on any big dataset D,there exists a fraction DQ of D such that Q(D)=Q(DQ),and the cost of identifying DQ is independent of the size of D.It has been shown that with an auxiliary structure known as access schema,many queries in relational algebra(RA)are boundedly evaluable under the set semantics of RA.This paper extends the theory of bounded evaluation to RAaggr,i.e.,RA extended with aggregation,under the bag semantics.(1)We extend access schema to bag access schema,to help us identify DQ for RAaggr queries Q.(2)While it is undecidable to determine whether an RAaggr query is boundedly evaluable under a bag access schema,we identify special cases that are decidable and practical.(3)In addition,we develop an effective syntax for bounded RAaggr queries,i.e.,a core subclass of boundedly evaluable RAaggr queries without sacrificing their expressive power.(4)Based on the effective syntax,we provide efficient algorithms to check the bounded evaluability of RAaggr queries and to generate query plans for bounded RAaggr queries.(5)As proof of concept,we extend PostgreSQL to support bounded evaluation.We experimentally verify that the extended system improves performance by orders of magnitude.展开更多
We consider a pendulum type equation with p-Laplacian(φp(x'))'+G'x(t,x)=p(t),where φp(u)=|u|^p-2u,p>1,G(t,x)and p(t)are 1-periodic about every variable.The solutions of this equation present two inter...We consider a pendulum type equation with p-Laplacian(φp(x'))'+G'x(t,x)=p(t),where φp(u)=|u|^p-2u,p>1,G(t,x)and p(t)are 1-periodic about every variable.The solutions of this equation present two interesting behaviors.On the one hand,by applying Moser's twist theorem,we find infinitely many invariant tori whenever ∫0^1 p(t)dt=0,which yields the boundedness of all solutions and the existence of quasi-periodic solutions starting at t=0 on the invariant tori.On the other hand,if p(t)=0 and G'x(t,x)has some specific forms,we find a full symbolic dynamical system made by solutions which oscillate between any two different trivial solutions of the equation.Such chaotic solutions stay close to the trivial solutions in some fixed intervals,according to any prescribed coin-tossing sequence.展开更多
This article considers the following higher-dimensional quasilinear parabolic-parabolic-ODE chemotaxis system with generalized Logistic source and homogeneous Neumann boundary conditions{ut=∇⋅(D(u)∇u)−∇⋅(S(u)∇v)+f(u),...This article considers the following higher-dimensional quasilinear parabolic-parabolic-ODE chemotaxis system with generalized Logistic source and homogeneous Neumann boundary conditions{ut=∇⋅(D(u)∇u)−∇⋅(S(u)∇v)+f(u),x∈Ω,t>0 vt=Δv+w−v,x∈Ω,t>0,wt=u−w,x∈Ω,t>0,in a bounded domainΩ⊂R^n(n≥2)with smooth boundary ∂Ω,where the diffusion coefficient D(u)and the chemotactic sensitivity function S(u)are supposed to satisfy D(u)≥M1(u+1)^−αand S(u)≤M2(u+1)^β,respectively,where M1,M2>0 and α,β∈R.Moreover,the logistic source f(u)is supposed to satisfy f(u)≤a−μu^γ with μ>0,γ≥1,and a≥0.Asα+2β<γ−1+2γ/n,we show that the solution of the above chemotaxis system with sufficiently smooth nonnegative initial data is uniformly bounded.展开更多
文摘In this paper, we give a criterion of the absolutely Cesàro bounded weighted backward shift in spirit of the comparison method. Our approach is to construct the proper product of weight functions <img src="Edit_7232e0dc-07ab-41c5-8657-a49f0463b47c.bmp" alt="" />by the fraction of two monomials of the indexes, then we apply proper scaling to give Cesàro boundedness. In particular, we present a new example of non Cesàro bounded weighted backward shift on <img src="Edit_799dadb7-40ab-48f9-bae3-191378f96164.bmp" alt="" />.
文摘It is demonstrated that the recently introduced semantic intelligence spontaneously maintains bounded logical and quantal error on each and every semantic trajectory, unlike its algorithmic counterpart which is not able to. This result verifies the conclusion about the assignment of equal evolutionary value to the motion on the set of all the semantic trajectories sharing the same homeostatic pattern. The evolutionary value of permanent and spontaneous maintenance of boundedness of logical and quantal error on each and every semantic trajectory is to make available spontaneous maintenance of the notion of a kind intact in the long run.
基金supported in part by Royal Society YVolfson Research Merit Award WRM/R1/180014,ERC 652976,EPSRC EP/M025268/1,Shenzhen Institute of Computing Sciences,and Beijing Advanced Innovation Center for Big Data and Brain Computing.
文摘This work aims to reduce queries on big data to computations on small data,and hence make querying big data possible under bounded resources.A query Q is boundedly evaluable when posed on any big dataset D,there exists a fraction DQ of D such that Q(D)=Q(DQ),and the cost of identifying DQ is independent of the size of D.It has been shown that with an auxiliary structure known as access schema,many queries in relational algebra(RA)are boundedly evaluable under the set semantics of RA.This paper extends the theory of bounded evaluation to RAaggr,i.e.,RA extended with aggregation,under the bag semantics.(1)We extend access schema to bag access schema,to help us identify DQ for RAaggr queries Q.(2)While it is undecidable to determine whether an RAaggr query is boundedly evaluable under a bag access schema,we identify special cases that are decidable and practical.(3)In addition,we develop an effective syntax for bounded RAaggr queries,i.e.,a core subclass of boundedly evaluable RAaggr queries without sacrificing their expressive power.(4)Based on the effective syntax,we provide efficient algorithms to check the bounded evaluability of RAaggr queries and to generate query plans for bounded RAaggr queries.(5)As proof of concept,we extend PostgreSQL to support bounded evaluation.We experimentally verify that the extended system improves performance by orders of magnitude.
基金supported in part by the National Natural ScienceFoundation of China(Grant No.11971059)the Postdoctoral Applied Research ProjectFunding of Qingdao.
文摘We consider a pendulum type equation with p-Laplacian(φp(x'))'+G'x(t,x)=p(t),where φp(u)=|u|^p-2u,p>1,G(t,x)and p(t)are 1-periodic about every variable.The solutions of this equation present two interesting behaviors.On the one hand,by applying Moser's twist theorem,we find infinitely many invariant tori whenever ∫0^1 p(t)dt=0,which yields the boundedness of all solutions and the existence of quasi-periodic solutions starting at t=0 on the invariant tori.On the other hand,if p(t)=0 and G'x(t,x)has some specific forms,we find a full symbolic dynamical system made by solutions which oscillate between any two different trivial solutions of the equation.Such chaotic solutions stay close to the trivial solutions in some fixed intervals,according to any prescribed coin-tossing sequence.
基金This work is supported by the Youth Doctor Science and Technology Talent Training Project of Xinjiang Uygur Autonomous Region(2017Q087).
文摘This article considers the following higher-dimensional quasilinear parabolic-parabolic-ODE chemotaxis system with generalized Logistic source and homogeneous Neumann boundary conditions{ut=∇⋅(D(u)∇u)−∇⋅(S(u)∇v)+f(u),x∈Ω,t>0 vt=Δv+w−v,x∈Ω,t>0,wt=u−w,x∈Ω,t>0,in a bounded domainΩ⊂R^n(n≥2)with smooth boundary ∂Ω,where the diffusion coefficient D(u)and the chemotactic sensitivity function S(u)are supposed to satisfy D(u)≥M1(u+1)^−αand S(u)≤M2(u+1)^β,respectively,where M1,M2>0 and α,β∈R.Moreover,the logistic source f(u)is supposed to satisfy f(u)≤a−μu^γ with μ>0,γ≥1,and a≥0.Asα+2β<γ−1+2γ/n,we show that the solution of the above chemotaxis system with sufficiently smooth nonnegative initial data is uniformly bounded.