• 한국정보과학회논문지:시스템및이론
• /
• 제31권10호
• /
• pp.603-609
• /
• 2004

절차적(procedural) 텍스쳐는 다양한 해상도로 텍스쳐 공간을 표현할 수 있으며, 매우 적은 저장 공간을 사용하는 장점을 가지고 있다. 그러나 절차적 표현을 위한 암시적(implicit) 방법을 이해하기 어렵고 프로그래밍에 익숙하지 않은 일반 사용자가 다루기 힘들다. 본 논문에서는 사용자의 직관적인 디자인작업을 통해 절차적 패턴을 자동으로 생성하는 인터랙티브 시스템이 제안된다. 전체 디자인 과정은 다중레이어(layer)를 기반으로 하며 데이타, 연산 및 출력 노드 등으로 구성된 그래프 구조로 표현된다. 제안된 시스템은 일반 사용자에게 유연한 인터페이스를 제공하여 프로그래밍 작업 없이 절차적 텍스쳐 쉐이더를 자동으로 생성하도록 한다. 시뮬레이션 결과로부터 제안된 방법이 다양한 패턴을 효과적으로 제작할 수 있음을 확인하였다.

• 정보처리학회논문지D
• /
• 제12D권2호
• /
• pp.327-334
• /
• 2005

복잡한 구조의 웹사이트를 표현하기 위해 EMG(Extended Mark Flow Graph)를 이용한 웹사이트의 표현이 연구되고 있다. 대부분의 웹사이트들은 반복구조가 많이 나타나고, 이러한 웹사이트들을 EMFG로 표현하면 너무 복잡하여 때로는 웹사이트의 구조의 파악이 어려워지게 된다. 따라서 본 논문에서는 웹사이트를 EMG로 표현할 때 나타나는 반복구조를 직렬반복구조와 병렬반복구조로 분류하고, 이를 간략화하여 박스, 아크, 트랜지션의 수를 줄여 전체 웹사이트의 구조 및 웹페이지 간의 이동관계를 효율적으로 설계하고 관리할 수 있는 방법을 제시하고자 한다.

• Journal of Computational Design and Engineering
• /
• 제3권1호
• /
• pp.14-23
• /
• 2016

The problem of fitting B-spline curves to planar point clouds is studied in this paper. A novel method is proposed to deal with the most challenging case where multiple intersecting curves or curves with self-intersection are necessary for shape representation. A method based on Delauney Triangulation of data points is developed to identify connected components which is also capable of removing outliers. A skeleton representation is utilized to represent the topological structure which is further used to create a weighted graph for deciding the merging of curve segments. Different to existing approaches which utilize local shape information near intersections, our method considers shape characteristics of curve segments in a larger scope and is thus capable of giving more satisfactory results. By fitting each group of data points with a B-spline curve, we solve the problems of curve structure reconstruction from point clouds, as well as the vectorization of simple line drawing images by drawing lines reconstruction.

• 한국컴퓨터정보학회논문지
• /
• 제23권10호
• /
• pp.33-43
• /
• 2018

In this paper, we propose a method to automatically generate the description of an RDF graph structure. The description is expressed in Shape Expression Language (ShEx), which is developed by W3C and provides the syntax for describing the structure of RDF data. The RDF graphs to which this method can be applied are limited to those generated by the direct mapping, which is an algorithm for transforming relational data into RDF by W3C. A relational database consists of its schema including integrity constraints and its instance data. While the instance data can have been published in RDF by some standard methods such as the direct mapping, the translation of the schema has been missing so far. Unlike the users on relational databases, the ones on RDF datasets were forced to write repeated vague SPARQL queries over the datasets to acquire the exact results. This is because the schema for RDF data has not been provided to the users. The ShEx documents generated by our method can be referred as the schema on writing SPARQL queries. They also can validate data on RDF graph update operations with ShEx validators. In other words, they can work as the integrity constraints in relational databases.

• 한국정보처리학회논문지
• /
• 제6권3호
• /
• pp.781-791
• /
• 1999

DD(Decision Diagrams) is an efficient operational data structure for an optimal expression of boolean functions. In a graph-based synthesis using DD, the goal of optimization decreases representation space for boolean functions. This paper represents boolean functions using OPKFDD(Ordered Pseudo-Kronecker Functional Decision Diagrams) for a graph-based synthesis and is based on the number of nodes as the criterion of DD size. For a property of OPKFDD that is able to select one of different decomposition types for each node, OPKFDD is variable in its size by the decomposition types selection of each node and input variable order. This paper proposes a method for generating OPKFDD efficiently from the current BDD(Binary Decision Diagram) Data structure and an algorithm for minimizing one. In the multiple output functions, the relations of each function affect the number of nodes of OPKFDD. Therefore this paper proposes a method to decide the input variable order considering the above cases. Experimental results of comparing with the current representation methods and the reordering methods for deciding input variable order are shown.

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제11권1호
• /
• pp.154-164
• /
• 2019

