• 한국전산유체공학회지
• /
• 제11권2호
• /
• pp.19-24
• /
• 2006

A research to evaluate the efficiency of design optimization was carried out for aerodynamic design optimization problem in distributed computing environment. The aerodynamic analyses which take most of computational work during design optimization were divided into several jobs and allocated to associated PC clients through network. This is not a parallel process based on domain decomposition in a single analysis rather than a simultaneous distributed-analyses using network-distributed computers. GBOM(gradient-based optimization method), SAO(Sequential Approximate Optimization) and RSM(Response Surface Method) were implemented to perform design optimization of transonic airfoils and evaluate their efficiencies. dimensional minimization followed by direction search involved in the GBOM was found an obstacle against improving efficiency of the design process in the present distributed computing system. The SAO was found fairly suitable for the distributed computing environment even it has a handicap of local search. The RSM is apparently the most efficient algorithm in the present distributed computing environment, but additional trial and error works needed to enhance the reliability of the approximation model deteriorate its efficiency from the practical point of view.

• International Journal of Contents
• /
• 제3권2호
• /
• pp.18-24
• /
• 2007

Biological sequences such as DNA and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of more than hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological datasets with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with a fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. The experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.1263-1266
• /
• 1998

In this paper, we propose an optimal feature extraction method for normally distributed multiclass data. We search the whole feature space to find a set of features that give the smallest classification error for the Gaussian ML classifier. Initially, we start with an arbitrary feature vector. Assuming that the feature vector is used for classification, we compute the classification error. Then we move the feature vector slightly and compute the classification error with this vector. Finally we update the feature vector such that the classification error decreases most rapidly. This procedure is done by taking gradient. Alternatively, the initial vector can be those found by conventional feature extraction algorithms. We propose two search methods, sequential search and global search. Experiment results show that the proposed method compares favorably with the conventional feature extraction methods.

• 정보처리학회논문지B
• /
• 제8B권6호
• /
• pp.705-717
• /
• 2001

이 논문에서는 카메라로 연속으로 촬영한 일련의 그레이레벨 영상으로부터 전방의 차량을 포착하기 위한 빠른 차선검출방법을 제안한다. 개별 영상에서 가려지지 않는 제한된 영역을 대상으로 차선의 위치를 검출하고, 에지 영상을 이용하여 차선의 기울기를 구한다. 이를 근거로 차량이 존재할 가능성이 있는 관심영역을 구하고 그 영역 내에서 에지 성분을 이용하여 구조적 방법으로 전방 차량의 위치를 포착한다. 제안된 방식의 효과를 검증하기 위해 노트북 PC와 PC용 CCD 카메라로 도로에서의 영상을 촬영하고 차선검출알고리즘을 적용한 처리 시간, 정확도, 차량검지 등의 결과를 보인다.

• 대한기계학회논문집
• /
• 제19권2호
• /
• pp.433-442
• /
• 1995

For the line search of a multi-variable optimization, an efficient algorithm is presented. The algorithm sequentially employs several polynomial approximations such as 2-point quadratic interpolation, 3-point cubic interpolation/extrapolation and 4-point cubic interpolation/extrapolation. The order of polynomial function is automatically increased for improving the accuracy of approximation. The method of approximation (interpolation or extrapolation) is automatically switched by checking the slope information of the sample points. Also, for selecting the initial step length along the descent vector, a new approach is presented. The performance of the proposed method is examined by solving typical test problems such as mathematical problems, mechanical design problems and dynamic response problems.

• 오토저널
• /
• 제11권2호
• /
• pp.24-33
• /
• 1989

본 고에서는 이러한 추세에 따라서, 보다 효율적인 optimization program에 대해서 소개하고자 한다. 사용한 최적화 알고리즘은 ALM(augmented lagrange multiplier) 방법을 적용해서 구속조건이 있는 문제를 구속조건이 없는 문제로 변환한 후, self-scaling BFGS(broydon-flecher-goldfarb-schanno)를 적용한다. BFGS의 각 descent 방향에서의 step 길이는, sequential search로 unimodal point를 구해서, golden section 방법으로 refine을 한후, cubic approximation을 적용해서 구한다.

