压差式矢量水听器方位估计中的干扰抵消

矢量水听器由于能获取声场中标量（声压）和矢量（振速）信息，因此单个的矢量水听器就可实现目标方位估计。单个矢量水听器是利用信号的声压和质点振速之间相关性进行信号方位估计，但是当存在干扰，并且干扰和信号之间相关时，如果对运用能量流进行方位估计的方法不加改进，则会出现很大的误差，甚至出现错误的估计。本文提出一种存在已知噪声干扰情况下的干扰抵消方法，并针对该方法进行了仿真试验，最后运用湖试数据进行了验证。结果表明，该方法能有效地减弱相千千柑对信号的影响，实现对信号的方位估计。     

On the role of heterogeneous and imperfect information in a laboratory financial market

In this paper, we analyze the behavior of a group of heterogeneously informed investors in an laboratory asset market. Our experimental setting is inspired by Huber et al. (On the benefit of information in markets with heterogeneously informed traders: an experimental study, 2004). However, instead of their system of cumulative and exogenously given information structure, we introduce an information market where the traders can buy an imperfect prediction of the future value of the dividend with a maximum anticipation of four periods. The accuracy of the prediction decreases with the chosen time horizon, whereas its price remains constant. Our results confirm a non-strictly monotonic increasing value of the information.     

向量变分不等式的严格可行性问题

本篇文章首先定义了向量变分不等式的严格可行点概念,其次在假设了映射是强(D)-伪单调的情况下,证明了向量变分不等式解集非空有界与其严格可行点存在的等价性问题,推广了在数量变分不等式上得到的相应结果．     

Linear least squares problems with data over incomplete grids

The paper addresses bivariate surface fitting problems, where data points lie on the vertices of a rectangular grid. Efficient and stable algorithms can be found in the literature to solve such problems. If data values are missing at some grid points, there exists a computational method for finding a least squares spline by fixing appropriate values for the missing data. We extended this technique to arbitrary least squares problems as well as to linear least squares problems with linear equality constraints. Numerical examples are given to show the effectiveness of the technique presented. AMS subject classification (2000)  65D05, 65D07, 65D10, 65F05, 65F20     

Representations, convolution square roots and spherical vectors

We extend results on square integrable representations of a locally compact group to subrepresentations of a representations induced from a character of a closed subgroup. We do so working in the framework of quotient representations of ∗-algebras.     

Measurability criteria for fuzzy random vectors

Fuzzy random vector is a measurable map from a probability space to a collection of fuzzy vectors. Our aim in this paper is to discuss the measurability criteria for fuzzy random vectors, and show that under mild assumption, the measurability criteria for upper semicontinuous fuzzy random vectors can be expressed in several different but equivalent formulations. Finally, applying the obtained results, we resolve an open problem about the relationship between fuzzy random vectors and fuzzy random variables.     

凸域内弦的平均长度

本文研究了凸域内弦的平均长度.通过广义支持函数与凸域的弦幂积分,建立了凸域内弦的平均长度的一般公式,并用此公式得出了圆域和矩形域内弦的平均长度.     

ISLAND, revisited

This paper is in answer to the comment on the GRG paper: Lockerbie N.A. Gen. Rel. Grav. 36, 593 (2004), made by A.V. Sanders, G.T. Gillies (ibid.). N. A. Lockerbie is a member of the STEP (Satellite Test of the Equivalence Principle) Science Study Team, and an Associate of the Institute for Gravitational Research at the University of Glasgow, Scotland, UK.     

Feature Selection using Fuzzy Support Vector Machines

The feature selection consists of obtaining a subset of these features to optimally realize the task without the irrelevant ones. Since it can provide faster and cost-effective learning machines and also improve the prediction performance of the predictors, it is a crucial step in machine learning. The feature selection methods using support machines have obtained satisfactory results, but the noises and outliers often reduce the performance. In this paper, we propose a feature selection approach using fuzzy support vector machines and compare it with the previous work, the results of experiments on the UCI data sets show that feature selection using fuzzy SVM obtains better results than using SVM.     

Adaptive application of operators in standard representation

Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could be shown under the assumption that the entries in properly compressed standard representations are known or computable in average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption is justified in the context of elliptic boundary value problems. Dedicated to Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 41A25, 41A46, 65F99, 65N12, 65N55. This work has been supported in part by the Deutsche Forschungsgemeinschaft SFB 401, the first and third author are supported in part by the European Community's Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY). The second author acknowledges the financial support provided through the European Union's Human Potential Programme, under contract HPRN-CT-2002-00285 (HASSIP) and through DFG grant DA 360/4–1.