线性规划软件包GLPK的分析与应用

GLPK是一个求解大规模的线性规划问题(LP)、混合整数规划问题(MIP)以及相关问题的自由软件包。该文分析TGLPK的算法结构与数值计算等多方面的实现技术，并应用于解决NP-hard的调度问题。数值结果表明GLPK是研究LP和MIP问题强有力的工具。     

遮挡线索增强的最大密度投影算法

遮挡线索增强的最大密度投影算法（OEMIP）旨在解决最大密度投影法 （MIP）不能正确表达遮挡线索的问题,它包括两个步骤：首先使用K-Means 聚类算法从 MIP 结果图像中自动提取结构特征;然后根据结构特征自适应调节MIP 绘制过程以正确表 达遮挡线索。此外,引入绘制优先级以避免重要特征被次要特征严重遮挡,并给出绘制优先 级的自动设置算法。多个体数据的测试结果表明OEMIP 能显著增强遮挡线索,且能实现实 时交互。     

多播网际协议Multicast Internet Protocol

本文阐述了一个新的多播协议Multicast Internet Protocol(MIP)，MIP具有伸缩性和灵活性。文中讨论了有关MIP路由方法和MIP的实现。     

SEM混合模型脑血管分割算法

针对脑血管结构复杂、空间比例小,易导致对其进行图像分割较困难的问题,面向脑MRI提出参数统计分类算法,通过随机迭代提高血管分割精度.首先应用最大强度投影法(MIP)实现脑血管图像预处理,以降低脑血管图像中混合成分的数目;其次用有限高斯混合模型模拟脑血管和脑组织的随机分布;最后通过随机期望最大化(SEM)算法进行混合模型的参数估计,解决了传统期望最大化(EM)算法收敛速度缓慢和局部极值的问题.实验结果表明,采用文中算法可有效地分割脑血管主分支及周围较细小分支,且其收敛速度比传统EM算法有较大提高.     

基于H.266/通用视频编码的帧内双模式的视频水印算法

针对现有水印算法对编码器造成较大的率失真损失的问题,结合通用视频编码(VVC)标准,提出了一种基于帧内预测模式奇偶性的视频水印算法.首先,进行第一轮粗选来计算35种偶数角度模式,并从中选出6个模式;其次,在进行第二轮粗选时,根据二值水印状态来决定是否计算第二轮粗选的奇数模式;接着,在进行矩阵加权帧内预测(MIP)和最可...     

基于区域增长与局部自适应C-V模型的脑血管分割

提出了一种针对TOF MRA(time-of-flight magnetic resonance angiography)磁共振图像的双重分割脑血管提取方法。首先结合高斯滤波,采用二维OTSU算法,结合MIP(maximum intensity projection)图像获得三维血管种子点,定义全局与局部信息相结合的区域增长规则,通过区域增长算法对血管进行粗分割;然后,采用 Catt 扩散模型对体数据场进行各向异性滤波,提出了局部自适应C-V模型,将初步分割结果作为自适应活动轮廓模型的初始轮廓线进行二次分割。实验结果表明,该算法不仅能够有效分割脑血管粗大分支,而且还能精确提取脑血管的细小结构。     

一种求解整数规划与混合整数规划非线性罚函数方法

证明了任何一个变量有界的整数规划问题（IP）和混合整数规划问题（MIP）都可以转化为一个等价的非整数（或连续化）规划问题（NIP），并给出一个用非线性精确罚函数法来求解该等价NIP的方法，从而达到求解IP或MIP的目的，数值实验表明了算法的可行性。该方法可广泛用于各应用领域里IP和MIP的求解，特别是为非线性IP和MIP问题提供了一条通用 的求解途径，对解决许多实际优化问题具有重要意义。     

MIP/CP综合考虑的车间作业调度问题研究

作业车间(Job Shop)调度问题是指为具体的任务(工序)安排生产资源(机器)并确定合理的加工顺序,是一个典型的NP-Hard问题,有着广泛的研究.首先简单介绍约束编程(CP)思想及ILOG SOLVER系统并建立Job Shop调度问题的约束编程模型,并对模型的求解进行分析.然后分析混合整数规划(MIP)和约束编程(CP)模型求解的互补优势,建立Job Shop调度问题MIP/CP综合模型,并与CP模型进行比较,证明MIP/CP综合模型求解的效率.     

