• Title/Summary/Keyword: 개념 계층구조

Search Result 300, Processing Time 0.028 seconds

Peer-to-Peer System using Super Peers for Mobile Environments (모바일 환경에서 슈퍼 피어를 이용한 피어-투-피어 시스템)

  • Han, Jung-Suk;Song, Jin-Woo;Lee, Kwang-Jo;Yang, Sung-Bong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.3
    • /
    • pp.286-290
    • /
    • 2008
  • As the number of mobile device users increases, many researches on peer-to-peer(P2P) systems in mobile environments have been carried out. In this paper, we propose a couple of double-layered P2P file sharing systems to overcome the 'flooding' problem in previous mobile P2P systems. We classify peers into two groups, super peers and sub-peers to establish new routing tables. A super peer manages its sub-peers in the systems. The first proposed system partitions the service area into small cells, each of which is a square. Each super peer is located near the center of the square. The second system selects super peers which have the largest number of adjacent peers. As file transmission and file searches are managed mainly by super peers, unnecessary multi-broadcasting could be avoided. The experimental results show that the proposed systems outperform a typical file sharing system in terms of the amount of message traffic with about $1.2{\sim}1.6$ times improvement on the average.

A New Key Management Mechanism and Performance Improvement for Conditional Access System (제한수신시스템을 위한 키 관리 메카니즘과 성능향상 방안)

  • 조현숙;이상호
    • The KIPS Transactions:PartC
    • /
    • v.8C no.1
    • /
    • pp.75-87
    • /
    • 2001
  • The Conditional Access System is the complete system for ensuring that broadcasting services are only accessible to those who are entitled to receive them. Four major parts to this system are scrambling, descrambling, authentication and encryption. For the proper operation, which means hard-to- break and uninterrupted service, secure key management and efficient delivery mechanism are very important design factors to this system. Performance analysis is another important factor to this system that is used in massive subscriber environment. In this thesis, one of the secure and efficient key management mechanisms is proposed. For the secrecy of this mechanism, hierarchical stacking of keys and key generation matrix are proposed. For the proof of efficient delivery of those keys, simulation results and performance analysis. which is based on queuing analysis, are presented. Lastly, optimal key generation and delivery period, maximal and minimal key deliver time, and communication capacity for data collection are presented for various subscriber volume.

  • PDF

Meta-Modeling to Detect Attack Behavior for Security (보안을 위한 공격 행위 감지 메타-모델링)

  • On, Jinho;Choe, Yeongbok;Lee, Moonkun
    • Journal of KIISE
    • /
    • v.41 no.12
    • /
    • pp.1035-1049
    • /
    • 2014
  • This paper presents a new method to detect attack patterns in security-critical systems, based on a new notion of Behavior Ontology. Generally security-critical systems are large and complex, and they are subject to be attacked in every possible way. Therefore it is very complicated to detect various attacks through a semantic structure designed to detect such attacks. This paper handles the complication with Behavior Ontology, where patterns of attacks in the systems are defined as a sequences of actions on the class ontology of the systems. We define the patterns of attacks as sequences of actions, and the attack patterns can then be abstracted in a hierarchical order, forming a lattice, based on the inclusion relations. Once the behavior ontology for the attack patterns is defined, the attacks in the target systems can be detected both semantically and hierarchically in the ontology structure. When compared to other attack models, the behavior ontology analysis proposed in this paper is found to be very effective and efficient in terms of time and space.

