• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2001.10a
• /
• pp.201-210
• /
• 2001

In this study, large-scale distributed design approach for a life cycle cost (LCC) optimization of steel box girder bridges was implemented. A collaborative optimization approach is one of the multidisciplinary design optimization approaches and it has been proven to be best suited for distributed design environment. The problem of optimum LCC design of steel box girder bridges is formulated as that of minimization of the expected total LCC that consists of initial cost maintenance cost expected retrofit costs for strength, deflection and crack. To discuss the possibility of the application for the collaborative optimization of steel box girder bridges, the results of this algorithm are compared with those of single level algorithm. From the numerical investigations, the collaborative optimization approach proposed in this study may be expected to be new concepts and design methodologies associated with the LCC approach.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.3
• /
• pp.263-275
• /
• 2000

Multidisciplinary design optimization(MDO) can yield optimal design considering all the disciplinary requirements concurrently. A method to implement the collaborative optimization(CO) approach, one of the MDO methodologies, is developed using a pre-compiler “EzpreCompiler”, a design optimization library “EzOptimizer”, and a common object request broker architecture(CORBA) in distributed computing environment. The CO approach is applied to a mathematical example to show its applicability and equivalence to standard optimization(SO) formulation. In a realistic engineering problem such as optimal design of a two-member hub frame, optimal design of a speed reducer and initial design of a bulk carrier, the CO yields better results than the SO. Furthermore, the CO allows the distributed processing using the CORBA, which leads to reduction of overall computation time.

• Journal of Mechanical Science and Technology
• /
• v.20 no.1
• /
• pp.133-146
• /
• 2006

Collaborative optimization (CO) is a multi-level decomposed methodology for a large-scale multidisciplinary design optimization (MDO). CO is known to have computational and organizational advantages. Its decomposed architecture removes a necessity of direct communication among disciplines, guaranteeing their autonomy. However, CO has several problems at convergence characteristics and computation time. In this study, such features are discussed and some suggestions are made to improve the performance of CO. Only for the system level optimization, genetic algorithm is used and gradient-based method is used for subspace optimizers. Moreover, response surface models are replaced as analyses in subspaces. In this manner, CO is applied to aero-structural design problems of the aircraft wing and its results are compared with the multidisciplinary feasible (MDF) method and the original CO. Through these results, it is verified that the suggested approach improves convergence characteristics and offers a proper solution.

• Journal of Information Technology Application
• /
• v.1
• /
• pp.173-211
• /
• 1999

The task of classification permeates all walks of life, from business and economics to science and public policy. In this context, nonlinear techniques from artificial intelligence have often proven to be more effective than the methods of classical statistics. The objective of knowledge discovery and data mining is to support decision making through the effective use of information. The automated approach to knowledge discovery is especially useful when dealing with large data sets or complex relationships. For many applications, automated software may find subtle patterns which escape the notice of manual analysis, or whose complexity exceeds the cognitive capabilities of humans. This paper explores the utility of a collaborative learning approach involving integrated models in the preprocessing and postprocessing stages. For instance, a genetic algorithm effects feature-weight optimization in a preprocessing module. Moreover, an inductive tree, artificial neural network (ANN), and k-nearest neighbor (kNN) techniques serve as postprocessing modules. More specifically, the postprocessors act as second0order classifiers which determine the best first-order classifier on a case-by-case basis. In addition to the second-order models, a voting scheme is investigated as a simple, but efficient, postprocessing model. The first-order models consist of statistical and machine learning models such as logistic regression (logit), multivariate discriminant analysis (MDA), ANN, and kNN. The genetic algorithm, inductive decision tree, and voting scheme act as kernel modules for collaborative learning. These ideas are explored against the background of a practical application relating to financial fraud management which exemplifies a binary classification problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4453-4468
• /
• 2015

This paper investigates optimization-based base station (BS) placement. An optimization model is defined and the BS placement problem is transformed to a lexicographical stratified programming (LSP) model for a given trajectory, according to different accuracy requirements. The feasible region for BS deployment is obtained from the positioning system requirement, which is also solved with signal coverage problem in BS placement. The LSP mathematical model is formulated with the average geometric dilution of precision (GDOP) as the criterion. To achieve an optimization solution, a tolerant factor based complete stratified series approach and grid searching method are utilized to obtain the possible optimal BS placement. Because of the LSP model utilization, the proposed algorithm has wider application scenarios with different accuracy requirements over different trajectory segments. Simulation results demonstrate that the proposed algorithm has better BS placement result than existing approaches for a given trajectory.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.9
• /
• pp.142-150
• /
• 2003

