• 한국음향학회:학술대회논문집
• /
• 한국음향학회 2004년도 추계학술발표대회논문집 제23권 2호
• /
• pp.547-550
• /
• 2004

본 논문은 시스템 인식에서 RLS의 성능을 높이기 위한 한 방법으로 UDU 행렬 분해법을 바탕으로 한 recursive total least squares (RTLS) algorithm을 제안한다. 기존의 RTLS는 Power Method에 의거해서 recursive하게 만든 형태이어서 RLS와 거의 같은 구조이다. 그러나 본 논문에서는 일반적인 Power Method가 rank-1 update를 이용하기 때문에 ill-condition에 빠질 가능성이 높은 점을 감안하여, UDU 행렬 분해법을 사용한 RTLS방법을 제안하고, 그를 시스템 인식에 적용한다.

• Structural Engineering and Mechanics
• /
• 제62권3호
• /
• pp.297-302
• /
• 2017

Structural reanalysis is frequently utilized to reduce the computational cost so that the process of design or optimization can be accelerated. The supports can be regarded as the design variables and may be modified in various types of structural optimization problems. The location, number, and type of supports can make a great impact on the performance of the structure. This paper presents a unified method for structural static reanalysis with imposition or relaxation of some support constraints. The information from the initial analysis has been fully utilized and the computational time can be significantly reduced. Numerical examples are used to validate the effectiveness of the proposed method.

• Journal of Multimedia Information System
• /
• 제4권4호
• /
• pp.211-218
• /
• 2017

Recently, the number of subscribers of the webtoons published by some major internet portal companies and others is increasing and their revenues are continually rising. Accordingly, a number of studies are being conducted for this phenomenon. For the uploaders off webtoons, their works are graded and added up for the promotion review but the criteria of such a promotion system usually fall short of readers' expectations. Although most of the subscribes of webtoons are drawn into subscription mainly by the recommendation of people around them, the responses from the new subscribers were often quite different from what the portal companies have anticipated, affecting the rank of the webtoon. Thus, a promotion management system which provides a reliable and clear method of assessment is proposed in this study including the revenue and copyright management scheme for the cartoonists.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.164-166
• /
• 2005

In this paper, using ranks of co-occurrence frequency about indices in neighboring pixels, we introduce a new re-indexing scheme for efficiency of index color image lossless compression. The proposed method is suitable for arithmetic coding because it has skewed distributions of small variance. Experimental results proved that the proposed method reduces the bit rates than other coding schemes, more specifically 15%, 54% and 12% for LZW algorithm of GIF, the plain arithmetic coding method and Zeng's scheme.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.714-717
• /
• 1996

This paper presents a fault detection and diagnosis methodologies based on weighted symptom model and pattern matching between the coming fault propagation trend and the simulated one. At the first step, backward chaining is used to find the possible cause candidates for the faults. The weighted symptom model(WSM) is used to generate those candidates. The weight is determined from dynamic simulation. Using WSMs, the methodology can generate the cause candidates and rank them according to the probability. Secondly, the fault propagation trends identified from the partial or complete sequence of measurements are compared to the standard fault propagation trends stored a priori. A pattern matching algorithm based on a number of triangular episodes is used to effectively match those trends. The standard trends have been generated using dynamic simulation and stored a priori. The proposed methodology has been illustrated using two case studies and showed satisfactory diagnostic resolution.

• 한국멀티미디어학회논문지
• /
• 제21권1호
• /
• pp.10-17
• /
• 2018

Persistence Betty numbers, which are the rank of the persistent homology, are a generalized version of the size theory widely known as a descriptor for shape analysis. They show robustness to both perturbations of the topological space that represents the object, and perturbations of the function that measures the shape properties of the object. In this paper, we present a shape matching algorithm which is based on the use of persistence Betty numbers. Experimental tests are performed with Kimia dataset to show the effectiveness of the proposed method.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 추계학술대회
• /
• pp.1512-1517
• /
• 2003

This paper presents the calibration for the parallel typed tilting table. The calibration system needs only simple sensing device which is a digital indicator to measure the orientation of a table. The calibration algorithm is developed by a measurement operator. It eliminates the concern about the poor parameter observability due to a large number of parameters of parallel-mechanism. This paper uses the QR-decomposition to find the optimal calibration configurations maximizing the linear independence of rows of a observation matrix. The number of identifiable parameters is examined by the rank of the observation matrix, which represents the parameter observability. The method is applied to a Parallel-typed Tilting Table and all the necessary kinematic parameters are identifiable.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2346-2361
• /
• 2017

A major challenge in cloud infrastructure is the efficient allocation of virtual network elements on top of substrate network elements. Path algebra is a mathematical framework which allows the validation and convergence analysis of the mono-constraint or multi-constraint routing problems independently of the network topology or size. The present study proposes a new heuristic approach based on mathematical framework "paths algebra" to map virtual nodes and links to substrate nodes and paths in cloud. In this approach, we define a measure criterion to rank the substrate nodes, and map the virtual nodes to substrate nodes according to their ranks by using a greedy algorithm. In addition, considering multi-constraint routing in virtual link mapping stage, the used paths algebra framework allows a more flexible and extendable embedding. Obtained results of simulations show appropriate improvement in acceptance ratio of virtual networks and cost incurred by the infrastructure networks.

• International Journal of Knowledge Content Development & Technology
• /
• 제3권1호
• /
• pp.65-80
• /
• 2013

Today, citation index information is used as an outcome scale of spreading technology and encouraging research. Article citation information is an important factor to determine the authority of the relevant author. Google Scholar uses the article citation information to organize academic article search results with a rank algorithm. For an accurate analysis of such important citation index information, large amounts of bibliographic data are required. Therefore, this study aims to build a fast and efficient system for large amounts of bibliographic data, and to design and develop a system for quickly analyzing cited information for that data. This study also aims to use and analyze citation data to be a basic element for providing various advanced services to the academic article search system.

• KIEE International Transaction on Systems and Control
• /
• 제2D권2호
• /
• pp.115-119
• /
• 2002

In this paper we present a generalized directional morphological filtering algorithm for the removal of impulse noise, which is based on a combination of impulse noise detection and a weighted rank-order morphological filtering technique. For salt (or pepper) noise suppression, the generalized directional opening (or closing) filtering of the input signal is selectively used. The detection of impulse noise can be done by the geometrical difference of opening and closing filtering. Simulations show that this new filter has better detail feature preservation with effective noise reduction compared to other nonlinear filtering techniques.