We propose a new conditional linearization based on left-right separated conditional term rewriting systems, in which the left-hand side and the right-hand side of a rewrite rule have separate variables. By developing a concept of weight decreasing joinability we first present a sufficient condition for the Church-Rosser property of left-right separated conditional term rewriting systems. Applying this result to conditional linearization, we next show sufficient conditions for the unique normal form property and the Church-Rosser property of non-duplicating (unconditional) term rewriting systems even if they are non-left-linear or overlapping.

This paper proposes a very small on-chip multimedia real-time OS for embedded system LSIs, and demonstrates its usefulness on MPEG-2 multimedia applications. The real-time OS, which has a conditional cyclic task with suspend and resume for interacting hardware (HW) / software (SW) of embedded system LSIs, implements the minimum set of task, interrupt, and semaphore managements on the basis of an analysis of embedded software requirements. It requires only about 2.5 Kbytes memory on run-time, reduces redundant conventional cyclic task execution steps to about 1/2 for HW/SW interactions, and provides sufficient performance in real-time through implementing two typical embedded softwares for practical multimedia system LSIs: an MPEG-2 system protocol LSI and an MPEG-2 video encoder LSI. This on-chip multimedia real-time OS with 2.5 Kbyte memory will be acceptable for future multimedia embedded system LSIs.

In mobile broadcasting environments, an information server periodically broadcasts a set of data items to a large mobile client population at every broadcast cycle and mobile clients retrieve the data items they need upon arrival at the broadcast channel. In such environments, the cost of data delivery is independent of the number of clients. Many applications such as auctions and stock quotes perform read-only transactions that require the clients to read consistent and current data for accurate result. Previous concurrency control mechanisms designed for such environments ensure that the clients read consistent data, but they cannot ensure latest-bound currency which allows the clients to read the latest or most up-to-date data. In this paper, we propose an efficient concurrency control mechanism that ensures latest-bound currency as well as update consistency, which is appropriate for the mobile broadcasting environments. To ensure latest-bound currency, the server computes control information using "virtual" broadcast cycles. This control information is also used for checking update consistency. Thus, the proposed mechanism allows all data committed in current broadcast cycle to be broadcast. We have performed simulation experiments to measure transaction aborts in order to evaluate the performance of the proposed mechanism. The result confirms that the proposed mechanism produces no stale reads and also shows that the proposed mechanism generates less transaction aborts than previous mechanisms, which implies that we can get higher data currency without increasing data inconsistency.

We propose middleware which works on widely-used commercial off-the-shelf platforms (UDP/IP, FastEthernet, and Windows NT or commercial real-time kernels) to realize real-time distributed services for plant monitoring and control systems. It is not suitable to use TCP/IP for the systems because of its unpredictable re-transmission, while, as well known, UDP/IP does not guarantee certain arrivals of packets and it is also not acceptable for the systems. With UDP/IP, packets are lost mainly because of collisions in a network and buffer overflows. To avoid these packet losses, the middleware controls scheduling of all the packets transmitted between the nodes in a distributed system and prevents excessive collisions and buffer overflows. The middleware provides a necessary set of functions for plant monitoring and control applications. The middleware on each node in a distributed system consists of library functions and run-time modules. An application program on the node is required to use these library functions according to the rules the middleware provides. In this way the middleware can manage all the traffic among the nodes in the system. Receiving requests from the application via library functions, the run-time module of the middleware schedules transmission of messages to other nodes, avoiding unexpected delivery delays or buffer overflows. The module also guarantees application-to-application quality of service (QoS), such as transmission period and delivery deadline, required by the applications. This is achieved by assigning the resources not shared by other services to each distributed service and scheduling these resources so as not to violate the assignment. Here, resources include maximum numbers of packets which a node can receive or send in a specific period (20 msec, for example). We show implementation of the middleware to make it clear how to guarantee application-to-application QoS with some application examples.

In this manuscript, two key agreement protocols which are resistant to a denial-of-service attack are constructed from a key agreement protocol in [9] provably secure against passive and active attacks. The denial-of-service attack considered is the resource-exhaustion attack on a responder. By the resource-exhaustion attack, a malicious initiator executes a key agreement protocol simultaneously as many times as possible to exhaust the responder's resources and to disturb executions of it between honest initiators and the responder. The resources are the storage and the CPU. The proposed protocols are the first protocols resistant to both the storage-exhaustion attack and the CPU-exhaustion attack. The techniques used in the construction are stateless connection, weak key confirmation, and enforcement of heavy computation. The stateless connection is effective to enhancing the resistance to the storage-exhaustion attack. The weak key confirmation and the enforcement of heavy computation are effective to enhancing the resistance to the CPU-exhaustion attack.

