A new method to obtain the coefficients of Daubechies's scaling functions is given, in which it is not necessary to find the complex zeros of polynomials. Consequently it becomes easier to obtain the coefficients of arbitrary order from 2 to 40 with high accuracy.

A method of planar curve classification, which is invariant to rotation, scaling and translation using the zerocrossings representation of wavelet transform was introduced. The description of the object is represented by taking a ratio between its two adjacent boundary points so it is invariant to object rotation, translation and size. Transforming this signal to zero-crossings representation using wavelet transform, the minimum distance between the object and model while shifting the signals each other, can be used as classification parameter.

Highly parallel scalable multiprocessing systems (HMPs) are powerful tools for solving large-scale scientific and engineering problems. However, these machines are difficult to program since algorithms must exploit locality in order to achieve high performance. Vienna Fortran was the first fully specified data-parallel language for HMPs that provided features for the specification of data distribution and alignment at a high level of abstraction. In this paper we outline the major elements of Vienna Fortran and compare it to High Performance Fortran (HPF), a de-facto standard in this area. A significant weakness of HPF is its lack of support for many advanced applications, which require irregular data distributions and dynamic load balancing. We introduce HPF +, an extension of HPF based on Vienna Fortran, that provides the required functionality.

In this paper we describe the implementation of complex architectures using a general design approach for two-phase asynchronous systems. This fundamental approach, called Event Controlled Systems, can be used to widely extend the utility of two phase systems. We describe solutions that we have developed that dramatically improve the performance of static and dynamic-logic asynchronous pipelines, and briefly describe a complex microprocessor designed using ECS.

A connection admission control (CAC) that guarantees a negotiated cell-loss ratio for all cell-streams passing through the usage parameter control (UPC) in ATM networks is proposed. In particular, the cases in which a jumping-window, sliding-window, or continuous-leaky-bucket scheme are used for peak-cell-rate policing are discussued, and the upper bound for cell-loss ratio of the cell-streams passing through each type of UPC is derived. The CACs based on the derived cell-loss-ratio upper bounds ensure the quality of service in all cases by combining the relevant UPCs. There are three possible combinations of CAC and UPC, depending on the UPC mechanism used. The impact of the choice of CAC and UPC combination on bandwidth utilization is discussed using several numerical examples.

Geometrically Uniform (GU) codes have been a center of attention because their symmetric properties along with group algebraic structure provide benefits on their design and perfomance evaluation. We have been following a class of GU codes tha we call Strictly Geometrically Uniform (SGU) codes. Our studies had started from devising a way to get SGU trellis codes from Non-SGU (NSGU) constellations. Essentially, SGU multidimensional constellations were derived from an 1- or 2-dimensional NSGU constellations. Some simple good codes were then found, and the novelty is that they rely on symmetries of permutation of channel symbols. Applying the same method to PSK-type constellations, which is SGU, yielded again good codes, along with results regarding their algebraic structure.

For bonded SOI wafers with active silicon layers thinner than 1 µm, controlling thickness uniformity of active layers has been developed recently. A Plasma Assisted Chemical Etching (PACE) technology is one of methods to realize 0.1 µm bonded SOI. When this technology was proposed for the first time, it was believed that 0.1 µm thick bonded SOI wafers were easily produced independent of initial SOI layer thickness prior to the PACE process. It was true to create 0.1 µm SOI thickness in average. However, the uniformity appeared to be dependent on initial SOI material as well as the PACE machine capability itself. The SOI thickness uniformity pattern after PACE looked like surface morphology of polished silicon wafers. After the experiment to apply various polishing methods to each polishing process in the bonded SOI process, it was verified that the final SOI thickness uniformity after the PACE process was dependent on the waviness of wafer surfaces created in polishing.

For L 2, M 8, and transmission rate R = (log2M-1) bit/sym, a method for constructing GU trellis codes with L MPSK constellations is proposed and it is shown that the maximally achievable free distance is twice larger than it was previously reported for GU codes. Basides being geometrically uniform, these codes perform as good as Pietrobon's non-GU trellis codes with multidimensional MPSK constellations.

We introduce two probabilistic algorithms to determine the motion parameters of a planar shape without knowing a priori the point-to-point correspondences. If the target is limited to rigid objects, an Euclidean transformation can be expressed as a linear equation with six parameters, i.e. two translational parameters and four rotational parameters (the axis of rotation and the rotational speed about the axis). These parameters can be determined by applying the randomized Hough transform. One remarkable feature of our algorithms is that the calculations of the translation and rotation parameters are performed by using points randomly selected from two image frames that are acquired at different times. The estimation of rotation parameters is done using one of two approaches, which we call the triangle search and the polygon search algorithms respectively. Both methods focus on the intersection points of a boundary of the 2D shape and the circles whose centers are located at the shape's centroid and whose radii are generated randomly. The triangle search algorithm randomly selects three different intersection points in each image, such that they form congruent triangles, and then estimates the rotation parameter using these two triangles. However, the polygon search algorithm employs all the intersection points in each image, i.e. all the intersection points in the two image frames form two polygons, and then estimates the rotation parameter with aid of the vertices of these two polygons.

