The other side of ranking schemes: generating weights for specified outcomes

This paper treats the problem of how to determine weights in a ranking, which will cause a selected entity to attain the highest possible position. We establish that there are two types of entities in a ranking scheme: those which can be ranked as number one and those which cannot. These two types of entities can be identified using the “ranking hull” of the data; a polyhedral set that envelops the data. Only entities with data points on the boundary of this hull can attain the number one position. There are no weights that will make an entity whose data point is in the interior of the hull to ever attain the number one position. We deal with these two types of entities separately. In the first case, we propose an approach for finding a set of weights that, under special conditions, will result in a selected entity achieving the top of the ranking without ties and without ignoring any of the attributes. For the second category of entities, we devise a procedure to guarantee that these entities will attain their highest possible position in the ranking. The first case will require using interior point methods to solve a linear program (LP). The second case involves a binary mixed integer formulation. These two mathematical programs were tested on data from a well‐known university ranking.     

基于灰色聚类的系统群安全评估方法

目前大多数信息系统的安全评估工作基于某个单一系统,根据其各个属性分层评估其安全状态,而面向系统群来评价信息系统安全等级的方法较少。针对信息系统的安全需求,提出一种基于系统群的安全等级评估方法。考虑到灰色系统理论中的灰色聚类分析方法采用白化权函数将一些评价对象分为几个等级,适合于系统结构复杂、不确定性高、有效信息缺乏的系统分析,文中使用白化权函数来确定信息系统的安全评估等级。首先,从参与评价的信息系统的角度,采用高效快速的K-均值聚类算法确定白化权函数;其次,运用白化权函数得出各个信息系统的灰级灰色聚类系数;最后,得出各个信息系统的安全状态等级。实例结果表明,该方法可快速有效地对信息系统群的安全等级进行评估。     

一种基于标签概率相关性的微博推荐方法

向微博用户推荐对其有价值和感兴趣的内容,是改善用户体验的重要途径。通过分析微博的特点以及现有微博推荐算法的缺陷,利用标签信息表征用户兴趣,提出一种基于标签概率相关性的微博推荐方法 LPCMR。首先,该方法利用标签之间的概率相关性,构造标签相似性矩阵。然后通过相关性标签权重加权方案,加强标签权重,构建用户-标签矩阵。针对用户标签矩阵稀疏的问题,采用标签相似性矩阵对用户-标签矩阵进行更新,使该矩阵既包含用户兴趣信息,又包含标签与标签之间的关系。以新浪微博公开API抓取的微博信息作为实验数据,进行了一系列的实验和分析,结果表明本文提出的推荐算法具有较好的效果。     

基于多尺度top-hat变换的自适应彩色图像增强

针对传统彩色图像增强过程中的过度增强及空间变化所引起的信息丢失现象,在RGB空间提出一种基于数学形态学top-hat算法,以各分量标准差权重比例为调控因子的彩色图像增强方法。首先,提取R、G、B通道多尺度下的亮、暗细节特征,然后利用控制因子对有应用价值的细节特征进行增强,最后组合三个分量,得到增强的目标图像。实验结果表明,该方法能有效增强图像对比度,避免过度增强,且能很好地保持亮度,视觉效果良好。     

基于MSC Nastran的优化技术

减轻结构质量对现代飞机具有极其重要的意义,进行结构优化设计可以更加合理地确定材料分布,提高材料的利用率,从而满足这一目标要求.目前,结构优化技术已广泛应用于飞机结构设计中,通过确定优化设计变量、优化区域以及响应约束,采用MSC Nastran对机翼进行优化设计,在满足强度刚度设计要求的前提下,实现结构质量最轻的设计目标.     

Weighted dynamic time warping for time series classification

