• 정보과학회 컴퓨팅의 실제 논문지
• /
• 제22권12호
• /
• pp.654-662
• /
• 2016

본 논문에서는 가까운 미래에 접하게 될 무인 자율 주행 차량의 주차장에서의 주차 방법과 알고리즘에 대해 살펴보았다. 가장 가까운 주차 장소는 어디이며 어떤 경로를 통해 그 위치로 이동할 것인가 등이 자율주행 차량의 주차를 위한 정보일 것이다. 자율주행 차량의 주차에 적합한 주차장의 구조와 형태를 알아내는 것도 중요한 문제점이 될 것이다. 본 논문에서는 주차장을 그래프로 모델링한 후 중앙제어 시스템을 통해 각 자율주행 차량이 근접한 주차장소로 이동할 수 있도록 안내하는 초기 해결 방법을 제시한다. 몇 가지 구조의 주차장을 모델링한 실험을 통해 본 논문에서 제안한 초기 해결방법이 자율주행차량 주차에 효과적인 안내 시스템이 될 수 있음을 확인하였다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2016년도 추계학술발표대회
• /
• pp.733-734
• /
• 2016

This study proposes a novel approach for ground segmentation of 3D point cloud. We combine two techniques: gradient threshold segmentation, and mean height evaluation. Acquired 3D point cloud is represented as a graph data structures by exploiting the structure of 2D reference image. The ground parts nearing the position of the sensor are segmented based on gradient threshold technique. For sparse regions, we separate the ground and nonground by using a technique called mean height evaluation. The main contribution of this study is a new ground segmentation algorithm which works well with 3D point clouds from various environments. The processing time is acceptable and it allows the algorithm running in real time.

• 대한전기학회논문지:전력기술부문A
• /
• 제55권9호
• /
• pp.351-358
• /
• 2006

In this paper, DSPOCS(Digital Switchgear-Panel Operation and Control Solution) is designed, which is the intelligent inference based operation and control solution to obtain the safety and reliability of electric power supply in substation based on IED. DSPOCS is designed as a scheduled monitoring and control task and a real-time alarm inference task, and is interlinked with BRES(Bus Reconfiguration Expert System) in the required case. The intelligent alarm inference task consists of the alarm knowledge generation part and the real-time pattern matching part. The alarm knowledge generation part generates automatically alarm knowledge from DB saves it in alarm knowledge base. On the other hand, the pattern matching part inferences the real-time event by comparing the real-time event information furnished from IEDs of substation with the patterns of the saved alarm knowledge base.; Especially, alarm knowledge base includes the knowledge patterns related with fault alarm, the overload alarm and the diagnosis alarm. In order to design the database independently in substation structure, busbar is represented as a connectivity node which makes the more generalized graph theory possible. Finally, DSPOCS is implemented in MS Visual $C^{++}$, MFC, the effectiveness and accuracy of the design is verified by simulation study to the typical distribution substation.

• 로봇학회논문지
• /
• 제9권2호
• /
• pp.104-110
• /
• 2014

Mapping is a fundamental element for robotic services. There are available many types of map data representation such as grid map, metric map, topology map, etc. As more robots are deployed for services, more chances of exchanging map data among the robots emerge and standardization of map data representation (MDR) becomes more valuable. Currently, activities in developing MDR standard are underway in IEEE Robotics and Automation Society. The MDR standard is for a common representation and encoding of the two-dimensional map data used for navigation by mobile robots. The standard focuses on interchange of map data among components and systems, particularly those that may be supplied by different vendors. This paper aims to introduce MDR standard and its application to map merging. We have applied the basic structure of the MDR standard to a grid map and Voronoi graph as a kind of topology map and performed map merging between two different maps. Simulation results show that the proposed MDR is suitable for map data exchange among robots.

• Asia pacific journal of information systems
• /
• 제11권2호
• /
• pp.121-139
• /
• 2001

VOQL* query language, recently proposed, is a visual language for object-oriented databases. It is based on Ven Diagram and graph, so that the underlying schema structure can be naturally implied in query expressions. In VOQL*, structural relationship among the objects used in a query expression is represented graphically and thus it has formal semantics that can be inductively defined, as well as it can be used with ease. In this paper, we proposed revised VOQL* and introduced its query processor, InQs(Intelligent Querying System). While retaining the merit of VOQL* that it allows the structural relationship among the objects to be represented visually, the revised VOQL* has another merit that users can formulate a query interactively using various forms supplied by InQs. As a query processor that translates queries in revised VOQL into those in ODMG OQL, InQs provides an environment in which users express queries in revised VOQL* and then the system automatically translates them into those in ODMG OQL. Translation algorithm of InQs is much simpler and intuitive than other algorithms used in QUIVER and other systems, since it reflects the formal semantics of VOQL*, which is defined inductively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.5888-5903
• /
• 2019