• 정보처리학회논문지D
• /
• 제9D권5호
• /
• pp.779-788
• /
• 2002

이미지, 비디오, 오디오와 같은 멀티미디어 데이터들은 텍스트기반의 데이터에 비하여 대용량이고 비정형적인 특성때문에 검색이 어렵다. 또한 멀티미디어 데이터의 특징은 행렬이나 벡터의 형태로 표현되기 때문에 완전일치 검색이 아닌 유사 검색을 수행하여 원하는 이미지와 유사한 이미지를 검색해야 한다. 본 논문에서는 멀티미디어 데이터 검색에 클러스터링과 인덱싱 기법을 같이 적용하여 유사한 이미지는 인접 디스크에 클러스터하고 이 클러스터에 접근하는 인덱스를 구축함으로써 이미지 근처의 클러스터를 찾아 빠른 검색 결과를 제공하는 유사 검색방법을 제시한다. 본 논문에서는 트리 유사 구조의 인덱스 대신 해싱 방법을 이용하며 검색시 I/O 시간을 줄이기 위해 오브젝트를 가진 클러스터 위치를 찾는데 한번의 I/O를 사용하고 이 클러스터를 읽기 위해 연속적인 파일 I/O를 사용하여 클러스터를 찾는 비용을 최소화한다. 클러스터 인덱싱 접근은 클러스터링을 생성하는 알고리즘과 해싱 기법의 인덱싱을 이용함으로써 고차원 데이터가 갖는 차원의 문제를 해결하며 클러스터링 또는 인덱싱 만을 이용하는 내용기반의 이미지 검색보다 효율적인 검색 적합성을 보인다.

• 한국정보시스템학회지:정보시스템연구
• /
• 제14권3호
• /
• pp.17-22
• /
• 2005

Location management is very important in location-based services to provide services to the mobile users like banking, city guides and many more. Ubiquitous and mobile devices are the source of data in location management and its significant operations are update and search method. Some studies to improve these were presented by using optimal sequential paging, location area scheme and hierarchical database scheme. In addition, not all location services have the same access methods on data and it lead to difficulties of providing services. A proposed location management of multi-agent architecture is presented in this study. It shows the coordination of the agents on the distributed database of location-based services. The proposal focuses on the location management of the mobile object presented in a hierarchical search and update. Also, it uses a nearest neighbor technique for efficient search method of mobile objects.

• 한국해양공학회지
• /
• 제18권3호
• /
• pp.32-39
• /
• 2004

A design procedure for a ship with minimum total resistance has been developed using a numerical optimization method called SQP(sequential quadratic programming) to search for different optimal hull forms. The frictional resistance has been estimated using the ITTC 1957 model-ship correlation line formula, and the wave resistance has been evaluated using a potential-flow panel method that is based on Rankine sources with nonlinear free surface boundary conditions. The geometry of a hull surface has been modified using B-spline surface patches, during the whole optimization process. The numerical analyses have been carried out for the modified Wilgey hull at three different speeds (Fn=0.25, 0.316, 0.408), and the calculation results were compared.

• Asia pacific journal of information systems
• /
• 제15권3호
• /
• pp.223-241
• /
• 2005

In spite of the rapid growth of mobile multimedia contents market, most of the customers experience inconvenience, lengthy search processes and frustration in searching for the specific multimedia contents they want. These difficulties are attributable to the current mobile Internet service method based on inefficient sequential search. To overcome these difficulties, this paper proposes a MOBIIe COntents Recommender System for Movie(MOBICORS-Movie), which is designed to reduce customers' search efforts in finding desired movies on the mobile Internet. MOBICORS-Movie consists of three agents: CF(Collaborative Filtering), CBIR(Content-Based Information Retrieval) and RF(Relevance Feedback). These agents collaborate each other to support a customer in finding a desired movie by generating personalized recommendations of movies. To verify the performance of MOBICORS-Movie, the simulation-based experiments were conducted. The results from this experiments show that MOBICORS-Movie significantly reduces the customer's search effort and can be a realistic solution for movie recommendation in the mobile Internet environment.