Dynamic time warping (DTW), which finds the minimum path by providing non-linear alignments between two time series, has been widely used as a distance measure for time series classification and clustering. However, DTW does not account for the relative importance regarding the phase difference between a reference point and a testing point. This may lead to misclassification especially in applications where the shape similarity between two sequences is a major consideration for an accurate recognition. Therefore, we propose a novel distance measure, called a weighted DTW (WDTW), which is a penalty-based DTW. Our approach penalizes points with higher phase difference between a reference point and a testing point in order to prevent minimum distance distortion caused by outliers. The rationale underlying the proposed distance measure is demonstrated with some illustrative examples. A new weight function, called the modified logistic weight function (MLWF), is also proposed to systematically assign weights as a function of the phase difference between a reference point and a testing point. By applying different weights to adjacent points, the proposed algorithm can enhance the detection of similarity between two time series. We show that some popular distance measures such as DTW and Euclidean distance are special cases of our proposed WDTW measure. We extend the proposed idea to other variants of DTW such as derivative dynamic time warping (DDTW) and propose the weighted version of DDTW. We have compared the performances of our proposed procedures with other popular approaches using public data sets available through the UCR Time Series Data Mining Archive for both time series classification and clustering problems. The experimental results indicate that the proposed approaches can achieve improved accuracy for time series classification and clustering problems.     

A framework with modified fast FCM for brain MR images segmentation

Intensity inhomogeneity, noise and partial volume (PV) effect render a challenging task for segmentation of brain magnetic resonance (MR) images. Most of the current MR image segmentation methods focus on only one or two of the effects listed above. In this paper, a framework with modified fast fuzzy c-means for brain MR images segmentation is proposed to take all these effects into account simultaneously and improve the accuracy of image segmentations. Firstly, we propose a new automated method to determine the initial values of the centroids. Secondly, an adaptive method to incorporate the local spatial continuity is proposed to overcome the noise effectively and prevent the edge from blurring. The intensity inhomogeneity is estimated by a linear combination of a set of basis functions. Meanwhile, a regularization term is added to reduce the iteration steps and accelerate the algorithm. The weights of the regularization terms are all automatically computed to avoid the manually tuned parameter. Synthetic and real MR images are used to test the proposed framework. Improved performance of the proposed algorithm is observed where the intensity inhomogeneity, noise and PV effect are commonly encountered. The experimental results show that the proposed method has stronger anti-noise property and higher segmentation precision than other reported FCM-based techniques.     

区间互补判断矩阵可接受一致性

对区间互补判断矩阵的一致性进行研究,提出一种新的可接受一致性定义,将不满足可接受一致性的矩阵较容易地修正为可接受一致性矩阵.基于凸组合方法,一族明晰数互补判断矩阵的权重向量可被用来求取可接受一致性区间互补判断矩阵的区间权重,并提出了求取可接受一致性区间互补判断矩阵区间权重向量的算法.数值例子显示了所提出的可接受一致性定义以及算法的可行性和有效性.     

一种基于ETSK模糊模型的模糊控制算法

基于扩张原理的ＴＳＫ模型（ＥＴＳＫ模型）,推导出一种ＥＴＳＫ模型的等价表达形式（变权ＴＳＫ模型）。该模型将规则后件中的模糊数及其扩展运算转化为普通数的运算。进而给出一种基于ＥＴＳＫ模型的模糊控制算法（ＭＢＦＣ）。仿真结果表明,该算法具有较好的控制效果。     

Optimality-criteria-based probabilistic structural design

The possibility of extending absolute minimum weight designs for sandwich beam systems or fibre-reinforced beams and plates is considered when both the extreme loading applied to the system and the beam bending resistance properties are described in probabilistic rather than deterministic terms. It is shown that such an extension is possible provided certain plausible assumptions are made about the probabilistic modelling of the system. Examples considered include simple and continuous beams under loading of uncertain magnitude, direction or location. It is shown that the classical (deterministic) optimal solutions remain valid under reasonable assumptions. The extension of the probabilistic solutions to a wider class of examples is discussed. Received October 20, 2000