• Title/Summary/Keyword: Database Optimization

Search Result 291, Processing Time 0.024 seconds

A STUDY ON THE DEVELOPMENT OF A COST MODEL BASED ON THE OWNER'S DECISION MAKING AT THE EARLY STAGES OF A CONSTRUCTION PROJECT

  • Choong-Wan Koo;Sang H. Park;Joon-oh Seo;TaeHoon Hong;ChangTaek Hyun
    • International conference on construction engineering and project management
    • /
    • 2009.05a
    • /
    • pp.676-684
    • /
    • 2009
  • Decision making at the early stages of a construction project has a significant impact on the project, and various scenarios created based on the owner's requirements should be considered for the decision making. At the early stages of a construction project, the information regarding the project is usually limited and uncertain. As such, it is difficult to plan and manage the project (especially cost planning). Thus, in this study, a cost model that could be varied according to the owner's requirements was developed. The cost model that was developed in this study is based on the case-based reasoning (CBR) methodology. The model suggests cost estimation with the most similar historical case as a basis for the estimation. In this study, the optimization process was also conducted, using genetic algorithms that reflect the changes in the number of project characteristics and in the database in the model according to the owner's decision making. Two optimization parameters were established: (1) the minimum criteria for scoring attribute similarity (MCAS); and (2) the range of attribute weights (RAW). The cost model proposed in this study can help building owners and managers estimate the project budget at the business planning stage.

  • PDF

Three-dimensional geostatistical modeling of subsurface stratification and SPT-N Value at dam site in South Korea

  • Mingi Kim;Choong-Ki Chung;Joung-Woo Han;Han-Saem Kim
    • Geomechanics and Engineering
    • /
    • v.34 no.1
    • /
    • pp.29-41
    • /
    • 2023
  • The 3D geospatial modeling of geotechnical information can aid in understanding the geotechnical characteristic values of the continuous subsurface at construction sites. In this study, a geostatistical optimization model for the three-dimensional (3D) mapping of subsurface stratification and the SPT-N value based on a trial-and-error rule was developed and applied to a dam emergency spillway site in South Korea. Geospatial database development for a geotechnical investigation, reconstitution of the target grid volume, and detection of outliers in the borehole dataset were implemented prior to the 3D modeling. For the site-specific subsurface stratification of the engineering geo-layer, we developed an integration method for the borehole and geophysical survey datasets based on the geostatistical optimization procedure of ordinary kriging and sequential Gaussian simulation (SGS) by comparing their cross-validation-based prediction residuals. We also developed an optimization technique based on SGS for estimating the 3D geometry of the SPT-N value. This method involves quantitatively testing the reliability of SGS and selecting the realizations with a high estimation accuracy. Boring tests were performed for validation, and the proposed method yielded more accurate prediction results and reproduced the spatial distribution of geotechnical information more effectively than the conventional geostatistical approach.

Optimization Technique using Ideal Target Model and Database in SRS

  • Oh, Seung-Jong;Suh, Tae-Suk;Song, Ju-Young;Choe, Bo-Young;Lee, Hyoung-Koo
    • Proceedings of the Korean Society of Medical Physics Conference
    • /
    • 2002.09a
    • /
    • pp.146-149
    • /
    • 2002
  • The aim of stereotactic radiosurgery(SRS) is to deliver a high dose to a target region and a low dose to critical organ through only one or a few irradiation. To satisfy this aim, optimized irradiating conditions must be searched in the planning. Thus, many mathematical methods such as gradient method, simulated annealing and genetic algorithm had been proposed to find out the conditions automatically. There were some limitations using these methods: the long calculation time, and the difficulty of unique solution due to the different shape of tumor. In this study, optimization protocol using ideal models and data base was proposed. Proposed optimization protocol constitutes two steps. First step was a preliminary work. Some possible ideal geometry shapes, such as sphere, cylinder, cone shape or the combination, were assumed to approximate the real tumor shapes. Optimum variables such as isocenter position or collimator size, were determined so that the high dose region could be shaped to fit ideal models with the arrangement of multiple isocenter. Data base were formed with those results. Second, any shaped real targets were approximated to these models using geometry comparison. Then, optimum variables for ideal geometry were chosen from the data base predetermined, and final parameters were obtained by adjusting these data. Although the results of applying the data base to patients were not superior to the result of optimization in each case, it can be acceptable as a starting point of plan.

  • PDF