An Internet Multicast Routing Protocol with Region-based Tree Switching (지역망간의 트리전환을 이용하는 인터넷 멀티캐스트 라우팅 프로토콜)

  • Kim, Won-Tae;Park, Yong-Jin
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.2
    • /
    • pp.234-243
    • /
    • 2000
  • We design a modified network architecture with condsidering current Internet network model and traffic characteristics, and propose EDCBT(Enhanced Dispersed Core-based Tree) multicast routing protocol, which enhances scalabity, reliability, end-to-end delay and resource utilization EDBCT adopts bidirectional dispersed shared trees and manages both of intradomain and interdomain multicast trees for a multicast group. Each regional multicast tree is estabilshed from its core router and they are interconnected by the operation between border routers on edges of each regional network. As a result, interdomain multicast tree can be easily established. We introduce a new concept named RBTS(Region-based Tree Switching), which dramatically enhances QoS and network utilization. Finally, protocol performance and the effect of core router location are evaluated with MIL3 OPNet network simulator, in terms of end-to-end delay, packet loss and throughput.

  • PDF

A Study of Path-based Retrieval for JSON Data Using Suffix Arrays (접미사 배열을 이용한 JSON 데이터의 경로 기반 검색에 대한 연구)

  • Kim, Sung Wan
    • Journal of Creative Information Culture
    • /
    • v.7 no.3
    • /
    • pp.157-165
    • /
    • 2021
  • As the use of various application services utilizing Web and IoT and the need for large amounts of data management expand accordingly, the importance of efficient data expression and exchange scheme and data query processing is increasing. JSON, characterized by its simplicity, is being used in various fields as a format for data exchange and data storage instead of XML, which is a standard data expression and exchange language on the Web. This means that it is important to develop indexing and query processing techniques to effectively access and search large amounts of data expressed in JSON. Therefore, in this paper, we modeled JSON data with a hierarchical structure in a tree form, and proposed indexing and query processing using the path concept. In particular, we designed an index structure using a suffix array widely used in text search and introduced simple and complex path-based JSON data query processing methods.

A Process-centric Simulation Modeling Method Improving Product, Process, and Facility Information Representation Method (제품, 공정, 설비 정보 표현 방법을 개선한 공정 중심 시뮬레이션 모델링 방법)

  • Baek, Seon-Jung;Oh, Daekyun;Lee, Dong Kun;Lee, Philippe;Ryu, Cheolho;Woo, Jong Hun;Jeong, Yong-Kuk
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.23 no.4
    • /
    • pp.421-431
    • /
    • 2017
  • A process-centric simulation modeling method has been proposed to define a shipbuilding simulation model. Existing modeling methods have limitations for expressing various production information for a shipyard. The advanced process-centric modeling method proposed in this paper offers an improvement, effectively representing production information and constraints for a shipyard. To achieve this, a method and diagram components to define a process-centric simulation model in detail have been suggested. The modeling method can assign priorities when multiple products and facilities are assigned to the process. And layer concept was applied to express simulation model with hierarchical structure. To verify the effectiveness of the modeling method, comparative analysis has been performed and the actual shipbuilding process has been modeled using the proposed method. When a single facility was used for various purposes, we found that the proposed method was more advantageous than existing methods. As a result, it was possible to express constraints and flows that were difficult to identify with existing process-centric simulation modeling methods, and the methods were improved for use in shipyard production planning verification simulations.

Cycle Extendability of Torus Sub-Graphs in the Enhanced Pyramid Network (개선된 피라미드 네트워크에서 토러스 부그래프의 사이클 확장성)

  • Chang, Jung-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.8
    • /
    • pp.1183-1193
    • /
    • 2010
  • The pyramid graph is well known in parallel processing as a interconnection network topology based on regular square mesh and tree architectures. The enhanced pyramid graph is an alternative architecture by exchanging mesh into the corresponding torus on the base for upgrading performance than the pyramid. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square torus as a basic sub-graph constituting of each layer in the enhanced pyramid graph. Edge set in the torus graph is considered as two disjoint sub-sets called NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or sharing in the upper layer of the enhanced pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges within the shrunk super-vertex on the resulting shrink graph. In this paper, we analyze that the lower and upper bounds on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n{\times}2^n$ torus is $2^{2n-2}$ and $3{\cdot}2^{2n-2}$ respectively. By expanding this result into the enhanced pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}$-2n+1 in the n-dimensional enhanced pyramid.

