Fusing ant colony optimization with Lagrangian relaxation for the multiple-choice multidimensional knapsack problem

The multiple-choice multidimensional knapsack problem (MMKP) concerns a wide variety of practical problems. It is strongly constrained and NP-hard; thus searching for an efficient heuristic approach for MMKP is of great significance. In this study, we attempt to solve MMKP by fusing ant colony optimization (ACO) with Lagrangian relaxation (LR). The algorithm used here follows the algorithmic scheme of max–min ant system for its outstanding performance in solving many other combinatorial optimization problems. The Lagrangian value of the item in MMKP, obtained from LR, is used as the heuristic factor in ACO since it performs best among the six domain-based heuristic factors we define. Furthermore, a novel infeasibility index is proposed for the development of a new repair operator, which converts possibly infeasible solutions into feasible ones. The proposed algorithm was compared with four existing algorithms by applying them to three groups of instances. Computational results demonstrate that the proposed algorithm is capable of producing competitive solutions.     

SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs

This paper introduces a propositional encoding for recursive path orders (RPO), in connection with dependency pairs. Hence, we capture in a uniform setting all common instances of RPO, i.e., lexicographic path orders (LPO), multiset path orders (MPO), and lexicographic path orders with status (LPOS). This facilitates the application of SAT solvers for termination analysis of term rewrite systems (TRSs). We address four main inter-related issues and show how to encode them as satisfiability problems of propositional formulas that can be efficiently handled by SAT solving: (A) the lexicographic comparison w.r.t. a permutation of the arguments; (B) the multiset extension of a base order; (C) the combined search for a path order together with an argument filter to orient a set of inequalities; and (D) how the choice of the argument filter influences the set of inequalities that have to be oriented (so-called usable rules). We have implemented our contributions in the termination prover AProVE. Extensive experiments show that by our encoding and the application of SAT solvers one obtains speedups in orders of magnitude as well as increased termination proving power.     

基于消除地方高校成长上限基模的实证研究——以江西M学校为例

本文基于系统动力学反馈基模分析方法,在分析江西地方高校发展的成长上限基模和对策基模的基础上进行实证研究,引入相关数据,构建消除成长上限基模的顶点赋权模型,并提出综合对策思考。     

云南村镇垃圾收转运系统建设探讨

对虚拟的垃圾收运项目区域,从覆盖范围的确定、收集方式的选择、收运设施的设置、收运线路的规划4个方面做了较为全面的分析和研究,期望村镇垃圾收转运系统的设计和实施能够实用、适用,并对云南省同类型的村镇垃圾收转运系统建设具有借鉴意义。     

一种全局LBF主动轮廓模型

LBF模型的能量函数对于水平集函数是非凸的,从而导致应用LBF模型分割的最终结果对水平集函数的初始化非常敏感。通过凸化LBF模型的能量函数,提出一种全局的LBF模型(GLBF)。该模型针对水平集函数是凸的,从而可以通过任意初始化水平集函数得到全局最优解。此外,该模型不必重新初始化水平集函数为符号距离函数,从而极大地提高运算效率。对灰度不均匀医学图像的分割结果表明,GLBF模型对水平集函数的初始化不敏感,优于传统的LBF模型以及目前具有代表性的LIF模型。     

基于弹载存储系统的便携式读数盒设计及应用

当发射试验结束后,为了对飞行体数据存储器中的数据进行回收,提出了基于FPGA的便携式读数盒的电路设计及控制逻辑设计。在简要介绍数据存储系统的同时,详细阐述了读数盒在弹载存储器数据回收模式中的应用、读数盒的硬件设计以及FPGA的控制逻辑设计。实践证明,该设计实现了飞行体对硬回收存储器中数据的可靠读取和回收,满足工程实践要求。     

基于HTML5的全景图展示

全景图是近年出现的一种新的交互式的虚拟场景表示方式,可以用相应的浏览器实现虚拟场景的漫游,具有很好的真实感和沉浸感。详细介绍了一种基于HTML5的全景图浏览器的实现原理,并给出了关键的HTML5代码。最终取得了良好的展示效果。     

基于支持向量机集成算法的煤矿顶板状态检测

针对小样本、多类煤矿顶板的状态检测问题,提出了基于支持向量机集成的算法。采用深度优先搜索对支持向量机集成参数进行优化,并结合煤矿顶板敲击声信号的人耳听觉功率谱特征,对煤矿顶板中浮石、剥层等现象进行分类识别。实验表明,该算法能够对多类顶板状态进行有效分类,且识别率较高,能够作为安全开采的保障手段。     

水口水电厂设备状态监测与诊断分析系统

结合工程实践,全面地描述了水口水电厂机组、主变的状态监测与诊断分析系统,包括总体目标和设计原则,系统总体结构,监测范围和测点布置,软件系统组成,系统的主要功能及应用。