With the increasing performance and density of VLSI scircuits as well as the popularity of portable devices such as personal digital assitance, power consumption has emerged as an important issue in the design of electronic systems. Low power design techniqeus have been pursued at all design levels. However, it is more effective to attempt to reduce power dissipation at higher levels of abstraction which allow wider view. In this paper, we propose a simultaneous scheduling and binding scheme which increases the correlation between cosecutive inputs to an operation so that the switched capacitance of execution units is reduced in datapath-dominated circuits. The proposed method is implemented and integrated into the scheduling and assignment part of HYPER synthesis environment. Compared with original HYPER synthesis system, average power saving of 23.0% in execution units and 14.2% in the whole circuits, ar eobtained for a set of benchmark examples.

The petri net is a graphic model which is adaptable in modeling a complex concurrent parallel ssystem, and it is widely used in the fields of industrial enginering, computer science, electric engineeringand chemistry. Recently, the net is applied to the communication protocol, and extended to represent complex systems. There are several extended petri nets named as TPN (timed petri net), SPN (stochastic petri net), FPN(fuzzy petri net) and TFPN(timed fuzzy petri net). Accodingly, this SPN (stochastic petri net), FPN (fuzzy petri net) and TFPN(timed fuzzy petri net). Accodingly, this paper proposes an advanced communication protocol modeling method using the fuzzy value of the transition and firing delay time as the arguments of the function. The proposed method can produce clearer firing rules, and it is supposed to be used to design and analyse communication protocols in great effection.

So far, the multiple path MINs to provide redundant paths in the traditional UPP MINs have been realized by adding additional hardware such as extra stages, duplicated data links, or multiple copies of sthe MIN. And the traditional MINs do not exploit locality: communication with all processor-memory paris takes the same amount of time. Also so far there has been little progress for exploiting locality of reference in MINs. In this paper, we present a new topology MIN, hybrid MIN that is constructed with 2N-3 SEs which is far fewer SEs than that of traditional MINs. Although the hybrid MIN is constructed with 2N-3 SEs, the hybrid MIN satisfies full access capability (FAC) and has redundant paths(but providing single path for 2 memory modules of each processor). Moreover the has redundant paths (but providing single path for 2 memory modules of each processor). Moreover the Hybrid MIN provides shortcut path between pairs which have frequent dat acommunication (locality of reference). Its performance under varing degrees of localized communication is analyzed.

In this paper, the modified inverse chebyshev low-pass function is analyzed in the frequency domain, time domain, and sensitivity characteristics as compared with the classical inverse chebyshev function. Unlike the classical function, the modified function exhibits progressively diminishing ripples in the stopband. So, the modified function has a great attenuation throughout the stopband except at the vicinity of a stop frequency and can be realizable in the passive doubly-terminated ladder network for the even order. The poles of the modified function move towards real axis by the effect of diminishing ripples. Thus the pole-Q, which is one of the valuable measurements to estimage the function characteristics, is reduced without increasing order. In the frequency and can be realizable in the passive doubly-terminated ladder network to examine the magnitude and pole-Q sensitivities.

The objective of this paper is to present a controller-design method that can guarantee the global stability for nonlinear systems described by takagi-sugeno fuzzy models, and to apply the method to a typical nonlinear control problem. The presented method gives us a compensated fuzzy controller through the following major steps: First, if each local linear model of a given takagi-sugeno fuzzy system does not have the same input matrix, the method expands the system into the one with a method finds a takagi-sugeno fuzzy controller guaranteeing the global stability of the closed loop via solving relevant linear matrix inequalities. Compared to the conventional PDC (paralled distributed compensation) technique, the presented method has an advantage that trial-and-errors to check the global stability are not necessary. An illustrative simulation on the control of inverted pendulum is performed to demonstrate the applicability of the presented method, and its results show that a controller satisfying the global stability and robustness can be obtained by the method.

In many cases, a dialogue system can't extract the correct analysis information of a user's spoken utterance, because of its own ungrammatical components. Therefore, in order to perform a correct before it performs the syntactic processing. In this paper, we use a real dialogue corpus and classify these ungrammatical errors as 4 categories : phonological, syntactic, semantic errors that consist of speech reparis and inversions, and propose an algorithm to detect and correct the errors. In short, this paper proposes a method to detect and correct the speech repairs and inversions that are classified as the phonological and syntactic errors to implement a robust dialogue system. And, through the test of real dialogue data, this paper shows an efficiency of the proposed algorithm.

This paper presents a parallel combinatorial variant of evolution strategy (PCES) to solve well-known combinatorial optimization problems, Quadratic assignment problems (QAPs). The PCES reduces the possibility of getting stuck in local minima due to maintenance of subpopulation and thus it is more effective than the CES. Experiment results on two benchmark problems show that the PCES is better than the cES and the genetic algorithm(GA).

This paper proposes noun and affix extraction methods using conjunctive information for making an automatic indexing system thorugh morphological analysis and syntactic analysis. The korean language has a peculiar spacing words rule, which is different from other languages, and the conjunctive information, which is extracted from the rule, can reduce the number of multiple parts of speech at a minimum cost. The proposed algorithms also solve the problem that one word is seperated by newline charcter. We show efficiency of the proposed algorithms through the process of morhologica analyzing.

In this paper, we propose post-rpocessing method that corrects a misrecognized character by generated a characater recognizer using morphological analyzer and spelling corrector. The proposed post-processing consists of sthree phases : First, our method pass through morhological analyzer which only outputted necessary information for spelling correcting, doesn't analyze a bundle of phrases, and detects the location of misrecognized character. Second, tagging the generated candidate character using the information of character substitution table and grapheme substitution/separating table. Then we retry analysis after the misrecognition character has been substituted. Finally we select table, we investigate misrecognized charcters in CORPUS. Reliability analysis used to frequency of randomly selected about 100,000 words in CORPUS. A korean character recognizer demonstrates 93% correction rate without a post-processing. The entire recognition rate of our system with a post-processing exceeds 97% correction rate.

Conventional expert systems have difficulties in the inference on time-varing situations because they don't have the structure for processing time related informations and rule representation method to describe time explicitely. Some expert systems capable of temporal reasoning are not applicable to the domain in which state changes happen by unpredictble events that cannot be represented by periodic changes of data. In this paper, an event based temporal reasoning method is proposed. It is capable of processing te unpredictable events, representing the knowledge related to event and time, and infering by that knowledge as well as infering by periodically time-varing data. The NEO/temporal, an temporal inference engine, is implemented by applying the proposed temporal reasoning situation assessment and decision supporting system is implemented to show the benefits of the proposed temporal information processing model.