• Journal of the Korea Society for Simulation
• /
• v.15 no.2
• /
• pp.31-39
• /
• 2006

The visibility graph is a well-known method for efficient path-finding with the minimum search space modelling the game world. The generalized visibility graph is constructed on the expanded obstacle boundaries to eliminate the "wall-hugging" problem which is a major disadvantage of using the visibility graph. The paths generated by the generalized visibility graph are guaranteed to be near optimal and natural-looking. In this paper we propose the method to apply the generalized visibility graph efficiently for game characters who moves among static obstacles between varying start and goal points. Even though the space is minimal once the generalized visibility graph is constructed, the construction itself is time-consuming in checking the intersection between every two links connecting nodes. The idea is that we build the map for static obstacles first and then incorporate start and goal nodes quickly. The incorporation of start and goal nodes is the part that must be executed repeatedly. Therefore we propose to use the rotational plane-sweep algorithm in the computational geometry for incorporating start and goal nodes efficiently. The simulation result shows that the execution time has been improved by 39%-68% according to running times in the game environment with multiple static obstacles.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.2
• /
• pp.395-407
• /
• 2016

This study aims to apply the G-theory for estimation of reliability of evaluation scores between raters on Taekwondo Poomsae rating categories. Selecting a number of game days and raters as multiple error sources, we analyzed the error sources caused by relative magnitude of error variances of interaction between the factors and proceeded with D-study based on the results of G-study for optimal determination of measurement condition. The results showed below. The estimated outcomes of variance component for accuracy among the Taekwondo Poomsae categories with G-theory showed that impact of error was the biggest influence factor in raters conditions and in order of interaction in subjects and between subjects, also impact of variance component estimation error on expression category was the major influence factor in interaction and in order of the between subjects and raters. Finally, the result of generalizability coefficient estimation via D-study showed that measurement condition of optimal level depend on the number of raters was 8 persons of raters on accuracy category, and stable reliability on expression category was gained when the raters were 7 persons.

• Proceedings of the KAIS Fall Conference
• /
• 2009.12a
• /
• pp.8-11
• /
• 2009

성공적인 창업을 위해서는 창업가의 준비가 선행되어야 하지만, 매력적인 사업 아이디어의 계발이 뒤따라야 한다. 그러나 지금까지의 창업연구는 창업행동과 사업성과에 영향을 미치는 창업가 요인에 치우쳐 있으며, 사업 아이디어의 계발과 평가에 대한 연구는 부족한 실정이다. 이 연구는 고객이 상품을 구매하기 전 인터넷 검색엔진에서 해당 상품에 대한 검색을 하는 경우가 일반화되고 있다는 사실과 고객이 검색엔진에 입력하는 키워드는 고객의 의도를 대변한다는 사실을 기초로, 키워드로 표현된 사업 아이디어의 매력도를 객관적으로 측정하는 방법을 제시하는 것을 목적으로 한다.이 연구는 키워드로 표현된 사업 아이디어 매력도(BIA)를 구매의도를 가진 잠재고객의 자사 웹 사이트 방문수로 정의한다. 키워드로 표현된 사업 아이디어 매력도(BIA)는 [해당 키워드의 조회수(Q) ${\times}$ 구매의도 비율(R) / 경쟁 사이트의 수(S)]의 수식으로 나타낼 수 있으며, 수식을 구성하는 변수 중에서 해당 키워드의 조회수(Q)와 경쟁 사이트의 수(S)는 검색엔진에서 쉽게 제공 받을 수 있으므로, 구매의도 비율(R)만 알 수 있다면 BIA를 비교적 정확히 추정할 수 있다. 연구자는 특정 분야 키워드 100개를 선정한 다음, 전문가로 하여금 각 키워드의 구매의도 비율(R)을 추정하게 하고, 전문가 추정 없이도 구매의도 비율을 예측할 수 있도록 각 키워드의 구매의도 비율(R)을 예측하는 주요 데이터를 의사결정 나무 기법으로 도출하고, 의사결정 나무 기법으로 도출된 데이터로 구성된 회귀식을 제시함으로써 키워드로 표현된 사업 아이디어 매력도(BIA)를 객관적으로 평가하는 방법을 제시한다. 이 연구는 사업 아이디어의 계발과 평가에 대한 객관적인 기준을 제시함으로써 창업의 성공률을 높이는 데 기여할 수 있고, 창업연구에 새로운 방법론을 도입했다는 점에서 의의가있다.

• Journal of Korean Library and Information Science Society
• /
• v.36 no.1
• /
• pp.415-440
• /
• 2005

