• Title/Summary/Keyword: 동적 그래프

Search Result 197, Processing Time 0.028 seconds

A Document Summarization System Using Dynamic Connection Graph (동적 연결 그래프를 이용한 자동 문서 요약 시스템)

  • Song, Won-Moon;Kim, Young-Jin;Kim, Eun-Ju;Kim, Myung-Won
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.1
    • /
    • pp.62-69
    • /
    • 2009
  • The purpose of document summarization is to provide easy and quick understanding of documents by extracting summarized information from the documents produced by various application programs. In this paper, we propose a document summarization method that creates and analyzes a connection graph representing the similarity of keyword lists of sentences in a document taking into account the mean length(the number of keywords) of sentences of the document. We implemented a system that automatically generate a summary from a document using the proposed method. To evaluate the performance of the method, we used a set of 20 documents associated with their correct summaries and measured the precision, the recall and the F-measure. The experiment results show that the proposed method is more efficient compared with the existing methods.

Robust Human Silhouette Extraction Using Graph Cuts (그래프 컷을 이용한 강인한 인체 실루엣 추출)

  • Ahn, Jung-Ho;Kim, Kil-Cheon;Byun, Hye-Ran
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.1
    • /
    • pp.52-58
    • /
    • 2007
  • In this paper we propose a new robust method to extract accurate human silhouettes indoors with active stereo camera. A prime application is for gesture recognition of mobile robots. The segmentation of distant moving objects includes many problems such as low resolution, shadows, poor stereo matching information and instabilities of the object and background color distributions. There are many object segmentation methods based on color or stereo information but they alone are prone to failure. Here efficient color, stereo and image segmentation methods are fused to infer object and background areas of high confidence. Then the inferred areas are incorporated in graph cut to make human silhouette extraction robust and accurate. Some experimental results are presented with image sequences taken using pan-tilt stereo camera. Our proposed algorithms are evaluated with respect to ground truth data and proved to outperform some methods based on either color/stereo or color/contrast alone.

Transient Analysis of Partially Supported Laminated Composite Plates With Cutouts (부분지지되고 개구부를 갖는 적층복합판의 동적해석)

  • Lee, Won Hong;Han, Sung Cheon;Yoon, Seok Ho
    • Journal of Korean Society of Steel Construction
    • /
    • v.10 no.4 s.37
    • /
    • pp.667-676
    • /
    • 1998
  • The transient analysis of partially supported laminated plates with rectangular holes under uniformly distributed transverse load is studied using finite element method. The first-order shear deformation theory and the variational energy method are employed in mathematical formulation. The effects on central deflection by plate thickness ratio, material modulus ratio, ply lamination geometry and boundary conditions are investigated Numerical results are presented and comparisons of the results by the present method with those given in the literature are made.

  • PDF