Problem Analysis and Recommendations of Memory Contents in High School Informatics Textbooks (고등학교 정보 교과서에 제시된 기억 장치 영역 내용의 문제점 분석 및 개선 방안)

  • Lee, Sang-Wook;Suh, Tae-Weon
    • The Journal of Korean Association of Computer Education
    • /
    • v.15 no.3
    • /
    • pp.37-47
    • /
    • 2012
  • One of the major goals in high school Informatics is for students to develop creative problem-solving abilities based on knowledge on computer science. Thus, the contents of the textbooks should be accurate and appropriate. However, we discovered that the current Informatics textbooks contain the untrue and/or inappropriate descriptions of main memory and virtual memory. The textbooks describe that main memory is composed of RAM and ROM. The virtual memory is described as a technique in which a part of the secondary storage is utilized as main memory to execute an application of which size is larger than that of main memory. In this study, we attempted to uncover the root causes of the fallacies, and suggest the accurate explanations by comparing with renowned books adopted in most schools worldwide including USA. Our study reveals that it is inappropriate to include ROM in main memory from the memory hierarchy perspective. Virtual memory is a technique that provides convenience to programmers, through which an operating system loads the necessary portion of a program from secondary storage to main memory. As for the advantages of virtual memory in the current computer systems, the focus should be on providing the effective multitasking capability, rather than on executing a larger program than the size of main memory. We suggest that it is appropriate to exclude virtual memory in textbooks considering its complexity.

  • PDF

Capital Budgeting Methods Are Not Enough : Justification of Automation Projects

  • 박용태
    • Journal of Technology Innovation
    • /
    • v.1 no.1
    • /
    • pp.157-169
    • /
    • 1993
  • 최근, 시장환경 및 생산구조의 변화에 따라 이른바 첨단생산기술(advanced manufacturing technologies)의 개발과 활용이 산업계 및 학계의 큰 관심을 끌고 있다. 그러나 첨단생산기술의 급속한 기술적 발전과 전략적 가치의 증가에도 불구하고 산업에의 확산은 상대적으로 부진한 현실이다. 이러한 현상은 물론 초기 투자의 재원도달 문제에 기인한다고 말할 수 있지만 일차적으로는 적절한 대안을 선정하고 투자의 정당성을 분석하는 방법론의 미비도 그 원인으로 지적되고 있다. 본 고는 전통적(conventional) 생산기술과 비교한 첨단생산기술과 비교한 첨단생산기술의 특성에 대한 이해를 기초로, 새로운 기술대안들을 비교 분석하는 구체적인 기법의 개발에 관한 접근의 방향성과 개념의 틀(framework)을 제시하는 데 그 목적이 있다. 첨단생산기술의 대안선정과 정당성분석은 다음과 몇 가지 특성을 지니고 있다. 첫째, 투자대안의 속성이 다양하며(multi-attribute) 각각의 속성이 상위 적(conflicting)일 수 있다. 둘째, 기술대안들의 잠재적 기능이 생산체제의 신축성과 유연성(flexible)의 제고를 강조하고 있다. 셋째, 개별기술의 통합을 통해 시스템 전체의 상승효과(synergy effect)를 추구하고 있다. 따라서 이러한 특성에 대한 인식을 토대로 정량적이고 전략적인 장·단점에 대한 고려를 포함하는 종합적이고 객관적인 분석의 틀과 기법이 사용되지 않으면 첨단생산기술의 성공적인 도입과 활용은 기대하기 어려운 것이다. 새로운 생산기술의 도입이 공정의 부분적 개선을 위한 소규모 투자일 경우에는 경제성의 분석을 위해서는 전통적인 재무관리(capital budgeting) 기법들이 이용될 수 있고 직접적인 공정개선의 효과분석을 위해서는 시뮬레이션을 적용하는 것이 바람직하다고 할 수 있다. 그러나 기술대안의 규모가 크고 따라서 그 파급효과가 전체공정으로 확산되는 대규모 사업일 경우에는 다양한 장·단점들을 고려하는 종합적인 접근의 틀이 필요하게 된다. 이러한 방법들을 크게 세 가지 형태로 나누어 보면 (1) 모든 대안들에 대해, 모든 요소들에 관한 비교분석을 동시에 실시하는 동시적 접근(simultaneous approach), (2) 대안 또는 요소들을 그 성격에 따라 계층적 구조로 분할하고 단계별로 비교분석을 실시하는 계층적 접근(hierarchical approach), (3) 요소들을 속성에 따라 몇 개의 소그룹으로 나누고 각 그룹에 대해 순차적으로 대안들을 비교분석 함으로써 고려대상이 되는 대안들을 줄여나가는 순차적 접근(sequtial approach)등을 들 수 있다 이러한 접근법들의 장·단점들을 사업의 규모나 복잡성에 따라 달라지게 된다. 또한 동일한 접근방법 내에서도 구체적인 기법의 선택과 개발도 문제의 특성에 따라 달리 결정되어야 한다. 그러나 어떠한 경우에도 오늘날의 첨단생산기술에의 투자는 현금의 흐름에 대한 계량적 분석에만 의존하는 전통적인 기법만으로는 불충분하며 기업목표와 생산조직 전반에 관한 전략적 요소들을 포함하는 종합적인 접근이 바람직하다.

  • PDF

