一种基于概念格属性约简的本体合并方法

提出一种基于概念格属性约简的本体合并方法。该方法先对源本体中的概念进行外延和内涵的分析,以此为形式背景构造概念格。对所构造的概念格进行属性约简,删除本体合并中的冗余信息,约简绝对不必要属性,以最少的信息精确地反映概念格及本体的本质和结构。最后通过实例分析此方法的可行性。     

新虚拟场景模型下智能漫游算法设计与实现①

基于对相关智能预测算法的分析,发现现有算法并未考虑到虚拟场景节点间存在的潜在关联关系,降低了算法的预测准确率。针对此问题,在一种新的立方体虚拟场景模型的基础上,提出了一种智能漫游算法,通过为每个节点建立一个以当前节点为根结点的完全二叉树结构,利用节点间潜在的关联关系判断下一步可能被操作的对象,对预测对象提前进行绘制并调入内存,有效弥补了相关算法存在的缺陷,从而提高了虚拟场景漫游的效率和实时性,算法具有较高的准确性。     

基于FCA的对象与属性交叉渐进的情感本体学习

提出了一种基于形式概念分析的渐进式情感本体学习的算法。该算法通过动态交叉添加对象和属性来生成概念格,从而从概念格当中抽取情感本体,最终实现情感本体的学习过程。给出了算法的描述,并结合实例说明了本体学习过程。     

概念格的渐进式维护算法

由二元关系导出的概念格是一种非常有用的形式化工具,也很适合于发现数据中潜在的概念。概念格的算法一直是数据挖掘领域研究的热点。本文根据需要对概念格的结构进行一定的修改,采用一个带头、尾指针的链表作为整个算法的数据结构,提出概念格的渐进式维护算法,该算法中包含两个算法,即渐进式构造算法和渐进式删除算法。最后,通过将该算法和其他算法进行比较,得出较好的时间和空间效率。     

基于概念格的天体光谱离群数据识别方法

在宇宙中, 寻求特殊的、未知的天体是人类探索宇宙奥妙所追求的目标之一, 天体光谱离群数据识别方法是实现该目标的有效手段之一. 将概念格中每个概念节点内涵描述为天体光谱数据特征子空间, 提出了一种天体光谱离群数据识别方法. 首先将概念节点的内涵缩减看作天体光谱特征子空间, 并依据稀疏度系数阈值确定稀疏子空间; 其次对于稀疏子空间, 依据稠密度系数判定祖先概念节点内涵是否为稠密子空间, 进而判断出概念节点外延中包含的数据对象是否为天体光谱离群数据; 最后以离散化天体光谱数据作为形式背景, 实验验证了利用该方法识别出的天体光谱离群数据是准确的、完备的和有效的.     

公交车站牌报站屏的设计

介绍了新型太阳能公交车站牌报站显示系统。该系统利用太阳能、LED显示和微控制技术,采用W78E58单片机作为系统的中央控制单元,可实现同一站牌不同路数公交车站点的静态显示、动态显示和定时显示控制。利用VB软件编程可实现PC机通信,通过RS232接口可对整个系统升级,提高了系统的可操作性。整个系统采用太阳能供电,蓄电池作为后备电源,可有效节约电能。     

Thermodynamic modeling of the Na–Al–Ti–H system and Ti dissolution in sodium alanates

Thermodynamic assessments were made to optimize thermodynamic models and parameter fits to selected experimental and first principles hypothetical predicted phase data within the Na–Al–Ti–H system. This enabled thermodynamic modeling of Ti solubility within the sodium alanates: NaAlH₄ and Na₃AlH₆, and the relative stability of Ti-bearing phases. The modeling provides insights into the role of Ti originating from Ti-based activating agents commonly referred to as ‘catalysts’ in promoting reversibility of the Na–Al–H dehydrogenation and rehydrogenation reactions under moderate temperature and pressure conditions relevant to H storage applications. Preliminary assessments were made to evaluate H solubility in bcc-Ti and hcp-Ti, and stability of the hydride δ-TiH₂. To model possible Ti dissolution in NaAlH₄ and α-Na₃AlH₆, sub-lattice models were applied. A repulsive interaction is predicted by first principles calculations when Ti is dissolved in NaAlH₄ or α-Na₃AlH₆, which becomes stronger with increasing temperature. Although Ti is virtually insoluble in NaAlH₄ or α-Na₃AlH₆, a small addition of TiCl₃ will induce a thermodynamic driving force for formation of TiH₂ and/or TiAl₃. The addition of pure Ti shows a weaker effect than TiCl₃ and leads to formation of TiH₂ only. Based on a combined interpretation of present thermodynamic modeling and prior experimental observations, the TiAl₃ and TiH₂ phases are ascribed to have a catalytic effect, not a thermodynamic destabilization effect, on the reversibility of the dehydrogenation/rehydrogenation reactions in the Na–Al–H system.     

Partial Partitions,Partial Connections and Connective Segmentation

In connective segmentation (Serra in J. Math. Imaging Vis. 24(1):83–130, [2006]), each image determines subsets of the space on which it is “homogeneous”, in such a way that this family of subsets always constitutes a connection (connectivity class); then the segmentation of the image is the partition of space into its connected components according to that connection. Several concrete examples of connective segmentations or of connections on sets, indicate that the space covering requirement of the partition should be relaxed. Furthermore, morphological operations on partitions require the consideration of wider framework. We study thus partial partitions (families of mutually disjoint non-void subsets of the space) and partial connections (where connected components of a set are mutually disjoint but do not necessarily cover the set). We describe some methods for generating partial connections. We investigate the links between the two lattices of partial connections and of partial partitions. We generalize Serra’s characterization of connective segmentation and discuss its relevance. Finally we give some ideas on how the theory of partial connections could lead to improved segmentation algorithms.

Classification of Fuzzy Mathematical Morphologies Based on Concepts of Inclusion Measure and Duality

Mathematical morphology was originally conceived as a set theoretic approach for the processing of binary images. Extensions of classical binary morphology to gray-scale morphology include approaches based on fuzzy set theory. This paper discusses and compares several well-known and new approaches towards gray-scale and fuzzy mathematical morphology. We show in particular that a certain approach to fuzzy mathematical morphology ultimately depends on the choice of a fuzzy inclusion measure and on a notion of duality. This fact gives rise to a clearly defined scheme for classifying fuzzy mathematical morphologies. The umbra and the level set approach, an extension of the threshold approach to gray-scale mathematical morphology, can also be embedded in this scheme since they can be identified with certain fuzzy approaches.

模糊描述逻辑L-ALCN

为了使描述逻辑能够处理更一般化的模糊信息,Straccia给出了基于完备格的L-ALC描述逻辑系统．在该方法的基础上,提出了带数量约束算子的L-ALCN系统,给出了望ALCN的语法,并详细给出了概念（≥n R）和（≤n R）的语义．经典的描述逻辑系统中引入了数量约束算子后,角色尺就出现了多个后继．当系统的真子集扩充到完备格时,角色R的后继和断言的真值同时出现了多个．为了保证推理算法的合理性且得到可行的计算复杂度,引入了一个特殊的集合DL（c）,并且利用集合DL（c）扩展了完备格上的两条运算性质．在这些工作的基础上,深入研究了系统的推理算法,并证明了算法的终止性、可靠性与完全性．相对于L-ALC,系统L-ALCN具有更强的表达能力,并且L-ALCN的计算复杂度是Pspace完全的．