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

In this paper, we propose a probabilistic framework to predict the interaction probability of proteins. The notion of domain combination and domain combination pair is newly introduced and the prediction model in the framework takes domain combination pair as a basic unit of protein interactions to overcome the limitations of the conventional domain pair based prediction systems. The framework largely consists of prediction preparation and service stages. In the prediction preparation stage, two appearance pro-bability matrices, which hold information on appearance frequencies of domain combination pairs in the interacting and non-interacting sets of protein pairs, are constructed. Based on the appearance probability matrix, a probability equation is devised. The equation maps a protein pair to a real number in the range of 0 to 1. Two distributions of interacting and non-interacting set of protein pairs are obtained using the equation. In the prediction service stage, the interaction probability of a protein pair is predicted using the distributions and the equation. The validity of the prediction model is evaluated fur the interacting set of protein pairs in Yeast organism and artificially generated non-interacting set of protein pairs. When 80% of the set of interacting protein pairs in DIP database are used as foaming set of interacting protein pairs, very high sensitivity(86%) and specificity(56%) are achieved within our framework.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.4
• /
• pp.202-211
• /
• 2014

Pairs trading is a type of arbitrage investment strategy that buys an underpriced security and simultaneously sells an overpriced security. Since the 1980s, investors have recognized pairs trading as a promising arbitrage strategy that pursues absolute returns rather than relative profits. Thus, individual and institutional traders, as well as hedge fund traders in the financial markets, have an interest in developing a pairs trading strategy. This study proposes pairs trading rules (PTRs) created from a price ratio between securities (i.e., stock index futures) using rough set analysis. The price ratio involves calculating the closing price of one security and dividing it by the closing price of another security and generating Buy or Sell signals according to whether the ratio is increasing or decreasing. In this empirical study, we generate PTRs through rough set analysis applied to various technical indicators derived from the price ratio between KOSPI 200 and S&P 500 index futures. The proposed trading rules for pairs trading indicate high profits in the futures market.

• Journal of the Korean Mathematical Society
• /
• v.43 no.1
• /
• pp.77-86
• /
• 2006

We consider the set of commuting pairs of matrices and their preservers over binary Boolean algebra, chain semiring and general Boolean algebra. We characterize those linear operators that preserve the set of commuting pairs of matrices over a general Boolean algebra and a chain semiring.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.2 no.2
• /
• pp.27-30
• /
• 1998

Let A and B be $m{\times}n$ matrices. A linear operator T preserves the set of matrices on which the rank is additive if rank(A+B) = rank(A)+rank(B) implies that rank(T(A) + T(B)) = rankT(A) + rankT(B). We characterize the set of all linear operators which preserve the set of pairs of $n{\times}n$ matrices on which the rank is additive.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.4
• /
• pp.299-308
• /
• 2004

In this paper, we propose a probabilistic framework to predict the interaction probability of proteins. The notion of domain combination and domain combination pair is newly introduced and the prediction model in the framework takes domain combination pair as a basic unit of protein interactions to overcome the limitations of the conventional domain pair based prediction systems. The framework largely consists of prediction preparation and service stages. In the prediction preparation stage, two appearance probability matrices, which hold information on appearance frequencies of domain combination pairs in the interacting and non-interacting sets of protein pairs, are constructed. Based on the appearance probability matrix, a probability equation is devised. The equation maps a protein pair to a real number in the range of 0 to 1. Two distributions of interacting and non-interacting set of protein pairs are obtained using the equation. In the prediction service stage, the interaction probability of a Protein pair is predicted using the distributions and the equation. The validity of the prediction model is evaluated for the interacting set of protein pairs in Yeast organism and artificially generated non-interacting set of protein pairs. When 80% of the set of interacting protein pairs in DIP database are used as teaming set of interacting protein pairs, very high sensitivity(86%) and specificity(56%) are achieved within our framework.

• Communications of the Korean Mathematical Society
• /
• v.15 no.4
• /
• pp.697-706
• /
• 2000

