• Genomics & Informatics
• /
• 제4권4호
• /
• pp.173-181
• /
• 2006

Pattern finding is one of the important tasks in a protein or DNA sequence analysis. Alignment is the widely used technique for finding patterns in sequence analysis. BLAST (Basic Local Alignment Search Tool) is one of the most popularly used tools in bio-informatics to explore available DNA or protein sequence databases. BLAST may generate a huge output for a large sequence data that contains various sequence patterns. However, BLAST does not provide a tool to summarize and analyze the patterns or matched alignments in the BLAST output file. BLAST lacks of general and robust parsing tools to extract the essential information out from its output. This paper presents a pattern summary system which is a powerful and comprehensive tool for discovering pattern structures in huge amount of sequence data in the BLAST. The pattern summary system can identify clusters of patterns, extract the cluster pattern sequences from the subject database of BLAST, and display the clusters graphically to show the distribution of clusters in the subject database.

• Journal of applied mathematics & informatics
• /
• 제29권3_4호
• /
• pp.831-846
• /
• 2011

There are several methods, in the literature, for finding the fuzzy optimal solution of fully fuzzy transportation problems (transportation problems in which all the parameters are represented by fuzzy numbers). In this paper, the shortcomings of some existing methods are pointed out and to overcome these shortcomings, a new method (based on fuzzy linear programming formulation) is proposed to find the fuzzy optimal solution of unbalanced fuzzy transportation problems with a new representation of trapezoidal fuzzy numbers. The advantages of the proposed method over existing method are discussed. Also, it is shown that it is better to use the proposed representation of trapezoidal fuzzy numbers instead of existing representation of trapezoidal fuzzy numbers for finding the fuzzy optimal solution of fuzzy transportation problems. To illustrate the proposed method a fuzzy transportation problem (FTP) is solved by using the proposed method and the obtained results are discussed. The proposed method is easy to understand and to apply for finding the fuzzy optimal solution of fuzzy transportation problems occurring in real life situations.

• 한국복합재료학회:학술대회논문집
• /
• 한국복합재료학회 2003년도 춘계학술발표대회 논문집
• /
• pp.147-151
• /
• 2003

In this study, we discussed the local buckling behavior of pultruded structural flexural members. Previous works were briefly reviewed and the local buckling behavior of orthotropic box-shape flexural members was discussed. The simplified form of equation for finding the width ratio of plate element of box-shape flexural members in which all plate components buckle simultaneously was proposed and the macro flow-chart for finding local buckling strength of pultruded flexural members was also suggested. To establish the design guide line for the local buckling of pultruded flexural members, further studies need to be performed as follows; the simplified form of solutions for finding the minimum buckling coefficient of orthotropic plate with various loading and boundary conditions including rotationally restrained boundary conditions, the simplified form of equation for calculating the coefficient of restraint provided by the adjacent plate elements.

• Journal of Mechanical Science and Technology
• /
• 제18권5호
• /
• pp.753-761
• /
• 2004

In this paper, an efficient method for generating 5-axis cutting data for a turbine blade is presented. The interference elimination of 5-axis cutting currently is very complicated, and it takes up a lot of time. The proposed method can generate an interference-free tool path, within an allowance range. Generating the cutting data just point to the cutting process and using it to obtain NC data by calculating the feed rate, allows us to maintain the proper feed rate of the 5-axis machine. This paper includes the algorithms for: (1) CL data generation by detecting an interference-free heel angle, (2) finding the optimal tool path interval considering the cusp-height, (3) finding the adaptive feed rate values for each cutter path, and (4) the inverse kinematics depending on the structure of the 5-axis machine, for generating the NC data.

• 한국공간구조학회논문집
• /
• 제18권2호
• /
• pp.25-34
• /
• 2018

This study investigated a bio-tensegrity structural system that combines the characteristics of a general tensegrity structural system with a biological system. The final research objective is to accomplish a changeability for the structural system as like the movement of the natural bio-system. In the study, we present a shape finding procedure for the two stage bio-tensegrity system model inspired by the movement pattern of animal backbone. The proposed system is allowing a dynamic movement by introducing the concept of "saddle" for the variable bio-tensegrity structure. Several shape finding analysis example and results are presented and shows a efficient validation and suitability.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2018년도 추계학술대회
• /
• pp.355-356
• /
• 2018

인터페로미터 방향탐지 시스템은 두 개 혹은 그 이상의 소자로 구성되는 안테나 시스템으로 수신되는 무선신호의 위상차를 사용하여 수신신호의 방향을 추정한다. 방탐정확도 향상을 위해, 방향탐지 시스템은 장치에서 발생하는 위상오차를 최소화하는 위상보정을 수행한다. 본 논문에서는 인터페로미터 방향탐지 시스템에서 수행되는 위상보정 방법에 대해 분류하였으며, 각 방법의 장단점에 대해 비교하였다.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2000년도 가을 학술발표회논문집
• /
• pp.51-58
• /
• 2000

Dynamic relaxation method is a shape finding analysis method for flexible structures by introducing the dynamic equilibrium equation. However, it is difficult for shape finding to estimate the most appropriate values for the mass and damping on each shape because the values are random one. In this study, the unit mass, the unit damping and the principal direction stiffness are utilized to avoid the random values, and the Newmarks assumption is introduced during the dynamic analysis. By introducing variant time increment method presented, the convergence time is reduced, that is, it can be reduced the total times for analysis.

• 산업기술연구
• /
• 제18권
• /
• pp.181-186
• /
• 1998

The flatness is the most important nature for the surface table. For finding such a flatness, the surface is surveyed along a number of straight lines parallel to the edges of table, which form a grid. Next, the variations in height of the grid points are measured relative to a datum point. If the number of such points is increased. It is not necessarily to use many grid points for finding the original flatness of a measured surface table. So, it is necessary to find the rational quantity of such grid points. It is found that about 220 points per $1m^2$ of surface table for measurement is the rational quantity with less than about 15% error of the original flatness.

• 한국중재학회지:중재연구
• /
• 제23권4호
• /
• pp.77-96
• /
• 2013

International Arbitration has distinguished itself as a method for dispute resolution that pleases both common and civil law practitioners. It, however, is not free of criticism, especially when fact-finding and evidentiary issues are at play. Perhaps because fact-finding is very closely linked to the culture in which they lie, perhaps because of the lack of a clear evidentiary rules governing international arbitration, a theory of evidence in international arbitration is still far fetched. Through the analysis of the distinctions between dispute resolution systems and the search for truth paradigm, this paper aims to develop and present an outline for the development of a theory of evidence in international arbitration.

• 산업경영시스템학회지
• /
• 제24권68호
• /
• pp.21-30
• /
• 2001

The purpose of this study is to present methods for determining the k most vital arcs (k-MVAs) in the minimum spanning tree problem(MSTP) using evolutionary algorithms. The problem of finding the k-MVAs in MSTP is to find a set of k arcs whose simultaneous removal from the network causes the greatest increase in the total length of minimum spanning tree. Generally, the problem which determine the k-MVAs in MSTP has known as NP-hard. Therefore, in order to deal with the problem of real world the heuristic algorithms are needed. In this study we propose to three genetic algorithms as the heuristic methods for finding the k-MVAs in MSTP. The algorithms to be presented in this study are developed using the library of the evolutionary algorithm framework(EAF) and the performance of the algorithms are analyzed through the computer experiment.