截断调和Bergman空间上Toeplitz算子的代数性质

本文首先讨论调截断和Bergman空间 $b_{n}^{2}$ 上拟齐次函数为符号的Toeplitz算子的有限秩乘积问题,其次考察两个以拟齐次函数为符号的Toeplitz算子的换位子与半换位子的有限秩问题.     

A~p()上的Toeplitz算子与Berezin变换

讨论了加权Bergman空间AP（）（1＜p＜∞）上的Toeplitz算子证明了Toeplitz算子的有限乘积的有限和是紧算子当区仅当其Berezin变换在边界趋向于零．     

A^p（φ）上的Toeplitz算子与Berezin变换

讨论了加权Bergman空间A^p(φ）（1＜p＜∞）上的Toeplitz算子的有限乘积的有限和是紧算子当且仅当其Berezin变换在边界趋向于零。     

截断调和Bergman空间上的Toeplitz算子

截断调和Bergman空间b_n~2=L_a~2{w,w~2,…,w~n}~v是Hilbert空间L~2的闭子空间.研究了单位圆盘上的截断调和Bergman空间上的Toeplitz算子的乘积问题,完整地刻画了具有有界调和符号的两个Toeplitz算子的有限秩与紧的半换位子或换位子.     

高维加权Bergman空间上的Toeplitz算子

本文研究了高维加权Bergman空间Ap(Bn,dVpφ)(1＜p＜∞).上的Toeplitz算子.利用Toeplitz算子的Berezin变换,获得了Ap(Bn,dVp)(1＜p＜∞)上具有L∞(Bn)符号的Toeplitz算子的有限乘积的有限和是紧算子的一些等价刻画,推广了加权Bergman空间Ap(D,dmpφ)上的Toeplitz算子的有限乘积的有限和是紧的当且仅当它的Berezin变换在单位圆盘的边界消失为0的结论     

加权Bergman空间上的解析Toeplitz算子的约化子空间

证明了加权Bergman空间上以有限Blaschke乘积φ为符号的解析Toeplitz算子Bφ至少存在一个约化子空间M,并且Bφ在M上的的限制酉等价于加权Bergman位移.     

加权Bergman空间上的约化子空间

主要证明在加权Bergman空间上符号为有限Blaskchke乘积的解析Toeplitz算子总是可约的,即至少有一个约化子空间.并且把该算子限制在该子空间上酉等价于加权Bergman位移.     

有界对称区域上Dirichlet空间中的紧Toeplitz算子

介绍了有界对称区域Ω上Dirichlet空间中的Toeplitz算子的紧性:如果S是有限个Toeplitz算子乘积的有限和,S是紧算子当且仅当S的Berezin变换S(z)趋于0.     

半平面中有限阶解析函数的因子分解

与经典有限阶整函数的Hadamard因子分解定理和半平面中属于Hardy空间的解析函数的内外函数的因子分解类似,对右半平面中有限阶ρ解析函数f,可以分解为三个解析函数G,eQ和eg的乘积GeQeg,其中G是一个加权Blaschke乘积,Q是一个次数不超过ρ的多项式以及eg是一个加权外函数,log|G|,ReQ和Reg-log|f|在右半平面的边界恒为零．     

单位多圆柱上Bergman空间中的分别准齐次ToePlitz算子

本文研究了单位多圆柱上Bergman空间中以分别准齐次函数为记号的Toeplitz算子的代数性质.我们首先得到了两个以分别准齐次函数为记号的Toeplitz算子可以写成一个Toeplitz算子的充分必要条件,然后利用L2(Dn,dV)的一个极分解式证明了,只要其中有一个Toeplitz算子是分别准齐次的,则其零乘积问题...     

Existence and structure results on almost periodic solutions of difference equations

We study the almost periodic solutions of Euler equations and of some more general Difference Equations. We consider two different notions of almost periodic sequences, and we establish some relations between them. We build suitable sequences spaces and we prove some properties of these spaces. We also prove properties of Nemytskii operators on these spaces. We build a variational approach to establish existence of almost periodic solutions as critical points, We obtain existence theorems fornonautonomous linear equations and for an Euler equation with a concave and coercive Lagrangian. We also use a Fixed Point approach to obtain existence results for quasi-linear Difference Equations.     

Comatrix Coring Generalized and Equivalences of Categories of Comodules

We extend the comatrix coring to the case of a quasi-finite bicomodule. We also generalize some of its interesting properties. We study equivalences between categories of comodules over rather general corings. We particularize to the case of the adjoint pair of functors associated to a morphism of corings over different base rings. We apply our results to corings coming from entwining structures and graded structures, and we obtain new results in the setting of entwining structures and in the graded ring theory.     

On the specificity of a possibility distribution

The specificity of a possibility distribution measures the degree to which the distribution allows one and only one element as its manifestation. As such it is a measure of amount of uncertainty or information. We investigate a number of issues related to specificity measures. We discuss the connection between the specificity of a possibility distribution and the entropy of a probability distribution. We describe unifying view for constructing specificity measures. We look at the relationship of the specificity of a distribution and its negation. We consider the case where the base set is continuous.     

Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem

We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first four based on Miller-Tucker-Zemlin constraints and the last two based on flows. We compare the linear programming bounds of these formulations. We derive valid inequalities and lift some of the constraints to improve the lower bounds. We generalize and strengthen subtour elimination and generalized large multistar inequalities.     

Generalizing the modeling of fuzzy logic controllers by parameterized aggregation operators

We describe the type of reasoning used in the typical fuzzy logic controller, the Mamdani reasoning method. We point out the basic assumptions in this model. We discuss the S-OWA operators which provide families of parameterized “andlike” and “orlike” operators. We generalize the Mamdani model by introducing these operators. We introduce a method, which we call Direct Fuzzy Reasoning (DFR), which results from one choice of the parameters. We develop some learning algorithms for the new method. We show how the Takagi-Sugeno-Kang (TSK) method of reasoning is an example of this DFR method.     

Inverse problems for multi-valued quasi variational inequalities and noncoercive variational inequalities with noisy data

ABSTRACT

We study the inverse problem of identifying a variable parameter in variational and quasi-variational inequalities. We consider a quasi-variational inequality involving a multi-valued monotone map and give a new existence result. We then formulate the inverse problem as an optimization problem and prove its solvability. We also conduct a thorough study of the inverse problem of parameter identification in noncoercive variational inequalities which appear commonly in applied models. We study the inverse problem by posing optimization problems using the output least-squares and the modified output least-squares. Using regularization, penalization, and smoothing, we obtain a single-valued parameter-to-selection map and study its differentiability. We consider optimization problems using the output least-squares and the modified output least-squares for the regularized, penalized and smoothened variational inequality. We give existence results, convergence analysis, and optimality conditions. We provide applications and numerical examples to justify the proposed framework.     

Bounds and Characterizations of Authentication/Secrecy Schemes

We consider authentication/secrecy schemes from the information theoretic approach. We extend results on unconditionally secure authentication schemes and then consider unconditionally secure authentication schemes that offer perfect L-fold secrecy. We consider both ordered and unordered secrecy. We establish entropy bounds on the encoding rules for authentication schemes with these types of secrecy. We provide some combinatorial characterizations and constructions for authentication schemes having perfect L-fold secrecy that meet these bounds.     

基于EM算法隐Markov模型参数估计

描述最大似然参数估计问题,介绍如何用EM算法求解最大似然参数估计.首先给出EM算法的抽象形式,然后介绍EM算法的一个应用:求隐Markov模型中的参数估计.用EM算法推导出隐Markov模型中参数的迭代公式.     

Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis

We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics. We study several priority rules for the problem and provide a comparative computational analysis of the different SGSs on sets of instances taken from the literature. The proposed SGSs significantly improve previously best-known results on a set of hard benchmark instances.     

Belief structures,weight generating functions and decision-making

We describe the Dempster–Shafer belief structure and provide some of its basic properties. We introduce the plausibility and belief measures associated with a belief structure. We note that these are not the only measures that can be associated with a belief structure. We describe a general approach for generating a class of measures that can be associated with a belief structure using a monotonic function on the unit interval, called a weight generating function. We study a number of these functions and the measures that result. We show how to use weight-generating functions to obtain dual measures from a belief structure. We show the role of belief structures in representing imprecise probability distributions. We describe the use of dual measures, other then plausibility and belief, to provide alternative bounding intervals for the imprecise probabilities associated with a belief structure. We investigate the problem of decision making under belief structure type uncertain. We discuss two approaches to this decision problem. One of which is based on an expected value of the OWA aggregation of the payoffs associated with the focal elements. The second approach is based on using the Choquet integral of a measure generated from the belief structure. We show the equivalence of these approaches.