Hierarchical satisfying optimal algorithm with different importance and priorities

A hierarchical satisfying optimal algorithm incorporating different importance and preemptive priorities is formulated. With the priority structure given by the decision-maker in the constrained multi-objective multi-degree-of-freedom optimization (CMMO) problem, the commonly used quadratic programming model is converted into a two-level optimization problem solved by the tolerant lexicographic method and the varying-domain optimization method. In contrast to previous works, the proposed approach allows the decision-maker to determine a desirable achievement degree for each goal to reflect explicitly the relative importance of these goals. The resulting solutions satisfy both the preemptive priority structure and have the maximum achievement degrees in sum. The power of the proposed approach is demonstrated with an example.

SOME INEQUALITIES FOR POLYNOMIALS SATISFYING p(z)=z^n p(1/z)

Let p(z)=be a polynomial degree n and let Then accord-ing to Bernstein's inequality ||p'||<n||p||.It is a well known open problem to obtain inequality analogous to Bernstein's inequality for the class IIn of polynomials satisfying p(z)≡znp(1/z)Here we obtain an inequality analogous to Bernstein's inequality for a subclass of IIn Our results include several of the known results as special cases.

Poincaré and Sobolev Inequalities for Vector Fields Satisfying Hrmander's Condition in Variable Exponent Sobolev Spaces

In this paper, we will establish Poincare inequalities in variable exponent non-isotropic Sobolev spaces. The crucial part is that we prove the boundedness of the fractional integral operator on variable exponent Lebesgue spaces on spaces of homogeneous type. We obtain the first order Poincare inequalities for vector fields satisfying Hormander＇s condition in variable non-isotropic Sobolev spaces. We also set up the higher order Poincare inequalities with variable exponents on stratified Lie groups. Moreover, we get the Sobolev inequalities in variable exponent Sobolev spaces on whole stratified Lie groups. These inequalities are important and basic tools in studying nonlinear subelliptic PDEs with variable exponents such as the p（x）-subLaplacian. Our results are only stated and proved for vector fields satisfying Hormander＇s condition, but they also hold for Grushin vector fields as well with obvious modifications.

Nonlinear Maps Satisfying Derivability on the Parabolic Subalgebras of the Full Matrix Algebras

Let F be a field of characteristic 0, Mn（F） the full matrix algebra over F, t the subalgebra of Mn（F） consisting of all upper triangular matrices. Any subalgebra of Mn（F） containing t is called a parabolic subalgebra of Mn（F）. Let P be a parabolic subalgebra of Mn（F）. A map φ on P is said to satisfy derivability if φ（x·y） = φ（x）·y＋x·φ（y） for all x,y ∈ P, where φ is not necessarily linear. Note that a map satisfying derivability on P is not necessarily a derivation on P. In this paper, we prove that a map φ on P satisfies derivability if and only if φ is a sum of an inner derivation and an additive quasi-derivation on P. In particular, any derivation of parabolic subalgebras of Mn（F） is an inner derivation.

Event-Triggered Bipartite Consensus Tracking and Vibration Control of Flexible Timoshenko Manipulators Under Time-Varying Actuator Faults

For bipartite angle consensus tracking and vibration suppression of multiple Timoshenko manipulator systems with time-varying actuator faults,parameter and modeling uncertainties,and unknown disturbances,a novel distributed boundary event-triggered control strategy is proposed in this work.In contrast to the earlier findings,time-varying consensus tracking and actuator defects are taken into account simultaneously.In addition,the constructed event-triggered control mechanism can achieve a more flexible design because it is not required to satisfy the input-to-state condition.To achieve the control objectives,some new integral control variables are given by using back-stepping technique and boundary control.Moreover,adaptive neural networks are applied to estimate system uncertainties.With the proposed event-triggered scheme,control inputs can reduce unnecessary updates.Besides,tracking errors and vibration states of the closed-looped network can be exponentially convergent into some small fields,and Zeno behaviors can be excluded.At last,some simulation examples are given to state the effectiveness of the control algorithms.

Lyapunov Conditions for Finite-Time Input-to-State Stability of Impulsive Switched Systems

Dear Editor,This letter studies finite-time input-to-state stability(FTISS)for impulsive switched systems.A set of Lyapunov-based conditions are established for guaranteeing FTISS property.When constituent modes governing continuous dynamics are FTISS and discrete dynamics involving impulses are destabilizing,the FTISS can be retained if impulsive-switching signals satisfy an average dwell-time(ADT)condition.

