This paper presents a new general distance measure that not only can be used in a vector quantization (VQ) of line spectrum frequency (LSF) parameters but also performs well in a LSF transformed domain. The new distance is based on the spectral sensitivity of LSFs and their transformed coefficients. In addition, a fix scaling vector is used to decrease the sensitivity of spectral error at higher frequencies. Experimental results have shown that the proposed distance measure leads to as good as or better performance of VQ compared to other methods in the field of LSF coding. The use of this distance as the weighting function of the LSF transformed parameters is also suggested.

Network monitoring is one of the most significant functions in network management to understand the state of a network in real-time. In SNMP (Simple Network Management Protocol), polling is used for this purpose. If the time interval for two consecutive polling requests is too long, then we cannot understand the state of the network in real-time. Conversely, if it is too short, then the polling message traffic increases and imposes a heavy load on the network. Many dynamic polling algorithms have been proposed for controlling the increase in the polling message traffic. However, they cannot keep track of the time variations of management information values, since their main objectives are to check whether or not a network node is active and the next polling interval is determined being independent of the time variations of the values. The existing polling algorithms are thereby not applicable to the case where monitoring the time variation of management information values is critical. This paper proposes a new dynamic polling algorithm which, by making use of Discrete Fourier Transformation, enables not only to control the increase in the polling message traffic but also to keep track of the time variations of network management information values. We show the availability of the proposed algorithm by evaluating it through both simulations and experiments in actual network environment.

In this paper, the correlation properties are used to develop two efficient encoding schemes for speech line spectrum frequency (LSF) parameters. The first scheme (1D KL), which exploits the intraframe correlation, is based on one-dimensional Karhunen-Loeve (KL) transformation; the second scheme, which requires some coding delays to further utilize the interframe correlation, uses two-dimensional (2D KL) transform in the frequency domain or one-dimensional KL transform co-operating with DPCM in the time domain. Moreover, since the KL transform is globally optimal, which is sensitive to the change of input data statistics, further two adaptive transform coding systems are also investigated in this paper. The performance of all systems for different bit rates is investigated and adequate comparisons are made. It is shown that the gain of using KL transformation to exploit the intraframe and interframe correlation is 3 and 4 bits/speech frame, respectively.

In this paper, the generalized learning vector quantization (GLVQ) algorithm is applied to design a hand-written Chinese character recognition system. The system proposed herein consists of two modules, feature transformation and recognizer. The feature transformation module is designed to extract discriminative features to enhance the recognition performance. The initial feature transformation matrix is obtained by using Fisher's linear discriminant (FLD) function. A template matching with minimum distance criterion recognizer is used and each character is represented by one reference template. These reference templates and the elements of the feature transformation matrix are trained by using the generalized learning vector quantization algorithm. In the experiments, 540100 (5401 100) hand-written Chinese character samples are used to build the recognition system and the other 540100 (5401 100) samples are used to do the open test. A good performance of 92.18 % accuracy is achieved by proposed system.

In this paper, we propose an algorithm to convert a given structured LOTOS specification into an equivalent flattened model called synchronous EFSMs. The synchronous EFSMs model is an execution model for communication protocols and distributed systems where each system consists of concurrent EFSMs and a finite set of multi-rendezvous indications among their subsets. The EFSMs can be derived from a specification in a sub-class of LOTOS and its implementation becomes simpler than the straightforward implementation of the original LOTOS specification because the synchronization among the processes in the model does not have any child-parent relationships, which can make the synchronization mechanism much more complex. Some experimental results are reported to show the advantage of synchronous EFSMs in terms of execution efficiency.

This paper presents a high-level test synthesis algorithm for operation scheduling and data path allocation. Data path allocation is achieved by a controllability and observability balance allocation technique which is based on testability analysis at register-transfer level. Scheduling, on other hand, is carried out by rescheduling transformations which change the default scheduling to improve testability. Contrary to other works in which the scheduling and allocation tasks are performed independently, our approach integrates scheduling and allocation by performing them simultaneously so that the effects of scheduling and allocation on testability are exploited more effectively. Additionally, since sequential loops are widely recognized to make a design hard-to-test, a complete (functional and topological) loop analysis is performed at register-transfer level in order to avoid loop creation during the integrated test synthesis process. With a variety of synthesis benchmarks, experimental results show clearly the advantages of the proposed algorithm.

