• Title/Summary/Keyword: 동적 공간 네트워크

Search Result 106, Processing Time 0.029 seconds

A Collaboration RBAC Model in Ubiquitous Workspace (유비쿼터스 업무공간의 협업 RBAC모델 설계)

  • Lee Soo-Jeong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.06c
    • /
    • pp.271-273
    • /
    • 2006
  • 유비쿼터스 인프라의 발달로 인한 업무 환경의 활발한 변화는, 다양한 (이동성) 단말과 끊김 없는 네트워크를 통하여, 기업 내외부의 응용을 활용하며, 효율적인 상황인식에 따른, 실시간적 업무공간을 지원 받을 것이다. 이는 인증과 인가의 분리 구조로서, 기업 내부의 접근제어 미들웨어와 기업 외부의 서비스 프로바이더 간의 분산 환경을 의미한다. 그러나 이러한 처리는 도메인 상호간 안전한 상호운용성이 선결되어야 한다. 즉 유비쿼터스 업무공간의 협업 서비스를 위한 접근제어모델은, 상황인식과 실시간 정책변경의 처리가 다중도메인간의 안전한 연동과 함께 요구된다. 본 논문은 메타정책(Metapolicies) 기반으로 도메인 내부와 외부도메인의 접근제어를 구분하여 보호한, 다중도메인 관계의 동적 협업 RBAC모델을 제안한다.

  • PDF

A Time Series Analysis of Urban Park Behavior Using Big Data (빅데이터를 활용한 도시공원 이용행태 특성의 시계열 분석)

  • Woo, Kyung-Sook;Suh, Joo-Hwan
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.48 no.1
    • /
    • pp.35-45
    • /
    • 2020
  • This study focused on the park as a space to support the behavior of urban citizens in modern society. Modern city parks are not spaces that play a specific role but are used by many people, so their function and meaning may change depending on the user's behavior. In addition, current online data may determine the selection of parks to visit or the usage of parks. Therefore, this study analyzed the change of behavior in Yeouido Park, Yeouido Hangang Park, and Yangjae Citizen's Forest from 2000 to 2018 by utilizing a time series analysis. The analysis method used Big Data techniques such as text mining and social network analysis. The summary of the study is as follows. The usage behavior of Yeouido Park has changed over time to "Ride" (Dynamic Behavior) for the first period (I), "Take" (Information Communication Service Behavior) for the second period (II), "See" (Communicative Behavior) for the third period (III), and "Eat" (Energy Source Behavior) for the fourth period (IV). In the case of Yangjae Citizens' Forest, the usage behavior has changed over time to "Walk" (Dynamic Behavior) for the first, second, and third periods (I), (II), (III) and "Play" (Dynamic Behavior) for the fourth period (IV). Looking at the factors affecting behavior, Yeouido Park was had various factors related to sports, leisure, culture, art, and spare time compared to Yangjae Citizens' Forest. The differences in Yangjae Citizens' Forest that affected its main usage behavior were various elements of natural resources. Second, the behavior of the target areas was found to be focused on certain main behaviors over time and played a role in selecting or limiting future behaviors. These results indicate that the space and facilities of the target areas had not been utilized evenly, as various behaviors have not occurred, however, a certain main behavior has appeared in the target areas. This study has great significance in that it analyzes the usage of urban parks using Big Data techniques, and determined that urban parks are transformed into play spaces where consumption progressed beyond the role of rest and walking. The behavior occurring in modern urban parks is changing in quantity and content. Therefore, through various types of discussions based on the results of the behavior collected through Big Data, we can better understand how citizens are using city parks. This study found that the behavior associated with static behavior in both parks had a great impact on other behaviors.

