• International Journal of Aeronautical and Space Sciences
• /
• v.17 no.2
• /
• pp.204-213
• /
• 2016

A differential game theory based approach is used to develop an automated maneuver generation algorithm for Within Visual Range (WVR) air-to-air combat of unmanned combat aerial vehicles (UCAVs). The algorithm follows hierarchical decisionmaking structure and performs scoring function matrix calculation based on differential game theory to find the optimal maneuvers against dynamic and challenging combat situation. The score, implying how much air superiority the UCAV has, is computed from the predicted relative geometry, relative distance and velocity of two aircrafts. Security strategy is applied at the decision-making step. Additionally, a barrier function is implemented to keep the airplanes above the altitude lower bound. To shorten the simulation time to make the algorithm more real-time, a moving horizon method is implemented. An F-16 pseudo 6-DOF model is used for realistic simulation. The combat maneuver generation algorithm is verified through three dimensional simulations.

• Bioinformatics and Biosystems
• /
• v.2 no.1
• /
• pp.7-11
• /
• 2007

Methods for making scoring matrix based on phylogenetic tree for all possible exchanges of one amino acid with another. PFMT(Phylogenetic focused Mutation Tendency) matrix is different BLOSUM62 and PAM160 which are the most used scoring matrixes. This matrix calculates possibility of substitution from common ancestor to high spices. PFMT matrix scores substitution frequency in COGs databases which contain 152 KOGs's dataset. PFMT matrix usefully is able to compare between query sequence and sequences of more higher species and show detailed substitution relation of 20 amino acids.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.10
• /
• pp.1880-1885
• /
• 2007

In this paper, we propose the method that improve the performance of the Mowse. Mowse is the tool of the peptide mass fingerprinting that is used the identification of protein. In Mowse, frequency factor matrix is generated to regular interval for protein and peptide mass and the value of each elements is calculated to frequency of peptide. We propose new method for calculation of exact scoring value maintaining same size of matrix. The proposed method is that decide interval of matrix considering distribution of protein database. That is, interval of matrix is decided to small in many value of protein mass and is decided to large in few value of protein mass. We present the performance result both Mowse scoring method and the proposed scoring method.

• BMB Reports
• /
• v.35 no.5
• /
• pp.513-517
• /
• 2002

We describe a new method for identifying the sequences that signal the start of translation, and the boundaries between exons and introns (donor and acceptor sites) in human mRNA. According to the mandatory keyword, ORGANISM, and feature key, CDS, a large set of standard data for each signal site was extracted from the ASCII flat file, gbpri.seq, in the GenBank release 108.0. This was used to generate the scoring matrices, which summarize the sequence information for each signal site. The scoring matrices take into account the independent nucleotide frequencies between adjacent bases in each position within the signal site regions, and the relative weight on each nucleotide in proportion to their probabilities in the known signal sites. Using a scoring scheme that is based on the nucleotide scoring matrices, the method has great sensitivity and specificity when used to locate signals in uncharacterized human genomic DNA. These matrices are especially effective at distinguishing true and false sites.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2002.06a
• /
• pp.5-23
• /
• 2002

Motivation: Protein-protein interaction plays a critical role in the biological processes. The identification of interacting proteins by bioinformatical methods can provide new lead In the functional studies of uncharacterized proteins without performing extensive experiments. Results: Protein-protein interactions are predicted by a computational algorithm based on the weighted scoring system for domain interactions between interacting protein pairs. Here we propose potential interaction domain (PID) pairs can be extracted from a data set of experimentally identified interacting protein pairs. where one protein contains a domain and its interacting protein contains the other. Every combinations of PID are summarized in a matrix table termed the PID matrix, and this matrix has proposed to be used for prediction of interactions. The database of interacting proteins (DIP) has used as a source of interacting protein pairs and InterPro, an integrated database of protein families, domains and functional sites, has used for defining domains in interacting pairs. A statistical scoring system. named "PID matrix score" has designed and applied as a measure of interaction probability between domains. Cross-validation has been performed with subsets of DIP data to evaluate the prediction accuracy of PID matrix. The prediction system gives about 50% of sensitivity and 98% of specificity, Based on the PID matrix, we develop a system providing several interaction information-finding services in the Internet. The system, named PreDIN (Prediction-oriented Database of Interaction Network) provides interacting domain finding services and interacting protein finding services. It is demonstrated that mapping of the genome-wide interaction network can be achieved by using the PreDIN system. This system can be also used as a new tool for functional prediction of unknown proteins.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.15 no.3
• /
• pp.191-199
• /
• 2011

In this paper, we adopt a position specific scoring matrix as an abstraction of amino acid type to derive two new statistical potentials for protein structure prediction, and investigated its effect on the quality of the potentials compared to that derived using residue specific amino acid identity. For stringent test of the potential quality, we carried out folding simulations of 91 residue A chain of protein 2gpi, and found unexpectedly that the abstract amino acid type improved the quality of the one-body type statistical potential, but not for the two-body type statistical potential which describes long range interactions. This observation could be effectively used when one develops more accurate potentials for structure prediction, which are usually involved in merging various one-body and many-body potentials.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.3
• /
• pp.135-142
• /
• 2011

Unlike using the sequence-based representation for a chromosome in previous genetic algorithms for Bayesian structure learning, we proposed a matrix representation-based genetic algorithm. Since a good chromosome representation helps us to develop efficient genetic operators that maintain a functional link between parents and their offspring, we represent a chromosome as a matrix that is a general and intuitive data structure for a directed acyclic graph(DAG), Bayesian network structure. This matrix-based genetic algorithm enables us to develop genetic operators more efficient for structuring Bayesian network: a probability matrix and a transpose-based mutation operator to inherit a structure with the correct edge direction and enhance the diversity of the offspring. To show the outstanding performance of the proposed method, we analyzed the performance between two well-known genetic algorithms and the proposed method using two Bayesian network scoring measures.

• MALSORI
• /
• no.52
• /
• pp.101-110
• /
• 2004

This paper proposes a new confidence measure for utterance verification with posterior probability approximation. The proposed method approximates probabilistic likelihoods by using Viterbi search characteristics and a clustered phoneme confusion matrix. Our measure consists of the weighted linear combination of acoustic and phonetic confidence scores. The proposed algorithm shows better performance even with the reduced computational complexity than those utilizing conventional confidence measures.

• Proceedings of the Korean Institute of Industrial Safety Conference
• /
• 2002.11a
• /
• pp.263-269
• /
• 2002

Design method for Involute bevel gears is developed. The developed gear design system can design the optimized gear that minimize the number of pinion teeth with face tooth. Method of optimization is MS(matrix search) which is developed from this study. Design variables are pressure angle 20, transmitted power, gear volume, gear ratio, allowable contact stress and allowable bending stress, etc. Design method developed this study can bd applide to the plane, machine tools, automobiles.

• Journal of the Korean Society of Safety
• /
• v.18 no.4
• /
• pp.44-50
• /
• 2003

Design method for involute bevel gears is developed. The developed gear design system can design the optimized gear that minimize the number of pinion teeth with face tooth. Method of optimization is MS(matrix search) which is developed from this study. Design variables are pressure angle 20., transmitted power, gear volume, gear ratio, allowable contact stress and allowable bending stress. etc. Gears design method developed this study can be applied to the plane, helicopter, printer, machine tools.