• 전자공학회논문지A
• /
• 제29A권2호
• /
• pp.88-99
• /
• 1992

This paper presents an efficient method of mapping Boolean equations to a set of library gates. The proposed system performs technology mapping by graph covering. To select optimal area cover, a new cost function and local area optimization are proposed. Experimental results show that the proposed algorithm produces effective mapping using given library.

• 한국지능시스템학회논문지
• /
• 제21권4호
• /
• pp.493-498
• /
• 2011

본 논문은 측정값의 우도를 기준으로 선택적인 측정값 적용을 통한 향상된 GraphSLAM을 제안하였다. GraphSLAM은 로봇의 이동 경로와 환경에 대한 지도를 전체 입력 데이터를 통해 추정한다. 그러나 잡음이 강한 환경에서 센서의 측정치가 부정확한 경우가 늘어나면, 전체 입력 데이터를 사용하는 GraphSLAM의 경우 정확성이 크게 떨어지게 된다. 그러므로 본 논문에서는 들어오는 센서의 측정값들을 선별하여 GraphSLAM에 적용하는 방법을 제안한다. 이 방법을 통해 잡음이 강한 환경에서 기존의 GraphSLAM보다 향상된 성능을 제공할 수 있다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1121-1124
• /
• 1987

Previous methods to map from a FORTRAN-like specification into a systolic array were difficult to find data dependencies because the specification was expressed and executed sequentially. Data-flow graph(DFG)s show data dependencies explicitly. In this paper we show a mapping tool from a DFG specification into a systolic array. We introduce the concept of a Systolic Pattern Stream(SPS) and use that concept to derive a systolic array.

• 로봇학회논문지
• /
• 제12권4호
• /
• pp.385-394
• /
• 2017

Side scanning sonar (SSS) provides valuable information for robot navigation. However using the side scanning sonar images in the navigation was not fully studied. In this paper, we use range data, and side scanning sonar images from UnderWater Simulator (UWSim) and propose measurement models in a feature based simultaneous localization and mapping (SLAM) framework. The range data is obtained by echosounder and sidescanning sonar images from side scan sonar module for UWSim. For the feature, we used the A-KAZE feature for the SSS image matching and adjusting the relative robot pose by SSS bundle adjustment (BA) with Ceres solver. We use BA for the loop closure constraint of pose-graph SLAM. We used the Incremental Smoothing and Mapping (iSAM) to optimize the graph. The optimized trajectory was compared against the dead reckoning (DR).

• Journal of Applied and Pure Mathematics
• /
• 제5권3_4호
• /
• pp.237-253
• /
• 2023

