• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2002년도 하계학술대회 논문집
• /
• pp.54-57
• /
• 2002

In this study, a new programming method, to minimize the generation of Si-SiO$_2$ interface traps of scaled SONOS flash memory as a function of number of program/erase cycles has been proposed. In the proposed programming method, power supply voltage is applied to the gate, forward biased program voltage is applied to the source and the drain, while the substrate is left open, so that the program is achieved by Modified Fowler-Nordheim (MFN) tunneling of electron through the tunnel oxide over source and drain region. For the channel erase, erase voltage is applied to the gate, power supply voltage is applied to the substrate, and the source and drain are open. A single power supply operation of 3 V and a high endurance of 1${\times}$10$\^$6/ prograss/erase cycles can be realized by the proposed programming method. The asymmetric mode in which the program voltage is higher than the erase voltage, is more efficient than symmetric mode in order to minimize the degradation characteristics of scaled SONOS devices because electrical stress applied to the Si-SiO$_2$ interface is reduced by short programming time.

• 한국전기전자재료학회논문지
• /
• 제25권6호
• /
• pp.409-413
• /
• 2012

In this study, a substrate-bias assisted 2-step pulse programming method is proposed for realizing 4-bit/1-cell operation of the SONOS memory. The programming voltage and time are considerably reduced by this programming method than a gate-bias assisted 2-step pulse programming method and CHEI method. It is confirmed that the difference of 4-states in the threshold voltage is maintained to more than 0.5 V at least for 10-year for the multi-level characteristics.

• 대한산업공학회지
• /
• 제17권2호
• /
• pp.131-142
• /
• 1991

The concept of criterion function is proposed as a framework for comparing the geometric and computational characteristics of various nonlinear programming approaches to linear programming such as the method of centers, Karmakar's algorithm and the gravitational method. Also, we discuss various computational issues involved in obtaining an efficient parallel implementation of these methods. Clearly, the most time consuming part in solving a linear programming problem is the direction finding procedure, where we obtain an improving direction. In most cases, finding an improving direction is equivalent to solving a simple optimization problem defined at the current feasible solution. Again, this simple optimization problem can be seen as a least squares problem, and the computational effort in solving the least squares problem is, in fact, same as the effort as in solving a system of linear equations. Hence, getting a solution to a system of linear equations fast is very important in solving a linear programming problem efficiently. For solving system of linear equations on parallel computing machines, an iterative method seems more adequate than direct methods. Therefore, we propose one possible strategy for getting an efficient parallel implementation of an iterative method for solving a system of equations and present the summary of computational experiment performed on transputer based parallel computing board installed on IBM PC.

• 한국경영과학회지
• /
• 제18권3호
• /
• pp.101-111
• /
• 1993

The purpose of this paper is to show the graphic representation of a linear programming problem by a projection method. First, we develop a projection method which conserves the optimality in the projected space, and next we introduce an algorithm to visualize the feasible solution set and the solution process by the projection method. Finally, we give an example to represent a 4-dimensional linear programming problem graphically.

• East Asian mathematical journal
• /
• 제35권5호
• /
• pp.597-612
• /
• 2019

In this study, we propose a new logarithmic barrier approach to solve linear programming problem using the projective method of Karmarkar. We are interested in computation of the direction by Newton's method and of the step-size using minorant functions instead of line search methods in order to reduce the computation cost. Our new approach is even more beneficial than classical line search methods. We reinforce our purpose by many interesting numerical simulations proved the effectiveness of the algorithm developed in this work.

• 정보교육학회논문지
• /
• 제23권6호
• /
• pp.561-571
• /
• 2019

프로그래밍 교육은 일반적으로 문제분석 과정, 알고리즘과 프로그래밍을 통한 자동화, 일반화 과정을 포함하고 있어 학습자의 컴퓨팅사고 향상에 좋은 소프트웨어 교육방법이다. 그러나 초보자의 경우 명령어 사용법에 대한 이해, 알고리즘 작성과 프로그래밍 구현단계에서 어려움을 겪는 것으로 나타났다. 본 연구에서는 예비교사들의 프로그래밍 교육을 위해 게임 프로그래밍 교육모델과 교육과정을 개발하였다. 4E 모델은 공감단계, 탐색단계, 강화단계 및 평가단계로 구성되었다. 또한 각 단계별로 게임 핵심 요소와 핵심 명령어 블록들을 학습할 수 있도록 구성하였다. 예비교사가 프로그래밍 명령어 활용에 대한 이해를 돕기 위해 예제 학습, 자기 게임 생성 및 팀 기반 프로젝트 형태로 구성된 3단계 교수학습 방법을 제시하였다. 15주간 교육과정으로 적용하고 검증한 결과 설계한 모델, 예비교사들의 블록 프로그래밍 역량 인식 등에서 유의미한 결과를 보였으며 제출한 결과물에 대한 컴퓨팅사고 수준도 높은 결과를 보였다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.249-252
• /
• 1996

This paper presents an algorithmic approach used in the development of a task-level off-line programming system for the efficient applicaiton of robot. In the method, robot tasks are graphically described with manipulation functions. By applying robot language these graphic robot tasks are converted into commands for the robot. A programming example demonstrates the potentiality of task-oriented robot programming.

• 한국측량학회지
• /
• 제19권2호
• /
• pp.163-172
• /
• 2001

본 연구에서는 원격탐사 데이터의 분류방법으로서 이차계획법을 토지피복 추출에 적용하였으며, 주제도 추출에 일반적으로 사용되는 최대우도와 신경망의 분류결과와 정확도를 비교하여 그 적용성을 검토하였다. 그 결과, 이차계획법에 의한 분류방법이 최대우도법에 비하여 평균 6%정도의 향상된 분류결과를 도출할 수 있어서 원격탐사 데이터의 분류에 이차계획법을 적용할 수 있으리라 판단되었다. 또한 이차계획법에 의한 분류에서는 클래스 구성비가 클래스 결정에 직접적인 영향을 주어 기존의 이진적인 분류방법에서 무시되었던 결과 값들을 명확하게 나타낼 수 있었다.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.449-460
• /
• 2007

Several fuzzy approaches can be considered for solving multi-objective transportation problem. This paper presents a fuzzy goal programming approach to determine an optimal compromise solution for the multiobjective transportation problem. We assume that each objective function has a fuzzy goal. Also we assign a special type of nonlinear (hyperbolic) membership function to each objective function to describe each fuzzy goal. The approach focuses on minimizing the negative deviation variables from 1 to obtain a compromise solution of the multiobjective transportation problem. We show that the proposed method and the fuzzy programming method are equivalent. In addition, the proposed approach can be applied to solve other multiobjective mathematical programming problems. A numerical example is given to illustrate the efficiency of the proposed approach.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.50.2-50
• /
• 2001

Optimal control problems are notoriously difficult to solve either analytically or numerically except for limited cases of having simple dynamics. Evolutionary programming is a promising method of solving various optimal control problem arising in practice since it does not require the expression of Lagrange´s adjoint system and that it can easily implement the inequality constraints on the control variable, In this paper, evolutionary programming is combined with spline method, so the smoother control profile and the Jumping times could be obtained. The optimal profiles obtained by the proposed method are compared with exact solution if it is available. With more complicated model equation, the proposed method showed better performance than other researchers´. It is demonstrated that the evolutionary programming with spline method can ...