Deep Web数据集成中查询处理的研究与进展

随着Web上在线数据库的大量涌现,Deep Web数据集成成为当前信息领域的一个研究热点,而查询处理是其中的一个重要的组成部分。由于Web数据库具有规模大、自治性、异构性以及动态性等特点,使得Deep Web数据集成中的查询处理比传统的分布环境下的查询处理更具挑战性。围绕Deep Web数据集成中查询处理的三个关键研究点:模式匹配、Web数据库的选择以及查询转换,综述了近年来国际上相关的、具代表性的研究成果,分析了这些方法的优缺点,总结并展望了未来的发展方向。     

对等网环境下信任管理语言及安全凭证链查找方法

从P2P网络开放性、分布性、动态性等特点出发,给出了P2P环境下基于信任值的信任管理语言,实现了信任关系的初始建立。针对安全凭证链的查找问题,结合P2P网络的特点,提出了使用结果安全凭证并结合基于最小安全凭证图的安全凭证链查找算法,提高了安全凭证链的查找效率。     

Factors influencing health care professionals’ adoption of mobile platform of medical and senior care in China

A mobile platform of medical and senior care (MPMSC) is a platform that can provide one-stop medical and senior care services through mobile devices. This study developed a research model based on the value-based adoption model to understand the factors influencing health care professionals’ adoption of MPMSC. Empirical analysis has shown that perceived value and legal concerns can predict health care professionals’ intention to adopt MPMSC and that outcome expectations, perceived mobility, perceived effort, and privacy concerns can predict perceived value. Research findings can enhance the understanding of the factors influencing the adoption of MPMSC by health care professionals.     

Effect of linguistic disfluency on consumer satisfaction: Evidence from an online knowledge payment platform

The popularity of online knowledge payment platforms enables online users to disseminate paid knowledge via voice communication. However, such communication provided by users with little professional teaching skills commonly tends to contain linguistic disfluency, which is a potential determinant of consumer satisfaction of paid knowledge products. This study examines how linguistic disfluency inherent in paid knowledge products impacts consumer satisfaction and the moderating effects of two consumer knowledge aspects, namely expertise and familiarity. Based on processing fluency theory, we build a theoretical model to illuminate relationships between consumer satisfaction, linguistic disfluency, and consumer knowledge. Leveraging data from Zhihu Live, a leading online knowledge payment platform, we find that linguistic disfluency is negatively associated with consumer satisfaction; nevertheless, this negative association disappears or turns into a positive effect for consumers with high expertise and low familiarity. Our study offers implications for platforms to accomplish high consumer satisfaction and further improve user retention and revenue.     

基于谱聚类的在线数据库垂直分区多阶段生成方法

垂直数据分区技术从逻辑上将满足一定语义条件的数据库表属性存放在同一个物理块中,进而降低数据访问成本,提高查询效率.数据库查询负载中的每条查询通常只与数据库表中的部分属性有关,因此只需使用数据库表的某个属性子集便可以得到准确的查询结果.合理的垂直数据分区方式可以使大多数查询负载不需要扫描完整数据库就可以完成查询任务,从而达到减少数据访问量,提高查询处理效率的目的.传统的数据库垂直分区方法主要基于专家设置的启发式规则,分区策略粒度较粗,且不能根据负载的特征进行有针对性的分区优化.同时,当负载规模较大或者属性个数较多时,现有垂直分区方法执行时间过长,尤其无法满足数据库在线实时调优的性能需求.为此,提出在线环境下基于谱聚类的垂直数据分区方法（spectral clustering based vertical partitioning,SCVP）,采用分阶段求解的思想,减少算法时间复杂度,加快分区执行速度.首先通过增加约束条件缩小解空间（即根据谱聚类生成初始分区）,然后对解空间设计算法进行精细的搜索（即采用频繁项集和贪心搜索相结合的策略对初始分区进行优化）.为了进一步提升SCVP在高维属性下的性能,提出了SCVP的改进版本SCVP-R （spectral clustering based vertical partitioning redesign）.SCVP-R通过引入同域竞争机制、双败淘汰机制和循环机制,对SCVP在分区优化过程中的合并方案进行了进一步优化.在不同数据集上的实验结果表明,相比于目前最好的垂直分区方法,SCVP和SCVP-R有着更快的执行时间和更好的性能表现.     

