2 단계 다중버퍼 스위치에서의 스케줄링 알고리즘

이상락(Sang-Rak Lee),지남섭(Nam-Sub Ji),김영휘(Young-Hui Kim) 한국통신학회 2000 한국통신학회 학술대회논문집 Vol.2000 No.7

직선 선분의 대칭성을 이용한 수정 브레제남 직선 그리기 알고리즘

이상락(Lee Sang Rak),홍윤식(Hong Youn Sik) 한국정보처리학회 1999 정보처리학회논문지 Vol.6 No.8

A line segment has a symmetrical property about its midpoint. With this symmetrical property for a line segment we have proposed a variant of Bresenhnam's line drawing algorithm that selects two pixels at the same time. It implies that bi-directional line drawing toward the midpoint of line segment from each-end be possible. Besides, it can select two pixels using only one decision parameter, instead of two different parameters for each pixel. We also present a theoretical proof for the correctness of such a selection. Thus, we can reduce the time of generating line segment by approximately less than 5% compared to the Bresenham's method. Also, our experimental results show that the shape of line segment generated by the proposed approach is the exactly same as that of the Bresenham's method.

인공지능 : 전향 차분을 이용한 효율적 곡선 생성 알고리즘

이상락(Lee Sang Rak),심재홍(Sim Jae Hong) 한국정보처리학회 1994 정보처리학회논문지 Vol.1 No.2

Fast curve generation is one of important techniques which facilitate fast process of computer graphics applications. It is possible to resolve the task through hardware or software. But rapid development of computer graphics area need methods for more fast generation of curves. This paper propose a algorithm(called CDAUD), which computers the coordinates of points on curce only with add operations using forward differences and draw the curve fast. It also contains the method for generation of smooth and fully connected curves. Time complexity of CDAUD shows that it is superior than the existing method for constrained case, and it's superiority was validated through experimental implementation.

한국 전통 창문 문살의 컴퓨터 그래픽적 분석

이상락(Sang-Rak Lee) 한국정보기술학회 2008 한국정보기술학회논문지 Vol.6 No.5

This paper aims to reveal that procedural modelings and principles of computer graphics are useful for generation of patterns of Korean traditional window grille. For this purpose we analyzed the pattern of window grille. The results of analysis show that the patterns of window grille are based on such prototile as rectangle and hexagon, and that many of the window patterns can be generated using only rectangle prototile. This fact implies that the procedural modelling can be simplified. Implementation results show that many pictures of patterns of window grille can be generated using those prototiles. Especially some complicated-looking pattern can be generated using only rectangle prototile. We think that the ideas of this paper are very useful for generation, saving, reproduction and variation of pictures of window grille patterns.

월페이퍼 그룹에 의한 한국 전통 문양의 분류

이상락(Sang-Rak Lee) 한국정보기술학회 2010 한국정보기술학회논문지 Vol.8 No.4

Recently many works have been appeared to investigate traditional cultural contents from the viewpoint of science and mathematics. This paper aims to research and classify Korean traditional patterns by wallpaper groups in symmetry theory, and to disclose that what patterns exist in each group. We describe a brief explanation on the theory of symmetry group and wallpaper groups for understanding of this paper. Research for finding the patterns was accomplished through reference books on Korean traditional patterns. Classification results disclosed that each of 13 groups among 17 wallpaper groups has at least one pattern which belongs to them. But for the other 4 remaining groups we could not find any patterns for them. We also applied wallpaper group to the creation of several patterns to demonstrate that the wallpaper group are a useful idea for designing new patterns.

YOLO 인공지능 플랫폼을 이용한 이상행동 감시 시스템

이상락(Sang-Rak Lee),손병수(Byeong-Su Son),박준호(Jun-Ho Park),최병윤(Byeong-Yoon Choi) 한국정보통신학회 2021 한국정보통신학회 종합학술대회 논문집 Vol.25 No.1

본 논문에서는 YOLO 인공 지능 플랫폼을 이용하는 이상행동 감시 시스템을 구현하였으며, YOLO 시스템의 one-shot 감지 시스템 사용으로 기존 감시 시스템에 비해 우수한 응답 특성을 갖는다. YOLO 인공 플랫폼은 폭행, 절도, 방화와 같은 이상행동들로 구성된 이미지 세트로 학습되었다. 이상행동 감시 시스템은 서버와 클라이언트로 구성되어 있으며, 상용화될 경우 각종 범죄 문제를 풀기 위해 스마트시티에 적용이 가능하다. In this paper, abnormal behavior monitoring system using YOLO AI platform was implemented and had superior response characteristics compared to the conventional monitoring system using two-shot detection by using one-shot detection of YOLO system. The YOLO platform was trained using image dataset composed of abnormal behaviors such as assault, theft, and arson. The abnormal behavior monitoring system consists of client and server and can be applicable to smart cities to solve various crime problems if it is commercialized.

압전매트를 이용한 인원계수 알고리즘

이상락(Sang-Rak Lee),이지민(Ji-Min Lee),장시웅(Si-Woong Jang) 한국정보통신학회 2020 한국정보통신학회 종합학술대회 논문집 Vol.24 No.1

전향 차분을 이용한 효율적 곡선 생성 알고리즘

이상락,심재홍,Lee, Sang-Rak,Sim, Jae-Hong 한국정보처리학회 1994 정보처리논문지 Vol.1 No.2

