• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.12
• /
• pp.552-559
• /
• 2008

Computing technologies are extending the means by which people communicate. Especially, virtual worlds have recently become successful, due to rapidly improving Information Technologies. Chat is a crucial function in current virtual worlds. We need a realistic and efficient communication framework for multi-agents participating in a virtual world. The main contribution of our work is twofold. First, we propose a realistic communication framework which enables 'Complete Talk' and 'Partial Talk' in terms of spatial relationships between avatar agents. Second, our system reconstructs a dialogue graph which maintains all transcripts in the form of directed graphs with temporal(dialogue sequences) and spatial information(physical positions) about communicating agents.

• Journal of The Korean Association of Information Education
• /
• v.13 no.3
• /
• pp.313-323
• /
• 2009

The objective of this paper is an implementation of analysing and predicting functions to promote self-directed learning for student's performance assessment system in programming subjects. By adapting Rubric model, the proposed functions inform a student of the assessment criteria and level to be carried out with respects to two-way specifications such as rational ability, problem solving ability and creativity. The proposed system also provides a graphical results of each ability instead of assessment result, for better understanding and analyzing himself/herself based on to the performance assessment and the result. Moreover, the proposed system contains a method to predict future achievement result with moving average technique. Therefore, an academic achievement can be precisely determined by himself/herself to estimate self-directed learning. The teacher can provide different level of educational resources such as supplement learning, problem explains and private instructor etc., in order to maximize efficiency of education.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.222-228
• /
• 2016

Uniform navigation of NPCs in computer games is an important factor that can decrease the interest of game players. This problem is particularly noticeable in pathfinding when using a waypoint graph because the NPCs navigate using only predefined locations. In this paper we propose a method that enables adaptive navigations of NPCs by observing player movements. The proposed method involves modification of waypoints dynamically by observing the player's point designation and use of the modified waypoints for NPC's pathfinding. Also, we propose an algorithm to find the NPC-specific path by learning the landform preferences of players. We simulate the implemented algorithm in an RPG game made with Unity 4.0 and confirm that NPC navigations had more variety and improved according to player navigations.

• Journal of the Korean Geographical Society
• /
• v.32 no.1
• /
• pp.69-90
• /
• 1997

The purposes of this study are to analyze changes in land value and land use of the surrounding area of Konkuk subway station and to suggest the direction of development of that area, which is designated as the micro planning district. KonKuk subway station which is one of nodes in subway line 2 will be completely connected to subway line 7 in 1998. Therefore, as a transfer station, the accessibility for KonKuk station would be increased very much due to the expansion of subway network system. This study analyzes land use types and land values within 200m from the four exits of the station and examines how subway station influences land use types and land values at surrounding areas. Based on the result of the current land use pattern and questionaire related to the direction for the future development of KonKuk subway area, this study suggests the effective and desired direction of development strategies in creating cultural environment appropriate for a university neighborhood.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.1
• /
• pp.27-32
• /
• 2007

this paper the acoustic signature from a supersonic nozzle is measured and compared to the result of a program developed for a gas turbine noise prediction. In order to measure the jet Mach Number, the pressure and temperature at the settling chamber was measured along with pressures from a pitot-tube placed near the exit. The results are also compared to the ones obtained with a shadow graph technique. Jet noise produced by an imperfectly expanded jet contains shock associated noise, which consist of broadband noise and screech tone noise. For subsonic condition, the directivity is dominant to the downstream direction due to turbulence mixing noise. For supersonic conditions, however, the directivity is dominant toward upstream direction due to shock associated noise. The comparison with a jet exhaust noise prediction code shows good agreement at supersonic conditions but needs to be improved at subsonic speeds.

• The KIPS Transactions:PartA
• /
• v.17A no.3
• /
• pp.159-166
• /
• 2010

In this paper, to obtain the Minimum Spanning Tree (MST) from the graph with several nodes having the same weight, I applied both Bor$\dot{u}$vka and Kruskal MST algorithms. The result came out to such a way that Kruskal MST algorithm succeeded to obtain MST, but not did the Prim MST algorithm. It is also found that an algorithm that chooses Inter-MSF MWE in the $2^{nd}$ stage of Bor$\dot{u}$vka is quite complicating. The $1^{st}$ stage of Bor$\dot{u}$vka has an advantage of obtaining Minimum Spanning Forest (MSF) with the least number of the edges, and on the other hand, Kruskal MST algorithm has an advantage of always obtaining MST though it deals with all the edges. Therefore, this paper suggests an Hybrid MST algorithm which consists of the merits of both Bor$\dot{u}$vka's $1^{st}$ stage and Kruskal MST algorithm. When applied additionally to 6 graphs, Hybrid MST algorithm has a same effect as that of Kruskal MST algorithm. Also, comparing the algorithm performance speed and capacity, Hybrid MST algorithm has shown the greatest performance Therefore, the suggested algorithm can be used as the generalized MST algorithm.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.453-462
• /
• 2009

