• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1406-1423
• /
• 2014

Multi-mode device which combines multiple access technologies into a device will offer more cost-effective solution than a sole access implementation. Its concurrent multipath transfer (CMT) technology can transmit media flows over multiple end-to-end paths simultaneously, which is essential to select at least two paths from all available paths. At real networks, different paths are likely to overlap each other and even share bottleneck, which can weaken the path diversity gained through CMT. Spurred by this observation, it is necessary to select multiple independent paths as much as possible to avoid underlying shared bottleneck between topologically joint paths. Recent research in this context has shown that different paths with shared bottleneck can weaken the path diversity gained through CMT. In our earlier work, a grouping-based multipath selection (GMS) mechanism is introduced and developed. However, how to estimating the selection is still to be resolved. In this paper, we firstly introduce a Selection Correctness Index (SCI) to evaluate the correctness of selection results in actual CMT experiment. Therefore, this metric is helpful to discuss and validate the accuracy of the output paths. From extensive experiments with a realized prototype, the proposed scheme provides better evaluation tool and criterion in various network conditions.

• 한국멀티미디어학회논문지
• /
• 제11권4호
• /
• pp.415-422
• /
• 2008

XML의 사용이 증가함에 따라 XML로 표현된 문서를 효율적으로 저장하고 검색하기 위한 XML 문서 관리 시스템에 대한 많은 연구들이 활발하게 진행되고 있다. 최근에는 주로 관계형 DBMS의 장점을 이용한 XML 문서의 저장과 검색에 대한 연구가 이루어지고 있다. XML Parser를 이용하여 문서 내용을 관계형 테이블에 매핑(Mapping)하면 안정적이고 효율적인 XML 문서 관리 시스템을 구축할 수 있다. 본 논문에서 제안하는 X-Binder 시스템은 관계형 DBMS 기반의 역 인덱스 기법을 사용한다. 역 인덱스 기법은 빠른 검색속도를 보장하지만, 많은 저장 공간을 낭비하는 단점을 가진다. 이 문제점을 해결하기 위해 XML 문서 저장시 형제 관계를 가지는 경로들을 통합하여 저장한다. 제안하는 X-Binder 시스템은 XRel과의 성능 평가에서 저장 공간을 줄이고, 검색 시간을 단축하는 성과를 보였다.

• 드라이브 ㆍ 컨트롤
• /
• 제13권2호
• /
• pp.19-25
• /
• 2016

Recently, drivers have begun to regard comfort in the cabin as one of the most important factors in construction equipment like forklifts. Accordingly, it has become more important to design a forklift cabin with a better sound quality as well as lower sound level, which can make a driver more comfortable. In this paper, the correlation between subjective evaluation and Zwicker's sound quality index was analyzed through a blind test by a few workers in forklifts and other construction equipment in several countries. Correlation analysis showed that Loudness and Sharpness were ranked in sequence, and tendencies were different from country to country. Also, contribution analysis for Loudness and Sharpness using operational transfer path analysis (OTPA), which is widely used in the field of noise, vibration, and harshness (NVH), was performed. However, Loudness and Sharpness cannot be used with OTPA directly because there are no linear relationships between the sources and receivers. In this paper, both are calculated by applying the DIN 45631 method with a contribution rate (%) of 1/3 Octave Sound Pressure Level by OTPA method in addition to considering spectral masking.

• Journal of applied mathematics & informatics
• /
• 제31권5_6호
• /
• pp.595-608
• /
• 2013

Let G = (V, E) be a simple connected graph. The sets of vertices and edges of G are denoted by V = V (G) and E = E(G), respectively. In such a simple molecular graph, vertices represent atoms and edges represent bonds. The distance between the vertices $u$ and $v$ in V (G) of graph G is the number of edges in a shortest path connecting them, we denote by $d(u,v)$. In graph theory, we have many invariant polynomials for a graph G. In this paper, we focus on the Schultz polynomial, Modified Schultz polynomial, Hosoya polynomial and their topological indices of a molecular graph circumcoronene series of benzenoid $H_k$ and specially third member from this family. $H_3$ is a basic member from the circumcoronene series of benzenoid and its conclusions are base calculations for the Schultz polynomial and Hosoya polynomial of the circumcoronene series of benzenoid $H_k$ ($k{\geq}3$).

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2005년도 춘계학술대회 논문집
• /
• pp.1024-1027
• /
• 2005

