Mean-square stability for discrete bilinear systems in Hilbert space

A discrete system is uniformly mean-square stable if uniform convergence is preserved between input and state correlation sequences, and if nuclearity is preserved between the input and state correlation limits. This paper supplies a contraction-free condition ensuring mean-square stability for infinite-dimensional bilinear systems evolving in a separable Hilbert space.     

Choosing OWA operator weights in the field of Social Choice

One of the most important issues in the theory of OWA operators is the determination of associated weights. This matter is essential in order to use the best-suited OWA operator in each aggregation process. Given that some aggregation processes can be seen as extensions of majority rules to the field of gradual preferences, it is possible to determine the OWA operator weights by taking into account the class of majority rule that we want to obtain when individuals do not grade their pairwise preferences. However, a difficulty with this approach is that the same majority rule can be obtained through a wide variety of OWA operators. For this reason, a model for selecting the best-suited OWA operators is proposed in this paper.     

Laplace spectra as fingerprints for image recognition

In the area of image retrieval from data bases and for copyright protection of large image collections there is a growing demand for unique but easily computable fingerprints for images. These fingerprints can be used to quickly identify every image within a larger set of possibly similar images. This paper introduces a novel method to automatically obtain such fingerprints from an image. It is based on a reinterpretation of an image as a Riemannian manifold. This representation is feasible for gray value images and color images. We discuss the use of the spectrum of eigenvalues of different variants of the Laplace operator as a fingerprint and show the usability of this approach in several use cases. Contrary to existing works in this area we do not only use the discrete Laplacian, but also with a particular emphasis the underlying continuous operator. This allows better results in comparing the resulting spectra and deeper insights in the problems arising. We show how the well known discrete Laplacian is related to the continuous Laplace-Beltrami operator. Furthermore, we introduce the new concept of solid height functions to overcome some potential limitations of the method.     

Discrete quadratic curvature energies

We present a family of discrete isometric bending models (IBMs) for triangulated surfaces in 3-space. These models are derived from an axiomatic treatment of discrete Laplace operators, using these operators to obtain linear models for discrete mean curvature from which bending energies are assembled. Under the assumption of isometric surface deformations we show that these energies are quadratic in surface positions. The corresponding linear energy gradients and constant energy Hessians constitute an efficient model for computing bending forces and their derivatives, enabling fast time-integration of cloth dynamics with a two- to three-fold net speedup over existing nonlinear methods, and near-interactive rates for Willmore smoothing of large meshes.     

Linear variational principle for convex vector maximization

For infinitely dimensional convex vector maximization problems, it is proved that there exists, under certain conditions, an arbitrarily small additive perturbation of the performance criterion by a linear continuous operator such that the perturbed problem has efficient solutions. The study was sponsored by the Ukrainian State Fund for Basic Research __________ Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 105–114, March–April 2007.     

非线性光孤子传输方程的研究

本文在从描述光孤子在单模光纤中的非线性传输方程（ＮＬＳ，即非线性薛定谔方程）出发，利用Ｍａｘｗｅｌｌ方程和慢变包络近似性，导出ｐｓ量级光孤子高阶修正的非线性薛定谔方程（ＨＭＮＬＳ）可进一步研究色散，损耗等高价效应对孤子传输造成的影响。     

Mesh Simplification Based on Super-Face and Genetic Algorithm in Reverse Engineering

Mesh simplification is one of the most important links in the context of reverse engineering. It is also an important consideration in computer graphics. This paper presents a novel and original method of triangular mesh reduction. A new concept of super-face is defined. In order to construct a super-face, a way to calculate the scattered point curvature is discussed. The growth of a seed point and the combination of different regions are also necessary for the construction of a super-face. When the hole left by the deletion of super-face is retriangulated a genetic algorithm is used that has been modified for our specific problem. Then the different weights to balance the optimisation of the new triangular mesh can be adjusted.     

基于波动方程的聚焦点控制照明叠前深度偏移

 基于波动方程的聚焦点控制照明叠前深度偏移技术借助于差分计算，把速度、密度等介质参数的影响体现在差分计算的矩阵方程中，能够自动适应速度场的任意变化，快速傅里叶变换的使用也加速了波场延拓的计算速度。因此此法兼具有限差分偏移方法和傅里叶偏移方法的优点，既可适应速度场的剧烈变化，又可保证对陡倾地层的成像效果，是目前针对复杂构造最有效的成像方法之一。对于单个聚焦点及其周围的成像步骤为：①采用矩形网格情况下绕射走时的有限差分计算方法生成合成算子；②应用合成算子来合成面炮震源和面波记录；③对合成的面炮震源和面波记录做傅里叶有限差分法波动方程叠前深度偏移，得到该聚焦点及其附近区域的成像结果。按照上述成像步骤，将震源波场和炮集记录依据相应的外推公式进行延拓，最终应用成像条件求取成像值。在地质目标处选取多个聚焦点，可以得到面向目标的控制照明偏移成像，在多个层位上选取多个聚焦点进行控制照明叠前深度偏移，可以得到整块区域的成像。通过对Marmousi模型的试算，取得了较好的效果。