The Chang-Łoś-Suszko theorem in a topological setting

The Chang-Łoś-Suszko theorem of first-order model theory characterizes universal-existential classes of models as just those elementary classes that are closed under unions of chains. This theorem can then be used to equate two model-theoretic closure conditions for elementary classes; namely unions of chains and existential substructures. In the present paper we prove a topological analogue and indicate some applications.     

不完全信息群体决策专家权重的集结

本文对于属性权重信息和属性效用信息都不完全的群体多属性决策问题，通过构造属性值区间和运用系统聚类分析法，对群体决策中的专家进行分类，并确定每位专家的权重．     

贫困地区经济发展中主导产业的选择方法

拟定了贫困地区经济发展中主导产业选择的五条原则,并提出了选择主导产业的一种方法,即先通过列表评分法求出各产业的优势度,再利用层次分析法确定各产业在合理发展工业中所占的相对地位,最后将两种结果相互参照确定主导产业部门。     

Integral-Type Darboux Transformations for the mKdV Hierarchy with Self-Consistent Sources

We present integral-type Darboux transformation for the mKdV hierarchy and for the mKdV hierarchy withself-consistent sources. In contrast with the normal Darboux transformation, the integral-type Darboux transformationscan offer non-auto-Backlund transformation between two (2n 1)-th mKdV equations with self-consistent sources withdifferent degrees. This kind of Darboux transformation enables us to construct the N-soliton solution for the mKdVhierarchy with self-consistent sources. We also propose the formulas for the m times repeated integral-type Darbouxtransformations for both mKdV hierarchy and mKdV hierarchy with self-consistent sources.     

Memory and a priori best strategy in complex adaptive systems

We employ an agent‐based model to show that memory and the absence of an a priori best strategy are sufficient for self‐segregation and clustering to emerge in a complex adaptive system with discrete agents that do not compete over a limited resource nor contend in a winner‐take‐all scenario. An agent starts from a corner of a two‐dimensional lattice and aims to reach a randomly selected site in the opposite side within the shortest possible time. The agent is isolated during the course of its journey and does not interact with other agents. Time‐bound obstacles appear at random lattice locations and the agent must decide whether to challenge or evade any obstacle blocking its path. The agent is capable of adapting a strategy in dealing with an obstacle. We analyze the dependence of strategy‐retention time with strategy for both memory‐based and memory‐less agents. We derive the equality spectrum to establish the environmental conditions that favor the existence of an a priori best strategy. We found that memory‐less agents do not polarize into two opposite strategy‐retention time distributions nor cluster toward a center distribution. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–46, 2004     

关于“信息熵”分析及其应用的研究

本文用Ｓｈａｎｎｏｎ熵函数的观点及最大离散熵原理，探讨了对随机试验项目的优选问题：即压缩某种“不确定性”试验项目的实施与探索．并通过应用实例的计算，获得了满意的聚类效果．这种方法对于信息资料的数据处理及压缩“不确定性“验项目具有普遍意义．     

Physics possibilities at India-based Neutrino Observatory

In this talk I review the physics possible at India-based Neutrino Observatory (INO). I discuss the improvement in the precision of currently known quantities and the possibility measuring the presently unknown quantities.     

Clustering Effect on the Statistical Estimation Accuracy of Distribution Density

The paper is devoted to statistical nonparametric estimation of multivariate distribution density. The influence of data pre-clustering on the estimation accuracy of multimodal density is analyzed by means of the Monte Carlo method. It is shown that the soft clustering is more advantageous than the hard one. While a moderate increase in the number of clusters also increases the calculation time, it considerably reduces the estimation error.     

Restorations of punctured languages and similarity of languages

Punctured languages are languages whose words are partial words in the sense that the letters at some positions are unknown. We investigate to which extent restoration of punctured languages is possible if the number of unknown positions or the proportion of unknown positions per word, respectively, is bounded, and we study their relationships for different boundings. The considered restoration classes coincide with similarity classes according to some kind of similarity for languages. Thus all results we can also formulate in the language of similarity. We show some hierarchies of similarity classes for each class from the Chomsky hierarchy and prove the existence of linear languages which are not δ ‐similar to any regular language for any δ < ½. For δ ≥ ½ this is unknown but it could only be possible in the case of non‐slender linear languages. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)