• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2001.11a
• /
• pp.176-180
• /
• 2001

There are several factors causing re-work in CMP process such as improper polish time calculation by operator, removal rate decline of the polisher, unstable in-suit pad conditioning, slurry supply module problem and wafer carrier rotation inconsistency. And conclusively those fundimental reason for the re-work rate increasement is mainly from the cycle time delay between wafer polish and post measurement. Therefore, Wafer thickness measurement in wet condition could be able to remove those improper process conditions which may happen during the process in comparison with the conventional dried wafer measurement system and it can be able to reduce the CMP process cycle time. CMP scrap reduction by overpolish, re-work rate reduction, thickness control efficiency also can be easily achieved. CMP Equipment manufacturer also trying to develop integrated system which has multi-head & platen, cleaner, pre & post thickness measure and even control the polish time from the calculated removal rate of each polishing head by software. CMP re-work problem such as over & under polish by target thickness may result in the cycle time delay. By reducing those inefficient factors during the process and establish of the automatic process control, CLC system need to be adopted to maximize the process performance. Wafer to Wafer Polish Time Feed Back Control by measuring the wafer right after the polish shorten the polish time calculation for the next wafer and it lead to the perfect Post CMP target thickness control capability. By Monitoring all of the processed the wafer, CMP process will also be stabilize itself.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.127-129
• /
• 2007

Since the competitive market environment was introduced into the electric power industry, the structure of the industry has been changing from vertically integrated system to functionally unbundled and decentralized system composed of multiple (decision-making) market participants. So the market participants such as Gencos or LSE (load serving entity) need to forecast the market clearing price and thus build their offer or bidding strategies. Not just these market players but also a market operator is required to perform market analysis and ensure simulation capability to manage and monitor the competitive electricity market. For fulfilling the demand for market simulation, many global venders like GE, Henwood, Drayton Analytics, CRA, etc. have developed and provided electricity market simulators. Most of these simulators are based on the optimization formulation which has been used mainly for the least cost resource planning in the centralized power system planning and operation. From this standpoint, it seems somehow inevitable to face many challenges on modeling competitive market based on the method of traditional market simulators. In this paper, we propose a kind of new method, which is MAS based market simulation. The agent based model has already been introduced in EMCAS, one of commercial market simulators, but there may be various ways of modeling agent. This paper, in particular, seeks to introduce an model for MAS based market simulator.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.10
• /
• pp.6276-6281
• /
• 2014

Genetic Algorithms (GAs) are efficient methods for search and optimization problems. On the other hand, there are some problems associated with the premature convergence to local optima of the multimodal function, which has multi peaks. The problem is related to the lack of genetic diversity of the population to cover the search spaces sufficiently. A sharing and crowding method were introduced. This paper proposed strategies to improve the convergence speed and the convergence to the global optimum for solving the multimodal optimization function. These strategies included the random generated sub-population that were well-distributed and spread widely through search spaces. The results of the simulation verified the effects of the proposed method.

• The Journal of Advanced Prosthodontics
• /
• v.13 no.4
• /
• pp.258-267
• /
• 2021

PURPOSE. The purpose of this study was to compare the surface roughness, phase transformation, and surface topography of dental zirconia with three different yttrium oxide compositions under same grinding and polishing conditions. MATERIALS AND METHODS. Three zirconia disks (IPS e.max ZirCAD LT, MT, MT multi, Ivoclar Vivadent AG, Schaan, Liechtenstein) were selected for experimental materials. Sixty-nine bar-shaped specimens were fabricated as 12.0 × 6.0 × 4.0 mm using a milling machine and glazing was conducted on 12.0 × 6.0 mm surface by same operator. With a custom polishing device, 12.0 × 6.0 mm surfaces were polished under same condition. Surface roughness (Ra[㎛]) was measured before grinding (C), after grinding (G), and at every 3 steps of polishing (P1, P2, P3). X-ray diffraction and FE-SEM observation was conducted before grinding, after grinding, and after fine polishing (P3). Statistical analysis of surface roughness was performed using Kruskal-Wallis test and Mann-Whitney-U test was used as a post hoc test (α = .05). RESULTS. There were no significant differences of surface roughness between LT, MT, and MM groups. In LT, MT, and MM groups, P3 groups showed significantly lower surface roughness than C groups. X-ray diffraction showed grinding and polishing didn't lead to phase transformation on zirconia surface. In FE-SEM images, growths in grain size of zirconia were observed as yttrium oxide composition increases. CONCLUSION. Polished zirconia surface showed clinically acceptable surface roughness, but difference in yttrium oxide composition had no significant influence on the surface roughness. Therefore, in clinical situation, zirconia polishing burs could be used regardless of yttrium oxide composition.

• The Journal of the Korea Contents Association
• /
• v.21 no.7
• /
• pp.157-163
• /
• 2021

A single write operation in a file system can modify multiple data, but these changes in the file system are not atomically written to disk. Thus, for the consistency of the file system, conventional journaling guarantees crash consistency instead of sacrificing the system performance. It is known that using non-volatile memory as a journal space can alleviate performance degradation due to low latency and byte-level accessibility of non-volatile memory. However, none of the journaling techniques considering non-volatile memory provide scalability. In this paper, journal space on non-volatile memory is divided into multiple regions for scalable journaling, thus dispersing concentrated operations in one region. Second, the journal area-specific operator structure is used to accelerate data write operations to storage devices. We apply the proposed technique to JFS to evaluate it on multi-core servers equipped with high-performance storage devices. The evaluation results show that the proposed technique performs better than the existing technique of the NVM-based journaling file system.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.17 no.2
• /
• pp.227-234
• /
• 2019