The development of four efficient optimal neural network methods in forecasting shallow foundation's bearing capacity

  • Hossein Moayedi;Binh Nguyen Le
    • Computers and Concrete
    • /
    • v.34 no.2
    • /
    • pp.151-168
    • /
    • 2024
  • This research aimed to appraise the effectiveness of four optimization approaches - cuckoo optimization algorithm (COA), multi-verse optimization (MVO), particle swarm optimization (PSO), and teaching-learning-based optimization (TLBO) - that were enhanced with an artificial neural network (ANN) in predicting the bearing capacity of shallow foundations located on cohesionless soils. The study utilized a database of 97 laboratory experiments, with 68 experiments for training data sets and 29 for testing data sets. The ANN algorithms were optimized by adjusting various variables, such as population size and number of neurons in each hidden layer, through trial-and-error techniques. Input parameters used for analysis included width, depth, geometry, unit weight, and angle of shearing resistance. After performing sensitivity analysis, it was determined that the optimized architecture for the ANN structure was 5×5×1. The study found that all four models demonstrated exceptional prediction performance: COA-MLP, MVO-MLP, PSO-MLP, and TLBO-MLP. It is worth noting that the MVO-MLP model exhibited superior accuracy in generating network outputs for predicting measured values compared to the other models. The training data sets showed R2 and RMSE values of (0.07184 and 0.9819), (0.04536 and 0.9928), (0.09194 and 0.9702), and (0.04714 and 0.9923) for COA-MLP, MVO-MLP, PSO-MLP, and TLBO-MLP methods respectively. Similarly, the testing data sets produced R2 and RMSE values of (0.08126 and 0.07218), (0.07218 and 0.9814), (0.10827 and 0.95764), and (0.09886 and 0.96481) for COA-MLP, MVO-MLP, PSO-MLP, and TLBO-MLP methods respectively.

Improvement of Reliability based Information Integration in Audio-visual Person Identification (시청각 화자식별에서 신뢰성 기반 정보 통합 방법의 성능 향상)

  • Tariquzzaman, Md.;Kim, Jin-Young;Hong, Joon-Hee
    • MALSORI
    • /
    • no.62
    • /
    • pp.149-161
    • /
    • 2007
  • In this paper we proposed a modified reliability function for improving bimodal speaker identification(BSI) performance. The convectional reliability function, used by N. Fox[1], is extended by introducing an optimization factor. We evaluated the proposed method in BSI domain. A BSI system was implemented based on GMM and it was tested using VidTIMIT database. Through speaker identification experiments we verified the usefulness of our proposed method. The experiments showed the improved performance, i.e., the reduction of error rate by 39%.

  • PDF

Promoter Prediction using Genetic Algorithm (유전자 알고리즘을 이용한 Promoter 예측)

  • 오민경;김창훈;김기봉;공은배;김승목
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10b
    • /
    • pp.12-14
    • /
    • 1999
  • Promoter는 transcript start site 앞부분에 위치하여 RNA polymerase가 높은 친화성을 보이며 바인당하는 DNA상의 특별한 부위로서 여기서부터 DNA transcription이 시작된다. function이나 tissue-specific gene들의 그룹별로 그 promoter들의 특이한 패턴들의 조합을 발견함으로써 Specific한 transcription을 조절하는 것으로 알려져 있어 promoter로 인한 그 gene의 정보를 어느 정도 알 수가 있다. 사람의 housekeeping gene promoter들을 EPD(eukaryotic promoter database)와 EMBL nucleic acid sequence database로부터 수집하여 이것들 간에 의미 있게 나타나는 모든 패턴들을 optimization algorithm으로 알려진 genetic algorithm을 이용해서 찾아보았다.

  • PDF

