• 제목/요약/키워드: graph-based approach

검색결과 284건 처리시간 0.028초

Real-time Intelligent Exit Path Indicator Using BLE Beacon Enabled Emergency Exit Sign Controller

  • Jung, Joonseok;Kwon, Jongman;Jung, Soonho;Lee, Minwoo;Mariappan, Vinayagam;Cha, Jaesang
    • International journal of advanced smart convergence
    • /
    • 제6권1호
    • /
    • pp.82-88
    • /
    • 2017
  • Emergency lights and exit signs are an indispensable part of safety precautions for effective evacuation in case of emergency in public buildings. These emergency sign indicates safe escape routes and emergency doors, using an internationally recognizable sign. However visibility of those signs drops drastically in case of emergency situations like fire smoke, etc. and loss of visibility causes serious problems for safety evacuation. This paper propose a novel emergency light and exit sign built-in with Bluetooth Low Energy (BLE) Beacon to assist the emergency self-guiding evacuation using devices for crisis and emergency management to avoid panic condition inside the buildings. In this approach, the emergency light and exit sign with the BLE beacons deployed in the indoor environments and the smart devices detect their indoor positions, direction to move, and next exit sign position from beacon messages and interact with map server in the Internet / Intranet over the available LTE and/or Wi-Fi network connectivity. The map server generate an optimal emergency exit path according to the nearest emergency exit based on a novel graph generation method for less route computation for each smart device. All emergency exit path data interfaces among three system components, the emergency exit signs, map server, and smart devices, have been defined for modular implementation of our emergency evacuation system. The proposed exit sign experimental system has been deployed and evaluated in real-time building environment thoroughly and gives a good evidence that the modular design of the proposed exit sign system and a novel approach to compute emergency exit path route based on the BLE beacon message, map server, and smart devices is competitive and viable.

Electromagnetic Forming Process Analysis Based on Coupled Simulations of Electromagnetic Analysis and Structural Analysis

  • Lee, Man Gi;Lee, Seung Hwan;Kim, Sunwoo;Kim, Jin Ho
    • Journal of Magnetics
    • /
    • 제21권2호
    • /
    • pp.215-221
    • /
    • 2016
  • We conducted a phased electromagnetic forming process analysis (EFPA) over time through a coupling of electromagnetic analysis and structural analysis. The analysis is conducted through a direct linkage between electromagnetic analysis and structural analysis. The analysis process is repeated until the electric current is completely discharged by a formed coil. We calculate the forming force that affects the workpiece using MAXWELL, a commercial electromagnetic finite element analysis program. Then, we simulate plastic behavior by using the calculated forming force data as the forming force input to ANSYS, a commercial structure finite element analysis program. We calculate the forming force data by using the model shape in MAXWELL, a commercial electromagnetic finite element analysis program. We repeat the process until the current is fully discharged by the formed coil. Our results can be used to reduce the error in data transformation with a reduced number of data transformations, because the proposed approach directly links the electromagnetic analysis and the structural analysis after removing the step of the numerical analysis of a graph describing the forming force, unlike the existing electromagnetic forming process. Second, it is possible to simulate a more realistic forming force by keeping a certain distance between nodes using the re-mesh function during the repeated analysis until the current is completely discharged by the formed coil, based on the MAXWELL results. We compare and review the results of the EFPA using the peak value of the forming force that acts on the workpiece (which is the existing analysis method), and the proposed phased EFPA over time approach.

