• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.81-84
• /
• 2001

3 차원 GIS 소프트웨어를 개발하기 위한 기술로는 공간데이터처리 및 공간분석기술, 컴퓨터그래픽스 및 가상현실 기술에 이르기까지 다양한 연구가 요구된다. 지리정보 가시화(Visualization)에 관한 연구는 여러 GIS 응용분야에서 주요한 부분이 된다. 현재 2 차원 기 구축된 데이터를 이용하여 3차원으로 가시화 및 분석을 수행할 수 있다는 것은 데이터와 소프트웨어 재사용 및 비용측면에서 중요한 의미를 가진다. 본 논문에서는 2차원 데이터와 최소한의 3차원 부가정보(빌딩높이, 도로폭등)를 이용하여 규칙기반 모델링(Rule-Based Modeling)을 통해 3 차원으로 모델링 해 낼 수 있는 3 차원 장면 모델러 컴포넌트 설계 방법을 제안한다. 시설물의 다양한 상세도 제어가 가능한 LOD(level-of detail) 모델러와 3 차원 장면을 효율적으로 관리하기 위한 장면 그래프(scene graph) 컴포넌트 설계 기술을 소개한다. 장면 모델러 컴포넌트 분석을 위해 처리하는 입력 데이터, 수작업 3 차원 모델링 여부, 소프트웨어 재사용성, 상호운용성, 구축 비용 등을 기준으로 분석하였다.

• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1283-1291
• /
• 2005

One of the problems in boosting Java performance using a Just-in-Time (JIT) compiler is removing redundant array bound checks. In conventional static compilers, many powerful algorithms have been developed, yet they are not directly applicable to JIT compilation where the compilation time is part of the whole running time. In the current JIT compilers, we tan use either a naive algorithm that is not powerful enough or an aggressive algorithm which requires the transformation into a static single assignment (SSA) form of programs (and back to the original form after optimization), thus causing too much overhead not appropriate for JIT compilation This paper proposes a new algorithm based on an inequality graph which can eliminate array bounds check codes aggressively without resorting to the SSA form. When we actually perform this type of optimization, there are many constraints in code motion caused by the precise exception rule in Java specification, which would cause the algorithm to miss many opportunities for eliminating away bound checks. We also propose a new method to overcome these constraints.

• Journal of Korea Water Resources Association
• /
• v.55 no.spc1
• /
• pp.1211-1222
• /
• 2022

Abnormal condition inevitably occurs during operation of water distribution system (WDS) and requires the isolation of certain areas using isolation valves. In general, the determination of the optimal location of isolation valves considered minimization of hydraulic failures as isolation of certain areas causes a change in hydraulic states (e.g., flow direction, velocity, pressure, etc.). Water quality failure can also be induced by changes in hydraulics, which have not been considered for isolation valve system design. Therefore, this study proposes a new isolation valve system design methodology to prevent unexpected water quality failure events. The new methodology considers flow direction change ratio (FDCR), which accounts for flow direction changes after isolation of the area, as a constraint while reliability is used as the objective function. The optimal design model has been applied to a synthetic grid network and the results are compared with the traditional design approach. Results show that considering FDCR can eliminate flow direction changes while average pressure and coefficient of variation of pressure, velocity, and hydraulic geodesic index (HGI) outperform compared to the traditional design approach. The proposed methodology is expected to be a useful approach to minimizing unexpected consequences by traditional design approaches.

• Journal of Intelligence and Information Systems
• /
• v.17 no.3
• /
• pp.63-77
• /
• 2011

