• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.11
• /
• pp.5366-5370
• /
• 2013

For a easier bolt molding, an extrusion process, the 2nd step of the molding process, was moved to step 4, and the bolt head section was exclusively molded in steps 2 and 3. As a result, the molding process was made easier thanks to the minor modification, and the contact pressure decreased in step 1 and increased in step 2 over its earlier intensity. Also, the maximum effective stress, effective strain, and molding force were all increased in both steps 1 and 2.

• Smart Media Journal
• /
• v.13 no.2
• /
• pp.9-15
• /
• 2024

In this paper, a Diffusion Multi-step Classifier (DMC) is proposed to address the imbalance issue in credit prediction. DMC utilizes a Diffusion Model to generate continuous numerical data from credit prediction data and creates categorical data through a Multi-step Classifier. Compared to other algorithms generating synthetic data, DMC produces data with a distribution more similar to real data. Using DMC, data that closely resemble actual data can be generated, outperforming other algorithms for data generation. When experiments were conducted using the generated data, the probability of predicting delinquencies increased by over 20%, and overall predictive accuracy improved by approximately 4%. These research findings are anticipated to significantly contribute to reducing delinquency rates and increasing profits when applied in actual financial institutions.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.47 no.2
• /
• pp.48-56
• /
• 2024

We examine a single machine scheduling problem with step-improving jobs in which job processing times decrease step-wisely over time according to their starting times. The objective is to minimize total completion time which is defined as the sum of completion times of jobs. The total completion time is frequently considered as an objective because it is highly related to the total time spent by jobs in the system as well as work-in-progress. Many applications of this problem can be observed in the real world such as data gathering networks, system upgrades or technological shock, and production lines operated with part-time workers in each shift. Our goal is to develop a scheduling algorithm that can provide an optimal solution. For this, we present an efficient branch and bound algorithm with an assignment-based node design and tight lower bounds that can prune branch and bound nodes at early stages and accordingly reduce the computation time. In numerical experiments well designed to consider various scenarios, it is shown that the proposed algorithm outperforms the existing method and can solve practical problems within reasonable computation time.

• Applied Chemistry for Engineering
• /
• v.7 no.5
• /
• pp.861-868
• /
• 1996

Skeletal isomerization reaction known as exothermic reaction shows possible maximum yield of i-butene from n-butene at $110^{\circ}C$ over $Pt/MoO_3/SiO_2$. Compared with conventional catalyst such as silica, zeolite, alumina etc., $Pt/MoO_3/SiO_2$ demonstrates higher yield while by-products except 2-butene do not form. Faster H spillover rate over $Pt/MoO_3/SiO_2$ is demonstrated via isothermal reduction experiment at $110^{\circ}C$ compared to the rate over $Pt/MoO_3/Al_2O_3$. Overall isomerization rates are proportional to higher spillover rates from Pt onto $MoO_3$ surface. The skeletal isomerization reaction is composed of two elementary steps. First, carbonium ion formation over Pt crystallites by H spillover. Second, carbenium ion formation over $MoO_3$ followed by formation of i-butene. Moreover, it is suggested that H spillover step from Pt surface onto $MoO_3$ is assumed to be the rate determining step and control the overall isomerization rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.3
• /
• pp.687-696
• /
• 2014

This paper presents a semantic object extraction method using user's stroke input, color, and depth information. It is supposed that a semantically meaningful object is surrounded with a few strokes from a user, and has similar depths all over the object. In the proposed method, deciding the region of interest (ROI) is based on the stroke input, and the semantically meaningful object is extracted by using color and depth information. Specifically, the proposed method consists of two steps. The first step is over-segmentation inside the ROI using color and depth information. The second step is semantically meaningful object extraction where over-segmented regions are classified into the object region and the background region according to the depth of each region. In the over-segmentation step, we propose a new marker extraction method where there are two propositions, i.e. an adaptive thresholding scheme to maximize the number of the segmented regions and an adaptive weighting scheme for color and depth components in computation of the morphological gradients that is required in the marker extraction. In the semantically meaningful object extraction, we classify over-segmented regions into the object region and the background region in order of the boundary regions to the inner regions, the average depth of each region being compared to the average depth of all regions classified into the object region. In experimental results, we demonstrate that the proposed method yields reasonable object extraction results.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.187-187
• /
• 2004

