移动边缘计算中的动态用户分配方法

在边缘计算环境中,为用户匹配合适的服务器是一个关键问题,可以有效提升服务质量。文中将边缘用户分配问题转换为一个受距离和服务器资源约束的二分图匹配问题,并将其建模为一个0-1整数规划问题进行优化。在离线状态下,基于精确式算法的优化模型可以求得最优分配策略,但其求解时间过长,无法处理规模较大的数据,不适用于现实服务环境。因此,提出了基于启发式策略的在线分配方法,以在时间有限的情况下优化用户-服务器的分配。实验结果显示,基于近邻启发式的在线方法的竞争比能够接近100%,可以在可接受的时间范围内求得较优的分配解。同时,近邻启发式方法比其他基础启发式方法的表现更优秀。

移动边缘计算下基于联邦学习的动态QoS优化

在5G边缘网络飞速发展的过程中,边缘用户对高带宽、低时延的网络服务的质量要求也显著提高.从移动边缘网络的角度来看,网络内的整体服务质量与边缘用户的分配息息相关,用户移动的复杂性为边缘用户分配带来困难,边缘用户分配过程中还存在隐私泄露问题.本文提出一种移动边缘环境下基于联邦学习的动态QoS(Quality of Service)优化方法MECFLD_QoS,基于联邦学习的思想,优化边缘区域的服务缓存,在动态移动场景下根据用户位置分配边缘服务器,有效保护用户隐私,实现区域服务质量优化,对动态用户移动场景有更好的适应性.MECFLD_QoS主要做了以下几个方面的优化工作:(1)优化了传统QoS数据集,将数据集映射到边缘网络环境中,充分考虑边缘计算的移动、分布式、实时性、复杂场景等特点,形成边缘QoS特征数据集;(2)优化了边缘服务器缓存,在用户终端训练用户偏好模型,与区域公有模型交互时只传输参数,将用户的隐私数据封装在用户终端中,避免数据的传输,可以有效地保护用户特征隐私;(3)优化了用户移动场景,在动态移动场景中收集用户移动信息,利用用户接入基站的地理位置拟合用户的移动轨迹进行预测,有效地模糊了用户的真实位置,在轨迹预测的同时有效地保护了用户的位置隐私;(4)优化了用户分配方法,提出改进的基于二维解的人工蜂群算法对边缘网络中的用户分配问题进行优化,事实证明改进的人工蜂群算法针对其多变量多峰值的特点有效地优化了用户分配,达到了较优的分配效果.通过边缘QoS特征数据集实验表明,本方法在多变量多峰值的用户分配问题中能产生全局最优的分配.

基于双互信息准则的雷达自适应波形设计方法

自适应波形优化技术是认知雷达的关键技术之一,通过优化发射波形能够提高雷达系统性能.针对目标检测问题,在杂波环境下,提出一种基于双互信息优化准则的自适应波形优化方法.该方法同时以接收信号与目标冲激响应之间的互信息最大和接收信号与杂波冲激响应之间的互信息最小为优化准则,在发射信号能量有限的约束条件下,建立优化模型,通过最大边缘分配算法求解最优波形.仿真结果表明,相对于固定波形,所提方法优化发射波形能够提高目标检测性能.

联合准则下的认知雷达波形设计

针对不同工作环境中,需要雷达同时具有多种模式和多种任务的问题,提出了一种联合优化准则的雷达波形设计方法,该方法综合考虑了目标与回波之间的互信息与信干噪比。在发射信号能量有限的约束条件下,首先通过最大边缘分配算法求解最优波形,其次讨论互信息与信干噪比的增减率,当改变系数值时,联合准则下的雷达信号模型既可同时提高互信息和信干噪比值,又可根据发射需求分别优化互信息或信干噪比。最终信号模型通过一次或较少次数的观测同时完成目标参数估计、检测或识别任务,为雷达波形优化朝着多功能模型设计提供研究依据。

Joint wireless and cloud resource allocation based on parallel auction for mobile edge computing

