• 제목/요약/키워드: architecture graph

검색결과 150건 처리시간 0.03초

의료보건을 위한 의료정보처리에 관한 연구 (A Syudy on the Biomedical Information Processing for Biomedicine and Healthcare)

  • 정현철;박병전;배상현
    • 통합자연과학논문집
    • /
    • 제2권4호
    • /
    • pp.243-251
    • /
    • 2009
  • This paper surveys some researches to accomplish on bioinformatics. These researches wish to propose a database architecture combining a general view of bioinformatics data as a graph of data objects and data relationships, with the efficiency and robustness of data management and query provided by indexing and generic programming techniques. Here, these invert the role of the index, and make it a first-class citizen in the query language. It is possible to do this in a structured way, allowing users to mention indexes explicitly without yielding to a procedural query model, by converting functional relations into explicit functions. In the limit, the database becomes a graph, in which the edges are these indexes. Function composition can be specified either explicitly or implicitly as path queries. The net effect of the inversion is to convert the database into a hyperdatabase: a database of databases, connected by indexes or functions. The inversion approach was motivated by their work in biological databases, for which hyperdatabases are a good model. The need for a good model has slowed progress in bioinformatics.

  • PDF

Rotor dynamic analysis of a tidal turbine considering fluid-structure interaction under shear flow and waves

  • Lass, Andre;Schilling, Matti;Kumar, Jitendra;Wurm, Frank-Hendrik
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • 제11권1호
    • /
    • pp.154-164
    • /
    • 2019
  • A rotor dynamic analysis is mandatory for stability and design optimization of submerged propellers and turbines. An accurate simulation requires a proper consideration of fluid-induced reaction forces. This paper presents a bi-directional coupling of a bond graph method solver and an unsteady vortex lattice method solver where the former is used to model the rotor dynamics of the power train and the latter is used to predict transient hydrodynamic forces. Due to solver coupling, determination of hydrodynamic coefficients is obsolete and added mass effects are considered automatically. Additionally, power grid and structural faults like grid fluctuations, eccentricity or failure could be investigated using the same model. In this research work a fast, time resolved dynamic simulation of the complete power train is conducted. As an example, the rotor dynamics of a tidal stream turbine is investigated under two inflow conditions: I - shear flow, II - shear flow + water waves.

공간구문론을 활용한 실내공개공지 공공성 평가지표 개발 연구 - 뉴욕시 실내공개공지를 중심으로 - (A Study on Development of Publicness Evaluation Index of Indoor Privately Owned Public Space Using Space Syntax - Focused on New York City Indoor Privately Owned Public Spaces -)

  • 김정우;최재필
    • 대한건축학회논문집:계획계
    • /
    • 제36권4호
    • /
    • pp.83-92
    • /
    • 2020
  • The purpose of this study is to develop a publicness evaluation index for indoor privately owned public spaces (POPS). In order to develop the index, 10 cases of indoor POPS in New York City were analyzed using Visibility Graph Analysis by evaluating its accessibility and visual openness. The results are as follows; (1) Accessibility and openness of indoor POPS were higher compared to other public spaces on the first floor. (2) Cases with high accessibility index installed a higher number of entrances. (3) Cases with high openness index were mostly composed of a glass wall. (4) The publicness index was high when the lobby and the indoor POPS are shared. (5) Atrium types were highly utilized and the evaluation index was also high whereas, linear types were less utilized and the evaluation index was lower.