A NOTE ON FINITE GROUPS SATISFYING PERMUTIZER CONDITION

If G satisfies the permutizer condition, we call G a pc-group; clearly, all the super-solvable groups are pc-groups. It was shown in [1] that pc-groups of odd order were supersolvable. It is easy to verify that the symmetric group of degree four is a solvable pc-group, but it is not supersolvable. In general, solvable

A NECESSARY AND SUFFICIENT CONDITION FOR A DISTRIBU TION SATISFYING LIP-φ

Let ψ(x) be a continuous and strictly increasing function defined on [0,∞) with ψ(0)=0 and ψ(x)/x is nonincreasing. A function φ(x) is said to satisfy the condition Lip-ψ (denoted byφ ∈Lip-ψ) if there exists a positive constant M>0 such that |φ(x)-φ(y)|(?)Mψ(|x-y|) for all x,y∈R^1. For ψ(x)=x^r,0<r(?)1, the condition Lip-x^r reduces to the usual rth order Lipschitz condition, a fact that will be denoted by Lip-r instead of Lip-x^r. Let J be the set of all those one-dimension-

CONSTRUCTION OF Q PROCESSES SATISFYING KOLMOGOROFF'S BACKWARD EQUATIONS IN SINGLE EXIT CASE OR FORWARD EQUATIONS IN SINGLE ENTRANCE CASE

In Refs. [2], [4]—[6] on the construction of Q processes it is assumed that matrix Q is conservative. The nonconservative case was dealt with only in a few papers, such as Refs. [3], [7], (8)If we are interested in the construction of Q processes which satisfy the backward equations, the nonconservative case may be reduced to

蟹黄包

“If you have never had dim sum,then you have never really been to Taizhou,”a taxi driver said with pride.When you visit Taizhou,known for its delicious food,be sure to try the“crab yolk bun”,a must-order dish.These buns are filled with a mixture of crab meat,crab yolk,and fresh meat,creating a satisfying filling that sets them apart from other buns.

Engineering Knill–Laflamme–Milburn Entanglement via Dissipation and Coherent Population Trapping in Rydberg Atoms

We present a scheme for dissipatively preparing bipartite Knill–Laflamme–Milburn(KLM)entangled state in a neutral atom system,where the spontaneous emission of excited Rydberg states,combined with the coherent population trapping,is actively exploited to engineer a steady KLM state from an arbitrary initial state.Instead of commonly used antiblockade dynamics of two Rydberg atoms,we particularly utilize the Rydberg–Rydberg interaction as the pumping source to drive the undesired states so that it is unnecessary to satisfy a certain relation with laser detuning.The numerical simulation of the master equation signifies that both the fidelity and the purity above 98%is available with the current feasible parameters,and the corresponding steady-state fidelity is robust to the variations of the dynamical parameters.

Evolution Performance of Symbolic Radial Basis Function Neural Network by Using Evolutionary Algorithms

Radial Basis Function Neural Network(RBFNN)ensembles have long suffered from non-efficient training,where incorrect parameter settings can be computationally disastrous.This paper examines different evolutionary algorithms for training the Symbolic Radial Basis Function Neural Network(SRBFNN)through the behavior’s integration of satisfiability programming.Inspired by evolutionary algorithms,which can iteratively find the nearoptimal solution,different Evolutionary Algorithms(EAs)were designed to optimize the producer output weight of the SRBFNN that corresponds to the embedded logic programming 2Satisfiability representation(SRBFNN-2SAT).The SRBFNN’s objective function that corresponds to Satisfiability logic programming can be minimized by different algorithms,including Genetic Algorithm(GA),Evolution Strategy Algorithm(ES),Differential Evolution Algorithm(DE),and Evolutionary Programming Algorithm(EP).Each of these methods is presented in the steps in the flowchart form which can be used for its straightforward implementation in any programming language.With the use of SRBFNN-2SAT,a training method based on these algorithms has been presented,then training has been compared among algorithms,which were applied in Microsoft Visual C++software using multiple metrics of performance,including Mean Absolute Relative Error(MARE),Root Mean Square Error(RMSE),Mean Absolute Percentage Error(MAPE),Mean Bias Error(MBE),Systematic Error(SD),Schwarz Bayesian Criterion(SBC),and Central Process Unit time(CPU time).Based on the results,the EP algorithm achieved a higher training rate and simple structure compared with the rest of the algorithms.It has been confirmed that the EP algorithm is quite effective in training and obtaining the best output weight,accompanied by the slightest iteration error,which minimizes the objective function of SRBFNN-2SAT.

