• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.25-32
• /
• 2007

In this paper, the abstract layer for motion capture system is designed and implemented to meet the various hardware and different capturing method. The abstract layer can offer the unified programming by providing device independent API(Application Programming Interface). The device drivers of the optical system and mechanical system are emulated to verify the designed abstract layer. The optical system employs the AOA Ole while the mechanical system uses BVH file. An application program is written to call the abstract layer functions to drive both optical and mechanical drivers and receive the frame data, simulated motion data, that are displayed sequentially on the computer screen by utilizing Direct3D.

• Journal of KIISE:Software and Applications
• /
• v.29 no.5
• /
• pp.326-335
• /
• 2002

Recently there have been a number of researches to provide code mobility to lazy functional language (LFL) programs by translating LFL programs to Java programs. These approaches are basically baled on architectural similarities between abstract machines of LFLs and Java. The abstract machines of LFLs and Java programming language, Spineless Tagless G-Machine(STGM) and Java Virtual Machine(JVM) respectively, share important common features such as built- in garbage collector and stack machine architecture. Thus, we can provide code mobility to LFLs by translating LFLs to Java utilizing these common features. In this paper, we propose a new translation scheme which fully utilizes architectural common features between STGM and JVM. By redefining STGM as an eval-apply evaluation model, we have defined a new translation scheme which utilizes Java Virtual Machine Stack for function evaluation and totally eliminates stack simulation which causes array manipulation overhead in Java. Benchmark program translated to Java programs by our translation scheme run faster on JDK 1.3 than those translated by the previous schemes.

• Journal of KIISE:Software and Applications
• /
• v.28 no.12
• /
• pp.955-965
• /
• 2001

We propose a systematic method of compiling Haskell based on the spineless Tagless G-machine (STGM) for the Java, Virtual Machine (JVM) We introduce an intermediate language called L-code to identify each micro-operation of the machine by its instruction, Each macro operation of the machine is identified by a binding Each instruction of the L-code can be easily translated into Java statements. After our determination on representation and L-code program from a STG program is translated into Java program according to out compilation rules. Our experiment shows that the execution times of translated benchmarks are competitive compared with those in Haskell interpreter Hugs, particularly when Glasgow Haskell compiler's STG -level optimizations are applied.

• Journal of Intelligence and Information Systems
• /
• v.10 no.2
• /
• pp.165-187
• /
• 2004

Constraint Programming in AS and Optimization in OR started and have grown in different backgrounds to solve common decision-making problems in real world. This paper tries to integrate results from those different fields by suggesting a hybrid solver as an integration framework. Starting with an integrating modeling language, a way to implement a hybrid solver will be discussed using Warren's abstract machine and an finite domain constraint programming solver structures. This paper will also propose some issues rising when implementing the hybrid solver and provide their solutions.

• Korean Institute of Interior Design Journal
• /
• v.15 no.3 s.56
• /
• pp.201-210
• /
• 2006

Among the architects who use diagrams as a digital design process, especially through Peter Eisenman and Ben van Berkel's works, we have specifically got the meaning of their diagrams. Their diagrams act as 'the block of becoming' and we can regard the diagrams not only as a tool of devenir including architect's root thoughts beyond a tool of schematic presentation, but also as architect's intention including devenir thought. And in the case of diagrams which the architects use, we can recognize that architects' intentions are to think that Deleuze's 'machine abstraite' evolve the diagram into various and transformed form. That is to say, Peter Eisenman interprets the machine abstraite as a root thought of devenir by using diagram as medium to reveal the virtual. And Ben van Berkel transforms the diagram by including all external conditions into selected diagram which shows the abstract relations to the elements. We can get the meaning of the machine abstraite from these cases well. This study will play an important role in giving good usage of the diagram in making a form of contemporary digital architecture and showing the direction of form creation field.

• Communications of Mathematical Education
• /
• v.14
• /
• pp.163-176
• /
• 2001

대부분의 수학 수업이 알고리즘을 숙달시키고, 기계적으로 익힌 절차에 의해 정답을 맞추는 것에 중점을 두어 왔기 때문에, 학생들은 수학은 딱딱하고 어렵고 재미없는 과목이라는 인식을 많이 하고 있다. 그러나, 수학 수업에서 수학 교구의 조작 활동을 한다면 수학적인 흥미를 유발할 수 있을 뿐만 아니라 추상과 형식적인 수학으로의 발달을 돕고 학생들이 활동적으로 수업에 참여할 수 있게 된다. 이러한 맥락에서 제 7차 교육과정의 '도형'영역에서는 조작 활동을 통한 자기 학습능력 개발에 중점을 두고 주위의 실제 생활에서 볼 수 있는 사물을 관찰하여 그 성질을 추상해 낼 수 있도록 구체적인 교구를 이용하는 조작 활동을 강조하고 있다. 본 연구에서는 이러한 관점에서 정규 수학 수업이 아닌 일선학교의 클럽 활동 시간을 이용하여 학생들이 수학 교구를 충분히 조작하고 활용할 시간을 제공하며, 학생들이 수학 교구의 조작 활동을 통한 클럽활동이 학생들의 수학적 성향 및 능력 수준에 따른 도형 학습능력에 어떠한 변화를 미치는 지를 사례를 중심으로 논의하고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.477-479
• /
• 2000

