• Title/Summary/Keyword: graph structure

Search Result 506, Processing Time 0.027 seconds

A Study on the Electrical Characteristics of Ge2Sb2Te5/Ti/W-Ge8Sb2Te11 Structure for Multi-Level Phase Change Memory (다중준위 상변환 메모리를 위한 Ge2Sb2Te5/Ti/W-Ge8Sb2Te11 구조의 전기적 특성 연구)

  • Oh, Woo-Young;Lee, Hyun-Yong
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.35 no.1
    • /
    • pp.44-49
    • /
    • 2022
  • In this paper, we investigated current (I)- and voltage (V)-sweeping properties in a double-stack structure, Ge2Sb2Te5/Ti/W-doped Ge8Sb2Te11, a candidate medium for applications to multilevel phase-change memory. 200-nm-thick and W-doped Ge2Sb2Te5 and W-doped Ge8Sb2Te11 films were deposited on p-type Si(100) substrate using magnetron sputtering system, and the sheet resistance was measured using 4 point-probe method. The sheet resistance of amorphous-phase W-doped Ge8Sb2Te11 film was about 1 order larger than that of Ge2Sb2Te5 film. The I- and V-sweeping properties were measured using sourcemeter, pulse generator, and digital multimeter. The speed of amorphous-to-multilevel crystallization was evaluated from a graph of resistance vs. pulse duration (t) at a fixed applied voltage (12 V). All the double-stack cells exhibited a two-step phase change process with the multilevel memory states of high-middle-low resistance (HR-MR-LR). In particular, the stable MR state is required to guarantee the reliability of the multilevel phase-change memory. For the Ge2Sb2Te5 (150 nm)/Ti (20 nm)/W-Ge8Sb2Te11 (50 nm), the phase transformations of HR→MR and MR→LR were observed at t<30ns and t<65ns, respectively. We believe that a high speed and stable multilevel phase-change memory can be optimized by the double-stack structure of proper Ge-Sb-Te films separated by a barrier metal (Ti).

A Study on the Prevention of Liquefaction Damage of the Sheet File Method Applicable to the Foundation of Existing Structures Using the 1-G Shaking Table Experiment (1-G 진동대 실험을 이용한 기존 구조물 기초에 적용 가능한 시트파일 공법의 액상화 피해 방지에 관한 연구)

  • Jongchan Yoon;Suwon Son;Junhyeok Park;Junseong Moon;Jinman Kim
    • Journal of the Korean GEO-environmental Society
    • /
    • v.24 no.7
    • /
    • pp.5-14
    • /
    • 2023
  • Recently, earthquakes have occurred frequently in worldwide. These earthquakes cause various forms of natural and physical damage. In particular, liquefaction in which the ground shows liquid-like behavior causes great damage to the structure. Accordingly, various liquefaction damage reduction methods are being studied and developed. Therefore, in this study, a method of reducing liquefaction damage in the event of an earthquake applicable to existing structures was studied using the sheet pile method. The 1-G Shaking table test was performed and the ground was constructed with Jumunjin standard sand. A two-story model structure was produced by applying the similitude law, and the input wave applied a sine wave with an acceleration level of 0.6 g and a frequency of 10 Hz. The effect of reducing structure damage according to various embedded depth ratio was analyzed. As a result of the study, the structure settlement when the ground is reinforced by applying the sheet pile method is decreased by about 71% compared to when the ground is not reinforced, and the EDR with minimum settlement is "1". In addition, as the embedded depth ratio is increased, the calculation of the pore water pressure in the ground tends to be delayed due to the sheet pile. Based on these results, the relationship with structural settlement according to the embedded depth ratio is proposed as a relational equation with the graph. The results of this study are expected to be used as basic data in developing sheet pile methods applicable to existing structures in the future.

Hierarchical Organization of Embryo Data for Supporting Efficient Search (배아 데이터의 효율적 검색을 위한 계층적 구조화 방법)

  • Won, Jung-Im;Oh, Hyun-Kyo;Jang, Min-Hee;Kim, Sang-Wook
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.2
    • /
    • pp.16-27
    • /
    • 2011
  • Embryo is a very early stage of the development of multicellular organism such as animals and plants. It is an important research target for studying ontogeny because the fundamental body system of multicellular organism is determined during an embryo state. Researchers in the developmental biology have a large volume of embryo image databases for studying embryos and they frequently search for an embryo image efficiently from those databases. Thus, it is crucial to organize databases for their efficient search. Hierarchical clustering methods have been widely used for database organization. However, most of previous algorithms tend to produce a highly skewed tree as a result of clustering because they do not simultaneously consider both the size of a cluster and the number of objects within the cluster. The skewed tree requires much time to be traversed in users' search process. In this paper, we propose a method that effectively organizes a large volume of embryo image data in a balanced tree structure. We first represent embryo image data as a similarity-based graph. Next, we identify clusters by performing a graph partitioning algorithm repeatedly. We check constantly the size of a cluster and the number of objects, and partition clusters whose size is too large or whose number of objects is too high, which prevents clusters from growing too large or having too many objects. We show the superiority of the proposed method by extensive experiments. Moreover, we implement the visualization tool to help users quickly and easily navigate the embryo image database.

