基于ATM的网络互连方式

ＡＴＭ技术能否在数据通信网中广泛采用取决于其是否能高效地支持现有业务，其中主要为非连接业务。本文介绍了几种基于ＡＴＭ 的非连接业务支持方式和协议体系结构，对其进行了评述并对ＩＰ分组到ＡＴＭ信元的封装效率进行了分析。     

单小区模型的掉话率分析

掉话率是无线通信网络中最重要的关键性能指标(KPI)之一,本文分析了中国移动在讨论网络性能评估方法时提出的3个不同的掉话率计算公式,通过建立一个单小区的模型,使用一些合理的假设和分析,从理论上确定了一个最为准确的计算公式.     

巧用心理暗示提升高校图书馆服务质量

心理暗示是用含蓄、间接的方法,在无对抗的条件下,对人的心理和行为产生影响的过程。在高校图书馆的读者服务工作中,馆员们若能遵循目的性、权威性等原则,灵活掌握和运用言语暗示、行为暗示、环境暗示等方法,就能更好地利用心理暗示的积极作用,提升服务质量。     

美国食品安全管理法规与举措

以美国国会研究服务部对第107届国会就食品安全方面的一份报告为基础,主要对美国的公共健康问题现状、美国食品安全的联邦规范框架组成、美国食品安全控制最新进展和国会对食品安全提出的新议题做了综述,对我国的食品安全控制和管理体系的建设发挥一点借鉴作用。     

基于数字CATV的超宽带技术研究

如何利用现有的数字CATV系统开展各种增值业务已成为一个重要课题.首先简要介绍了数字CATV和超宽带技术,然后给出了两种超宽带技术在现有数字CATV系统中的应用方案,利用这些方案可以有效地开展各项增值业务.     

《无线电频率划分规定》学习心得

主要介绍学习新的《无线电频率划分规定》的目的，《无线电频率划分规定》的特点，作了哪些重要修改和划分表的主要内容及如何贯彻执行《无线电频率划分规定》。     

论社区服务产业化

社区经济作为一种优化的资源配置方式，利用社区服务为载体，将社区内互不相联的各种经济成份变为利益共同体，建立一种新的经济生产方式，从而带动社区乃至更广区域的经济发展。     

An accurate and practical buffer allocation model for the buffer cache based on marginal gains

A new dynamic buffer allocation strategy based on the notion of marginal gains is presented for the buffer cache that is used by the operating system to store frequently accessed disk blocks in main memory, and the performance of the proposed strategy is compared with those of previous allocation strategies. In the proposed strategy, marginal gain values are predicted by exploiting functions that approximate the expected number of buffer hits per unit time. Experimental results from both trace-driven simulation and an actual implementation in the FreeBSD operating system show that the proposed strategy accurately predicts the marginal gain values for various workloads resulting in significantly improved buffer hit ratios.     

电厂热力系统耗差分析系统实现的研究与发展

总结了电厂热力系统耗差分析几种实现方式，回顾了国内在该领域的发展过程。电厂热力系统耗差分析实现方式分别经历了独立的耗差分析系统、基于DCS的耗差分析系统、基于MIS的耗差分析系统。并在不同的分析方式上进行了评价，指出了耗差分析系统的发展方向。     

Proactive resource allocation for asynchronous real-time distributed systems in the presence of processor failures

We present two proactive resource allocation algorithms, RBA^*-FT and OBA-FT, for fault-tolerant asynchronous real-time distributed systems. The algorithms consider an application model where task timeliness is specified by Jensen's benefit functions and the anticipated application workload during future time intervals is described by adaptation functions. In addition, we assume that reliability functions of processors are available a priori. Given these models, our objective is to maximize aggregate task benefit and minimize aggregate missed deadline ratio in the presence of processor failures. Since determining the optimal solution is computationally intractable, the algorithms heuristically compute sub-optimal resource allocations, but in polynomial time. Experimental results reveal that RBA^*-FT and OBA-FT outperform their non-fault-tolerant counterparts in the presence of processor failures. Furthermore, RBA^*-FT performs better than OBA-FT, although OBA-FT incurs better worst-case and amortized computational costs. Finally, we observe that both algorithms robustly withstand errors in the estimation of anticipated failures.