This paper analyses meta-data systems for serials in order to provide the fundamental infrastructure for serials-sharing systems based on semantic interoperability. According to the primitive features of serials information, meta-data for serials are classified into 3 main subsystems: serial identification Information, serial bibliographic information and serial holding information. The serial identification information that play the important role of the primary key in library management systems should be refined to accommodate serials with digital formats. Although MARC formats have been commonly used for the description of serial bibliographic information, a new meta-data format for serial bibliographic information that harmonize with the abundance of meta-data elements in MARC and the simplicity of DCMI. For serial holding information, the newly proposed standards such as ANSI/NSIO Z39.50 are adequate to grasp the varieties of serial holding patterns. It should be able to differentiate the level of description by means of the types of serial information services. As the current computing technology generally uses XML for the representation and Process of information, the meta-data system for serials should be based on XML.

• Journal of KIISE:Software and Applications
• /
• v.34 no.4
• /
• pp.368-376
• /
• 2007

How to represent the search space is as important as which search algorithm to use for finding natural-looking paths for moving NPC (non-player character) in computer games. Recently, various state space representation methods which have been developed for computer games are being used while A* algorithm dominates as the preferred search algorithm. These representation methods show some drawbacks such as the size of state space is too large, there is no guarantee for optimality, the path found is not natural-looking, and the generation of nodes and links is not automatic by depending on a level designer. In this paper the requirements for natural-looking paths are introduced and to find paths satisfying these requirements, the use of the generalized visibility graphs which is the extended version of the visibility graph in Robotics is proposed.

• Archives of design research
• /
• no.16
• /
• pp.113-122
• /
• 1996

ilesi gn is on process. j)esign is not a result, but a process, It requires organizatiun ui design process to ubtain the most efiectivc design. The urganizatiun of design process means to understand the inner ur outer problems. to cr-eate r-esonable process, and to hale ability of problem soiving, In this paper, we suggest lhal student need to understand the importance oi 'discovering \ulcornerrOCeflB'. not 'd iscovered process'. _\ nd we also SUi(\{est text model of instructor with respeCl to the basic concept of creative ability and den]opmcnt of imagination ahality.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.1
• /
• pp.299-307
• /
• 1991

A unified correlation of the interfacial friction factor for air-water and steam-water flows in inclined rectangular channels has been developed. The correlation was expressed in the form of a power law of the liquid and the gas Reynolds number, and the liquid-to-gas viscosity ratio. In addition, a relation between the equivalent roughness and the intensity of wave height fluctuation of the interface has been investigated. A new dimensionless intensity of fluctuation including a liquid film Reynolds number is proposed. It has been shown that the dimensionless equivalent roughness, which is calculated from the Nikuradse equation, can be uniquely related to this dimensionless intensity of fluctuation for both air-water and steam-water flows.

• Archives of design research
• /
• v.13
• /
• pp.203-209
• /
• 1996

For about a uear now By visal communication of method and expressive medium computer graphics Application and dependent degree is increased. It is that importance of computer graphics Application to design emphasize increasingly not only a developed country-America Jappen etc but (also) our country too. Now, computer graphics design become a part of life and settle down one of the culture and is occupied important position of visual culture. Design should have competitive power needs distinction plan, more over necessity of multitude inclinable design and desire of multitude on this neccessary is required A few years ago method of design depended on hand operations but It ushered in a new epoch to application and technique with appearance of computer. Now this research analyze in parts to operation get application of copy when computer applied by expression method a tool and will try to thinks from now on generalize conjugaLly plan of computer graphics.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.149-155
• /
• 2013

In these days, Entity-Relationship Model is the most popular modeling tool for designing databases, and XML is a de facto standard language for representing and exchanging data. But, because of many commercial products supporting Entity-Relationship Model use their's own representation formats, and thus it gives rise to difficulties the inter-operability between these products. In this paper, we propose an ERX, a generation tool of XML Schema from Entity-Relationship Model. ERX receives an Entity-Relationship Diagram as an input, transforms it based on transformation rules, and generates a XML Schema Definition as an output. Transformation rules contain entity set, relationship set, mapping cardinalities, and generalization.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.23-32
• /
• 2003

Since the data is collected from disparate sources in many actual data mining environments, it is common to have data values in different abstraction levels. This paper shows that such multiple abstraction levels of data can cause undesirable effects in decision tree classification. After explaining that equalizing abstraction levels by force cannot provide satisfactory solutions of this problem, it presents a method to utilize the data as it is. The proposed method accommodates the generalization/specialization relationship between data values in both of the construction and the class assignment phase of decision tree classification. The experimental results show that the proposed method reduces classification error rates significantly when multiple abstraction levels of data are involved.