Since the detection of optical flow (two-dimensional motion field on an image) from image sequences is essentially an ill-posed problem, most of the conventional methods use a smoothness constraint for optical flow heuristically and detect reasonable optical flow. However, little discussion exists regarding the degree of smoothness. Furthermore, to recover the relative three-dimensional motion and depth between a camera and a rigid object, in general at first, the optical flow is detected without a rigid motion constraint, and next, the motion and depth are estimated using the detected optical flow. Rigorously speaking, the optical flow should be detected with such a constraint, and consequently three-dimensional motion and depth should be determined. To solve these problems, in this paper, we apply a parametric model to an optical flow, and construct an estimation algorithm based on this model.

In this paper, a Wiener filtering method in wavelet domain is proposed for restoring an image corrupted by additive white noise. The proposed method utilizes the multiscale characteristics of wavelet transform and the local statistics of each subband. The size of a filter window for estimating the local statistics in each subband varies with each scale. The local statistics for every pixel in each wavelet subband are estimated by using only the pixels which have a similar statistical property. Experimental results show that the proposed method has better performance over the Lee filter with a window of fixed size.

To develop a smoothing method for speckle reduction is a significant problem, because of the complex ultrasonic characteristics and the obscurity of the tissue image. This paper presents a new method for speckle reduction from medical ultrasonic image by using fuzzy morphological speckle reduction algorithm (FMSR) that preserves resolvable details while removing speckle in order to cope with the ambiguous and obscure ultrasonic images. FMSR creates a cleaned image by recombining the processed residual images with a smoothed version of an original image. Performance of the proposed method has been tested on the phantom and tissue images. The results show that the method effectively reduces the speckle while preserving the resolvable details.

A simple and an efficient algorithm for polygon morphing is proposed in this paper. We adopt the parametric curve representation based on Fourier parameter estimation to transfer the traditional morphing process in spatial domain to a process in the parametric space instead. The principles are to express the polygon as the union of matching segments that are described by the estimated Fourier parameters. We have also designed a data resampling method that effectively controls the shape morphing according to the corresponding curvature values. Intermediate objects in-between the source and target polygons are then constructed based on the interpolation of Fourier parameters of the two polygons. Fourier parameters of the resampled polygons can be obtained efficiently by using the fast Fourier transform (FFT) algorithm. The experimental results show that the appearances of the morphed objects are superior to the ones obtained by the methods available.

Recently many researches concerning heart sound analysis are being processed with development of digital signal processing and electronic components. But there are few researches about recognition of heart sound, especially full cardiac cycled heart sound. In this paper, three new recognition methods about full cardiac cycled heart sound were proposed. The first method recognizes the characteristics of heart sound by integrating important peaks and analyzing statistical variables in time domain. The second method builds a database by principal components analysis on training heart sound set in time domain. This database is used to recognize new input of heart sound. The third method builds the same sort of the database not in time domain but in time-frequency domain. We classify the heart sounds into seven classes such as normal (NO) class, pre-systolic murmur (PS) class, early systolic murmur (ES) class, late systolic murmur (LS) class, early diastolic murmur (ED) class, late diastolic murmur (LD) class and continuous murmur (CM) class. As a result, we could verify that the third method is better efficient to recognize the characteristics of heart sound than the others and also than any precedent research. The recognition rates of the third method are 100% for NO, 80% for PS and ES, 67% for LS, 93 for ED, 80% for LD and 30% for CM.

Off-line state identification methods for a sequential machine using a homing sequence or an adaptive homing sequence (AHS) are well-known in the automata theory. There are, however, so far few studies on the subject of the on-line state estimator such as a state observer (SO) which is used in the linear system theory. In this paper, we shall construct such an SO for a Moore machine based on the state identification process by means of AHSs, and discuss the convergence property of the SO.

This work presents an analysis of I_DDQ dependency on the primary current that flows through the bridging fault and driven gates current. A maximum primary current depends only on the test vectors which minimize channel resistances of transistors. The driven gates current generates when intermediate voltage occurs on the faulty node with creation current path between VDD and GND through the driven gates, and its value depends on circuit parameters such as transistor sizes and fan-in number of driven gates.

In this paper we will present a new color distance measure, that is, angular distance of cumulative histogram. The proposed measure is robust to light variation. We also applied the weitght value to D_R, D_G, D_B according to a Hue histogram of the query image. Moreover, we have compared the measure to previous popular measure that is cumulative L₁ distance measure. We show that our method performed more accurate and perceptually relevant result.