• Title/Summary/Keyword: 그리드 기반 맵

Search Result 22, Processing Time 0.023 seconds

Visualization Model for Security Threat Data in Smart Factory based on Heatmap (히트맵 기반 스마트팩토리 보안위협 데이터 시각화 모델)

  • Jung, In-Su;Kim, Eui-Jin;Kwak, Jin
    • Annual Conference of KIPS
    • /
    • 2021.11a
    • /
    • pp.284-287
    • /
    • 2021
  • 4차 산업혁명으로 인해 제조산업에 인공지능, 빅데이터와 같은 ICT 기술을 활용한 스마트팩토리의 제조 공정 자동화 및 장치 고도화 연구가 진행되고 있다. 제조 공정 자동화를 위해 스마트팩토리의 각 계층별 장치들이 유기적으로 연결되고 있으며, 이로 인해 발생 가능한 보안위협도 증가하고 있다. 스마트팩토리에서는 SIEM 등의 장비가 보안위협 데이터를 수집·분석·시각화하여 대응하고 있다. 보안위협 데이터 시각화에는 그리드 뷰, 피벗 뷰, 그래프, 차트, 테이블을 활용한 대시보드 형태로 제공하고 있지만, 이는 스마트팩토리 전 계층의 보안위협 데이터 확인에 대한 가시성이 부족하다. 따라서, 본 논문에서는 스마트팩토리 보안위협 데이터를 CVSS 점수 기반의 Likelihood와 보안위협 데이터 기반의 Impact를 활용하여 위험도를 도출하고, 히트맵 기반 스마트팩토리 보안위협 데이터 시각화 모델을 제안한다.

A Path Generation Method for a Autonomous Mobile Robot based on a Virtual Elastic Force (가상 탄성력을 이용한 자율이동로봇 경로생성 방법)

  • Kwon, Young-Kwan
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.1
    • /
    • pp.149-157
    • /
    • 2013
  • This paper describes a global path planning method and path optimization algorithm for autonomous mobile robot based on the virtual elastic force in a grid map environment. A goal of a path planning is information for a robot to go its goal point from start point by a effective way. The AStar algorithm is a well-known method for a grid based path planning. This paper suggest a path optimization method by a virtual elastic force and compare the algorithm with a orignal AStar method. The virtual elastic force makes a shorter and smoother path. It is a profitable algorithm to optimize a path in a grid environment.

The Method of Power Domain Ontology Construction and Reasoning based on Power Business Platform (전력 비즈니스 플랫폼 기반의 전력 도메인 온톨로지 구축 및 추론 방법)

  • Hong, Taekeun;Yu, Kyungho;Kim, Pankoo
    • Smart Media Journal
    • /
    • v.9 no.2
    • /
    • pp.51-62
    • /
    • 2020
  • Starting with the "Smart Grid National Road Map" in 2010, the Smart Grid 2030 was introduced through the basic plan and implementation plan of the intelligent power grid with the goal of building the world's first national smart grid. In this paper, we intend to build a power domain ontology based on the power business platform based on the upper and lower conceptual models of the "Smart Grid Interoperability Standard Framework and Roadmap", the standard of implementation plan. Ontology is suitable for expressing and utilizing the smart grid conceptual model because it considers hierarchical structure as knowledge defines the properties of entities and relationships between entities, but there is no research related to them. Therefore, in this paper, the upper ontology was defined as a major category for smart grid-related fields, and the lower ontology was defined as detailed systems and functions for the upper ontology to construct the ontology. In addition, scenarios in various situations that could occur in the power system were constructed and significant inference results were derived through inference engines and queries.

