When is a sequence of sufficient σ-algebras a filter system?

A very general formulation was given by van Schuppen in 1979 for stochastic dynamic systems (SDS) in terms of σ-algebra families but not in the same generality for the corresponding filter system. As usual filters were defined indirectly as SDS solving the filtering problem, i.e. the recursive computation of the conditional state distribution. Adopting a Bayesian point of view we are able to establish a connection between statistical notions and discrete time filtering on a measure theoretic level. We show that sufficiency alone is not enough to make a sequence of statistics a filter and that the additional condition required is transitivity. We conclude that a transitive sequence of sufficient statistics is a SDS, namely a filter system.     

基于拓扑传递的耦合机械故障特征提取方法

旋转机械系统的复杂性,使得其特征参量具有较强的非线性和耦合性,对其进行有效特征提取存在困难。为了提取旋转机械系统耦合故障的特征信息,建立其状态特征信息拓扑空间,并构建旋转机械系统拓扑动力系统模型,基于系统的拓扑传递特性,提出了新的旋转机械系统特征提取的信息空间变换方法。通过跟踪系统特征信息的变换及传递过程,实现对系统特征信息的提取,从一个新的角度为分析旋转机械系统工作特性奠定基础。最后将该方法应用到含油膜力的裂纹故障、碰摩故障及裂纹碰摩耦合故障的旋转机械系统信息特征提取中,并通过仿真实验验证了理论方法的可行性。     

对直觉模糊关系的传递性研究

在直觉模糊关系再研究的基础上,提出了传递的直觉模糊关系、传递闭包核算子及其性质,得出了直觉模糊关系的极小定理。利用直觉模糊关系合成运算及其性质给出传递的直觉模糊关系、直觉模糊关系的传递闭包算子。利用直觉模糊关系的性质得出了传递闭包的计算公式和性质,并给出必要的证明。当R是对称的,通过自反闭包算子、对称闭包算子、传递闭包算子作用R,可最多得出6个彼此不同的直觉模糊关系。     

浅论汉英动宾结构的异同

详细比较了汉语和英语两种语言中动宾结构在形式和内涵上的相同点和不同点 ,找出了一些动宾支配与被支配关系的规律 ,从而帮助我们更好地理解这两种语言     

The invariant optimal sampling plan in a sequentially planned decision procedure

We define the invariant sequentially planned decision procedure under a group of measurable transformations. By means of a previous reduction of the problem, we obtain the optimal invariant sequentially planned decision procedure that minimizes the risk function. First we find the solution for the horizon with a maximal number of stages, based on the present information; later, the general case is solved but the solution is based on the past information. Finally, we study the possibility of approximating the general case by a sequence of truncated problems with a maximal number of stages, obtaining a solution based on the present information.     

Generalized hard cluster analysis

In this paper, we generalize the hard clustering paradigm. While in this paradigm a data set is subdivided into disjoint clusters, we allow different clusters to have a nonempty intersection. The concept of hard clustering is then analysed in this general setting, and we show which specific properties hard clusterings possess in comparison to more general clusterings. We also introduce the concept of equivalent clusterings and show that in the case of hard clusterings equivalence and equality coincide. However, if more general clusterings are considered, these two concepts differ, and this implies the undesired fact that equivalent clusterings can have different representations in the traditional view on clustering. We show how a matrix representation can solve this representation problem.     

Controllability of Generic Inequalities Near Singular Points

In this paper the authors obtained some sufficient conditions under which one has the small local controllability property for a general nonlinear control system described by a system of nonlinear inequalities.     

Spectral Decomposition Theorem for non-hyperbolic maps

In this article, we study the dynamics of non-wandering points in terms of chain recurrence. We introduce two properties which weaken usually assumed topological hyperbolicity. As a result, we state a generalized version of the Smale Spectral Decomposition Theorem.     

DSm信任模型下的信任传递

将DSm（Dezert—Smarandache）任模型用于开放社区的信任管理。文章介绍了在该模型下信任传递中的有关概念，提出了信任的传递方法，设计仿真实验分析了一些参数对信任传递的影响。     

Parsimonious testing of transitive or intransitive preferences: Reply to Birnbaum (2011).

Birnbaum (see record 2011-23298-003) raised important challenges to testing transitivity. We summarize why an approach based on counting response patterns does not solve these challenges. Foremost, we show why parsimonious tests of transitivity require at least 5 choice alternatives. While the approach of Regenwetter, Dana, and Davis-Stober (see record 2011-00732-003) achieves high power with modest sample sizes for 5 alternatives, pattern-counting approaches face the difficulty of combinatoric explosion in permissible response patterns. Even for fewer than 5 alternatives, if the choice of how to “block” individual responses into response patterns is slightly mistaken, intransitive preferences can mimic transitive ones. At the same time, statistical tests on proportions of response patterns rely on similar “independent and identically distributed” sampling assumptions as tests based on response proportions. For example, the hypothetical data of Birnbaum (2011, Tables 2 and 3) hinge on the assumption that response patterns are properly blocked, as well as sampled independently and with a stationary distribution. We test an intransitive lexicographic semiorder model on Tversky's (1969) and Regenwetter et al.'s data and, consistent with Birnbaum's (2011) concern, we find evidence for model mimicry in some cases. (PsycINFO Database Record (c) 2011 APA, all rights reserved)