A rotor dynamic analysis is mandatory for stability and design optimization of submerged propellers and turbines. An accurate simulation requires a proper consideration of fluid-induced reaction forces. This paper presents a bi-directional coupling of a bond graph method solver and an unsteady vortex lattice method solver where the former is used to model the rotor dynamics of the power train and the latter is used to predict transient hydrodynamic forces. Due to solver coupling, determination of hydrodynamic coefficients is obsolete and added mass effects are considered automatically. Additionally, power grid and structural faults like grid fluctuations, eccentricity or failure could be investigated using the same model. In this research work a fast, time resolved dynamic simulation of the complete power train is conducted. As an example, the rotor dynamics of a tidal stream turbine is investigated under two inflow conditions: I - shear flow, II - shear flow + water waves.

• ETRI Journal
• /
• 제43권5호
• /
• pp.812-824
• /
• 2021

Recently, with an increase in Internet usage, users of online social networks (OSNs) have increased. Consequently, privacy leakage has become more serious. However, few studies have investigated the difference between privacy and actual behaviors. In particular, users' desire to change their privacy status is not supported by their privacy literacy. Presenting an accurate measurement of users' privacy status can cultivate the privacy literacy of users. However, the highly interactive nature of interpersonal communication on OSNs has promoted privacy to be viewed as a communal issue. As a large number of redundant users on social networks are unrelated to the user's privacy, existing algorithms are no longer applicable. To solve this problem, we propose a structural similarity measurement method suitable for the characteristics of social networks. The proposed method excludes redundant users and combines the attribute information to measure the privacy status of users. Using this approach, users can intuitively recognize their privacy status on OSNs. Experiments using real data show that our method can effectively and accurately help users improve their privacy disclosures.

• 로봇학회논문지
• /
• 제17권4호
• /
• pp.407-416
• /
• 2022

Multiple AMRs have been proved to be effective in improving warehouse productivity by eliminating workers' wasteful walking time. Although Multi-agent Path Finding (MAPF)-based solution is an optimal approach for this task, its deployment in practice is challenging mainly due to its imperfect plan-execution capabilities and insufficient computing resources for high-density environments. In this paper, we present a MAPF-based fleet management system architecture that robustly manages multiple robots by re-computing their paths whenever it is necessary. To achieve this, we defined four events that trigger our MAPF solver framework to generate new paths. These paths are then delivered to each AMR through ROS2 message topic. We also optimized a graph structure that effectively captures spatial information of the warehouse. By using this graph structure we can reduce computational burden while keeping its rescheduling functionality. With proposed MAPF-based fleet management system, we can control AMRs without collision or deadlock. We applied our fleet management system to the real logistics warehouse with 10 AMRs and observed that it works without a problem. We also present the usage statistic of adopting AMRs with proposed fleet management system to the warehouse. We show that it is useful over 25% of daily working time.

• 한국게임학회 논문지
• /
• 제11권2호
• /
• pp.3-11
• /
• 2011

게임기획자는 내러티브를 기반으로 퀘스트의 초기 설계를 한다. 이러한 게임의 정적 컨텐트 수립에 있어 게임캐릭터의 플레이경험을 사전 예측하는 것은 중요하다. 본 논문은 게임캐릭터가 고유한 스테이터스를 바탕으로 퀘스트 플레이를 수행함에 있어 캐릭터간 구별되는 정서적 인터랙션을 시각화 할 수 있는 방법에 대해 다루고 있다. 이를 위해 첫째, 기존 영상매체에서 내러티브 구조의 시각화에 대한 연구를 바탕으로 둘째, 퀘스트플레이 경험과 플레이어 인지행동을 구체화하였다. 셋째, 사례분석을 통해 캐릭터별 퀘스트플레이 과정에서의 차이를 QUG(Quest Unit Graph)로 시각화하여 직관적인 확인이 가능하도록 하였다. 기존 연구가 캐릭터별 성취(achievement)관점에서의 수치적 밸런스 대한 것에 반해, 본 논문은 내러티브 구조 관점에서 퀘스트플레이 인터랙션에 대한 시각화 모델을 제안함으로써 기획자의 퀘스트 경험설계를 사전 예측해 볼 수 있다.

• 항공우주시스템공학회지
• /
• 제18권2호
• /
• pp.1-11
• /
• 2024

정보공유 기반의 네트워크 협업 유도탄에 대한 상대 충돌 각 유도기법을 불확실성과 외란이 존재하는 시스템에 적용했다. 협업 유도탄 시스템은 전이 축소 방향성 비순환 그래프로 표현되며, 그 구조에 따라 유도된 중앙집권형 및 분산형 유도기법을 소개했다. 또한, 소개된 유도기법을 유도탄의 통신 구조와 시스템 잡음 유무에 따라 비교하여 그 관계를 분석했다. 상대 충돌 각 제어 임무에서 분산형 정보공유 유도기법의 효과를 분석하기 위해 시스템 동역학에 잡음이 포함된 다수의 유도탄이 불확실성이 포함된 예상 요격 위치에 유도되는 상황을 가정하였다. 다양한 임무 환경에 대해 몬테카를로 시뮬레이션을 수행하였으며, 이를 통해 정보공유의 유무와 구조가 시스템에 미치는 영향을 분석했다.