Metaheuristic downhill simplex method in combinatorial optimization

The concept of combinatorial objects is formalized. It allows strict definition of a combinatorial optimization problem (COP). An efficient metaheuristic method to solve COPs (H-method) is considered. It includes stochastic local search algorithms as a built-in procedure. A parallel implementation of the H-method is set forth and analyzed. The results from a numerical experiment and solution of some well-known COPs on personal computers and on the SKIT cluster supercomputer are presented. The study was supported by INTAS (Project 06-1000017-8909). __________ Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 70–79, November–December 2007.     

灵活运用数据库设计理论

简介了关系模型、键、完整性规则、E-R模型、函数依赖、模式分解和关系模式的范式等数据库技术基础和规范化设计理论，从键和完整性规则的实现、数据冗余的特殊情况和字典设计等方面论述了在实际设计工作中如何灵活运用关系数据库设计理论。     

金属矿山深热矿井空气温度的灰色预测

金属矿山深热矿井气温的预测计算是一个难题，本文探讨了应用灰色系统预测理论来解决这一难题的新途径，并通过实例验证了该方法的可行性和有效性。     

汽轮机转子热应力在线计算灰色数学模型

热应力计算中边界条件、物性参数和初始条件等模型输入参数的灰色特性，使得以近似点值为输入得到的计算结果缺乏准确性依据和度量，该文提出的灰色数学模型，用区间数代替近似点值建立灰色数学模型，得出热应力在线计算值的灰色描述，可以更好地符合工程计算需要。文中针对模型应用的复杂程度，以汽轮机转子为对象，对单纯灰边界问题给出了简单的端点计算法及其依据；对复合灰边界灰物性问题建立了差分格式的数学模型，应用区间高斯迭代算法，结合模型结构特点推导了简易的基于内包含不等式的算法，并且给出两种算法的数值算例对比。     

孤东油田的海油陆采进展

孤东油田极浅海区域新发现几个边际油藏。其中垦东401块水深-2m,距陆地2.7km,为稀油、疏松砂岩油藏,试油获14～25t/d工业油流。在三维地震、测井约束地震反演、数值模拟和油藏经营管理评价基础上编制了产能建设方案,通过修筑海公路、人工岛、丛式井组、大位移水平井、采用数据采集与控制的远程测控和紧急关断技术,能够无人职守、遥测遥控,整体实现了海油陆采。有效动用地质储量233×104t,钻井12口,建成年产油4×104t能力,累产油8.6×104t。目前在垦东12人工岛上钻打了26口井,推广了海油陆采经验。     

On perspectives, theories, models, and friends: A reply to the relationalists.

The authors respond to the "relational" issue of Psychoanalytic Psychology (PP; Vol. 12, No. 1) and support Karol Marshall's remonstration about the need to clarify what exactly the category relational refers to. It is noteworthy that in this issue of PP the relational thinkers do not engage the specific topics of our essay. The author's article attempted to review the most comprehensive relational thinkers of that time across theoretical variables. Relationalists have begun to spell out the technical consequences of their perspective in recent discussions of neutrality, authority, and self-disclosure, among other issues. This is a useful trend in the relational literature, and we hope it continues. We are concerned, however, that the relational thinkers writing in this issue tend to dismiss the contributions to PP 12(1) because the perspectives presented there did not satisfy the relationalist vision of how scientific exchange should be undertaken. Although we feel that it is important for emerging points of view to be able to elaborate assumptions, constructs, and principles within their own framework and in their own way, constructive dialogue, much less a comparative analysis of the contributions and limitations of different points of view, requires that we have some common ground. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A design and analysis of objective function-based unsupervised neural networks for fuzzy clustering

Fuzzy clustering has played an important role in solving many problems. In this paper, we design an unsupervised neural network model based on a fuzzy objective function, called OFUNN. The learning rule for the OFUNN model is a result of the formal derivation by the gradient descent method of a fuzzy objective function. The performance of the cluster analysis algorithm is often evaluated by counting the number of crisp clustering errors. However, the number of clustering errors alone is not a reliable and consistent measure for the performance of clustering, especially in the case of input data with fuzzy boundaries. We introduce two measures to evaluate the performance of the fuzzy clustering algorithm. The clustering results on three data sets, Iris data and two artificial data sets, are analyzed using the proposed measures. They show that OFUNN is very competitive in terms of speed and accuracy compared to the fuzzy c-means algorithm.     

面向对象数据库（OODB）与关系数据库（RDB）之比较研究

面向对象数据库至今还没有权威的定义，为把握与了解面向对象数据库的实质，我们采用比较研究法，首先从数据库发展史来剖析面向对象数据库与关系数据库之间的联系与差异。然后在功能，性能上分别讨论各自的亿势与劣势，阐面向对象数据库的本质与特征。     

EXTENSION OF THE RELATIONAL DATABASE AND ITS ALGEBRA WITH ROUGH SET TECHNIQUES

This paper describes a database model based on the original rough sets theory. Its rough relations permit the representation of a rough set of tuples not definable in terms of the elementary classes, except through use of lower and upper approximations. The rough relational database model also incorporates indiscernibility in the representation and in all the operators of the rough relational algebra. This indiscernibility is based strictly on equivalence classes which must be defined for every attribute domain. There are several obvious applications for which the rough relational database model can more accurately model an enterprise than does the standard relational model. These include systems involving ambiguous, imprecise, or uncertain data. Retrieval over mismatched domains caused by the merging of one or more applications can be facilitated by the use of indiscernibility, and naive system users can achieve greater recall with the rough relational database. In addition, applications inherently “rough” could be more easily implemented and maintained in the rough relational database.     

植物抗性基因识别中的随机森林分类方法

为了解决传统基于同源序列比对的抗性基因识别方法中假阳性高、无法发现新的抗性基因的问题,提出了一种利用随机森林分类器和K-Means聚类降采样方法的抗性基因识别算法。针对目前研究工作中挖掘盲目性大的问题,进行两点改进:引入了随机森林分类器和188维组合特征来进行抗性基因识别,这种基于样本统计学习的方法能够有效地捕捉抗性基因内在特性;对于训练过程中存在的严重类别不平衡现象,使用基于聚类的降采样方法得到了更具代表性的训练集,进一步降低了识别误差。实验结果表明,该算法可以有效地进行抗性基因的识别工作,能够对现有实验验证数据进行准确的分类,并在反例集上也获得了较高的精度。