• Journal of the Korean Graphic Arts Communication Society
• /
• v.2 no.1
• /
• pp.35-43
• /
• 1984

Shince the introduction of machine methods into industry a problem has existed which has never been adequately solved. .... That is to say, there is no difference between the essential qualities of Machine art and abstract art, which is the main style of fine arts in the present day. This problem has been discussed by John Ruskin, William Morris, Herbert Read. In this study, I discussed the artistic value in the modern graphic arts from the standpoint of Herbert Read on the machine art. According to the above-mentioned discussings, we can come to the conclusion as follows 1) The machine art lie at the root of abstract art, and whenever the final product of machine is designed or determined by anyone sensitive to formal values, that product can and does become an abstract work of art in the subtler sense of the term. 2) We must recognize that graphic design is a function of the abstract artist, and the abstract artist must be given a place in the graphic arts in which be is not already established, and his decision on all questions of design must be final. 3) Therefore, the graphic designer must have therough knowledge of graphic arts technology in order to give the artistic value to the objects of machine production.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.450-455
• /
• 1996

Emotional intelligence is investigated in terms of a composing machine as a modern abstract art form. Music has the longest tradition of being an art form which has an explicit formal foundation. Formal aspects of traditional and modern music theory are explained in terms of simple numerical relationship and illustrated with examples. The exploration of art in the view of intelligence, information and structure will restore the balanced sense of art and science which seeks happiness in life.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.3
• /
• pp.276-286
• /
• 1988

In this paper, HLML-C (High Level Microprogramming Language C) is proposed, which is independent of target machines and has similar strucrure to C language. The HLML-C operations are defined for a abstract machine which contains characteristics of various microarchitectures, and can extend to define a target machine's special operations for efficient microcode generation. A microprogram written in this language is translated into a machine independent intermediate language on abstract machine with the information of a target machine's resource usage and then microoperations of a target machine. The HLML-C compiler is implemented with yacc and C language on VAX-11/750 (4.3 BSD) computer. Through the various test microprogram applied to HLML-C compiler, their results are analyzed.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.4 s.97
• /
• pp.85-94
• /
• 1999

Reconfiguration, expansion, or new establishment of FMS requires the availability of a shop floor control (SFC) system relevant to the FMS since it is closely related with the hardware component of FMS. Due to the expensive cost of its development, significant research efforts have been made to develop an SFC system that is reusable. This paper presents Abstract Machine Tool (AMT) approach applied to develop an SFC sytem that is reusable without additional programming. The AMT model enables us to design the SFC system independently of the hardware-dependent attributes of euqipment; an AMT models a workstation by abstraction and presents an equipment-independent interface to machining cell controller. Specifically, we describe how we formalize the interfaces among equipment in order to build an AMT and how we design the machining cell control software based on AMT models. We also present MACHINIST the machining cell control system for IAE-FMS plant as an implementation example.

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

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

• Journal of Korea Multimedia Society
• /
• v.9 no.9
• /
• pp.1247-1256
• /
• 2006

VM(Virtual Machine) can be considered as a software processor which interprets the abstract machine code. Also, it is considered as a conceptional computer that consists of logical system configuration. But, the execution speed of VM system is much slower than that of a real processor system. So, it is very important to optimize the code for virtual machine to enhance the execution time. In this paper, we designed and implemented the optimizer for the virtual(or abstract) machine code(VMC) which is actually SIL(Standard Intermediate Language) that is an intermediate code of EVM(Embedded Virtual Machine). The optimizer uses the pattern matching optimization techniques reflecting the characteristics of the VMC as well as adopting the existing optimization methodology. Also, we tried a benchmark test for the VMC optimizer and obtained reasonable results.

• International journal of advanced smart convergence
• /
• v.13 no.2
• /
• pp.48-60
• /
• 2024

With the exponential growth of satellite data utilization, machine learning has become pivotal in enhancing innovation and cybersecurity in satellite systems. This paper investigates the role of machine learning techniques in identifying and mitigating vulnerabilities and code smells within satellite software. We explore satellite system architecture and survey applications like vulnerability analysis, source code refactoring, and security flaw detection, emphasizing feature extraction methodologies such as Abstract Syntax Trees (AST) and Control Flow Graphs (CFG). We present practical examples of feature extraction and training models using machine learning techniques like Random Forests, Support Vector Machines, and Gradient Boosting. Additionally, we review open-access satellite datasets and address prevalent code smells through systematic refactoring solutions. By integrating continuous code review and refactoring into satellite software development, this research aims to improve maintainability, scalability, and cybersecurity, providing novel insights for the advancement of satellite software development and security. The value of this paper lies in its focus on addressing the identification of vulnerabilities and resolution of code smells in satellite software. In terms of the authors' contributions, we detail methods for applying machine learning to identify potential vulnerabilities and code smells in satellite software. Furthermore, the study presents techniques for feature extraction and model training, utilizing Abstract Syntax Trees (AST) and Control Flow Graphs (CFG) to extract relevant features for machine learning training. Regarding the results, we discuss the analysis of vulnerabilities, the identification of code smells, maintenance, and security enhancement through practical examples. This underscores the significant improvement in the maintainability and scalability of satellite software through continuous code review and refactoring.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.4
• /
• pp.189-195
• /
• 2018

With the advent of the digital age, production and distribution of web pages has been exploding. Internet users frequently need to extract specific information they want from these vast web pages. However, it takes lots of time and effort for users to find a specific information in many web pages. While search engines that are commonly used provide users with web pages containing the information they are looking for on the Internet, additional time and efforts are required to find the specific information among extensive search results. Therefore, it is necessary to develop algorithms that can automatically extract specific information in web pages. Every year, thousands of international conference are held all over the world. Each international conference has a website and provides general information for the conference such as the date of the event, the venue, greeting, the abstract submission deadline for a paper, the date of the registration, etc. It is not easy for researchers to catch the abstract submission deadline quickly because it is displayed in various formats from conference to conference and frequently updated. This study focuses on the issue of extracting abstract submission deadlines from International conference websites. In this study, we use three machine learning models such as SVM, decision trees, and artificial neural network to develop algorithms to extract an abstract submission deadline in an international conference website. Performances of the suggested algorithms are evaluated using 2,200 conference websites.

• Proceedings of the KWS Conference
• /
• 1993.10a
• /
• pp.1-12
• /
• 1993

No Abstract, See Full Text

• 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.