The designed converter has a two-input-winding transformer powered by single-phase AC voltage and an energy storage capacitor. Small size and enhanced conversion efficiency are achieved, because more than half of the energy is supplied to the load via a single conversion stage, and fast output-voltage regulation is achieved by controlling the charging and discharging of the storage capacitor. The design and control methods for the converter take into account the reset conditions of the transformer and stability in the output voltage control. An almost unity power factor and a low output voltage ripple were achieved with this converter fabricated as a breadboard circuit using small capacitors.

In this paper, we evaluated performance of mobile exchange control network. Queueing network model is used for modeling of mobile exchange control network. We developed a call control processing and location registration scenario that has a message exchange function between processors in mobile exchange control network. The network symbols are used the simulation models that are composed of the initialization module, message generation module, message routing module, message processing module, message generation module, HIPC network processing module, output analysis module. As a result of computer simulation, we obtain the processor utilization, the mean queue length, the mean waiting time of control network based on call processing and location registration capacity. The call processing and location registration capacity are referred by the number of call attempts in the mobile exchange and must be satisfied with the quality of service (delay time).

Narrow-band ISDN services may experience nonstationary traffic conditions. Therefore, switch design should take account of these conditions. We propose new performance measures for switching systems and describe a traffic model, which is a mixture of stationary Poissonian traffic and momentarily focused traffic. On the basis of this model, performance measures are determined so as to satisfy grade of service requirements that are in effect during some short interval after the momentarily focused traffic enters the system. We also propose an overload control scheme that uses these new performance measures. Finally, we show practical and numerical examples for the performance measures and overload control scheme.

The design and engineering of new network intelligence platforms to accommodate the ever-changing and growing demands of customers, presents rich market opportunities and challenges tempered by concerns arising from the problematic experiences of similar system and network developments. As the telecommunications industry evolves, customers are increasingly coming to expect the perception of instantaneous access to service providers together with transparency to network failures. System performance dictates that response times need to be minimised, sufficient redundant capacity installed in case of failure and controls embedded within the design to manage the exceptional situations (such as media stimulated events) that continually threaten network integrity. Network design based on a 'top-down,' 'end-to-end' methodology plays a fundamental role in delivering solutions that meet customers' performance needs. It is necessary to consider service scenario mixes, service demand, physical network topology, signalling message flows, the mapping of functional entities to physical components, and routing as part of the network design process to ensure that performance requirements are met. The use of 'what-if' design tools is particularly relevant as part of this process. A challenging task faces the System Designer with the often conflicting goals of good performance and provision of service flexibility.

We propose a new network architecture nemed Holonic Network for personalized multimedia communications, which is characterized by distributed cooperative networking based on autonomous management and all-optical transport networks. We than propose autonomous routing method. Moreover, an information searching method and a route generation method with network maps, which are essential for this network, are proposed. Lastly, we evaluate the proposed network performance by theoretical analysis and system emulation.

It is necessery to investigate the buckling mechanism in order to obtaining good performance from various sensors composed of resistors and microbridges or membranes. Especially for flow sensors, a convex formed bridge has an advantage over a flat or concave bridge with respect to heat transfer coefficient. We have fabricated various shapes of bridges and have prepared SiNx sputtered films as the support films of microbridges and Pt sputtered or evaporated films as resistors. We have achieved deformation control for both the longitudinal axis and transverse axis of Pt/SiNx double layered microbridges by appropriate selection of the total residual stress of Pt/SiNx structures and of the stress gradient between the Pt film and SiNx film. The deformation direction of the longitudinal axis of bridges for the beam bridge (Type ) are all the same as that of cantilevers and may be predicted via the stress gradient between the Pt and SiNx filmes of the bridges. The deflection of the transverse axis of the table bridge supported by four beams (Type ) changes linearly with the total stress of the Pt/SiNx structure and the deformation changes for the transverse axis are the same as that of completely free films as predicted from the stress gradient between the Pt film and the SiNx film. The interesting result is that the deformation direction for the longitudinal axis of Type is opposite to that of Type with the same film structure. We discuss the reason for this opposition via differences in the progress of the anisotropic etching. We consider that this result will expand the range of manufacturable shapes and film structures of microbridges.

