• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.254-254
• /
• 2000

This paper presents a genetic programming based evolutionary strategy for on-line adaptive learnable evolvable hardware. genetic programming can be useful control method for evolvable hardware for its unique tree structured chromosome. However it is difficult to represent tree structured chromosome on hardware, and it is difficult to use crossover operator on hardware. Therefore, genetic programming is not so popular as genetic algorithms in evolvable hardware community in spite of its possible strength. We propose a chromosome representation methods and a hardware implementation method that can be helpful to this situation. Our method uses context switchable identical block structure to implement genetic tree on evolvable hardware. We composed an evolutionary strategy (or evolvable hardware by combining proposed method with other's striking research results. Proposed method is applied to the autonomous mobile robots cooperation problem to verify its usefulness.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.3
• /
• pp.107-116
• /
• 1996

Recently, the flash memory has been abstracting great attention in the semiconductor market in the world because of its potential applications as mass storage devices. One of the most significant barriers to the scalling-down of the stacked-gate devices such as EPROM's and flash EEPROM's is the large subthreshold leakage in the unselected cells connected with the bit line of a selected cell in the array during programming. The large subthreshold leakge is majorly due to the capacitive coupling between the floating gates of the unselectd cells and the bit line of selected cell. In this paper, a new programming method to redcue significantly the drain turn-on leakage in the unselected cells during programming has been studied, where a little positive voltage (0.25-0.75V) is applied to the soruce during programming unlike the conventional programming method in which the source is grounded. The resutls of the PISCES simulations and the electrical measurements for the standard EPROM with 0.35.mu.m effective channel length and 1.0.mu.m effective channel width show that the subthreshold leakage in the unselectd cells is significantly large when the source is grounded, whereas it is negligibly small when the source is biased ot a little positive voltage during programming. On the other hadn, the positive bias on the source is found to have little effects on the programming speed of the EPROM.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.51-58
• /
• 2010

Programming education needs learning which is adjusted individual learners' level of their learning abilities. Recommendation system is one way of implementing personalized service. In this research, we propose recommendation method which learning items are recommended for individual learners' learning in web-based programming education environment by. Our proposed system for leveled programming education provides appropriate programming problems for a certain learner in his learning level and learning scope employing collaborative filtering method using learners' profile of their level and correlation profile between learning topics. As a result, it resolves a problem that providing appropriate programming problems in learner's level, and we get a result that improving leaner's programming ability. Furthermore, when we compared our proposed method and original collaborative filtering method, our proposed method provides the ways to solve the scalability which is one of the limitations in recommendation systems by improving recommendation performance and reducing analysis time.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.175-178
• /
• 2000

The object level image compression is a useful technology for reducing the necessary data and manipulating individual objects. In this paper, we propose a new image object compression algorithm that uses the quadratic programming (QP) method to reduce the compressed data. The results indicate the superiority of the proposed QP based algorithm over the low pass extrapolation (LPE) method of MPEG-4.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.2
• /
• pp.599-607
• /
• 2006

We propose a simple new analytic method for solving a fuzzy goal programming (FGP) problem with general membership functions of fuzzy goals and re-examine a previously defined method for dealing with fuzzy weights for each of the goals. Several illustrative examples are given.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1245-1256
• /
• 2011

In this paper, we proposed a regularization interior point method for semidefinite programming with free variables which can be taken as an extension of the algorithm for standard semidefinite programming. Since an inexact search direction at each iteration is used, the computation of the designed algorithm is much less compared with the existing solution methods. The convergence analysis of the method is established under weak conditions.

• Proceedings of the KIEE Conference
• /
• 2006.07a
• /
• pp.262-263
• /
• 2006

This paper presents a scheme to solve the congestion problem with phase-shifting transformer(PST) and power generation using linear programming method. A good design of PST and power generation control can improve total transfer capability(TTC) in interconnected systems. This paper deals with an application of optimization technique for TTC calculation. linear programming method is used to maximize power flow of tie line subject to security constraints such as voltage magnitude and real power flow. The proposed method is applied to 10 machines 39 buses model systems to show its effectiveness.

• Journal of the military operations research society of Korea
• /
• v.9 no.2
• /
• pp.57-60
• /
• 1983

We show that the complexity of Simplex Method for Linear Programming problem is equivalent to the complexity of finding just an adjacent basic feasible solution if exists. Therefore a simplex type method which resolves degeneracy in polynomial time with respect to the size of the given linear programming problem can solve the general linear programming problem in polynomial steps.

• Journal of Engineering Education Research
• /
• v.22 no.1
• /
• pp.29-38
• /
• 2019

Integration is an important intellectual ability to reconfigure several separated elements into one unified form and to concisely and categorically express them. In this paper, we classify the types of integration in C language, and propose a systematic and incremental method to transform to better code based on the integration types. This transformation method could also be used as a means to improve integrated thinking and efficiently learn C language, and will improve development ability in C programming or other language programming.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.10 no.1
• /
• pp.14-30
• /
• 1985

Recently, multiple criteria decision making has been well established as a practical approach to seek a satisfactory solution to a decision making problem. Goal programming is one of the most powerful MCDM tools with satisfying operational assumptions that reflect the actual decision making process in real-world situations. In this paper we propose an efficient method implemented on a microcomputer for solving linear goal programming problems. It is an iterative revised goal simplex method using the sparsity technique. We design as interactive software package for microcomputers based on this method. From some computational experiences, we can state that the revised iterative goal simplex method using the sparsity technique is the most efficient one for microcomputer for solving goal programming problems.