Post-pillars design for safe exploitation at Trepça hard rock mine (Kosovo) based on numerical modeling

  • Ibishi, Gzim;Genis, Melih;Yavuz, Mahmut
    • Geomechanics and Engineering
    • /
    • 제28권5호
    • /
    • pp.463-475
    • /
    • 2022
  • In the mine exploitation stage; one of the critical issues is the stability assessment of post-pillars. The instability of post-pillars leads to serious safety hazards in mining operations. The focus of this study is to assess the stability of post-pillars in the 130# stope in the central ore body at Trepça hard rock mine by employing both conventional (i.e., critical span curve) and numerical methods (i.e., FLAC3D). Moreover, a new numerical based index (i.e., Pillar Yield Ratio-PYR) was proposed. The aim of PYR index is to determine a border line between stable, potentially unstable, and failure state of post-pillars at a specific mine site. The critical value of pillar width to height ratio is 2.5 for deep production stopes (e.g., > 800 m). Results showed that pillar size, mining height and mining depth significantly have affected the post-pillar stability. The reliability of numerical based index (i.e., PYR) is verified based on empirical underground pillar stability graph developed by Lunder, 1994. The proposed pillar yield ratio index and pillar stability graph can be used as a design tool in new mining areas at Trepça hard rock mine and for other situations with similar geotechnical conditions.

다중에이전트 경로탐색(MAPF) 기반의 실내배송로봇 군집제어 구현 (Implementation of MAPF-based Fleet Management System)

  • 신동철;문형일;강성규;이성원;양현석;박찬욱;남문식;정길수;김영재
    • 로봇학회논문지
    • /
    • 제17권4호
    • /
    • pp.407-416
    • /
    • 2022
  • Multiple AMRs have been proved to be effective in improving warehouse productivity by eliminating workers' wasteful walking time. Although Multi-agent Path Finding (MAPF)-based solution is an optimal approach for this task, its deployment in practice is challenging mainly due to its imperfect plan-execution capabilities and insufficient computing resources for high-density environments. In this paper, we present a MAPF-based fleet management system architecture that robustly manages multiple robots by re-computing their paths whenever it is necessary. To achieve this, we defined four events that trigger our MAPF solver framework to generate new paths. These paths are then delivered to each AMR through ROS2 message topic. We also optimized a graph structure that effectively captures spatial information of the warehouse. By using this graph structure we can reduce computational burden while keeping its rescheduling functionality. With proposed MAPF-based fleet management system, we can control AMRs without collision or deadlock. We applied our fleet management system to the real logistics warehouse with 10 AMRs and observed that it works without a problem. We also present the usage statistic of adopting AMRs with proposed fleet management system to the warehouse. We show that it is useful over 25% of daily working time.

조선해양기자재 제작을 위한 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.

전술 네트워크 환경에서 그래프 클러스터링 방법을 이용한 동적 자원 할당 방법 (A Dynamic Resource Allocation Method in Tactical Network Environments Based on Graph Clustering)

  • 김민협;고인영;이춘우
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제41권8호
    • /
    • pp.569-579
    • /
    • 2014
  • 전술 네트워크 환경에서 임무 수행을 위해 조합된 서비스를 수행하기 위해서는 실제로 서비스를 제공하는 자원과 추상 서비스를 바인딩 하는 작업이 필요하다. 그러나 군이 운용하는 전술 네트워크는 대역폭이 낮고 패킷 손실률이 높아 서비스를 안정적으로 수행하기 위해서는 통신량을 최소화 해야 한다. 또한 전장 환경은 그 특성상 동적으로 변화한다. 이를 위해 본 논문에서는 분산 서비스 코디네이션 과정에 생기는 서비스 게이트웨이간 통신량을 최소화 하고 전장 환경의 변화 중 일부 게이트웨이의 무력화 상황을 고려하는 두 개의 자원 재할당 기법을 제안하고 게이트웨이간 총 통신 오버헤드와 할당 유사도를 기준으로 평가하였다.