Let a graph G = (V, E) be a (p, q) graph. Define $${\rho}=\{\array{{\frac{p}{2}} & \;\;p\text{ is even} \\ {\frac{p-1}{2}} & \;\;p\text{ is odd,}$$ and M = {±1, ±2, … ± ρ} called the set of labels. Consider a mapping λ : V → M by assigning different labels in M to the different elements of V when p is even and different labels in M to p - 1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge uv of G, there exists a labeling ${\frac{{\lambda}(u)+{\lambda}(v)}{2}}$ if λ(u) + λ(v) is even and ${\frac{{\lambda}(u)+{\lambda}(v)+1}{2}}$ if λ(u) + λ(v) is odd such that ${\mid}{\bar{{\mathbb{S}}}}_{\lambda}{_1}-{\bar{{\mathbb{S}}}}_{{\lambda}^c_1}{\mid}{\leq}1$ where ${\bar{{\mathbb{S}}}}_{\lambda}{_1}$ and ${\bar{{\mathbb{S}}}}_{{\lambda}^c_1}$ respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G for which there exists a pair mean cordial labeling is called a pair mean cordial graph. In this paper, we investigate the pair mean cordial labeling behavior of few graphs including the closed helm graph, web graph, jewel graph, sunflower graph, flower graph, tadpole graph, dumbbell graph, umbrella graph, butterfly graph, jelly fish, triangular book graph, quadrilateral book graph.

• 한국컴퓨터정보학회논문지
• /
• 제27권11호
• /
• pp.67-80
• /
• 2022

본 논문에서는 RML 매핑 방식으로 생성된 RDF 지식 그래프의 구조를 묘사하고 검증할 용도의 ShEx 스키마를 자동으로 생성하는 시스템을 제안한다. ShEx 스키마는 제약 조건들로 구성된다. 제안된 시스템은 대부분의 제약 조건을 RML 매핑 규칙을 변환하여 생성한다. 매핑 규칙에서 유도된 제약 조건만으로 구성한 스키마는 사용자가 RML 매핑으로 생성한 그래프의 구조를 파악하는 데 도움을 주는 용도로는 부족함이 없지만 정교한 검증 용도로 사용하기에는 충분치 않다. 검증 용도에 부합하는 스키마가 요구될 경우, 제안된 시스템은 RML 매핑의 입력 데이터 소스에서 추출한 메타데이터를 사용해 만든 제약 조건이 추가된 스키마를 생성할 수 있다. 제안된 시스템이 지원하는 입력 데이터 소스 유형은 CSV, XML, JSON, RDBMS다. 297개의 테스트 케이스로 구성된 실험에서 보인 결과는 제안된 시스템이 RML 매핑으로 생성된 RDF 그래프 검증을 위해 범용적으로 사용될 수 있음을 보여준다.

• 로봇학회논문지
• /
• 제9권1호
• /
• pp.1-10
• /
• 2014

In recent years, the research of 3D mapping technique in urban environments obtained by mobile robots equipped with multiple sensors for recognizing the robot's surroundings is being studied actively. However, the map generated by simple integration of multiple sensors data only gives spatial information to robots. To get a semantic knowledge to help an autonomous mobile robot from the map, the robot has to convert low-level map representations to higher-level ones containing semantic knowledge of a scene. Given a 3D point cloud of an urban scene, this research proposes a method to recognize the objects effectively using 3D graph model for autonomous mobile robots. The proposed method is decomposed into three steps: sequential range data acquisition, normal vector estimation and incremental graph-based segmentation. This method guarantees the both real-time performance and accuracy of recognizing the objects in real urban environments. Also, it can provide plentiful data for classifying the objects. To evaluate a performance of proposed method, computation time and recognition rate of objects are analyzed. Experimental results show that the proposed method has efficiently in understanding the semantic knowledge of an urban environment.

• 한국통신학회논문지
• /
• 제35권4A호
• /
• pp.350-359
• /
• 2010

본 논문에서는 OFDMA를 이용하는 dedicated channel 펨토셀 시스템에서 각 펨토셀이 사용할 subchannel을 할당하는 방법에 대하여 연구한다. 본 subchannel 할당 기법은 가장 적은 수의 subchannel을 할당받는 펨토셀의 subchannel 수를 최대화 하면서 시스템 내의 펨토셀들이 사용하는 subchannel 수의 합을 최대화하는 것을 목표로 한다. 제안된 알고리즘은 interference graph 생성, 컬러링 수행, 각 컬러별 subchannel 연결의 세 단계로 구성된다. 첫 번째 단계에서는 펨토셀 시스템을 각 펨토셀을 node로, 서로 간섭을 겪는 펨토셀들을 edge로 한 interference graph로 모델링 한다. 이후 interfrence graph에 graph theory의 컬러링 기법을 이용하여 각 펨토셀에 컬러를 할당하고, 각 컬러에 subchannel들을 매핑하여, 각 펨토셀에 subchannel을 할당한다. 마지막으로 본 알고리즘의 성능을 시뮬레이션을 통하여 검증한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5731-5754
• /
• 2019

In this paper, we redesign, implement, and evaluate ShareSafe (Based on SecGraph), an open-source secure graph data sharing/publishing platform. Within ShareSafe, we propose De-anonymization Quantification Module and Recommendation Module. Besides, we model the attackers' background knowledge and evaluate the relation between graph data privacy and the structure of the graph. To the best of our knowledge, ShareSafe is the first platform that enables users to perform data perturbation, utility evaluation, De-A evaluation, and Privacy Quantification. Leveraging ShareSafe, we conduct a more comprehensive and advanced utility and privacy evaluation. The results demonstrate that (1) The risk of privacy leakage of anonymized graph increases with the attackers' background knowledge. (2) For a successful de-anonymization attack, the seed mapping, even relatively small, plays a much more important role than the auxiliary graph. (3) The structure of graph has a fundamental and significant effect on the utility and privacy of the graph. (4) There is no optimal anonymization/de-anonymization algorithm. For different environment, the performance of each algorithm varies from each other.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4347-4366
• /
• 2015

Distinguished with traditional strategies which offload an application's computation to a single server, parallel computation offloading can promote the performance by simultaneously delivering the computation to multiple computing resources around the mobile terminal. However, due to the variability of communication and computation environments, static application component multi-partitioning algorithms are difficult to maintain the optimality of their solutions in time-varying scenarios, whereas, over-frequent algorithm executions triggered by changes of environments may bring excessive algorithm costs. To this end, an adaptive application component mapping algorithm for parallel computation offloading in variable environments is proposed in this paper, which aims at minimizing computation costs and inter-resource communication costs. It can provide the terminal a suitable solution for the current environment with a low incremental algorithm cost. We represent the application component multi-partitioning problem as a graph mapping model, then convert it into a pathfinding problem. A genetic algorithm enhanced by an elite-based immigrants mechanism is designed to obtain the solution adaptively, which can dynamically adjust the precision of the solution and boost the searching speed as transmission and processing speeds change. Simulation results demonstrate that our algorithm can promote the performance efficiently, and it is superior to the traditional approaches under variable environments to a large extent.