Detailed numerical modeling of complex LCDs

  • Becker, Michael E.
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.365-368
    • /
    • 2004
  • We present a family of elaborate numerical models for simulation and systematic optimization of complex LCDs for demanding applications (e.g. LCD-TV). These numerical models comprise modules for solving LCD-related problems in one, two and three dimensions. The three modules feature an intuitive graphical user surface for a jump-start into modeling, a common database for a range of materials and components as well as sophisticated and proven algorithms with more than 15 years of reliable performance in the LCD-industry. Methods for obtaining data required for the modeling of key components are presented.

  • PDF

A Query Optimization Technique for Queries Including Attribute/Spatial Predicates in Spatial Database (공간 데이터베이스에서 속성/공간 조건이 혼합된 질의어의 최적화 기법)

  • 이정남;조완섭;이충세
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10b
    • /
    • pp.99-101
    • /
    • 1998
  • 대용량 공간 데이터를 포함하는 공간 데이터베이스에서 검색성능의 향상을 위해 공간 질의어가 최적화가 중요한 과제이다. 본 논문에서는 공간 데이터베이스에서 속성/공간 조건이 혼합된 질의에 적합한 질의 최적화 기법을 제시한다. 제안된 기법은 기존의 변환 규칙을 이용해서 대수 트리를 변환해 나가는 방법과는 달리 혼합된 질의어에 대한 질의 그래프로부터 동적 프로그래밍 기법으로 탐색 알고리즘을 실행함으로써 탐색 공간을 줄일 수 있고, 더욱 효율적으로 최소 비용의 실행 전략들 수립할 수 있다.

차세대 엔터프라이즈웨어 마이포스 소개

  • 정창현
    • Proceedings of the Korea Database Society Conference
    • /
    • 1995.12a
    • /
    • pp.3-19
    • /
    • 1995
  • 시스템 Technology ★ Server Technology - 운영환경구축 ★ Network 구성설계 - ATM, FDDI, NMS ★ Client/Server시스템 구성별 Bench Marking ★ Windows 메뉴 및 GUI 설계 ★다기능 PC 운영환경 설정 시스템 Technology ★ Data Base Technology - DB Administration - BB Performance Tuning ★ System Integration Technology - Application Integration - System Flow Control - Task Control - Applicational Interface - S/W Down Load 시스템 Technology ★ Memory Optimization ★ IBM/Facom Host API ★ 영상전화 Customizing - Intel Proshare ★ Auto Dialing - CTI Link ★ IC-Card Interface 시스템 Technology ★ Sound 처리 - Voice Mail - 음절 처리 ★ Image 처리 ★도움말 처리 - Hyper Text 시스템 Technology ★ Socket Programming - 긴급메일 - Peer to peer message switching ★ Set Up Programming -Install Shield ★ DB Access Programming - DB-Library ★ TCP/IP Programming(중략)

  • PDF

Object Classification Method Using Dynamic Random Forests and Genetic Optimization

  • Kim, Jae Hyup;Kim, Hun Ki;Jang, Kyung Hyun;Lee, Jong Min;Moon, Young Shik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.5
    • /
    • pp.79-89
    • /
    • 2016
  • In this paper, we proposed the object classification method using genetic and dynamic random forest consisting of optimal combination of unit tree. The random forest can ensure good generalization performance in combination of large amount of trees by assigning the randomization to the training samples and feature selection, etc. allocated to the decision tree as an ensemble classification model which combines with the unit decision tree based on the bagging. However, the random forest is composed of unit trees randomly, so it can show the excellent classification performance only when the sufficient amounts of trees are combined. There is no quantitative measurement method for the number of trees, and there is no choice but to repeat random tree structure continuously. The proposed algorithm is composed of random forest with a combination of optimal tree while maintaining the generalization performance of random forest. To achieve this, the problem of improving the classification performance was assigned to the optimization problem which found the optimal tree combination. For this end, the genetic algorithm methodology was applied. As a result of experiment, we had found out that the proposed algorithm could improve about 3~5% of classification performance in specific cases like common database and self infrared database compare with the existing random forest. In addition, we had shown that the optimal tree combination was decided at 55~60% level from the maximum trees.