Studies on software plagiarism detection, prevention and judgement have become widespread due to the growing of interest and importance for the protection and authentication of software intellectual property. Many previous studies focused on comparing all pairs of submitted codes by using attribute counting, token pattern, program parse tree, and similarity measuring algorithm. It is important to provide a clear-cut model for distinguishing plagiarism and collaboration. This paper proposes a source code clustering algorithm using a probability model on extreme value distribution. First, we propose an asymmetric distance measure pdist($P_a$, $P_b$) to measure the similarity of $P_a$ and $P_b$ Then, we construct the Plagiarism Direction Graph (PDG) for a given program set using pdist($P_a$, $P_b$) as edge weights. And, we transform the PDG into a Gumbel Distance Graph (GDG) model, since we found that the pdist($P_a$, $P_b$) score distribution is similar to a well-known Gumbel distribution. Second, we newly define pseudo-plagiarism which is a sort of virtual plagiarism forced by a very strong functional requirement in the specification. We conducted experiments with 18 groups of programs (more than 700 source codes) collected from the ICPC (International Collegiate Programming Contest) and KOI (Korean Olympiad for Informatics) programming contests. The experiments showed that most plagiarized codes could be detected with high sensitivity and that our algorithm successfully separated real plagiarism from pseudo plagiarism.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.165-173
• /
• 2012

Given a connected, weighted, and undirected graph, the Minimum Spanning Tree (MST) should have minimum sum of weights, connected all vertices, and without any cycle taking place. Borůvka Algorithm is firstly suggested as an algorithm to evaluate the MST, but it is not widely used rather than Prim and Kruskal algorithms. Borůvka algorithm selects the Minimum Weight Edge (MWE) from each vertex with distinct weights in $1^{st}$ stage, and selects the MWE from each MSF (Minimum Spanning Forest) in $2^{nd}$ stage. But the cycle check and the number of MSF in $1^{st}$ stage and $2^{nd}$ stage are difficult to implication by computer program even if it is easy to verify visually. This paper suggests the generalized Borůvka Algorithm, This algorithm selects all of the same MWEs for each vertex, then checks the cycle and constructs MSF for ascending sorted MWEs. Kruskal method bring into this process. if the number of MSF greats then 1, this algorithm selects MWE from ascending sorted inter-MSF edges. The generalized Borůvka algorithm is verified its application by being applied to the 7 graphs with the many minimum weights or distinct weight edges for any vertex. As a result, the generalized Borůvka algorithm is less required for cycle verification then the Kruskal algorithm. Therefore, the generalized Borůvka algorithm is more fast to obtain MST then Kruskal algorithm.

• Journal of the Korean Regional Science Association
• /
• v.37 no.1
• /
• pp.45-61
• /
• 2021

This research purposes to design a methodological framework to suggest the optimal method to resolve the conflicts of stakeholders surrounding the water use charge of the Han River region, and to use the analysis results to provide the direction of policy. For this, it was preceded that the process of understanding the mechanisms of the multifaceted conflict between decision makers taking different positions over water use charge of the Han River region, and an optimal method to resolve the conflict of water use charge of the Han River region was derived by using a graph model for conflict resolution(GMCR). According to the analysis results, the optimal state to find a solution to the water use charge of the Han River is that the Seoul-Incheon-Gyeonggi region pays the charge according to the original rate while Seoul-Incheon requesting discount the water use rate. In addition, the Han River management committee should establish policies desired by Seoul-Incheon-Gyeonggi region including rationalization of the decision-making structure to determine the rate of water use charge, making the basis to support the Han River management fund system for the Seoul-Incheon region, and transparent management of the Han River management fund system considering the characteristics of beneficiary regions and residents. This study is expected to provide objective decision-making information in establishing environmental policy directions related to conflict resolution in the water use charge of the Han River region and to offer a methodological basis for similar follow-up studies related to conflicts derived from sharing nature environment.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.24 no.7
• /
• pp.945-952
• /
• 2018

Recently, bass fishing has become a marine leisure sport in Korea. There are 4 major fishing associations in Korea, and each association holds 10-15 tournaments each year. However, supply of 17 ft bass boats, which are preferred in leagues, depends 100 % on imports. In this study, we have derived the main specifications to develop the initial hull forms of a 18.5ft bass boat through statistical analysis based on mothership data. In addition, CFD numerical analysis was carried out according to deadrise angle and longitudinal center of gravity, which strongly influenced the resistance and planing performance. For numerical analysis, design speed was set to $Fn=3.284 (Re=9.858{\times}10^7)$, the deadrise angle was set from 12 to $20^{\circ}$, and the longitudinal center of gravity was set in the range of 0 to $8%L_{wL}$ from the center of buoyancy to the stern. Based on the numerical results, we first set the range of these factors by resistance performance and immersion keel length. Furthermore, using a correlation graph of Savitsky's Drag-Lift ratio, we derived the deadrise angle ($14-16^{\circ}$) and longitudinal center of gravity ($4-6%L_{wL}$).