基于四元数胶囊网络的知识图谱补全模型

知识图谱采用RDF三元组的形式描述现实世界中的关系和头、尾实体,即（头实体,关系,尾实体）或（主语,谓语,宾语）。为补全知识图谱中缺失的事实三元组,将四元数融入胶囊神经网络模型预测缺失的知识,并构建一种新的知识图谱补全模型。采用超复数嵌入取代传统的实值嵌入来编码三元组结构信息,以尽可能全面捕获三元组全局特性,将实体、关系的四元数嵌入作为胶囊网络的输入,四元数结合优化的胶囊网络模型可以有效补全知识图谱中丢失的三元组,提高预测精度。链接预测实验结果表明,与CapsE模型相比,在数据集WN18RR中,该知识图谱补全模型的Hit@10与正确实体的倒数平均排名分别提高3.2个百分点和5.5%,在数据集FB15K-237中,Hit@10与正确实体的倒数平均排名分别提高2.5个百分点和4.4%,能够有效预测知识图谱中缺失的事实三元组。     

有准备时间无等待流水车间调度的搜索算法

利用迭代变化邻域搜索算法(IVNS)求解最小化总完工时间的有准备时间无等待流水车间调度问题.设计局部搜索算法需要考虑3个关键因素:所用邻域、解评估和局部最优的克服.因此,定义了3个较大规模邻域以扩大搜索范围.为加速解评估,利用目标增量来避免重新计算每个解的目标函数值,使相邻解比较只需常量时间,NEH插入算法的时间复杂度降低一阶.IVNS通过切换邻域和扰动重启,来克服局部搜索易于陷入局部最优解的缺点.通过与求解该问题的当前最好算法在5400个标准算上,以相同CPU时间进行的实算比较,实验结果统计分析验证了IVNS的寻优性能明显优于参照算法.     

Web日志挖掘中的数据预处理技术

数据预处理是Web日志挖掘中的重要步骤,一般分为数据清理、用户识别、会话识别和路径补充。为消除代理服务器、防火墙和本地缓存对Web日志带来的影响,采用基于引用的分析方法完成用户会话识别和路径补充。实验结果表明,在Web访问日志中的记录引用信息较完整的情况下,该方法可以高效地获得用户的访问路径。     

基于矩阵完整化的分块整合推荐算法

传统的推荐系统往往是通过使用协同过滤或基于内容的方式来实现的,而文中将矩阵完整化的方法应用到推荐系统中。由于数据的稀疏性,直接使用矩阵完整化的方法会给推荐结果带来不小的误差。考虑到使用用户中存在一些活跃用户,挖掘出这些特殊用户,由他们组成的数据会降低稀疏性,而且对活跃用户提高 推荐质量,会产生更大的商业价值。提出了一种分块整合推荐的方法,实验结果表明该方法能够提升推荐精度。     

Scheduling a batching machine with convex resource consumption functions

In various industries jobs undergo a batching, or burn in, process where different tasks are grouped into batches and processed simultaneously. The processing time of each batch is equal to the longest processing time among all jobs contained in the batch. All to date studies dealing with batching machines have considered fixed job processing times. However, in many real life applications job processing times are controllable through the allocation of a limited resource. The most common and realistic model assumes that there exists a non-linear and convex relationship between the amount of resource allocated to a job and its processing time. The scheduler?s task when dealing with controllable processing times is twofold. In addition to solving the sequencing problem, one must establish an optimal resource allocation policy. We combine these two widespread models on a single machine setting, showing that both the makespan and total completion time criteria can be solved in polynomial time. We then show that our proposed approach can be applied to general bi-criteria objective comprising of the makespan and the total completion time.     

非负张量补全算法

近年来矩阵补全已成为一种重要的信号采集方式。将矩阵补全推广到非负张量情形,并提出了非负张量补全算法。该算法先将非负张量补全问题转化为交替求解一系列非负矩阵补全问题,再使用非负最小二乘方法求解这些问题。由于充分利用了数据的空时结构,所提的非负张量补全算法比非负矩阵补全算法有更好的恢复性能。实验结果证实了该方法的优越性。     

Convergence with a fixed regulator in lattice ordered groups and applications to MV-algebras

A convergence with a fixed regulator v in lattice ordered groups is applied to MV-algebras. For each Archimedean MV-algebra A there exists a v-Cauchy completion A ^* and it is uniquely determined up to isomorphisms over A. The relation between the Dedekind completion A ^∧ of A and A ^* is established. There is solved a question of the existence of the greatest v-Cauchy complete ideal of A.     

Note on “Unrelated parallel-machine scheduling with deteriorating maintenance activities”

In this note, we prove that both problems studied by Cheng et al. [Cheng, T. C. E., Hsu, C.-J., & Yang, D.-L. (2011). Unrelated parallel-machine scheduling with deteriorating maintenance activities. Computers and Industrial Engineering, 60, 602–605] can be solved in O(n^m+3) time no matter what the processing time of a job after a maintenance activity is greater or less than its processing time before the maintenance activity, where m is the number of machines and n is the number of jobs.