피로 검출을 위한 능동적 얼굴 추적 (Active Facial Tracking for Fatigue Detection)

  • 김태우;강용석
    • 한국정보전자통신기술학회논문지
    • /
    • 제2권3호
    • /
    • pp.53-60
    • /
    • 2009
  • 본 논문에서는 얼굴 특징을 추출하는 새로운 능동적 방식을 제안하고자 한다. 운전자의 피로 상태를 검출하기 위한 얼굴 표정 인식을 위해 얼굴 특징을 추적하고자 하였다. 그러나 대다수의 얼굴 특징 추적 방법은 다양한 조명 조건과 얼굴 움직임, 회전등으로 얼굴의 특징점이 검출하지 못하는 경우가 발생한다. 본 논문에서는 얼굴 특징을 추출하는 새로운 능동적 방식을 제안하고자 한다. 제안된 방법은 우선, 능동적 적외선 감지기를 사용하여 다양한 조명 조건하에서 동공을 검출하고, 검출된 동공은 얼굴 움직임을 예측하는데 사용되어진다. 얼굴 움직임에 따라 특징이 국부적으로 부드럽게 변화한다고 할 때, 칼만 필터로 얼굴 특징을 추적할 수 있다. 제한된 동공 위치와 칼만 필터를 동시에 사용함으로 각각의 특징 지점을 정확하게 예상할 수 있었고, Gabor 공간에서 예측 지점에 인접한 지점을 특징으로 추적할 수 있다. 패턴은 검출된 특징에서 공간적 연관성에서 추출한 특징들로 구성된다. 실험을 통하여 다양한 조명과 얼굴 방향, 표정 하에서 제안된 능동적 방법의 얼굴 추적의 실효성을 입증하였다.

  • PDF

피로 검출을 위한 능동적 얼굴 추적 (Active Facial Tracking for Fatigue Detection)

  • 박호식;정연숙;손동주;나상동;배철수
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2004년도 춘계종합학술대회
    • /
    • pp.603-607
    • /
    • 2004
  • 본 논문에서는 얼굴 특징을 추출하는 새로운 능동적 방식을 제안하고자 한다. 운전자의 피로 상태를 검출하기 위한 얼굴 표정 인식을 위해 얼굴 특징을 추적하고자 하였다. 그러나 대다수의 얼굴 특징 추적 방법은 다양한 조명 조건과 얼굴 움직임, 회전등으로 얼굴의 특징점이 검출하지 못하는 경우가 발생한다. 그러므로 본 논문에서는 얼굴 특징을 추출하는 새로운 능동적 방식을 제안하고자 한다. 제안된 방법은 우선, 능동적 적외선 감지기를 사용하여 다양한 조명 조건 하에서 동공을 검출하고, 검출된 동공은 얼굴 움직임을 예측하는데 사용되어진다. 얼굴 움직임에 따라 특징이 국부적으로 부드럽게 변화한다고 할 때, 칼만 필터로 얼굴 특징을 추적할 수 있다. 제한된 동공 위치와 칼만 필터를 동시에 사용함으로 각각의 특징 지점을 정확하게 예상 할 수 있었고, Gabor 공간에서 예측 지점에 인접한 지점을 특징으로 추적할 수 있다. 패턴은 검출된 특징에서 공간적 연관성에서 추출한 특징들로 구성된다. 실험을 통하여 다양한 조명과 얼굴 방향, 표정 하에서 제안된 능동적 방법의 얼굴 추적의 실효성을 입증하였다.

  • PDF

A Plant Metabolomic Approach to Identify the Difference of the Seeds and Flowers Extracts of Carthamus tinctorius L.

  • Ozan Kaplan;Nagehan Saltan;Arzu Kose;Yavuz Bulent Kose;Mustafa Celebier
    • Mass Spectrometry Letters
    • /
    • 제14권2호
    • /
    • pp.42-47
    • /
    • 2023
  • Carthamus tinctorius L. (known as safflower) is a valuable oil plant whose importance is increasing rapidly in the world due to its high adaptation to arid regions. The seeds of this unique plant are especially used in edible oil, soap, paint, varnish and lacquer production. Its flowers are used in vegetable dye production and medicinal purposes beside its features as a coloring and flavoring in food. After the oil is removed, the remaining pulp and plant parts are used as animal feed, and dry straw residues are used as fuel. Beside all these features, its usage as a herbal medicinal plants for various diseases has gained importance on recent years. In this study, it was designed a plant metabolomic approach which transfers all the recent data processing strategies of untargeted metabolomics in clinical applications to the present study. Q-TOF LC/MS-based analysis of the extracts (70% ethanol, hexane, and chloroform) for both seed and flowers was performed using a C18 column (Agilent Zorbax 1.8 µM, 100 × 2.1 mm). Differences were observed in seed and fruit extracts and these differences were visualized using principal component analysis (PCA) plots. The total number and intersections of the peaks in the extracts were visualized using peak count comparison graph. Based on the experimental results, the number of the detected peaks for seeds was higher than the ones for the flowers for all solvent systems to extract the samples.

