• Title/Summary/Keyword: 오차 비용함수

Search Result 88, Processing Time 0.024 seconds

OD matrix estimation using link use proportion sample data as additional information (표본링크이용비를 추가정보로 이용한 OD 행렬 추정)

  • 백승걸;김현명;신동호
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.4
    • /
    • pp.83-93
    • /
    • 2002
  • To improve the performance of estimation, the research that uses additional information addition to traffic count and target OD with additional survey cost have been studied. The purpose of this paper is to improve the performance of OD estimation by reducing the feasible solutions with cost-efficiently additional information addition to traffic counts and target OD. For this purpose, we Propose the OD estimation method with sample link use proportion as additional information. That is, we obtain the relationship between OD trip and link flow from sample link use proportion that is high reliable information with roadside survey, not from the traffic assignment of target OD. Therefore, this paper proposes OD estimation algorithm in which the conservation of link flow rule under the path-based non-equilibrium traffic assignment concept. Numerical result with test network shows that it is possible to improve the performance of OD estimation where the precision of additional data is low, since sample link use Proportion represented the information showing the relationship between OD trip and link flow. And this method shows the robust performance of estimation where traffic count or OD trip be changed, since this method did not largely affected by the error of target OD and the one of traffic count. In addition to, we also propose that we must set the level of data precision by considering the level of other information precision, because "precision problem between information" is generated when we use additional information like sample link use proportion etc. And we Propose that the method using traffic count as basic information must obtain the link flow to certain level in order to high the applicability of additional information. Finally, we propose that additional information on link have a optimal counting location problem. Expecially by Precision of information side it is possible that optimal survey location problem of sample link use proportion have a much impact on the performance of OD estimation rather than optimal counting location problem of link flow.

Evaluation of Applicability of Apparent Track Stiffness Measured by Light-Weight Deflectometer as a Ballasted Track Condition Index (소형동평판재하시험기로 측정한 궤도 겉보기 강성의 자갈궤도 상태평가 지표로서의 적용성 고찰)

  • Choi, Yeong-Tae;Hwang, Sung Ho;Jang, Seung Yup;Park, Bongsik;Shim, Gwang Seop
    • Journal of the Korean GEO-environmental Society
    • /
    • v.19 no.2
    • /
    • pp.37-44
    • /
    • 2018
  • Ballasted track has been widely used due to its flexibility. However, the plastic deformation of ballasted track causes the evolution of track geometrical errors, and hence it requires continuous maintenance; increase in number of trains, weight, and speed expedites maintenance frequency and cost as well. Ballast stiffness is well-known as an indicator of design and maintenance. In this regard, this paper aims to suggest the method to measure ballast track stiffness using light-weight deflectometer (LWD) and thus verify its applicability as a maintenance measure. Preliminary field tests determined simple field testing protocol to measure track stiffness. The apparent ballast stiffness by LWD shows good corelation with TQI (Track Quality Index) and maintenance length. That is, as average of apparent stiffness increase, TQI and tamping length decrease exponentially. Therefore, apparent stiffness can be used as an index for ballast condition assessment.

Development of a Spectrum Analysis Software for Multipurpose Gamma-ray Detectors (감마선 검출기를 위한 스펙트럼 분석 소프트웨어 개발)

  • Lee, Jong-Myung;Kim, Young-Kwon;Park, Kil-Soon;Kim, Jung-Min;Lee, Ki-Sung;Joung, Jin-Hun
    • Journal of radiological science and technology
    • /
    • v.33 no.1
    • /
    • pp.51-59
    • /
    • 2010
  • We developed an analysis software that automatically detects incoming isotopes for multi-purpose gamma-ray detectors. The software is divided into three major parts; Network Interface Module (NIM), Spectrum Analysis Module (SAM), and Graphic User Interface Module (GUIM). The main part is SAM that extracts peak information of energy spectrum from the collected data through network and identifies the isotopes by comparing the peaks with pre-calibrated libraries. The proposed peak detection algorithm was utilized to construct libraries of standard isotopes with two peaks and to identify the unknown isotope with the constructed libraries. We tested the software by using GammaPro1410 detector developed by NuCare Medical Systems. The results showed that NIM performed 200K counts per seconds and the most isotopes tested were correctly recognized within 1% error range when only a single unknown isotope was used for detection test. The software is expected to be used for radiation monitoring in various applications such as hospitals, power plants, and research facilities etc.

