• 제목/요약/키워드: Grid-based data

검색결과 1,148건 처리시간 0.027초

Globus Tookit V.3를 사용한 OGSA 기반 서비스 데이터 수집기 서비스 구현 (Implementation of a Service Data Aggregator Service based on OGSA By Using Globes Toolkit V.3)

  • 강윤희
    • 디지털콘텐츠학회 논문지
    • /
    • 제6권1호
    • /
    • pp.1-5
    • /
    • 2005
  • 이 논문에서는 OGSA 기반 그리드 서비스의 특징을 기술하고 서비스 데이터 요구(Service Data Element, SDE) 정보 수집을 위한 그리드 서비스를 기술한다. 그리드 서비스의 구성을 위해서는, 주요한 시스템 컴포넌트와 이들 간의 상호작용을 표현하는 시스템의 고수준의 소프트웨어 아키텍처로의 그리드 서비스를 구성하기 위한 체계적인 접근이 고려되어야 한다. 이 논문의 목적은 SDE를 수집단위로 하는 서비스 데이터 수집 서비스의 설계 및 구현으로 이를 위해 CR의 서비스 데이터 수집기 서비스를 자원 및 서비스의 종류에 따라 SDE를 영속적으로 유지할 수 있도록 저장 스킴을 구성하고 XML DBMS인 Xindice사용하여 확장하였다. 서비스 데이터 수집 서비스는 인터넷과 같은 광대역 환경에서의 효율적인 수행을 위해 통지 메커니즘에 의해 비동기적으로 작동한다.

  • PDF

전국 기후변화 영향평가를 위한 분포형 수문분석 툴 개발 (Development of Distributed Hydrological Analysis Tool for Future Climate Change Impacts Assessment of South Korea)

  • 김성준;김상호;조형경;안소라
    • 한국농공학회논문집
    • /
    • 제57권2호
    • /
    • pp.15-26
    • /
    • 2015
  • The purpose of this paper is to develop a software tool, PGA-CC (Projection of hydrology via Grid-based Assessment for Climate Change) to evaluate the present hydrologic cycle and the future watershed hydrology by climate change. PGA-CC is composed of grid-based input data pre-processing module, hydrologic cycle calculation module, output analysis module, and output data post-processing module. The grid-based hydrological model was coded by Fortran and compiled using Compaq Fortran 6.6c, and the Graphic User Interface was developed by using Visual C#. Other most elements viz. Table and Graph, and GIS functions were implemented by MapWindow. The applicability of PGA-CC was tested by assessing the future hydrology of South Korea by HadCM3 SRES B1 and A2 climate change scenarios. For the whole country, the tool successfully assessed the future hydrological components including input data and evapotranspiration, soil moisture, surface runoff, lateral flow, base flow etc. From the spatial outputs, we could understand the hydrological changes both seasonally and regionally.

Deep Learning-Based Smart Meter Wattage Prediction Analysis Platform

  • Jang, Seonghoon;Shin, Seung-Jung
    • International journal of advanced smart convergence
    • /
    • 제9권4호
    • /
    • pp.173-178
    • /
    • 2020
  • As the fourth industrial revolution, in which people, objects, and information are connected as one, various fields such as smart energy, smart cities, artificial intelligence, the Internet of Things, unmanned cars, and robot industries are becoming the mainstream, drawing attention to big data. Among them, Smart Grid is a technology that maximizes energy efficiency by converging information and communication technologies into the power grid to establish a smart grid that can know electricity usage, supply volume, and power line conditions. Smart meters are equient that monitors and communicates power usage. We start with the goal of building a virtual smart grid and constructing a virtual environment in which real-time data is generated to accommodate large volumes of data that are small in capacity but regularly generated. A major role is given in creating a software/hardware architecture deployment environment suitable for the system for test operations. It is necessary to identify the advantages and disadvantages of the software according to the characteristics of the collected data and select sub-projects suitable for the purpose. The collected data was collected/loaded/processed/analyzed by the Hadoop ecosystem-based big data platform, and used to predict power demand through deep learning.