Data Sampling-based Angular Space Partitioning for Parallel Skyline Query Processing (데이터 샘플링을 통한 각 기반 공간 분할 병렬 스카이라인 질의처리 기법)

  • Chung, Jaehwa
    • The Journal of Korean Association of Computer Education
    • /
    • v.18 no.5
    • /
    • pp.63-70
    • /
    • 2015
  • In the environment that the complex conditions need to be satisfied, skyline query have been applied to various field. To processing a skyline query in centralized scheme, several techniques have been suggested and recently map/reduce platform based approaches has been proposed which divides data space into multiple partitions for the vast volume of multidimensional data. However, the performances of these approaches are fluctuated due to the uneven data loading between servers and redundant tasks. Motivated by these issues, this paper suggests a novel technique called MR-DEAP which solves the uneven data loading using the random sampling. The experimental result gains the proposed MR-DEAP outperforms MR-Angular and MR-BNL scheme.

Development of Optimal Path Planning based on Density Data of Obstacles (장애물 밀집 정보 기반 최적 경로계획 기술 개발)

  • Kang, Won-Seok;Kim, Jin-Wook;Kim, Young-Duk;Lee, Seung-Hyun;An, Jin-Ung
    • Proceedings of the IEEK Conference
    • /
    • 2009.05a
    • /
    • pp.366-368
    • /
    • 2009
  • 본 논문에서는 모바일 로봇이 작업하는 공간상에서 빠르고 안전한 최적 경로계획을 수행할 수 있게 하는 가변적 리드 맵을 이용한 장애물 밀집 정보 기반 경로계획을 제안한다. 모바일 로봇이 작업 공간에 대해서 빠르고 안전한 경로계획을 해 클러스터링 기법을 이용하여 정적 및 동적 장애물의 분포에 대한 맵 정보를 재구성하여 정보화 시킨다. 최적의 경로계획을 위해서는 재구성된 장애물 밀집 클러스터 데이터를 이용하여 전통적 기법의 GA 방법을 변형한 최적 경로계획을 수행한다. 제안한 기술의 효율성을 검증하기 위해 그리드 기반 경로계획 중의 하나인 A*알고리즘과 다양한 맵을 이용하여 성능 비교를 수행하였다. 실험결과 제안한 경로계획 기술은 기존 알고리즘 보다 빠른 처리 성능과 동적 장애물이 밀집한 지역을 회피하는 최적 경로계획을 수행함을 확인하였다.

  • PDF

A Bitmap Index for Chunk-Based MOLAP Cubes (청크 기반 MOLAP 큐브를 위한 비트맵 인덱스)

  • Lim, Yoon-Sun;Kim, Myung
    • Journal of KIISE:Databases
    • /
    • v.30 no.3
    • /
    • pp.225-236
    • /
    • 2003
  • MOLAP systems store data in a multidimensional away called a 'cube' and access them using way indexes. When a cube is placed into disk, it can be Partitioned into a set of chunks of the same side length. Such a cube storage scheme is called the chunk-based MOLAP cube storage scheme. It gives data clustering effect so that all the dimensions are guaranteed to get a fair chance in terms of the query processing speed. In order to achieve high space utilization, sparse chunks are further compressed. Due to data compression, the relative position of chunks cannot be obtained in constant time without using indexes. In this paper, we propose a bitmap index for chunk-based MOLAP cubes. The index can be constructed along with the corresponding cube generation. The relative position of chunks is retained in the index so that chunk retrieval can be done in constant time. We placed in an index block as many chunks as possible so that the number of index searches is minimized for OLAP operations such as range queries. We showed the proposed index is efficient by comparing it with multidimensional indexes such as UB-tree and grid file in terms of time and space.

Efficient Coverage Algorithm based-on Grouping for Autonomous Intelligent Robots (자율 지능형 로봇을 위한 그룹화 기반의 효율적 커버리지 알고리즘)

  • Jeon, Heung-Seok;Noh, Sam-H.
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.2
    • /
    • pp.243-250
    • /
    • 2008
  • The coverage algorithm based on Boustrophedon path has been known to be the most efficient in places without or less obstacles If the map of an environmental area thru SLAM algorithm can be obtainable. However, the efficiency of the coverage algorithm based on Boustrophedon path drops drastically when obstacles are complex. In this paper, we propose and implement a new algorithm, which we call Group-k, that efficiently handles the complex area. The Group-k algorithm groups the obstacles and prioritizes the covering sequences with complex rank of the groups. Implementation-based experiments show about 20% improved performance when applying the nor- algorithm, compared to the Boustrophedon path algorithm.

  • PDF

