Structure-sensitive semantic matching for aggregate question answering over knowledge base

Aggregate question answering essentially returns answers for given questions by obtaining query graphs with unique dependencies between values and corresponding objects. Word order dependency, as the key to uniquely identify dependency of the query graph, reflects the dependencies between the words in the question. However, due to the semantic gap caused by the expression difference between questions encoded with word vectors and query graphs represented with logical formal elements, it is not trivial to match the correct query graph for the question. Most existing approaches design more expressive query graphs for complex questions and rank them just by directly calculating their similarities, ignoring the semantic gap between them. In this paper, we propose a novel Structure-sensitive Semantic Matching(SSM) approach that learns aligned representations of dependencies in questions and query graphs to eliminate their gap. First, we propose a cross-structure matching module to bridge the gap between two modalities(i.e., textual question and query graph). Then, we propose an entropy-based gated AQG filter to remove the structural noise caused by the uncertainty of dependencies. Finally, we present a two-channel query graph representation that fuses the semantics of abstract structure and grounding content of the query graph explicitly. Experimental results show that SSM could learn aligned representations of questions and query graphs to eliminate the gaps between their dependencies, and improves up to 12% (F1 score) on aggregation questions of two benchmark datasets.     

Categorical observers for metamerism

A method is proposed to generate categorical colour observer functions (individual colour matching functions) for any field size based on the CIE 2006 system of physiological observer functions. The method combines proposed categorical observer techniques of Sarkar et al with a physiologically-based individual observer model of Asano et al and a clustering technique to produce the optimal set of categorical observers. The number of required categorical observers varies depending on an application with as many as 50 required to predict individual observers' matches when a laser projector is viewed. However, 10 categorical observers are sufficient to represent colour-normal populations for personalized colour imaging. The proposed and recommended categorical observers represent a robust and inclusive technique to examine and quantify observer metamerism in any application of colorimetry.     

Fundamental Evaluation of Power Supply and Rectifiers for Wireless Power Transfer Using Magnetic Resonant Coupling

This paper provides a fundamental analysis of a power supply and rectifiers for wireless power transfer using magnetic resonant coupling (MRC). MRC enables efficient wireless power transfer over middle‐range transfer distances. MRC for wireless power transfer should operate at a high frequency in the industry science medical band, such as 13.56 MHz, because the size of the transfer device decreases at higher transfer frequencies. Therefore, the output frequency of the power supply on the transmitting side should be 13.56 MHz. In addition, the rectifier on the receiving side is operated at a high frequency. This paper focuses on the reflected power in the power supply and rectifiers. Thus, the parametric design method is clarified for the power supply, including a low‐pass filter to match the output, the impedance of the power supply with the characteristic impedance of the transmission line. In addition, the effects on the rectifiers of silicon carbide and gallium nitride diodes are confirmed by performing an experiment and a loss analysis.     

基于组合双向拍卖的云资源调度方法

针对跨数据中心的资源调度问题，提出了一种基于组合双向拍卖（PCDA）的资源调度方案。首先，将云资源拍卖分为三个部分：云用户代理报价、云资源提供商要价、拍卖代理组织拍卖；其次，在定义用户的优先级及任务紧迫度的基础上，在拍卖过程中估算每一个工作发生的服务等级协议（SLA）违规并以此计算云提供商的收益，同时每轮竞拍允许成交多项交易；最终达到根据用户等级合理分配云资源调度的效果。仿真实验结果表明该算法保证了竞拍成功率，与传统一次拍卖成交一项的组合双向拍卖方案相比，PCDA在竞拍时间段产生的能耗降低了35.00%，拍卖云提供商的利润提高了约38.84%。     

Stereo matching cost computation based on nonsubsampled contourlet transform

A new matching cost computation method based on nonsubsampled contourlet transform (NSCT) for stereo image matching is proposed in this paper. Firstly, stereo image is decomposed into high frequency sub-band images at different scales and along different directions by NSCT. Secondly, by utilizing coefficients in high frequency domain and grayscales in RGB color space, the computation model of weighted matching cost between two pixels is designed based on the gestalt laws. Lastly, two types of experiments are carried out with standard stereopairs in the Middlebury benchmark. One of the experiments is to confirm optimum values of NSCT scale and direction parameters, and the other is to compare proposed matching cost with nine known matching costs. Experimental results show that the optimum values of scale and direction parameters are respectively 2 and 3, and the matching accuracy of the proposed matching cost is twice higher than that of traditional NCC cost.     

具有光照鲁棒的图像匹配方法

针对现有的基于局部特征的图像匹配算法对光照变化敏感、匹配正确率低等问题，提出一种具有光照鲁棒性的图像匹配算法。首先使用实时对比保留去色（RTCP）算法灰度化图像，然后利用对比拉伸函数模拟不同光照变换对图像的影响从而提取抗光照变换特征点，最后采用局部强度顺序模式建立特征点描述符，根据待匹配图像局部特征点描述符的欧氏距离判断是否为成对匹配点。在公开数据集上，所提算法与尺度不变特征变换（SIFT）算法、加速鲁棒特征（SURF）算法、"风"（KAZE）算法和ORB算法在匹配速度和匹配正确率上进行了对比实验。实验结果表明：随着图像亮度差异的增加，SIFT算法、SURF算法、"风"（KAZE）算法和ORB算法匹配正确率下降迅速，所提算法下降缓慢并且正确率均高于80%；所提算法特征点检测较慢和描述符维数较高，平均耗时为23.47 s，匹配速度不及另外四种算法，但匹配质量却远超过它们。对实时性要求不高的系统中，所提算法可以克服光照变化对图像匹配造成的影响。     

一种改进的颜色匹配对图像检索算法

以子块直方图彩色图像检索算法为基础， 分析了进一步利用图像空间相似信息的颜色匹配对检索算法的性能。在子块直方图的构成、直方图距离值的归类等方面提出了行之有效的改进方法；给出了子块大小、相似度阈值等参数选择的优化原则，使查准率、查全率等检索性能指标得到了较大的提高，得出了几个有用的结论并形成了实验系统。     

基于加速度计的坐标系匹配方法研究

为了提高加速度计应用中坐标系的匹配精度,提出了基于加速度计的坐标系匹配方法,介绍了其基本原理,并对加速度计的测角方法进行了深入研究.试验结果表明:该方法测量最大误差≤0.3°,满足实际应用要求,有效地解决了加速度计应用中的坐标系匹配问题.     

人工免疫原理在网络入侵检测系统中的研究

文章分析了人工免疫系统的原理,简单建立了一种基于否定选择算法的网络入侵检测系统,引入了一种用于异常事件识别的r-字符块匹配规则,并对规则存在的漏洞进行了分析。