贝叶斯网络查询语义扩展的专家发现方法

专家发现是实体检索领域的一个研究热点，针对经典专家发现模型存在索引术语独立性假设与检索性能低的缺陷，提出一种基于贝叶斯网络模型的专家发现方法。该方法模型采用四层网络结构，能够实现图形化的概率推理，同时运用词向量技术能够实现查询术语的语义扩展。实验结果显示该模型在多个评价指标上均优于经典专家发现模型，能够有效实现查询术语语义扩展，提高专家检索性能。     

面向连续查询的敏感语义位置隐私保护方案

针对连续查询位置服务中构造匿名区域未考虑语义位置信息导致敏感隐私泄露问题，通过设计[(K,θ)]-隐私模型，提出一种路网环境下面向连续查询的敏感语义位置隐私保护方案。该方案利用Voronoi图将城市路网预先划分为独立的Voronoi单元，依据用户的移动路径和移动速度，选择具有相似特性的其他[K-1]个用户，构建匿名用户集；利用匿名用户集用户设定的敏感语义位置类型和语义安全阈值，以及用户所处语义位置的Voronoi单元，构建满足[(K,θ)]-隐私模型的语义安全匿名区域，可以同时防止连续查询追踪攻击和语义推断攻击。实验结果表明，与SCPA算法相比，该方案在隐私保护程度上提升约15%，系统开销上降低约20%。     

粒子群属性聚类的位置隐私保护

针对基于位置服务中连续查询情况下，用户自身属性信息很容易被攻击者获取，并通过关联获得用户位置隐私的情况，提出了一种利用粒子群聚类加速相似属性用户寻找，并由相似属性匿名实现用户位置泛化的隐私保护方法。该方法利用位置隐私保护中常用的可信中心服务器，通过对发送到中心服务器中的查询信息进行粒子群属性聚类，在聚类的过程中加速相似属性用户的寻找过程，由相似属性用户完成位置泛化，以此实现位置隐私保护。实验结果证明，这种基于粒子群属性聚类的隐私保护方法具有高于同类算法的隐私保护能力，以及更快的计算处理速度。     

基于跨语言词向量模型的蒙汉查询词扩展方法研究

跨语言信息检索指以一种语言为检索词,检索出用另一种或几种语言描述的一种信息的检索技术,是信息检索领域重要的研究方向之一。近年来,跨语言词向量为跨语言信息检索提供了良好的词向量表示,受到很多学者的关注。该文首先利用跨语言词向量模型实现汉文查询词到蒙古文查询词的映射,其次提出串联式查询扩展、串联式查询扩展过滤、交叉验证筛选过滤三种查询扩展方法对候选蒙古文查询词进行筛选和排序,最后选取上下文相关的蒙古文查询词。实验结果表明: 在蒙汉跨语言信息检索任务中引入交叉验证筛选方法对信息检索结果有很大的提升。     

用于快速服装搭配的FMatchNet算法

目的 针对现有服装搭配系统中，提取服装图像深度特征进行搭配所需时间过长的问题，提出了一种新的FMatchNet网络提取哈希特征进行服装快速搭配的方法。方法 首先采用快速区域卷积神经网络（Faster-RCNN）方法检测出图像中的服装，用此服装进行搭配可以最大限度地保留服装信息并消除背景信息的干扰。然后用深度卷积神经网络提取服装的深度特征并产生服装的哈希码，采用查询扩展的方法完成服装搭配。模型采用Siamese网络的训练方法使哈希码尽可能保留服装图像的语义信息。另外，由于目前国际上缺少大型时尚服装数据库，本文扩建了一个细粒度标注的时尚服装数据库。结果 在FClothes数据库上验证本文方法并与目前流行的方法进行对比，本文方法在哈希长度为16时，上、下服装搭配方面的准确度达到了50.81%，搭配速度相对于基本准线算法提高了近3倍。结论 针对大规模服装搭配问题，提出一种新的FMatchNet网络提取特征进行服装快速搭配的方法，提高了服装搭配的精度和速度，适用于日常服装搭配。     

Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees

