• Title/Summary/Keyword: 동적프로그래밍

Search Result 248, Processing Time 0.029 seconds

Incremental Interpreter based on Action Equations (작용 식 기반 점진 해석기)

  • Han, Jeong-Ran;Lee, Gi-Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.8
    • /
    • pp.1018-1027
    • /
    • 1999
  • 속성 문법은 언어의 정적인 의미구조를 표현하는 형식적인 표기법으로 동적인 의미구조를 표현하기는 부적절하다. 동적 의미구조를 잘 명세하고 명세된 언어를 구현하기 위해서 기존의 속성 문법을 확장하여 언어 구현에 필요한 동적인 작용들(actions)을 잘 표현해야 한다. 본 논문에서는 속성 문법을 확장하여 정적이고 동적인 의미구조를 잘 표현할 수 있는 새로운 작용 식(action equation)을 제시한다. 제시된 작용 식(action equation)의 동적인 의미 구조로 부터 SIMP 언어의 점진 해석기(incremental interpreter)를 설계하고 구현한다. 점진 해석기는 언어 기반의 프로그래밍 환경에서 수정된 부분만을 번역하여 프로그램의 전체 실행 결과를 얻는 해석기를 의미한다. 본 해석기는 SUN 1000에서 Lex와 Yacc을 사용해서 C 언어로 설계하고 구현하였다. 예제 프로그램을 실행시켰을 때 배정 문이나 IF문의 경우는 매우 효율적이었고 Loop의 경우는 재실행될 필요가 있는 영향받는 명령문들이 적을수록 점진 해석이 더 효율적으로 수행된다.Abstract Attribute grammars are a formal notation which expresses the static semantics of programming languages, but they are not suitable for expressing dynamic semantics. To describe dynamic semantics and implement a specified language, we extend attribute grammars and present new action equations which describe static and dynamic semantics. The incremental interpreter of a SIMP language is designed and implemented from the dynamic semantics of presented action equations. The incremental interpreter is to translate only modified part in the language-based programming environments and have results of whole program.Our interpreter is implemented in C with Lex and Yacc on SUN 1000. When we execute example programs, the incremental evaluation of any assignment and IF statements executes efficiently. But in the case of loop, we execute efficiently when the effected statements to be reexecuted in the loop are of small number.

A Design Method for Dynamic Selection of SOA Services (SOA 서비스의 동적 선택 설계 기법)

  • Bae, Jeong-Seop;La, Hyun-Jung;Kim, Soo-Dong
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.2
    • /
    • pp.91-104
    • /
    • 2008
  • Service-Oriented Computing (SOC) is the development method that published services are selected and composed at runtime to deliver the expected functionality to service clients. SOC should get maximum benefits not only supporting business agility but also reducing the development time. Services are selected and composed at runtime to improve the benefits. However, current programming language, SOC platforms, business process modeling language, and tools support either manual selection or static binding of published services. There is a limitation on reconfiguring and redeploying the business process to deliver the expected services to each client. Therefore, dynamic selection is needed for composing appropriate services to service clients in a quick and flexible manner. In this paper, we propose Dynamic Selection Handler (DSH) on ESB. we present a design method of Dynamic Selection Handler which consists of four components; Invocation Listener, Service Selector, Service Binder and Interface Transformer. We apply appropriate design patterns for each component to maximize reusability of components. Finally, we describe a case study that shows the feasibility of DSH on ESB.

FPGA Prototype Design of Dynamic Frequency Scaling System for Low Power SoC (저전력 SoC을 위한 동적 주파수 제어 시스템의 FPGA 프로토타입 설계)

  • Jung, Eun-Gu;Marculescu, Diana;Lee, Jeong-Gun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.11
    • /
    • pp.801-805
    • /
    • 2009
  • Hardware based dynamic voltage and frequency scaling is a promising technique to reduce power consumption in a globally asynchronous locally synchronous system such as a homogeneous or heterogeneous multi-core system. In this paper, FPGA prototype design of hardware based dynamic frequency scaling is proposed. The proposed techniques are applied to a FIFO based multi-core system for a software defined radio and Network-on-Chip based hardware MPEG2 encoder. Compared with a references system using a single global clock, the first prototype design reduces the power consumption by 78%, but decreases the performance by 5.9%. The second prototype design shows that power consumption decreases by 29.1% while performance decreases by 0.36%.

A study on the use of continuous spectrum in problem solving in a dynamic geometry environment (동적 기하 환경의 문제 해결 과정에서 연속 스펙트럼 활용에 대한 소고)

  • Heo, Nam Gu
    • The Mathematical Education
    • /
    • v.60 no.4
    • /
    • pp.543-554
    • /
    • 2021
  • The dynamic geometric environment plays a positive role in solving students' geometric problems. Students can infer invariance in change through dragging, and help solve geometric problems through the analysis method. In this study, the continuous spectrum of the dynamic geometric environment can be used to solve problems of students. The continuous spectrum can be used in the 'Understand the problem' of Polya(1957)'s problem solving stage. Visually representation using continuous spectrum allows students to immediately understand the problem. The continuous spectrum can be used in the 'Devise a plan' stage. Students can define a function and explore changes visually in function values in a continuous range through continuous spectrum. Students can guess the solution of the optimization problem based on the results of their visual exploration, guess common properties through exploration activities on solutions optimized in dynamic geometries, and establish problem solving strategies based on this hypothesis. The continuous spectrum can be used in the 'Review/Extend' stage. Students can check whether their solution is equal to the solution in question through a continuous spectrum. Through this, students can look back on their thinking process. In addition, the continuous spectrum can help students guess and justify the generalized nature of a given problem. Continuous spectrum are likely to help students problem solving, so it is necessary to apply and analysis of educational effects using continuous spectrum in students' geometric learning.