Design of Security RoadMap for C4I System (C4I 시스템 보안 로드맵 설계)

  • Lee, Gang-Taek;Lee, Dong-Hwi;Yang, Jae-Su;J. Kim, Kui-Nam;Park, Sang-Min
    • Convergence Security Journal
    • /
    • v.6 no.4
    • /
    • pp.113-120
    • /
    • 2006
  • C4I system is the centerpiece of the military force. The system is an information based system which facilitates information grid, collection of data and dissemination of the information. The C4I system seeks to assure information dominance by linking warfighting elements in the battlespace to information network which enables sharing of battlespace information and awareness; thereby shifting concept of warfare from platform-centric paradigm to Network Centric Warfare. Although, it is evident that C4I system is a constant target from the adversaries, the issues of vulnerability via cyberspace from attack still remains. Therefore, the protection of C4I system is critical. The roadmap I have constructed in this paper will guide through the direction to protect the system during peace and war time. Moreover, it will propose vision, objectives and necessary supporting framework to secure the system from the threat. In order to fulfill these tasks, enhanced investments and plans from the Joint chief of Staff and Defense of Acquisition and Program Administration (DAPA) is critical; thereby enabling the establishment of rapid and efficient security system.

  • PDF

Unsupervised Monocular Depth Estimation Using Self-Attention for Autonomous Driving (자율주행을 위한 Self-Attention 기반 비지도 단안 카메라 영상 깊이 추정)

  • Seung-Jun Hwang;Sung-Jun Park;Joong-Hwan Baek
    • Journal of Advanced Navigation Technology
    • /
    • v.27 no.2
    • /
    • pp.182-189
    • /
    • 2023
  • Depth estimation is a key technology in 3D map generation for autonomous driving of vehicles, robots, and drones. The existing sensor-based method has high accuracy but is expensive and has low resolution, while the camera-based method is more affordable with higher resolution. In this study, we propose self-attention-based unsupervised monocular depth estimation for UAV camera system. Self-Attention operation is applied to the network to improve the global feature extraction performance. In addition, we reduce the weight size of the self-attention operation for a low computational amount. The estimated depth and camera pose are transformed into point cloud. The point cloud is mapped into 3D map using the occupancy grid of Octree structure. The proposed network is evaluated using synthesized images and depth sequences from the Mid-Air dataset. Our network demonstrates a 7.69% reduction in error compared to prior studies.

FingerPrint building method using Splite-tree based on Indoor Environment (실내 환경에서 WLAN 기반의 Splite-tree를 이용한 가상의 핑거 프린트 구축 기법)

  • Shin, Soong-Sun;Kim, Gyoung-Bae;Bae, Hae-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.6
    • /
    • pp.173-182
    • /
    • 2012
  • A recent advance in smart phones is increasing utilization of location information. Existing positioning system was using GPS location for positioning. However, the GPS cannot be used indoors, if GPS location has an incorrectly problem. In order to solve indoor positioning problems of indoor location-based positioning techniques have been investigated. There are a variety of techniques based on indoor positioning techniques like as RFID, UWB, WLAN, etc. But WLAN location positioning techniques take advantage the bond in real life. WLAN indoor positioning techniques have a two kind of method that is centroid and fingerprint method. Among them, the fingerprint technique is commonly used because of the high accuracy. In order to use fingerprinting techniques make a WLAN signal map building that is need to lot of resource. In this paper, we try to solve this problem in an Indoor environment for WLAN-based fingerprint of a virtual building technique, which is proposed. Proposed technique is classified Cell environment in existed Indoor environment, all of fingerprint points are shown virtual grid map in each Cell. Its method can make fingerprint grid map very quickly using estimate virtual signal value. Also built signal value can take different value depending of the real estimate value. To solve this problem using a calibration technique for the Splite-tree is proposed. Through calibration technique that improves the accuracy for short period of time. It also is improved overall accuracy using predicted value of around position in cell.