公共广播在智能建筑中应用的探讨

公共广播在智能建筑的应用已经越来越广泛,然而在系统的设计方面还存在着一些问题,如何合理设计公共广播系统已成为智能建筑中的一个重要内容。本文根据建设工程中公共广播系统设计中的一些问题作一些探讨,并提出一些合理的解决方案。     

大容量广电网的P圈启发式算法研究

结合广电网大容量的发展要求,考虑较为复杂的网状网结构,网络生存性问题日益凸显。对经典的预置圈(P圈)容量算法进行了改进,并选用COST239网络拓扑对改进算法进行编程仿真。结果证明,改进算法在减少预置圈数量的同时能够提高资源利用率,性能有所提高,可以较好地解决广电网的生存性问题。     

含山台两个频道播控系统数字化改造方案

全面介绍了含山广播电视台两个频道播控系统数字化改造方案。从播控系统数字化改造的必要性入手,详细阐述了含山台改造后的数字化播控系统的结构与组成,同时深入浅出地分析了播控系统的整体技术架构、核心设备的备份措施以及局域网中播控部分的安全应急措施、技术特点和改造中应注意的问题。     

OR-parallel execution of Prolog on a multi-sequential machine

Based on extending the sequential execution model of Prolog to include parallel execution, we present a method for OR-parallel execution of Prolog on a multiprocessor system. The method reduces the overhead incurred by parallel processing. It allows many processing elements (PEs) to process simultaneously a common branch of a search tree, and each of these PEs creates its local environment and selects a subtree for processing without communication. The run-time overhead is small: simple and efficient operations for selecting the proper subtree. Communication is necessary only when some PEs have exhausted their search spaces and there are others still searching for solutions. The method is able to utilize most of the technology devised for sequential implementation of Prolog. It is optimized for an architecture that supports broadcast copying.     

地震属性分析及其在岩性油气藏勘探中的应用

在岩性油气藏勘探中,由于地震属性的实际运用使得地震信息的充分利用成为可能,而地震属性分析是岩性油气藏研究过程中地震属性运用的关键。指出新型的地震属性分析方法一改以往的手工、目测分析方法,充分利用了二维、三维及多维交汇方法,为属性分选、分析提供了便利的操作手段;新型的地震属性方法还运用科学分类方法,综合地震、测井、地质信息,把剖面、平面及分类结果结合到一起,通过三维一体的相互信息映射,在储层预测中的目标初选及目标分析中起到了举足轻重的作用,真正做到了属性分析的科学性、实用性。     

Scalable public-key tracing and revoking

Traitor tracing schemes constitute a useful tool against piracy in the context of digital content distribution. They are encryption schemes that can be employed by content providers that wish to deliver content to an exclusive set of users. Each user holds a decryption key that is fingerprinted and bound to his identity. When a pirate decoder is discovered, it is possible to trace the identities of the users that contributed to its construction. In most settings, both the user population and the set of content providers are dynamic, thus scalable user management and scalable provider management are crucial. Previous work on public-key traitor tracing did not address the dynamic scenario thoroughly: no efficient scalable public-key traitor tracing scheme has been proposed, in which the populations of providers and users can change dynamically over time without incurring substantial penalty in terms of system performance and management complexity. To address these issues, we introduce a formal model for Scalable Public-Key Traitor Tracing, and present the first construction of such a scheme. Our model mandates for deterministic traitor tracing and unlimited number of efficient provider and user management operations. We present a formal adversarial model for our system and we prove our construction secure, against both adversaries that attempt to cheat the provider and user management mechanism, and adversaries that attempt to cheat the traitor tracing mechanism.Received: 28 August 2003, Accepted: 13 October 2004, Published online: 13 January 2005     

一个支持高性能广播通信的算法设计与实现

开放分布式处理要求分布工系统提供高性能的广播通信手段，以支持网络环境下对象间的合作和数据传输。本文分析了ＴＣＰ／ＩＰ协议族中传输层协议对上述目标支持的局限性，提出一个Ｃｈｅｃｋ报文控制算法，实现了可靠的快速的广播通信机制，获得了较好的性能。对象     

Distributed selectsort sorting algorithms on broadcast communication networks

In this paper, a distributed selectsort algorithm and a parameterized selectsort algorithm are presented to be applied on distributed systems for cases when N P where N is the number of elements to be sorted and P is the number of processors in the system. The distributed system considered in this paper uses a broadcasting channel for communication between processors. We show that the number of messages required for the parameterized selectsort algorithm is independent of N and is of complexity O(P), which is optimal in a distributed system with P processors. Furthermore, the amount of communication required in terms of elements is N + O(P³) and the computation time complexity is O((N/P)lgN + P²lg(N/P)). Hence, when N P³, the computation time complexity is O((N/P)lgN), which is optimal using P processors. In addition, this parameterized algorithm provides us with a parameter K such that by choosing the value of K allows us to trade among processing requirement, memory requirement, and communication requirement. It is shown that this parameterized algorithm can reduce the communication requirements significantly while only slightly increasing the computation requirements.     

小型高清卫星直播车的设计与调试

首先介绍了小型高清卫星直播车的设计思路,接着介绍卫星、视音频、通话、电源等系统的功能及组成,最后重点介绍了各系统中设备选型基本要求,绘制各分系统内设备的信号关系框图,并对各系统安装调试做了较详细的阐述.深化了对卫星转播车的认识,也为今后设计类似系统和进行实践教学积累了经验.