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

검색결과 1,784건 처리시간 0.028초

순차상태전이금지(FSSTP)를 이용한 교착상태 관리제어를 위한 재구성 방법 (Reconfiguration method for Supervisor Control in Deadlock status Using FSSTP(Forbidden Sequence of State Transition Problem))

  • 송유진;이은주;이종근
    • 제어로봇시스템학회논문지
    • /
    • 제14권3호
    • /
    • pp.213-220
    • /
    • 2008
  • The object of this paper is to propose a method to deal with the problem of modeling user specifications in approaches based on supervisory control and Petri nets. However, most of Petri Net approaches are based on forbidden states specifications, and these specifications are suitable the use of tool such as the reachability graph. But these methods were not able to show the user specification easily and these formalisms are generally limited by the combinatorial explosion that occurs when attempting to model complex systems. Herein, we propose a new efficient method using FSSTP (Forbidden Sequences of State-Transitions Problem) and theory of region. Also, to detect and avoid the deadlock problem in control process, we use DAPN method (Deadlock Avoidance Petri nets) for solving this problem in control model.

An Alternative Way of Constructing Ancestral Graphs Using Marker Allele Ages from Population Linkage Disequilibrium Information

  • Park, Lee-Young
    • Genomics & Informatics
    • /
    • 제7권1호
    • /
    • pp.1-12
    • /
    • 2009
  • An alternative way of constructing ancestral graphs, which is different from the coalescent-based approach, is proposed using population linkage disequilibrium (LD) data. The main difference from the existing method is the construction of the ancestral graphs based on variants instead of individual sequences. Therefore, the key of the proposed method is to use the order of allele ages in the graphs. Distinct from the previous age-estimation methods, allele ages are estimated from full haplotype information by examining the number of generations from the initial complete LD to the current decayed state for each two variants depending on the direction of LD decay between variants. Using a simple algorithmic procedure, an ancestral graph can be derived from the expected allele ages and current LD decay status. This method is different in many ways from previous methods, and, with further improvement, it might be a good replacement for the current approaches.

Scatternet Formation Algorithm based on Relative Neighborhood Graph

  • Cho, Chung-Ho;Son, Dong-Cheul;Kim, Chang-Suk
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제8권2호
    • /
    • pp.132-139
    • /
    • 2008
  • This paper proposes a scatternet topology formation, self-healing, and self-routing path optimization algorithm based on Relative Neighborhood Graph. The performance of the algorithm using ns-2 and extensible Bluetooth simulator called blueware shows that even though RNG-FHR does not have superior performance, it is simpler and easier to implement in deploying the Ad-Hoc network in the distributed dynamic environments due to the exchange of fewer messages and the only dependency on local information. We realize that our proposed algorithm is more practicable in a reasonable size network than in a large scale.

클러스터링을 이용한 경험적 태스크 할당 기법 (A Heuristic Task Allocation Scheme Based on Clustering)

  • 김석일;전중남;김관유
    • 한국정보처리학회논문지
    • /
    • 제6권10호
    • /
    • pp.2659-2669
    • /
    • 1999
  • This paper a heuristic, clustering based task allocation scheme applicable to non-directed task graph on a distributed system. This scheme firstly builds a task-machine graph, and then applies a clustering process where in a pair of tasks that are connected to the highest cost edge is merged into a big one or a task is allocated to a machine. During the process, the proposed scheme figure out a machine onto which the task allocation may cause deduction of large communication overhead that has incurred between the task and tasks that are already allocated to the machine while the computation costs is slightly increased in the machine. Simulation for the various task graphs shows that the scheduling using the proposed scheme result far better than ones by using the traditional schemes. A comparison with optimal task scheduling also promises that our scheme derives optimal results more occasionally than the traditional schemes do.

  • PDF

Semidefinite Programming을 통한 그래프의 동시 분할법 (K-Way Graph Partitioning: A Semidefinite Programming Approach)

  • Jaehwan, Kim;Seungjin, Choi;Sung-Yang, Bang
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2004년도 가을 학술발표논문집 Vol.31 No.2 (1)
    • /
    • pp.697-699
    • /
    • 2004
  • Despite many successful spectral clustering algorithm (based on the spectral decomposition of Laplacian(1) or stochastic matrix(2) ) there are several unsolved problems. Most spectral clustering Problems are based on the normalized of algorithm(3) . are close to the classical graph paritioning problem which is NP-hard problem. To get good solution in polynomial time. it needs to establish its convex form by using relaxation. In this paper, we apply a novel optimization technique. semidefinite programming(SDP). to the unsupervised clustering Problem. and present a new multiple Partitioning method. Experimental results confirm that the Proposed method improves the clustering performance. especially in the Problem of being mixed with non-compact clusters compared to the previous multiple spectral clustering methods.

  • PDF

