Differential privacy protection scheme based on edge betweenness model

With the continuous development of social network application,user’s personal social data is so sensitive that the problem of privacy protection needs to be solved urgently.In order to reduce the network data sensitivity,a differential privacy protection scheme BCPA based on edge betweenness model was proposed.The 2K sequence corresponding to the graph structure based on the dK model was captured,and 2K sequences based on the edge betweenness centrality were reordered.According to the result of reordering,the 2K sequence was grouped into several sub-sequences,and each sub-sequence was respectively added with noise by a dK perturbation algorithm.Finally,a social network graph satisfying differential privacy was generated according to the new 2K sequences after integration.Based on the real datasets,the scheme was compared with the classical schemes through simulation experiments.The results demonstrate that it improves the accuracy and usability of data while ensuring desired privacy protection level.     

Privacy-preserving photo sharing framework cross different social network

With rapid developments of digital photography and social networks,users of photo-sharing-supported social networking applications can easily forward photos across different social networks at the cost of their growing privacy concerns.To address this problem,a privacy-preserving photo sharing framework was proposed,which could apply to extended control and privacy invasion tracing.In extended control scheme,the following users on a dissemination chain was restrained by each user’s privacy policy.Then several privacy areas of photos were encrypted and the access control polices were bound to the uploaded photos,so that any privacy areas on the photos could be hidden away from unwanted viewers even across different social networks.On this basis,the behaviors of users were record by tracing scheme of privacy invasion,the integrality of records was protected by using nested signature algorithm.The correctness,security and performance of overhead of the scheme are then thoroughly analyzed and evaluated via detailed simulations.     

无线Ad hoc 网络及其研究难点

无线Ad hoc网络作为没有基础设施的网络，在军事和民用方面具有广阔的应用前景，是目前网络研究中的热点问题。本文对无线Ad hoc网络进行了详细的论述，指出了目前研究中存在的一些难点。     

智能配网中智能分布式FA的应用分析

本文在智能配电网的基础上,主要介绍了智能配网中智能分布式FA的相关应用要点,包括其实现原理、技术基础、系统运行要求、应用功能特征等内容。同时以开环配电网的智能分布式FA为例子,简要论述了智能分布式FA的应用方案与应用要点,在智能配网中灵活应用FA,有助于降低输电故障的发生率,提升供电的安全性与稳定性,对于促进我国智能化配电网的发展有着非常重要的现实意义。     

目标识别技术及其在现代战争中的应用

讨论目标识别在现代战争各个领域中的应用,总结目标识别技术的发展方向,提出目标识别技术工程化实现方法。     

OGHAM: On-demand global hosts for mobile ad-hoc multicast services

Recent advances in pervasive computing and wireless technologies have enabled novel multicast services anywhere, anytime, such as mobile auctions, advertisement, and e-coupons. Routing/multicast protocols in large-scale ad-hoc networks adopt two-tier infrastructures to accommodate the effectiveness of the flooding scheme and the efficiency of the tree-based scheme. In these protocols, hosts with a maximal number of neighbors are chosen as backbone hosts (BHs) to forward packets. Most likely, these BHs will be traffic concentrations or bottlenecks of the network and spend significant amount of time forwarding packets. In this paper, a distinct strategy is proposed for constructing a two-tier infrastructure in a large-scale ad-hoc network. Hosts with a minimal number of hops to the other hosts rather than those with a maximal number of neighbors will be adopted as BHs in order to obtain shorter multicast routes. The problem of determining BHs can be formulated with linear programming. BHs thus found have the advantages of shorter relay and less concentration. Besides, BHs are selected on-demand and can be globally reused for different multicast groups without flooding again. Simulation results show that the proposed protocol has shorter transmission latency, fewer control/data packets and higher receiving data packet ratios than other existing multicast protocols. Besides, the two-tier infrastructure constructed by the proposed protocol is more stable.     

基于预算机制的非结构化P2P网络分段搜索策略

在非结构化P2P网络中,降低消息冗余,提高搜索的效率,一直是资源搜索的关键问题.目前非结构化P2P网络均采用生存时间（Time-To-Live）机制控制搜索算法的深度,但是同时产生了大量的冗余消息,严重影响了网络的利用率.为了能够在保持高搜索效率的前提下减少冗余消息的数量,提出了一种基于预算机制的非结构化P2P网络分段搜索策略DBudgetSearch.DBudgetSearch将搜索过程分为两个阶段,并在每个阶段中使用预算机制来控制消息转发的数量和导向,根据邻居节点的连接度大小来选择消息的转发对象.分析和试验结果表明,DBudgetSearch导向性好,算法搜索效率高,能够有效减少冗余消息.     

Utility‐based probabilistic call admission control for complete fairness in wireless networks

Resource reservation or the other prioritization strategies adopted by Call Admission Control (CAC) schemes in wireless networks lead to unfair resource allocation to users belonging to different service classes (SCs) due to high divergence among the respective call blocking probabilities (CBPs). In this paper, we propose dynamic optimization of probabilistic CAC (P‐CAC) schemes to assure CAC fairness among users of different SCs in wireless networks. The approach is based on users utility combined with fairness optimization, aiming at dynamically determining the probability value in the P‐CAC scheme. This optimal probability is adjusted to network ongoing traffic, CBPs of each SC, prioritization levels characterizing the SCs supported, and the users risk aversion, which reflects their behavior toward the perceived QoS. The existence and uniqueness of the optimal probability that leads to absolute fairness among the users of a wireless network are proven. Copyright © 2012 John Wiley & Sons, Ltd.     

多TDI CCD拼接遥感相机异速成像抗干扰设计

多TDI CCD拼接相机在异速工作模式下,不同通道的CCD图像间会存在相互干扰现象,不同行频差会在图像上产生不同斜率、不同宽度的干扰斜条纹。为了解决此问题,文中对原设计电路系统进行了详细分析和优化设计。首先,从异速时序在不同行周期的相位差别上进行分析,异速模式下不同CCD成像电路时序间存在行频差异,导致各个行周期内CCD个别像元上与其他像元叠加的干扰不一致,是干扰斜条纹产生的原因。然后,采取优化关键信号布线方式、系统地和电源布置、去耦电容接地方式等多方面对电路系统进行了改进,优化多TDI CCD成像系统电路抗异速干扰设计。最后,对改进后的电路系统进行测试,去除干扰斜纹,并将图像均方根噪声水平由21.5 mV降低到4.2 mV。结果表明:采用抗干扰技术,有效地去除了通道间干扰斜纹,提高了图像质量。     

分布式全局精确时钟同步状态追踪:能观测性观测器分析

本文基于现代控制理论观点下的量测模型的能观测性分析,提出绝对时钟状态量测模型的能观测性问题.启发于量测状态向量空间与状态向量运算法则,转化为本质上向量空间的同构映射原理,建立了以基本量测单元（Basic Measurement Unit,BMU）构建最小均方误差（Minimum Mean Square Error,MMSE）等价变换下的能观测性解耦量测模型.该方法揭示了在双向信息交换下对称量测性能的本质,在量测模型满足能观测性的必要条件下实现时钟状态追踪的Kalman filtering算法.本文算法不依赖于优化的初始点设置,初始点选择具有鲁棒性,并且对于网络连接性的变化具有稳健性.仿真结果表明,能观测性量测模型能实现规模化扩展,设计的算法具有局部和全局一致的MMSE量测性能,接近于贝叶斯CRLB（Cramer-Rao Lower Bound）量测性能边界.