Given initial data u0 ∈ L^(p)(R^(3)) for some p in [3,18/5 [,the auhtors first prove that3 D incompressible Navier-Stokes system has a unique solution μ=μL+v with μL=^(def)e^(t△)μ_(0) and ν∈L^(∞)([0,T];H^(5/2...
详细信息
Given initial data u0 ∈ L^(p)(R^(3)) for some p in [3,18/5 [,the auhtors first prove that3 D incompressible Navier-Stokes system has a unique solution μ=μL+v with μL=^(def)e^(t△)μ_(0) and ν∈L^(∞)([0,T];H^(5/2)-^(6/p)∩L^(1)([0,T];H^(9/2-6/p) for some positive time *** they derive an explicit lower bound for the radius of space analyticity of v,which in particular extends the corresponding results in [Chemin,J.-Y.,Gallagher,*** Zhang,P.,On the radius of analyticity of solutions to semi-linear parabolic system,***.,27,2020,1631-1643,Herbst,*** Skibsted,E.,Analyticity estimates for the Navier-Stokes equations,*** Math.,228,2011,1990-2033] with initial data in H^(s)(R^(3)) for s ∈ [1/2,3/2[.
Number Theoretic Transform (NTT) has been widely used in accelerating computations in lattice-based cryptography. However, attackers can potentially launch power analysis targeting the NTT because it is one of the mos...
详细信息
Micro triadic structure is an important motif and serves the building block of complex *** this paper,the authors define structure entropy for a social network and explain this concept by using the coded triads propos...
详细信息
Micro triadic structure is an important motif and serves the building block of complex *** this paper,the authors define structure entropy for a social network and explain this concept by using the coded triads proposed by Davis and Leinhardt in *** proposed structure entropy serves as a new macro-evolution index to measure the network’s stability at a given *** analysis of real-world network structure entropy discloses rich information on the mechanism that yields given triadic motifs frequency *** paper illustrates the intrinsic link between the micro dyadic/triadic motifs and network structure ***,the authors find that the high proportion of reciprocity and transitivity results in the emergence of hierarchy,order,and cooperation of online social networks.
In this paper,a model-free integral reinforcement learning(IRL) resilient tracking control scheme has been proposed for a class of non-affine nonlinear systems with *** using the precompensation technique,the actual w...
详细信息
ISBN:
(数字)9789887581536
ISBN:
(纸本)9781665482561
In this paper,a model-free integral reinforcement learning(IRL) resilient tracking control scheme has been proposed for a class of non-affine nonlinear systems with *** using the precompensation technique,the actual working control has been transformed into the state of compensator,and an augmented tracking system converts the optimal tracking control problem into an optimal regulation *** applying the reinforcement learning(RL) technique,the designed method can avoid the dynamic information directly during the iteration learning process,and obtain the model-free resilient tracking ***,the developed algorithm overcomes the limitations and strict assumptions of conventional optimal tracking control in dealing with a non-affine nonlinear ***,with the use of polynomial approximation structure and the least square method,practicability in the implementing process has been guaranteed ***,two examples in the simulation are given to demonstrate the validity and feasibility of the proposed model-free IRL resilient tracking control.
An investigation and outline of Metacontrol and Decontrol in Metaverses for control intelligence and knowledge automation are *** control with prescriptive knowledge and parallel philosophy is proposed as the starting...
详细信息
An investigation and outline of Metacontrol and Decontrol in Metaverses for control intelligence and knowledge automation are *** control with prescriptive knowledge and parallel philosophy is proposed as the starting point for the new control philosophy and technology,especially for computational control of metasystems in cyberphysical-social *** argue that circular causality,the generalized feedback mechanism for complex and purposive systems,should be adapted as the fundamental principle for control and management of metasystems with metacomplexity in ***,an interdisciplinary approach is suggested for Metacontrol and Decontrol as a new form of intelligent control based on five control metaverses:MetaVerses,MultiVerses,InterVerses,TransVerse,and DeepVerses.
In recent years, automatic search has been widely used to search differential characteristics and linear approximations with high probability/correlation in symmetric-key cryptanalyses. Among these methods, the automa...
In recent years, automatic search has been widely used to search differential characteristics and linear approximations with high probability/correlation in symmetric-key cryptanalyses. Among these methods, the automatic search with the Boolean satisfiability problem(SAT, in short) gradually becomes a powerful cryptanalysis tool. A key problem in the SAT-based automatic search method is how to fully characterize a set S ? {0, 1}~n with as few Conjunctive normal form(CNF, in short)clauses as possible, which is called a full CNF characterization(FCC, in short) problem. In this work,the authors establish a complete theory to solve a best solution of an FCC problem. Specifically, the authors start from plain sets, which can be characterized by exactly one clause. By exploring mergeable sets, the authors give a sufficient and necessary condition for characterizing a plain set. Based on the properties of plain sets, the authors further provide an algorithm of solving an FCC problem for a given set S, which can generate all the minimal plain closures of S and produce a best FCC theoretically. As application, the authors apply the proposed algorithm to many common S-boxes used in block ciphers to characterize their differential distribution tables and linear approximation tables and get their FCCs,all of which are the best-known results at present.
This paper investigates a distributed recursive projection identification problem with binaryvalued observations built on a sensor network,where each sensor in the sensor network measures partial information of the un...
详细信息
This paper investigates a distributed recursive projection identification problem with binaryvalued observations built on a sensor network,where each sensor in the sensor network measures partial information of the unknown parameter only,but each sensor is allowed to communicate with its neighbors.A distributed recursive projection algorithm is proposed based on a specific projection operator and a diffusion *** authors establish the upper bound of the accumulated regrets of the adaptive predictor without any requirement of excitation ***,the convergence of the algorithm is given under the bounded cooperative excitation condition,which is more general than the previously imposed independence or persistent excitations on the system regressors and maybe the weakest one under binary observations.A numerical example is supplied to demonstrate the theoretical results and the cooperative effect of the sensors,which shows that the whole network can still fulfill the estimation task through exchanging information between sensors even if any individual sensor cannot.
INSPIRED by the insight from American political scientist Lasswell, who summarized the environmental role in societal surveillance [1], Schramm coined the term “social radar” [2] as it resembles the activities of ra...
详细信息
INSPIRED by the insight from American political scientist Lasswell, who summarized the environmental role in societal surveillance [1], Schramm coined the term “social radar” [2] as it resembles the activities of radar in collecting and processing information, playing a crucial role in helping humans perceive changes in the internal and external environment and promptly adjusting adaptive behaviors.
In this article, we investigate the motion planning problem for control-affine systems with nontrivial drifts using a regularized homotopy continuation method. We prove that when there exists a nonsingular solution of...
详细信息
Dear editor,Opinion evolution is ubiquitous in everyday life. People often alter their attitudes or behaviors such that they can be more similar to or different from others. These processes of social influence may occ...
详细信息
Dear editor,Opinion evolution is ubiquitous in everyday life. People often alter their attitudes or behaviors such that they can be more similar to or different from others. These processes of social influence may occur because of several reasons, e.g.,persuasion and conformity. In fact, opinion dynamics concerns important topics in social sciences, such as community cleavage, political opinion, and social organization [1–3].Therefore, various mathematical models have been proposed to reveal the underlying mechanisms [1, 4].
暂无评论