Response Time Analysis in a Data Broadcast System with User Cache

Data broadcast has been considered a promising way of information dissemination to a massive number of users in a wireless communication environment. Reducing user-waiting time is a major problem in developing a data broadcast system. There are two approaches for this problem; One is to design a broadcast schedule at the server side which reduces the mean response time, and the other is to utilize a local cache at the user side which may respond to a user request instantly. Though these two approaches were addressed separately in the literature, they may be taken jointly for better performance. The performance of system with joint approach depends on several factors such as broadcast schedule, cache size, cache management strategy, etc. In this paper we analyze response time in a data broadcast system with joint approach in which information items are structurally related with each other as in WWW. Based on the worst-case assumption, we derive a lower bound on the system performance for a given set of broadcast schedule, cache size, and cache management strategy. This result will be of help for designing and developing a data broadcast system. We support our analysis by carrying out an extensive simulation on some interesting proposed broadcast schedules and cache management strategies.     

High Performance Data Broadcasting Systems

Data broadcasting as a means of efficient data dissemination is a key technology facilitating ubiquitous computing. For this reason, broadcast scheduling algorithms have received a lot of attention. However, all existing algorithms make the core assumption that the data items to be broadcast are immediately available in the transmitter's queue, ignoring the key role that the disk subsystem and the cache management play in the overall broadcast system performance. With this paper we contribute a comprehensive system's perspective towards the development of high performance broadcast systems, taking into account how broadcast scheduling, disk scheduling, and cache management algorithms affect the overall performance. We contribute novel techniques that ensure an efficient interplay between broadcast scheduling, cache management, and disk scheduling. We study comprehensively the performance of the broadcast server, as it consists of the broadcast scheduling, the disk scheduling, the cache management algorithms, and the transmitter. Our results show that the contributed algorithms yield considerably higher performance. Furthermore, one of our algorithms is shown to enjoy considerably higher performance, under all values of the problem and system parameters. A key contribution is the result that broadcast scheduling algorithms have only a small effect on the overall system performance, which necessitates the definition of different focal points for efforts towards high performance data broadcasting.     

Broadcast Data Allocation for Efficient Access of Multiple Data Items in Mobile Environments

The issue of data broadcast has received much attention in mobile computing. A periodic broadcast of frequently requested data can reduce the workload of the up-link channel and facilitate data access for the mobile user. Many approaches have been proposed to schedule data items for broadcasting. However, the issues of accessing multiple data items on the broadcast channel are less discussed. Two problems are discussed in this paper, that is, deciding the content of the broadcast channel based on the queries from the clients, and scheduling the data items to be broadcast. We will show that these two problems are NP-complete. Different heuristics to these problems are presented and compared through performance evaluations.     

基于卫星数据广播的农村信息频道实现

介绍了卫星数据广播频道需求分析方法,在农村信息需求分析基础上,并对页面、内容分类、频道内容进行设计,利用资源规范对资源进行内容包装及元数据设计,实现了信息频道实用性、时效性、标准化和引导性等特点。     

DVB数据广播系统中数据轮播技术及其应用

简要介绍DVB数据广播标准中数据的几种封装和传输方式，阐述了DVB中数据轮播技术的原理以及数据轮播的封装和传输是如何实现的，最后对数据轮播的应用进行了叙述和展望。     

最小方差无失真响应波束形成解卷积后处理算法

