• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2005년도 BIOINFO 2005
• /
• pp.237-242
• /
• 2005

Predicting the cellular location of an unknown protein gives a valuable information for inferring the possible function of the protein. For more accurate prediction system, we need a good feature extraction method that transforms the raw sequence data into the numerical feature vector, minimizing information loss. In this paper, we propose new methods of extracting underlying features only from the sequence data by computing pairwise sequence alignment scores. In addition, we use composition based features to improve prediction accuracy. To construct an SVM ensemble from separately trained SVM classifiers, we propose specificity based weighted majority voting. The overall prediction accuracy evaluated by the 5-fold cross-validation reached 88.53% for the eukaryotic animal data set. By comparing the prediction accuracy of various feature extraction methods, we could get the biological insight on the location of targeting information. Our numerical experiments confirm that our new feature extraction methods are very useful for predicting subcellular localization of proteins.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2004년도 추계학술대회 논문집
• /
• pp.1496-1499
• /
• 2004

The paper persents an efficient method of extracting line segment in a grid map. The grid map is composed of 2-D grids that have both the occupancy and orientation probabilities based on the simplified Bayesian updating model. The probabilities and orientations of cells in the grid map are continuously updated while the robot explorers to their values. The line segments are, then, extracted from the clusters using Hough transform methods. The eng points of a line segment are evaluated from the cells in each cluster, which is simple and efficient comparing to existing methods. The proposed methods are illustrated by sets of experiments in an indoor environment.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.5-9
• /
• 2001

In this paper, we propose the new audio watermarking method and can be used on line processing. Instead of the wavelet transform, we use the integer wavelet transform for the reduction of the computational load. The watermark associated with the chi-square distribution is inserted into the signal on the integer wavelet domain. When extracting the watermark, the spread spectrum methods are used with the coefficients associated with the covariance sequence. We show that the chi-square distribution is a good tool for the spread spectrum method on the wavelet domain. This watermarking technique may be used for the control of the electrical product which can be controlled with the hidden signals and can be moved according to the audible signals simultaneously.

• 한국정보처리학회논문지
• /
• 제6권11S호
• /
• pp.3399-3409
• /
• 1999

Information filtering for internet search, in which new information retrieval environment is given, is different from traditional methods such as bibliography information filtering, news-group and E-mail filtering. Therefore, we cannot expect high performance from the traditional information filtering models when they are applied to the new environment. To solve this problem, we inspect the characteristics of the new filtering environment, and propose a semantic-based filtering model which includes a new filtering method using WordNet. For extracting keywords from documents, this model uses the SDCC(Semantic Distance for Common Category) algorithm instead of the TF/IDF method usually used by traditional methods. The world sense ambiguation problem, which is one of causes dropping efficiency of internet search, is solved by this method. The semantic-based filtering model can filter web pages selectively with considering a user level and we show in this paper that it is more convenient for users to search information in internet by the proposed method than by traditional filtering methods.

• 한국주거학회논문집
• /
• 제21권1호
• /
• pp.103-112
• /
• 2010

This Study is about the check-List composition for 'Low carbon green growth' of Long-life housing. That utilization for required the check-list composition at Sustainable building strategies and Design methods. That for long life housing, sustainable building strategies part of building construction and interior, the proper foundation for legislative system, maintenance methods with in building life cycle, sustainable and green architecture capability realization prepare for connection plan with 'Low carbon-green growth'. Extracting from elements of Architectural planing answer to basic concept of Low carbon-green growth and aimed at Low carbon scheme for energy saving, green growth scheme for environmental conservation as to each application purpose reconstitute by classify Check-list category about elements of Architectural planing. Through this architectural research deduce elements of architectural planing that can be research utilization with in Check-list composition.

• BMB Reports
• /
• 제35권4호
• /
• pp.428-431
• /
• 2002

