A fast digital Radon transform—An efficient means for evaluating the Hough transform

A fast digital Radon transform based on recursively defined digital straight lines is described, which has the sequential complexity of N² log N additions for an N × N image. This transform can be used to evaluate the Hough transform to detect straight lines in a digital image. Whilst a parallel implementation of the Hough transform algorithm is difficult because of global memory access requirements, the fast digital Radon transform is vectorizable and therefore well suited for parallel computation. The structure of the fast algorithm is shown to be quite similar to the FFT algorithm for decimation in frequency. It is demonstrated that even for sequential computation the fast Radon transform is an attractive alternative to the classical Hough transform algorithm.     

An exploration of expertise of knowledge workers: towards a definition of the universe of discourse for knowledge acquisition

Abstract. Knowledge systems development and use have been significantly encumbered by the difficulties of eliciting and formalizing the expertise upon which knowledge workers rely. This paper approaches the problem from an examination of the knowledge competencies of knowledge workers in order to define a universe of discourse for knowledge elicitation. It outlines two categories and several types of knowledge that could serve as the foundations for the development of a theory of expertise.     

电梯交通系统(Ⅰ)──电梯交通配置现状及发展

本文对国内外电梯交通配置设计现状及发展趋势作了论述。指出了由统计特性描述进入到采用专家系统和模糊规则的动态特性描述这一总的发展趋势。     

On-Line File Caching

Abstract. Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost , maintain a cache of files of total size at most some specified k so as to minimize the total retrieval cost. Specifically, when a requested file is not in the cache, bring it into the cache and pay the retrieval cost, and remove other files from the cache so that the total size of files remaining in the cache is at most k . This problem generalizes previous paging and caching problems by allowing objects of arbitrary size and cost, both important attributes when caching files for world-wide-web browsers, servers, and proxies. We give a simple deterministic on-line algorithm that generalizes many well-known paging and weighted-caching strategies, including least-recently-used, first-in-first-out, flush-when-full, and the balance algorithm. On any request sequence, the total cost incurred by the algorithm is at most k/(k-h+1) times the minimum possible using a cache of size h ≤ k . For any algorithm satisfying the latter bound, we show it is also the case that for most choices of k , the retrieval cost is either insignificant or at most a constant (independent of k ) times the optimum. This helps explain why competitive ratios of many on-line paging algorithms have been typically observed to be constant in practice.     

神经网络在电路诊断中的应用

目的：阐述了目前电路基于数据库技术和人工智能专家系统及神经网络原理的故障诊断系统。方法：将所记录的模糊症状输入到系统中，通过模糊运算后，运用神经网络学习算法来寻找故障类型。结果：介绍了人工神经网络技术在电路诊断中的应用，并给出系统故障诊断软件的设计，结论：所用专家系统和神经网络相结合的方法改进电子电路故障诊断是可行的。     

水电厂设备故障诊断系统实时数据库的一种简捷实现

实时数据库及时准确地从现场获取数据并有效地组织和管理，是水电厂 设备故障诊断系统进行故障诊断的首要条件。文中在分析了现有的实时数据库实现方法后， 用C++ Builder 5.0和SQL Server 7.0完成了实时数 据库实现的一种简洁方法，它不但能够满足工程需要，而且具有关系数据库所具有的一切强 大的数据库管理和维护功能，实现也很简单，极大地节省了实时数据库开发的人力和物力。 实验表明，该方法是可行的。     

Dynamic Studies On Human Body Sway By Using A Simple Model With Special Concerns On The Pelvic And Muscle Roles

The human pelvis is such a unique structure that enables our upper body to work so perfectly with the two legs so as to control the body's balance in the complicated postures. The aim of this study is to establish a new dynamic body sway control model in the upright standing body position in coronal plane, and to reveal the possible control mechanisms underlying the body sway with special concerns on the roles that the pelvis and its muscles are performing during the sway. The plant of control model, the dynamics of human body, includes five parts, i.e. two ankles, two hips and one lumbosacral joint, which makes up a multi‐link inverted pendulum system, and is driven by two pairs of muscles, the psoas major (PM) and glutaeus medius (GM). Body sway records from eight healthy young subjects showed that the angular sway scopes of the ankle on roll (lateral) plane are 0.94±0.36± (eye‐open) and 1.35±0.52± (eye‐closed) respectively, while in lumbosacral plane, the scopes are 0.99±0.41± (eye‐open) and 1.27±0.72± (eye‐closed). The ankle and lumbosacral sways were almost in the same degree, yet their phase difference was near ±n, which means that the body trunk maintains perpendicular to horizon during the upright stance. Surface electromyographic (sEMG) activity from GM also showed the same evidence: the activated GM was always in the same side as the deviated center‐of‐pressure (COP). By assuming the corrective torque of posture is regulated by PID (proportional, integral and derivative) control, the body sway can be simulated by applying human physical parameters. Our study results demonstrated that the simulated traces are consistent with the experimental recorded, suggesting that the pelvis is an important structure for the posture maintenance and control, and the mechanism of balance keeping control during upright stance can be approximately taken as a PID control. The result also suggests a novel means for postural stability assessment in individual in the future.     

A stability classification method and its application to pipelined solution of linear recurrences

A new method of classification for numerical stability of parallel algorithms is proposed based on the theoretical foundation of forward error analysis. It partitions the algorithms according to their asymptotic stability—a measure introduced to relate the limiting behavior of the stability to the size of the problem. Using this method, the stability aspect of the pipelined solution technique for first-order and second-order linear recurrences—the core of a tridiagonal linear equation solver—is studied. In particular, it shows that the pipelined solution method of the first-order linear recurrences has the same degree of stability as the commonly used sequential evaluation algorithms. The stability problems of sequential and pipelined solution methods of the second-order linear recurrences are also studied.     

Fast parallel Preconditioned Conjugate Gradient algorithms for robot manipulator dynamics simulation

In this paper fast parallel Preconditioned Conjugate Gradient (PCG) algorithms for robot manipulator forward dynamics, or dynamic simulation, problem are presented. By exploiting the inherent structure of the forward dynamics problem, suitable preconditioners are devised to accelerate the iterations. Also, based on the choice of preconditioners, a modified dynamic formulation is used to speedup both serial and parallel computation of each iteration. The implementation of the parallel algorithms on two interconnected processor arrays is discussed and their computation and communication complexities are analyzed. The simulation results for a Puma Arm are presented to illustrate the effectiveness of the proposed preconditioners. With a faster convergence due to preconditioning and a faster computation of iterations due to parallelization, the developed parallel PCG algorithms represent the fastest alternative for parallel computation of the problem withO(n) processors.     

Covering a string

We consider the problem of finding the repetitive structures of a given stringx. The periodu of the stringx grasps the repetitiveness ofx, sincex is a prefix of a string constructed by concatenations ofu. We generalize the concept of repetitiveness as follows: A stringw covers a stringx if there is a superstring ofx which is constructed by concatenations and superpositions ofw. A substringw ofx is called aseed ofx ifw coversx. We present anO(n logn)-time algorithm for finding all the seeds of a given string of lengthn.Partially supported by SERC Grants GR/F 00898 and GR/J 17844, NATO Grant CRG 900293, ESPRIT BRA Grant 7131 for ALCOMII, and MRC Grant G 9115730.Partially supported by MRC Grant G 9115730 and S.N.U. Posco Research Fund 94-15-1112.