为提高最小方差无失真响应(Minimum Variance Distortionless Response,MVDR)波束形成算法的方位分辨能力,本文将MVDR算法的输出功率谱重新建模为卷积的形式,并运用两种解卷积技术对MVDR的方位谱进行后处理.该算法将角度空间中心位置的单个声源的MVDR方位谱当作点扩散函数(Poi...     

低信噪比下的LMS自适应无偏时延估计

 比较性研究了最小均方(LMS)时延估计器中有偏与无偏估计算法的时延估计性能,并基于Treichler的γ-LMS 算法提出了一种改进的无偏估计方法.利用自适应滤波器中最佳逼近原理的几何解释来估计输入噪声的功率,迭代过程中逐步去除输入噪声的影响,使得最优维纳解的真实峰值得到增强,在低信噪比或复杂噪声环境下显著改善了自适应时延估计性能.该方法无需假设输入与输出噪声功率相等或功率比已知、有用信号应为白过程等限制条件,因此具有广泛的应用价值.仿真与实际数据处理都验证了该方法的有效性.     

基于松弛时间与累计发送量的数据中心网络混合流调度机制

数据中心网络中同时存在截止时间流（deadline flow）和非截止时间流（non-deadline flow）,为降低非截止时间流的平均完成时间（Average Flow Complete Time,AFCT）同时维持低截止时间错失率（Deadline Miss Rate,DMR）,本文提出了一种基于松弛时间与累计发送量的混合流调度机制（Slack Time and Accumulation based Mix-flow Scheduling,STAM）.首先通过引入松弛时间的概念,衡量截止时间流对非截止时间流在传输时延上的宽容度;然后根据松弛时间,通过使截止时间流尽可能接近其规定截止时间完成,降低非截止时间流的完成时间;最后,利用最小累计发送量优先策略进一步降低非截止时间流的平均完成时间.仿真结果表明,该机制能有效降低非截止时间流的平均完成时间,同时保证较低的截止时间错失率.     

大跨度天基数据链的TDD时隙调度分析与优化

针对天基数据链系统卫星间的传播时延较大且节点间距离变化较大等特点，提出了一种提高时频资源利用率、提升系统容量、减小时延的方法。在时分多址与空分多址相结合的接入方式下，进行了时隙调度的分析与优化，利用卫星星座的空间复用与大跨度传播时延特性，采用时隙编排、收发状态调整、帧格式优化等手段，将信道利用率和系统容量提升了1倍，将卫星节点在某一方向获得服务的平均等待时间缩短为原来的1/4，提高了天基数据链系统的服务质量。     

Web应用中缩短Web响应时间的技术研究

缩短Web访问中的用户感知时间,提高网站性能是Web应用程序开发中一个极为重要的问题。从软件处理数据的角度出发,针对Web应用程序的特点,从优化数据访问以及Web数据显示2个方面分别讨论如何缩短Web数据响应时间,以达到缩短用户感知时间的方法。并利用ACT测试工具对进行测试,并给出了这些方法的实际应用测试数据。验证本文所提出的方法能极大地优化Web应用程序的应用,有效地缩短用户的感知时间。     

Update Propagation Algorithms for Supporting Disconnected Write in Mobile Wireless Systems with Data Broadcasting Capability

We develop and analyze algorithms for propagating updates by mobile hosts in wireless client–server environments that support disconnected write operations, with the goal of minimizing the tuning time for update propagation to the server. These algorithms allow a mobile host to update cached data objects while disconnected and propagate the updates to the server upon reconnection for conflict resolutions. We investigate two algorithms applicable to mobile systems in which invalidation reports/data can be broadcast to mobile hosts periodically. We show that there exists an optimal broadcasting period under which the tuning time is minimized for update propagations. We perform a comparative analysis between these two update propagation algorithms that rely on broadcasting data and an algorithm that does not, and identify conditions under which an algorithm should be applied to reduce the total tuning time for update propagation by the mobile user to save the valuable battery power and avoid high communication cost. For real-time applications, we address the tradeoff between tuning time and access time with the goal to select the best update propagation algorithm that can minimize the tuning time while satisfying the imposed real-time deadline constraint. The analysis result is applicable to file/data objects that mobile users may need to modify while on the move. Ing-Ray Chen received the BS degree from the National Taiwan University, Taipei, Taiwan, and the MS and PhD degrees in computer science from the University of Houston. He is currently an associate professor in the Department of Computer Science at Virginia Tech. His research interests include mobile computing, pervasive computing, multimedia, distributed systems, real-time intelligent systems, and reliability and performance analysis. Dr. Chen has served on the program committee of numerous conferences, including as program chair for 29th IEEE Annual International Computer Software and Application Conference in 2005, 14th IEEE International Conference on Tools with Artificial Intelligence in 2002, and 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology in 2000. Dr. Chen currently serves as an Associate Editor for IEEE Transactions on Knowledge and Data Engineering, The Computer Journal, and International Journal on Artificial Intelligence Tools. He is a member of the IEEE/CS and ACM. Ngoc Anh Phan received her Bachelor of Science degree from Moscow Technical University of Communication and Computer Science in 1997, and a Master of Science degree in Computer Science from Virginia Polytechnic Institute and State University (Virginia Tech) in 1999. She is currently a Ph.D student at Virginia Tech and a Senior Software Engineer at America Online Inc. Her research interests include wireless communications, data management, sensor networks, fault tolerance, and mobile computing. I-Ling Yen received her BS degree from Tsing-Hua University, Taiwan, and her MS and PhD degrees in Computer Science from the University of Houston. She is currently an Associate Professor of Computer Science at the University of Texas at Dallas. Dr. Yen's research interests are in distributed systems, fault-tolerant computing, self-stabilization algorithms, and security. She has served as program co-chair for the 1997 IEEE High Assurance Systems Engineering Workshop, the 1999 IEEE Symposium on Application-Specific Systems and Software Engineering Technology, and the 1999 Annual IEEE International Conference on Computer Software and Applications Conference. Dr. Yen is a member of the IEEE/CS.     

超导红外辐射探测器瞬态响应的时域模拟计算及测量

本文试图在时域利用红外辐射探测器对不同脉宽的探测光脉冲的响应来模拟计算及测量其对不同的相对脉宽的瞬态输出,从所得到输入信号的对脉宽与输出瞬态响应幅度的关系,计算并测出探测器的响应时间,解决了在频域里对光电快速响应探测器频率测量难的问题。     

光纤化的飞机内部时分制指令/响应式多路传输数据总线标准(供讨论稿)

本文是对“光纤化的飞机内部时分制指令/响应式多路传输数据总线”标准的建议,是根据MIL-STD-1553B及1773文本拟订的。     

外磁路涡流对铁氧体开关响应时间的影响

从开关电路和响应磁场2个方面对涡流的影响进行了研究.以激励线圈等效阻抗的变化,得出涡流效应对外磁路开关电路响应时间的影响;在响应磁场方面,以典型模的方式,应用安培定律、楞次定律、电磁感应方程,以数学推导得出典型模涡流对响应磁场的影响,以此得出涡流对外磁路开关响应时间的影响因素及其量级大小.通过具体产品的设计验证,证明了结论的正确.     

新媒体语境下播音主持专业的应对思考

进入信息时代之后,各种新媒体应运而生,与传统媒体相比,新媒体在信息传播上有着得天独厚的优势,为了实现信息资源的优化配置及利用,许多播音主持专业开始重新调整教学管理思路,着眼于新媒体语境之下的传播方向变革要求来实现专业教学的有效改革以及创新,以此来提升专业教学质量及水平,为社会培养出更多优秀的播音主持专业人才。从宏观角度将理论分析与实践研究融为一体,对新媒体语境之下的播音主持专业的应对策略进行相应分析及研究。     

基于蚁群优化的时间Petri网及其在柔性制造系统调度优化中的应用

Petri网的优化调度求解主要采用基于状态空间的智能搜索方法,执行效率往往不高.提出基于蚁群优化的时间Petri网,通过在Petri网的变迁和进化规则中引入蚁群优化机制,改变Petri网原有的非确定性选择行为,使之具备蚁群寻优选择智能行为,克服了需要基于状态空间进行启发式搜索的缺陷,提高了调度优化的计算效率.最后应用蚁群优化时间Petri网模型,对柔性制造系统的区间Job Shop调度问题进行建模和优化求解.实验结果进一步验证了所提模型和方法的有效性.     

Entanglement in Smart Hydrogels: Fast Response Time,Anti-Freezing and Anti-Drying

The common techniques to improve hydrogel's mechanical properties include increasing crosslinking density and forming crosslinked double-network hydrogel, which may cause some hydrogels to lose their smart functionalities. Inspired by entanglement-induced strengthening, a simple approach to introducing hydroxypropyl cellulose (HPC) fibers entangled with different smart hydrogel matrix systems are reported. Different from the conventional methods which hinder the movement of the polymer network, through entanglement with HPC fibers, the composite hydrogel shows both improved Young's modulus and toughness and more importantly improved smart functionalities including response speed, anti-drying, and anti-freezing capabilities and cycle stability. This strategy provides a new design rule to fabricate durable and strengthened smart hydrogels which can be used in smart windows, sensors, and soft robots.     

Data Service: Characteristics, Market Structure, and the Role of Operator

1　Introduction　Since the development of telecommunication technologymake the operator able to offer data service to subscribers inthe mid 1990s, operators of various countries have madeenormous efforts to develop data service. Currently, the ar gument on 3G ( 3rd Generation, International MobileTelecommunications 2000) focuses on how to find, develop,and popularize application services in data service markettoo. Some researchers propose that even NTT DoCoMo can n…     

QoS guarantee in telecommunication networks: technologies and solutions

The aim of this paper is to show the effect of the presence of specific management functions within a network that offers quality of service (QoS). The objective is not privileging a particular technology but to highlight the importance to know which control functions a solution may use, which performance limits the functions have and what can be a realistic user expectation. The paper focuses on the meaning of QoS and on the applications requiring quality, then describes QoS solutions including transport technologies, QoS‐oriented technologies, parameters and management functions. In more detail, the effect on QoS provision of the following issues is investigated and discussed concerning the possibility (or not) to aggregate and differentiate traffic, the implementation of call admission control and of traffic filtering to limit flows to their committed rates. Again, the conclusions should not be considered a merit mark about technology, but only an investigation about: what users and customers should expect by the technologies using specific control functions evidencing that the real limitations are not imposed by a specific technology, whose features may be changed and extended, but by the application of control functions that can guarantee requirements' matching. Copyright © 2004 John Wiley & Sons, Ltd.