• Honam Mathematical Journal
• /
• v.35 no.3
• /
• pp.395-406
• /
• 2013

Generalized paper folding sequences $X^n_p$ and $(X_pY_q)^n$ where $X,Y{\in}\{R,L,U,D\}$, and $n,p,q{\in}\mathbb{N}$, and with $p,q{\geq}2$ are classified in this paper. We show that all generalized paper folding sequences $X^n_p$ are classified into one type if we classify generalize paper folding sequences along with the numbers of downwards and upwards. In addition, we investigate the numbers of downwards and upwards in $(X_pY_q)^n$ and prove that all generalized paper folding sequences $(X_pY_q)^n$ are classified into two types.

• 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 Advanced Marine Engineering and Technology
• /
• v.33 no.1
• /
• pp.97-103
• /
• 2009

The process design of forward Extrusion and Upsetting of Axi-symmetric part has been studied in this paper. During the cold forging product; auto transmission Solenoid Valve part, the defects such as folding and under-fill can be appeared by the improperly controlled metal flow. In this study, to reduce the folding and under-fill the design of experiments has been used to find out the significant design variables in the design of forging process. This paper deals with an Process Planning with which designer can determine operation sequences even after only a little experience in Process Planning of Multi-Former products by multi-stage former working. The approach is based on knowledge-based rules, and a process knowledge-base consisting of design rules is built. Based on the systematic procedure of process sequence design, the forming operation of cold forged auto transmission Solenoid Valve part is analyzed by the commercial Finite Element program, DEFORM/2D.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2003.10a
• /
• pp.121-132
• /
• 2003

This paper describes a genetic algorithm for predicting RNA structures that contain various types of pseudoknots. Pseudolulotted RNA structures are much more difficult to predict by computational methods than RNA secondary structures, as they are more complex and the analysis is time-consuming. We developed an efficient genetic algorithm to predict RNA folding structures containing any type of pseudoknot, as well as a novel initial population method to decrease computational complexity and increase the accuracy of the results. We also used an interaction filter to decrease the size of the possible stem lists for long RNA sequences. We predicted RNA structures using a number of different termination conditions and compared the validity of the results and the times required for the analyses. The algorithm proved able to predict efficiently RNA structures containing various types of pseudoknots in long nucleotide sequences.

• Bioinformatics and Biosystems
• /
• v.1 no.1
• /
• pp.73-81
• /
• 2006

This paper describes a genetic algorithm for predicting RNA structures that contain various types of pseudoknots. Pseudoknotted RNA structures are much more difficult to predict by computational methods than RNA secondary structures, as they are more complex and the analysis is time-consuming. We developed an efficient genetic algorithm to predict RNA folding structures containing any type of pseudoknot, as well as a novel initial population method to decrease computational complexity and increase the accuracy of the results. We also used an interaction filter to decrease the size of the possible stem lists for long RNA sequences. We predicted RNA structures using a number of different termination conditions and compared the validity of the results and the times required for the analyses. The algorithm proved able to predict efficiently RNA structures containing various types of pseudoknots.