RTDMiner: 基于数据挖掘的引用计数更新缺陷检测方法

在Linux内核等大型底层系统中广泛采用引用计数来管理共享资源.引用计数需要与引用资源的对象个数保持一致,否则可能导致不恰当引用计数更新缺陷,使得资源永远无法释放或者被提前释放.为检测不恰当引用计数更新缺陷,现有静态检测方法通常需要知道哪些函数增加引用计数,哪些函数减少引用计数.而手动获取这些关于引用计数的先验知识过于费时且可能有遗漏.基于挖掘的缺陷检测方法虽然可以减少对先验知识的依赖,但难以有效检测像不恰当引用计数更新缺陷这类路径敏感的缺陷.为此,提出一个将数据挖掘技术和静态分析技术深度融合的不恰当引用计数更新缺陷检测方法 RTDMiner.首先,根据引用计数的通用规律,利用数据挖掘技术从大规模代码中自动识别增加或减少引用计数的函数.然后,采用路径敏感的静态分析方法检测增加了引用计数但没有减少引用计数的缺陷路径.为了降低误报,在检测阶段再次利用数据挖掘技术来识别例外模式.在Linux内核上的实验结果表明,所提方法能够以将近90%的准确率自动识别增加或减少引用计数的函数.而且RTDMiner检测到的排行靠前的50个疑似缺陷中已经有24个被内核维护人员确认为真实缺陷.     

Deriving phosphorus atomic chains from few-layer black phosphorus

Phosphorus atomic chains,the narrowest nanostructures of black phosphorus (BP),are highly relevant to the in-depth development of BP-based one-dimensional (1D) nano-electronics components.In this study,we report a top-down route for the preparation of phosphorus atomic chains via electron beam sculpturing inside a transmission electron microscope (TEM).The growth and dynamics (i.e.,rupture and edge migration) of 1D phosphorus chains are experimentally captured for the first time.Furthermore,the dynamic behavior and associated energetics of the as-formed phosphorus chains are further investigated by density functional theory (DFT) calculations.It is hoped that these 1D BP structures will serve as a novel platform and inspire further exploration of the versatile properties of BP.     

Windows删除文件的取证分析

随着计算机犯罪案件成指数增长,基于Windows的取证分析技术日益普遍,而犯罪嫌疑人掩盖证据最通常的做法就是将有用证据删除,因此,对这些删除文件进行取证分析显得更为重要.删除文件中很可能包含和案件相关的重要证据,如用户数据文件、声音文件等,文章结合数据恢复技术和Windows删除机制特点,提出了一种对Windows删除文件的取证分析方法,能够获取更多的用户信息,为重构案情,了解用户行为提供了更有效的依据.     

Efficient evaluation of query rewriting plan over materialized XML view

The query rewriting plan generation over XML views has received wide attention recently. However, little work has been done on efficient evaluation of the query rewriting plans, which is not trivial since the plan may contain an exponential size of sub-plans. This paper investigates the reason for the potentially exponential number of sub-plans, and then proposes a new space-efficient form called ABCPlan (Plan with Automata Based Combinations) to equivalently represent the original query rewriting plan. ABCPlan contains a set of buckets containing suffix paths in the query tree and an automata to indicate the combination of the suffix paths from different buckets as valid query rewriting sub-plans. We also design an evaluation method called ABCScan, which constructs a unified evaluation tree for the ABCPlan and handles the evaluation tree in one scan of the XML view. In the evaluation, we introduce node existence automata to encode the structure of the sub-tree and convert the satisfaction of the ABCPlan into the intersection problem of deterministic finite automata. The experiments show that ABCPlan based method outperforms existing methods significantly in terms of scalability and efficiency.     

一种借助系统调用实现基于信息流的完整性度量的方法

提出一种借助系统调用实现基于信息流的完整性度量的方法。该方法将度量过程分为离线阶段和运行阶段。在离线阶段,软件执行的系统调用被监控和记录,结合系统调用和信息流的关系抽象出软件的信息流基准值。在运行阶段,分析软件运行时的系统调用信息,获得软件运行时的信息流,根据信息流基准值检查软件的信息流是否出现异常,度量软件的完整性。为了验证方法的可行性,文章以Apache服务器为例,实现该方法的原型系统。实验表明该方法能够发现软件运行时完整性被破坏而出现的异常信息流。