• Proceedings of the Safety Management and Science Conference
• /
• 2003.05a
• /
• 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.

• Journal of Advanced Marine Engineering and Technology
• /
• v.32 no.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.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• 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.

• Journal of Korean Society on Water Environment
• /
• v.32 no.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.

• Korean Journal of Construction Engineering and Management
• /
• v.20 no.5
• /
• pp.12-20
• /
• 2019

This study analyzes and suggests improvement direction for the problems of housing related market laws and policies that cause sudden changes according to the application criteria. These laws and policies include income deduction from housing subscription, monthly rent loan for housing stability, high price house, penalty points from poor quality construction, and real estate brokerage commission. Each has one or more specific values that decide application criteria causing noticeable different results. Benefit or loss can be decided when an application range is changed by a small difference of the application value near to the boundary. This study suggest to use equations instead of a certain values to remove those sudden changes and to make them steadily increasing slopes which can be lines or curves. The concept can be applied to other laws and policies that have significantly different results between criteria.

• Communications for Statistical Applications and Methods
• /
• v.18 no.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.

• Communications for Statistical Applications and Methods
• /
• v.31 no.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 L₁-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 L₁-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.

• Journal of the Korea Safety Management & Science
• /
• v.5 no.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.

• Nuclear Engineering and Technology
• /
• v.52 no.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.

• Quantitative Bio-Science
• /
• v.37 no.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.