• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅲ
• /
• pp.1319-1322
• /
• 2003

We present a web document summarizer, simpler more condense than the existing ones, of a search engine. This summarizer generates summaries with a statistic-based summarization method using Clustering or MMR technique to reduce redundancy in the results, and that generates summaries using Perfect Link Graph. We compare the results with the summaries generated by human subjects. For the comparison, we use FScore. Our experimental results verify the accuracy of the summarization methods.

• 한국통신학회논문지
• /
• 제21권5호
• /
• pp.1193-1199
• /
• 1996

This paper introduces an algorithm which uses MUIO and the shortest paths to minimize the length of test sequence. The length of test sequence is equal to the total number of the edges in a symmetric test graph $G^{*}$. Therefore, it is important to make a $G^{*}$ with the least number of the edges. This algorithm is based on the one proposed Shen[2]. It needs the complexity to make shortest paths but reduces the thest sequence by 1.0~9.8% over the Shen's algorithm. and this technique, directly, derives a symmetric test graph from an FMS.

• Journal of applied mathematics & informatics
• /
• 제8권3호
• /
• pp.889-897
• /
• 2001

Based on the prime graph of a finite simple group, its order is the product of its order components (see[4]). It is known that Suzuki-Ree groups [6], $PSL_2(q)$ [8] and $E_8(q)$ [7] are uniquely deternubed by their order components. In this paper we prove that the simple groups $A_p$ are also unipuely determined by their order components, where p and p-2 are primes.

• Journal of applied mathematics & informatics
• /
• 제5권3호
• /
• pp.771-784
• /
• 1998

In this paper we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutest ex-actly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets at O(e.n) {where e,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.

• 한국경영과학회지
• /
• 제19권1호
• /
• pp.189-199
• /
• 1994

This paper considers the covering network design problem (CNDP). In the CNDP, an undirected graph is given where nodes correspond to potential facility sites and arcs to potential links connecting facilities. The objective of the CNDP is to identify the least cost connected subgraph whose nodes cover the given demand points. The problem difines a demand point to be covered if some node in the selected graph is present within an appropriate distance from the demand point. We present an integer programming formulation for the problem and develop a dual-based solution procedure. The computational results for randomly generated test problems are also shown.

• 한국감성과학회:학술대회논문집
• /
• 한국감성과학회 2000년도 추계학술대회 논문집
• /
• pp.185-188
• /
• 2000

현재의 3차원 시각 정보 제시기는 Scene Graph 기반의 3차원 그래픽스 API에 기반을 두고 있다. 본 연구에서는 시각 정보 제시에 더불어 다양한 감각을 제시하기 위한 통합 제시 능력을 가지는 시스템으로 시각화 시스템을 확장하였다. 이 확장된 시스템은 다양한 감각 정보를 제시하기 위한 추가적인 정보를 가지는 확장된 Scene Graph을 가지고 운영되며, 통합된 Script System으로 각 감각 제시 시스템들간의 동기화 및 통합 관리와 제시 시스템의 확장에 유리한 장점을 가진다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2005년도 춘계학술대회 학술발표 논문집 제15권 제1호
• /
• pp.185-188
• /
• 2005

This paper suggests a control method for efficient topology/parameter evolution in a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynamic systems, We adopt a hierarchical breeding control mechanism with fitness-level-dependent differences to obtain better balancing of topology/parameter search - biased toward topological changes at low fitness levels, and toward parameter changes at high fitness levels. As a testbed for this approach, an eigenvalue assignment problem, which is to find bond graph models exhibiting minimal distance errors from target sets of eigenvalues, was tested and showed improved performance for various sets of eigenvalues.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2000년도 추계학술발표논문집 (하)
• /
• pp.1389-1392
• /
• 2000

본 논문은 프로시저 내에서 데이터 토큰들간의 정보흐름을 모델링 하기 위해서 정보 흐름 그래프(IFG : Information Flow Graph)라고 하는 프로그램 표현 도구를 개발하였다. IFG는 기존 제어 흐름 그래프와는 달리 프로그램 내에서 관심 있는 변수 값의 변화 과정을 쉽게 탐색할 수 있고, 정보 흐름의 미세 변화를 잘 표현할 수 있으므로, 프로그램에 대한 이해를 증진시킬 수 있다.

• 한국정보처리학회논문지
• /
• 제6권5호
• /
• pp.1219-1224
• /
• 1999

This paper derived Montgomery's parallel algorithms for modular multiplication based on Walter's and Iwamura's method, and compared data dependence graph of each parallel algorithm. Comparing the result, Walter's parallel algorithm has small computational index in data dependence graph, so it is selected and used to computed spatial and temporal pipelining diagrams with each projection direction for designing expansible bit-level systolic array. We also evaluated internal operation of proposed expansible systolic array C++ language.

• Kyungpook Mathematical Journal
• /
• 제59권1호
• /
• pp.175-190
• /
• 2019

In this paper, we provide results for the search number of the Cartesian product of graphs. We consider graphs on opposing ends of the spectrum: paths and cliques. Our main result determines the pathwidth of the product of cliques and provides a lower bound for the search number of the product of cliques. A consequence of this result is a bound for the search number of the product of arbitrary graphs G and H based on their respective clique numbers.