会议电视系统及应用

为了组建一个完整的电视会议系统,在介绍了会议电视的定义、组成和几种组网方式之后,通过具体案例的方案设计,以解决在实际应用中组建会议电视系统会遇到的一些情况和如何组建的问题。     

A data access framework for service-oriented rich clients

Facilitated by the SOA and new Web technologies, Service-Oriented Rich Clients (SORCs) compose various Web-delivered services in Web browser to create new applications. The SORCs support client-side data storage and manipulation and provide more features than traditional thin clients. However, the SORCs might suffer from data access issues, mainly due to both client-side incompatible data sources and server-side improper or even undesirable cache strategies. Addressing the data access issues, this paper proposes a data access framework for SORCs. The main contributions of this paper are as follows. First, the framework makes the SORCs accommodate heterogeneous local storage solutions and diverse Web browsers properly. The framework abstracts the underlying details of different local storages and selects the most proper data sources for current SORC in use. Secondly, the framework provides a cache mechanism, which supports client-side customized cache strategies. An adaptive technique for the strategies is also proposed to adjust cache strategies based on users?? historical actions to achieve better performance.     

Towards an effective integration of cellular users to the structured Peer-to-Peer network

Integration of cellular users into the peer-to-peer (P2P) network is still in limbo due to limitations caused by heterogeneity, mobility and time-varying capacities of the wireless channel. If traditional Chord is employed to include users from the cellular networks, users under the same base station scatter in logical topology randomly. In this paper, we present a novel cellular Chord (C-Chord) P2P system that integrates the cellular users into the well-established structured P2P network in a topology-aware fashion. C-Chord offers the cellular users a choice of downloading contents either from the Internet peers at a faster rate or from other cellular users from the same base station avoiding the Internet data penalty. We also incorporate the peer selection module based on stable marriage problem that chooses the appropriate candidate from the discovered potential senders. We conduct extensive simulations to evaluate the performance of the proposed C-Chord P2P system and the peer selection module. Simulation results show that the path-length per lookup query is smaller than that of the traditional Chord system. Overhead due to renewal of routing information is also smaller for the cellular users in the C-Chord system. We also measure the throughput at the cellular receivers to analyze the effects of selecting peers either from same base station or from outside the Internet gateway. Throughput also increases dramatically due to an intelligent selection of peers among the potential senders.     

An efficient search mechanism for supporting partial filename queries in structured peer-to-peer overlay

Accompanying the growth of the Internet, computers throughout the world can connect to each other and exchange information, increasing the convenience and efficiency of information-based work. The advent of data-sharing applications, such as Napster and Gnutella, has made peer-to-peer (P2P) systems popular for widespread exchange of resources and voluminous information between millions of users. In recent years, research issues associated with P2P systems have been discussed widely. To resolve the file-availability problem and improve the workload, a method called the Distributed Hash Table (DHT) has been proposed. However, DHT-based systems in structured architectures cannot support efficient queries, such as a similarity query, range query, and partial-match query, due to the characteristics of the hash function. This study presents a novel scheme that supports filename partial-matches in structured P2P systems. The proposed approach supports complex queries and guarantees result quality. Experimental results demonstrate the effectiveness of the proposed approach.     

CloudRank-D: benchmarking and ranking cloud computing systems for data processing applications

With the explosive growth of information, more and more organizations are deploying private cloud systems or renting public cloud systems to process big data. However, there is no existing benchmark suite for evaluating cloud performance on the whole system level. To the best of our knowledge, this paper proposes the first benchmark suite CloudRank-D to benchmark and rank cloud computing systems that are shared for running big data applications. We analyze the limitations of previous metrics, e.g., floating point operations, for evaluating a cloud computing system, and propose two simple metrics: data processed per second and data processed per Joule as two complementary metrics for evaluating cloud computing systems. We detail the design of CloudRank-D that considers representative applications, diversity of data characteristics, and dynamic behaviors of both applications and system software platforms. Through experiments, we demonstrate the advantages of our proposed metrics. In several case studies, we evaluate two small-scale deployments of cloud computing systems using CloudRank-D.     

边界对齐的平滑三维对称标架场

为了把广泛应用于网格四边形化和纹理合成的二维表面标架场拓展到三维,提出一种生成三维对称标架场的方法.不同于表面对称标架场(四对称方向场),二维标架场的对称性能用一个切平面的旋转角度来表示,而三维对称标架场的对称性却不能这样简单地表示.为了解决这个问题,利用球面函数来获得一个对称性表述,该表述对于绕任意一个轴的π/2旋转以及它们的复合是不变的.基于球面函数的表示可以获得一个有效的标架场光顺程度的度量,并以球面调和分析进行加速计算;基于一组边界约束,可以通过极小化这个度量函数来获得一个光顺的标架场,该标架场在表面上能很好地对齐法线.最后通过表面投影、流线追踪和奇异点来可视化这个标架场,并将这个光顺的标架场用于六面体网格生成,且讨论了它在生成高质量纯六面体网格方面的潜力,其与表面标架场在生成四边形网格方面的潜力是一致的.     

基于网络图像的阿奇姆博多拼图

拼图是使用不同形式的素材进行组装的合成艺术.文中介绍了一种崭新的拼图创作方法,通过挑选主题相关的网络图像的前景抠图来表现一幅输入图像,能够生成奇异的具有阿奇姆博多风格的拼图.鉴于网络图像数据的海量规模,总能够找到合适的前景抠图来匹配输入图像的各个分割部分;通过将挑选的前景抠图按照一定的规则进行组装,使其在整体上可以从形状和颜色表现输入图像,而在局部每个前景抠图仍然可以辨识.实验结果和用户体验表明,采用文中方法可以有效地生成具有娱乐性的阿奇姆博多拼图.     

城市建筑点云的自适应分割方法

自动地提取城市建筑点云数据中的高层次结构是城市数字化等应用的重要基础步骤.通过提出"自适应分割"的概念来自动地获取三维城市建筑点云的一种灵活、层次化的结构表示.由于城市建筑的单元分布大都呈一种级联或者交错的形式,与之前采用全局规则格点进行分析的方法不同,文中采用一种自适应的方法对建筑点云进行分析;也可将自适应分割的概念用于建筑图像的分析上.最后给出了在不同类型的建筑点云和图像进行分析的结果以及一些相关的应用.     

基于AROP程序包的类Landsat遥感影像配准与正射纠正试验和精度分析

遥感影像的精确配准和正射纠正是进行图像融合、变化检测、图像镶嵌、定量遥感建模、多时相和多传感器影像协同应用的基础和前提。以美国国家航空和航天管理局下设LEDAPS(Landsat Ecosystem Disturbance Adaptive Processing System)课题组开发的配准与正射纠正程序包AROP(Automated Registration and Orthorectification Package)为例,详细阐述了其配准的原理与程序设计流程,并对其配准的精度进行了分析和评价。试验表明:AROP程序包算法能够找出足够的控制点,且控制点分布较为均匀,配准误差小于0.5个像元。误差特征表现为:扫描误差明显大于航向误差,误差的结果与影像漂移、DEM、坡度存在一定的相关性,高程和坡度是影响配准精度的主要因素之一。该程序包目前能够用于对我国CBERS影像的正射校正以及波段不匹配处理,但是对HJ卫星CCD影像数据配准还有待于进一步研究。