An interactive concept map approach to supporting mobile learning activities for natural science courses

Mobile and wireless communication technologies not only enable anytime and anywhere learning, but also provide the opportunity to develop learning environments that combine real-world and digital-world resources. Nevertheless, researchers have indicated that, without effective tools for helping students organize their observations in the field, the mobile learning performance could be disappointing. To cope with this problem, this study proposes an interactive concept map-oriented approach for supporting mobile learning activities. An experiment has been conducted on an elementary school natural science course to evaluate the effectiveness of the proposed method. The experimental results show that the proposed approach not only enhances learning attitudes, but also improves the learning achievements of the students.     

基于ECC的广义门限签密方案设计

为了满足群组之间相互通信时同时需要加密和认证的要求,设计了一个基于椭圆曲线密码体制的广义门限签密方案,该方案能够同时实现,门限签密和,门限共享解签密。在门限共享解签密阶段,利用Chaum-Pedersen离散对数等式知识证明协议的思想实现了对群组成员中恶意成员的检测。通过对该方案进行的安全性分析和效率分析结果表明,该方案可以用较小的计算代价和通信代价安全地实现群组通信中的保密和认证。     

改进的变精度粗糙集在概念格构造中的应用研究

根据可变精度粗糙集的R-上、下分布约简算法的优势,结合概念格形式背景的特点,将二者有机地结合,提出了基于变精度粗糙集的概念格约减算法。分析了变精度粗糙集模型中的R值的选取算法、可辨识矩阵属性约简,以及传统算法中存在的问题,并进行了改进。最后,为了验证改进后算法的有效性,设计了基于变精度粗糙集的概念格生成系统,通过一个实例演示了构造概念格的整个过程,并通过实验证明了算法的有效性。     

基于概念扩充的中文文本过滤模型

1 前言今天,以因特网为主体的信息高速公路仍在不断普及和发展,因特网上蕴涵的海量信息远远超过人们的想象,面对这样的信息汪洋大海,人们往往感到束手无策,无所适从,出现所谓的“信息过载”问题。如何帮助人们有效地选择和利用所感兴趣的信息,同时保证人们在信息选择方面的个人隐私权利?这已成为学术界和企业界所十分关注的焦点。因此,信息过滤技术应     

基于概念的中文文本可视化表示机制

为了浏览因特网上日益增多的在线中文文本,本文给出了基于概念的中文文本可视化表示机制,以直观的方式组织和表示文本及文本集,其基本思想是：首先在概念扩充的基础上,进行文本分类,然后,利用本文提出的提出的文本特征抽取方法和摘要方法,获取广西类别、广西、广西正文的标记的信息,通过类别,文本、有选择地浏览文本。     

大型数据库中多层关联规则的挖掘算法

将基于垂直数据分布的关联规则的发现从单层概念扩展到多层概念,提出了自顶向下的、用等价类生成频繁项目集的发现算法,无需复杂的Ｈａｓｈ数据结构。该算法减少了项目的匹配计算,提高了挖掘的效率。     

A Multi-parameter Approach to Automated Building Grouping and Generalization

This paper presents an approach to automated building grouping and generalization. Three principles of Gestalt theories, i.e. proximity, similarity, and common directions, are employed as guidelines, and six parameters, i.e. minimum distance, area of visible scope, area ratio, edge number ratio, smallest minimum bounding rectangle (SMBR), directional Voronoi diagram (DVD), are selected to describe spatial patterns, distributions and relations of buildings. Based on these principles and parameters, an approach to building grouping and generalization is developed. First, buildings are triangulated based on Delaunay triangulation rules, by which topological adjacency relations between buildings are obtained and the six parameters are calculated and recorded. Every two topologically adjacent buildings form a potential group. Three criteria from previous experience and Gestalt principles are employed to tell whether a 2-building group is ‘strong,’ ‘average’ or ‘weak.’ The ‘weak’ groups are deleted from the group array. Secondly, the retained groups with common buildings are organized to form intermediate groups according to their relations. After this step, the intermediate groups with common buildings are aggregated or separated and the final groups are formed. Finally, appropriate operators/algorithms are selected for each group and the generalized buildings are achieved. This approach is fully automatic. As our experiments show, it can be used primarily in the generalization of buildings arranged in blocks.

增强前馈神经网络对多点断路故障的容错能力

神经网络在发生多点断路故障时,网络中的多个隐层神经元及其相关的连接权同时失效。该文针对陷层神经元可以动态增加的一类前馈神经网络,提出了一种三阶段方法T3。T3先对网络进行一次训练,然后用验证集进行测试以确定网络的故障曲线拐点,在此基础上通过第二次训练自适应地增加冗余隐层神经元。实验表明,T3使用较小的冗余量就可以显著改善网络对多点断路故障的容错性,在网络的容错能力和结构复杂度之间较好地达成了折衷。     

面向属性的量化归纳

数据简化是数据库中知识发现的一个重要研究方向。面向属性的归纳（AOG）可以用于数据简化。首先从数据简化的角度分析讨论了AOG及其不足;AOG的单一属性阈值控制是布尔型控制,在有例外存在的情况下,可能造成数据过度简化,失去数据简化的意义。其次在AOG的基础上提出了面向属性的量化归纳（QAOG）以弥补AOG的不足;引入记录阈值的概念,用属性阈值和记录阈值同时进行控制,使控制从布尔型变成数量型,对没有例外存在的情况产生与AOG相同的效果,而对有例外存在的情况产生比AOG更好的效果,还给出了一个有效的QAOG算法。     

Segmenting customers by transaction data with concept hierarchy

The segmentation of customers is crucial for an organization wishing to develop appropriate promotion strategies for different clusters. Clustering customers provides an in-depth understanding of their behavior. However, previous studies have paid little attention to the similarity of different items in transaction. Lack of categories and concept levels of items, results from item-based segmentation methods are not as good as expected. Through employing a concept hierarchy of items, this study proposes a segmentation methodology to identify similarities between customers. First, the dissimilarity between transaction sequences is defined. Second, we adopt hierarchical clustering method to segment customers by their transaction data with concept hierarchy of consumed items. After segmentation, three cluster validation indices are used for optimizing the number of clusters of customers. Through the compassion of normalized index, the segmentation method proposed by this study rendered better results than other traditional methods.