• Title/Summary/Keyword: 중복순환

Search Result 38, Processing Time 0.029 seconds

A Cycle Detection Algorithm in Directed Graphs (유방향그래프에서의 순환 검출 알고리즘)

  • Lee, U-Gi;Lee, Jeong-Hun;Park, Sang-Eon;Kim, Neung-Hoe
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.172-178
    • /
    • 2005
  • 순환탐색 알고리즘 및 스택기반 알고리즘 등은 유방향그래프에서 순환과 순환경로를 발견하는 특정 정점으로부터 출발하여 연결된 그래프에서 순환을 탐색하는 것이다. 기존 연구의 단점은 모든 순환을 다 찾아내지지 못하는 경우라든지, 동일한 순환을 중복해서 찾아내는 문제가 있었다. 본 연구에서 제시하는 정점제거 순환탐색 알고리즘은 특정 정점의 순환을 발견한 뒤 그 정점을 삭제하므로 중복된 순환을 발견하지 않고 모든 순환을 찾을 수 있다. 또한 순환을 발견했을 때, 순환경로를 출력하는데 있어서 스택의 인덱스를 이용해, 저장경로를 탐색하지 않고 출력하는 방법을 제안하였다. 실험에서는 임의의 정점과 간선을 생성하여 그래프로 만들고, 각 알고리즘에 따른 모든 정점을 찾을 수 있는지, 그래프 상황에 따라 어떠한 장단점이 있는지, 간선이 많아질수록 인덱스 순환탐색 알고리즘보다 탐색시간이 얼마나 차이를 보이는지를 확인하였다. 웹 구조처럼 일정한 크기의 웹페이지와 많은 수의 링크가 존재하는 그래프에서 정점제거 순환탐색 알고리즘이 순환을 찾는데 적합하다는 것을 입증했다.

  • PDF

An efficient approach of avoiding extensions of duplicated graph patterns in cyclic graph mining (순환 그래프 마이닝에서 중복된 그래프 패턴의 확장을 피하는 효율적인 기법)

  • No, Young-Sang;Yun, Un-Il;Pyun, Gwang-Bum;Ryang, Heung-Mo;Lee, Gang-In;Ryu, Keun-Ho;Lee, Kyung-Min
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.12
    • /
    • pp.33-41
    • /
    • 2011
  • From Complicated graph structures, duplicated operations can be executed and the operations give low efficiency. In this paper, we propose an efficient graph mining algorithm of minimizing the extension of duplicated graph patterns in which the priorities of cyclic edges are considered. In our approach, the cyclic edges with lower priorities are first extended and so duplicated extensions can be reduced. For performance test, we implement our algorithm and compare our algorithm with a state of the art, Gaston algorithm. Finally, We show that ours outperforms Gaston algorithm.

Wireless Data Transmission Algorithm Using Cyclic Redundancy Check and High Frequency of Audible Range (가청 주파수 영역의 고주파와 순환 중복 검사를 이용한 무선 데이터 전송 알고리즘)

  • Chung, Myoungbeom
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.9
    • /
    • pp.321-326
    • /
    • 2015
  • In this paper, we proposed an algorithm which could transmit reliable data between smart devices by using inaudible high frequency of audible frequency range and cyclic redundancy check method. The proposed method uses 18 kHz~22 kHz as high frequency which inner speaker of smart device can make a sound in audible frequency range (20 Hz~22 kHz). To increase transmission quantity of data, we send mixed various frequencies at high frequency range 1 (18.0 kHz~21.2 kHz). At the same time, to increase accuracy of transmission data, we send some mixed frequencies at high frequency range 2 (21.2 kHz~22.0 kHz) as checksum. We did experiments about data transmission between smart devices by using the proposed method to confirm data transmission speed and accuracy of the proposed method. From the experiments, we showed that the proposed method could transmit 32 bits data in 235 ms, the transmission success rate was 99.47%, and error detection by using cyclic redundancy check was 0.53%. Therefore, the proposed method will be a useful for wireless transmission technology between smart devices.

A study on logit choice probability model taking into account the problems of common-nodes and common-links (노드중복과 링크중복문제를 고려한 로짓선택확률의 비교연구)

  • 백승걸;임용택;임강원
    • Journal of Korean Society of Transportation
    • /
    • v.18 no.2
    • /
    • pp.63-71
    • /
    • 2000
  • One Problem of the choice Property in logit model is interpreted as the Problem of common links and common nodes in choice set. Common node Problem Plays important role in deciding the efficiency of network loading and common link problem is connected with choice Problem, both of which are to be solved to improve the logit choice model. Although much need has been pointed out for research on the topic, however, no Paper as yet considers these two factors at the same time. In the Paper we develop a new logit formulation, which is able to ease the logit Problem, widely known as the Problem of IIA(Independence of Irrelevant Alternatives). An example network is used to assess the Proposed model and compare it with other conventional models. From the results, we find out that the model is superior to others.

  • PDF