钢铁企业全流程物流优化问题的建模及分支——定价算法

研究了钢铁企业的全流程物流优化问题, 该问题在确保全流程各个工序机组产能和库存能力限制以及满足客户需求的前提下, 决策炼钢、连铸、热轧及冷轧工序间的物料流向和流量, 最小化物流成本、产能损失及库存费用. 为该问题建立了混合整数规划(Mixed integer programming, MIP)模型. 在问题求解中, 首先对MIP模型进行了Dantzig-Wolfe分解, 得到一个结构相对简单但列变量数目非常多的主问题和四个描述列向量空间的子问题. 然后, 从一个包含部分列变量的限制主问题出发, 通过子问题和主问题之间的迭代来获取主问题线性松弛的最优解. 最后, 将列生成同分支—定界相结合, 即分支—定价算法, 以获取原问题的整数最优解. 对某钢铁企业的实际生产数据扩展的随机算例进行仿真实验, 结果显示所提出的算法能够在合理计算时间内获得最优解或次优解.     

基于移动IP实现可靠组播的一种优化策略

移动IP(MIP)组播技术是移动IP技术和IP组播技术的结合,有着广泛的发展空间。该文对现有的可靠移动组播协议进行了研究,分析了各种协议无法满足复杂的实际应用的状况,然后针对该问题提出了基于移动节点的切换频率进行控制的一种优化策略,并且给出了基于该策略改进RRBMoM协议的算法。     

连铸-轧制生产中带有批决策的排序问题的建模与优化方法

以长材产线为背景, 研究了炉次在连铸及轧制阶段的组批及批排序问题. 与以往将连铸、轧制分开研究不同, 本文同时考虑连铸和轧制阶段对组批及批排序的要求, 还考虑了下游工序精整机组负荷均衡生产的要求. 为该问题建立了新的混合整数规划(Mixed integer programming, MIP) 模型. 由于问题的NP-hard 属性和模型的大规模特征, 以及工业应用的实际要求, 本文提出了改进的分散搜索(Scatter search, SS) 算法用于求解该问题. 在改进的SS 算法中, 利用解的相关性质来限制搜索空间, 并将变邻域搜索策略引入, 从而结合解的多样性及邻域互补性特点, 充分发挥算法混合的优势. 实际数据的计算结果验证了改进SS 算法的有效性.     

基于位置预查询的因特网移动支持方案

提出一种预查询移动支持方案(mobile Internet protocol_based on location pre-query,简称MIP_Q),以解决家乡网络的流量瓶颈和单点故障问题,从而提高移动通信的效率和可靠性.MIP_Q通过扩展域名服务系统管理和跟踪移动节点的当前位置信息,省去了家乡代理;采用并行切换控制方式,同时避免了MIP(mobile Internet protocol,简称MIP)中的三角路由和隧道路由问题;借助有效的计算方法,分析和比较了MIP_Q与MIP,MIP_LR的平均移动通信成本和切换时延;在实现方面与广泛应用的广域蜂窝移动网络进行了类比.结果表明:MIP_Q在切换效率和新增实体数等方面优于同类方案;MIP_Q可以极大地降低节点的移动通信成本,减小切换时延;MIP_Q具有良好的可行性.最后提出MIP_Q的仿真和实现方案.     

Computation of an Emptiable Minimal Siphon in a Subclass of Petri Nets Using Mixed-Integer Programming

Deadlock resolution strategies based on siphon control are widely investigated.Their computational efficiency largely depends on siphon computation.Mixed-integer programming(MIP)can be utilized for the computation of an emptiable siphon in a Petri net(PN).Based on it,deadlock resolution strategies can be designed without requiring complete siphon enumeration that has exponential complexity.Due to this reason,various MIP methods are proposed for various subclasses of PNs.This work proposes an innovative MIP method to compute an emptiable minimal siphon(EMS)for a subclass of PNs named S⁴PR.In particular,many particular structural characteristics of EMS in S4 PR are formalized as constraints,which greatly reduces the solution space.Experimental results show that the proposed MIP method has higher computational efficiency.Furthermore,the proposed method allows one to determine the liveness of an ordinary S⁴PR.     

Real‐Time Linear BRDF MIP‐Mapping

