Journal of Electrical Engineering and information Science
The Korean Institute of Electrical Engineers
- Bimonthly
- /
- 1226-1262(pISSN)
Volume 1 Issue 2
-
This paper presents a text-driven discourse analysis system, called DPAS. DPAS constructs a discourse structure by weaving together clauses in the text by finding discourse relations between a clause and the clauses in a context. The basic processing model of DPAS is based on the stack based model of discourse analysis suggested by Grosz and Sidner. We extend the model with dynamic programming method to handle various discourse ambiguities effectively and efficiently. We develop the idea of a context space to keep all information of a context. DPAS parses a text by considering all possible discourse relations between a clause and a context. Since different discourse relations may result in different states of a context, DPAS maintains multiple context spaces for an ambiguous text. Since maintaining all interpretations until the whole text is processed requires too much computing resources, DPAS uses the idea of depth-limited search to limit the search space. If there is more than one discourse relation between an input clause and a context, DPAS constructs context spaces one context space for each discourse relation. Then, DPAS applies heuristics to choose the most desirable context space after it processes some more input clauses. Since the basic idea of DPAS is domain independent, although we used descriptive texts to demonstrate DPAS, we believe the idea of DPAS can be extended to understand other styles of texts.
-
The goal of this research is to provide a practical algorithm for outlining the left ventricular cavity in digital subtraction angiography. The proposed algorithm is based on the elliptic approximation and ML (Maximum Likelihood) estimate, and it produces a good results regarding execution time, robustness against noise, accuracy, and range of position of ROI (Regions Of Interest).
-
Sangho Ha;Kim, Junghwan;Park, Eunha;Yoonhee Hah;Sangyong Han;Daejoon Hwang;Kim, Heunghwan;Seungho Cho 15
MPAs(Massively Parallel Architectures) should address two fundamental issues for scalability: synchronization and communication latency. Dataflow architecture faces problems of excessive synchronization overhead and inefficient execution of sequential programs while they offer the ability to exploit massive parallelism inherent in programs. In contrast, MPAs based on von Neumann computational model may suffer from inefficient synchronization mechanism and communication latency. DAVRID (DAtaflow/Von Neumann RISC hybrID) is a massively parallel multithreaded architecture which takes advantages of von Neumann and dataflow models. It has good single thread performance as well as tolerates synchronization and communication latency. In this paper, we describe the DAVRID architecture in detail and evaluate its performance through simulation runs over several benchmarks. -
In target tracking area, the data association plays an important role and has been studied extensively. In this paper, after defining the data association as a constrained optimization, we introduce a new energy function and thereby an efficient realization of neural networks. As an application, this algorithm is used to detect object boundaries in IR images. The problem is that the IR image noisy, the shape of the object is variable, and the positions of the end points are not predictable. The performance of this algorithm is discussed with the experimental results.
-
In this paper, we present a robust H\ulcorner control design method for parameter uncertain systems that have delay in both state and control input. Through a certain algebraic Riccati inequality approach, a state feedback controller is obtained. The proposed state feedback controller stabilizes parameter uncertain delay systems and guarantees disturbance attenuation within a prescribed level. An illustrative example is given to demonstrate the results of the proposed method.
-
An efficient interacting multiple mode(IMM) approach for tracking a maneuvering target with kinematic constraints is described based on the square root information filter(SRIF). The SRIF is employed instead of the conventional Kalman filter since it exhibits more efficient features in handling the kinematic constraints and improved numerical characteristics. The kinematic constraints are considered in the filtering process as pseudomeasurements where the degree of uncertainty is represented by the magnitude of the pseudomeasurement noise variance. The Monte Carlo simulations for the constant speed, maneuvering target are provided to demonstrate the improved tracking performance of the proposed algorithm.
-
This paper presents a neural network approach for on-line estimation of partial discharge(PD) location using advanced correlation technique in power transformer. Ultrasonic sensors detect ultrasonic signals generated by a PD and the proposed method calculates time difference between the ultrasonic signals at each sensor pair using the cross-correlation technique applied by moving average and the Hamming window. The neural network takes distance difference as inputs converted from time difference, and estimates the PD location. Case studies showed that the proposed method using advanced correlation technique and a neural network estimated the PD location better than conventional methods.
-
Detection of arcing high impedance faults has been a perplexing in the power distribution protection. Transient analysis of distribution disturbances for fault discrimination from other normal events is important for a secure protection of the power system. A simple parameter of wave form distortion quantification is used to analyze the behaviors of arcing faults and normal distribution disturbances. Theoretical perspectives of the transients were studied and actual disturbances were examined. From this investigation, a discrimination guideline based on the revised crest factor is developed. The discrimination method has a high potential to enhance the reliability and security for the distribution system protection.
-
An adaptive input-output linearization technique of an interior permanent magnet synchronous motor with a specified output dynamic performance is proposed. The adaptive parameter estimation is achieved by a model reference adaptive technique where the stator resistance and the magnitude of flux linkage can be estimated with the current dynamic model and state observer. Using these estimated parameters, the linearizing control inputs are calculated. With these control inputs, the input-output linearization is performed and the load torque is estimated. The adaptation laws are derived by the Popov's hyperstability theory and the positivity concept. The robustness and the output dynamic performance of the proposed control scheme are verified through the computer simulations.
-
In the present paper we propose two new improved iterative restoration algorithms. One is to accelerate convergence of the steepest descent method using the improved search directions, while the other accelerates convergence by using preconditioners. It is also shown that the proposed preconditioned algorithm can accelerate iteration-adaptive iterative image restoration algorithm. The preconditioner in the proposed algorithm can be implemented by using the FIR filter structure, so it can be applied to practical application with manageable amount of computation. Experimental results of the proposed methods show good perfomance improvement in the sense of both convergence speed and quality of the restored image. Although the proposed methods cannot be directly included in spatially-adaptive restoration, they can be used as pre-processing for iteration-adaptive algorithms.
-
In this paper we deal with the problem of recovering 3-D motion and structure from a time-varying 2-D velocity vector field. A great deal has been done on this topic, most of which has concentrated on finding necessary and sufficient conditions for there to be a unique 3-D solution corresponding to a given 2-D motion. While previous work provides useful theoretical insight, in most situations the known algorithms have turned out to be too sensitive to be of much practical use. It appears that any robust algorithm must improve the 3-D solutions over time. As a step toward such algorithm, we present a method for recovering 3-D motion and structure from a given time-varying 2-D velocity vector field. The surface of the object in the scene is assumed to be locally planar. It is also assumed that 3-D velocity vectors are piecewise constant over three consecutive frames (or two snapshots of flow field). Our formulation relates 3-D motion and object geometry with the optical flow vector as well as its spatial and temporal derivatives. The linearization parameters, or equivalently, the first-order flow approximation (in space and time) is sufficient to recover rigid body motion and local surface structure from the local instantaneous flow field. We also demonstrate, through a sensitivity analysis carried out for synthetic and natural motions in space, that 3-D motion can be recovered reliably.
-
This paper presents a (k,n) threshold digital signature scheme with no trusted dealer. Our idea is to use the EIGamal signature scheme modified for group use. Among many digital signature schemes, our modification has a nice property for our purpose. We also show a (k.n) threshold fail stop signature scheme and two (k.n) threshold undeniable signature schemes. We use [10] as the original fail stop signature scheme, and use [3] and [2] as the original undeniable signature schemes. Since all these schemes are based on the discrete log problem, we can use the same technique.
-
This paper describes a concrete method for computing characteristic impedances and effective dielectric constants of the microstrip coupled lines without and with a dielectric overlay. The frequency-independent spectral domain method is used for the analysis of these lines. This method is a powerful, accurate, and numerically efficient approach for planar transmission line structure. For designing the optimal directional coupler, the velocities of even and odd mode must be equal but velocities of these two modes are different in the conventional coupled line which is inhomogeneous. The results show that these two velocities can be almost same according to variations of structural and material parameters in terms of the overlay(superstrate).
-
A new speed controller based on the fuzzy algorithm with hierarchical structure is presented. The input variables of the controller are speed error and its derivative(change of error), where the output variable is the change of torque current command. Several comparisons were performed with conventional PI (proportional plus integral) controller and proposed controller. These controllers are applied to the laboratory model drive system with 2.2kW induction motor. Some simulation and experimental results show that the speed controller using fuzzy algorithm is more robust than the conventional PI controller.
-
This paper deals with a new multi-level high voltage source inverter with GTO Thyristors. Recently, a multi-level approach seems to be the best suited for implementing high voltage conversion systems because it leads to harmonic reduction and deals with safe high power conversion systems independent of the dynamic switching characteristics of each power semiconductor device. A conventional multi-level inverter has some problems; voltage unbalance between DC-link capacitors and larger blocking voltage across the inner switching devices. To solve these problems, the novel multi-level inverter structure is proposed.
-
Variable step size LMS(VS-LMS) algorithms improve performance of LMS algorithm by means of varying the step size. This paper presents a new VS-LMS algorithm using normalized absolute estimation error. Normalizing the estimation error to the expected valus of the desired signal, we determined the step size using the relative size of estimation error, Because parameters and computational load are less, our algorithm is easy to implement in hardware. The performance of the proposed algorithm is analyzed theoretically and estimated through simulations. Based on the theoretical analysis and computer simulations, the proposed algorithm is shown to be effective compared to conventional VS-LMS algorithms.
-
In this paper, we dicuss on the properties related to the circular filtering in orthogonal transform domain. The efficient filtering schemes in six orthogonal transform domains are presented by generalizing the convolution-multiplication property of the DFT. In brief, the circular filtering can be accomplished by multiplying the transform domain filtering matrix W, which is shown to be very sparse, yielding the computational gains compared with the time domain processing. As an application, decimation and interpolation techniques in orthogonal transform domains are also investigated.
-
In this paper, we propose a new access method, called the HG-tree, to support indexing and retrieval by image content in large image databases. Image content is represented by a point in a multidimensional feature space. The types of queries considered are the range query and the nearest-neighbor query, both in a multidimensional space. Our goals are twofold: increasing the storage utilization and decreasing the area covered by the directory regions of the index tree. The high storage utilization and the small directory area reduce the number of nodes that have to be touched during the query processing. The first goal is achieved by absorbing splitting if possible, and when splitting is necessary, converting two nodes to three. The second goal is achieved by maintaining the area occupied by the directory region minimally on the directory nodes. We note that there is a trade-off between the two design goals, but the HG-tree is so flexible that it can control the trade-off. We present the design of our access method and associated algorithms. In addition, we report the results of a series of tests, comparing the proposed access method with the buddy-tree, which is one of the most successful point access methods for a multidimensional space. The results show the superiority of our method.
-
Although knowledge discovery is increasingly important in databases, the discovered knowledge sets may not be effectively used for application domains. It is partly because knowledge discovery does not take user's interests into account, and too many knowledge sets are discovered to handle efficiently. We believe that user's interests are conveyed by a query and if a nested query is concerned it may include a user's thought process. This paper describes a novel concept for discovering knowledge sets based on query processing. Knowledge discovery process is performed by: extracting features from databases, spanning features to generate range features, and constituting a knowledge set. The contributions of this paper include the following: (1) not only simple queries but also nested queries are considered to discover knowledge sets regarding user's interests and user's thought process, (2) not only positive examples (answer to a query) but also negative examples are considered to discover knowledge sets regarding database abstraction and database exceptions, and (3) finally, the discovered knowledge sets are quantified.
-
윤종필 146
Although knowledge discovery is increasingly important in databases, the discovered knowledge sets may not be effectively used for application domains. It is partly because knowledge discovery does not take user's interests into account, and too many knowledge sets are discovered to handle efficiently. We believe that user's interests are conveyed by a query and if a nested query is concerned it may include a user's thought process. This paper describes a novel concept for discovering knowledge sets based on query processing. Knowledge discovery process is performed by: extracting features from databases, spanning features to generate range features, and constituting a knowledge set. The contributions of this paper include the following: (1) not only simple queries but also nested queries are considered to discover knowledge sets regarding user's interests and user's thought process, (2) not only positive examples (answer to a query) but also negative examples are considered to discover knowledge sets regarding database abstraction and database exceptions, and (3) finally, the discovered knowledge sets are quantified.