Hierarchical models for analysis and recognition of handwritten characters

Different hierarchical models in pattern analysis and recognition are proposed, based on occurrence probability of patterns. As an important application of recognizing handprinted characters, three typical kinds of hierarchical models such asM _89-89,M _89-36 andM _36-36 have been presented, accompanied by the computer algorithms for computing recognition rates of pattern parts. Moreover, a comparative study of their recognition rates has been conducted theoretically; and numerical experiments have been carried out to verify the analytical conclusions made. Various hierarchical models deliberated in this paper can provide users more or better choices of pattern models in practical application, and lead to a uniform computational scheme (or code). The recognition rates of parts can be improved remarkably by a suitable hierarchical model. For the modelM _89-36 in which case some of the Canadian standard handprinted characters have multiple occurrence probabilities, the total mean recognition rates of the given sample may reach 120% of that by the model proposed by Li et al., and 156% of that obtained from the subjective experiments reported by Suen.     

On loop transformations for generalized cycle shrinking

This paper describes several loop transformation techniques for extracting parallelism from nested loop structures. Nested loops can then be scheduled to run in parallel so that execution time is minimized. One technique is called selective cycle shrinking, and the other is called true dependence cycle shrinking. It is shown how selective shrinking is related to linear scheduling of nested loops and how true dependence shrinking is related to conflict-free mappings of higher dimensional algorithms into lower dimensional processor arrays. Methods are proposed in this paper to find the selective and true dependence shrinkings with minimum total execution time by applying the techniques of finding optimal linear schedules and optimal and conflict-free mappings proposed by W. Shang and A.B. Fortes     

The fault-tolerant extension problem for complete multipartitenetworks

We develop a characterization for m-fault-tolerant extensions, and for optimal m-fault-tolerant extensions, of a complete multipartite graph. Our formulation shows that this problem is equivalent to an interesting combinatorial problem on the partitioning of integers. This characterization leads to a new procedure for constructing an optimal m-fault-tolerant extension of any complete multipartite graph, for any m⩾0. The proposed procedure is mainly useful when the size of the graph is relatively small, because the search time required is exponential. This exponential search, however, is not always necessary. We prove several necessary conditions that help us, in several cases, to identify some optimal m-fault-tolerant extensions without performing any search     

Bezier曲线树

本文提出Ｂｅｚｉｅｒ样条曲线树结构用以高效地实现对曲边几何体的各种几何运算。对任意一条Ｂｅｚｉｅｒ样条曲线，用ｄｅＣａｓｔｅｌｊａｕ算法进行分割后，将分割结果用一平衡二叉树来存储。此后，对于该曲线所作的各种几何运算可以一种逼近等级的方式来进行。先以粗糙的逼近来进行计算，必要时增加精密度，从而提高各种运算的效率。     

程序可视化系统ProVS的设计和实现

本文研究程序代码可视化技术，即从现存的程序生成某种可视化表示，增强程序的易读性、易理解性和易维护性。首先介绍ＰｒｏＶＳ的设计思想和实现技术，然后给出输出例子。     

韩江三角洲海岸变迁遥感调查研究

利用1:10万TM影像，对广东东部韩江三角洲地区的海岸变迁及河道演变进行了调查研究。划分了不同时期的海岸界线和古河道遗迹，提出韩江三角洲的形成是河流动力和海洋动力共同作用的结果，对研究历史海平面变化及环境演变具重要意义。     

利用TM资料测量毛乌素沙地面积的方法和结果

利用1:25万陆地卫星TM资料和地形图，在GIS支持下，建立毛乌素沙地图形数据库，对毛乌素沙地目前流沙分布的范围进行了调查研究。重.资、介绍了利用陆地卫星TM资料对毛乌素沙地的面积进行测童计算的技术和方法，给出了最新测贡得到的毛乌素沙地全区总面积和分布于各旗县的沙地面积数据。     

冲击能传感器的研究与分析

本文分析并推导了应力波在弹性体中传播时,质点的运动速度、压力、位移及应力载波的聚流的形成与表达式.利用得到的公式描述了冲击能传感器的工作机理.给出了某风动工具的测试结果.     

DRB32在提高异种机互连传输中的应用

字结构不同的计算机互连，以往用软件转换字结构，增加了软件开销，导致传输效率降低。现介绍一种用硬件逻辑转换的方案，在数据传送过程中，使一台计算机的数据结构适应另一台计算机的要求。简捷、可靠、快速，大大地提高了异种机互连的传输率。     

Neural network control of communications systems

Neural networks appear well suited to applications in the control of communications systems for two reasons: adaptivity and high speed. This paper describes application of neural networks to two problems, admission control and switch control, which exploit the adaptivity and speed property, respectively. The admission control problem is the selective admission of a set of calls from a number of inhomogeneous call classes, which may have widely differing characteristics as to their rate and variability of traffic, onto a network. It is usually unknown in advance which combinations of calls can be simultaneously accepted so as to ensure satisfactory performance. The approach adopted is that key network performance parameters are observed while carrying various combinations of calls, and their relationship is learned by a neural network structure. The network model chosen has the ability to interpolate or extrapolate from the past results and the ability to adapt to new and changing conditions. The switch control problem is the service policy used by a switch controller in transmitting packets. In a crossbar switch with input queueing, significant loss of throughput can occur when head-of-line service order is employed. A solution can be based on an algorithm which maximizes throughput. However since this solution is typically required in less than one microsecond, software implementation policy is infeasible. We will carry out an analysis of the benefits of such a policy, describe some existing proposed schemes for its implementation, and propose a further scheme that provides this submicrosecond optimization.