Recently, a number of concurrency control algorithms have been proposed for multidatabase system (MDBS) concurrency control methods (CCMs) and the most challenging issue of them has been a concern about how to ensure global serializability (GSR). In this paper, we examine two concurrency control algorithms of MDBS through simulation approach: optimistic ticket method (OTM) and global ticket method (GTM). In historical note, OTM is known to be the first practical solution, since this approach ensures GSR by way of automatically resolving indirect conflicts among global transactions without making any restrictions on local CCMs. However, OTM is expected to yield poor performance since it enforces all global transactions to take a local ticket which causes direct conflicts between them. In GTM, the global transaction manager in an MDBS assigns a global ticket to global transactions rather than accessing a local ticket as in OTM. Our experimental results showed that GTM outperforms OTM in cases that short timeout values are given. However, in case that the timeout value relatively becomes long, our results demonstrated that OTM outperforms GTM.

We propose a new algorithm for minimizing the number of vertices of an approximate curve by keeping the error within a given bound (min-# problem) with the parallel-strip error criterion. The best existing algorithm which solves this problem has O (n2 log n) time complexity. Our algorithm which uses the Cone Intersection Method does not have an improved time complexity, but does have a high efficiency. In particular, for practical data such as those which represent the boundaries or the skeletons of an object, the new algorithm can solve the min-# problem in nearly O(n2) time.

In this paper, we give an algorithm which, given a set F of at most (n - 1) - k faulty nodes, and two sets S = {s1,..., sk} and T = {t1,..., tk}, 1 k n - 1, of nonfaulty nodes in n-dimensional star graphs Gn, finds k fault-free node disjoint paths si tji, where (j1,..., jk) is a permutation of (1,..., k), of length at most d(Gn) + 5 in O(kn) optimal time, where d(Gn) = 3(n-1)/2 is the diameter of Gn.

This letter proposes a new shaping algorithm (CRSA: CDV Reduction Shaping Algorithm) that can freely reduce the maximum CDV value of a cell stream to any predetermined value. There is a trade off between shaping delay and the maximum CDV value reduction achieved when using CRSA. The shaper using CRSA (CR-shaper) output satisfies the Peak Cell Rate Reference Algorithm set with the CR-shaper parameters.

A novel method of multichannel surface EMG processing has been developed to compensate for the distortion in bipolar surface EMG signals due to the movement of innervation zones. The distortion of bipolar surface EMG signals was mathematically described as a filtering function. A compensating technique for such distorted bipolar surface EMG signals was developed for the brachial biceps during dynamic contractions in which the muscle length and tension change. The technique is based on multichannel surface EMG measurement, a method for estimating the movement of an innervation zone, and the inverse filtering technique. As a result, the distorted EMG signals were compensated and transformed into nearly identical waveforms, independent of the movement of the innervation zone.

Recently, ABR has been attracting attention as a new service category of ATM, and the methodology to realize ABR is being actively discussed in the ATM Forum. ABR is expected to become a suitable class for supporting LAN services on ATM networks. To this end, a technical foundation must be established in which bandwidth is effectively utilized and quality is guaranteed. In order for ABR to use a portion of the bandwidth that is not used by high-priority classes (CBR, VBR), it is necessary to appropriately estimate the unused portion of the bandwidth. Due to the fact that the unused portion of the bandwidth in ATM networks fluctuates, such fluctuations must be taken into account. This paper describes ABR connection admission control and design of the congestion detecting point in an ABR buffer using Allan variance of the unused portion of the bandwidth.

Six chips of the GaAs standard cell LSIs have been developed for a synchronous digital hierarchy (SDH) interface unit in 10 Gbit/s optical communication systems. Two of them are the frame termination LSIs for SDH, and four are the byte multiplexing and demultiplexing LSIs. The LSI configuration with a careful thermal design were needed to realize a natural air-cooling operation. As a result, the unit was composed of eight chips with six kind of LSIs and these LSIs consist of 1 K to 3 K gates. The LSIs were designed with the standard cell libraries based on 0.5µm gate DCFL (Direct Coupled FET Logic) operating at a low power supply voltage of 1.5V. The propagation delay time of standard DCFL inverter was 25 ps with a power consumption of 0.45mW in the experimental results. The LSI design methodology using these libraries were discussed to achieve the data processing of 1.25 Gbit/s signals under a natural air-cooling condition. The maximum operating speeds of them were at least 1.4 GHz and the power consumptions were as low as under 1.8 W, which resulted in fully high speed operations under a natural air-cooling condition at an ambient temperature of 100.

This paper proposes a method to predict and control noise voltage caused by electrostatic discharge (ESD) to electronic equipment. The relationship of grounding system configurations for a typical set of equipment to ESD immunity has been derived using a mechanism of ground potential variations. The equivalent circuit representing ground elements as lumped constants enables us to predict the transient ground potential differences between PCB (Printed Circuit Board) ground planes connected via signal cables and induced noise voltage at the receiving end. The calculation shows that the contribution of ground potential differences to noise voltage is comparable to that of the electromagnetic coupling between the discharge current on the enclosure and the circuit loops. The calculation also shows some characteristic results, such as; the induced noise voltage is remarkably dependent on the unbalance in ground cable lengths and on the impedance of ground conductors connecting PCBs, especially when the equipment uses a single-point grounding system. These characteristics were confirmed by measurements of induced ground potential differences, noise voltage and immunity levels. Thus the proposed method is shown to be very effective to analyze the dependency of grounding conditions on ESD immunity and to improve ESD immunity in equipment design.

The charge neutralized at a small gap discharge has been evaluated from measured electromagnetic fields by two methods. The small gap discharges simulate ESD events. The evaluated charge decreases rapidly as a step shape immediately in a moment of the discharge. The accumulated static charge and the risetime of the neutralization step increase with the gap length. When the gap length is 0.1mm, risetime and the initial static charge are about 0.3ns and 5.6nC, respectively.

We present two efficient attribute evaluator construction methods for a wide subclass of L-attributed grammars by enumeration of attributed items during one-pass bottom-up parsing. We have already proposed a construction method of a parser/evaluator for the subclass of L-attributed grammar. However the evaluator produced by our previous method uses a great number of attributed items to evaluate all attributes of a given input string. In this paper we propose two generalized methods to reduce the number of attributed itmes used in attribute evaluation. Our methods allow us to evaluate all attributes taking advantage of the use of available lookahead information.

The recurrence method is useful for numerical calculation of the Bassel function Jv(x) of complex order v. The necessary total number of the recurrences in this method has been examined for the real order v, but it is known only for limited ranges of the real order v and the variable x, and it is not known for the complex order v. This letter proposes a new algorithm which increases the total number of the recurrences gradually, and which stops the calculation automatically when the approximate Bessel function with a necessary precision is obtained.

PID-type controllers have been well-known and widely used in many industries. Their regulation property of those was more improved through the addition of Bang-Bang-action. In spite of the potentials of these PID-plus Bang-Bang controllers, their regulation property is still limited by the fixed window limit value that determines the control action, i. e., PID or Bang-Bang. Thus, this paper presents an approach for improving the regulation property by dynamically changing the window limit value according to the plant dynamics with Neural Network predictive model. The improved regulation property is illustrated through simulation studies for position control of DC servo-motor system in the sense of classical figures of merit such as overshoot and rise time.

This paper discusses the problems of largest similar substructures (in short, LSS) in rooted and unordered trees (in short, R-trees) and those in unrooted and unordered trees (in short, trees). For two R-trees (or trees) Ta and Tb, LSS in Tb to Ta is defined, and two algorithms for finding one of the LSSs for R-trees and that for trees are proposed. The time and space complexities of both algorithms are OT (m3NaNb) and OS(mNaNb), respectively, where m is the largest degree of a vertex of Ta and Tb, and Na(Nb)is the number of vertices of Ta(Tb).

We define the Reallocation Problem to determine whether we can move products from their current store-houses to target storehouses in a number of moves which is less than or equal to a given number. This problem is defined simply and can be applied to many practical problems. We give necessary and sufficient conditions for feasibility for Reallocation Problems under various conditions, and propose liner time algorithms, when the volume of the products is restricted to 1. Moreover, we show that the Reallocation Problem is NP-complete in the strong sense, when the volume of the products is not restricted.

Digital halftoning is a well-known technique in image processing to convert an image having several bits for brightness levels into a binary image consisting only of black and white dots. A great number of algorithms have been presented for this problem, some of which have only been evaluated just by comparison with human eyes. In this paper we formulate the digital halftoning problem as a combinatiorial problem which allows an exact solution with graph-theoretic tools. For this, we consider a d-dimensional grid of n := Nd pixels (d 1). For each pixel, we define a so-called k-neighborhood, k {0,...N - 1}, which is the set of at most (2k + 1)d pixels that can be reached from the current pixel in a distance of k. Now, in order to solve the digital halftoning problem, we are going to minimize the sum of distances of all k-neighborhoods between the original picture and the halftoned one. We show that the problem can be solved in linear time in the one-dimensional case while it looks hopeless to have a polynomial-time algorithm in higher dimension including the usual two-dimensional case. We present an exact algorithm for the one-dimensional case which runs in O(n) time if k is regarded to be a constant. For two-dimensional case we present fast approximation techniques based on space filling curves. An experimental comparison of several implementations of approximate algorithms proves that our algorithms are of practical interest.

This paper presents a parallel move generation of a Chess machine system for achieving the purpose of reducing the number of move generation cycles. The parallel system is composed of five move generation modules which share the move generating cycles to reduce the time of building a game tree. Simulation results show that the proposed parallel move generation architecture takes about half of the number of move generation cycles to build a game tree that is the same as the one built by a sequential move generation module.

We propose a parallel parsing algorithm based on Earley's method, which works in O(log2n) time using O(n4.752) processors on CREW PRAM. This algorithm runs with less number of precessors compared with previously proposed W. Rytter's algorithm.

Arc discharge at switching contacts is one of the key phenomena, because it strongly affects material wear/transfer, contact resistance and electromagnetic interference (EMI). The arc discharge is classified into various types from the viewpoint of its sustaining mechanism and voltage waveform. They are mainly steady arc, showering arc and initial arc. Furthermore, a steady arc consists of two stages named metallic phase arc and gaseous phase arc. In the metallic, phase arc, metal ious from the electrodes mainly sustain the arc. On the other hand, gas ions from the surrounding atmosphere play an important role in the gaseous phase. Each phase arc has different influence on contact performance and EMI. The purpose of this paper is to review the arc discharges at light duty electrical contacts, and to survey the effects of arc discharges on material transfer and EMI.

It is known that an anticausal IIR filter can be realized in real time by using the time reversed section technique. When combined with a casual IIR filter, the overall transfer function can yield exact linear phase characteristic in theory. This paper presents a new method for designing complex IIR digital filters with exact linear phase. The design problem of IIR filters with exact linear phase can be reduced to magnitude-only filter design. The proposed procedure is based on the formulation of an eigenvalue problem by using Remez exchange algorithm. By solving the eigenvalue problem to compute the real maximum eigenvalue, the solution of the rational interpolation problem can be achieved. Therefore, the optimal filter coefficients are easily obtained through a few iterations. The proposed design algorithm not only retains the speed inherent in Remez exchange algorithm, but also Simplifies the interpolation step because is has been reduced to the computation of the real maximum eigenvalue. Several examples are presented to demonstrate the effectiveness of the proposed method.

The local moment functions for discrete Wigner trispectrum are examined in ambiguity and in time-frequency domain. A concept of multiple and multidimensional circular convolution in frequency domain is introduced into the discrete Wigner higher order time-frequency signal representation of any order. It is shown that this concept based on the 1st order spectra of the signal offers an insight into the properties of inconsistent local moment functions and their representation both in ambiguity and time-frequency domain. It allows to prove that midfrequency crossterms of a multicomponent signal can not be removed by any generalized 4th order ambiguity function which employ kernel function in the ambiguity domain. It is shown, that the concept of multiple convolution in frequency domain can lead to the crossterm-reduced discete time-frequency representations of any order