The World Wide Web is a very large distributed digital information space. From its origins in 1991, the web has grown to encompass diverse information resources as personal home pasges, online digital libraries and virtual museums. Some estimates suggest that the web currently includes over 500 billion pages in the deep web. The ability to search and retrieve information from the web efficiently and effectively is an enabling technology for realizing its full potential. With powerful workstations and parallel processing technology, efficiency is not a bottleneck. In fact, some existing search tools sift through gigabyte.syze precompiled web indexes in a fraction of a second. But retrieval effectiveness is a different matter. Current search tools retrieve too many documents, of which only a small fraction are relevant to the user query. Furthermore, the most relevant documents do not nessarily appear at the top of the query output order. Also, current search tools can not retrieve the documents related with retrieved document from gigantic amount of documents. The most important problem for lots of current searching systems is to increase the quality of search. It means to provide related documents or decrease the number of unrelated documents as low as possible in the results of search. For this problem, CiteSeer proposed the ACI (Autonomous Citation Indexing) of the articles on the World Wide Web. A "citation index" indexes the links between articles that researchers make when they cite other articles. Citation indexes are very useful for a number of purposes, including literature search and analysis of the academic literature. For details of this work, references contained in academic articles are used to give credit to previous work in the literature and provide a link between the "citing" and "cited" articles. A citation index indexes the citations that an article makes, linking the articleswith the cited works. Citation indexes were originally designed mainly for information retrieval. The citation links allow navigating the literature in unique ways. Papers can be located independent of language, and words in thetitle, keywords or document. A citation index allows navigation backward in time (the list of cited articles) and forwardin time (which subsequent articles cite the current article?) But CiteSeer can not indexes the links between articles that researchers doesn't make. Because it indexes the links between articles that only researchers make when they cite other articles. Also, CiteSeer is not easy to scalability. Because CiteSeer can not indexes the links between articles that researchers doesn't make. All these problems make us orient for designing more effective search system. This paper shows a method that extracts subject and predicate per each sentence in documents. A document will be changed into the tabular form that extracted predicate checked value of possible subject and object. We make a hierarchical graph of a document using the table and then integrate graphs of documents. The graph of entire documents calculates the area of document as compared with integrated documents. We mark relation among the documents as compared with the area of documents. Also it proposes a method for structural integration of documents that retrieves documents from the graph. It makes that the user can find information easier. We compared the performance of the proposed approaches with lucene search engine using the formulas for ranking. As a result, the F.measure is about 60% and it is better as about 15%.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2005.05b
• /
• pp.991-995
• /
• 2005

본 연구에서는 1차원 이송-분산 과정을 연구하고 전단류 흐름 및 분산거동에 있어 Taylor 이론의 핵심이라 할 수 있는 '종방향 이송과 횡방향 확산의 균형'을 기본 개념으로 하여, 이송과 확산을 분리하여 이 두 과정이 순차적으로 발생한다는 가정에 의거한 순차혼합모형을 제시하였다. 본 모형에서는 가상의 하천을 여러 개의 행과 종방향 거리를 길이가 일정한 구획으로 나누어 연속적인 분산과정을 이산적인 형태로 나타낼 수 있게 하고, 횡방향 유속분포에 따라 각 행에 각기 다른 유속을 할당한다. 오염물질은 하폭방향 선오염원으로 원점에 순간주입되며, 주어진 혼합시간 $t_m$ 동안 각 행의 오염물질들이 각자에 할당된 유속을 따라 진행하고 진행이 끝난 후 횡방향 확산이 순간적으로 이루어진다. 횡방향 확산은 횡방향으로 완전하게 일어남을 가정하여, 횡방향 확산이 끝나면 각 열에서의 농도 평균값이 할당된다. 이러한 혼합시간 $t_m$ 동안의 순차적인 이송-확산 과정이 반복되면서 오염물질의 분산이 일어나며, 농도 분포 그래프를 그릴 수 있게 된다. 순차혼합모형을 가상의 직선하천에 적용하여 종분산계수를 유도하였는데, 본 연구에서 유도된 종분산계순식은 Fischer.가 제안한 식과 유사한 형태로 나타남을 알 수 있었다. 본 모형에서 계산된 농도분포 곡선을 해석해와 비교한 결과,두 곡선이 적절히 일치함을 확인할 수 있었으며 해석해와의 비교를 통해 종분산계수 K가 혼합시간 $t_m$과 선형관계임을 확인할 수 있었다. 수심대하폭비에 따라 각기 다른 유속분포에 적용하여 종분산계수 K가 유속편차강도의 제곱에 비례관계에 있음이 밝힐 수 있었다. 수압은 $4.69kg/cm^2$으로 나타났다. 밸브 개폐도가 $100\%$일 때가 밸브를 $60\%$와 $80\%$ 개폐시켰을 때보다 $0.3kg/cm^2,\;0.29kg/cm^2$ 낮게 나타나 밸브를 전체 개방 했을 때 관로내의 수압이 상수설계기준에 적합한 수압을 유지함을 알 수 있다. 상수관로 설계 기준에서는 관로내 수압을 $1.5\~4.0kg/cm^2$으로 나타내고 있는데 $6kg/cm^2$보다 과수압을 나타내는 경우가 $100\%$로 밸브를 개방하였을 때보다 $60\%,\;80\%$ 개방하였을 때가 더 빈번히 발생하고 있으므로 대상지역의 밸브 개폐는 $100\%$ 개방하는 것이 선계기준에 적합한 것으로 나타났다. 밸브 개폐에 따른 수압 변화를 모의한 결과 밸브 개폐도를 적절히 유지하여 필요수량의 확보 및 누수방지대책에 활용할 수 있을 것으로 판단된다.8R(mm)(r^2=0.84)$로 지수적으로 증가하는 경향을 나타내었다. 유거수량은 토성별로 양토를 1.0으로 기준할 때 사양토가 0.86으로 가장 작았고, 식양토 1.09, 식토 1.15로 평가되어 침투수에 비해 토성별 차이가 크게 나타났다. 이는 토성이 세립질일 수록 유거수의 저항이 작기 때문으로 생각된다. 경사에 따라서는 경사도가 증가할수록 증가하였으며 $10\% 경사일 때를 기준으로 $Ro(mm)=Ro_{10}{\times}0.797{\times}e^{-0.021s(\%)}$로