Applied Research of Active Network to Control Network Traffic in Virtual Battlefield Environments (가상 전장 환경에서의 효율적인 네트워크 트래픽 처리를 위한 액티브 네트워크 응용방안)

  • 정창모;이원구;김성옥;이재광
    • The Journal of the Korea Contents Association
    • /
    • v.3 no.3
    • /
    • pp.19-33
    • /
    • 2003
  • Computer simulation has used to a area of military training from about several years ago. War game mode(or computer simulation) endow a military man with lied training such as combat experience without operating combat strength or capabilities. To sanely construct simulation environment against actual combat environment associate among federates on network. us construct virtual combat environment enabling to efficiently manage network traffic among federates(or active nodes) by using active network technique on virtual military training space such as urgent combat field needed to rapidly transfer combat information including image and video, verify its validity by the help of simulation

  • PDF

Question Answering Optimization via Temporal Representation and Data Augmentation of Dynamic Memory Networks (동적 메모리 네트워크의 시간 표현과 데이터 확장을 통한 질의응답 최적화)

  • Han, Dong-Sig;Lee, Chung-Yeon;Zhang, Byoung-Tak
    • Journal of KIISE
    • /
    • v.44 no.1
    • /
    • pp.51-56
    • /
    • 2017
  • The research area for solving question answering (QA) problems using artificial intelligence models is in a methodological transition period, and one such architecture, the dynamic memory network (DMN), is drawing attention for two key attributes: its attention mechanism defined by neural network operations and its modular architecture imitating cognition processes during QA of human. In this paper, we increased accuracy of the inferred answers, by adapting an automatic data augmentation method for lacking amount of training data, and by improving the ability of time perception. The experimental results showed that in the 1K-bAbI tasks, the modified DMN achieves 89.21% accuracy and passes twelve tasks which is 13.58% higher with passing four more tasks, as compared with one implementation of DMN. Additionally, DMN's word embedding vectors form strong clusters after training. Moreover, the number of episodic passes and that of supporting facts shows direct correlation, which affects the performance significantly.

A Smart Slab Allocator for Wireless Sensor Operating Systems (무선 센서 운영체제를 위한 지능형 슬랩 할당기)

  • Min, Hong;Yi, Sang-Ho;Heo, Jun-Young;Kim, Seok-Hyun;Cho, Yoo-Kun;Hong, Ji-Man
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.7
    • /
    • pp.708-712
    • /
    • 2008
  • Existing dynamic memory allocation schemes for general purpose operating system can not directly apply to the wireless sensor networks (WSNs). Because these schemes did not consider features of WSNs, they consume a lot of energy and waste the memory space caused by fragmentation. In this paper, we found features of WSNs applications and made the model which adapts these issues. Through this research, we suggest the slab allocator that reduces the execution time and the memory management space. Also, we evaluate the performance of our scheme by comparing to one of the previous systems.

Design and Implementation of A 3D Virtual Environment Engine for Collaboration (다중 사용자의 공동 작업을 위한 3차원 가상 환경 기반 설계 및 구현)

  • 김종석;이진상;최윤철
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2001.11a
    • /
    • pp.441-446
    • /
    • 2001
  • 본 논문에서는 다중 사용자간의 상호 작용과 공동 작업을 가능하게 하는 3차원 그래픽 기반의 가상 현실 시스템 모듈의 설계에 관하여 제안하였다. 본 논문에서 제안하는 시스템은 3차원 가상 공간을 기반으로 하여 네트워크를 통한 다중 사용자의 참여와 참여자간의 인터렉션을 가능하게 하는 기반 시스템이라고 할 수 있다. 본 시스템은 클라이언트-서버 모델을 기본으로 하여 구성되었으며, 인증/보안, 분산 처리, 데이터베이스, 객체와 지역관리, 전송 데이터 압축, 동적인 Scene Graph 구성 등 여러 가지 세부 모듈이 복합적으로 사용되었다. 개발된 시스템은 3차원 가상 공간상에서 자신의 아바타를 자유롭게 조작, 네비게이션할 수 있으며, 다른 사용자들의 움직임을 실시간으로 관찰할 수 있다. 향후, 시스템에 여러 가지 모듈을 추가하여 확장하게 되면 교육, 다중 사용자들의 공동 작업, 게임, 3차원 기반의 커뮤니티 형성 등 다양한 분야에 응용될 수 있을 것이다.

  • PDF