Volume Rendering using Grid Computing for Large-Scale Volume Data

  • Nishihashi, Kunihiko;Higaki, Toru;Okabe, Kenji;Raytchev, Bisser;Tamaki, Toru;Kaneda, Kazufumi
    • International Journal of CAD/CAM
    • /
    • 제9권1호
    • /
    • pp.111-120
    • /
    • 2010
  • In this paper, we propose a volume rendering method using grid computing for large-scale volume data. Grid computing is attractive because medical institutions and research facilities often have a large number of idle computers. A large-scale volume data is divided into sub-volumes and the sub-volumes are rendered using grid computing. When using grid computing, different computers rarely have the same processor speeds. Thus the return order of results rarely matches the sending order. However order is vital when combining results to create a final image. Job-Scheduling is important in grid computing for volume rendering, so we use an obstacle-flag which changes priorities dynamically to manage sub-volume results. Obstacle-Flags manage visibility of each sub-volume when line of sight from the view point is obscured by other subvolumes. The proposed Dynamic Job-Scheduling based on visibility substantially increases efficiency. Our Dynamic Job-Scheduling method was implemented on our university's campus grid and we conducted comparative experiments, which showed that the proposed method provides significant improvements in efficiency for large-scale volume rendering.

Clustering Algorithm using a Center Of Gravity for Grid-based Sample

  • 박희창;유지현
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 한국데이터정보과학회 2003년도 춘계학술대회
    • /
    • pp.77-88
    • /
    • 2003
  • Cluster analysis has been widely used in many applications, such that data analysis, pattern recognition, image processing, etc. But clustering requires many hours to get clusters that we want, because it is more primitive, explorative and we make many data an object of cluster analysis. In this paper we propose a new clustering method, 'Clustering algorithm using a center of gravity for grid-based sample'. It is more fast than any traditional clustering method and maintains accuracy. It reduces running time by using grid-based sample and keeps accuracy by using representative point, a center of gravity.

  • PDF

K-means Clustering using a Center Of Gravity for grid-based sample

  • 박희창;이선명
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 한국데이터정보과학회 2004년도 춘계학술대회
    • /
    • pp.51-60
    • /
    • 2004
  • K-means clustering is an iterative algorithm in which items are moved among sets of clusters until the desired set is reached. K-means clustering has been widely used in many applications, such as market research, pattern analysis or recognition, image processing, etc. It can identify dense and sparse regions among data attributes or object attributes. But k-means algorithm requires many hours to get k clusters that we want, because it is more primitive, explorative. In this paper we propose a new method of k-means clustering using a center of gravity for grid-based sample. It is more fast than any traditional clustering method and maintains its accuracy.

  • PDF

An Unified Spatial Index and Visualization Method for the Trajectory and Grid Queries in Internet of Things

  • Han, Jinju;Na, Chul-Won;Lee, Dahee;Lee, Do-Hoon;On, Byung-Won;Lee, Ryong;Park, Min-Woo;Lee, Sang-Hwan
    • 한국컴퓨터정보학회논문지
    • /
    • 제24권9호
    • /
    • pp.83-95
    • /
    • 2019
  • Recently, a variety of IoT data is collected by attaching geosensors to many vehicles that are on the road. IoT data basically has time and space information and is composed of various data such as temperature, humidity, fine dust, Co2, etc. Although a certain sensor data can be retrieved using time, latitude and longitude, which are keys to the IoT data, advanced search engines for IoT data to handle high-level user queries are still limited. There is also a problem with searching large amounts of IoT data without generating indexes, which wastes a great deal of time through sequential scans. In this paper, we propose a unified spatial index model that handles both grid and trajectory queries using a cell-based space-filling curve method. also it presents a visualization method that helps user grasp intuitively. The Trajectory query is to aggregate the traffic of the trajectory cells passed by taxi on the road searched by the user. The grid query is to find the cells on the road searched by the user and to aggregate the fine dust. Based on the generated spatial index, the user interface quickly summarizes the trajectory and grid queries for specific road and all roads, and proposes a Web-based prototype system that can be analyzed intuitively through road and heat map visualization.

