• 제목/요약/키워드: Penalty criteria

검색결과 27건 처리시간 0.031초

고객 생애 가치를 활용한 단일 창구 일정계획 수립에 관한 연구 (A Study on Determining Single-Center Scheduling using LTV(LifeTime Value))

  • 양광모;박재현;강경식
    • 대한안전경영과학회:학술대회논문집
    • /
    • 대한안전경영과학회 2003년도 춘계학술대회
    • /
    • pp.285-290
    • /
    • 2003
  • There is only one server available and arriving work require services from this server. Job are processed by the machine one at a time. The most common objective is to sequence jobs on the severs so as to minimize the penalty for being late, commonly called tardiness penalty Based on other objectives, many criteria may serve as s basis for developing job schedules. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem and reducing inventory, product development time, cycle time, and order lead time.

  • PDF

성능지수와 제약조건을 고려한 불안정 시스템의 제어 (Control of Unstable Systems Concerned with the Performance Indexes and Constraints)

  • 안종갑;이윤형;소명옥
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제32권5호
    • /
    • pp.785-790
    • /
    • 2008
  • A technique for determining the feedback gain of the states feedback controller using a real-coded genetic algorithm(RCGA) is presented. It is concerned with the states error to the performance index of a RCGA. As for assessing the performance of the controller three performance criteria (ISE. IAE and ITAE) are adopted. And designing the controller involves a constrained optimization problem. Therefore a real-coded genetic algorithm incorporating the penalty strategy is used. The performance of the proposed method is demonstrated through a set of simulation about an inverted pendulum system.

W-CDMA 터보디코딩을 위한 효율적인 Stopping Criteria (Simple and Efficient Stopping Criteria for W-CDMA Turbo Decoding)

  • 이동수;박인철
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 통신소사이어티 추계학술대회논문집
    • /
    • pp.265-268
    • /
    • 2003
  • In this paper, we propose new simple and efficient stopping criteria for W-CDMA turbo decoding. The new criteria are based on the sum of logarithm of absolute extrinsic information values and the count of one-estimations calculated after each component decoder. The calculation of the proposed criteria can be made simpler by summing one of ten values without any penalty. This Proposed method can be implemented with negligible overhead and no extra memory. Simulation results on W-CDMA standard shows that the number of iterations required is reduced compared to the existing stopping criteria without degrading the BER performance. Reduced iterations and simple operations make the proposed criteria desirable for low-power turbo decoder.

  • PDF

오염총량관리 할당부하량 초과지역의 최종 평가기준에 관한 연구 (A Study on the Final Evaluation Criteria of Allocation Exceedance Regional in Total Maximum Daily Load)

  • 오승영;한미덕;김석규;안기홍;김옥선;김용석;박지형
    • 한국물환경학회지
    • /
    • 제32권5호
    • /
    • pp.450-457
    • /
    • 2016
  • The Total Maximum Daily Load (TMDL) is a watershed management system that involves the establishment of the target water quality, the calculation of permission loading (allocation loading), and the control of total pollutants for each unit watershed. Allocation loading is assessed through the comprehensive implementation assessment of the previous year's plan. Assessment results are used for follow-up management measures such as the limit of development and updating of TMDL Management Implementation Plans for the next planning period. Although detailed assessment criteria are important, they are not currently available. Therefore, we suggested assessment criteria by comparing two methods('integration method' and 'separation method') using combination point and non-point discharge loading. We also examined the penalty criteria considering controllable load local government and updating methods of the TMDL Management Implementation Plan for the next planning period.

적용기준에 따라 큰 변화를 수반하는 주택시장관련 법률 및 정책의 개선방안 (Improvement of Housing Market Related Laws and Policies Causing Sudden Changes according to the Application Criteria)

  • 이용성;김경환
    • 한국건설관리학회논문집
    • /
    • 제20권5호
    • /
    • pp.12-20
    • /
    • 2019
  • 본 연구는 적용기준에 따라 큰 변화를 수반하는 주택시장관련 법률 및 정책의 문제점 분석과 개선 방안을 제시한다. 그 대상은 주택청약종합저축 소득공제, 주거안정월세대출, 고가주택기준, 부실공사벌점제, 부동산중개보수이다. 이들은 특정 값에 따라 적용기준이 달라진다. 경계부근에서 작은 값의 증감에 의하여 적용구간이 달라져 기존의 혜택, 제재 내용이 크게 달라질 수 있다. 본 연구에서는 개선방안으로 선형 혹은 곡선형태로 증가하는 경사로 형태를 제시한다. 이 개념은 적용구간에 따라 큰 변화가 있는 다른 법률 및 정책의 개선에도 적용 될 수 있을 것이다.

A Short Note on Empirical Penalty Term Study of BIC in K-means Clustering Inverse Regression

  • Ahn, Ji-Hyun;Yoo, Jae-Keun
    • Communications for Statistical Applications and Methods
    • /
    • 제18권3호
    • /
    • pp.267-275
    • /
    • 2011
  • According to recent studies, Bayesian information criteria(BIC) is proposed to determine the structural dimension of the central subspace through sliced inverse regression(SIR) with high-dimensional predictors. The BIC may be useful in K-means clustering inverse regression(KIR) with high-dimensional predictors. However, the direct application of the BIC to KIR may be problematic, because the slicing scheme in SIR is not the same as that of KIR. In this paper, we present empirical penalty term studies of BIC in KIR to identify the most appropriate one. Numerical studies and real data analysis are presented.

