• The Journal of the Convergence on Culture Technology
• /
• v.8 no.2
• /
• pp.361-366
• /
• 2022

There are several ways to process large amounts of data. Depending on the processing method, there is a big difference in processing speed to create a large data list. Typically, to make a large data list, large data is converted into a normalized query, and the result of the query is stored in a List Map and converted into a printable form. This process occurs as a cause of lowering the processing speed step by step. In the process of storing the results of the created query as a List Map, the processing speed differs because the data is stored in a different format for each type of data. Through the simultaneous processing of GO language, we want to solve the problem of the existing difference in processing speed. In other words, it compares the results of GO language concurrency processing by providing how different and how it proceeds between the format contained in the existing List Map and the method of processing using concurrency in large data lists for faster processing. do.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.421-426
• /
• 2001

A formal development method is used to develop software rigorously and systematically. In a formal development method, we specify system by a formal specification language and gradually develop the system more concretely until we can implement the system. VDM is one of formal specification languages. VDM uses mathematical data structures such as sets, sequences, and maps to specify the system, but most programming languages do not have such data structures. Therefore, these data structures should be converted. We can convert mathematical data structures in VDM to a linked list, a data structure in a programming language. In this article, we propose a method to convert a set, a sequence, and a map in VDM to a linked list in a programming language and prove the correctness of this conversion mathematically.

• Proceedings of the CALSEC Conference
• /
• 1999.07a
• /
• pp.207-213
• /
• 1999

When function modeling with IDEF0 which is called as a standard methodology for CALS (FIPS 183), the initial work is to determine the purpose and viewpoint, and the next work is to generate a data list and an activity list. This work requires participant's discussion and agreements. The main problems for these working are a communication between participants and efficient discussion processing. Brainstorming is the most useful method for this work. The paper is for development for the modeling assistant tool to promote the business modeling. In this paper, we will introduce the tool which name is 'MindMapper' and 'Dyna-IDEF'. Mind-mapper is software for mind-map method that is used for creative thinking. Using this tool, we refine the result of the brainstorming about activity list and translate the result into the functional model of IDEF0 using Dyna-IDEF. The translated functional model is prototype model without ICOM arrows.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.15 no.1
• /
• pp.9-16
• /
• 2020

Recently, the capacity of SSD has been increasing rapidly due to the improvement of flash memory density. To take full advantage of these SSDs, first of all, FTL's prompt adaptation is necessary. The FTL is a translation layer existing in SSDs to overcome the drawback of the SSD that cannot be modified in place, and has garbage collection and caching functions in addition to the map table management function. In this study, we focus on caching function, compare and analyze the cache implementation methodologies, and propose improved methods. Typical cache implementations divide the cache into groups, manage and retrieve the caches in the group as a linked list. Thus, searches are made in the order of the linked list. In contrast, we propose a method of sequential searching using the search area group of a cache registered in the map table regardless of the linked list and cache group. Experimental results show that the proposed method has a 2.5 times improvement over the conventional method.

• East Asian mathematical journal
• /
• v.24 no.1
• /
• pp.11-20
• /
• 2008

We survey recent results and some conjectures in analytical fixed point theory. We list the known fixed point theorems for Kakutani maps, Fan-Browder maps, locally selectionable maps, approximable maps, admissible maps, and the better admissible class $\cal{B}$ of maps. We also give 16 conjectures related to that theory.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.234-237
• /
• 2009

CBL[1](Corner Block List)에 기반한 Non-Slicing 플로 플랜 알고리즘은 빈 공간이 없는 Non-Slicing 플로플랜만 나타낼 수 있다. 본 논문에서는 CBL 단점을 보완하고 실제 블록의 크기를 이용하여 최적의 위치에 블록을 배치 하기 위해 contour map을 이용할 것을 제시한다. 본 알고리즘은 배치시 면적을 최소화 하는 방법을 제시하므로 CBL의 단점을 해결하고 더불어 최적해를 찾기 위한 실행 시간을 단축 시키는 효과를 기대할 수 있다.

• Journal of Information Processing Systems
• /
• v.14 no.4
• /
• pp.877-891
• /
• 2018

In this paper, we propose a novel algorithm for rendering motion-blurred shadows utilizing a depth-time ranges shadow map. First, we render a scene from a light source to generate a shadow map. For each pixel in the shadow map, we store a list of depth-time ranges. Each range has two points defining a period where a particular geometry was visible to the light source and two distances from the light. Next, we render the scene from the camera to perform shadow tests. With the depths and times of each range, we can easily sample the shadow map at a particular receiver and time. Our algorithm runs entirely on GPUs and solves various problems encountered by previous approaches.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.209-211
• /
• 2000

SPIHT(Set Partitioning In Hierarchical Trees) 부호화 알고리즘은 EXW(Embedded Zerotree Wavelet) 부호와 알고리즘의 부호화 방법을 개선하여 압축 효율을 개선한 알고리즘이다. SPIHT 부호화 알고리즘은 웨이브렛 변환된 영상의 계수 값이 동일한 방향은 갖는 대역 사이에서 상관 관계를 갖는다는 점을 이용한다는 점에서 EZW 부호화 알고리즘과 동일하다. 그러나 zerotree의 부호화 부분에서 계수의 중요도에 따라 부분 집합으로 분할해 가는 과정과 분할된 계수들을 부호화하는 과정을 개선하였다. 이 부호화 과정에서의 significant map은 모든 threshold에 대해서 LSP(List of Insignificant Pixels), LIP(List of Insignificant), LIS(List of Insignificant Sets)의 세가지 리스트를 통하여 구하여 진다. 그리고, 전체 알고리즘은 초기화, Sorting pass, Refinement pass, 양자화 값 갱신의 네 가지 단계로 구성된다. 본 논문에서는 SPIHT 구현에 필요한 자료구조를 제안하고 SPIHT 부호화 모듈을 구현에 대하여 설명한다.

• Journal of Korea Game Society
• /
• v.11 no.4
• /
• pp.49-59
• /
• 2011

The creativity is the important ability required to game designers. But there is few research for the definition of creativity and creative thinking method. This study suggests that what creativity is and how to use creative thinking methods in the game design. In the first, this study analyzes three types of creativity meaning: revolutionary creativity, evolutionary creativity and impromptu creativity. In the second, this study suggests that how to use thinking methods that are mind map, brainstorming, check list and etc. The game designer's creativity can be improved by the suggestion of this study.

• Korean Journal of Computational Design and Engineering
• /
• v.8 no.4
• /
• pp.243-253
• /
• 2003

This paper presents a new geometric morphing algorithm for polygons based on a simple geometric structure called direction map, which is mainly composed of a circular list of direction vectors defined by two neighboring vertices of a polygon. To generate a sequence of intermediate morphing shapes, first we merge direction maps of given control shapes based on a certain ordering rule of direction vectors, and scale the length of each direction vectors using Bezier or blossom controls. We show that the proposed algorithm is an improvement of the previous methods based on Minkowski sum (or convolution) in th aspects of computational efficiency and geometric properties.