• Journal of Intelligence and Information Systems
• /
• v.15 no.1
• /
• pp.87-102
• /
• 2009

With the growth of Web 2.0, lots of services allow yours to post their personal information and useful knowledges on networked information spaces such as blogs and online communities etc. As the services are generalized, recent researches related to social network have gained momentum. However, most social network services do not support machine-processable semantic knowledge, so that the information cannot be shared and reused between different domains. Moreover, as explicit definitions of relationships between individual social entities do not be described, it is difficult to analyze social network for inferring unknown semantic relationships. To overcome these limitations, in this paper, we propose a social network analysis system with personal photographic data up-loaded by virtual community users. By using ontology, an informative connectivity between a face entity extracted from photo data and a person entity which already have social relationships was defined clearly and semantic social links were inferred with domain rules. Then the inferred links were provided to yours as a visualized graph. Based on the graph, more efficient social network analysis was achieved in online community.

• Journal of Korea Game Society
• /
• v.17 no.5
• /
• pp.123-132
• /
• 2017

The path-finding algorithm refers to an algorithm for navigating the route order from the current position to the destination in a virtual world in a game. The conventional path-finding algorithm performs graph search based on cost such as A-Star and Dijkstra. A-Star and Dijkstra require movable node and edge data in the world map, so it is difficult to apply online games with lots of map data. In this paper, we provide a Heuristic-based Genetic Algorithm Path-finding(HGAP) using Genetic Algorithm(GA). Genetic Algorithm is a path-finding algorithm applicable to game with variable environment and lots of map data. It seek solutions through mating, crossing, mutation and evolutionary operations without the map data. The proposed algorithm is based on Binary-Coded Genetic Algorithm and searches for a path by performing a heuristic operation that estimates a path to a destination to arrive at a destination more quickly.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.512-515
• /
• 2009

In this paper, we propose layout based multimodal contents authoring tool for Digilog Book. In authoring step, users create a virtual area using mouse or pen-type device and select property of the area repetitively. After finishing authoring step, system recognizes printed page number and generate page layout including areas and property information. Page layout is represented as a scene graph and stored as XML format. Digilog Book viewer loads stored page layout and analyze properties then augment virtual contents or execute functions based on area. Users can author visual and auditory contents easily by using hybrid interface. In AR environment, system provides area templates in order to help creating area. In addition, proposed authoring tool separates page recognition module from page tracking module. So, it is possible to author many pages using only single marker. As a result of experiment, we showed proposed authoring tool has reasonable performance time in AR environment. We expect that proposed authoring tool would be applicable to many fields such as education and publication.

• School Mathematics
• /
• v.5 no.1
• /
• pp.135-149
• /
• 2003

We present an understanding about students' conceptual model of differential equations, based on the discourse data that were collected in a differential equations course at a university in Korea. An interpretive approach is taken to analyze classroom discourse. This paper consists of three main parts. First, we completely analyze the students' use of conceptual metaphor in a university differential equations class. Secondly, we identify conceptual metaphors representing students' conceptual model of differential equations. Finally, we describe the mathematical characteristics of the conceptual metaphors identified in detail. Among other things, this paper reveals that there exists dual aspects of the students' conceptual model of differential equations. In other words, in the differential equations course observed we found that the students very often used two kinds of conceptual metaphor,“machine metaphor”and“fictive motion metaphor”, that have contrastingly different mathematical characteristics. In order to interpret the duality, we take a sociocultural perspective, and this perspective suggests and helps us to realize the significance of understanding of cognitive diversity in mathematics classroom.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.227-237
• /
• 2000

A Web database System is a large-scaled multimedia application system that has multimedia processing facilities and cooperates with relational/Object-Oriented DBMS. Conventional hypertext modeling methods and DB gateway have limitations for Web database because of their restricted versatile presentation abilities and inefficient concurrency control caused by bottleneck in cooperation processing. Thus, we suggest a Dynamic Navigation Model & Virtual Graph Structure. The Dynamic Navigation Model supports implicit query processing and dynamic creation of navigation spaces, and introduce node-link creation rule considering navigation styles. We propose a mapping methodology between the suggested hypertext model and the relational data model, and suggest a dynamic allocation scheduling technique for query processing server based on weighted value. We show that the proposed technique enhances the retrieval performance of Web database systems in processing complex queries concurrently.