A user-friendly modeling interface is developed for a process-based total system performance assessment framework (APro) specialized for a generic geological disposal system for high-level radioactive waste. The APro modeling interface is constructed using MATLAB, and the operator splitting scheme is used to combine COMSOL for simulation of multiphysics and PHREEQC for the calculation of geochemical reactions. As APro limits the modeling domain to the generic disposal system, the degree of freedom of the model is low. In contrast, the user-friendliness of the model is improved. Thermal, hydraulic, mechanical and chemical processes considered in the disposal system are modularized, and users can select one of multiple modules: "Default process" and multi "Alternative process". APro mainly consists of an input data part and calculation execution part. The input data are prepared in a single EXCEL file with a given format, and the calculation part is coded using MATLAB. The final results of the calculation are created as an independent COMSOL file for further analysis.

• Journal of Forest and Environmental Science
• /
• v.38 no.4
• /
• pp.239-248
• /
• 2022

Forestry crane work in a forest harvester or forwarder is regarded as one of most hard work requiring a very high level of operation skill. The operator must handle two or more multi-axes joysticks simultaneously to control the multiple manipulators for maneuvering the crane-tip to its intended location. This study has been carried out to develop a crane-tip controller which can intuitively maneuver the crane-tip, resulting in improving the productivity by decreasing the technical difficulty of control as well as reducing the workload. The crane-tip controller consists of a single 2-axis joystick and a control algorithm run on microcontroller. Lab-scale forestry crane was constructed using electric cylinders. The crane-tip control algorithm has the crane-tip follow the waypoints generated on the given path considering the dead band region using LBO (Lateral Boundary Offset). A speed control gain to change the speed of relevant cylinders relatively is applied as well. By the P (Proportional) control within the control interval of 20 msec, the average error of crane-tip control on the predefined straight path turned out to be 14.5 mm in all directions. When the joystick is used the waypoints are generated in real time by the direction signal from the joystick. In this case, the average error of path control was 12.4 mm for straight up, straight forward and straight down movements successively at a certain constant speed setting. In the slant movement of crane-tip by controlling two axes of joystick simultaneously, the movement of crane-tip was controlled in the average error of 15.9 mm when the crane-tip is moved up and down while moving toward forward direction. It concluded that the crane-tip control was possible using the control algorithm developed in this study.

• Journal of Korean Society of Transportation
• /
• v.23 no.4 s.82
• /
• pp.71-79
• /
• 2005

Existing arterial link travel time estimation methods relying on either aggregate point-based or individual section-based traffic data have their inherent limitations. This paper demonstrates the utility of data fusion for improving arterial link travel time estimation. If the data describe traffic conditions, an operator wants to know whether the situations are going better or worse. In addition, some traffic information providing strategies require predictions of what would be the values of traffic variables during the next time period. In such situations, it is necessary to use a prediction algorithm in order to extract the average trends in traffic data or make short-term predictions of the control variables. In this research. a multi-step ahead prediction algorithm using Data fusion was developed to predict a link travel time. The algorithm performance were tested in terms of performance measures such as MAE (Mean Absolute Error), MARE(mean absolute relative error), RMSE (Root Mean Square Error), EC(equality coefficient). The performance of the proposed algorithm was superior to the current one-step ahead prediction algorithm.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.48 no.4
• /
• pp.41-54
• /
• 2020

This study was conducted to provide basic data for a transparent and fair bidding system by identifying problems and suggesting improvement measures through an analysis of the bidding status for construction projects and service-related landscaping of multi-family housing. To this end, we used the data from the "Multi-Family Housing Management Information System (K-apt)" that provides the history of apartment maintenance, bidding information, and the electronic bidding system to examine the winning bid status and amount, along with the size and trends of the winning bids by year, and the results of the selection of operators by construction type. As a result, it was found that out of the total number of successful bids (36,831), 4.4% (16,631) were in the landscaping business, and the average winning bid value was found to be about 24 million won. According to the data, 73% of the landscaping cases were valued between 3 million won and 30 million won, and 58.6% of the cases were in the field of "pest prevention and maintenance". 36% of the total number of bids were awarded from February to April, with "general competitive bidding" accounting for 59.8% of the bidding methods. As for the method of selecting the winning bidder, 55% adopted the "lowest bid" and "electronic bidding method," and 45% adopted the "qualification screening system" and "direct bidding method." As an improvement to the problems derived from the bidding status data, the following are recommended: First, the exception clause to the current 'electronic bidding method' application regulations must be minimized to activate the electronic bidding method so that a fair bidding system can be operated. Second, landscaping management standards for green area environmental quality of multi-family housing must be prepared. Third, the provisions for preparing design books, such as detailed statements and drawings before the bidding announcement, and calculating the basic amount shall be prepared so that fair bidding can be made by specifying the details of the project concretely and objectively must be made. Fourth, for various bidding conditions in the 'business operator selection guidelines', detailed guidelines for each condition, not the selection, need to be prepared to maintain fairness and consistency. These measures are believed to beuseful in the fair selection of landscaping operators for multi-family housing projects and to prepare objective and reasonable standards for the maintenance of landscaping facilities and a green environment.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.135-142
• /
• 2013

Contour detection is important for many computer vision applications, such as shape discrimination and object recognition. In many cases, local luminance changes turn out to be stronger in textured areas than on object contours. Therefore, local edge features, which only look at a small neighborhood of each pixel, cannot be reliable indicators of the presence of a contour, and some global analysis is needed. The novelty of this operator is that dilation is limited to Deluanary triangular. An efficient implementation is presented. The grouping algorithm is then embedded in a multi-threshold contour detector. At each threshold level, small groups of edges are removed, and contours are completed by means of a generalized reconstruction from markers. Both qualitative and quantitative comparison with existing approaches prove the superiority of the proposed contour detector in terms of larger amount of suppressed texture and more effective detection of low-contrast contour.