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

In the multidimensional protein identification technology of high-throughput proteomics, we use one-dimensional gel electrophoresis and after the separation by two-dimensional liquid chromatography, the sample is analyzed by tandem mass spectrometry. In this study, we have analyzed the Pseudomonas Putida KT2440 protein. From the protein identification, the protein database was combined with its reversed sequence database. From the peptide selection whose error rate is less than 1%, the SEQUEST database search for the tandem mass spectral data identified 2,045 proteins. For each protein, we compared the molecular weight calibrated from 1D-gel band position with the theoretical molecular weight computed from the amino acid sequence, by defining a variable MW$_{corr}$ Since the bacterial proteome is simpler than human proteome considering the complexity and modifications, the proteome analysis result for the Pseudomonas Putida KT2440 could suggest a guideline to build the protocol to analyze human proteome data.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 1998년도 춘계학술대회논문집; 용평리조트 타워콘도, 21-22 May 1998
• /
• pp.444-449
• /
• 1998

A modal transducer in two-dimensional structure can be implemented by varying the distributed transducer's gain spatially. In this paper, a method based on finite element method is developed for optimizing spatial gain distribution of PVDF transducer to create the modal transducer for specific modes. Using this concept, one can design the modal transducer in two-dimensional structure having arbitrary geometry and boundary conditions. As a practical means for implementing this continuous gain distribution without repoling die PVDF film, the gain distribution is approximated by optimizing gain-weights of interface circuit. The whole spatial area of the PVDF film is divided into several electrode segments and the signals from each segment are properly weighted and summed by interface circuit. This corresponds to the approximation of a continuous function using discrete values. The electrode partition is optimized using the genetic algorithm. Gain-weights are optimized using the simplex search method. A modal sensor for first to fourth modes of aluminum plate is designed using PVDF film with gain-weighted interface circuit. Various lamination angles of PVDF film are taken into consideration to utilize the anisotropy of the PVDF film. Performance of the optimized' PVDF sensor is demonstrated by numerical simulations..

• Genomics & Informatics
• /
• 제1권2호
• /
• pp.65-74
• /
• 2003

Data mining differs primarily from traditional data analysis on an important dimension, namely the scale of the data. That is the reason why not only statistical but also computer science principles are needed to extract information from large data sets. In this paper we briefly review data mining, its characteristics, typical data mining algorithms, and potential and ongoing applications of data mining at biopharmaceutical industries. The distinguishing characteristics of data mining lie in its understandability, scalability, its problem driven nature, and its analysis of retrospective or observational data in contrast to experimentally designed data. At a high level one can identify three types of problems for which data mining is useful: description, prediction and search. Brief review of data mining algorithms include decision trees and rules, nonlinear classification methods, memory-based methods, model-based clustering, and graphical dependency models. Application areas covered are discovery compound libraries, clinical trial and disease management data, genomics and proteomics, structural databases for candidate drug compounds, and other applications of pharmaceutical relevance.

• 한국멀티미디어학회논문지
• /
• 제15권2호
• /
• pp.215-225
• /
• 2012

멀티미디어 데이터베이스에서는 검색 효율을 높이기 위해 다차원 공간에 기초한 색인 방법이 사용되고 있다. 그러나 이 방법은 거리 계산의 척도로 유클리드 거리를 이용하여야 한다는 전제가 있어 범용성이 떨어진다. 한편, 거리 공리의 성립을 전제로 하는 거리 공간에 기반한 색인 방법은 유클리드 거리 이외의 거리 척도를 이용할 수 있기 때문에 범용성이 높다. 본 논문에서는 거리 공간을 색인화하는 방법 중 하나인 VP-tree의 방법을 개선하고자 한다. VP-tree는 검색 시에 루트 노드로부터 검색 범위에 적합한 노드를 따라 최종에 이르는 리프 노드에 링크되어 있는 오브젝트와의 거리를 계산하고, 검색 범위에 적합한가를 검사한다. 그러나 리프 노드에서 거리 계산 횟수가 증가하면 검색 속도가 떨어지기 때문에 리프 노드에서 삼각 부등식을 이용한 범위 압축 방법에 주목하고 그 개량 방법으로서 질의 오브젝트에 대한 최근접점을 삼각 부등식의 기준점으로 이용하는 방법을 제안한다. 이 개량 방법에 의해 검색 범위를 크게 좁힐 수 있으며, 또한 거리 계산의 횟수도 꽤 줄일 수 있다. 실제로 10,000 건의 영상 데이터를 이용하여 시스템의 성능 평가를 진행해 본 결과 기존 방법에 비해 유사 영상의 검색 시간을 5%~12%까지 절감할 수 있었다.

• 대한수학회논문집
• /
• 제9권4호
• /
• pp.905-915
• /
• 1994

Let $M_g$ be the moduli space of isomorphism classes of genus g smooth curves. It is a quasi-projective variety of dimension 3g - 3, when $g > 2$. It is known that a complete subvariety of $M_g$ has dimension $< g-1 [D]$. In general it is not known whether this bound is rigid. For example, it is not known whether $M_4$ has a complete surface in it. But one knows that there is a complete curve through any given finite points [H]. Recently, an explicit example of a complete curve in moduli space is given in [G-H]. In [G-H] they constructed a complete curve of $M_3$ as an intersection of five hypersurfaces of the Satake compactification of $M_3$. One way to get a complete curve of $M_3$ is to find a complete one dimensional family $p : X \to B$ of plane quartics which gives a nontrivial morphism from the base space B to the moduli space $M_3$. This is because every non-hyperelliptic smooth curve of genus three can be realized as a nonsingular plane quartic and vice versa. This paper has come out from the effort to find such a complete family of plane quartics. Since nonsingular quartics form an affine space some fibers of p must be singular ones. In this paper, due to the semistable reduction theorem [M], we search singular plane quartics which can occur as singular fibers of the family above. We first list all distinct plane quartics in terms of singularities.

