• Title/Summary/Keyword: Algorithms and Programming

Search Result 468, Processing Time 0.022 seconds

POLYNOMIAL CONVERGENCE OF PRIMAL-DUAL ALGORITHMS FOR SDLCP BASED ON THE M-Z FAMILY OF DIRECTIONS

  • Chen, Feixiang
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.1_2
    • /
    • pp.127-133
    • /
    • 2012
  • We establish the polynomial convergence of a new class of path-following methods for SDLCP whose search directions belong to the class of directions introduced by Monteiro [3]. We show that the polynomial iteration-complexity bounds of the well known algorithms for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP.

Implementation of advanced control algorithms for a power plant boiler system (발전소 보일러 제어용 진보된 제어 알고리즘의 구현)

  • 김성우;서창준;김병국
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.281-286
    • /
    • 1992
  • This paper describes a duplexed process control system for a boiler-turbine system of power plant, which is composed of supervisor, controller, and simulater subsystems. Its embeded POL(Problem oriented language) as a structured control language enables this system to do a real-time distributed control and fault diagnosis by simple programming with the actual implementation of advanced control algorithms such as PID autotuning and GPC, etc, the performance of overall system has been greatly enhanced.

  • PDF

AN EFFICIENT PRAM ALGORITHM FOR MAXIMUM-WEIGHT INDEPENDENT SET ON PERMUTATION GRAPHS

  • SAHA ANITA;PAL MADHUMANGAL;PAL TAPAN K.
    • Journal of applied mathematics & informatics
    • /
    • v.19 no.1_2
    • /
    • pp.77-92
    • /
    • 2005
  • An efficient parallel algorithm is presented to find a maximum weight independent set of a permutation graph which takes O(log n) time using O($n^2$/ log n) processors on an EREW PRAM, provided the graph has at most O(n) maximal independent sets. The best known parallel algorithm takes O($log^2n$) time and O($n^3/log\;n$) processors on a CREW PRAM.

A Study on Solution Methods of Two-stage Stochastic LP Problems

  • Lee, Sang-Jin
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.1
    • /
    • pp.1-24
    • /
    • 1997
  • In this paper, we have proposed new solution methods to solve TSLP (two-stage stochastic linear programming) problems. One solution method is to combine the analytic center concept with Benders' decomposition strategy to solve TSLP problems. Another method is to apply an idea proposed by Geoffrion and Graves to modify the L-shaped algorithm and the analytic center algorithm. We have compared the numerical performance of the proposed algorithms to that of the existing algorithm, the L-shaped algorithm. To effectively compare those algorithms, we have had computational experiments for seven test problems.

  • PDF

Realizing TDNN for Word Recognition on a Wavefront Toroidal Mesh-array Neurocomputer

  • Hong Jeong;Jeong, Cha-Gyun;Kim, Myung-Won
    • Journal of Electrical Engineering and information Science
    • /
    • v.1 no.1
    • /
    • pp.98-107
    • /
    • 1996
  • In this paper, we propose a scheme that maps the time-delay neural network (TDNN) into the neurocomputer called EMIND-II which has the wavefront toroidal mesh-array structure. This neurocomputer is scalable, consists of many timeshared virtual neurons, is equipped with programmable on-chip learning, and is versatile for building many types of neural networks. Also we define the programming model of this array and derive the parallel algorithms about TDNN for the proposed neurocomputer EMIND-II. In addition, the computational complexities for the parallel and serial algorithms are compared. Finally, we introduce an application of this neurocomputer to word recognition.

  • PDF

Survey the Researches of "Programming Curriculum" and Evaluation with Outcome Criterion (「프로그래밍 교육 과정」 연구에 대한 분석과 성취기준 부합도 평가)

  • Kim, JiSoo;Kim, JeongAh
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.5
    • /
    • pp.235-244
    • /
    • 2017
  • As creativity and problem-solving ability become core competencies, the main objectives of programming subjects in the elementary and secondary educational curriculum is 'computational thinking'. This goal can not be achieved at the level of understanding the characteristics of the programming language and the simple utilization abilities of the computer. The abilities to write algorithms and solve problems in real life situations using programming languages are required. In order to cultivate these abilities, the curriculum of the programming area was strengthened in the elementary and middle education curriculum, and the criteria for evaluating the achievement level were also prepared. However, the curriculum that can be used in actual education field is not yet established. In this study, we analyzed the researches on the existing programming curriculum and evaluated how well the curriculum meets the achievement criteria. Also, we can suggest the aspects to be considered in the study of programming curriculum and to verify whether the results of curriculum operation are in line with achievement criteria. In addition, future directions in elementary and middle school programming curriculum are suggested.

