Dual–primal proximal point algorithms for extended convex programming

This paper presents a class of dual–primal proximal point algorithms (PPAs) for extended convex programming with linear constraints. By choosing appropriate proximal regularization matrices, the application of the general PPA to the equivalent variational inequality of the extended convex programming with linear constraints can result in easy proximal subproblems. In theory, the sequence generated by the general PPA may fail to converge since the proximal regularization matrix is asymmetric sometimes. So we construct descent directions derived from the solution obtained by the general PPA. Different step lengths and descent directions are chosen with the negligible additional computational load. The global convergence of the new algorithms is proved easily based on the fact that the sequences generated are Fejér monotone. Furthermore, we provide a simple proof for the O(1/t) convergence rate of these algorithms.     

一种基于OpenFlow的SDN访问控制策略实时冲突检测与解决方法

软件定义网络SDN(Software-Defined Networking)是由美国斯坦福大学Clean Slate研究组提出的一种新型网络创新架构,可通过软件编程的形式定义和控制网络,其控制平面和转发平面分离及开放性可编程的特点,为新型互联网体系结构研究提供了新的实验途径,也极大地推动了下一代互联网的发展.OpenFlow是SDN的主要协议,定义了SDN控制器与交换机之间的通信标准.目前,很多基于OpenFlow的SDN设备已经在实际中得到了部署.但是,基于OpenFlow的SDN却面临很多安全挑战.其中一个重要的挑战是如何建立一个安全可靠的SDN防火墙应用.由于OpenFlow协议的无状态性,现有的SDN防火墙可以被通过改写交换机中的流表项轻松绕过.针对这一安全威胁,作者提出了基于Flowpath的实时动态策略冲突检测与解决方法.通过获取实时的SDN网络状态,能够准确地检测防火墙策略的直接和间接违反,并且一旦发现冲突,可以基于Flowpath进行自动化和细粒度的冲突解决.最后,作者在开源控制器Floodlight上实现了一个安全增强的防火墙应用FlowVerifier,并基于Mininet对FlowVerifier的性能进行了评估.结果表明FlowVerifier能够检测和自动化地解决SDN网络中由于流表改写而引入的策略冲突及其带来的安全威胁.     

一种高精度车载坡度检测仪的研制

针对现有车载坡度检测技术缺陷,提出了一种高精度车载道路坡度检测仪的设计及实现方案。该检测仪由主控节点和多个检测节点组成,检测节点通过三轴加速度传感器检测与地面倾角,并将其发送给主控节点;主控节点收集各检测节点数据,对其进行数据融合得到坡度的最优估计值。通过仿真和实验验证了方案的可行性,设计成果可广泛应用于车载导航系统中。     

Online algorithms for scheduling two parallel machines with a single server

We consider an online scheduling problem on two identical parallel machines with a single server. Jobs arrive one by one and each job has to be loaded by the server before being processed on one of the machines, and unloaded immediately by the server after its processing. Both loading and unloading times are equal to one time unit. The goal is to minimize the makespan. For the variant of the problem involving both loading and unloading operations, we present an online algorithm with competitive ratio of 5/3. For the variant with loading operation only, we show that the competitive ratio of list scheduling is at least 8/5 and provide an improved online algorithm with competitive ratio of 11/7. Finally, we discuss the lower bounds for these problems. We show that both variants have a lower bound of 3/2. Furthermore, we show that the lower bound of the first variant is at least 8/5 if the online algorithm satisfies a certain constraint.     

Redundancy filtering and fusion verification for video copy detection

Multimedia Systems - Recently, the frame fusion based video copy detection scheme provides a possibility to detect copies in a continuous query video stream. However, its computational complexity...     

基于椭圆曲线密码体系的多基联合稀疏表示算法

椭圆曲线已经广泛应用于密码学领域中的公钥密码系统,数字签名验证等。在椭圆曲线密码系统中,标量乘法占据着十分重要的地位。目前已经有一些算法来加快这些十分关键的计算,它们均基于整数的不同表示,以尽量减少一般乘法或点加法的数目。在椭圆曲线现有的各种计算方法中,联合稀疏表式(JSF),w-NAF,双基方法是目前常用并且有效的算法。基于多基整数表示系统,提出一种联合多基稀疏表示方法。多基联合稀疏表示需要较少的位数,并且比JSF和w-NAF更加稀疏,(2,3,5)基表示与(2,3)基表示相比,可以使椭圆曲线标量乘法的运算提高约16%的效益。