The Relational ranking method applies authority-based ranking in relational dataset that can be modeled as graphs considering also their tuples' values. Authority directions from tuples that contain the given keywords and transfer to their corresponding neighboring nodes in accordance with their values and semantic connections. From our previous work, ObjectRank extends to ValueRank that also takes into account the value of tuples in authority transfer flows. In a maked difference from ObjectRank, which only considers authority flows through relationships, it is only valid in the bibliographic databases e.g. DBLP dataset, ValueRank facilitates the estimation of importance for any databases, e.g. trading databases, etc. A relational keyword search paradigm Object Summary (denote as OS) is proposed recently, given a set of keywords, a group of Object Summaries as its query result. An OS is a multilevel-tree data structure, in which node (namely the tuple with keywords) is OS's root node, and the surrounding nodes are the summary of all data on the graph. But, some of these trees have a very large in total number of tuples, size-l OSs are the OS snippets, have also been investigated using ValueRank.We evaluated the real bibliographical dataset and Microsoft business databases to verify of our proposed approach.

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.499-510
• /
• 2007

Shortest path tree(SPT) construction is essential in high performance routing in an interior network using link state protocols. When some links have new state values, SPTs may be rebuilt, but the total rebuilding of the SPT in a static way for a large computer network is not only computationally expensive, unnecessary modifications can cause routing table instability. This paper presents a new update algorithm, dynamic shortest path tree(DSPT) that is computationally economical and that maintains the unmodified nodes mostly from an old SPT to a new SPT. The proposed algorithm reduces redundancy using a dynamic update approach where an edge becomes the significant edge when it is extracted from a built edge list Q. The average number of significant edges are identified through probability analysis based on an arbitrary tree structure. An update derived from significant edges is more efficient because the DSPT algorithm neglect most other redundant edges that do not participate in the construction of a new SPT. Our complexity analysis and experimental results show that DSPT is faster than other known methods. It can also be extended to solve the SPT updating problem in a graph with negative weight edges.

• 산업경영시스템학회지
• /
• 제29권1호
• /
• pp.1-8
• /
• 2006

This paper proposes a real-time resource allocation algorithm for minimizing the completion time of overall workflow process. The jobs in a workflow process are interrelated through the precedence graph including Sequence, AND, OR and Loop control structure. A resource should be allocated for the processing of each job, and the required processing time of the job can be varied by the resource allocation decision. Each resource has several inherent restrictions such as the functional, geographical, positional and other operational characteristics. The algorithm suggested in this paper selects an effective resource for each job by considering the precedence constraint and the resource characteristics such as processing time and the inherent restrictions. To investigate the performance of the proposed algorithm, several numerical tests are performed for four different workflow graphs including standard, parallel and two series-parallel structures. In the tests, the solutions by the proposed algorithm are compared with random and optimal solutions which are obtained by a random selection rule and a full enumeration method respectively.

• 한국컴퓨터정보학회논문지
• /
• 제1권1호
• /
• pp.147-158
• /
• 1996

본 논문에서는 작업 스케쥴러를 가진 통합된 실 시간 동시성제어 수행 과정을 분석하여 특수화된 데이타 흐름 그래프에 기초로한 동시성 제어구조를 제안하였다. 자료들은 토큰들의 이산 흐름에서 한 노드로부터 다른 노드까지의 연결 호 상에 나타내었다. 또 한 E-R모델에서 알려진 네트워크는 데이타 흐름 그래프로 나타내는 고정적인 문제점을 질의어 토큰을 이용하여 그래프상에 나타내게 하였다 그리고 모든 동시성 제어 기법들은 서로 다른 성능을 비교하여 실험으로 측정하였고, DBFG 스케줄링은 분산 환경에서 2PL보다 뛰어난 성능을 갖는다는 것을 비교 분석하였다.

• ETRI Journal
• /
• 제35권2호
• /
• pp.311-320
• /
• 2013

In most spectral clustering approaches, the Gaussian kernel-based similarity measure is used to construct the affinity matrix. However, such a similarity measure does not work well on a dataset with a nonlinear and elongated structure. In this paper, we present a new similarity measure to deal with the nonlinearity issue. The maximum flow between data points is computed as the new similarity, which can satisfy the requirement for similarity in the clustering method. Additionally, the new similarity carries the global and local relations between data. We apply it to spectral clustering and compare the proposed similarity measure with other state-of-the-art methods on both synthetic and real-world data. The experiment results show the superiority of the new similarity: 1) The max-flow-based similarity measure can significantly improve the performance of spectral clustering; 2) It is robust and not sensitive to the parameters.