Upscaled DEM-CFD model for vibrated fluidized bed based on particle-scale similarities

Simulation based on discrete element method (DEM) coupled with computational fluid dynamics (CFD), coupled DEM-CFD, is a powerful tool for investigating the details of dense particle–fluid interaction problems such as in fluidized beds and pneumatic conveyers. The addition of a mechanical vibration to a system can drastically alter the particle and fluid flows; however, their detailed mechanisms are not well understood. In this study, a DEM-CFD model based on a non-inertial frame of reference is developed to achieve a better understanding of the influence of vibration in a vibrated fluidized bed. Because the high computational cost of DEM-CFD calculations is still a major problem, an upscaled coarse-graining model is also employed. To realize similar behaviors with enlarged model particles, non-dimensional parameters at the particle scale were deduced from the governing equations. The suitability and limitations of the proposed model were examined for a density segregation problem of a binary system. To reduce the computational costs, we show that the ratio between the bed width and model particle size can be reduced to a minimum value of 100; to obtain similar segregation behaviors, the ratio between the bed height and model particle size is considered unchanged.     

以一种新的距离度量作为反馈的相关跟踪方法

基于相关的模板匹配方法在图像跟踪中得到了广泛的应用,但是这种方法的主要缺点是对图像噪声非常敏感,而且由这种方法得出的相关曲面比较平坦。为了有效抑制噪声和局部遮挡对图像的影响,提出用鲁棒统计中的一个值代替相关值作为距离度量。它不是计算两幅图像的对应像素差值,而是计算两幅图像中差别不大的对应像素对的个数。实验证明这样得到的曲面相对　　收稿日期:2003 08 31;　修订日期:2003 10 28作者简介:张桂林(1944 ),男,天津人,教授,博士生导师,主要研究方向为自动识别、人体生物统计特征识别、图像处理算法与系统性能评估等。　　　　　　　要尖锐得多。当上述的距离度量应用于跟踪过程中时,模板的合理更新对跟踪非常重要。基于上述的距离度量方法,提出了一种新的模板更新策略。利用两幅图像中近似像素在整修匹配模板像素中所占的比例大小决定加权系数。这种加权策略可以自适应地根据图像序列的变化选择更新相关模板,同时在一定程度上减小模板漂移的危险。     

Efficient similarity-based operations for data integration

Dealing with discrepancies in data is still a big challenge in data integration systems. The problem occurs both during eliminating duplicates from semantic overlapping sources as well as during combining complementary data from different sources. Though using SQL operations like grouping and join seems to be a viable way, they fail if the attribute values of the potential duplicates or related tuples are not equal but only similar by certain criteria. As a solution to this problem, we present in this paper similarity-based variants of grouping and join operators. The extended grouping operator produces groups of similar tuples, the extended join combines tuples satisfying a given similarity condition. We describe the semantics of this operator, discuss efficient implementations for the edit distance similarity and present evaluation results. Finally, we give examples of application from the context of a data reconciliation project for looted art.     

Using classification techniques for informal requirements in the requirements analysis-supporting system

In order to efficiently develop large-scale and complicated software, it is important for system engineers to correctly understand users’ requirements. Most requirements in large-scale projects are collected from various stakeholders located in various regions, and they are generally written in natural language. Therefore, the initial collected requirements must be classified into various topics prior to analysis phases in order to be usable as input in several requirements analysis methods. If this classification process is manually done by analysts, it becomes a time-consuming task. To solve this problem, we propose a new bootstrapping method which can automatically classify requirements sentences into each topic category using only topic words as the representative of the analysts’ views. The proposed method is verified through experiments using two requirements data sets: one written in English and the other in Korean. The significant performances were achieved in the experiments: the 84.28 and 87.91 F1 scores for the English and Korean data sets, respectively. As a result, the proposed method can provide an effective function for an Internet-based requirements analysis-supporting system so as to efficiently gather and analyze requirements from various and distributed stakeholders by using the Internet.     

Similarity retrieval of iconic image database

