• Honam Mathematical Journal
• /
• v.34 no.3
• /
• pp.423-438
• /
• 2012

In this paper, we discuss numbers of downwards and upwards in generalized paper folding sequences. We compute the exact number of downwards and upwards in $R^n_p$ and $(R_pR_q)^n$ by using the properties of recursive sequences where n, p and q are natural numbers with $p{\geq}2$ and $q{\geq}2$.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.1
• /
• pp.19-25
• /
• 2012

The purpose of this paper is to derive powers $A^{n}$ using a system of recursive sequences for a given $2{\times}2$ matrix A. Introducing a recursive sequence we have a quadratic equation. Solutions to this quadratic equation are related with eigenvalues of A. By solving this quadratic equation we can easily obtain an explicit form of $A^{n}$. Our method holds when A is defined not only on the real field but also on the complex field.

• International Journal of Contents
• /
• v.3 no.2
• /
• pp.18-24
• /
• 2007

Biological sequences such as DNA and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of more than hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological datasets with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with a fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. The experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.507-512
• /
• 1992

This paper presents a method for the automatic generation of assembly sequences based on the recursive extraction of a preferred part along with the verification of its disassemblability. To verify the disassemblability of the part we inference the geometric precedence constraints using a method of extracting separable directions for the part and determine the disassemblability cost by the separability and stability cost. The proosed method provides a local optimal solution of finding a cost effective assembly plan, and the feasibility of calculating robot motion programs by evaluating separable directions in flexible manufacturing application. A case study is given to illustrate the concepts and procedure of the proposed scheme.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.70-76
• /
• 1996

In this paper, we have proposed a band stop filter (BSF) for pre-processing of image sequences before encoding. By pixel-wise temporal filtering of the image sequences using the BSF, the bandwidth and noise of the signal are reduced, while preserving the image quality in view of human visual perceptions. As a result, when compared to the original image sequences, te pre-filtered image sequence requires lower bit-rates for encoding, while there is not much degradation in quality. Also, it has been shown that the proposed BSF causes less smearing and blurring than the conventional recursive low pass filter for bandwidth and noise reductions.

• ETRI Journal
• /
• v.44 no.1
• /
• pp.38-50
• /
• 2022

This paper presents a study on the use of encoder-derived features in decoder-side depth estimation. The scheme of multiview video encoding does not require the transmission of depth maps (which carry the geometry of a three-dimensional scene) as only a set of input views and their parameters are compressed and packed into the bitstream, with a set of features that could make it easier to estimate geometry in the decoder. The paper proposes novel recursive block splitting for the feature extraction process and evaluates different scenarios of feature-driven decoder-side depth estimation, performed by assessing their influence on the bitrate of metadata, quality of the reconstructed video, and time of depth estimation. As efficient encoding of multiview sequences became one of the main scopes of the video encoding community, the experimental results are based on the "geometry absent" profile from the incoming MPEG Immersive video standard. The results show that the quality of synthesized views using the proposed recursive block splitting outperforms that of the state-of-the-art approach.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.275-289
• /
• 2009

In this paper, we investigate the global behavior of the difference equation $x_{n+1}\;=\;\frac{a+bx_{n-1}}{A+Bx^k_n}$, n=0,1,..., where a,b,$B\;{\in}\;[0,\infty)$ and A, $k\;{\in}\;(0,\infty)$ with non-negative initial conditions.

• Journal of Korea Society of Industrial Information Systems
• /
• v.3 no.1
• /
• pp.141-151
• /
• 1998

The importance of fax imagerestoration is constantly increasing with the widespreasd use of facsimile machines in almost every sector of modern society. Recently, Handley and Doutherty proposed a morphological method for restoration of fax images, Their method removed effectively the only salient noise in the fax images. However, it could not remove the white and pepper noise that can appear in fax images since they treated fax images as deterministic sequences rather than random fields. Furthermore, this approach suffers from computational burden since it does not use recursive restoration technique. To cope with those difficulties, in this paper, we propose a new restoration scheme for restoring fax images using Kalman fitering which provides and efficient recursive processor. The proposed restoration method is based on the wide-sense Markov random fields (WSM).In order to verify the performance of the proposed restoration method, several experiments with the CCITT Group 3 fax machine were conducted with the generated document .Experimental results revealed that our proposed restoration method was shown to be superior to Handley et.al's method for restoring fax images.

• Journal of applied mathematics & informatics
• /
• v.34 no.1_2
• /
• pp.35-48
• /
• 2016

In this paper we deal with the expressions of solutions and the periodicity nature of some systems of nonlinear difference equations with order three with nonzero real numbers initial conditions.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.583-590
• /
• 2008

In this article, we focuss on. sequences of polynomials with {$\pm1$} coefficients constructed by recursive argument that is known as Rudin-Shapiro polynomials. The asymptotic behavior of these polynomials defines as the ratio of their 2q-norm with 2-norm to be dominated by some number depending on q or "the best" by an absolute constant. In this work we first show the conjecture holds for some finite numbers of m and then introduce a technique that give the result for any positive odd integer m whenever it holds for all pervious even numbers.