基于函数依赖图的关系模式规范化方法

在关系型数据库设计过程中。关系模式规范化是关系型数据库逻辑设计的重要步骤。按关系模式的范式定义进行规范化存在不便于操作,分解构成效率低。本文提出了一种以函数依赖图为基础的图示化关系模式规范化方法。实例说明,利用这种方法进行关系模式分解。具有分解过程直观和效率高等特点。     

一种理性的数据库模式设计方法--范式方法

介绍了一种理论性较强的数据库模式设计方法———范式方法。范式方法基于函数依赖及范式理论。最终的数据库模式必须满足BCNF模式集或3NF模式集、无损联接和保持函数依赖这三个特性才是一个可用的数据库,才不会出现各种操作异常(插入、删除)并且能大大地减少数据冗余。     

XML文档在关系数据库中的规范化存储

提出了一种存储方法，首先把XML文档映射为泛关系模式，再利用算法DeriveFDs推导出XML键所蕴含的泛关系模式上函数依赖集的规范覆盖，根据此规范覆盖，最后将泛关系模式保持函数依赖地分解为3NF模式集。得到了保持XML键约束的规范化存储模式，实现了XML文档在关系数据库中的规范化存储。实验研究表明文中提出的方法是有效的。     

多时间粒度约束的时态简单范式的分解

数据库逻辑设计的目的是消除数据冗余、插入和删除异常。为使时态模式满足某种范式的要求，要对时态模式进行分解，保持函数依赖和无损连接性是对算法最基本的要求。但对具有多时间粒度的时态模式进行分解时，把TBCNF作为最终目标很难实现保持函数依赖性，把T3NF作为最终目标，又很难达到规范化要求。该文提出了时态简单范式TSNF的概念及相应的分解算法，来弥补以上两点不足。     

从DTD映射到关系模式:一种保持数据依赖的映射方法

XML正迅速成为互联网上数据表示和交换的标准．用关系数据库存储XML数据是XML存储策略之一．为了将XML数据存储到关系数据库中，人们研究了从DTD到关系模式的映射方法．提出了一种保持数据依赖的映射方法PDD．与已有的Shared—Inlining方法相比，PDD方法充分考虑了DTD蕴涵的数据依赖关系，保证了XML文档的完整性．通过对泛关系进行模式分解，得到的关系模式保持函数依赖，并且满足2NF．可以证明，这种方法是有效的．     

约束数据库中的分解与无损连接

约束数据模型作为一种新的数据库模型正受到广泛关注，为了约束数据库的有效应用，需要研究的设计。为此对密序约束数据中的变量独立函数依赖，模式设计，分解，无损连接规范表示概念给出了严格的定义。给出了计算规范表示的算法，它能保持约束元 组的变量独立，并证明了它的正确性。     

关系数据库规范化设计的理解

本文通过具体实例阐明了关系数据库几个范式的概念和模式分解的方法。     

一个多时间粒度下时态模式的T3NF分解算法

对于时态数据库，时间维的引入使得如何有效地进行数据库设计以消除数据冗余和插入、删除异常显得尤为重要．可以通过支持多时间粒度的时态函数依赖（TFDs）约束对时态数模式进行规范化．但是多时间粒度的使用给数据库设计带来巨大的复杂性．一般来说，系统所能处理的和相当多的应用所涉及到的时态类型集满足全序关系．对于这种具有全序时态类型集的时态模式，通过分析TFD臬所具有的良好特性，给出了一个得到满足时态第三范式（T3NF）的无损分解的多项式时间的算法．     

XML文档及其函数依赖到关系的映射

有许多文章提出了根据DTD将XML映射成关系的方法,但都没有考虑XML的语义,而语义信息对数据存储模式设计、查询优化、更新异常检查等来说是十分重要的,如果在DTD上指定了XML的函数依赖,在映射到关系数据库中就需要将其考虑进去.基于Hybrid Inlining方法并考虑XML函数依赖,提出了一种既能保持XML文档的内容和结构信息,又能保持函数依赖信息的映射方法.通过这种方法可以减少存储冗余,同时证明了映射后的关系都满足第三范式.     

浅谈关系规范化在数据库设计中的应用

数据库设计需要按一定的规则进行,在关系数据库中,这种规则就是范式。范式是符合某一种级别的关系模式的集合。关系数据库中的关系必须满足一定的要求,即满足不同的范式。目前关系数据库有六种范式:第一范式(1NF)、第二范式(2NF)、第三范式(3NF)、BC范式(BCNF)、第四范式(4NF)、第五范式(5NF)和第六范式(6NF)。满足最低要求的范式是第一范式(1NF)。在第一范式的基础上进一步满足更多要求的为第二范式(2NF)及更高级别的范式,在实际设计应用中,只需要达到3NF即可。     

从DTD映射到关系模式方法Hybrid Inlining的改进

XML正迅速成为互联网上数据表示和交抉的标准,用关系数据库存储XML数据是XML存储策略之一。为了将XML数据存储到关系数据库中,人们研究了很多从DTD到关系模式的映射方法。Hybrid Inlining方法是一种比较常用的映射方法,此方法将多个元素内联到一个表中,从而可以降低查询时连接操作的次数,但同时也存在一些诸如删除异常、插入异常的问题。本文将Hybria Inlining方法运用在从Schema到关系模式的转抉中,同时在Hybrid Inlining方法的基础上做进一步改进,从而解决删除、插入异常等问题。最后给出其具有无损连接性以及锨持函数依赖的证明。     