We present a new technique to jointly MIP‐map BRDF and normal maps. Starting with generating an instant BRDF map, our technique builds its MIP‐mapped versions based on a highly efficient algorithm that interpolates von Mises‐Fisher (vMF) distributions. In our BRDF MIP‐maps, each pixel stores a vMF mixture approximating the average of all BRDF lobes from the finest level. Our method is capable of jointly MIP‐mapping BRDF and normal maps, even with high‐frequency variations, at real‐time while preserving high‐quality reflectance details. Further, it is very fast, easy to implement, and requires no precomputation.     

医学图像中微细管道结构的提取

以肝动脉提取为例,提出一种医学图像中微细管道结构的提取算法。算法主要步骤包括：最大亮度投影、二维管道提取、三维种子点生成和三维管道提取。算法对常规的区域生长法进行改进,提取效果与常规的区域生长法相比有较大改善。算法需要的人工干预很少,只需要指定四个参数。     

Position control of a mobile inverted pendulum system using radial basis function network

This article presents the implementation of position control of a mobile inverted pendulum (MIP) system by using the radial basis function (RBF) network. The MIP has two wheels to move on the plane and to balance the pendulum. The MIP is a nonlinear system whose dynamics is nonholonomic. The goal of this study was to control the MIP to maintain the balance of the pendulum while tracking a desired position of the cart. The reference compensation technique scheme is used as a neural network control method for the MIP. The back-propagation learning algorithm of the RBF network is derived for online learning and control. The control algorithm has been embedded on a DSP 2812 board to achieve real-time control. Experimental results are conducted and show successful control performances of both balancing and tracking the desired position of the MIP.     

A cutting plane algorithm for the site layout planning problem with travel barriers

Site layout planning is an imperative procedure that may significantly impact the productivity and the efficiency of logistical operations undertaken on a construction site. This paper considers the site layout planning problem (SLPP) which entails the allocation of temporary facilities on a construction site in the presence of travel barriers such that the total transportation cost between facilities is minimised. In order to account for travel barriers, the SLPP is typically solved under the assumption that the available region for facility layout can be discretised. In this paper, we propose a general Mixed Integer Programming (MIP) model to represent the SLPP, accounting for the presence of barriers, and we show how space-discretised formulations can be derived from this model. In particular, we propose a novel MIP model, which permits facilities to cover multiple locations. This is then benchmarked against a commonly adopted MIP model in the literature. We also highlight a systematic procedure to convert the continuous feasible space in SLPP to a set of discretised locations based on the concept of d-visibility, enabling us to approximate the barrier distance function embedded in the objective function. In particular, we focus on presenting a simple space discretisation approach for converting the continuous SLP into a discrete problem for which the discrete SLP models would be applicable. Space-discretised MIP formulations are highly combinatorial and we introduce a cutting plane algorithm to improve their tractability. Specifically, we propose a novel exact location-decomposition algorithm which works from a relaxed MIP formulation and iteratively generates feasibility cuts to converge to an optimal solution. Both space-discretised MIP models and the decomposition algorithm are tested on a large group of instances to analyse their effectiveness in solving the SLPP. Computational results indicate that the proposed location-decomposition algorithm improves on the pure MIP approach and provides a competitive framework to solve realistic SLPP instances.     

一种MIP协议与micro-MIP协议相互融合的新方案

MIP协议为移动主机提供简单、扩展性强的全球移动，而各种micro-MIP协议则是解决域内快速、无缝切换的方案。当移动主机进行域间切换时，由于缺乏MIP协议与micro-MIP协议的协调机制将会导致移动主机的性能下降。提出了一种基于分组缓存和路由优化的宏观移动管理和域内micro-MIP协议无缝结合的新方案，可以提高All-IP网络的性能并保证移动主机的QoS性能。     

Bi-level programming enabled design of an intelligent maritime search and rescue system

This paper studies an intelligent maritime search and rescue (SAR) system problem. According to historical accidents and available SAR equipment information, a bi-level mixed-integer programming (MIP) model is proposed to determine the type and number of SAR equipment allocated to activated stations. Particle swarm optimization (PSO) algorithm and genetic algorithm (GA) algorithm are applied to solve the proposed mathematical model. Computational experiments based on real instances in the East Sea China not only validate the effectiveness of the bi-level MIP model in balancing two objectives during decision process, but also indicate that PSO algorithm is better than GA algorithm to solve the proposed model and generate reasonable equipment allocation plans. Some managerial implications are also outlined on the basis of the numerical experiments.