A Unified View on Clustering Binary Data

Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This paper studies the problem of clustering binary data. Binary data have been occupying a special place in the domain of data analysis. A unified view of binary data clustering is presented by examining the connections among various clustering criteria. Experimental studies are conducted to empirically verify the relationships.     

一种智能卡口令认证方案的分析与改进

袁,吕提出了一种智能卡口令认证方案.在他们的方案中,用户能随意更改口令,远程系统不需要存储用户的口令表或验证表,并能防止重放攻击.作者指出袁-吕方案不能抵抗假冒攻击,并进行了改进.     

一种基于Web文本聚类的用户兴趣发现模型的研究

研究了一种基于Web文本聚类的用户兴趣发现方法．他通过Web文档信息获取，文本的形式表示，以及Web文本聚类方法最终提取用户兴趣知识，并给出了一个设计模型。     

Studies of substrate specificities of lipases from different sources

Although lipases are widely applied in a wide variety of reactions, available information on the factors that are responsible for the substrate specificities of lipases from different sources is scarce. In this paper, nine lipase‐producing microorganism strains were isolated from oil‐containing samples. The properties of these enzymes, including pH optima, temperature optima, thermal stability, and pH stability, vary significantly with the different sources from which these lipases were isolated. The substrate specificities of the nine lipases, including fatty acid and positional specificities, were also studied. The fatty acid specificities of the nine lipases were observably different toward 15 substrates with different carbon chain lengths, different saturation degrees and different side chains. The lipases from S₃ Penicillium citrinum (PCL), MJ₁ Aspergillus niger (ANL), MJ₂ Aspergillus oryzae (AOL), YM Bacillus coughing (BCL), S₉ Geotrichum candidum (GCL), and S₁₁ Candida lypolytica (CLL) showed the strongest specificities to short‐chain esters, and the other lipases showed strong selectivity for medium‐ or long‐chain and branched esters. The positional specificities were examined by analyzing the hydrolytic products of triolein catalyzed by the nine lipases, using TLC. The lipases can be mainly classified into two groups by their specificities for the ester bond at position 2 of triglycerides; one group can selectively hydrolyze the ester bond at position 2 of the triglycerides, the other group cannot. All these nine lipases were divided into four groups by hierarchical clustering analysis on the basis of the results of fatty acid and positional specificities.     

Genetic algorithms for symbolic clustering

This paper introduces a novel methodology for clustering of symbolic objects by making use of Genetic Algorithms (GAs). GAs are a family of computational models inspired by evolution. These algorithms encode potential solutions to specific problems on simple chromosome-like data structures and apply recombination operators to these structures so as to preserve critical information. A new type of representation for chromosome structure is presented here along with a new method for mutation. The efficacy of the proposed method is examined by application to numeric data of known number of classes and also to assertion type of symbolic objects drawn from the domain of fat oil, microcomputers, microprocessors and botany. The validity of the clusters obtained is examined.     

Pseudoinverse in clustering problems

The clustering of vector observations of hyperplanes is studied. Different cases of correspondence distances are proposed and investigated, including the algebraic Jack Knife one. The efficiency, constructivity, and explicit form of formulas are provided by using the pseudoinverse technique including the pseudoinverse-perturbation theory. Results important for the application of pseudoinverse and related operators are presented. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 73–92, July–August 2007.     

Optimal implementations of UPGMA and other common clustering algorithms

In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n²)-time implementations of such algorithms which use a ‘locally closest’ joining scheme, and specify conditions under which this relaxed joining scheme is equivalent to the original one (i.e. ‘globally closest’).     

Concealed weapon detection and visualization in a synthesized image

Images acquired by heterogeneous image sensors may provide complementary information about the scene, for instance, the visual image can provide personal identification information like the facial pattern while the infrared (IR) or millimeter wave image can detect the suspicious regions of concealed weapons. Usually, a technique, namely multiresolution pixel-level image fusion is applied to integrate the information from multi-sensor images. However, when the images are significantly different, the performance of the multiresolution fusion algorithms is not always satisfactory. In this study, a new strategy consisting of two steps is proposed. The first step is to use an unsupervised fuzzy k-means clustering to detect the concealed weapon from the IR image. The detected region is embedded in the visual image in the second step and this process is implemented with a multiresolution mosaic technique. Therefore, the synthesized image retains the quality comparable to the visual image while the region of the concealed weapon is highlighted and enhanced. The experimental results indicate the efficiency of the proposed approach.This material is based on part of the work carried out at the SPCR laboratory of Lehigh University and the work is partially supported by the U. S. Army Research Office under grant number DAAD19-00-1-0431. The content of the information does not necessarily reflect the position or the policy of the federal government, and no official endorsement should be inferred.     

Robust pole clustering in a good ride quality region of aircraft for matrices with structured uncertainties

This paper presents a general analysis of robust pole clustering in a good ride quality region (GRQR) of aircraft for matrices with structured uncertainties. This region is an intersection of a ring and a horizontal strip, located in the left half-plane, which is a specific non-Ω-transformable region providing good ride quality of aircraft. The paper applies the Rayleigh principle along the norm theory to analyze robust pole clustering within this region since the generalized Lyapunov theory is not valid for non-Ω-transformable regions. Concerned uncertainties are structured/parametric uncertainties, including interval matrices. The results are useful for robust control analysis and design, especially, of robust good ride quality of aircraft, shuttles, vehicles and space station, as well as some industrial systems. An example of the F-16 dynamics for which GRQR is suitable is included to illustrate the results.     

一种基于数据竞争的高分辨率图像的聚类分割算法

近些年,机器人技术得到了迅猛的发展,应用越来越广泛.随着机器人技术的推广和普及,对机器人使用的要求也越来越高,其中对智能机器人的要求尤显迫切.机器视觉是智能机器人研究领域的一个重要研究方向.在机器人视觉系统中,核心问题是目标提取,对目标实时、准确、快速提取的关键技术是图像分割.由于机器人感知的环境的复杂性及目标的多样性,往往导致机器人感知获得的图像数据量较大且图像本身存在不可预知的复杂性,这就对准确的目标分割和提取处理提出了挑战性问题.本文针对高分辨率图像数据集的分割处理,提出一种新的聚类算法,即根据数据点能量和的大小识别类代表点和类成员点,通过数据点间的竞争识别出最有能力成为簇成员的数据点,并将其与mean shift聚类算法有效地结合应用于彩色图像分割问题中,能够快速高效地实现高分辨率图像的目标分割,并得到较好的图像分割效果.实验结果表明,本文算法在分割效果和分割效率上明显优于传统聚类算法.