Parallel Computation For The Edit Distance Based On The Four-Russians' Algorithm (4-러시안 알고리즘 기반의 편집거리 병렬계산)

  • Kim, Young Ho;Jeong, Ju-Hui;Kang, Dae Woong;Sim, Jeong Seop
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.2
    • /
    • pp.67-74
    • /
    • 2013
  • Approximate string matching problems have been studied in diverse fields. Recently, fast approximate string matching algorithms are being used to reduce the time and costs for the next generation sequencing. To measure the amounts of errors between two strings, we use a distance function such as the edit distance. Given two strings X(|X| = m) and Y(|Y| = n) over an alphabet ${\Sigma}$, the edit distance between X and Y is the minimum number of edit operations to convert X into Y. The edit distance between X and Y can be computed using the well-known dynamic programming technique in O(mn) time and space. The edit distance also can be computed using the Four-Russians' algorithm whose preprocessing step runs in $O((3{\mid}{\Sigma}{\mid})^{2t}t^2)$ time and $O((3{\mid}{\Sigma}{\mid})^{2t}t)$ space and the computation step runs in O(mn/t) time and O(mn) space where t represents the size of the block. In this paper, we present a parallelized version of the computation step of the Four-Russians' algorithm. Our algorithm computes the edit distance between X and Y in O(m+n) time using m/t threads. Then we implemented both the sequential version and our parallelized version of the Four-Russians' algorithm using CUDA to compare the execution times. When t = 1 and t = 2, our algorithm runs about 10 times and 3 times faster than the sequential algorithm, respectively.

A Study on Development of Portable Concrete Crack Measurement Device Using Image Processing Technique and Laser Sensors (이미지 처리기법 및 레이저 센서를 이용한 휴대용 콘크리트 균열 측정 장치 개발에 관한 연구)

  • Seo, Seunghwan;Ohn, Syng-Yup;Kim, Dong-Hyun;Kwak, Kiseok;Chung, Moonkyung
    • Journal of the Korean Geosynthetics Society
    • /
    • v.19 no.4
    • /
    • pp.41-50
    • /
    • 2020
  • Since cracks in concrete structures expedite corrosion of reinforced concrete over a long period of time, regular on-site inspections are essential to ensure structural usability and prevent degradation. Most of the safety inspections of facilities rely on visual inspection with naked eye, so cost and time consuming are severe, and the reliability of results differs depending on the inspector. In this study, a portable measuring device that can be used for safety diagnosis and maintenance was developed as a device that measures the width and length of concrete cracks through image analysis of cracks photographed with a camera. This device captures the cracks found within a close distance (3 m), and accurately calculates the unit pixel size by laser distance measurement, and automatically calculates the crack length and width with the image processing algorithm developed in this study. In measurement results using the crack image applied to the experiment, the measurement of the length of a 0.3 mm crack within a distance of 3 m was possible with a range of about 10% error. The crack width showed a tendency to be overestimated by detecting surrounding pixels due to vibration and blurring effect during the binarization process, but it could be effectively corrected by applying the crack width reduction function.