The perception of spatial relationships among objects in a picture is one of the important selection criteria to discriminate and retrieve the images in an iconic image database system. The data structure called 2D string, proposed by Chang et al., is adopted to represent symbolic pictures. The 2D string preserves the objects' spatial knowledge embedded in images. Since spatial relationship is a fuzzy concept, the capability of similarity retrieval for the retrieval by subpicture is essential. In this paper, similarity measure based on 2D string longest common subsequence is defined. The algorithm for similarity retrieval is also proposed. Similarity retrieval provides the iconic image database with the distinguishing function different from a conventional database.     

Midplane-symmetry breaking in the flow between two counter-rotating disks

This paper considers the axisymmetric steady flow driven by exact counter rotation of two co-axial disks of finite radius. At the edges of the rotating disks one of three conditions is (typically) imposed: (i) zero velocity, corresponding to a stationary, impermeable, cylindrical shroud (ii) zero normal velocity and zero tangential fluid traction, corresponding to a (confined) free surface and (iii) an edge constraint that is consistent with a similarity solution of von Kármán form. The similarity solution is valid in an infinite geometry and possesses a pitchfork bifurcation that breaks the midplane symmetry at a critical Reynolds number. In this paper, similar bifurcations of the global (finite-domain) flow are sought and comparisons are made between the resulting bifurcation structure and that found for the similarity solution. The aim is to assess the validity of the nonlinear similarity solutions in finite domains and to explore the sensitivity of the solution structure to edge conditions that are implicitly neglected when assuming a self-similar flow. It is found that, whilst the symmetric similarity solution can be quantitatively useful for a range of boundary conditions, the bifurcated structure of the finite-domain flow is rather different for each boundary condition and bears little resemblance to the self-similar flow.     

Inference and retrieval of facial images

Attempts have been made to extend SQL to work with multimedia databases. We are reserved on the representation ability of extended SQL to cope with the richness in content of multimedia data. In this paper we present an example of a multimedia database system, Computer Aided Facial Image Inference and Retrieval system (CAFIIR). The system stores and manages facial images and criminal records, providing necessary functions for crime identification. We would like to demonstrate some core techniques for multimedia database with CAFIIR system. Firstly, CAFIIR is a integrated system. Besides database management, there are image analysis, image composition, image aging, and report generation subsystems, providing means for problem solving. Secondly, the richness of multimedia data urges feature-based database for their management. CAFIIR is feature-based. A indexing mechanism,iconic index, has been proposed for indexing facial images using hierarchical self-organization neural network. The indexing method operates on complex feature measures and provides means for visual navigation. Thirdly, special retrieval methods for facial images have been developed, including visual browsing, similarity retrieval, free text retrieval and fuzzy retrieval.     

Comments on “Distinguishability quantification of fuzzy sets”

This paper presents some comments on the above paper regarding the manipulation of Gaussian fuzzy sets and provides two useful generalized formulas for both of similarity and similarity/possibility relationships of Gaussian fuzzy sets with different widths.     

自适应SSDA图像匹配并行算法设计与实现

为了充分利用多核处理器的硬件资源和计算能力来提高图像匹配应用的实时性,通过对自适应阈值SSDA图像匹配算法原理的分析,基于任务分解的多核并行编程模式思想,设计了一种自适应阈值SSDA图像匹配并行算法,并在多核计算机上采用OpenMP模型编程实现该并行算法,同时还进行了相关的代码优化。实验结果表明,优化后的并行算法在保持匹配算法精度的同时大大提高了匹配速度和多核利用率,取得了良好的效果。     

模糊聚类在股票投资中的应用

聚类分析即将一组事物根据其性质上亲疏远近的程度进行分类,把性质相近的个体归为一类,使得同一类中的个体具有高度的同质性,不同类之间的个体具有高度的异质性。模糊聚类分析是现今模糊理论应用最广泛和最富成果的技术之一。阐述模糊聚类的理论,以部分石油股票为例,抽取影响石油股票收益因素的数据,利用最大最小法建立相似矩阵,用传递闭包法作出聚类分析,并进行总结。