• Title/Summary/Keyword: Relational Network

Search Result 171, Processing Time 0.032 seconds

An Adaptive Query Processing System for XML Stream Data (XML 스트림 데이타에 대한 적응력 있는 질의 처리 시스템)

  • Kim Young-Hyun;Kang Hyun-Chul
    • Journal of KIISE:Databases
    • /
    • v.33 no.3
    • /
    • pp.327-341
    • /
    • 2006
  • As we are getting to deal with more applications that generate streaming data such as sensor network, monitoring, and SDI (selective dissemination of information), active research is being conducted to support efficient processing of queries over streaming data. The applications on the Web environment like SDI, among others, require query processing over streaming XML data, and its investigation is very important because XML has been established as the standard for data exchange on the Web. One of the major problems with the previous systems that support query processing over streaming XML data is that they cannot deal adaptively with dynamically changing stream because they rely on static query plans. On the other hand, the stream query processing systems based on relational data model have achieved adaptiveness in query processing due to query operator routing. In this paper, we propose a system of adaptive query processing over streaming XML data in which the model of adaptive query processing over streaming relational data is applied. We compare our system with YFiiter, one of the representative systems that provide XML stream query processing capability, to show efficiency of our system.

A Construction of an Ontology Server based Intelligent Retrieval using XMDR (XMDR을 이용한 지능형 검색 온톨로지 서버 구축)

  • Hwang Chi-Gon;Jung Gye-Dong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.8B
    • /
    • pp.549-561
    • /
    • 2005
  • As Internet and network technologies have been developed, e-commerces are getting more complex and more various. This paper, for meta-data and data exchange between heterogeneous database systems, uses XML schema proposed in W3C, and XML schema can present meta-data and data of relational database system as XML document format which is structural. It supports various primitive data formats, so that it uses the structure which reflects adequately data formats which relational database system offered. However, current e-commerces use heterogeneous platforms, so difficulties that is mutual interchange and management exist. For the solution for these problems, a standard ontology which defines relations of product classifications and the standard of property expression and the location ontology which offers e-commerce's information about products are constructed. Applying these ontology information to search system, by offering information which customers need efficient search is performed. Combining these ontologies and product classification category information, called XMDR, this XMDR is introduced into product search system, so this paper proposes to construct ontology server method for efficient search.

The De-identification Technique Using Data Grouping in Relational Database (관계형 데이터베이스에서 데이터 그룹화를 이용한 익명화 처리 기법)

  • Park, Jun-Bum;Jin, Seung-Hun;Choi, Daeseon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.3
    • /
    • pp.493-500
    • /
    • 2015
  • Personal information exposed in the Internet is increasing by the public data opening and sharing, vitalization of SNS(Social Network Service) and growth of information shared between users. Exposed personal information in the Internet can infringe upon targeted users using linkage attack or background attack. To prevent these attack De-identification models were appeared a few years ago. The 'k-anonymity' has been introduced in the first place, and the '${\ell}$-diversity' and 't-closeness' have been followed up as solutions, and diverse algorithms have been being suggested for performance improvement nowadays. However, industry or public sectors actually needs a whole solution as a system for the de-identification process rather than performance of the de-identification algorithm. This paper explains a way of de-identification techique for 'k-anonymity', '${\ell}$-diversity', and 't-closeness' algorithm using QI(Quasi-Identifier) grouping method in the relational database.