Comparative Study on Path Design of Traditional Garden and Modernistic Park

  • Ha Jung-A;Toshitaro Minomo
    • Journal of the Korean Institute of Landscape Architecture International Edition
    • /
    • 제2호
    • /
    • pp.114-119
    • /
    • 2004
  • By Article two of a Japanese urban park low, it prescribes park facilities strictly, and one of the classifications includes 'path and plaza'. In addition, it is assumed that we divide several kinds different paths of width by size of the park in a path design of a park with a textbook of park design in a trunk line path, the main path, a vice-path or a branch path and design it. From such a thing, in the path of an urban park, a line consists straight of fixed width, and it is most that one pattern is considered to be. Therefore, in modem urban park, a path and division of a plaza are lucid explanation. It is rare that the historical parks which generally former daimyo gardens are shown later, and is used as a kind of an urban park width of the path where was particularly posted in a strolling garden in that is fixed, and width waits straight for even a line and waits, and, for this, there is. As a result, it is a path and the situation that are hard to be distinguished of a plaza. Although there are a difference of design and a difference of pavement materials in modem landscape space when We watch road surface constitution of the path that We did that will let you wait, in gross We are uniform, and it is it with a result to be poor in change nature. From such an observation, this consideration compared traditional landscape space and modem landscape space with path width about two points of road surface constitution through the trial that a graph analyzed the actual place data which measured into and lectured on an ideal method of a park path from this.

  • PDF

드브르젼 네트워크에서 고장 노드를 포함하지 않는 최단 경로 라우팅 (Fault free Shortest Path routing on the de Bruijin network)

  • ;;정연일;이승룡
    • 한국통신학회논문지
    • /
    • 제29권11B
    • /
    • pp.946-955
    • /
    • 2004
  • 드브르젼 그래프(dBG: de Bruijn graph)는 병렬 계산을 위한 구조나 인터커넥션 네트워크 설계에 사용되고 있다. dBG 지향 라우팅 알고리즘은 고장포용(fault tolerance) 라우팅과 최단 경로 라우팅에 포함되어 연구되고 있지만, 아직까지 dBG에서 고장 노드를 포함하지 않는 최단 경로(FFSP) 프로토콜에 대한 연구는 없는 실정이다. 네트워크는 계속하여 그 크기가 커지기 때문에 현실적으로 네트워크 장애는 피할 수 없는 일이 생기게 된다. 더욱이, 그러한 네트워크 장애에 대비하여 보통의 라우팅 알고리즘은 긴 지체 시간과 낮은 처리량 그리고 높은 트래픽을 발생시키게 된다. 본 논문은 양방향 드브르젼 그래프(BdBG)에 기반을 두고 네트워크 장애가 존재하는 상태에서의 두 가지 라우팅 알고리즘에 대하여 제안한다. 첫 번째는 알고리즘은 네트워크에 연결된 상태로 네트워크의 결함 노드가 존재할 경우에도 항상 최단거리 경로로 도달하게 하는 알고리즘이다. 두 번째 알고리즘은 첫 번째 알고리즘에 비해 최단 거리 경로를 찾아내는 성능을 높인 알고리즘이다. 두 알고리즘의 성능 평가 항목으로 경로 길이 측정과 이산 집합(Discrete Set: DS)의 크기를 정의하여 다른 알고리즘과 성능 평가를 비교하였으며, 성능 평가 결과 제안한 알고리즘들은 dBG 기반을 둔 실제 네트워크를 위한 라우팅에 적합하다는 결론을 얻었다.

A New Scan Partition Scheme for Low-Power Embedded Systems

  • Kim, Hong-Sik;Kim, Cheong-Ghil;Kang, Sung-Ho
    • ETRI Journal
    • /
    • 제30권3호
    • /
    • pp.412-420
    • /
    • 2008
  • A new scan partition architecture to reduce both the average and peak power dissipation during scan testing is proposed for low-power embedded systems. In scan-based testing, due to the extremely high switching activity during the scan shift operation, the power consumption increases considerably. In addition, the reduced correlation between consecutive test patterns may increase the power consumed during the capture cycle. In the proposed architecture, only a subset of scan cells is loaded with test stimulus and captured with test responses by freezing the remaining scan cells according to the spectrum of unspecified bits in the test cubes. To optimize the proposed process, a novel graph-based heuristic to partition the scan chain into several segments and a technique to increase the number of don't cares in the given test set have been developed. Experimental results on large ISCAS89 benchmark circuits show that the proposed technique, compared to the traditional full scan scheme, can reduce both the average switching activities and the average peak switching activities by 92.37% and 41.21%, respectively.

  • PDF