Efficient computation of distance labeling for decremental updates in large dynamic graphs

Since today’s real-world graphs, such as social network graphs, are evolving all the time, it is of great importance to perform graph computations and analysis in these dynamic graphs. Due to the fact that many applications such as social network link analysis with the existence of inactive users need to handle failed links or nodes, decremental computation and maintenance for graphs is considered a challenging problem. Shortest path computation is one of the most fundamental operations for managing and analyzing large graphs. A number of indexing methods have been proposed to answer distance queries in static graphs. Unfortunately, there is little work on answering such queries for dynamic graphs. In this paper, we focus on the problem of computing the shortest path distance in dynamic graphs, particularly on decremental updates (i.e., edge deletions). We propose maintenance algorithms based on distance labeling, which can handle decremental updates efficiently. By exploiting properties of distance labeling in original graphs, we are able to efficiently maintain distance labeling for new graphs. We experimentally evaluate our algorithms using eleven real-world large graphs and confirm the effectiveness and efficiency of our approach. More specifically, our method can speed up index re-computation by up to an order of magnitude compared with the state-of-the-art method, Pruned Landmark Labeling (PLL).     

基于内容热度与节点介数的NDN网络缓存策略

缓存技术是数据命名网络（Named data networking,NDN）的关键技术之一. NDN传统的LCE缓存策略会造成较大的冗余. 改进的RCOne策略采用随机放置的方法,没有利用任何内容、节点信息,对网络缓存性能的提升有限. Betw策略只考虑到节点介数,导致高介数节点缓存更替频繁,当节点缓存容量远小于内容总量时,缓存性能下降. 为了解决这些问题,本文提出一种结合内容热度与节点介数的新型缓存策略HotBetw（Hot content placed on node with high Betweenness）,充分利用内容与节点信息选择最佳的位置放置缓存. 仿真实验表明相对于典型NDN缓存策略,HotBetw缓存策略在提高缓存命中率、降低平均跳数方面具有很好的效果.     

A new generator of causal ideal internal dynamics for a class of unstable linear differential equations

The generator design for causal ideal internal dynamics (IID), namely, solving IID, is a fundamental problem in a nonminimum‐phase output tracking process. In this paper, for a class of unstable matrix differential equations, a new causal IID generator is proposed, whose parameters are partly chosen via optimization. Compared with existing similar design schemes, it is applicable to matrix differential equations with singular system matrices. Also, it requires less computation, avoids taking higher order derivatives, and can be easily extended to treat slowly time‐varying matrix differential equations without the need for extra computation. Copyright © 2016 John Wiley & Sons, Ltd.     

基于GPS软件接收机的C/A码捕获算法

为了尽量减少导航电文数据比特跳变带来的影响,在基于FFT的并行码相位搜索算法的基础上,采用两相邻毫秒数据进行捕获,再利用DFT细化频率估计,得到C/A码相位和较精确的载波频率。利用实际采集的数据进行实验,结果证实了该方法能快速有效地对C/A码进行捕获,为后续跟踪环路提供了良好的初始条件。     

一种基于UMTS核心网的定时器实现方案

针对UMTS核心网呼叫连接协议的实现,提出了一种软件定时器的实现方案。该方案以WinCE实时嵌入式系统作为开发环境,采用单链表队列和相对时间项方式的定时器数据结构,基于时间相对算法建立了定时器单一线程和插入、删除程序,以实现协议所规定的多定时器逻辑功能。在嵌入式系统编程过程中,运用互斥量机制完成定时器线程与插入、删除程序的通信同步;运用堆管理机制完成系统内存的动态分配与释放。对该方案的主要技术和实现结构作了论述,并给出了关键代码;还对UMTS协议结构和WinCE相关机制作了分析。实验表明,该设计方案具有编程效率高、实时性能好和系统开销小的特点,适合基于嵌入式系统的通信协议定时器编程。     

通用扫描线多边形填充算法

传统的扫描线多边形填充算法只适用于水平扫描线的逐行填充。文章提出通用扫描线多边形填充算法,该算法可以有效地解决任意间距、任意倾角的扫描线对多边形的填充问题。通用扫描线多边形算法采用了坐标变换、浮点数舍入策略等重要方法。顶点扫描线号是该算法中的核心概念。     

维修性运行功能预计法的计算机实现

维修性预计是产品设计中一项重要的工作。近年来,计算机辅助维修性预计的应用越来越多。这里将一种适用面较广的维修性预计方法——运行功能预计法进行了计算机化研究,并开发了相应的软件。主要介绍了这种软件的基本原理和主要功能、组成和特点,并提出了进一步努力的方向。     

近线性神经和元非线性神经元

人工神经网络(ANN)中普遍采用的神经元模型具有单调有界的I／O特性,该文称其为近线性神经元(ALN,approximate－linear neuron),ALN既简化了网络的复杂性,也是限制ANN能力的一个瓶径.通过比较Hopfield神经网络的稳定性和Conway生命游戏的复杂行为,该文提出非线性神经元(NLN,non－linear neuron)的概念,其I／O特性是完全非线性的.ALN可以进一步提高ANN的非线性,从而增强它的功能,余数制神经网络是一个例子.     

边界重叠图象的一种快速拼接算法

针对边界部分有重叠的图象,提出了一种基于网络的快速对准算法,并通过平滑因子对图象实现了无缝拼接。     

基于SOPC技术的嵌入式数控运动控制器的研究

围绕满足新一代数控系统各种性能要求的目标,文章首先探讨了SOPC技术应用于数控控制领域的发展前景和优势,然后采用了集成有ARM核的FPGA处理芯片,提出了一种基于SOPC技术的嵌入式数控运动控制器的研究方案.初步研究表明,这种方案能很大程度的解决现有数控系统诸如系统开放性、实时性、可剪裁性和重构性差等缺点.