Comparison between Uncertainties of Cultivar Parameter Estimates Obtained Using Error Calculation Methods for Forage Rice Cultivars (오차 계산 방식에 따른 사료용 벼 품종의 품종모수 추정치 불확도 비교)

  • Young Sang Joh;Shinwoo Hyun;Kwang Soo Kim
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.25 no.3
    • /
    • pp.129-141
    • /
    • 2023
  • Crop models have been used to predict yield under diverse environmental and cultivation conditions, which can be used to support decisions on the management of forage crop. Cultivar parameters are one of required inputs to crop models in order to represent genetic properties for a given forage cultivar. The objectives of this study were to compare calibration and ensemble approaches in order to minimize the uncertainty of crop yield estimates using the SIMPLE crop model. Cultivar parameters were calibrated using Log-likelihood (LL) and Generic Composite Similarity Measure (GCSM) as an objective function for Metropolis-Hastings (MH) algorithm. In total, 20 sets of cultivar parameters were generated for each method. Two types of ensemble approach. First type of ensemble approach was the average of model outputs (Eem), using individual parameters. The second ensemble approach was model output (Epm) of cultivar parameter obtained by averaging given 20 sets of parameters. Comparison was done for each cultivar and for each error calculation methods. 'Jowoo' and 'Yeongwoo', which are forage rice cultivars used in Korea, were subject to the parameter calibration. Yield data were obtained from experiment fields at Suwon, Jeonju, Naju and I ksan. Data for 2013, 2014 and 2016 were used for parameter calibration. For validation, yield data reported from 2016 to 2018 at Suwon was used. Initial calibration indicated that genetic coefficients obtained by LL were distributed in a narrower range than coefficients obtained by GCSM. A two-sample t-test was performed to compare between different methods of ensemble approaches and no significant difference was found between them. Uncertainty of GCSM can be neutralized by adjusting the acceptance probability. The other ensemble method (Epm) indicates that the uncertainty can be reduced with less computation using ensemble approach.

Software Reliability Growth Modeling in the Testing Phase with an Outlier Stage (하나의 이상구간을 가지는 테스팅 단계에서의 소프트웨어 신뢰도 성장 모형화)

  • Park, Man-Gon;Jung, Eun-Yi
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.10
    • /
    • pp.2575-2583
    • /
    • 1998
  • The productionof the highly relible softwae systems and theirs performance evaluation hae become important interests in the software industry. The software evaluation has been mainly carried out in ternns of both reliability and performance of software system. Software reliability is the probability that no software error occurs for a fixed time interval during software testing phase. These theoretical software reliability models are sometimes unsuitable for the practical testing phase in which a software error at a certain testing stage occurs by causes of the imperfect debugging, abnornal software correction, and so on. Such a certatin software testing stage needs to be considered as an outlying stage. And we can assume that the software reliability does not improve by means of muisance factor in this outlying testing stage. In this paper, we discuss Bavesian software reliability growth modeling and estimation procedure in the presence of an imidentitied outlying software testing stage by the modification of Jehnski Moranda. Also we derive the Bayes estimaters of the software reliability panmeters by the assumption of prior information under the squared error los function. In addition, we evaluate the proposed software reliability growth model with an unidentified outlying stage in an exchangeable model according to the values of nuisance paramether using the accuracy, bias, trend, noise metries as the quantilative evaluation criteria through the compater simulation.

  • PDF

Dynamic Traffic Assignment Using Genetic Algorithm (유전자 알고리즘을 이용한 동적통행배정에 관한 연구)

  • Park, Kyung-Chul;Park, Chang-Ho;Chon, Kyung-Soo;Rhee, Sung-Mo
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.8 no.1 s.15
    • /
    • pp.51-63
    • /
    • 2000
  • Dynamic traffic assignment(DTA) has been a topic of substantial research during the past decade. While DTA is gradually maturing, many aspects of DTA still need improvement, especially regarding its formulation and solution algerian Recently, with its promise for In(Intelligent Transportation System) and GIS(Geographic Information System) applications, DTA have received increasing attention. This potential also implies higher requirement for DTA modeling, especially regarding its solution efficiency for real-time implementation. But DTA have many mathematical difficulties in searching process due to the complexity of spatial and temporal variables. Although many solution algorithms have been studied, conventional methods cannot iud the solution in case that objective function or constraints is not convex. In this paper, the genetic algorithm to find the solution of DTA is applied and the Merchant-Nemhauser model is used as DTA model because it has a nonconvex constraint set. To handle the nonconvex constraint set the GENOCOP III system which is a kind of the genetic algorithm is used in this study. Results for the sample network have been compared with the results of conventional method.

  • PDF