Node Disjoint Parallel Paths of Even Network (이븐 연결망의 노드 중복 없는 병렬 경로)

  • Kim, Jong-Seok;Lee, Hyeong-Ok
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.9_10
    • /
    • pp.421-428
    • /
    • 2008
  • A. Ghafoor proposed Even networks as a class of fault-tolerant multiprocessor networks in [1] and analyzed so many useful properties include node disjoint paths. By introducing node disjoint paths in [1], fault diameter of Even networks is d+2(d=odd) and d+3(d=even). But the lengths of node disjoint paths proved in [1] are not the shortest. In this paper, we show that Even network Ed is node symmetric. We also propose the shortest lengths of node disjoint paths using cyclic permutation, and fault diameter of Even networks is d+1.

An Efficient Graph Cycle Detection Technique based on Pregel (프리겔 기반의 효율적인 그래프 순환 검출 기법)

  • Kim, Taeyeon;Kim, Hyunwook;Park, Kisung;Lee, Young-Koo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.11a
    • /
    • pp.152-154
    • /
    • 2013
  • 페타 바이트 이상의 규모의 빅 데이터 분석은 다양한 분야에서 연구되고 있다. 최근 소셜 네트워크, XML 등과 같은 구조적인 정보를 갖는 대용량의 그래프들을 분석하는 기술이 활발히 연구되고 있다. 이러한 대용량의 그래프를 분석하기 위한 연산중의 하나로 순환 그래프가 사용되고 있다. 대용량의 그래프 환경에서 순환을 검출하는 연산은 단일 컴퓨팅 시스템에서 처리가 불가능하거나 많은 시간 비용이 발생하여 분산처리가 필요하다. 본 논문에서는 그래프 처리에 효율적인 프리겔 프레임워크를 이용하여 효율적으로 순환을 검출하고, 중복 순환을 제거하기 위해 정규 순환 코드를 제안한다. 실험을 통하여 제안하는 기법이 대용량 그래프에서 효율적으로 순환을 찾을 수 있음을 보인다.

Service Quality at Sales Encounter: Need Hierarchy Model (판매접점에서 서비스품질의 욕구위계모델에 관한 연구)

  • 전인수;김은화
    • Asia Marketing Journal
    • /
    • v.6 no.1
    • /
    • pp.1-16
    • /
    • 2004
  • 서비스품질의 차원과 위계에 대한 논의가 최근 들어 늘어나고 있다. 그 이유는 서비스품질, 고객만족, 고객의 긍정적 행동의향, 수익성 간의 선순환 때문이다. 차원모델은 SERVQUAL과 SERVPERF 모델이 있고 위계모델은 Grönroos(1984)모델과 미국학자들이 개발한 모델이 대표적이다. 최근들어 이들을 결합한 하이브리드모델이 제안되고 있다. 하지만 기존의 하이브리드모델은 차원과 위계를 결합하여 일반성은 높지만 위계를 정하는 이론적 근거가 분명하지 않다. 본 연구는 욕구위계이론 중 Herzberg(1968)의 두 요인이론에 근거하여 서비스품질의 위계모델을 제시하려 한다. 이를 위해 CIT로 판매접점에서 고객이 느끼는 결정적 사건(critical incidents)을 조사하였다. 먼저 중복요인과 단독요인으로 나누고 각각을 다시 불만족중심과 만족중심으로 나눌 때 이들 결정적 사건이 잘 분류되었다. 분류결과 신뢰성은 불만족중심 중복요인, 응답성은 만족중심 중복요인, 공감성은 단독만족요인으로 나타났다. 본 연구에서 제시하는 서비스품질의 욕구위계모델에 따르면 신뢰성, 응답성, 공감성의 순으로 서비스품질이 중요하다. 확신성과 유형성은 따로 분류되는 결정적 사건이 없어 만족, 불만족 요인을 도와주는 조절요인으로 볼 수 있다.

  • PDF