This paper describes the performance index of mobile robot and development of testbed which is used to evaluate the index. The developed testbed has rectangular structure similar to a living room of home. It is semi-automation testbed system for evaluation of cleaning performance index. This system is composed with scattering and cleaning equipment of test materials, equipment rifting of objects in inner space and sides itself, vision processing system. To be consistent of performance evaluation of cleaning robot, we make use of camera in this system for the sake of measurement of robot s mobility, path and suction quantity.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2003년도 가을 학술발표논문집 Vol.30 No.2 (2)
• /
• pp.58-60
• /
• 2003

기존의 웹 문서나 컨텐츠의 한계를 극복하기 위해 메타데이터에 대한 연구가 활발히 이루어진 가운데 그 산물로 등장한 XML은 현재 다양한 분야에서 그 활용에 관한 연구가 활발히 진행되고 있다. 그리고 그 중에서 XML문서 자체를 저장 및 검색하는 부분에 대한 연구도 많은 성과가 있었다. XML의 대표적인 특징은 기존의 다른 컨텐츠와는 달리 문서의 구조를 기술할 수 있다는 것이며 이런 구조적 정보는 활용 방법에 따라 XML문서의 다양한 처리에 있어 성능을 향상시키는 핵심적인 요소가 될 수 있다. 이에 본 논문에서는 기존의 비트맵 인덱스(Bitmap Index)를 확장하여 역파일 색인 방법과 결합시켜 P_INDEX를 제안하고, P_INDEX를 활용한 다양한 경로 중심의 검색 방법을 제시한다.

• 전자공학회논문지B
• /
• 제29B권7호
• /
• pp.11-22
• /
• 1992

In this paper, a new indexing technique is proposed for efficient evaluation of nested queries on aggregation hierarchy in object-oriented data model. As an index data structure, an extended $B^{+}$ tree is introduced in which instance identifier to be searched and path information used for update of index record are stored in leaf node and subleaf node, respectively. the retrieval and update algorithm on the introduced index data structure is provided. Comparisons under a variety of conditions are given with current indexing techniques, showing improved performance in cost, i.e., the total number of pages accessed for retrieval and update.

• Journal of the Korean Data and Information Science Society
• /
• 제21권3호
• /
• pp.605-619
• /
• 2010

Caching of frequently accessed data in multi-hop ad hoc environment is a technique that can improve data access performance and availability. Cooperative caching, which allows sharing and coordination of cached data among several clients, can further en-hance the potential of caching techniques. In this paper, we propose a fuzzy cooperative caching scheme in mobile ad hoc networks. The cache management of the proposed caching scheme not only uses adaptively CacheData or CachePath based on data sim-ilarity and data utility, but also uses the replacement manager based on data pro t. Also, the proposed caching scheme uses a prefetch manager. When the TTL of the cached data expires, the prefetch manager evaluates the popularity index of the data. If the popularity index is larger than a threshold, the data is prefetched. Otherwise, its space is released. The performance of the proposed scheme is evaluated analytically and is compared to that of other cooperative caching schemes.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.399-409
• /
• 2007

In this paper we use iterative dynamic programming in the discrete case to solve a wide range of the nonlinear equations systems. First, by defining an error function, we transform the problem to an optimal control problem in discrete case. In using iterative dynamic programming to solve optimal control problems up to now, we have broken up the problem into a number of stages and assumed that the performance index could always be expressed explicitly in terms of the state variables at the last stage. This provided a scheme where we could proceed backwards in a systematic way, carrying out optimization at each stage. Suppose that the performance index can not be expressed in terms of the variables at the last stage only. In other words, suppose the performance index is also a function of controls and variables at the other stages. Then we have a nonseparable optimal control problem. Furthermore, we obtain the path from the initial point up to the approximate solution.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2004년도 학술발표회
• /
• pp.1300-1304
• /
• 2004

This study is to present a method of flood damaged area detection by the typhoon RUSA (August 31 - September 1, 2002) using Landsat 7 ETM+ and Landsat 5 TM images. Two images of Sept. 29, 2000 and Sept. 11, 2002 (path 115, row 34) were prepared for Gangreung, To identify the damaged areas, firstly, the NDVI (Normalized Difference Vegetation Index) of each image was computed, secondly, the NDVI values were reclassified as two categories that the negative index values including zero are the one and the positive index values are the other, thirdly the reclassified image before typhoon is subtracted from the reclassified image after typhoon to get DNDVI (Differential NDVI). Some part of urban and agricultural were classified into damaged area due to typhoon RUSA in Gangreung, $18.8km^2$ and $17.7km^2$ respectively.