车载自组织网络中基于连接时长的RSU部署方案

针对目前城市场景下车载自组织网络中的RSU部署问题,提出了一种基于连接时长的RSU部署方案.该方案在RSU数量受限的情况下,以保证通信连接时长为前提,以最大化服务车辆数目为目的,将部署问题建模成最大覆盖问题,设计了二进制粒子群算法进行求解,并结合真实的北京市路网地图和出租车GPS数据进行仿真实验.仿真结果表明,该算法是收敛、稳定及可行的,相比贪心算法,该算法求得的部署方案能为更多的车辆提供持续性的网络服务.     

自动铺丝平行等距轨迹规划算法实现

针对复合材料自动铺丝技术轨迹规划问题,提出了一种新的基于测地线的平行等距轨迹规划算法.该算法首先将已知的第一条轨迹线在曲面上等弧长离散得到若干数据点,然后在数据点处曲线切矢和曲面法矢的向量积方向上利用测地线的短程性获得下一条铺放轨迹上数据点,并利用B样条曲线拟和数据点生成铺放轨迹,最后使轨迹线铺满模具表面.算法中测地线利用微分方程组数值求解得到,以曲面曲线弧长为自变量,可实现等距线求解的自适应步长调整和较高的精度.经实际算例验证,该算法简单实用,精度能够满足铺丝技术工艺要求.     

基于热叠加模型的叠层3D多芯片组件芯片热布局优化研究

 叠层三维多芯片组件(3D Multi-Chip Module,MCM)芯片的位置布局直接影响其内部温度场分布,进而影响其可靠性.本文研究了叠层3D-MCM内芯片热布局优化问题,目标是降低芯片最高温度、平均芯片温度场.基于热叠加模型并结合热传导公式,选取芯片的温度作为评价指标,确定出用于3D-MCM热布局优化的适应度函数,采用遗传算法对芯片热布局进行优化,得出了最优芯片热布局方案,总结出了可用于指导叠层3D-MCM芯片热布局设计的热布局规则;采用有限元仿真方法,对所得的热布局优化结果进行验证,结果表明热布局优化结果与仿真实验结果一致,本文所提出的基于热叠加模型的MCM热布局优化算法可实现叠层3D-MCM芯片的热布局优化.     

软件定义网络中基于时延和负载的多控制器部署策略研究

多控制器体系结构的出现,解决了经典软件定义网络(SDN)架构控制层以单一集中控制器为主,在大规模网络环境中的可扩展性问题。在多控制器体系结构中,由于生成转发规则并将其填充到交换机的任务被委托给了控制器,网络的性能在很大程度上取决于控制器的放置。该文以降低总时延和均衡控制器间负载为目标,提出了一种基于子网划分的多控制器部署算法(MCPA)。该算法改造谱聚类算法以保证网络连通性并加入离群点处理算法和负载均衡处理算法。仿真结果表明,该算法能够有效地对网络进行划分,在保证网络总时延较低的情况下使各个控制器的负载保持均衡。     

分光节点的鲁棒配置算法

该文针对动态变化的业务请求,提出了分光节点的鲁棒配置算法,解决全光网络中光多播时分光节点最优配置问题。文中的测试验证了,利用这种鲁棒算法配置分光节点,与静态算法相比可以使资源的消耗在各种业务请求情况下都相对较优,稳定性好,总的资源消耗少,更符合实际。     

软件定义网络容错控制平面的最小覆盖布局方法

容错控制平面通过将多个控制器部署在不同的网络设备上进而增强网络的可靠性,但是大量的控制器部署带来了巨大的布局成本,严重地限制了容错控制平面在实际网络中的部署与应用。为了解决上述问题,该文首先构造了容错控制平面的最小覆盖布局模型,然后设计了一种基于局部搜索策略的启发式控制器布局算法,避免搜索结果陷入局部最优解。在不同规模网络中的仿真结果表明,相对于其他算法,所提算法可以在保证网络容错需求的同时,降低网络中部署控制器的数量。

     

Fair and efficient student placement with couples

We study situations of allocating positions to students based on priorities. An example is the assignment of medical students to hospital residencies on the basis of entrance exams. For markets without couples, e.g., for undergraduate student placement, acyclicity is a necessary and sufficient condition for the existence of a fair and efficient placement mechanism (Ergin in Econometrica 70:2489–2497, 2002). We show that in the presence of couples acyclicity is still necessary, but not sufficient. A second necessary condition is priority-togetherness of couples. A priority structure that satisfies both necessary conditions is called pt-acyclic. For student placement problems where all quotas are equal to one we characterize pt-acyclicity and show that it is a sufficient condition for the existence of a fair and efficient placement mechanism. If in addition to pt-acyclicity we require reallocation- and vacancy-fairness for couples, the so-called dictator- bidictator placement mechanism is the unique fair and efficient placement mechanism. Finally, for general student placement problems, we show that pt-acyclicity may not be sufficient for the existence of a fair and efficient placement mechanism. We identify a sufficient condition such that the so-called sequential placement mechanism produces a fair and efficient allocation.      

Cache placement in sensor networks under an update cost constraint

In this paper, we address an optimization problem that arises in the context of cache placement in sensor networks. In particular, we consider the cache placement problem where the goal is to determine a set of nodes in the network to cache/store the given data item, such that the overall communication cost incurred in accessing the item is minimized, under the constraint that the total communication cost in updating the selected caches is less than a given constant. In our network model, there is a single server (containing the original copy of the data item) and multiple client nodes (that wish to access the data item). For various settings of the problem, we design optimal, near-optimal, heuristic-based, and distributed algorithms, and evaluate their performance through simulations on randomly generated sensor networks.     

Introducing global constraints in CHIP

The purpose of this paper is to show how the introduction of new primitive constraints (e.g., among, diffn, cycle) over finite domains in the constraint logic programming system CHIP result in finding very rapidly good solutions for a large class of difficult sequencing, scheduling, geometrical placement and vehicle routing problems. The among constraint allows us to specify sequencing constraints in a very concise way. For the first time, the diffn constraint allows us to express and to solve directly multi-dimensional placement problems, where one has to consider nonoverlapping constraints between n-dimensional objects (e.g., rectangles, parallelepipeds). The cycle constraint makes it possible to specify a wide range of graph partitioning problems that could not yet be expressed by using current constraint logic programming languages. One of the main advantages of all these new primitives is to take into account more globally a set of elementary constraints. Finally, we point out that all the previous primitive constraints enhance the power of the CHIP system significantly, allowing us to solve real life problems that were not within reach of constraint technology before.     

Internet中基于启发式遗传算法的受限镜像放置问题求解

求解受限镜像放置问题对于Internet内容提供商具有重要的应用价值,但其在数学上归结为k-supplier问题,是一个NPC问题.本文提出了一种求解受限镜像放置问题的启发式遗传算法,该算法采用启发式交叉和变异算子,本质上是对标准两点交叉和单点变异产生的非法染色体进行启发式修正,以提高算法的局部搜索能力,加速收敛.仿真实验详细考察了启发式算子对收敛速度与全局优化性能的影响,并与两种常用启发式算法进行了性能比较.实验结果表明本文算法具有快速收敛,高性能,全局收敛等优点,证明其可行性和有效性.