온톨로지 추론 모델에 독립적인 SPARQL 추론 질의 처리를 위한 재작성 알고리즘 (A Rewriting Algorithm for Inferrable SPARQL Query Processing Independent of Ontology Inference Models)

  • 정동원;;백두권
    • 한국정보과학회논문지:데이타베이스
    • /
    • 제35권6호
    • /
    • pp.505-517
    • /
    • 2008
  • 이 논문에서는 SPARQL로 작성된 OWL-DL 온톨로지 질의에 대한 재작성 알고리즘은 제안한다. 현재 웹 온톨로지 저장소는 주어진 SPARQL 질의의 추론 결과를 얻기 위해 추론 온톨로지 모델을 생성하고 SPARQL 질의와 생성된 추곤 온톨로지 모델과의 일치성을 비교한다. 추론 모델은 베이스 온톨로지 모델에 비해 보다 큰 공간을 필요로 하고 다른 추론 질의론 위해 재사용 될 수 없기 때문에 앞서 언급한 접근 방법은 보다 방대한 크기의 SPARQL 질의 처리에 부적합하다. 이러한 문제점을 해결하기 위해 이 논문에서는 비SPARQL 질의를 재작성하고 이를 기본 베이스 온톨로지 모델에 대해 질의 연산을 수행하여 결과를 획득할 수 있는 SPARQL 재작성 알고리즘을 제안한다. 이러한 목적을 이루기 위해, 먼저 OWL-DL 추론 규칙을 정의하고 이를 질의 그래프 패턴 재작성에 적용한다. 또한 추론 규칙들을 분류하고 이러한 규칙들이 질의 재작성에 미치는 영향에 대하여 기술한다. 제안 알고리즘의 장점을 보이기 위해, Jena 기반의 프로토타입 시스템을 구현한다. 비교 평가론 위해 테스트 질의를 이용하여 실험을 수행하고 제안 방법과 기존 접근 방법을 비교한다. 실험 결과에서, 제안 알고리즘이 완전성 및 정확성의 손실없이 메모리 공간 및 온톨로지 로딩 측면에서 향상된 성능을 보였다.

그래프 구조를 이용한 카테고리 구조로부터 상하위 관계 추출 (Graph-based ISA/instanceOf Relation Extraction from Category Structure)

  • 최동현;최기선
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제37권6호
    • /
    • pp.464-469
    • /
    • 2010
  • 상하위 관계 자동 추출은 분류체계를 자동 구축하는 데 있어서 핵심적인 내용이며, 이렇게 자동으로 구축된 분류 체계는 정보 추출과 같은 여러 가지 분야에 있어서 중요하게 사용된다. 본 논문에서는 카테고리 구조로부터 상하위 관계를 추출하는 방식에 대하여 제안한다. 본 논문에서는 판별하고자 하는 카테고리 구조뿐만이 아닌, 그와 관련된 다른 카테고리 구조까지 고려하여 카테고리 이름에 나타난 토큰들간의 수식 그래프를 구축한 후, 그래프 분석 알고리즘을 통하여 각 카테고리 구조가 상하위 관계일 가능성에 대한 점수를 매긴다. 실험 결과, 본 알고리즘은 기존의 연구로 상하위 관계임을 판별할 수 없었던 일부 카테고리 구조에 대하여 성공적으로 상하위 관계인지를 판별하였다.