This paper presents a type inference algorithm for a logic language, HS. The algorithm uses a program transformation, SPS, to given programs as a type inference. This method is theoretically clear, because applying it to given programs is equal to executing it partially. No other additional framework is needed for our approach. In contrast, many studies on type inference for logic languages are based on Mycroft and O'Keefe's famous algorithm, which was initially developed for functional languages. Therefore, the meanings of the algorithms are theoretically unclear in the domain of logic languages. Our type inference is flexible. Users of the type inference system can specify the types of objects abstractly (weakly) if the types are not exactly known, or they can specify them particularly (strongly) if the types are exactly known. Both kinds of programs are inferred for types. In contrast, many type inference systems accept purely untyped programs. Thus, with these two features, our method is simple and flexible.

A field theory for geometrical pattern identification is developed based on the postulate that various modified patterns are identified via invariant characteristics of pattern transformations. The invariant characteristics of geometrical patterns are written as the functional of the light intensity distribution of pattern, its spatial gradient, and also its spatial curvature. Some definite expressions of the invariant characteristic functional for two dimensional linear transformation are derived, and their invariant and feature extracting property are examined numerically. It is also shown that the invariant property is conserved even when patterns are deformed locally by introducing a "gauge field" as new degree of freedom in the functional in form of a covariant derivative. Based on this idea, we discuss a field theoretical model for pattern identification performed in biological systems.

Polarization transformation characteristics of a statified slab consisting of uniaxial chiral layers are investigated. It is assumed that a plane electromagnetic wave with arbitrary polarization is normally incident from free space on the stratified slab, which is located on a dielectric substrate. Note that the electric field inside a uniaxial chiral layer is expressed as a sum of four plane waves with different wavenumbers. The wavenumbers are found by seeking non-trivial solutions of the constitutive relations with Maxwell's equations. The electric field components of the transmitted and reflected waves can be obtained from a chainmatrix formalism. The powers and the Stokes parameters of the two waves are represented in terms of their electric field components. As is well known, the Stokes parameters uniquely describe every possible state of polarization of a plane wave. Numerical results are presented for two types of uniaxial chiral structure. The cross- and co-polarized powers and the Stokes parameters of the transmitted and reflected waves are computed for the incident plane wave of linear polarization. The results demonstrate a significant polarization transformation of the transmitted wave. Then it is shown that the stratified slab can be used as efficient polarization-transformation transmission filters active at some frequency band.

In this paper a new type of public-key cryptosystem, proxy cryptosystem, is studied. The proxy cryptosystem allows an original decryptor to transform its ciphertext to a ciphertext for a designated decryptor, proxy decryptor. Once the ciphertext transformation is executed, the proxy decryptor can compute a plaintext in place of the original decryptor. Such a cryptosystem is very useful when an entity has to deal with large amount of decrypting operation. The entity can actually speed-up the decrypting operation by authorizing multiple proxy decyptors. Concrete proxy cryptosystems are constructed for the ElGamal cryptosystem and the RSA cryptosystem. A straightforward construction of the proxy cryptosystem is given as follows. The original decryptor decrypts its ciphertext and re-encrypts an obtained plaintext under a designated proxy decryptor's public key. Then the designated proxy decryptor can read the plaintext. Our constructions are more efficient than such consecutive execution of decryption and re-encryption. Especially, the computational work done by the original decryptor is reduced in the proxy cryptosystems.