최근 대부분의 시스템은 즉각적인 정보를 요구하는 실시간 시스템이다. 실시간 시스템은 오류에 대한 유연적인 대체를 필요로 하는 내고장성 시스템(fault tolerant system)의 개념을 지향한다. 내고장성 시스템은 보다 정확한 시스템 설계가 중요하며, 특히 실시간 시스템에서 필요로 하는 여러 종류의 시간제약에 대한 풍부한 표현력과 명세된 시간에 대한 검증이 중요하다. 본 논문은 특정 시점과 시간 간격, 주기, 이산 시간, 다수의 타이머에 의한 동적 등의 시간 관련 동작을 ATM(Abstract Timed Machine)에 기반으로 명세하고 명세된 시간에 대한 분석을 살펴본다.

• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.926-939
• /
• 2002

The formal specification methods with probability have been demanded in the area of fault real-time systems, in order to specify the uncertainty that the systems can encounter during their execution due to various environmental factors. This paper presents a new formal method with probability. namely Probabilistic Abstract Timed Machine (PATM), in order to analyze and predict system's behavior in dynamical environmental changes, This method classifies the factors into two classes: the variable and the constant. The analysis of system's behavior is performed on the probabilistic reachability graph generated from the ATM specification for the system. The analysis can predict any possibility that the behavior may not satisfy some safety requirements of the system, indicate which variable factors cause such satisfaction, and further recover from this unsatisfying fault state by fixing the variable factors. Consequently the reliability to the fault real-time systems can be improved.

• Applied Microscopy
• /
• v.39 no.2
• /
• pp.141-147
• /
• 2009

The antennae of millipedes have a prominent function in detecting various types of environmental stimuli, and structural modification of the antennae is closely associated with the degree of sense recognition. Although the biological significance of the antennal sensillae to millipedes are widely understood, the structure and function of the antennal sensillae are still not clear and more precise analysis is required. We have analysed the ultrastructural characteristics of the antennal sensillae in a millipede Anaulaciulus koreanus koreanus using field emission scanning electron microscopy (FESEM). According to their morphological and substructural features, we could identify three different types of antennal sensillae as follows: trichoid sensilla (TS), chaetiform sensilla (CS) and basiconic sensilla (BS). The TS on the articles are long, blunt-tipped, almost straight hairs with deep longitudinal grooves in their lower parts whereas, the CS are long, sickleshaped bristles with longitudinal grooves acuminating toward the tip. The BS can be subdivided further into three subtypes which are the large-sized basiconic sensilla ($BS_1$), the small-sized basiconic sensillae ($BS_2$) and the spiniform basiconic sensillae ($BS_3$). The BS between the terminal segment and distal margins of the other segments are clearly discriminated in this species.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.326-328
• /
• 2000

본 논문에서는 지연계산기반 함수형 언어 프로그램을 받아 Java 프로그램을 목적 코드로 생성하는 컴파일러를 설계하고 구현한다. 이 컴파일러는 제한된 형태의 함수형 언어 Shared Term Graph(STG)를 입력언어로 하는 추상기계 Spineless Tagiess G-Machine (STGM)을 수행 모델로 한다. 본 논문에서는 명령형 언어 L-code를 제안하고 이를 입력언어로 하는 새로운 형태의 STGM인 L-Machine을 제안한다. STG 언어를 L-code로 변환하는 컴파일러와 L-code를 Java로 변환하는 컴파일러를 설계하고 구현함으로써 원하는 컴파일러를 구성한다. 그리고 Glasgow Haskell 컴파일러를 전단부로 하여 지연계산 기반 함수형 언어 Haskell로 작성된 프로그램들을 컴파일하여 STG 프로그램으로 변환한 다음 본 논문에서 구현한 컴파일러로 이를 Java 프로그램으로 변환한다. 변환된 Java 프로그램을 Sun JIT 컴파일러로 컴파일하여 수행한 성능 평가 결과를 제시한다.