Improvement of Retrieval Feedback Using Dynamic Interaction Function (동적 상호작용 함수를 애용한 검색 피드백의 개선)

  • Han, Jung-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.2
    • /
    • pp.93-98
    • /
    • 2006
  • The paper describes a method o( user feedback in order to enhance the retrieval system effectiveness. The existing fuzzification function adapting fuzzy technique has difficulty that 4 type graph is made each time user select components. In this paper, to overcome this weak point of feedback, we proposed the interaction function using gaussian function that gives different learning rate according to choice of components with same function. We suggest the most efficient dynamic interaction function based on comparison of retrieval performance according to parameter of function. And then, we will construct the efficient retrieval system.

  • PDF

Two Level Path Planning Algorithm to Avoid Dynamic Obstacles (동적 장애물 회피를 위한 2단계 경로 계획 알고리즘)

  • Cho, Su-Jin;Kim, Kyung-Hye;Yu, Kyeon-Ah
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06b
    • /
    • pp.486-488
    • /
    • 2012
  • 본 논문에서는 로보틱스나 컴퓨터 게임 등의 다양한 분야에서 일반적으로 존재하는 동적인 환경에서 장애물 회피를 위한 경로 계획 알고리즘을 연구하였다. 제안하는 알고리즘은 전역 경로계획과 지역 경로계획의 두 단계로 이루어져 있고, A*와 가시성 그래프에 의해 구해진 전역 경로를 이동할 때에 동적 장애물을 감지하게 되면 이를 회피하기 위해 포텐샬장으로 지역 경로를 구성한다. 이 알고리즘은 포텐샬장을 A*와 결합함으로써 지역 최적화 문제를 해결하고 포텐샬장만으로 이동하는 경우에 비해 시간적인 측면에서도 더욱 효율적이다.

Alias Analysis for JavaScript Program Optimization (자바스크립트 프로그램 최적화를 위한 별칭 분석)

  • Jo, Gang-Won;Kim, Hong-June;Lee, Joo-Hwan;Nah, Jeong-Ho;Lee, Jae-Jin
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06c
    • /
    • pp.462-465
    • /
    • 2011
  • 웹 애플리케이션의 사용이 늘어남에 따라 자바스크립트 프로그램의 성능을 높이는 것이 중요한 문제가 되었다. 자바스크립 프로그램에 대해 별칭 분석을 수행하면 더 많은 최적화가 가능해지지만, 자비스크립트가 가지는 동적인 특성으로 인해 분석 방법을 고안하는 데 어려움이 있었다. 본 논문에서는 자바스크립트의 주요한 동적 특성을 온전하게 다루는 별칭 분석 알고리즘을 최초로 제안한다. 제안한 방법은 별칭 그래프를 생성하여 프로그램 내의 별칭 관계를 완전하게 찾아내며, 또한 실행시킬 코드가 동적으로 추가될 때마다 이전에 이루어졌던 최적화가 유효한지 검사한다. 별칭 분석 결과를 이용하여 V8 자바스크립트 엔진에서 추가적으로 최적화를 수행한 결과, 유의미한 수행 시간 감소를 확인할 수 있었다.

A Dynamic Distributed Mechanism for Optimization of Overlay Multicast Tree (오버레이 멀티캐스트 트리 최적화를 위한 동적 분산화 방법)

  • Choe, Han;Kim, Chong-Kwon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10c
    • /
    • pp.295-297
    • /
    • 2003
  • 오버레이 멀티캐스트의 성능 향상을 위해서는 멀티캐스트 트리의 최적화가 필요하다. 오버레이 멀티캐스트 트리의 최적화 문제는 그래프 상에서 각 노드의 차수가 제한되어 있을 때 지름이 가장 작은 트리를 만드는 문제와 같으며, 이는 NP­complete문제로 알려져 있다. 본 논문에서는 멀티캐스트 트리의 최적화를 위한 동적, 분산화 알고리즘을 제안한다. 각 사용자는 자신에서 출발하는 최대 경로의 길이를 계산하고, 주변 사용자와 변을 교환함을 통해 멀티캐스트 트리의 지름을 줄여나가게 된다. 이 알고리즘은 계산 상의 부하가 적고, 동적인 환경에 적응할 수 있으며, 중앙의 통제가 필요하지 않다는 장점을 가지고 있다.

  • PDF

Dynamic Adaptive Model based on Probabilistic Distribution Functions and User's Profile for Web Media Systems (웹 미디어 시스템을 위한 확률 분포 함수와 사용자 프로파일에 기반 한 동적 적응 모델)

  • Baek, Yeong-Tae;Lee, Se-Hoon
    • The Journal of Korean Association of Computer Education
    • /
    • v.6 no.1
    • /
    • pp.29-39
    • /
    • 2003
  • In this paper we proposed dynamic adaptive model based on discrete probabilistic distribution functions and user's profile for web media systems(web based hypermedia systems). The model represented that the application domain is modelled using a weighted direct graph and the user's behaviour is modelled using a probabilistic approach that dynamically constructs a discrete probability distribution functions. The proposed probabilistic interpretation of the web media structure is used to characterize latent properties of the user's behaviour, which can be captured by tracking user's browsing activity. Using that distribution the system attempts to assign the user to the best profile that fits user's expectations.

  • PDF

A Dynamic Path Computation Database Model in Mobile LBS System (모바일 LBS 시스템에서 동적 경로 계산 데이터베이스 모델)

  • Joo, Yong-Jin
    • Spatial Information Research
    • /
    • v.19 no.3
    • /
    • pp.43-52
    • /
    • 2011
  • Recently, interest in location-based service (LBS) which utilizes a DBMS in mobile system environment has been increasing, and it is expected to overcome the existing file-based system's limitation in advanced in-vehicle system by utilizing DBMS's advantages such as efficient storage, transaction management, modelling and spatial queries etc. In particular, the road network data corresponds to the most essential domain in a route planning system, which needs efficient management and maintenance. Accordingly, this study aims to develop an efficient graph-based geodata model for topological network data and to support dynamic path computation algorithm based on heuristic approach in mobile LBS system. To achieve this goal, we design a data model for supporting the hierarchy of network, and implement a path planning system to evaluate its performance in mobile LBS system. Last but not least, we find out that the designed path computation algorithm with hierarchical graph model reduced the number of nodes used for finding and improved the efficiency of memory.

Plagiarism Detection Using Dependency Graph Analysis Specialized for JavaScript (자바스크립트에 특화된 프로그램 종속성 그래프를 이용한 표절 탐지)

  • Kim, Shin-Hyong;Han, Tai-Sook
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.5
    • /
    • pp.394-402
    • /
    • 2010
  • JavaScript is one of the most popular languages to develope web sites and web applications. Since applicationss written in JavaScript are sent to clients as the original source code, they are easily exposed to plagiarists. Therefore, a method to detect plagiarized JavaScript programs is necessary. The conventional program dependency graph(PDG) based approaches are not suitable to analyze JavaScript programs because they do not reflect dynamic features of JavaScript. They also generate false positives in some cases and show inefficiency with large scale search space. We devise a JavaScript specific PDG(JS PDG) that captures dynamic features of JavaScript and propose a JavaScript plagiarism detection method for precise and fast detection. We evaluate the proposed plagiarism detection method with experiment. Our experiments show that our approach can detect false-positives generated by conventional PDG and can prune the plagiarism search space.