Research On The Relevance Between Mixed-use Complex and User Behaviour Based On Three-dimensional Spatial Analysis

  • Zhendong Wang;Yihan Pan;Yi Lu;Xihui Zhou
    • 국제초고층학회논문집
    • /
    • 제12권1호
    • /
    • pp.83-91
    • /
    • 2023
  • Under the dual pressure of population growth and land shortage, threedimensional development is the inevitable choice for cities in China. In such a scenario, a mixed-use complex has considerable potential in its realization and research. Based on space syntax and the three-dimensional visibility graph analysis, this paper describes the spatial and functional layout of the Shanghai Super Brand Mall and studies the relationship between spatial visibility and user behaviour through linear regression analysis and correlation analysis. This paper studies three different types of user behaviour, namely, path selection, staying selection, and store selection, and finds that spatial visibility and accessibility have different effects on user behaviour depending on the type and purpose of the activity. This paper reveals the influence of spatial and functional layout on user behaviour and puts forward the corresponding design strategy under the three-dimensional environment.

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

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

공공데이터의 의미적 연계를 위한 행정구역 지식 그래프 구축 (Building Knowledge Graph of the Korea Administrative District for Interlinking Public Open Data)

  • 김학래
    • 한국콘텐츠학회논문지
    • /
    • 제17권12호
    • /
    • pp.1-10
    • /
    • 2017
  • 오픈 데이터는 전세계적으로 많은 관심을 받고 있다. 우리나라 정부는 데이터 개방에 많은 노력을 기울이고 있다. 그러나, 공공 데이터의 양적 증가에도 불구하고 데이터에 대한 부족함이 여전히 지적되고 있다. 본 논문은 공공 데이터를 의미적으로 연결해 데이터 공유 및 활용을 향상시키기 위한 방법을 제안한다. 첫째, 대한민국 행정구역의 정의와 행정구역 사이의 관계를 의미적으로 표현하기 위한 지식 모델을 제안한다. 행정구역은 국가의 영역을 국가 행정상의 목적에 따라 구분한 단위이다. 행정구역 지식모델은 지방자치법을 기준으로 행정구역체계의 구조, 행정단위별 관계를 정의한다. 둘째, 대한민국 행정구역 데이터에 대한 지식그래프를 소개한다. 공공 데이터를 의미적 수준에서 연결시키는 기준정보로써 행정구역 지식그래프의 특징과 이기종 공공데이터 연계 및 데이터 품질 개선을 위한 방법을 소개한다. 마지막으로 행정기관 데이터의 연계 결과를 통해 행정구역 지식그래프의 응용 방법을 살펴본다. 행정기관 명칭은 기관별로 상이하게 활용하고 있기 때문에 행정구역 그래프를 통한 데이터 식별 및 정제와 더불어 데이터 품질 개선에 효과적인 접근 방안으로 고려할 수 있다.

Object Classification based on Weakly Supervised E2LSH and Saliency map Weighting

  • Zhao, Yongwei;Li, Bicheng;Liu, Xin;Ke, Shengcai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권1호
    • /
    • pp.364-380
    • /
    • 2016
  • The most popular approach in object classification is based on the bag of visual-words model, which has several fundamental problems that restricting the performance of this method, such as low time efficiency, the synonym and polysemy of visual words, and the lack of spatial information between visual words. In view of this, an object classification based on weakly supervised E2LSH and saliency map weighting is proposed. Firstly, E2LSH (Exact Euclidean Locality Sensitive Hashing) is employed to generate a group of weakly randomized visual dictionary by clustering SIFT features of the training dataset, and the selecting process of hash functions is effectively supervised inspired by the random forest ideas to reduce the randomcity of E2LSH. Secondly, graph-based visual saliency (GBVS) algorithm is applied to detect the saliency map of different images and weight the visual words according to the saliency prior. Finally, saliency map weighted visual language model is carried out to accomplish object classification. Experimental results datasets of Pascal 2007 and Caltech-256 indicate that the distinguishability of objects is effectively improved and our method is superior to the state-of-the-art object classification methods.

조선해양기자재 제작을 위한 SCM 기반 실시간 데이터 인터페이스 기술에 관한 연구 (A Study on the Real-time Data Interface Technology based on SCM for Shipbuilding and Marine Equipment Production)

  • 한명기;김영훈;박준수;이원호
    • 한국산업융합학회 논문집
    • /
    • 제27권1호
    • /
    • pp.143-149
    • /
    • 2024
  • The production and procurement of shipbuilding and offshore equipment is an important competitive factor in the shipbuilding and offshore industry. Recently, ICT-based digital technology has been rapidly applied to the manufacturing industry following the Fourth Industrial Revolution. Under the digital transformation, real-time data interface technology based on SCM (Supply Chain Management) is emerging as an important tool to improve the efficiency of the equipment manufacturing process. In this study, the characteristics and advantages and disadvantages of interface technologies of web-based data interface technologies were compared and analyzed. The performance was compared between theoretical evaluation based on technical features and practical application cases. As a result, it was confirmed that GraphQL is useful for selective data processing, but there is a problem with optimization, and REST API has a problem with receiving data due to a fixed data structure. Therefore, this study aims to suggest ways to utilize and optimize these data interface technologies.