A new shape decomposition scheme for graph-based representation

Nowadays, the part-based representation of a given shape plays a significant role in shape-related applications, such as those involving content-based retrieval, object recognition, and so on. In this paper, to represent both 2-D and 3-D shapes as a relational structure, i.e. a graph, a new shape decomposition scheme, which recursively performs constrained morphological decomposition (CMD), is proposed. The CMD method adopts the use of the opening operation with the ball-shaped structuring element, and weighted convexity to select the optimal decomposition. For the sake of providing a compact representation, the merging criterion is applied using the weighted convexity difference. Therefore, the proposed scheme uses the split-and-merge approach. Finally, we present experimental results for various, modified 2-D shapes, as well as 3-D shapes represented by triangular meshes. Based on the experimental results, it is believed that the decomposition of a given shape coincides with that based on human insight for both 2-D and 3-D shapes, and also provides robustness to scaling, rotation, noise, shape deformation, and occlusion.     

多传感器图像融合效果综合评价研究

针对图像融合效果评价问题,利用灰色关联分析的小样本特性和整体比较机制,结合先验知识和量化评价,提出了一种基于多层次灰色关联分析的图像融合效果综合评价方法,评价结果易于定量表示,更加精确、客观,区分度大、可靠性高.该方法不仅可以从整体上进行综合评价,还可以从某个侧面进行特殊性需要的评价,兼顾了实际评价工作中的通用性和特殊性要求.实验结果表明,该评价方法具有较好的实时性和准确性,对于实现具有反馈的图像融合过程,进一步丰富和完善图像融合理论框架具有启发意义和实用价值.     

泛关系模式的规范化处理及其实例研究

通过对泛关系理论的分析与研究,提出一种基于泛关系模式的自底向上（Bottom-Up）关系数据库规范化设计方法,利用规范化设计理论,通过模式分解,逐步消除数据依赖中不合适的部分,消除各类操作异常,减少数据的冗余。关键词：泛关系模式;规范化;模式分解     

Emotion Recognition From Facial Expressions and Its Control Using Fuzzy Logic

This paper presents a fuzzy relational approach to human emotion recognition from facial expressions and its control. The proposed scheme uses external stimulus to excite specific emotions in human subjects whose facial expressions are analyzed by segmenting and localizing the individual frames into regions of interest. Selected facial features such as eye opening, mouth opening, and the length of eyebrow constriction are extracted from the localized regions, fuzzified, and mapped onto an emotion space by employing Mamdani-type relational models. A scheme for the validation of the system parameters is also presented. This paper also provides a fuzzy scheme for controlling the transition of emotion dynamics toward a desired state. Experimental results and computer simulations indicate that the proposed scheme for emotion recognition and control is simple and robust, with good accuracy.     

Thorough investigation into “An improved algorithm based onsubset closures for synthesizing a relational databasescheme”

The paper describes a technical improvement of a synthesis algorithm for relational database scheme design, which was proposed by Yang et al. (1988). The improvement is based on the observation that the original algorithm may lose attributes in a decomposition in special cases, due to an insufficient handling of representatives of equivalence classes formed over a given set of functional dependencies. The paper then proposes a correction of the original algorithm in which this problem disappears     

AnO(n 2) incremental algorithm for modular decomposition of graphs and 2-structures

This paper gives anO(n ²) incremental algorithm for computing the modular decomposition of 2-structures [1], [2]. A 2-structure is a type of edge-colored graph, and its modular decomposition is also known as the prime tree family. Modular decomposition of 2-structures arises in the study of relational systems. The modular decomposition of undirected graphs and digraphs is a special case, and has applications in a number of combinatorial optimization problems. This algorithm generalizes elements of a previousO(n ²) algorithm of Muller and Spinrad [3] for the decomposition of undirected graphs. However, Muller and Spinrad's algorithm employs a sophisticated data structure that impedes its generalization to digraphs and 2-structures, and limits its practical use. We replace this data structure with a scheme that labels each edge with at most one node, thereby obtaining an algorithm that is both practical and general to 2-structures.     

最小函数依赖集Fmin求解算法研究及实现

函数依赖反映了现实世界中数据的完整性约束,对关系数据库的分析和设计起着重要的作用。最小函数依赖集和模式规范化是规范化理论和模式分解中的两个最重要概念。研究并实现了最小函数依赖集的求解算法。     

Selective Regional Correlation for Pattern Recognition

In this paper, a novel correlation-based pattern classifier that relies on the analysis of time-frequency decomposition of a template and signals is proposed. Significant improvements in resolution and accuracy are obtained using this new classifier when compared to a conventional correlation-based one. The short-time Fourier transform, continuous wavelet transform, and S-transform are considered in the time-frequency decomposition process. To evaluate the performance of the proposed scheme, numerical studies are performed on a set of synthetic test signals, and excellent results have been obtained. This paper also presents an illustrative example where two types of heart sounds are classified. The classification error percentage for the heart sounds using the new classifier is only 6.670% as compared to 56.67% when a general correlation-based classifier is used