Determination of Consistency between Quantitative Evaluation and Non-quantitative Evaluation

The combination of quantitative evaluation(QE)and non-quantitative evaluation(NQE)is an important evaluation tool in the fields of academic level evaluation(e.g.,EasyChair,Academic paper review form)and internet commodity evaluation(e.g.,Amazon’s review,Feedback).But the inconsistency between QE and NQE greatly reduces the correctness and usability of the evaluation.Therefore,it is a necessary task to judge whether QE is consistent with NQE.In this paper,the predicate formula satisfiability problem is firstly reduced in polynomial time to the consistency problem of QE and NQE,and the uncertainty of the consistency problem is proved.Then the approximate solution to the problem is investigated by using a natural language processing method,which performs sentiment analysis on NQE and finally invokes a database query statement to determine whether QE is consistent with NQE.The results shed light on the feasibility of using the natural language processing method to solve undecidable problems.

THE CONTEMPORARY DRIVE TO PRESERVE AND DEVELOP TRADITIONAL TIBETAN CUL TURE

Preserving and carrying on the finerpoints of traditional Tibetan culture as well as promoting further advancement and innovation in order to satisfy the growing expectations regarding the spiritual and cultural lives of those living in today's modern society are not only publicly recognized as relevant world values,but are valid points in effectively upholding and shouldering the principle of governance.

核的分解与极大广义Bochner-Riesz平均

设l∈N,δ=k/p-k+1/2,以及<p<1.本文的主要结果是建立广义BochnerRiesz平均的核的某种分解: ((1-|ξ|~l)~σ+)^(x)=sum from f=1 to J(k,l,p) b_f((1-|ξ|~2)ь+ζ)^(x)+T(|x|),其中T满足 T^(n+1)(s)≤cmin{(1+s)_(k-n-2),(1+s)^(-k,p)},0<s<∞以及n=[K(1/p-1)]·作为上述分解的一个直接结果,我们得到:临界阶广义Bochner-Riesz平均在H^p(R^k)上的a.e.收敛性。

一类实多项式映射零点的分布

设P:IR^(2n)→IR~?(2n)是(q_1,…,q_(2n))次实多项式映射,满足q_(2j-1)-q_(2j),j=1,2,…,n。本文讨论这类多项式映射的实零点分布,并给出计算一批实零点的方法。

一位改变我生活的女孩(英文)

My childhood and adolescence1were a joyous outpouring2 of energy,a ceaseless3 quest for expression,skill,and experience.School was only a background to the supreme delight of lessons in music,dance,and dramatics,and the thrill of sojourns4 in the country,theaters,and concerts.And books,

PSL的有界模型检验

基于SAT的有界模型检验被视为是基于OBDD的符号化模型检验技术的重要补充,是并行反应式系统的一种有效验证方法.然而,直至现在,有界模型检验已验证的属性逻辑还十分有限.PSL是一种用于描述并行系统的属性规约语言(IEEE-1850),包括线性时序逻辑FL和分支时序逻辑OBE两部分.通过模型检验可验证系统的PSL属性,本文提出了PSL的有界模型检验方法及其算法框架.首先,定义PSL逻辑的有界语义,而后,将有界语义进一步简化为SAT,分别将PSL性质规约公式和系统M的状态迁移关系转换为SAT命题公式,最后验证上述两个SAT命题公式合取式的可满足性,这样就将时序逻辑PSL的存在模型检验转化为一个命题公式的可满足性问题,并用一个队列控制电路实例具体解释算法执行过程.

FURTHER INVESTIGATION ON REFLECTION AND REFRACTION OF FINITE AMPLITUDE SOUND WAVE

Based on the authors'former work,a study on reflection and refraction of finite-amplitude sound wave was carried out.A solution completely satisfying the continuity conditions was obtained by means of the method of making the inhomogeneous terms of the wave equation to be determined.

一类积分-微分方程解的有界性

本文研究了积分-微分方程解的有界性质。给出了方程(A)所有解有界的判別准则,同时也研究了方程(A)解的渐近性质。给出了方程(A)所有解当t→∞时趋向于有穷极限的充分条件。