MDO is one of the efficient methods for huge and multi -functional system design. This paper describes a design collaboration framework with MDO in networked design environment. A prototype of web -based integrated design system was implemented to show sharing and exchange of models and analysis information between MDO modules and collaborative design stations. Server System consists of MDO modules for optimization and modeling module for 3D modeling operation. Client system provide user with graphic interface for shape modeling and system operation. We believe that the proposed approach can be extended to solve real complex multidisciplinary design problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2381-2399
• /
• 2019

Traditional recommendation algorithms on Collaborative Filtering (CF) mainly focus on the rating prediction with explicit ratings, and cannot be applied to the top-N recommendation with implicit feedbacks. To tackle this problem, we propose a new collaborative filtering approach namely Maximize MAP with Matrix Factorization (MFMAP). In addition, in order to solve the problem of non-smoothing loss function in learning to rank (LTR) algorithm based on pairwise, we also propose a smooth MAP measure which can be easily implemented by standard optimization approaches. We perform experiments on three different datasets, and the experimental results show that the performance of MFMAP is significantly better than other recommendation approaches.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.442-445
• /
• 2023

최근 딥러닝 및 로봇기술의 발전으로 인해 대량의 데이터를 빠르게 수집하고 처리하는 연구 분야들로 확대되었다. 이와 관련된 한 가지 분야로써 다중 로봇을 이용한 분산학습 연구가 있으며, 이는 단일 에이전트를 이용할 때보다 대량의 데이터를 빠르게 수집 및 처리하는데 용이하다. 본 연구에서는 기존 Distributed Neural Network Optimization (DiNNO) 알고리즘에서 제안한 정적 분산 학습방법과 달리 단계적 분산학습 방법을 새롭게 제안하였으며, 모델 성능을 향상시키기 위해 원시 변수를 근사하는 단계수를 상수로 고정하는 기존의 방식에서 통신회차가 늘어남에 따라 점진적으로 근사 횟수를 높이는 방법을 고안하여 새로운 알고리즘을 제안하였다. 기존 알고리즘과 제안된 알고리즘의 정성 및 정량적 성능 평가를 수행하기 MNIST 분류와 2 차원 평면도 지도화 실험을 수행하였으며, 그 결과 제안된 알고리즘이 기존 DiNNO 알고리즘보다 동일한 통신회차에서 높은 정확도를 보임과 함께 전역 최적점으로 빠르게 수렴하는 것을 입증하였다.

• Nuclear Engineering and Technology
• /
• v.55 no.1
• /
• pp.339-352
• /
• 2023

Prediction of the time-related traits of pebble flow inside pebble-bed HTGRs is of great significance for reactor operation and design. In this work, an image-driven approach with the aid of a convolutional neural network (CNN) is proposed to predict the remaining time of initially loaded pebbles and the time interval of paired flow images of the pebble bed. Two types of strategies are put forward: one is adding FC layers to the classic classification CNN models and using regression training, and the other is CNN-based deep expectation (DEX) by regarding the time prediction as a deep classification task followed by softmax expected value refinements. The current dataset is obtained from the discrete element method (DEM) simulations. Results show that the CNN-aided models generally make satisfactory predictions on the remaining time with the determination coefficient larger than 0.99. Among these models, the VGG19+DEX performs the best and its CumScore (proportion of test set with prediction error within 0.5s) can reach 0.939. Besides, the remaining time of additional test sets and new cases can also be well predicted, indicating good generalization ability of the model. In the task of predicting the time interval of image pairs, the VGG19+DEX model has also generated satisfactory results. Particularly, the trained model, with promising generalization ability, has demonstrated great potential in accurately and instantaneously predicting the traits of interest, without the need for additional computational intensive DEM simulations. Nevertheless, the issues of data diversity and model optimization need to be improved to achieve the full potential of the CNN-aided prediction tool.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.51-69
• /
• 2002

In the supply chain environment on the web, collaborative problem solving and case-based modeling has been getting more important, because it is difficult to cope with diverse problem requirements and inefficient to manage many models as well. Hence, the approach on case-based modeling is required. This paper provides a framework that generates a goal model based on multiple cases, modeling knowledge, and forward chaining and it also develops a search algorithm through sensitivity analysis to reduce the modeling effort.