Time-distance Accessibility Computation of Seoul Bus System based on the T-card Transaction Big Databases (교통카드 빅데이터 기반의 서울 버스 교통망 시간거리 접근성 산출)

  • Park, Jong Soo;Lee, Keumsook
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.18 no.4
    • /
    • pp.539-555
    • /
    • 2015
  • This study proposes the methodology for measuring the time-distance accessibility on the Seoul bus system based on the T-card transaction databases and analyzes the results. T-card transaction databases contain the time/space information of each passenger's locations and times of the departure, transfers, and destination. We introduce the bus network graph and develop the algorithms for time-distance accessibility measurement. We account the average speed based on each passenger's get-in and getoff information in the T-card data as well as the average transfer time from the trip chain transactions. Employing the modified Floyd APSP algorithm, the shortest time distance between each pair of bus stops has been accounted. The graph-theoretic nodal accessibility has been given by the sum of the inverse time distance to all other nodes on the network. The results and spatial patterns are analyzed. This study is the first attempt to measure the time-distance accessibility for such a large transport network as the Seoul bus system consists of 34,934 bus stops on the 600 bus routes, and each bus route can have different properties in terms of speed limit, number of lanes, and traffic signal systems, and thus has great significance in the accessibility measurement studies.

  • PDF

Implementation of GIS-based Application Program for Circuity and Accessibility Analysis in Road Network Graph (도로망 그래프의 우회도와 접근도 분석을 위한 GIS 응용 프로그램 개발)

  • Lee, Kiwon
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.7 no.1
    • /
    • pp.84-93
    • /
    • 2004
  • Recently, domain-specific demands with respect to practical applications and analysis scheme using spatial thematic information are increasing. Accordingly, in this study, GIS-based application program is implemented to perform spatial analysis in transportation geography with base road layer data. Using this program, quantitative estimation of circuity and accessibility, which can be extracted from nodes composed of the graph-typed network structure, in a arbitrary analysis zone or administrative boundary zone is possible. Circuity is a concept to represent the difference extent between actual nodes and fully connected nodes in the analysis zone. While, accessibility can be used to find out extent of accessibility or connectivity between all nodes contained in the analysis zone, judging from inter-connecting status of the whole nodes. In put data of this program, which was implemented in AVX executable extension using AvenueTM of ArcView, is not transportation database information based on transportation data model, but layer data, directly obtaining from digital map sets. It is thought that computation of circuity and accessibility can be used as kinds of spatial analysis functions for GIS applications in the transportation field.

  • PDF

Distributed Trust Management for Fog Based IoT Environment (포그 기반 IoT 환경의 분산 신뢰 관리 시스템)

  • Oh, Jungmin;Kim, Seungjoo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.31 no.4
    • /
    • pp.731-751
    • /
    • 2021
  • The Internet of Things is a huge group of devices communicating each other and the interconnection of objects in the network is a basic requirement. Choosing a reliable device is critical because malicious devices can compromise networks and services. However, it is difficult to create a trust management model due to the mobility and resource constraints of IoT devices. For the centralized approach, there are issues of single point of failure and resource expansion and for the distributed approach, it allows to expand network without additional equipment by interconnecting each other, but it has limitations in data exchange and storage with limited resources and is difficult to ensure consistency. Recently, trust management models using fog nodes and blockchain have been proposed. However, blockchain has problems of low throughput and delay. Therefore, in this paper, a trust management model for selecting reliable devices in a fog-based IoT environment is proposed by applying IOTA, a blockchain technology for the Internet of Things. In this model, Directed Acyclic Graph-based ledger structure manages trust data without falsification and improves the low throughput and scalability problems of blockchain.

The Analysis of Stakeholders' Conflict Surrounding Water use Charges: Targeting the Han River region (한강수계 물이용부담금을 둘러싼 이해당사자 간 갈등분석)

  • Lee, Youngkyeong;Choi, Ye Seul;Kim, Chanyong;Lim, up
    • Journal of the Korean Regional Science Association
    • /
    • v.37 no.1
    • /
    • pp.45-61
    • /
    • 2021
  • This research purposes to design a methodological framework to suggest the optimal method to resolve the conflicts of stakeholders surrounding the water use charge of the Han River region, and to use the analysis results to provide the direction of policy. For this, it was preceded that the process of understanding the mechanisms of the multifaceted conflict between decision makers taking different positions over water use charge of the Han River region, and an optimal method to resolve the conflict of water use charge of the Han River region was derived by using a graph model for conflict resolution(GMCR). According to the analysis results, the optimal state to find a solution to the water use charge of the Han River is that the Seoul-Incheon-Gyeonggi region pays the charge according to the original rate while Seoul-Incheon requesting discount the water use rate. In addition, the Han River management committee should establish policies desired by Seoul-Incheon-Gyeonggi region including rationalization of the decision-making structure to determine the rate of water use charge, making the basis to support the Han River management fund system for the Seoul-Incheon region, and transparent management of the Han River management fund system considering the characteristics of beneficiary regions and residents. This study is expected to provide objective decision-making information in establishing environmental policy directions related to conflict resolution in the water use charge of the Han River region and to offer a methodological basis for similar follow-up studies related to conflicts derived from sharing nature environment.

