Stability of the Sliding Mode in Nonstationary Automatic-Control Systems with Variable Structure

The paper addresses the stability of the sliding mode in nonstationary automatic-control systems of variable structure. The parameters of dynamic states are assumed to vary arbitrarily and continuously within a given bounded domain. The existence and stability conditions for the sliding mode on the switching hyperplane are established. They define nonstationary sets that contain phase velocity vectors directed away from the sliding hyperplane. The sets do not have common points with the switching hyperplane, except for the origin, for the known extreme values of the discontinuous coefficients of logical controls. This is the essence of the necessary and sufficient conditions for the stable sliding mode of the automatic-control system. The general results are used to analyze the stability conditions for the sliding mode in a nonstationary automatic-control system with a variable structure of the third order     

Improved estimation of duality gap in binary quadratic programming using a weighted distance measure

We present in this paper an improved estimation of duality gap between binary quadratic program and its Lagrangian dual. More specifically, we obtain this improved estimation using a weighted distance measure between the binary set and certain affine subspace. We show that the optimal weights can be computed by solving a semidefinite programming problem. We further establish a necessary and sufficient condition under which the weighted distance measure gives a strictly tighter estimation of the duality gap than the existing estimations.     

分担处于一般位置超平面的亚纯映射唯一性定理

本文研究从Cn到复射影空间PN(C)上亚纯映射唯一性问题.根据杨乐处理重值的方法和Dethloff、Quang、Tan等人的技巧,我们分别得到了两个广泛的唯一性定理,改进和推广了一些分担处于一般位置超平面的亚纯映射唯一性结果.     

Small faces in stationary Poisson hyperplane tessellations

We consider the tessellation induced by a stationary Poisson hyperplane process in d‐dimensional Euclidean space. Under a suitable assumption on the directional distribution, and measuring the k‐faces of the tessellation by a suitable size functional, we determine a limit distribution for the shape of the typical k‐face, under the condition of given size and this tending to zero. The limit distribution is concentrated on simplices. This extends a result of Gilles Bonnet.     

A note on Mustaţă's computation of multiplier ideals of hyperplane arrangements

In 2006, M. Mustaţă used jet schemes to compute the multiplier ideals of reduced hyperplane arrangements. We give a simpler proof using a log resolution and generalize to non-reduced arrangements. By applying the idea of wonderful models introduced by De Concini-Procesi in 1995, we also simplify the result. Indeed, Mustaţă's result expresses the multiplier ideal as an intersection, and our result uses (generally) fewer terms in the intersection.

     

基于能量色散X射线荧光光谱的鱼粉产地溯源方法研究

鱼粉是一种在养殖业中占有重要地位的高蛋白饲料原料。我国对鱼粉的市场需求很大,但不同产地的鱼粉存在品质差异的问题。为保证鱼粉品质安全,建立鱼粉产地溯源系统具有非常重要的意义。能量色散X射线荧光光谱根据元素辐射X射线荧光光子能量不同,能够检测样品矿物质元素种类和含量。鱼粉所含矿物质元素种类和含量会因鱼粉产地不同而存在差异,因此提出采用能量色散X射线荧光光谱(EDXRF)法对鱼粉进行扫描检测来获得鱼粉的元素信息,将原始光谱进行预处理后,采用鲸鱼算法改进的自适应净信号权重局部超平面方法识别鱼粉样品的光谱向量,从而对其产地进行溯源判别。首先对产地来自辽宁和浙江的51份鱼粉样品进行压片,并在EDXRF谱仪的检测程序中设置不同的滤光片,得到51组(每组6条光谱)光谱。然后对光谱进行预处理,采用基于自适应迭代重加权惩罚最小二乘法算法（airPLS）进行基线校正,从而消除基线漂移的影响,提高精度。采用小波变换对光谱进行平滑,去除光谱曲线的高频噪声。选取每个鱼粉样品6条光谱的有效区段,计算谱峰面积,获得代表样品矿物质元素含量的16维向量。最后采取鲸鱼算法对自适应净信号权重局部超平面(ANWKH)方法的关键参数（近邻数、主成分数、调节参数）进行最优选择,再利用寻找到的最优参数建立自适应净信号权重局部超平面模型,随机选取每个产地鱼粉样品的70%作为训练集,30%作为测试集进行鱼粉产地判别。鱼粉样品分别来自辽宁和浙江两个产地,经预测模型识别正确率分别为94.3%和100%,总正确率为97.3%,均高于人工寻找参数的自适应净信号权重局部超平面分类准确率。结果表明,基于能量色散X射线荧光光谱的鱼粉溯源方法能够准确地实现鱼粉产地溯源,经鲸鱼算法改进后的自适应净信号权重局部超平面方法能够寻找到最优参数,建立分类准确度更高的模型,为以后进行更加详细的国内外鱼粉产地溯源提供了参考。     

极小圈模对与二元域拟阵的特征

研究极小圈模对与二元域拟阵的特征.首先给出拟阵M的极小圈模对,模对的并的秩与相应的超平面的交的秩三者的等价关系.在两个极小圈不等的条件下,证明了满足极小圈消去公理的极小圈是唯一的并且极小圈模对的对称差包含在其中,结合极小圈的对称差的表示,证明了极小圈与基的差的绝对值大于等于2.后面两个证明都把原来的必要条件推广为充要条件.最后,用M上不相同的极小圈,极小圈模对,极小圈的对称差表示,M上不相等的超平面,超平面的并不等于E及满足的秩等式极简单地刻划了二元域拟阵M的特征.     

Generalized Exponents and Forms

We consider generalized exponents of a finite reflection group acting on a real or complex vector space V. These integers are the degrees in which an irreducible representation of the group occurs in the coinvariant algebra. A basis for each isotypic component arises in a natural way from a basis of invariant generalized forms. We investigate twisted reflection representations (V tensor a linear character) using the theory of semi-invariant differential forms. Springer’s theory of regular numbers gives a formula when the group is generated by dim V reflections. Although our arguments are case-free, we also include explicit data and give a method (using differential operators) for computing semi-invariants and basic derivations. The data give bases for certain isotypic components of the coinvariant algebra.     

Non-vanishing of the twisted cohomology on the complement of hypersurfaces

Generically, the cohomology with coefficients in a local system of rank one on the complement in of the union of a finite number of hypersurfaces vanishes except in the highest dimension. We study the non-generic case, in which the cohomology in other dimensions does not vanish. When the hypersurfaces are hyperplanes, many examples of this kind are known. In this paper, we consider the case in which the hypersurfaces need not be hyperplanes. We prove that the hypersurfaces given by some particular linear systems have non-vanishing local system cohomologies.

     

Arbitrary-norm hyperplane separation by variable neighbourhood search

^** Email: alejandro.karam{at}hec.ca^*** Email: gilles.caporossi{at}gerad.ca^**** Email: pierre.hansen{at}gerad.ca We consider the problem of separating two sets of points ina Euclidean space with a hyperplane that minimizes the sum ofp-norm distances to the plane of points lying on the ‘wrong’side of the plane. A variable neighbourhood search heuristicis used to determine the plane coefficients. For a set of exampleswith L₁-norm, L₂-norm and L-norm, for which the exact solutioncan be computed, we show that our algorithm finds it in mostcases and gets good approximations in the others. The use ofour heuristic solutions for problems in these norms can dramaticallyaccelerate exact algorithms. Our method can be applied on verylarge instances that are intractable by exact algorithms. Sincethe proposed approach works for truly arbitrary norms (otherthan the traditional 1, 2 and ), we can explore for the firsttime the effects of the choice of p on the generalization propertiesof p-norm hyperplane separation.