Improving the performance for Relation Networks using parameters tuning (파라미터 튜닝을 통한 Relation Networks 성능개선)

  • Lee, Hyun-Ok;Lim, Heui-Seok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2018.05a
    • /
    • pp.377-380
    • /
    • 2018
  • 인간의 추론 능력이란 문제에 주어진 조건을 보고 문제 해결에 필요한 것이 무엇인지를 논리적으로 생각해 보는 것으로 문제 상황 속에서 일정한 규칙이나 성질을 발견하고 이를 수학적인 방법으로 법칙을 찾아내거나 해결하는 능력을 말한다. 이러한 인간인지 능력과 유사한 인공지능 시스템을 개발하는데 있어서 핵심적 도전은 비구조적 데이터(unstructured data)로부터 그 개체들(object)과 그들간의 관계(relation)에 대해 추론하는 능력을 부여하는 것이라고 할 수 있다. 지금까지 딥러닝(deep learning) 방법은 구조화 되지 않은 데이터로부터 문제를 해결하는 엄청난 진보를 가져왔지만, 명시적으로 개체간의 관계를 고려하지 않고 이를 수행해왔다. 최근 발표된 구조화되지 않은 데이터로부터 복잡한 관계 추론을 수행하는 심층신경망(deep neural networks)은 관계추론(relational reasoning)의 시도를 이해하는데 기대할 만한 접근법을 보여주고 있다. 그 첫 번째는 관계추론을 위한 간단한 신경망 모듈(A simple neural network module for relational reasoning) 인 RN(Relation Networks)이고, 두 번째는 시각적 관찰을 기반으로 실제대상의 미래 상태를 예측하는 범용 목적의 VIN(Visual Interaction Networks)이다. 관계 추론을 수행하는 이들 심층신경망(deep neural networks)은 세상을 객체(objects)와 그들의 관계(their relations)라는 체계로 분해하고, 신경망(neural networks)이 피상적으로는 매우 달라 보이지만 근본적으로는 공통관계를 갖는 장면들에 대하여 객체와 관계라는 새로운 결합(combinations)을 일반화할 수 있는 강력한 추론 능력(powerful ability to reason)을 보유할 수 있다는 것을 보여주고 있다. 본 논문에서는 관계 추론을 수행하는 심층신경망(deep neural networks) 중에서 Sort-of-CLEVR 데이터 셋(dataset)을 사용하여 RN(Relation Networks)의 성능을 재현 및 관찰해 보았으며, 더 나아가 파라미터(parameters) 튜닝을 통하여 RN(Relation Networks) 모델의 성능 개선방법을 제시하여 보았다.

Development of Demand Forecasting Algorithm in Smart Factory using Hybrid-Time Series Models (Hybrid 시계열 모델을 활용한 스마트 공장 내 수요예측 알고리즘 개발)

  • Kim, Myungsoo;Jeong, Jongpil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.5
    • /
    • pp.187-194
    • /
    • 2019
  • Traditional demand forecasting methods are difficult to meet the needs of companies due to rapid changes in the market and the diversification of individual consumer needs. In a diversified production environment, the right demand forecast is an important factor for smooth yield management. Many of the existing predictive models commonly used in industry today are limited in function by little. The proposed model is designed to overcome these limitations, taking into account the part where each model performs better individually. In this paper, variables are extracted through Gray Relational analysis suitable for dynamic process analysis, and statistically predicted data is generated that includes characteristics of historical demand data produced through ARIMA forecasts. In combination with the LSTM model, demand forecasts can then be calculated by reflecting the many factors that affect demand forecast through an architecture that is structured to avoid the long-term dependency problems that the neural network model has.

Design of Distributed Hadoop Full Stack Platform for Big Data Collection and Processing (빅데이터 수집 처리를 위한 분산 하둡 풀스택 플랫폼의 설계)

  • Lee, Myeong-Ho
    • Journal of the Korea Convergence Society
    • /
    • v.12 no.7
    • /
    • pp.45-51
    • /
    • 2021
  • In accordance with the rapid non-face-to-face environment and mobile first strategy, the explosive increase and creation of many structured/unstructured data every year demands new decision making and services using big data in all fields. However, there have been few reference cases of using the Hadoop Ecosystem, which uses the rapidly increasing big data every year to collect and load big data into a standard platform that can be applied in a practical environment, and then store and process well-established big data in a relational database. Therefore, in this study, after collecting unstructured data searched by keywords from social network services based on Hadoop 2.0 through three virtual machine servers in the Spring Framework environment, the collected unstructured data is loaded into Hadoop Distributed File System and HBase based on the loaded unstructured data, it was designed and implemented to store standardized big data in a relational database using a morpheme analyzer. In the future, research on clustering and classification and analysis using machine learning using Hive or Mahout for deep data analysis should be continued.