Spatial-temporal attention network-based POI recommendation through graph learning (그래프 학습을 통한 시공간 Attention Network 기반 POI 추천)

  • Cao, Gang;Joe, Inwhee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.11a
    • /
    • pp.399-401
    • /
    • 2022
  • POI (Point-of-Interest) 추천은 다양한 위치 기반 서비스에서 중요한 역할을 있다. 기존 연구에서는 사용자의 모바일 선호도를 모델링하기 위해 과거의 체크인의 공간-시간적 관계를 추출한다. 그러나 사용자 궤적에 숨겨진 개인 방문 경향을 반영할 수 있는 structured feature 는 잘 활용되지 않는다. 이 논문에서는 궤적 그래프를 결합한 시공간 인식 attention 네트워크를 제안한다. 개인의 선호도가 시간이 지남에 따라 변할 수 있다는 점을 고려하면 Dynamic GCN (Graph Convolution Network) 모듈은 POI 들의 공간적 상관관계를 동적으로 집계할 수 있다. LBSN (Location-Based Social Networks) 데이터 세트에서 검증된 새 모델은 기존 모델보다 약 9.0% 성능이 뛰어나다.

A Multistriped Checkpointing Scheme for the Fault-tolerant Cluster Computers (다중 분할된 구조를 가지는 클러스터 검사점 저장 기법)

  • Chang, Yun-Seok
    • The KIPS Transactions:PartA
    • /
    • v.13A no.7 s.104
    • /
    • pp.607-614
    • /
    • 2006
  • The checkpointing schemes should reduce the process delay through managing the checkpoints of each node to fit the network load to enhance the performance of the process running on the cluster system that write the checkpoints into its global stable storage. For this reason, a cluster system with single IO space on a distributed RAID chooses a suitable checkpointng scheme to get the maximum IO performance and the best rollback recovery efficiency. In this paper, we improved the striped checkpointing scheme with dynamic stripe group size by adapting to the network bandwidth variation at the point of checkpointing. To analyze the performance of the multi striped checkpointing scheme, we applied Linpack HPC benchmark with MPI on our own cluster system with maximum 512 virtual nodes. The benchmark results showed that the multistriped checkpointing scheme has better performance than the striped checkpointing scheme on the checkpoint writing efficiency and rollback recovery at heavy system load.

A Study on Efficient Network Topology Visualization using Node Centrality (노드 중심성을 이용한 효율적 네트워크 토폴로지 시각화 연구)

  • Chang, Beom-Hwan;Ryu, Jemin;Kwon, Koohyung
    • Convergence Security Journal
    • /
    • v.21 no.2
    • /
    • pp.47-56
    • /
    • 2021
  • Network topology visualization has been studied a lot since the past and developed with many tools. The network topology has strength in understanding the overall structure of a network physically and is useful for understanding data flow between nodes logically. Although there are existing tools, not many can be utilized efficiently while using the general network node data structure and express the topology similar to the actual network structure. In this paper, we propose an efficient method to visualize topology using only connection information of network nodes. The method finds the central node by using the centrality, the influence of nodes in the network, and visualizes the topology by dynamically segmenting all nodes and placing network nodes in 3D space using the weight of the child node. It is a straightforward method, yet it effectively visualizes in the form of an actual network structure.

An Solution Algorithm for A Multi-Class Dynamic Traffic Assignment Problem (다계층운전자를 고려한 동적통행배정모형의 해법)

  • Shin, Seong-Il;Kim, Jeong-Hyun;Baik, Nam-Cheol
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.6
    • /
    • pp.77-88
    • /
    • 2003
  • This paper proposes a solution algorithm for solving a multi-class analytical DTA model. In the DTA model, three traveler classes are classified according to different assumptions of traveler's route choice behavior: including fixed route, Stochastic Dynamic User Optimum(SDUO), and Dynamic User Optimum(DUO). To solve this DTA model, variables of link flow and exit flow are represented solely by inflow. The resulting Linear Program(LP) subproblem in the inner iteration is solved as a typical time-dependent shortest route problem over a physical network. Accordingly, the required time-space network expansion in solving DTA models is no longer needed.