• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.10
• /
• pp.57-64
• /
• 2000

In this paper, we propose the new hardware architecture which implements the stereo matching algorithm using the dynamprogrammethod. The proposed MOEPE(Merged Odd-Even PE) architecture operates in the systolic manner and finds the disparities form the intensities of the pixels on the epipolar line. The number of PEs used in the MOEPE architecture is the same number of the range constraint, which reduced the nuMber of the necessary PEs draMatically compared to the traditional method which uses the PEs with the same number of pixels on the epipolar line. For the normal sized images, the numof the MOEPE architecture is less than that of the PEs in the traditional method by 25${\times}$The proposed architecture is modeled with the VHDL code and simulated by the SYNOPSYS tool.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1218-1227
• /
• 2004

Multi-domain engineering systems include electrical, mechanical, hydraulic, pneumatic, and thermal components, making it difficult to design a system because of their complexity and inter domain nature. In order to obtain an optimal design, a unified design approach for each domain and an automated search method are required. This paper suggests a method for automatically synthesizing designs for multi-domain systems using the combination of bond graph that is domain independent and genetic programming that is well recognized as a powerful tool for open-ended search. To investigate the effect of proposed approach, an eigenvalue design problem is tested for some sample target sets of eigenvalues with different embryos.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1546-1552
• /
• 2004

Electronic Ink is a stored data in the form of the handwritten text or the script without converting it into ASCII by handwritten recognition on the pen-based computers and Personal Digital Assistants(Pocket PC) for supporting natural and convenient data input. One of the most important issues is to search the electronic ink in order to use it. We proposed and implemented a script matching algorithm for the electronic ink. Proposed matching algorithm separated the input stroke into a set of primitive stroke using the curvature of the stroke curve. After determining the type of separated strokes, it produced a stroke feature vector. And then it calculated the distance between the stroke feature vector of input strokes and one of strokes in the database using the dynamic programming technique.

• The KIPS Transactions:PartA
• /
• v.11A no.6
• /
• pp.439-450
• /
• 2004

Mobile agents are autonomous and dynamic entities that can migrate among various nodes in the network. Java's Jini framework facilitates mobile agent system development, providing hey features for distributed network programming. However, due to the security weakness, Jinil.0 service has a fundamental limitation on developing mobile agent systems which support secure remote communications. In this paper, we describe a Jini2.0-based secure mobile agent system named SecureJMoblet. On the top of Jini2.0, the system provides basic functionalities of a mobile agent system such as creation, transfer and control. In addition, with the SeureJS developed for secure JavaSpace service, SecureJMoblet supports a secure object repository and a reliable communication among mobile agents.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.11
• /
• pp.73-82
• /
• 2003

In this paper, a simultaneous buffer insertion and routing method is proposed under the constraints of wire and buffer locations by macro or IP blocks. A new grid graph is proposed to describe the regions in which buffers(or both wires and buffers) are not available. Under this grid we describe a method of constructing a buffeted tree that minimize the maximum source to sink delay. The method is based on the dynamic programming with pruning unnecessary partial solutions. The proposed method improved the slack time of the delay by 19% on the average while using less buffers and similar wire length.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.5
• /
• pp.262-270
• /
• 2005

In this paper, a new temporal decomposition method is proposed. where not oniy distortion but also entropy are involved in segmentation. The interpolation functions and the target feature vectors are determined by a dynamic Programing technique. where both distortion and entropy are simultaneously minimized. The interpolation functions are built by using a training speech corpus. An iterative method. where segmentation and estimation are iteratively performed. finds the locally optimum Points in the sense of minimizing both distortion and entropy. Simulation results -3how that in terms of both distortion and entropy. the Proposed temporal decomposition method Produced superior results to the conventional split vector-quantization method which is widely employed in the current speech coding methods. According to the results from the subjective listening test, the Proposed method reveals superior Performance in terms of qualify. comparing to the Previous vector quantization method.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2320-2331
• /
• 1999

Over the Internet, in order to utilize a collection of idle computers as a parallel computing platform, we propose a new scheme called GICE(Global Internet Computing Environment). GICE is motivated to obtain high programmability, efficient support for heterogeneous computing resources, system scalability, and finally high performance. The programming model of GICE is based on a single address space. GICE is featured with a Java based programming environment, a dynamic resource management scheme, and efficient parallel task scheduling and execution mechanisms. Based on a prototype implementation of GICE, we address the concept, feasibility, complexity and performance of Internet computing.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.108-110
• /
• 2019

A Database is a collection of data that does not have redundancy, and it is essential to easily use and share information in an information society where the amount of information is increasing. A typical structure of a Database is a relational database and a tree-structure Database. This research studies the programming language MUMPS, which is a tree structure database. This language constructs the database by storing arrays in a dynamic or B-Tree format. Unlike SQL, which must be used in languages such as Java and C #, MUMPS supports language and database independently and can manage data, so the data porting rate is high. In fact, in U.S. hospitals, the MUMPS-based platform has a high market share.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.7
• /
• pp.377-392
• /
• 2005

A lot of studies to measure and analyze the system performance have been done in areas such as system modeling, performance measurement, monitoring, and performance prediction since the advent of a computer system. Studies on a framework to unify the performance related areas have rarely been performed although many studies in the various areas have been done, however. In the case of TMO(Time-Triggered Message-Triggered Object), a real-time programming model, it hardly provides tools and frameworks on the performance except a simple run-time monitor. So it is difficult to analyze the performance of the real-time system and the process based on TMO. Thus, in this paper, we propose a framework for the dynamic analysis of the real-time system based on TMO, TDAF(TMO based Dynamic Analysis Framework). TDAF treats all the processes for the performance measurement and analysis, and Provides developers with more reliable information systematically combining a load model, a performance model, and a reporting model. To support this framework, we propose a load model which is extended by applying TMO model to the conventional one, and we provide the load calculation algorithm to compute the load of TMO objects. Additionally, based on TMO model, we propose performance algorithms which implement the conceptual performance metrics, and we present the reporting model and algorithms which can derive the period and deadline for the real-time processes based on the load and performance value. In last, we perform some experiments to validate the reliability of the load calculation algorithm, and provide the experimental result.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.349-356
• /
• 2005

Artificial Organism-used application areas are expanding at a break-neck speed with a view to getting things done in a dynamic and Informal environment. A use of general programming or traditional hi methods as the representation of Artificial Organism behavior knowledge in these areas can cause problems related to frequent modifications and bad response in an unpredictable situation. Strategies aimed at solving these problems in a machine-learning fashion includes Genetic Programming and Evolving Neural Networks. But the learning method of Artificial-Organism is not good yet, and can't represent life in the environment. With this in mind, this research is designed to come up with a new behavior evolution model. The model represents behavior knowledge with Classification Rules and Enhanced Backpropation Neural Networks and discriminate the denomination. To evaluate the model, the researcher applied it to problems with the competition of Artificial-Organism in the Simulator and compared with other system. The survey shows that the model prevails in terms of the speed and Qualify of learning. The model is characterized by the simultaneous learning of classification rules and neural networks represented on chromosomes with the help of Genetic Algorithm and the consolidation of learning ability caused by the hybrid processing of the classification rules and Enhanced Backpropagation Neural Network.