Quality Control for Scalable Media Processing Applications

Many media processing applications create a load that varies significantly over time. Hence, if such an application is assigned a lower processing-time budget than needed in its worst-case load situation, deadline misses are likely to occur. This problem can be dealt with by designing media processing applications in a scalable fashion. A scalable media processing application can run in multiple qualities, leading to correspondingly different resource demands. The problem we consider is to find an accompanying quality control strategy, which minimizes both the number of deadline misses and the number of quality changes, while maximizing the quality of processing. We present an initial approach to the above problem by modeling it as a Markov decision process (MDP). Our model is based on measuring relative progress at milestones. Solving the MDP results in a quality control strategy that can be applied during runtime with only little overhead. We evaluate our approach by means of a practical example, which concerns a scalable MPEG-2 decoder.     

主动雷达终端实时仿真软件的设计与实现

在主动雷达数据回放显示的基础上,通过使用D irectDraw和Intel IPP技术,设计了主动雷达终端实时仿真软件,包括信号处理、数据处理及终端显示等模块,极大地提高了软件的执行效率,使得整个仿真过程具有良好的实时性。本文介绍了该软件的设计及实现。     

A Neural Network Approach for Signal Detection in Digital Communications

In this paper, we propose a new approach for signal detection in wireless digital communications based on the neural network with transient chaos and time-varying gain (NNTCTG), and give a concrete model of the signal detector after appropriate transformations and mappings. It is well known that the problem of the maximum likelihood signal detection can be described as a complex optimization problem that has so many local optima that conventional Hopfield-type neural networks fail to solve. By refraining from the serious local optima problem of Hopfield-type neural networks, the NNTCTG makes use of the time-varying parameters of the recurrent neural network to control the evolving behavior of the network so that the network undergoes the transition from chaotic behavior to gradient convergence. It has richer and more flexible dynamics rather than conventional neural networks only with point attractors, so that it can be expected to have much ability to search for globally optimal or near-optimal solutions. After going through a transiently inverse-bifurcation process, the NNTCTG can approach the global optimum or the neighborhood of global optimum of our problem. Simulation experiments have been performed to show the effectiveness and validation of the proposed neural network based method for the signal detection in digital communications.     

智能机理与软计算

随着计算机科学技术,特别是人工智能及其它相关学科的发展,关于人脑智能机理的研究引起越来越多的注意。与此同时、出现了关于软计算的研究.旨在研制出高机器智商系统(High Maehine Intelli-gene。Qt,,:sen:、产tom)[,〕。本文将初步探索智能机理与软计算两者间的关系以及把它们结合起来解决问题的可能性和途径。     

磁盘阵列校验信息的放置策略

廉价磁盘冗余阵列（ＲＡＩＤ）采用许多小的廉价磁盘来代替大容量昂贵的磁盘，以取得更高的性能和更低的功耗。本文介绍了ＲＡＩＤ－５级磁盘阵列中校验信息的八种不同的分布策略，即奇偶校验信息的放置策略，并从几个不同的应用情况对不同的放置策略进行了研究，结论是不同的奇偶校验信息放置策略对磁盘阵列的Ｉ／Ｏ读写性能有很大的影响。     

Transputer在高速雷达视频回波采集系统中的应用

介绍以ＴｒａｎｓｐｕｔｅｒＴ４２５单片高速并行计算机为中心控制环境，与高速Ａ／Ｄ（３５ＭＨｚ，８ｂｉｔ相结合构成的实时高速雷达回波采集系统。该系统的特点是：采集速度高，存贮量大；利用标准的Ｔｒａｎｓｐｕｔｅｒ链路实时完成处理器间的数据传输和通讯；系统采用并行Ｏｃｃａｍ语言编程。这样既充分发挥处理器的并行功能，又使数据采集和数据处理同步进行，这在实时信号采集与处理系统中具有特别重要的意义。     

关于后张预应力混凝土结构优化设计的几个问题

结合UP软件编程实践，本文对后张预应力混凝土结构计算程序中引入优化功能的意义进行了论述，提出了预应力筋与普通钢筋之间的最优搭配关系，优化原点概念及相关影响因素，列出了优化计算程序所应涉及的基本计算内容，并对当前后张预应力混凝土结构设计中的一些观点提出了不同意见。     

An Effective Software Pipelining Algorithm for Clustered Embedded VLIW Processors

This paper proposes a software pipelining framework, CALiBeR (ClusterAware Load Balancing Retiming Algorithm), suitable for compilers targetingclustered embedded VLIW processors. CALiBeR can be used by embedded systemdesigners to explore different code optimization alternatives, that is, high-qualitycustomized retiming solutions for desired throughput and program memory sizerequirements, while minimizing register pressure. An extensive set of experimentalresults is presented, demonstrating that our algorithm compares favorablywith one of the best state-of-the-art algorithms, achieving up to 50% improvementin performance and up to 47% improvement in register requirements. In orderto empirically assess the effectiveness of clustering for high ILP applications,additional experiments are presented contrasting the performance achievedby software pipelined kernels executing on clustered and on centralized machines.     

指针推进移动性管理策略中指针链长度的概率

为了降低移动通信网络中位置跟踪操作的代价,指针推进策略被提出.显然,指针链长度的确定对这一策略的有效应用是至为重要的.已有论文假定移动台在位置区的逗留时间服从指数分布的条件下,对指针链的长度进行研究,但指数分布的特殊性,限制了其研究结果的应用.本文推广了上述结果,研究了移动台在位置区的逗留时间服从一般概率分布的指针推进策略,通过构造向量马氏过程,利用密度演化方法,导出了指针链长度的概率公式,这个公式可用于对各种指针推进策略性能的评价.