This paper proposes the concept of information retrieval for fine arts database system on the fuzzy set theory, especially concerning to sensitive impression and location data. The authors have already reported several important formulations about the data structure and information retrieval models based on the fuzzy set theory for multimedia database. The fuzzy models of the information retrieval are implemented in the fine arts database system, which has the following features: (1) The procedure of information retrieval is formulated in the fuzzy set theory; (2) This database can treat multimedia data such as document data, sensitive impression, location information, and imagedata. (3) It is possible to retrieve the stored data based on sensitive impression and the location data such as "joyful pictures which have a mountain in the center and there is a tree in the right"; (4) Users can input impression words as a retrieval condition, and estimate their grades such as "low," "medium," and "high"; (5) For the result of information retrieval, the satisfaction grade is calculated based on fuzzy retrieval model; and (6) The stored data are about 400 fine arts paintings which are inserted by the textbook of fine arts currently used at the junior high school and high school in Japan. These features of this system give an effects of the fine arts education, and should be useful for information retrieval of fine arts. The results of this study will become increasingly important in connection with development of multimedia technology.

We developed the computer calligraphy, that is, a computer formation of brush-written Kanji characters using calligraphic knowledge. The style of brush handwriting depends mainly on the way of using a writing brush. Brush writing skills include the direction of brush at the beginning, curvature and turning the brush, the brush-up at the termination point in a stroke. We make up the calligraphic knowledge base according to the above mentioned brush writing skills. For simulating real brush movement, we represent the brush contact form that is the brush shape on the writing plane as a brush-touch. The system can control the size and direction of this brush-touch during the brush simulation. The system simulates the real brush writing to move the brush-touch along the skeleton letter shape in the standard database. We get the brush written Kanji from the locus of the brush-touch movement. We can extend this system to the new on line training system for brush writing using the simulation of brushtouch movement modified by the pressure, speed and rotation of the writing brush, and the skeleton letters written by a learner from the tablet. This system is also useful for students learning how to write Japanese letters beautifully with brush.

For object analysis and recognition, an original shape often needs to be described by using a small number of vertices. Polygonal approximation is one of the useful methods for the description. In this paper, we propose the curvature-based polygonal approximation (CBPA) method that is an application of the weighted polygonal approximation problem which minimizes the number of vertices of an approximate curve for a given error tolerance (the weighted minimum number problem). The CBPA method considers the curvature information of each vertex of an input curve as the weight of the vertex, and it can be executed in O(n2) time where n is the number of vertices of the input curve. Experimental results show that this method is effective even in the case when relatively few vertices are given as an original shape of a planar object, such as handwritten letters, figures (freehand curves) and wave-form data.

This paper presents an analog 2-dimensional discrete cosine transform (2-D DCT) processor for focal-plane image compression. The on-chip analog 2-D DCT processor can process directly the analog signal of the CMOS image sensor. The analog-to-digital conversion (ADC) is preformed after the 2-D DCT, and this leads to efficient AD conversion of video signals. Most of the 2-D DCT coefficients can be digitized by a relatively low-resolution ADC or a zero detector. The quantization process after the 2-D DCT can be realized by the ADC at the same time. The 88-point analog 2-D DCT processor is designed by switched-capacitor (SC) coefficient multipliers and an SC analog memory based on 0.35µm CMOS technology. The 2-D DCT processor has sufficient precision, high processing speed, low power dissipation, and small silicon area. The resulting smart image sensor chips with data compression and digital transmission functions are useful for the high-speed image acquisition devices and portable digital video camera systems.

In accordance with the diffusion of applications, such as the Desk Top Publishing system, the Document Formatting system and the Document Editing system, it is easy to make a document by using a computer. However, as for allocating the diagrams (figures and tables), there are few document processing systems able to allocate diagrams on the appropriate places automatically. In a document processing system it is a very important issue to allocate diagrams on the most suitable places. This paper defines the criteria for allocating diagrams on the suitable positions by investigating published papers. These criteria concern 1) the order of diagrams to be allocated, 2) the stability of the diagram allocations, 3) the distance between the diagram and the location of the corresponding first reference in the text, 4) the allocation balance of diagrams in a text, 5) the restricted areas where diagrams shouldn't be allocated, 6) the allocation priorities between diagrams of different width. Moreover, this paper proposes a method for deciding the diagram allocations satisfying the above criteria automatically and fast on document formatting systems. In this case we have limited its application to one type of ducuments, which is papers. Especially, this method can skillfully allocate diagrams of different width on the page by reallocating the diagrams and texts within it, and can allocate diagrams over the document uniformly.