基于流媒体的隐蔽通信可靠传输机制的研究

首先分析了原有流媒体隐蔽通信系统模型在传输机制上存在的问题.在此基础上改进了原有的传输方案,提出了一种新的基于流媒体的隐蔽通信的可靠传输机制,并进行实现和实际测试.实验结果表明,对于只有当载体满足一定条件时才可以嵌入的隐藏算法,新的传输机制也能保证可靠传输,性能较以前的方法也有长足的改善.     

基于缓存偏移量的P2P流媒体调度策略

现有P2P流媒体调度策略在确定数据块调度优先级时,未能综合考虑数据块稀缺度和紧迫度因素,导致了较差的播放连续度和启动延迟性能。提出的基于缓存偏移量的数据调度策略通过统计数据块在供求节点上的播放偏移量并对其加以处理,可有效懈决该问题,使播放连续度、启动延迟性能得到明显提高。     

对等网端到端多路径选择建模及算法研究*

在对等网上利用多路径分发视频是一种重要的机制,虽然在一对节点之间找出符合条件的多条路径并不困难,但发送端如何从可用路径集中选出最优路径子集,并为其最优地分配发送速率仍是一个难题。为此,提出一种新的对等网端到端最优多路径选择与速率分配(OMPSRA)算法。首先,应用排队论建立OMPSRA模型,并推导出一种新的OMPSRA公式,公式既给出最优分配的计算方法,也给出路径的最优速率分配与各路径最大可用带宽之间的关系,利用此关系可选出最优路径子集。最后基于公式实现OMPSRA算法。理论分析和仿真实验结果表明提出的算法能对通信量进行全局最优分配,最小化视频传输的端到端时延,有效提高视频传输质量,比同类算法有更好的性能。     

基于联合矩阵分解的话题发现与追踪模型

在文本流数据中,文本文档以流的形式源源不断地进入系统,数据量大和数据更新速度快给文本流话题发现与追踪提出了严峻的挑战。为了应对上述困难,本文提出了一种基于联合矩阵分解的话题发现与追踪模型。为了有效地处理海量数据,将流数据按照时间戳划分为数据块;为了能在数据的快速变化中追踪到话题的演化,将当前时刻的话题分布表示为前一时刻话题分布的线性演化。本文采用联合矩阵分解技术将当前的数据块分别表示为当前的话题分布和前一时刻的话题分布两种形式,通过同时分解两个矩阵得到当前的话题分布。在优化求解过程中,通过Karush-Kuhn-Tucker条件分析得到参数的更新策略,并给出相应的求解算法。Yahoo数据集对比实验表明,本文提出的话题发现算法能更好的发现文本流中蕴含的话题分布情况,并且可以随着时间的推移对话题的演化进行追踪。     

Judging online peer-to-peer lending behavior: A comparison of first-time and repeated borrowing requests

The past decade has witnessed a growing number of business models that facilitate economic exchanges between individuals with limited institutional mediation. One of the important innovative business models is online peer-to-peer lending, which has received wide attention from government, industry, and researchers. Using the signaling theory, we compare the effects of various signals on the likelihood of successful funding in three models (i.e., first-time borrowing, repeated borrowing without prior lending, and repeated borrowing with prior lending). Using data collected from PPDAI.com, we verify the three proposed models by employing logistic regression. Results and implications are analyzed and discussed.     

面向新媒体广播的云CDN系统

互联网用户的快速增长使得流媒体访问需求不断增加,庞大的流媒体访问需求和有限的服务器分发能力,造成了系统响应慢、用户体验下降等问题.针对以上问题,结合新媒体广播项目中流媒体分发的实际应用,提出了一种基于云计算的流媒体分发系统,主要利用云计算的分布式处理和CDN（Content Distributed Network）分发系统来使用户能够就近访问所需资源,在保证流媒体分发质量的同时提高分发速度,降低企业成本改善用户访问体验.本文主要阐述了面向新媒体广播的云CDN系统的总体框架和主要功能,具体介绍了借助于Hadoop实现的客户端测速技术以及基于用户访问行为的缓存策略.     

A distributed data clustering algorithm in P2P networks

Clustering is one of the important data mining issues, especially for large and distributed data analysis. Distributed computing environments such as Peer-to-Peer (P2P) networks involve separated/scattered data sources, distributed among the peers. According to unpredictable growth and dynamic nature of P2P networks, data of peers are constantly changing. Due to the high volume of computing and communications and privacy concerns, processing of these types of data should be applied in a distributed way and without central management. Today, most applications of P2P systems focus on unstructured P2P systems. In unstructured P2P networks, spreading gossip is a simple and efficient method of communication, which can adapt to dynamic conditions in these networks. Recently, some algorithms with different pros and cons have been proposed for data clustering in P2P networks. In this paper, by combining a novel method for extracting the representative data, a gossip-based protocol and a new centralized clustering method, a Gossip Based Distributed Clustering algorithm for P2P networks called GBDC-P2P is proposed. The GBDC-P2P algorithm is suitable for data clustering in unstructured P2P networks and it adapts to the dynamic conditions of these networks. In the GBDC-P2P algorithm, peers perform data clustering operation with a distributed approach only through communications with their neighbours. The GBDC-P2P does not need to rely on a central server and it performs asynchronously. Evaluation results demonstrate the superior performance of the GBDC-P2P algorithm. Also, a comparative analysis with other well-established methods illustrates the efficiency of the proposed method.     

Optimized P2P streaming for wireless distributed networks

The future Internet will support pervasive applications and communications models that require end-nodes cooperation, such as fog computing and machine-to-machine communications. Among the many applications, also video streaming can be provided with a cooperative and peer-to-peer approach. Cooperative distribution requires building a distribution overlay on top of the physical topology (the underlay). This work proposes an optimized, cross-layer approach to build this overlay minimizing the impact on the underlay. We design an optimal strategy, which is proven to be NP-complete, and thus not solvable with a distributed, lightweight protocol. The optimal strategy is relaxed exploiting the knowledge on the betweenness centrality of the nodes in the underlay topology, obtaining two easily implementable solutions applicable to any link-state protocol for distributed wireless mesh networks. The additional introduction of heuristic improvements further optimizes the performance in real network scenarios. Extensive simulation results support the theoretical findings using three different network topologies. They show that the relaxed implementations are reasonably close to the optimal solution, and provide vast gains compared to the traditional overlay topologies that peer-to-peer applications build.     

浅析基于C语言的文件处理

文件是计算机领域中一个重要的概念,用户的程序和数据都是以文件的形式保存的。文章简要介绍了C语言中与文件操作相关的各种常用函数,利用这些函数,程序员可以很方便地实现文件的创建、打开、关闭、读、写等诸多操作。     

无线上行视频流的跨层容错传输方法

如何通过资源受限的移动通信终端提升无线上行视频流的抗误性能是亟待解决的重要问题。通过不同通信层次的联合调度,提出了一种跨层容错传输方案。移动通信终端的网络层代理首先利用容错包调度为视频流的延时约束帧集合提供重要性分类,随后该终端的链路层代理利用无线链路单元的优先级调度实现选择性重传。在调度延时与传输带宽限制下,跨层容错传输能够将突发错误转移到延时约束帧集合的低优先级视频数据中,从而在突发易错传输环境中实现了无线链路单元粒度的渐进式传输和平稳退化。