A joint resource allocation algorithm based on parallel auction(JRAPA)is proposed for mobile edge computing(MEC).In JRAPA,the joint allocation of wireless and cloud resources is modeled as an auction process,aiming at maximizing the utilities of service providers(SPs)and satisfying the delay requirements of mobile terminals(MTs).The auction process consists of the bidding submission,winner determination and pricing stages.At the bidding submission stage,the MTs take available resources from SPs and distance factors into account to decide the bidding priority,thereby reducing the processing delay and improving the successful trades rate.A resource constrained utility ranking(RCUR)algorithm is put forward at the winner determination stage to determine the winners and losers so as to maximize the utilities of SPs.At the pricing stage,the sealed second-price rule is adopted to ensure the independence between the price paid by the buyer and its own bid.The simulation results show that the proposed JRAPA algorithm outperforms other existing algorithms in terms of the convergence rate and the number of successful trades rate.Moreover,it can not only achieve a larger average utility of SPs but also significantly reduce the average delay of MTs.

Continuous Multipartite Entangled Representation and Its Wigner Operator and Marginal Distribution

By extending the EPR bipartite entanglement to multipartite case, we briefly introduce a continuous multipartite entangled representation and its canonical conjugate state in the multi-mode Fock space, analyze their Schmidt decompositions and give their entangling operators. Furthermore, based on the above analysis we also find the n-mode Wigner operator. In doing so we may identify the physical meaning of the marginal distribution of the Wigner function.

NEW APPROACH FOR IMAGE REPRESENTATION BASED ON GEOMETRIC STRUCTURAL CONTENTS

This paper presents a novel approach for representation of image contents based on edge structural features. Edge detection is carried out for an image in the pre-processing stage.For feature representation, edge pixels are grouped into a set of segments through geometrical partitioning of the whole edge image. Then the invariant feature vector is computed for each edge-pixel segment. Thereby the image is represented with a set of spatially distributed feature vectors, each of which describes the local pattern of edge structures. Matching of two images can be achieved by the correspondence of two sets of feature vectors. Without the difficulty of image segmentation and object extraction due to the complexity of the real world images, the proposed approach provides a simple and flexible description for the image with complex scene, in terms of structural features of the image content. Experiments with real images illustrate the effectiveness of this new method.

A MODIFIED EDGE-ORIENTED SPATIAL INTERPOLATION ALGORITHM FOR CONSECUTIVE BLOCKS ERROR CONCEALMENT

This paper proposes a low-complexity spatial-domain Error Concealment (EC) algorithm for recovering consecutive blocks error in still images or Intra-coded (I) frames of video sequences. The proposed algorithm works with the following steps. Firstly the Sobel operator is performed on the top and bottom adjacent pixels to detect the most likely edge direction of current block area. After that one-Dimensional (1D) matching is used on the available block boundaries. Displacement between edge direction candidate and most likely edge direction is taken into consideration as an important factor to improve stability of 1D boundary matching. Then the corrupted pixels are recovered by linear weighting interpolation along the estimated edge direction. Finally the interpolated values are merged to get last recovered picture. Simulation results demonstrate that the proposed algorithms obtain good subjective quality and higher Peak Signal-to-Noise Ratio (PSNR) than the methods in literatures for most images.

Pfaffian graphs embedding on the torus

An orientation of a graph G with even number of vertices is Pfaffian if every even cycle C such that G-V(C) has a perfect matching has an odd number of edges directed in either direction of the cycle. The significance of Pfaffian orientations stems from the fact that if a graph G has one, then the number of perfect matchings of G can be computed in polynomial time. There is a classical result of Kasteleyn that every planar graph has a Pfaffian orientation. Little proved an elegant characterization of bipartite graphs that admit a Pfaffian orientation. Robertson, Seymour and Thomas (1999) gave a polynomial-time recognition algorithm to test whether a bipartite graph is Pfaffian by a structural description of bipartite graphs. In this paper, we consider the Pfaffian property of graphs embedding on the orientable surface with genus one (i.e., the torus). Some sufficient conditions for Pfaffian graphs on the torus are obtained. Furthermore, we show that all quadrilateral tilings on the torus are Pfaffian if and only if they are not bipartite graphs.