Motivated by the continuing interest in the tree data model, we study the expressive power of downward navigational query languages on trees and chains. Basic navigational queries are built from the identity relation and edge relations using composition and union. We study the effects on relative expressiveness when we add transitive closure, projections, coprojections, intersection, and difference; this for Boolean queries and path queries on labeled and unlabeled structures. In all cases, we present the complete Hasse diagram. In particular, we establish, for each query language fragment that we study on trees, whether it is closed under difference and intersection.     

The generic model query language GMQL – Conceptual specification,implementation, and runtime evaluation

The generic model query language GMQL is designed to query collections of conceptual models created in arbitrary graph-based modelling languages. Querying conceptual models means searching for particular model subgraphs that comply with a predefined pattern query. Such a query specifies the structural and semantic properties of the model fragment to be returned. In this paper, we derive requirements for a generic model query language from the literature and formally specify the language’s syntax and semantics. We conduct an analysis of GMQL׳s theoretical and practical runtime performance concluding that it returns query results within satisfactory time. Given its generic nature, GMQL contributes to a broad range of different model analysis scenarios ranging from business process compliance management to model translation and business process weakness detection. As GMQL returns results with acceptable runtime performance, it can be used to query large collections of hundreds or thousands of conceptual models containing not only process models, but also data models or organizational charts. In this paper, we furthermore evaluate GMQL against the backdrop of existing query approaches thereby carving out its advantages and limitations as well as pointing toward future research.     

Rapidly finding CAD features using database optimization

Automatic feature recognition aids downstream processes such as engineering analysis and manufacturing planning. Not all features can be defined in advance; a declarative approach allows engineers to specify new features without having to design algorithms to find them. Naive translation of declarations leads to executable algorithms with high time complexity. Database queries are also expressed declaratively; there is a large literature on optimizing query plans for efficient execution of database queries. Our earlier work investigated applying such technology to feature recognition, using a testbed interfacing a database system (SQLite) to a CAD modeler (CADfix). Feature declarations were translated into SQL queries which are then executed.The current paper extends this approach, using the PostgreSQL database, and provides several new insights: (i) query optimization works quite differently in these two databases, (ii) with care, an approach to query translation can be devised that works well for both databases, and (iii) when finding various simple common features, linear time performance can be achieved with respect to model size, with acceptable times for real industrial models. Further results also show how (i) lazy evaluation can be used to reduce the work performed by the CAD modeler, and (ii) estimating the time taken to compute various geometric operations can further improve the query plan. Experimental results are presented to validate our main conclusions.     

CineCubes: Aiding data workers gain insights from OLAP queries

In this paper we demonstrate that it is possible to enrich query answering with a short data movie that gives insights to the original results of an OLAP query. Our method, implemented in an actual system, CineCubes, includes the following steps. The user submits a query over an underlying star schema. Taking this query as input, the system comes up with a set of queries complementing the information content of the original query, and executes them. For each of the query results, we execute a set of highlight extraction algorithms that identify interesting patterns and values in the data of the results. Then, the system visualizes the query results and accompanies this presentation with a text commenting on the result highlights. Moreover, via a text-to-speech conversion the system automatically produces audio for the constructed text. Each combination of visualization, text and audio practically constitutes a movie, which is wrapped as a PowerPoint presentation and returned to the user.     

解决压丸机喷体滑板对软胶囊装量稳定的影响

目的 对压丸机喷体滑板进行改造, 解决软胶囊开机过程中产品装量差异大的问题, 提升开机效率, 稳定产品质量。方法 喷体在注料状态下滑板和底座间的注料孔错位, 在外气缸与滑板处加装2.5 mm厚的垫圈, 使滑板整体往外拉2.5 mm, 把垫圈与设备部件加工成一个整体, 避免由人员安装误差造成的差异。结果 通过改造, 使注料孔通过率由原来的40%提升到100%, 开机调试时间由原来的平均3 h降为0.5 h, 产品装量差异由原来的±20 mg降为±5 mg。结论 改造后压丸机更适合软胶囊产品的生产, 产品质量更加稳定, 开机效率更高。