A Structured Reactive Robot Programming Language for Knowledge-Based Intelligent Robots (지식 기반 지능형 로봇의 행위 지정을 위한 구조적 반응 언어)

  • Lee, Jae-Ho;Kwak, Byul-Saim
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.5
    • /
    • pp.370-377
    • /
    • 2010
  • An Intelligent service robot performs various complex tasks in dynamic environment, providing useful intelligent services for human users. The robot needs to continuously monitor dynamically changing environment and reactively choose the best behavior for the changing context. The selected behaviors may include nondeterministic or parallel actions. In this paper, we present a structured reactive robot programming language, SPRIT that is based on Structured Circuit Semantics (SCS). SPRIT is fully implemented as a task executor and tested for reactive robot tasks in dynamic environment to show that it can be used to explicitly represent and effectively implement the complex reactive behaviors of intelligent robot systems.

Train Booking Agent with Adaptive Sentence Generation Using Interactive Genetic Programming (대화형 유전 프로그래밍을 이용한 적응적 문장생성 열차예약 에이전트)

  • Lim, Sung-Soo;Cho, Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.12 no.2
    • /
    • pp.119-128
    • /
    • 2006
  • As dialogue systems are widely required, the research on natural language generation in dialogue has raised attention. Contrary to conventional dialogue systems that reply to the user with a set of predefined answers, a newly developed dialogue system generates them dynamically and trains the answers to support more flexible and customized dialogues with humans. This paper proposes an evolutionary method for generating sentences using interactive genetic programming. Sentence plan trees, which stand for the sentence structures, are adopted as the representation of genetic programming. With interactive evolution process with the user, a set of customized sentence structures is obtained. The proposed method applies to a dialogue-based train booking agent and the usability test demonstrates the usefulness of the proposed method.

Structure Pruning of Dynamic Recurrent Neural Networks Based on Evolutionary Computations (진화연산을 이용한 동적 귀환 신경망의 구조 저차원화)

  • 김대준;심귀보
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.7 no.4
    • /
    • pp.65-73
    • /
    • 1997
  • This paper proposes a new method of the structure pruning of dynamic recurrent neural networks (DRNN) using evolutionary computations. In general, evolutionary computations are population-based search methods, therefore it is very useful when several different properties of neural networks need to be optimized. In order to prune the structure of the DRNN in this paper, we used the evolutionary programming that searches the structure and weight of the DRNN and evolution strategies which train the weight of neuron and pruned the net structure. An addition or elimination of the hidden-layer's node of the DRNN is decided by mutation probability. Its strategy is as follows, the node which has mhnimum sum of input weights is eliminated and a node is added by predesignated probability function. In this case, the weight is connected to the other nodes according to the probability in all cases which can in- 11:ract to the other nodes. The proposed pruning scheme is exemplified on the stabilization and position control of the inverted-pendulum system and visual servoing of a robot manipulator and the effc: ctiveness of the proposed method is demonstrated by numerical simulations.

  • PDF

Prediction-based Dynamic Thread Pool Model for Efficient Resource Usage (효율적인 자원 사용을 위한 예측기반 동적 쓰레드 풀 기법)

  • 정지훈;한세영;박성용
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.3_4
    • /
    • pp.213-223
    • /
    • 2004
  • A dynamic thread pool model is one of a multi-thread server programming model that handles many requests from users concurrently. In most cases, bounded thread pool model is used for server programming. Because it reduces a thread overhead by creating a pool of threads in advance, it ran response more quickly to users' requests. But this model always occupies system resource when there are small amount of requests, which prevents other applications from using available resources. In this paper, for the utilization of occupied but unused resources, we proposed and implemented a prediction-based dynamic thread pool scheme using customized exponential average. From the experiments, we show that this scheme outperforms hounded thread pool model and uses small resources.

Configuration of Audio-Visual System using Visual Image (이미지를 활용한 오디오-비쥬얼 시스템 구성)

  • Seo, June-Seok;Hong, Sung-Dae;Park, Jin-Wan
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.6
    • /
    • pp.121-129
    • /
    • 2008
  • With the help of information technology The problem of building a concrete form with a shapeless media is the starting point of presenting information by means of sound. Audio-Visual System using sound as a medium is a method that presents an auditory material visually and has a role of linking different sensory organs. In a sense, Audio-Visual System transfers a non-concrete sensation to a concrete one. Audio-Visual System presentation by late methods using active and non-active images produced by computerized irregular procedures can be limited because of the limited ways of visual output. On the other side, visualization using active images can induce more diverse expressions using sound as a medium. This study suggests a new way of expression in animations using visualization of various auditory materials and sounds built by Audio-Visual System with active images.

Design and Implementation of Data Binder for Dynamic Data Delivery in Healthcare Service (헬스케어 서비스에서 동적인 데이터 전달을 위한 데이터 결합기 설계 및 구현)

  • Kang, Kyu-Chang;Lee, Jeun-Woo;Choi, Hoon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.12
    • /
    • pp.891-898
    • /
    • 2009
  • This paper suggests producer/consumer-based Data Binder enabling applications and biomedical devices developed by mutually different vendors to transfer data dynamically. Data Binder is implemented as a bundle of OSGi platform providing component-based programming model and service-oriented operation architecture. Data Binder complements the disadvantage of OSGi WireAdmin service enabling static data delivery between a producer and a consumer of data. Data Binder normalizes an application requirement as an application descriptor and a device capability as a device descriptor so that it enables dynamic data delivery by making data producer/consumer pair in runtime. Therefore, Data Binder can be used as a connection management of a data link between a data producer and a data consumer in sensor-based application development. The object of this paper is to provide the facility of the healthcare service development by separating a data producer such as a biomedical device from a data consumer such as a healthcare application.