In this paper, we present an efficient architecture of a versatile Reed-Solomon (RS) decoder which can be programmed to decode RS codes continuously with my message length k as well as any block length n. This unique feature eliminates the need of inserting zeros for decoding shortened RS codes. Also, the values of the parameters n and k, hence the error-correcting capability t can be altered at every codeword block. The decoder permits 3-step pipelined processing based on the modified Euclid's algorithm (MEA). Since each step can be driven by a separate clock, the decoder can operate just as 2-step pipeline processing by employing the faster clock in step 2 and/or step 3. Also, the decoder can be used even in the case that the input clock is different from the output clock. Each step is designed to have a structure suitable for decoding RS codes with varying block length. A new architecture for the MEA is designed for variable values of the t. The operating length of the shift registers in the MEA block is shortened by one, and it can be varied according to the different values of the t. To maintain the throughput rate with less circuitry, the MEA block uses both the recursive technique and the over-clocking technique. The decoder can decodes codeword received not only in a burst mode, but also in a continuous mode. It can be used in a wide range of applications because of its versatility. The adaptive RS decoder over GF($2^8$) having the error-correcting capability of upto 10 has been designed in VHDL, and successfully synthesized in an FPGA chip.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.29-38
• /
• 2004

In this paper, we present an efficient architecture of a versatile Reed-Solomon (RS) decoder which can be programmed to decode RS codes continuously with my message length k as well as any block length n. This unique feature eliminates the need of inserting zeros for decoding shortened RS codes. Also, the values of the parameters n and k, hence the error-correcting capability t can be altered at every codeword block. The decoder permits 3-step pipelined processing based on the modified Euclid's algorithm (MEA). Since each step can be driven by a separate clock, the decoder can operate just as 2-step pipeline processing by employing the faster clock in step 2 and/or step 3. Also, the decoder can be used even in the case that the input clock is different from the output clock. Each step is designed to have a structure suitable for decoding RS codes with varying block length. A new architecture for the MEA is designed for variable values of the t. The operating length of the shift registers in the MEA block is shortened by one, and it can be varied according to the different values of the t. To maintain the throughput rate with less circuitry, the MEA block uses both the recursive technique and the over-clocking technique. The decoder can decodes codeword received not only in a burst mode, but also in a continuous mode. It can be used in a wide range of applications because of its versatility. The adaptive RS decoder over GF(2$^{8}$ ) having the error-correcting capability of upto 10 has been designed in VHDL, and successfully synthesized in an FPGA chip.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.738-739
• /
• 2015

The main objective of this study, "Spatial Downscaling of Precipitation from GCMs for Assessing Climate Change over Han River and Imjin River Watersheds", is to carry out over Han River and Imjin River watersheds. To this end, a statistical regression method with MOS (Model Output Statistics) corrections at every downscaling step was developed and applied for downscaling the spatially-coarse Global Climate Model Projections (GCMPs) from CCSM3 and CSIRO with respect to precipitation into 0.1 degree (about 11 km) spatial grid over study regions. The spatially archived hydro-climate data sets such as Willmott, GsMap and APHRODITE datasets were used for MOS corrections by means of monthly climatology between observations and downscaled values. Precipitation values downscaled in this study were validated against ground observations and then future climate simulation results on precipitation were evaluated for the projections.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.137-144
• /
• 2007

Advances in networking technology digital media, and codecs have made it possible for the Internet evolves into a Broadband convergence Network (BcN) and provides various services including Voice over Internet Protocol (VoIP) and IPTV over their high-speed IP networks. In order for the Internet to make a profit as traditional Public Switched Telephone Network (PSTN), it must provide high qualify VoIP services. Therefore, real time qualify measurement framework is the most important requisite to provide VoIP service. For this, IETF (Internet Engineering Task Force) defined RTCP-Extended Reports (RTCP-XR) that extend RTCP (Real-Time Transport Protocol Control Protocol). However, procedure and method tot actually VoIP qualify measurement did not recommended nothing but defined item to measure voice quality. Our objective in this paper is to describes a practical measuring framework for end-to-end QoS of switched voice packet in an IP environment. It includes concepts as well as step-by-step procedures for measuring packetized voice streams. It also proposes new formats that extend RTCP-XR's concept.

• Journal of Korea Multimedia Society
• /
• v.11 no.2
• /
• pp.163-174
• /
• 2008

The H.264/AVC provides gains in compression efficiency of up to 50% over a wide range of bit rates and video resolutions compared to previous standards. However, to achieve such high coding efficiency, the complexity of H.264/AVC encoder is also increased drastically than previous ones, mainly because of mode decision. In this paper, we propose a three-step mode decision algorithm for fast encoding in H.264/AVC. In the first step, we select skip mode or inter mode by considering the temporal correlation and spatial correlation. In the second step, if the result of the first step is INTER mode, we select one group between two groups for final mode. In the third step, we select final mode by exploiting the pixel values of error macroblock or the modes of adjacent macroblocks. Simulations show that the proposed method reduces the encoding time by 42% on average without any significant PSNR losses.