온톨로지 기반의 그리드 자원선택 시스템 (Ontology-based Grid Resource Selection System)

  • 노창현;장성호;김태영;이종식
    • 한국컴퓨터정보학회논문지
    • /
    • 제13권3호
    • /
    • pp.169-177
    • /
    • 2008
  • 그리드 컴퓨팅 환경에서 컴퓨팅 자원은 매우 다양한 네트워크와 시스템으로 구성되어 있다. 이기종의 환경에서 기존의 자원선택 기법으로 사용자가 원하는 자원을 검색 및 선택하는 것은 자원정보의 저장 구조상 한계가 있다. 본 논문은 사용자의 요구사항과 데이터 특성에 맞는 자원을 선택하기 위해 그리드 자원을 온톨로지로 구축하고, SWRL을 이용하여 정의한 규칙을 바탕으로 추론 엔진을 거쳐서 자원을 선택 및 제공하는 온톨로지 기반의 그리드 자원선택시스템을 제안한다. 실험 결과는 본 논문에서 제안한 온톨로지 기반의 그리드 자원선택 시스템이 기존 그리드 자원선택 시스템인 Condor-G와 Nimrod-G 보다 더 높은 작업 처리율 및 자원 이용률과 적은 작업 손실 및 처리 시간을 보임으로써 그리드 자원선택을 지능적이며 능동적으로 할 수 있고, 자원 이용에 더 효과적이라는 사실을 증명한다.

  • PDF

위상학적 공간 인식을 위한 효과적인 초음파 격자 지도 매칭 기법 개발 (Effective Sonar Grid map Matching for Topological Place Recognition)

  • 최진우;최민용;정완균
    • 로봇학회논문지
    • /
    • 제6권3호
    • /
    • pp.247-254
    • /
    • 2011
  • This paper presents a method of sonar grid map matching for topological place recognition. The proposed method provides an effective rotation invariant grid map matching method. A template grid map is firstly extracted for reliable grid map matching by filtering noisy data in local grid map. Using the template grid map, the rotation invariant grid map matching is performed by Ring Projection Transformation. The rotation invariant grid map matching selects candidate locations which are regarded as representative point for each node. Then, the topological place recognition is achieved by calculating matching probability based on the candidate location. The matching probability is acquired by using both rotation invariant grid map matching and the matching of distance and angle vectors. The proposed method can provide a successful matching even under rotation changes between grid maps. Moreover, the matching probability gives a reliable result for topological place recognition. The performance of the proposed method is verified by experimental results in a real home environment.

Enabling Fine-grained Access Control with Efficient Attribute Revocation and Policy Updating in Smart Grid

  • Li, Hongwei;Liu, Dongxiao;Alharbi, Khalid;Zhang, Shenmin;Lin, Xiaodong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권4호
    • /
    • pp.1404-1423
    • /
    • 2015
  • In smart grid, electricity consumption data may be handed over to a third party for various purposes. While government regulations and industry compliance prevent utility companies from improper or illegal sharing of their customers' electricity consumption data, there are some scenarios where it can be very useful. For example, it allows the consumers' data to be shared among various energy resources so the energy resources are able to analyze the data and adjust their operation to the actual power demand. However, it is crucial to protect sensitive electricity consumption data during the sharing process. In this paper, we propose a fine-grained access control scheme (FAC) with efficient attribute revocation and policy updating in smart grid. Specifically, by introducing the concept of Third-party Auditor (TPA), the proposed FAC achieves efficient attribute revocation. Also, we design an efficient policy updating algorithm by outsourcing the computational task to a cloud server. Moreover, we give security analysis and conduct experiments to demonstrate that the FAC is both secure and efficient compared with existing ABE-based approaches.