L1-penalized AUC-optimization with a surrogate loss

  • Hyungwoo Kim;Seung Jun Shin
    • Communications for Statistical Applications and Methods
    • /
    • 제31권2호
    • /
    • pp.203-212
    • /
    • 2024
  • The area under the ROC curve (AUC) is one of the most common criteria used to measure the overall performance of binary classifiers for a wide range of machine learning problems. In this article, we propose a L1-penalized AUC-optimization classifier that directly maximizes the AUC for high-dimensional data. Toward this, we employ the AUC-consistent surrogate loss function and combine the L1-norm penalty which enables us to estimate coefficients and select informative variables simultaneously. In addition, we develop an efficient optimization algorithm by adopting k-means clustering and proximal gradient descent which enjoys computational advantages to obtain solutions for the proposed method. Numerical simulation studies demonstrate that the proposed method shows promising performance in terms of prediction accuracy, variable selectivity, and computational costs.

휴리스틱 방법을 활용한 고객 생애 가치에 대한 단일 업체 일정계획 수립에 관한 연구 (A Study on Determining Single-Center Scheduling for LTV(LifeTime Value) Using Heuristic Method)

  • 양광모;강경식
    • 대한안전경영과학회지
    • /
    • 제5권1호
    • /
    • pp.83-92
    • /
    • 2003
  • Scheduling plays an important role in shop floor planning. A scheduling shows the planned time when processing of a specific job will start on each machine that the job requires. It also indicates when the job will be completed on every process. Thus, it is a timetable for both jobs and machines. There is only one server available and arriving work require services from this server. Job are processed by the machine one at a time. The most common objective is to sequence jobs on the severs so as to minimize the penalty for being late, commonly called tardiness penalty. Based on other objectives, many criteria may serve as s basis for developing job schedules. The process also comprises all strategic planning, capital investments, management decisions, and tasks necessary to create a new product. manufacturing processes must be created so that the product can be produced in the product facility. Purchasing new equipment and training workers may be required if new technology is to be used. Tools, fixtures, and the sequence of steps in the manufacturing processes must all be developed to allow rapid, high-quality, cost effective production. Also, it may be needed to be rearrange the production facility to adapt to the new manufacturing processes. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem and reducing inventory, product development time, cycle time, and order lead time.

Simplified elastic-plastic analysis procedure for strain-based fatigue assessment of nuclear safety class 1 components under severe seismic loads

  • Kim, Jong-Sung;Kim, Jun-Young
    • Nuclear Engineering and Technology
    • /
    • 제52권12호
    • /
    • pp.2918-2927
    • /
    • 2020
  • This paper proposes a simplified elastic-plastic analysis procedure using the penalty factors presented in the Code Case N-779 for strain-based fatigue assessment of nuclear safety class 1 components under severe seismic loads such as safety shutdown earthquake and beyond design-basis earthquake. First, a simplified elastic-plastic analysis procedure for strain-based fatigue assessment of nuclear safety class 1 components under the severe seismic loads was proposed based on the analysis result for the simplified elastic-plastic analysis procedure in the Code Case N-779 and the stress categories corresponding to normal operation and seismic loads. Second, total strain amplitude was calculated directly by performing finite element cyclic elastic-plastic seismic analysis for a hot leg nozzle in pressurizer surge line subject to combined loading including deadweight, pressure, seismic inertia load, and seismic anchor motion, as well as was derived indirectly by applying the proposed analysis procedure to the finite element elastic stress analysis result for each load. Third, strain-based fatigue assessment was implemented by applying the strain-based fatigue acceptance criteria in the ASME B&PV Code, Sec. III, Subsec. NB, Article NB-3200 and by using the total strain amplitude values calculated. Last, the total strain amplitude and the fatigue assessment result corresponding to the simplified elastic-plastic analysis were compared with those using the finite element elastic-plastic seismic analysis results. As a result of the comparison, it was identified that the proposed analysis procedure can derive reasonable and conservative results.

A Study on Bias Effect on Model Selection Criteria in Graphical Lasso

  • Choi, Young-Geun;Jeong, Seyoung;Yu, Donghyeon
    • Quantitative Bio-Science
    • /
    • 제37권2호
    • /
    • pp.133-141
    • /
    • 2018
  • Graphical lasso is one of the most popular methods to estimate a sparse precision matrix, which is an inverse of a covariance matrix. The objective function of graphical lasso imposes an ${\ell}_1$-penalty on the (vectorized) precision matrix, where a tuning parameter controls the strength of the penalization. The selection of the tuning parameter is practically and theoretically important since the performance of the estimation depends on an appropriate choice of tuning parameter. While information criteria (e.g. AIC, BIC, or extended BIC) have been widely used, they require an asymptotically unbiased estimator to select optimal tuning parameter. Thus, the biasedness of the ${\ell}_1$-regularized estimate in the graphical lasso may lead to a suboptimal tuning. In this paper, we propose a two-staged bias-correction procedure for the graphical lasso, where the first stage runs the usual graphical lasso and the second stage reruns the procedure with an additional constraint that zero estimates at the first stage remain zero. Our simulation and real data example show that the proposed bias correction improved on both edge recovery and estimation error compared to the single-staged graphical lasso.