An Emulation System for Efficient Verification of ASIC Design (ASIC 설계의 효과적인 검증을 위한 에뮬레이션 시스템)

  • 유광기;정정화
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.10
    • /
    • pp.17-28
    • /
    • 1999
  • In this paper, an ASIC emulation system called ACE (ASIC Emulator) is proposed. It can produce the prototype of target ASIC in a short time and verify the function of ASIC circuit immediately The ACE is consist of emulation software in which there are EDIF reader, library translator, technology mapper, circuit partitioner and LDF generator and emulation hardware including emulation board and logic analyzer. Technology mapping is consist of three steps such as circuit partitioning and extraction of logic function, minimization of logic function and grouping of logic function. During those procedures, the number of basic logic blocks and maximum levels are minimized by making the output to be assigned in a same block sharing product-terms and input variables as much as possible. Circuit partitioner obtain chip-level netlists satisfying some constraints on routing structure of emulation board as well as the architecture of FPGA chip. A new partitioning algorithm whose objective function is the minimization of the number of interconnections among FPGA chips and among group of FPGA chips is proposed. The routing structure of emulation board take the advantage of complete graph and partial crossbar structure in order to minimize the interconnection delay between FPGA chips regardless of circuit size. logic analyzer display the waveform of probing signal on PC monitor that is designated by user. In order to evaluate the performance of the proposed emulation system, video Quad-splitter, one of the commercial ASIC, is implemented on the emulation board. Experimental results show that it is operated in the real time of 14.3MHz and functioned perfectly.

  • PDF

The Analysis of the Dimensions of Affection Structure and Hand Movements (손동작과 정서 차원 분석)

  • Yoo Sang;Han Kwang-Hee;Cho Kyung-Ja
    • Science of Emotion and Sensibility
    • /
    • v.9 no.2
    • /
    • pp.119-132
    • /
    • 2006
  • The dimensions of affection structure from hand movements was developed for the purpose of understanding relationship between affective words and physical factors to apply it to computing environment. To analyze hand movements, three dimensions -direction, time, weight- were found through reconstructing sub-properties of Laban Movement Analysis. The direction dimension has five freedoms of movement (horizontal, vertical, sagittal, circular, shaking) while the time and weight dimensions both have two sub categories each, (sudden, sustained), (light, strong) respectively. By factorial design using the three dimensions, twenty movement were videotaped. Participants rated a list of fifty korean affective words on each twenty movements. The results were studied by nonlinear principal component analysis. The results suggested that time and weight dimensions are closely related with arousal level dimension of affection. Strong and sudden movements associated with highly aroused affection, while light and sustained movements associated with the opposite affection. The direction sub-dimensions were found to be associated with the kinds of affection. Linear movements like horizontal, vortical and sagittal direction were correlated to highly aroused negative affection. Circular movements were found to correlate closely by fun and delight on the graph, while shaking movements were correlated to anxiety and impatience. These results imply that the dimensions of affection structure and sub-properties of hand movements are closely connected with each other.

  • PDF

Network Structures of The Metropolitan Seoul Subway Systems (서울 대도시권 지하철망의 구조적 특성 분석)

  • Park, Jong-Soo;Lee, Keum-Sook
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.11 no.3
    • /
    • pp.459-475
    • /
    • 2008
  • This study analyzes the network structure of the Metropolitan Seoul subway system by applying complex network analysis methods. For the purpose, we construct the Metropolitan Seoul subway system as a network graph, and then calculate various indices introduced in complex network analysis. Structural characteristics of Metropolitan Seoul subway network are discussed by these indices. In particular, this study determines the shortest paths between nodes based on the weighted distance (physical and time distance) as well as topological network distance, since urban travel movements are more sensitive for them. We introduce an accessibility measurement based on the shortest distance both in terms of physical distance and network distance, and then compare the spatial structure between two. Accessibility levels of the system have been getting up overall, and thus the accessibility gaps have been getting lessen between center located subway stops and remote ones during the last 10 years. Passenger traffic volumes are explored from real passenger transaction databases by utilizing data mining techniques, and mapped by GIS. Clear differences reveal between the spatial patterns of real passenger flows and accessibility. That is, passenger flows of the Metropolitan Seoul subway system are related with population distribution and land use around subway stops as well as the accessibility supported by the subway network.

  • PDF