• 산업경영시스템학회지
• /
• 제42권4호
• /
• pp.183-193
• /
• 2019

Process mining is an analytical technique aimed at obtaining useful information about a process by extracting a process model from events log. However, most existing process models are deterministic because they do not include stochastic elements such as the occurrence probabilities or execution times of activities. Therefore, available information is limited, resulting in the limitations on analyzing and understanding the process. Furthermore, it is also important to develop an efficient methodology to discover the process model. Although genetic process mining algorithm is one of the methods that can handle data with noises, it has a limitation of large computation time when it is applied to data with large capacity. To resolve these issues, in this paper, we define a stochastic process tree and propose a tabu search-genetic process mining (TS-GPM) algorithm for a stochastic process tree. Specifically, we define a two-dimensional array as a chromosome to represent a stochastic process tree, fitness function, a procedure for generating stochastic process tree and a model trace as a string of activities generated from the process tree. Furthermore, by storing and comparing model traces with low fitness values in the tabu list, we can prevent duplicated searches for process trees with low fitness value being performed. In order to verify the performance of the proposed algorithm, we performed a numerical experiment by using two kinds of event log data used in the previous research. The results showed that the suggested TS-GPM algorithm outperformed the GPM algorithm in terms of fitness and computation time.

• 한국콘텐츠학회논문지
• /
• 제9권9호
• /
• pp.97-104
• /
• 2009

본 논문은 고차원 얼굴 모션 캡처 데이터를 선형 및 비선형 투영 기법에 각각 적용하고, 이를 2차원 평면으로 투영하기 위한 최적의 방법론에 대한 것이다. 본 방법의 핵심 요소는 프레임 단위의 고차원 얼굴 표정 데이터를 선형 투영 기법인 PCA와 비선형 투영 기법인 Isomap, MDS, CCA, Sammon's Mapping, LLE 등에 적용하고 이를 저차원 공간에 분포시키는 방법론 및 그 결과를 비교 분석하는 것이다. 이를 위해서는 먼저 기존의 고차원 얼굴 표정 프레임 데이터들 사이의 거리를 구하고, 선형 및 비선형 투영 기법들을 적용한 상태에서 기존의 데이터들 사이의 거리 관계를 유지하면서 저차원인 2차원 평면 공간에 분포시키는 것이다. 그리고 2차원 공간에 분포된 얼굴 표정 데이터가 원형 데이터와 비교 했을 때, 최적의 상태로 프레임 데이터들 사이의 거리 관계를 유지하고 있는 투영 기법을 찾는다. 결국 본 논문에서는 고차원 얼굴 표정 데이터를 저차원 공간에 투영하기 위한 선형 및 비선형 투영 기법들을 비교 분석하고, 각각에서 최적의 투영 기법을 찾아낸다.

• 전기학회논문지
• /
• 제62권11호
• /
• pp.1578-1583
• /
• 2013

In this paper, stochastic optimization algorithms of PSO (Particle Swarm Optimization) and APSO (Adaptive Particle Swam Optimization) are studied and compared. It is revealed that the APSO provides faster convergence and better search efficiency than the conventional PSO when they are adopted to find the global minimum of a two-dimensional function. The advantages of the APSO comes from the ability to control the inertia weight, and acceleration coefficients. To verify that the APSO is working better than the standard PSO, the design of a 10GHz microstrip patch as one of the elements of a high frequency array antenna is taken as a test-case and shows the optimized result with 5 iterations in the APSO and 28 iterations in th PSO.

• 한국콘크리트학회:학술대회논문집
• /
• 한국콘크리트학회 2000년도 가을 학술발표회논문집(I)
• /
• pp.253-258
• /
• 2000

Recently, the area of design optimization, especially structural optimization, has been and to be a continuous active area of research. And the design optimizations of port facilities have been achieved by many other civil engineers. But the design optimization of port facilities were limited to the design optimization of the breasting dolphin. This paper invested the design optimization of mooring pier and the foundations of mooring pier was suggested considering the convenience of repair and reinforcement work. The mooring pier devised with prestressed precast concrete panel and rigid frame welded wide flange beam to steel pipe pile. To accomplish the design optimization of mooring pier, the Augmented Lagrangian Multiplier Method(ALM) of ADS(Garret N. Vanderplaats) optimization routine, BFGS method as optimizer and Golden Section Method as one dimensional search were utilized. As a result, thirty percent of material cost for construction was reduced by design optimization. The tensile stress of concrete panel and bottom flage was critical constraints under service load. So, using high strength concrete and steel will be economical. And lots of initial values must be invested to accomplish the design optimization in design procedures.

• 디지털산업정보학회논문지
• /
• 제8권4호
• /
• pp.159-165
• /
• 2012

The accurate focusing position should be determined for accurate measurements In VMS. Camera lens focusing is an important problem in computer vision and video measuring systems (VMS) that use CCD cameras and high precision XYZ stages. Camera focusing is a very important step in high precision measurement systems that use computer vision technique. The auto focusing process consists of two steps, the focus value measurement step and the exact focusing position determination step. It is suitable for eliminating high frequency noises with lower processing time and without blurring. An automatic focusing technique is applied to measure a crater with a one-dimensional search algorithm for finding the best focus. Throughout this paper, the suggested algorithm for the Auto focusing was combined with the learning. As a result, it is expected that such a combination would be expanded into the system of recognizing voices in a noisy environment.