Development of Wooden Coffin(木棺) and Chamber(木槨) Tombs in Gyeongju(慶州) and Sarokuk(斯盧國) (경주지역 목관·목곽묘의 전개와 사로국)

  • Lee, Ju Heun
    • Korean Journal of Heritage: History & Science
    • /
    • v.42 no.3
    • /
    • pp.106-130
    • /
    • 2009
  • The aim of this paper is analysis of structure and development pattern about wooden coffin and chamber tombs in Gyeongju from the 2nd century B.C. to the 3rd century A.D. for researching to socio-political tendency and growth process of Sarokuk. Tombs buried with iron objects were built in Youngnam(嶺南) from the 2nd century B.C. with spread wooden coffin with stone mound(積石木棺墓). Also medium or small sized wooden coffin tombs buried with bronze mirror of western Han(前漢) and soft stoneware(瓦質土器) were appeared the 2nd century B.C. in Gyeongju, because of establishment of Han's commanderies(漢郡縣) in the Korean Peninsula and refuge from Daedong river(大同江) to Jinhan(辰韓). Separate tombs(獨立墓) with lots of bronze object ware assumed high ranked tombs of parsonage(司祭王) or local chief(地域首長). From the 2nd century A.D. the size of wooden coffin tombs became enlarged and funerary objects ware abundant, for example Sarari 130th tomb(舍羅里 130號). The burying pattern of this tomb is similar to wooden chamber tombs in Lelang(樂浪), which had prestige goods like lacquer ware and bronze mirror in wood box(木匣) beside coffin. Appearance of these wooden chamber tombs that were different from original wooden coffin tombs imply interaction between Lelang and these area with iron. Sarari community that held right of trade and distribution to outside through the geographical advantage grew up centered position in Gyeongju politically, socially, and culturally. Chamber in tomb as a new structural notion that can secure funerary objects became firmly was established from the 2nd century A.D. in Gyeongju and large sized wooden chamber tombs were generally built early of the 3rd century A.D. This tendency was reflected in stratification of community and growth as center of local state. After late of the 3rd century A.D. Gyeongju type wooden chamber tomb(慶州式木槨墓) which had subordinate outer coffin(副槨) was appeared and then subordinate outer coffin was as bigger as main chamber(主槨) the 4th century A.D., because of centralization and stratification in society and unification of various communities among the Gyeongju area.