분산 환경하의 설계 및 제조활동을 위한 프로세스관리기법 연구 (A Process Management Framework for Design and Manufacturing Activities in a Distributed Environment)

  • 박화규;김현;오치재;정문정
    • 한국전자거래학회지
    • /
    • 제2권1호
    • /
    • pp.21-37
    • /
    • 1997
  • As the complexity in design and manufacturing activities of distributed virtual enterprises rapidly increases, the issue of process management becomes more critical to shorten the time-to-market, reduce the manufacturing cost and improve the product quality. This paper proposes a unified framework to manage design and manufacturing processes in a distributed environment. We present a methodology which utilizes process flow graphs to depict the hierarchical structure of workflows and process grammars to represent various design processes and design tools. To implement the proposed concept, we develop a process management system which mainly consists of a cockpit and manager programs, and we finally address a preliminary implementation procedure based on the Object Modeling Technique. Since the proposed framework can be a formal approach to the process management by providing formalism, parallelism, reusability, and flexibility, it can be effectively applied to further application domains of distributed virtual enterprises.

  • PDF

비보호 좌회전 포화유률 추정 (Estimation of Unprotected Left-Turn Saturation Flows)

  • 김경환
    • 대한교통학회:학술대회논문집
    • /
    • 대한교통학회 1998년도 Proceedings 제34회 추계 학술발표회
    • /
    • pp.236-244
    • /
    • 1998
  • When the capacity and traffic operation at signalized intersections are analyzed in Korea, the unprotected left-turn saturation flow rate, which is an important parameter for the analysis, is estimated form the USHCM model. thus, exact analysis of the left-turn is not possible because of the difference of traffic environments between two contries. In order to improve this problem, it is undertaken in this study to develop techniques for the estimation of unprotected left-turn saturation flows based on Korean drivers' data. As study intersections, signalized or unsignalized intersections on the 6, 4 and 2 lane streets are selected. the data for the saturation flow measurement and gap-acceptance behavior analysis are inputed in a notebook computer on the sites. The critical acceptance gaps of the 6, 4, and 2 lane streets are analyzed to be 6.0 secs, 4.6 secs, and 4.3 secs respectively. the average minimum headway of the left-turn vehicle was observed to be 2.6 secs. As the model to estimate unportected left-turn saturation flows, the drew model is recommended for 6 and 4 lane streets, and a graph is suggested for the 2-lane street. As the values of the parameters of the Drew model, the 2.6 secs of this study is recommended for the average minimum headway of the left-turn. But, the critical acceptance gap varies according to the approach speed of opposing traffic and driver population, it requires field survey to measure the gap of an intersection; however, the values of the gaps studied in this study may be used for the general intersections in urban area in Korean.

  • PDF

ValueRank: Keyword Search of Object Summaries Considering Values

  • Zhi, Cai;Xu, Lan;Xing, Su;Kun, Lang;Yang, Cao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권12호
    • /
    • pp.5888-5903
    • /
    • 2019
  • The Relational ranking method applies authority-based ranking in relational dataset that can be modeled as graphs considering also their tuples' values. Authority directions from tuples that contain the given keywords and transfer to their corresponding neighboring nodes in accordance with their values and semantic connections. From our previous work, ObjectRank extends to ValueRank that also takes into account the value of tuples in authority transfer flows. In a maked difference from ObjectRank, which only considers authority flows through relationships, it is only valid in the bibliographic databases e.g. DBLP dataset, ValueRank facilitates the estimation of importance for any databases, e.g. trading databases, etc. A relational keyword search paradigm Object Summary (denote as OS) is proposed recently, given a set of keywords, a group of Object Summaries as its query result. An OS is a multilevel-tree data structure, in which node (namely the tuple with keywords) is OS's root node, and the surrounding nodes are the summary of all data on the graph. But, some of these trees have a very large in total number of tuples, size-l OSs are the OS snippets, have also been investigated using ValueRank.We evaluated the real bibliographical dataset and Microsoft business databases to verify of our proposed approach.