The often-encountered problem of disrupting bacteria for the purpose of extracting soluble protein has generated various methods. Many require specialized equipment. Very often, especially during preliminary studies, investigators need a simple, fast, and inexpensive method for cell disruption that preserves biological activity. This paper compares some simple and inexpensive methods for cell disruption, such as bead-vortexing, freesing-thawing, French pressing, and sonication. It also provides some tips to increase protein yield and preserve biological activity. If performed under optimal conditions, bead-vortexing gives protein yields that are comparable to French pressing and sonication. It also preserves the activities of labile enzymes and releases periplasmic enzymes. Vortexing with glass beads appears to be the simplest method for cell disruption.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.24-29
• /
• 1996

If the LP problem doesn't have the optimal soultion uniquely, the solution fo the primal-dual barrier method converges to the interior point of the optimal face. Therefore, when the optimal vertex solution or the optimal basis is required, we have to perform the additional procedure to recover the optimal basis from the final solution of the interior point method. In this paper the exisiting methods for recovering the optimal basis or identifying the optimal solutions are analyzed and the new methods are suggested. This paper treats the two optimal basis recovery methods. One uses the purification scheme and the simplex method, the other uses the optimal face solutions. In the method using the purification procedure and the simplex method, the basic feasible solution is obtained from the given interior solution and then simplex method is performed for recovering the optimal basis. In the method using the optimal face solutions, the optimal basis in the primal-dual barrier method is constructed by intergrating the optimal solution identification technique and the optimal basis extracting method from the primal-optimal soltion and the dual-optimal solution.

• International Journal of CAD/CAM
• /
• 제6권1호
• /
• pp.81-87
• /
• 2006

This paper describes a method for extracting surfaces from multi-material CT (Computed Tomography) data. Most contouring methods such as Marching Cubes algorithm assume that CT data are composed of only two materials. Some extended methods such as [3, 6] can extract surfaces from the multi-material (non-manifold) implicit representation. However, these methods are not directly applicable to CT data that are composed of three or more materials. There are two major problems that arise from fundamentals of CT. The first problem is that we have to use n(n-1)/2 threshold values for CT data contains n materials and select appropriately one threshold value for each boundary area. The second is that we cannot reconstruct only from CT data in which area three or more materials are adjacent each other. In this paper, we propose a method to solve the problems by using image analysis and demonstrate the effectiveness of the method with application examples construct polygon models from CT data of machine parts.

• 한국멀티미디어학회논문지
• /
• 제19권4호
• /
• pp.681-688
• /
• 2016

In the intelligent video surveillance, recognizing the moving objects is important issue. However, the conventional moving object recognition methods have some problems, that is, the influence of light, the distinguishing between similar colors, and so on. The recognition methods for the moving objects using depth information have been also studied, but these methods have limit of accuracy because the depth camera cannot measure the depth value accurately. In this paper, we propose a recognition method for the moving objects by using both the depth and the color information. The depth information is used for extracting areas of moving object and then the color information for correcting the extracted areas. Through tests with typical videos including moving objects, we confirmed that the proposed method could extract areas of moving objects more accurately than a method using only one of two information. The proposed method can be not only used in CCTV field, but also used in other fields of recognizing moving objects.

• Journal of Information Processing Systems
• /
• 제18권5호
• /
• pp.628-636
• /
• 2022

Automatic program repair (APR) techniques focus on automatically repairing bugs in programs and providing correct patches for developers, which have been investigated for decades. However, most studies have limitations in repairing complex bugs. To overcome these limitations, we developed an approach that augments datasets by utilizing token tagging and applying machine learning techniques for APR. First, to alleviate the data insufficiency problem, we augmented datasets by extracting all the methods (buggy and non-buggy methods) in the program source code and conducting token tagging on non-buggy methods. Second, we fed the preprocessed code into the model as an input for training. Finally, we evaluated the performance of the proposed approach by comparing it with the baselines. The results show that the proposed approach is efficient for augmenting datasets using token tagging and is promising for APR.