곡선의 신속한 컴퓨터 그래픽의 고속 처리를 가능하게 하는 중요한 기법 중의 하나이다. 이것은 현재 하드웨어나 소프트웨어를 통하여 상당한 효과를 거두고 있으 나 급속한 그래픽의 발전은 보다 빠른 곡선 생성 방법을 요구한다. 본 논문은 전향 차분을 이용하므로써 곡선 상의 점의 좌표를 곱셈을 배제하고 덧셈만으로 계산하여 보다 빨리 곡선을 그릴 수 있는 한 알고리즘(CDAUD라 부름)을 제시한다. CDAUD는 곡선 이 부드럽고 완전하게 연결된 상태로 그려지도록 하는 방안을 포함하고 있다. CDAUD 의 시간 복잡도(time complexity)는 그리는 곡선에 따라 기존의 방법보다 우수한 경 우도 있음을 실험을 통하여 확인할 수 있었다. Fast curve generation is one of important techniques which facilitate fast process of computer graphics applications. It is possible to resolve the task through hardware or software. But rapid development of computer graphics area need methods for more fast generation of curves. This paper propose a algorithm (called CDAUD), which computes the coordinates of points on curve only with add operations using for ward differences and draw the curve fast. It also contains the method for generation of smooth and fully connected curves. Time complexity of CDAUD shows that it is superior than the existing method for constrained case, and it's superiority was validated through experimental implementation.

메치오닌 , 히스티딘 또는 트립토판 첨가한 지렁이 ( Eisenia Foetida ) 고형분 단백질의 가금에서의 생물학적이용

고태송,이상락,오미향 ( Tae Song Koh,Sang Rak Lee,Mi Hyang Oh ) 한국축산학회 1985 한국축산학회지 Vol.27 No.5

In order to observe the biological utilization of earth worm cake protein in chicks, protein-free diet, basal diet containing 15.0% of earth worm cake and diets supplemented with 0.02% of methionine, 0.06% of histidine, 0.02% of methionine+0.06% of histidine or 0.02% of methionine+0.06% of histidine+0.01% of tryptophan in the basal diet, respectively, were prepared. Hatched single comb White Leghorn male chicks were fed on a commercial diet for the first 8 days, protein-free diet for the next 6 days and experimental diets for the subsequent 9 days. Chemical score of earth worm cake protein was 56.3% and the first, second and third limiting amino acids of the protein were methionine, histidine and cystine, respectively, and essential amino acid index was 84.4%. During 9 days of experimental feeding, weight gain, feed intake, protein efficiency ratio(PER), net protein ratio(NPR) and digestibilities of protein were increasing in the birds fed earth worm cake protein supplemented with the methionine. Biological value(BV) and net protein utilization(NPU) of the protein supplemented with the methionine were similar to those of the non-supplemented earth worm cake protein, which were decreasing in the birds fed the other experimental diets. The results indicates methionine will be a limiting amino acid in the earth worm cake protein which were in accordance biological utilization in chicks with the chemical amino acid analysis of earth worm cake protein.

규칙기반 한글 자동 프로그램을 위한 프로그램 변형기법

홍성수,이상락,심재홍,Hong, Seong-Su,Lee, Sang-Rak,Sim, Jae-Hong 한국정보처리학회 1994 정보처리논문지 Vol.1 No.1

초고급 언어에 의한 자동 프로그래밍은 프로그램의 자료구조 이외에 많은 부분을 시스템이 관장함으로써 프로그램 명세의 표현이 추상적이지만 프로그램 의미소가 술 어논리, 집합, 사상, 혹은 제안된 자연언어를 사용하기 때문에 초고급 구조에 익숙하 지 않은 프로그래머들이 이를 이용하여 프로그램을 작성하는 경우 상당한 어려움이 따 르고, 이들 초고급언어 구조에 익숙하기까지 많은 시간이 요하게 된다. 왜냐하면 초 고급언어는 프로그램 명세의 표현이 추상적이지만 프로그램 의미소가 술어 논리, 집합, 사상, 혹은 제한된 자연언어를 사용하기 때문이다. 본 논문에서는 기존의 자동 프로 그램의 어려움을 줄이기 위해서 한글로 구성된 선언적구문, 절차적 구문, aggregate 구문으로 광역언어를 설계하고 구현한다. 본 논문에서는 제안하는 한글 자동 프로그래 밍 시스템(Hangul Automatic Programming)은 입력으로 순수한 한글로 구성되어 있으며 추상 알고리즘(Abstract Algorithm)과 자료형(Data Type)혹은 절차적 구문을 받아서 출력으로는 C 언어 프로그램을 만들어 낸다. 자동 프로그래밍 접근 방식은 프로그램 변형기법과 규칙기반에 바탕을 두고 문제영역은 일반적인 프로그램으로 한정 하였다. 시스템 제어구조는 한글 프로그램을 입력으로 받아서 지식베이스로부터 적절한 규칙 을 선택해서 이것을 변형한 다음 전체 데이타 베이스에 넣는데 이과정을 프로그램이 완성 될 때 까지 반복한다. It is very difficult for a nonprofessional programmer in Koera to write a program with very High Level Language such as, V,REFINE, GIST, and SETL, because the semantic primitives of these languages are based on predicate calculus, set, mapping, or testricted natural language. And it takes time to be familiar with these language. In this paper, we suggest a method to reduce such difficulties by programming with the declarative, procedural constructs, and aggregate constructs. And we design and implement an experimental knowledge-based automatic programming system. called HAPS(Hangul Automatic Program System). HAPS, whose input is specification such as Hangul abstract algorithm and datatype or Hangul procedural constructs, and whose output is C program. The method of operation is based on rule-based and program transformation technique, and the problem transformation technique. The problem area is general problem. The control structure of HAPS accepts the program specification, transforms this specification according to the proper rule in the rule-base, and stores the transformed program specification on the global data base. HAPS repeats these procedures until the target C program is fully constructed.