基于蒙古语课程领域语义Web的推理与检索方法的研究

由于蒙古语网络教学相对落后,蒙古语教学资源的重用和利用率较低,并且基于关键字的教学资源检索缺少在语义层面上的处理和表示,导致检索结果不全面和不准确。针对这种情况,提出基于蒙古语课程领域语义Web的检索方法。通过建立教学领域"人工智能(■■)"课程蒙文本体,利用关系数据库MySQL、语义相似度以及推理规则等工具与方法,实现构建基于蒙古语教学领域查询与检索原型系统。实验结果表明,该方法能有效地提高信息检索的查全率和查准率,并且建立了蒙古语教学资源可以共享和互操作的知识层次结构。     

交互更新模式的量子遗传算法的几何约束求解

目的针对传统量子遗传算法无法充分利用种群中未成熟个体信息的不足,提出了基于交互更新模式的量子遗传算法(IUMQGA)并应用于几何约束求解中。方法几何约束问题的约束方程组可转化为优化模型,因此约束求解问题可以转化为优化问题。采用将遗传算法与量子理论相结合的量子遗传算法,使用双串量子染色体结构,使用交互更新策略将遗传算法中的交叉操作利用量子门变换来实现,根据不同情况采用不同的交互更新策略。这里的交互,指的是两个个体进行信息交换的过程,该过程用以产生新的个体。这不仅增加了个体间信息的交换而且充分利用了种群中未成熟个体的信息,提高了算法的收敛速度。结果通过非线性方程实例和几何约束实例测试并与其他方法比较表明,基于交互更新模式的量子遗传算法求解几何约束问题具有更好的求解精度和求解速率。双圆外公切线问题实例中,IUMQGA算法比QGA算法稳定;单圆填充问题和双圆外公切线问题实例中,通过实验求得各变量的最优值与其相应的精确值的误差在1E-2以下。结论采用交互更新模式的量子遗传算法可以很好地求解几何约束问题。     

工业软件现场测试中的拆分及其测试数据设计

在工业软件的用户生产现场测试中,可能由于操作风险、用户生产限制等约束而导致测试不充分,针对实践中的难点提出新的现场测试过程及其测试数据生成方法。定义了测试拆分子集及相关属性概念,根据现场因素设计的测试拆分子集提高了现场测试可主动性;综合现场因素设计拆分方案,采用针对性的辅助管理程序引导每个测试拆分子集的现场测试的实施;通过对生产现场的历史数据的处理建立针对各测试拆分子集的测试准备数据库,以搜索测试准备数据库的结果为依据并结合现场因素设计现场主动测试的输入数据,并说明了实践中的综合实施过程。通过石化生产优化控制系统的现场测试的实际案例,说明了这种方法能够在预防风险的前提下显著提高现场测试的充分性和测试效率。     

基于模糊控制的低能耗分簇协议

能耗是影响无线传感器网络生命周期的关键,具有低能耗的无线传感器网络是业界所期望的。现有的几个网络分簇协议能在一定程度上解决和改善网络能耗问题。如LEACH协议能在一定程度上延长网络生命周期,但网络环境的可变性以及实际环境中有诸多不可估计的因素,LEACH协议就没考虑当前节点剩余能量和节点分布情况等问题。提出的基于模糊控制的低能耗分簇协议LECP-FC能较好地解决环境可变等不可估计的问题,在簇头选取的过程中着重考虑了能量、节点度、节点中心度、距离、侦听密度等因子。经过网络结构配置和仿真,其结果表明网络工作效率得到很大程度上的提高。     

Managing a Very Connected World: A Report on APNOMS2015

This article presents a report on APNOMS2015, which was held August 19–21, 2015 in Busan, Korea. The theme of APNOMS2015 was “Managing a Very Connected World.”     

Exact and approximate flexible aggregate similarity search

Aggregate similarity search, also known as aggregate nearest-neighbor (Ann) query, finds many useful applications in spatial and multimedia databases. Given a group Q of M query objects, it retrieves from a database the objects most similar to Q, where the similarity is an aggregation (e.g., \({{\mathrm{sum}}}\), \(\max \)) of the distances between each retrieved object p and all the objects in Q. In this paper, we propose an added flexibility to the query definition, where the similarity is an aggregation over the distances between p and any subset of \(\phi M\) objects in Q for some support \(0< \phi \le 1\). We call this new definition flexible aggregate similarity search and accordingly refer to a query as a flexible aggregate nearest-neighbor ( Fann ) query. We present algorithms for answering Fann queries exactly and approximately. Our approximation algorithms are especially appealing, which are simple, highly efficient, and work well in both low and high dimensions. They also return near-optimal answers with guaranteed constant-factor approximations in any dimensions. Extensive experiments on large real and synthetic datasets from 2 to 74 dimensions have demonstrated their superior efficiency and high quality.     

Screen‐based color vision test for digital quantification of deutan color defects using a color‐calibrated monitor

Display technologies are used in various industries. However, few studies on color vision testing using self‐luminous displays are reported. In this study, a screen‐based color vision test, termed the digital color vision test (DCVT), is developed on a color‐calibrated monitor. A control bar is adjusted by the observer to build just noticeable chromatic difference ellipses in CIE u′v′ chromaticity diagram, which indicate the capabilities of subjects' color visions. Ten color‐normal observers and 13 deutan observers participated in the psychophysical experiments. The observers also performed the other two typical diagnostic tests (D‐15 and anomaloscope). Results from the experiment using the adjustment psychophysical method for digital quantification of deutan color vision defects are presented. It is found that the diagnosis accuracy of the DCVT is approximately equivalent to those of D‐15 and anomaloscope tests.     

Trust-based group services selection in web-based service-oriented environments

Multi-agent technologies have been widely employed for the development of web-based systems, including web-based e-markets, web-based grid computing, e-governments and service-oriented software systems. In these service-oriented systems, service provider agents and service consumer agents are autonomous and rational entities, which can enter and leave the environments freely. For simplicity, we use terms ‘provider’ and ‘consumer’ to represent this two types of agents. How to select the most suitable service providers according to a service request from a consumer in such an open environment is a very challenging issue. In this paper, we propose an innovative trust model, called the GTrust model, for service group selection in general service-oriented environments. In the GTrust model, the trust evaluation for a service group is based on the functionality coverage of the group, the dependency relationships among individual services in the group, the ratings of individual services on the attributes of the service request and a similarity measurement of the extent to which reference reports can reflect the service request in terms of the priority distribution of attributes. The experimental results and analysis demonstrate the good performance of the GTrust model on the service group selection in service-oriented environments.