Case Studies of Developing Creativity through Integrating Algorithmic Teaching into Mathematical Activities

  • Peng Aihui
    • Research in Mathematical Education
    • /
    • v.9 no.4 s.24
    • /
    • pp.341-350
    • /
    • 2005
  • In this increasingly technological world, the creativity development has been highlighted much in many countries. In this paper, two mathematical activities with Chinese characteristics are presented to illustrate how to integrate algorithmic teaching into mathematical activities to develop students' creativity. Case studies show that the learning of algorithm can be transferred into creative learning when students construct their own algorithms in Logo environment rather than being indoctrinated the existing algorithms. Creativity development in different stages of mathematical activities and creativity development in programming are also discussed.

  • PDF

Analysis of Japanese elementary school mathematics textbooks and digital contents on programming education (프로그래밍 교육 관련 일본 초등학교 수학 교과서 및 디지털 콘텐츠 분석)

  • Kwon, Misun
    • Education of Primary School Mathematics
    • /
    • v.27 no.1
    • /
    • pp.57-74
    • /
    • 2024
  • This paper analyzed the programming education specialized lessons presented in two types of elementary school mathematics textbooks according to the revised Japanese curriculum in 2017. First, this paper presented in detail how each activity is connected to Korean mathematics areas, what elements of mathematics can be learned through programming education, how each activity is structured, and how the actual programming according to the textbook activities is structured. In Japanese textbooks, geometry and measurement areas were presented the most among Korean mathematics content areas, and mathematical elements such as sequences, rules, and algorithms were most implemented for learning. Digital learning tools that make up actual programming present more elements than those presented in the textbooks and are presented in great detail so that students can do actual programming. Lastly, in blocks, motion, control, and calculation blocks were used a lot. Based on these research results, this study provides implications when conducting programming-related education in Korea.

A PC Operated Off-Line Programming System for SCARA Robots (PC에서 운용되는 스카라형 로보트의 오프-라인 프로그래밍 시스템)

  • Park, Min-Jo;Son, Kwon;Ahn, Doo-Sung
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.2
    • /
    • pp.568-579
    • /
    • 1995
  • An off-line programming (OLP) system was proposed and developed in order to save cost and time in adjusting a robot to new workcells or applying new algorithms to actual trajectory planning. The developed OLP system was especially designed to be operated in a PC level host computer. A SCARA robot with four axes was selected as an objective robot. The OLP system developed in this study consisted of such modules as data base, three-dimensional graphics, kinematics, trajectory planning, dynamics, control, and commands. Each module was constructed to form an independent unit so that it can be easily modified or improved. The OLP system was programmed for a graphic user interface in Borland $C^{++}$ language. Some of system operating commands and an interpreter were devised and used for more convenient programming of robot simulations.s.

Comparison & Analysis of Algorithms in BASIC (BASIC 활용을 위한 분류알고리즘의 비교 분석)

  • Kang, Seong-Mo
    • Journal of The Korean Association For Science Education
    • /
    • v.7 no.2
    • /
    • pp.37-43
    • /
    • 1987
  • Computer in one of the most tremendous achievements of the modern scientific technique. Not only in government, business, research and education but in our daily life. computers are widely utilized to assist in solving various problems. With increasing frequency, it is recognized that a right understanding of the computer is necessary: naturally, this recognition places a great emphasis on the computer education. In Korea computer is chosen either as an optional subject or as a kind of group activity in many schools. It is the purpose of this study to compare and analyze the internal sorting algorithms which are used frequently in data processing. and to present the results of program analysis. which will make it possible to choose the appropriate sorting algorithm for each data processing. Generally the algorithms are coded in a language appropriate for structured programming. like PASCAL: however, here the algorithms are expressed in BASIC which is widely used with the personal computers so that the students and the teachers may understand them easily.

  • PDF