If an arithmetic progression F of length 2n and the number k with 2k$\leq$n are give, can we find two monic polynomials with the same degrees whose set of all zeros form F such that both the number of bad pairs and the number of nonreal zeros are 2k? We will consider the case that both the number of bad pairs and the number of nonreal zeros are two. Moreover, we will see the fundamental relation between the number of bad pairs and the number of nonreal zeros, and we will show that the polynomial in x where the coefficient of x(sup)k is the number of sequences having 2k bad pairs has all zeros real and negative.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2002.05a
• /
• pp.44-47
• /
• 2002

In order to make a doubly curved sheet metal effectively, a sheet metal forming process has been developed by adopting the flexibility of the incremental forming process and the principle of bending deformation which causes slight deformation to thickness. The developed process is an unconstrained forcing process with no holder. For this study, the experimental equipment is set up with the roll set which consists of two pairs of support rolls and one center roll. In the experiments using aluminum sheets and FEM simulation, it is found that the curvature of the formed sheet metal is determined by controlling the distance between supporting rolls in pairs and the forming depth of the center roll. The FEM simulation of the forming process using the roll set along the one path shows the distributions of the curvatures in two directions along the path, and gives information about the characteristics of the proposed forming process.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1999.03b
• /
• pp.18-21
• /
• 1999

In this study in order to make doubly-curved sheet metal effectively a sheet metal forming process has been developed by adopting the flexibility of the incremental forming process and the principle of bending deformation which causes slight deformation to thickness The developed process is an unconstrained forming process with no holder. For this study the experimental equipment is set up with the punch-set which consists of two pairs of lower support-punches and one upper center-punch. In the experiments using aluminum sheet it is found that the curvature of the formed sheet metal is determined by controlling the distance between supporting punches in pairs and the forming depth of the center-punch. and the edge-forming method is proposed for forming the sheet metal into the balanced shape. The equation using process variables such as the distance between supporting punches in pairs and the forming depth of the center-punch is proposed for the prediction of the radii of curvatures of the formed shape and it is corrected by the experimental results and the FEM simulation results about whether springback takes place. It is found that according o the simulation there is a certain set of the distance between a pair of supporting punches and the forming depth of the center-punch which causes a little springback. It is thus shown that the radii of curvatures of the formed sheet metal can be predicated by the corrected equation unless significant springback occurs.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.908-922
• /
• 1997

In this paper,we present an dffcient way to describe the commplex meaning embedded in video data for the cintent-based retrival in a video database.Intead of viewing the data stored in a file as continuous bit stream,we associate the desired interval in the stream with a set of atteibute and value pairs which describe its meaning.Since the meaning of video data can be cimplex and can change dyamically. It is necessary to com-bine the fixed schema of attributes used in the traditional database systrm with a description method through a set of attribute and value pairs that can be defined dynamically.As the cintent of viedo data can be expressed differently according to the view point of a user,it is important ot maintain the meaning of the attribute and value pairs cinsistently for different users.This paper proposes the dffctive way to manage the set of attri-bute and value pairs.In addition,it also describes a way to define a new video presentation by separating a video stream phsycally or by sharing the portion of a bit stream,and the new method can minimize the required storage space.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.3
• /
• pp.67-80
• /
• 2007

Recently, many studies on query processing algorithms has been done for spatial networks, such as roads and railways, instead of Euclidean spaces, in order to efficiently support LBS(location-based service) and Telematics applications. However, both a closest pairs query and an e-distance join query require a very high cost in query processing because they can be answered by processing a set of POIs, instead of a single POI. Nevertheless, the query processing cost for closest pairs and e-distance join queries is rapidly increased as the number of k (or the length of radius) is increased. Therefore, we propose both a closest pairs query processing algorithm and an e-distance join query processing algorithm using a POI-based materialization technique so that we can process closest pairs and e-distance join queries in an efficient way. In addition, we show the retrieval efficiency of the proposed algorithms by making a performance comparison of the conventional algorithms.