The polymer matrix for the number of N in-puts/outputs, N stages and 2x2-switches is denoted as the 1-D Spanke-Benes (SB) network. Throughout the paper, the 1-D SB-network, which equals the diamond cellular array, is extended to arbitrary dimensions by a mathematical transformation (a 1-D network provides the interconnection of 1-D data). This transformation determines the multistage architecture completely by providing size, location, geometry and wiring of the switches as well as it preserves properties of the networks, e.g., the capability of sorting. The SB-networks of dimension 3 are analysed and sorting is applied.

This study clarifies the effects of network complexity and network map transformation on the ability of network managers to use graphic network displays. Maps of Japan and the United States with outlines of their respective prefectures or states were displayed on a CRT. Each map displayed a fictitious network of nodes and their interconnections. These networks were two-level hierarchical and non-meshed, meaning that each low-level node was connected to a single high-level node, but not all high-level nodes were linked together. The subjects, task was to identify a path between two low-level nodes. In each trial, two low-level nodes were highlighted, and the subject attempted to find the shortest path between these nodes. This was done by using a mouse to select intermediate nodes. Completing a path required a minimum of 4 node traversals. Three variables were manipulated. First, the number of nodes was defined as the total number of low-level nodes in a network (70, 150, or 200). The second variable was the level of transformation. Very densely populated areas of the maps were systematically transformed to reduce congestion. There were three levels of transformation. The final variable was the country map used, that is, the map of Japan and the map of the United States. Several behavioral measures were used. The most informativ. appeared to be the time required to complete a path (the response time), and how often subjects returned to previous portions of a path (back-ups). For both of these measures, the data pattern was essentially the same. Increasing the number of nodes hurts performance. This was particularly pronounced when the map of Japan was tested. However, as the level of transformation increased, this effect was substantially reduced or completely eliminated. The results are discussed in terms of engineering rules and guidelines for designing graphical network representations.

Unlike the time-consuming contour tracking method of snakes [5] which requires a considerable number of iterated computations before contours are successfully tracked down, we present a faster and accurate model-based landmarks" tracking method where a single iteration of the dynamic programming is sufficient to obtain a local minimum to an integral measure of the elastic and the image energy functionals. The key lies in choosing a relatively small number of salient land-marks", or features of objects, rather than their contours as a target of tracking within the image structure. The landmarks comprising singular points along the model contours are tracked down within the image structure all inside restricted search areas of 41 41 pixels whose respective locations in image structure are dictated by their locations in the model. A Manhattan distance and a template corner detection function of Singh and Shneier [7] are used as elastic energy and image energy respectively in the algorithm. A first approximation to the image contour is obtained in our method by applying the thin-plate spline transformation of Bookstein [2] using these landmarks as fixed points of the transformation which is capable of preserving a global shape information of the model including the relative configuration of landmarks and consequently surrounding contours of the model in the image structure. The actual image contours are further tracked down by applying an active edge tracker using now simplified line search segments so that individual differences persisting between the mapped model contour are substantially eliminated. We have applied our method tentatively to portraits of a class album to demonstrate the effectiveness of the method. Our experiments convincingly show that using only about 11 feature points our method provides not only a much improved computational complexity requiring only 0.94sec. in CPU time by SGI's indigo2 but also more accurate shape representations than those obtained by the snakes methods. The method is powerful in a problem domain where the model-based approach is applicable, possibly allowing real time processing because a most time consuming algorithm of corner template evaluation can be easily implemented by parallel processing firmware.

This paper presents a method for mechanically transforming a parallel algorithm on an original network so that the algorithm can work on a target network. It is assumed that the networks are of cube-type such as the shuffle-exchange network, omega network, and hypercube. Were those networks isomorphic to each other, the algorithm transformation is an easy task. The proposed transformation method is based on a novel graphembedding scheme <φ: δ, κ, π, ψ>. In addition to the dilating operation δ of the usual embedding scheme <φ: δ>, the novel scheme uses three primitive graph-transformation operations; κ (= δ-1) for contracting a path into a node, π for pipelining a graph, and ψ (= π-1) for folding a pipelined graph. By applying the primitive operations, the cube-type networks can be transformed so as to be isomorphic to each other. Relationships between the networks are represented by the composition of applied operations. With the isomorphic mapping φ, an algorithm in a node of the original network can be simulated in the corresponding node(s) of the target network. Thus the algorithm transformation is reduced to routine work.

