• 한국정보교육학회:학술대회논문집
• /
• 2010.01a
• /
• pp.319-325
• /
• 2010

현재의 컴퓨터 교육은 정보화 사회에 필수적으로 필요한 문제해결능력을 키우기 위해 정보교과의 대부분을 차지하던 소프트웨어 활용 중심의 내용을 대폭 축소하고 컴퓨터 과학의 원리에 대한 교육을 강화되고 있다. 이러한 문제해결력을 키우기 위하여 개정된 ICT 운영지침의 컴퓨터 과학 원리에 대한 교육 내용 분석을 통한 알고리즘적 사고 문제 모델을 초등 수학과에 접목시켜 다양한 학습 문제해결 실습을 통하여 알고리즘적 사고 신장의 적합성을 검증 하고자 한다.

• MALSORI
• /
• no.48
• /
• pp.81-91
• /
• 2003

In this paper, we propose a speech recognition method based on independent component analysis (ICA) and spectral enhancement techniques. While ICA tris to separate speech signal from noisy speech using multiple channels, some noise remains by its algorithmic limitations. Spectral enhancement techniques can compensate for lack of ICA's signal separation ability. From the speech recognition experiments with instantaneous and convolved mixing environments, we show that the proposed approach gives much improved recognition accuracies than conventional methods.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.734-740
• /
• 1987

Various kinds of predictive control design methods such as MAC(Model Algorithmic Control), DMC(Dynamic Matrix Control), MC(Extended Horizon Adaptive Control), GPC(Generalized Predictive Control), RHTC(Receding Horizon Tracking Controller), and PVC(PreView Controller) are surveyed and compared in this paper. In addition, stability properties of these control laws known to date are summarized and some new stability results are presented.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.883-886
• /
• 1998

We introduce a high level synthesis methodlogoy for automatic synthesis of asynchronous circuits form a language based on CSP. The input language is a high level concurrent algorithmic specification that can model complex concurrent control flow, logical and arithmetic computation and communications between them. This specification is translated into petri net which has actions. These actions are refined to synthesize the controllers and to allocate the data resources. We use the automatic synthesis through signal transition graphs (STGs) that allows to take advantage of logic synthsis methods to optimize the circuit.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.935-938
• /
• 1991

We are developing an automatic adjusting system for ITC. ITC(Integrated Tube Components) has a large set-by-set variability in its characteristics. And it also has nonlinearities. It requires not only a fast vision process but also an efficient control algorithm to meet the need for high productivity. In this paper, the description of an adjusting system and the modelling of ITC will be presented. And also the concept of a new rule based hierarchical algorithmic approaches will be suggested.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.819-822
• /
• 2003

This paper defines an algorithmic description language in cycle-accurate level which can be used to design hardware components. The proposed language is less complex and more flexible than VHDL language. In that the language includes C-like control flow descriptions and brief timing information(i.e. clock cycle boundaries) indicated by 'wait_edge' statements. We generate RTL VHDL codes from the descriptions. The proposed language requires only 10～30% of the # of lines to describe the same functionality compared with RTL VHDL.

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.819-827
• /
• 2001

An algorithmic approach to degree reduction of B-spline curves is presented. The new algorithms are based on the blossoming spline curves are obtained by the generalized least square method. The computations are carried out by minimizing the $L_2$ distamce between the two curves.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.403-426
• /
• 1998

We present an algorithm to find an approximation for the stationary distribution for the general ergodic spatially-inhomogeneous block-partitioned upper Hessenberg form. Our approximation makes use of an associated upper block-Hessenberg matrix which is spa-tially homogeneous except for a finite number of blocks. We treat the MAP/G/1 retrial queue and the retrial queue with two types of customer as specific instances and give some numerical examples. The numerical results suggest that our method is superior to the ordinary finite-truncation method.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.4
• /
• pp.64-73
• /
• 1992

This paper presents the design of multi-level logic optimization algorithm and the development of the SMILE system based on the algorithm. Considering the fanin constraints in algorithmic level, SMILE performs global and local optimization in a predefined sequence using heuristic information. Designed under the Sogang Silicon Compiler design environment, SMILE takes the SLIF netlist or Berkeley equation formats obtained from high-level synthesis process, and generates the optimized circuits in the same format. Experimental results show that SMILE produces the promising results for some circuits from MCNC benchmarks, comparable to the popularly used multi-level logic optimization system, MIS.