A network approach to local water management for building collaborative water governance: the case of Jeju special self-governing province (지방자치단체의 협력적 물 거버넌스 구축을 위한 네트워크 분석: 제주특별자치도의 물관리 사례를 중심으로)

  • Kim, Boram;Yang, Wonseok;Ahn, Jongho
    • Journal of Korea Water Resources Association
    • /
    • v.53 no.9
    • /
    • pp.671-680
    • /
    • 2020
  • This study aims to explore structural properties and central actors of the local water policy system through a network approach, and to suggest practical implications for establishing collaborative water governance at the local level. Especially, this study conducts a social network analysis to empirically analyze the actors' roles and relationships of water management in Jeju Special Self-Governing Province and represent them with sociograms. In this study, the local water management network is divided into two dimensions: official work network, public-private policy network based on information-sharing and consultation. Also, the networks are divided into a whole network and two sectoral networks(water-use/water-quality). This study found some meaningful differences of structural properties and central actors not only in the official work networks and the policy networks but also in the water-use networks and the water-quality networks. Thus, public managers should diagnose and manage the relational properties among multiple stakeholders in local water sector through a network perspective. In particular, (1)co-operation between the administrative departments responsible for water-use and water-quality, and (2)information-sharing and consultation among public and private stakeholders should be improved to establish collaborative local water governance.

Design and Implementation of Sensor Registry Data Model for IoT Environment (IoT 환경을 위한 센서 레지스트리 데이터 모델의 설계 및 구현)

  • Lee, Sukhoon;Jeong, Dongwon;Jung, Hyunjun;Baik, Doo-Kwon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.5
    • /
    • pp.221-230
    • /
    • 2016
  • With emerging the Internet of Things (IoT) paradigm, the sensor network and sensor platform technologies have been changed according to exploding amount of sensors. Sensor Registry System (SRS) as a sensor platform is a system that registers and manages sensor metadata for consistent semantic interpretation in heterogeneous sensor networks. However, the SRS is unsuitable for the IoT environment. Therefore, this paper proposes sensor registry data model to register and manager sensor information in the IoT environment. We analyze Semantic Sensor Network Ontology (SSNO) for improving the existed SRS, and design metamodel based on the analysis result. We also build tables in a relational database using the designed metamodel, then implement SRS as a web application. This paper applies the SSNO and sensor ontology examples with translating into the proposed model in order to verify the suitability of the proposed sensor registry data model. As the evaluation result, the proposed model shows abundant expression of semantics by comparison with existed models.

Message Delivery Techniques using Group Intimacy Information among Nodes in Opportunistic Networks (기회주의적 네트워크에서 노드의 그룹 친밀성 정보를 이용한 메시지 전달 기법)

  • Kim, Seohyang;Oh, Hayoung;Kim, Chongkwon
    • Journal of KIISE
    • /
    • v.42 no.7
    • /
    • pp.929-938
    • /
    • 2015
  • In opportunistic networks, each message is delivered to the destination by repeating, storing, carrying, and forwarding the message. Recently, with the vitalization of social networks, a large number of existing articles have shown performance improvement when delivering the message and considering its social relational networks. However, these works only deliver messages when they find nodes, assuming that every node cooperates with each other unconditionally. Moreover, they only consider the number of short-term contacts and local social relations, but have not considered each node's average relation with the destination node. In this paper, we propose novel message sending techniques for opportunistic networks using nodes' social network characteristics. In this scheme, each message is delivered to the destination node with fewer copies by delivering it mostly through nodes that have high intimacy with the destination node. We are showing that our proposed scheme presents a 20% performance increase compared to existing schemes.

A study of transitivity of English clause (영어절의 의미분석에 관한 연구)

  • Lee, Sang-Yoon
    • English Language & Literature Teaching
    • /
    • no.6
    • /
    • pp.159-178
    • /
    • 2000
  • In systemic grammar an English clause is analysed simultaneously from the point view of its ideational function, interpersonal function and textual function. This study deals with only the ideational function of the three functions, which accounts for the underlying content of a clause. Transitivity is the subsystem of the ideational function. It specifies the different types of process that are recongnized in the language and the structures by which they are expressed. The purpose of the paper is to describe the transitivity of English clause on the basis of systemic approach. For this we analyzed the three subsystems of transitivity which are physical process, mental process and relational process in the form of features. And we described the sets of the features of the three different types of process in English clause in the framework of the system network.

  • PDF