Operative Treatment of Congenitally Corrected Transposition of the Great Arteries(CCTGA) (교정형 대혈관 전위증의 수술적 치료)

  • 이정렬;조광리;김용진;노준량;서결필
    • Journal of Chest Surgery
    • /
    • v.32 no.7
    • /
    • pp.621-627
    • /
    • 1999
  • Background: Sixty five cases with congenitally corrected transposition of the great arteries (CCTGA) indicated for biventricular repair were operated on between 1984 and september 1998. Comparison between the results of the conventional(classic) connection(LV-PA) and the anatomic repair was done. Material and Method: Retrospective review was carried out based on the medical records of the patients. Operative procedures, complications and the long-term results accoding to the combining anomalies were analysed. Result: Mean age was 5.5$\pm$4.8 years(range, 2 months to 18years). Thirty nine were male and 26 were female. Situs solitus {S,L,L} was in 53 and situs inversus{I,D,D} in 12. There was no left ventricular outflow tract obstruction(LVOTO) in 13(20%) cases. The LVOTO was resulted from pulmonary stenosis(PS) in 26(40%)patients and from pulmonary atresia(PA) in 26(40%) patients. Twenty-five(38.5%) patients had tricuspid valve regurgitation(TR) greater than the mild degree that was present preoperatively. Twenty two patients previously underwent 24 systemic- pulmonary shunts previously. In the 13 patients without LVOTO, 7 simple closure of VSD or ASD, 3 tricuspid valve replacements(TVR), and 3 anatomic corrections(3 double switch operations: 1 Senning+ Rastelli, 1 Senning+REV-type, and 1 Senning+Arterial switch opera tion) were performed. As to the 26 patients with CCTGA+VSD or ASD+LVOTO(PS), 24 classic repairs and 2 double switch operations(1 Senning+Rastelli, 1 Mustard+REV-type) were done. In the 26 cases with CCTGA+VSD+LVOTO(PA), 19 classic repairs(18 Rastelli, 1 REV-type), and 7 double switch operations(7 Senning+Rastelli) were done. The degree of tricuspid regurgitation increased during the follow-up periods from 1.3$\pm$1.4 to 2.2$\pm$1.0 in the classic repair group(p<0.05), but not in the double switch group. Two patients had complete AV block preoperatively, and additional 7(10.8%) had newly developed complete AV block after the operation. Other complications were recurrent LVOTO(10), thromboembolism(4), persistent chest tube drainage over 2 weeks(4), chylothorax(3), bleeding(3), acute renal failure(2), and mediastinitis(2). Mean follow-up was 54$\pm$49 months(0-177 months). Thirteen patients died after the operation(operative mortality rate: 20.0%(13/65)), and there were 3 additional deaths during the follow up period(overall mortality: 24.6%(16/65)). The operative mortality in patients underwent anatomic repair was 33.3%(4/12). The actuarial survival rates at 1, 5, and 10 years were 75.0$\pm$5.6%, 75.0$\pm$5.6%, and 69.2$\pm$7.6%. Common causes of death were low cardiac output syndrome(8) and heart failure from TR(5). Conclusion: Although our study could not demonstrate the superiority of each classic or anatomic repair, we found that the anatomic repair has a merit of preventing the deterioration of tricuspid valve regurgitations. Meticulous selection of the patients and longer follow-up terms are mandatory to establish the selective advantages of both strategies.

  • PDF

Analysis and Experiment of VS(Vertical Stabilization) Converter Controller for International Thermonuclear Experimental Reactor (국제 핵융합실험로용 VS(Vertical Stabilization) 컨버터 제어기 해석 및 실험)

  • Jo, Hyunsik;Oh, Jong-Seok;Cha, Hanju
    • Proceedings of the KIPE Conference
    • /
    • 2014.07a
    • /
    • pp.239-240
    • /
    • 2014
  • 본 논문에서는 국제 핵융합실험로용 VS 컨버터 제어기 해석 및 실험에 대하여 서술하였다. VS 컨버터는 플라즈마의 수직 안정성을 제어하기 위해서 ${\pm}1000V$의 정격전압과 최대 ${\pm}25kA$의 전류를 공급해야 하며, 영 전류구간이 없이 4상한 운전을 수행할 수 있어야 한다. 이를 위해서 부하전류의 크기에 따른 동작모드 구분과 순환전류제어기, 차전류 제어기가 요구되며 싸이리스터의 소자 특성에 의하여 발생하는 중복각 보상과 싸이리스터의 전류실패를 방지하는 감마제어가 포함이 된 점호각이 보장 되어야 한다. 본 논문에서는 국제 열핵융합실험로용 VS 컨버터 제어기를 해석하고, 실제 제어기와 RTDS를 연동하여 9ms의 순환전류 제어기 응답성과 계통에 50% 새그가 발생하였을 때 전류실패를 방지하는 감마제어의 타당성을 실험으로 확인하였다.

  • PDF

A Prioritization Method Considering Trip Patterns to Introduce Short-turn Buses (단거리 순환버스 도입을 위한 통행패턴 기반의 우선순위 결정방법)

  • Moon, Sedong;Kim, Dong-Kyu;Cho, Shin-Hyung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.5
    • /
    • pp.1-18
    • /
    • 2019
  • A short-turn bus is a bus that is operated within a subsection of an existing bus line. Previous studies regarding short-turn buses decided optimal turn-back points for a single bus line rather than a bus network. Also, in-vehicle crowding which has a significant impact on transit convenience was rarely considered. Therefore, this study aimed to develop a methodology to set priorities for the introduction of short-turn buses of bus lines and sections, considering crowding. To achieve this objective, we calculated occupancies and crowding alleviation benefits of existing bus lines overlapping a new short-turn route based on transit card data, before and after the introduction of short-turn strategy. Also, operator and social costs caused by the introduction of short-turn buses were calculated. Those procedures were iterated over bus lines and sections to operate a short-turn service, and a section whose benefit-to-cost ratio (B/C) is the largest in a line was selected to operate a short-turn service in the line. After, priorities of bus lines to introduce short-turn services could be determined based on B/C values, and the optimum total fleet size could be determined when a short-turn strategy is applied in multiple lines.