Robust visual tracking via CAMShift and structural local sparse appearance model

This paper addresses issues in visual tracking where videos contain object intersections, pose changes, occlusions, illumination changes, motion blur, and similar color distributed background. We apply the structural local sparse representation method to analyze the background region around the target. After that, we reduce the probability of prominent features in the background and add new information to the target model. In addition, a weighted search method is proposed to search the best candidate target region. To a certain extent, the weighted search method solves the local optimization problem. The proposed scheme, designed to track single human through complex scenarios from videos, has been tested on some video sequences. Several existing tracking methods are applied to the same videos and the corresponding results are compared. Experimental results show that the proposed tracking scheme demonstrates a very promising performance in terms of robustness to occlusions, appearance changes, and similar color distributed background.     

List coloring triangle-free planar graphs

This paper proves the following result. Assume $G$ is a triangle-free planar graph, $X$ is an independent set of $G$. If $L$ is a list assignment of $G$ such that $\text{◂=▸}|L\left(v\right)|=4$ for each vertex $\text{◂+▸}v\in V\left(G\right)-X$ and $\text{◂=▸}|L\left(v\right)|=3$ for each vertex $v\in X$, then $G$ is $L$-colorable.     

Novel method for transferring access control list rules to synchronize security protection in a locator/identifier separation protocol environment with cross‐segment host mobility

Extended access control lists (ACLs) are used to filter packets for network security. However, in current network frameworks, ACL rules are not transferred simultaneously with devices that move across network segments. The Internet Engineering Task Force proposed the Locator/Identifier Separation Protocol (LISP), which enables routers (xTRs) to configure ACL rules for blocking immobile endpoint identifiers (EIDs). However, when an EID moves from the original xTR to a new xTR, the ACL rules at the original xTR cannot be transferred with the EID. Thus, the new xTR lacks the corresponding ACL rules to effectively block the EID, resulting in security risks. The highlights of this study are as follows. First, a method is proposed for dynamically transferring ACL rules in LISP environments and frameworks. Second, the map‐register and map‐notify protocols were combined to encapsulate and transfer the ACL rules and thus obviate an additional process required to transfer these rules. Third, the experimental results verified that the proposed method can be used to achieve synchronized security protection in an LISP environment involving cross‐segment EID movements.     

Arc reversals of cycles in orientations of G vertex-multiplications

Ryser proved that any two tournaments with the same score sequence are $C_3$-equivalent while Beineke and Moon proved the $C_4$-equivalence for any two bipartite tournaments with the same score lists. In this paper, we extend these results to orientations of G vertex-multiplications. We focus on two main areas, namely orientations with the same score list and with score-list parity. Our main tools are extensions of the refinement technique, directed difference graph and a reduction lemma.     

一种基于C-RAN架构的LTE网络能效获取方法

提供了一种从单位流量能耗视角的LTE网络能效获取方法,弥补了现有技术不能对C-RAN架构下各网络子单元分别测算能效的不足。该方法包括收集流量清单和能耗清单,根据预设标记与过滤规则分别采集并上报无线网络中各网络子单元的实时流量和实时能耗。最后,根据流量清单、能耗清单以及预设时隙,获取各网络子单元和/或无线网络的能效。     

面向高效加密云数据排序搜索的类别分组索引方法

针对现有可搜索加密领域所遇到的加密密钥维度高、更新不灵活和搜索速度慢等问题,我们提出了一种新型类别分组索引方法——CGIM.新方法将数据分类后,按类提取关键词建立分组索引,并采用分组加密方式实现以若干低维加密密钥代替高维加密密钥以缩短索引和查询请求的加密时间.此外,分组索引方法的每个组向量对应不同的类别,这样不仅可以实现分类更新以改善更新文档的灵活性,而且能够在检索过程中生成针对性陷门,从而进一步提高搜索的速度和效率.理论和实验分析表明,该方法是可行且有效的.     

A Reliable All-2D Materials Artificial Synapse for High Energy-Efficient Neuromorphic Computing

High-performance artificial synaptic devices are indispensable for developing neuromorphic computing systems with high energy efficiency. However, the reliability and variability issues of existing devices such as nonlinear and asymmetric weight update are the major hurdles in their practical applications for energy-efficient neuromorphic computing. Here, a two-terminal floating-gate memory (2TFGM) based artificial synapse built from all-2D van der Waals materials is reported. The 2TFGM synaptic device exhibits excellent linear and symmetric weight update characteristics with high reliability and tunability. In particular, the high linearity and symmetric synaptic weight realized by simple programming with identical pulses can eliminate the additional latency and power consumption caused by the peripheral circuit design and achieve an ultralow energy consumption for the synapses in the neural network implementation. A large number of states up to ≈3000, high switching speed of 40 ns and low energy consumption of 18 fJ for a single pulse have been demonstrated experimentally. A high classification accuracy up to 97.7% (close to the software baseline of 98%) has been achieved in the Modified National Institute of Standards and Technology (MNIST) simulations based on the experimental data. These results demonstrate the potential of all-2D 2TFGM for high-speed and low-power neuromorphic computing.     

极化码的参数捷变技术及性能仿真

极化码是首个能够从理论上证明接近信道容量的纠错码,于2016年11月和低密度奇偶校验码一并作为第5代移动通信的标准。针对极化码特有的蝶形结构采用Trellis对其进行了重新描述,详细分析了串行抵消列表译码算法。同时,基于密度进化理论给出了极化码的码参数捷变技术,能够在不改变编译码器硬件结构与程序的情况下实时、快速地改变编译码参数。仿真结果表明,在编码参数近似相同的情况下极化码的性能要优于低密度奇偶校验码。     

基于改进协作目标外观模型的在线视觉跟踪

在不受限制的复杂环境中在线跟踪任意类型的感兴趣目标仍是一项极具挑战的难题.本文在无模型跟踪框架基础上提出一种基于改进协作目标外观模型的在线视觉跟踪方法,解决了大多数协作模型类跟踪算法在学习阶段无法有效选择正、负样本的问题.该方法根据人类视觉感知准则将目标边缘信息视为最具区分度的目标特征,提出边缘判别模型并结合动态模型和检测模块建立二级似然匹配空间,为生成模型的似然匹配去除了背景干扰;采用分块策略建立目标生成模型,为模型引入空间结构信息;利用Mean-Shift计算各子块的最终位置和匹配系数,并根据子块匹配系数为遮挡处理和模型更新提供依据.在公开视频序列上同几种流行视觉跟踪算法的对比实验结果证明了本文算法的有效性和优越性.     

基于启发式调度的OpenFlow网络规则一致更新方案

针对OpenFlow网络在状态转换过程中会暂时性出现转发回路、路由黑洞和违反访问控制策略等问题,提出了一种基于启发式调度的规则一致更新方案.首先,设计基于谓词的更新分解算法,利用并行网络属性验证技术得到子更新依赖图;其次,采用任务图生成算法对子更新依赖图进行分割,降低更新调度的复杂度;之后,设计启发式更新调度算法,采用规则增删操作交替执行策略,减少交换机的规则存储开销,并通过建立更新实施和监听并发执行机制,提升更新效率.仿真实验从更新时间开销和更新过程中交换机规则存储开销两方面验证了方案的有效性.