Let W be a real symmetric matrix associated with a weighted 2-connected planar graph. It is important to study a fast algorithm to solve the linear system Wx = c, since the system has many various applicaions, for example to solve partial defferencial equations numerically. In this paper, a new algorithm for the solution of a linear system of equations by Δ-Y transformations is proposed, and a sufficient condition for using this algorithm is proved. We show that this algorithm solves in O (n3/2) time a linear system associated with a planar graph which is embedded a cylinder graph with n vertices.

This paper proposes a design technique for 3-D non-separable QMF banks with Face-Centered Cubic Sampling (FCCS) and Body-Centered Cubic Sampling (BCCS). In the proposed technique, 2-D McClellan transformation is applied to a suitably designed 2-D prototype QMF to obtain 3-D QMFs. The design examples given in this paper demonstrate advantages of the proposed method.

Throughout the paper, the proper operating of the self-routing principle in 2-D shuffle multistage interconnection networks (MINs) is analysed. (The notation 1-D MIN and 2-D MIN is applied for a MIN which interconnects 1-D and 2-D data, respectively.) Two different methods for self-routing in 2-D shuffle MINs are presented: (1) The application of self-routing in 1-D MINs by a switch-pattern preserving transformation of 1-D shuffle stages into 2-D shuffle stages (and vice versa) and (2) the general concept of self-routing in 2-D shuffle MINs based on self-routing with regard to each coordinate which is the original contribution of the paper. Several examples are provided which make the various problems transparent.

This paper proposes a new approach to deal with the various quality of the reference impressions by measuring the seal to register as 3D (three-dimensional) image, that is, range image. By registering a seal as 3D image, it becomes possible to construct various 2D impressions from it according to the affixing conditions of the reference impression such as the affixing slant, the affixing pressure, the state of the ink on the seal surface and so on. Then, the accurate and easy identification of the seals will be possible by comparing the constructed impression with the reference impression. The performance is verified by experiment, and the result shows that plural 2D impressions according to the affixing conditions can be constructed from only one 3D image of the registered seal.

We thought that multiple skeletons were inherent in an ordinary three-dimensional object. A thinning method is developed to extract multiple skeletons using 333 templates for boundary deletion based on the hit or miss transformation and 222 templates for checking one voxel thickness. We prepared twelve sets of deleting templates consisting of total 194 templates and 72 one voxel checking templates. One repetitive iteration using one sequential use of the template sets extracts one skeleton. Some of the skeletons thus obtained are identical; however, multiple independent skeletons are extracted by this method. These skeletons fulfill the well-recognized three conditions for a skeleton. We extracted three skeletons from the cube, two from the space shuttle model and four from the L-shaped figure by Tsao and Fu. The digital medial skeleton, which is not otherwise extracted, is extracted by comparing the multiple skeletons with the digital medial-axis-like-figure. One of our skeletons for the cude agreed with the ideal medial axis. The locations of the gravity center of the multiple skeletons are compared with that of the original shape to evaluate how uniform or non-biased skeletons are extracted. For the L-shaped figure, one of our skeletons is found to be most desirable from the medial and uniform points of view.

This paper is concerned with synthesizing VLSI array processors from iterative algorithms. Our primary objective is to obtain the highest processor efficiency but not the shortest completion time. Unlike most of the previous work that assumes the index space of the given iterative algorithm to be boundless, the proposed method takes into account the effects of the boundaries of the index space. Due to this consideration, the pseudo-dependence relations are excluded, and most of the independent computations can therefore be uniformly grouped. With the method described in this paper, the index space is partitioned into equal-size blocks and the corresponding computations are systematically and uniformly mapped into processing elements. The synthesized VLSI array processors possess the attractive feature of very high processor efficiency, which, in general, is superior to what is derived from the conventional linear transformation methods.