• Korean Journal of Childcare and Education
• /
• v.13 no.3
• /
• pp.39-54
• /
• 2017

Objective: The purpose of this study was to examine natural groupings of the sub-factors of mother's reaction to children's negative emotions. The natural groupings were as follows; the emotion-coaching-reaction, the emotion-minimizing-reaction and oversensitive reaction. In addition, this paper also investigated individual differences in children's emotion regulation by clusters of sub-factors of mother's reaction to children's negative emotions. Methods: The subjects of this study consisted of 318 children. The data were analyzed using cluster analysis and one-way ANOVA. Results: The results suggested four proper clusters, according to the characteristics of mother's reaction to children's negative emotions. Cluster 1 was categorized as 'child centered-emotion coaching', cluster 2 was categorized as 'oversensitive-emotion coaching comorbid', cluster 3 was categorized as 'acception-emotion minimizing confused' and cluster 4 was categorized as 'emotion minimizing-unsupporting.' Additionally, the differences between Emotion regulations in each cluster showed distinct points of interest. In terms of the maladaptive emotion regulation, cluster 3 showed the highest level followed by cluster 4. And cluster 1 and 2 showed the lowest level. Conclusion/Implications: The results of this study helped to find a deeper understanding of the operation of specific clusters of mother's reaction to children's negative emotion and children's emotion regulation.

• Industrial Engineering and Management Systems
• /
• v.10 no.2
• /
• pp.134-139
• /
• 2011

The problem of scheduling in permutation flowshops has been extensively investigated by many researchers. Recently, attempts are being made to consider more than one objective simultaneously and develop algorithms to obtain a set of Pareto-optimal solutions. Varadharajan et al. (2005) presented a multi-objective simulated-annealing algorithm (MOSA) for the problem of permutation-flowshop scheduling with the objectives of minimizing the makespan and the total flowtime of jobs. The MOSA uses two initial sequences obtained using heuristics, and seeks to obtain non-dominated solutions through the implementation of a probability function, which probabilistically selects the objective of minimizing either the makespan or the total flowtime of jobs. In this paper, the same problem of heuristically developing non-dominated sequences is considered. We propose an effective heuristics based on simulated annealing (SA), in which the weighted sum of the makespan and the total flowtime is used. The essences of the heuristics are in selecting the initial sequence, setting the weight and generating a solution in the search process. Using a benchmark problem provided by Taillard (1993), which was used in the MOSA, these conditions are extracted in a large-scale experiment. The non-dominated sets obtained from the existing algorithms and the proposed heuristics are compared. It was found that the proposed heuristics drastically improved the performance of finding the non-dominated frontier.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.5
• /
• pp.601-610
• /
• 2018

The purpose of this paper is to establish a new optimum Generator Maintenance Scheduling(GMS) considering renewable energy generator. In this paper, the total renewable energy generation is estimated using hourly capacity factor of renewable energy generator. The GMS was optimized with the objective function of maximizing the minimum reserve rate, minimizing the probabilistic production cost, minimizing the loss of load expectation, and minimizing $CO_2$ emissions. In the case study of this paper, GMS considering renewable energy and GMS not considering renewable energy are shown by each objective function. And it shows scenarios of the reliability, the environmental and economical factors when two nuclear power plants inputted and ten coal thermal power plants shut downed respectively.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.87-96
• /
• 1998

Using the concept of cellular manufacturing systems(CMS) in job shop manufacturing system is one of the most innovative approaches to improving plant productivity. However. several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of maintaining an ideal CMS environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem because it is a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine ceil. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and ceil space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine Incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.263-266
• /
• 1998

Several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of ideal Cellular Manufacturin System (CMS) environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem as it's a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine cells. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and cell space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

• Information and Communications Magazine
• /
• v.4 no.4
• /
• pp.505-524
• /
• 1987

Nowaday all the countries of the world have studied the various problems caused in operating their own ports efficiently. Ship delay in the port is attributal to the inefficient operation in the navigation aids, the cargo handling, the storage and transfer facilities, and to the inefficient allocation of gangs or to a bad service for ships. Among these elements the allocation of gangs is the predominating factor in minimizing ship's turn round time. At present, in the case of Pusan Port. the labour union and stevedoring companies allocate gangs in every hatches of ships by a rule of thumb, just placing emphasis on minimizing ship's turn round time, without applying the principle of allocation during the cargo handling. Owing to this the efficiency of the cargo handling could not be expected to be maximized and this unsystematic operation result in supplying human resources of much unnecessary surplus gangs. Therefore in this paper the optimal size and allocation of gangs for minimizing the ship's turn round time is studied and formularized. For the determination of the priority for allocation the evaluation function, namely $F=PHi^{n}{\times}(W+H)$, can be obtained; where, PHI : Principal Hatch Index W : Total Cargo Weight represented in Gang-Shifts H : Total Number of Ship's hatches and also for the optimal size of gangs the average number of gang allocated per shift (Ng), namely Ng=W/PHI, is used. The proposed algorithm is applied to Pusan Port and its validity is verified.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.3
• /
• pp.1-10
• /
• 1997

We present an approach to high-level synthesis for a specific target architecture-partitioned bus architecture. In this approach, we have specific goals of minimizing data transfer length and number of buses in addition to common synthesis goals such as minimizing number of control steps and satisfying given resource constraint. Minimizing data transfer length and number of buses can be very important design goals in the era of deep submicron technology in which interconnection delay and area dominate total delay and area of the chip to be designed. in partitioned bus architecture, to get optimal solution satisfying all the goals, partitioning of operation nodes among segments and ordering of segments as well as scheduling and allocation/binding must be considered concurrently. Those additional goals may impose much more complexity on the existing high-level synthesis problem. To cope with this increased complexity and get reasonable results, we have employed two ideas in ur synthesis approach-extension of the target architecture to alleviate bus requirement for data transfer and adoption of genetic algorithm as a principal methodology for design space exploration. Experimental results show that our approach is a promising high-level synthesis mehtodology for partitioned bus architecture.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.6
• /
• pp.797-803
• /
• 2012

In this paper, for minimizing the real-time operating load losses of the power transformer, a SCADA optimum operating system was developed, and the economic analyses on the test operation were performed. Transformer loss DB which reflects the economic integration operation criteria was constructed by referring the transformer manufacturer's loss data(iron loss, copper loss). Based on the loss DB, each substation transformer real-time loss was calculated according to the size of the transformer loads, and if integration or separation transformer operating conditions minimizing the loss are met, then a window pops-up and the dispatcher performs the substation equipments operation according to the procedure provided by this system. With the existing SCADA main program, the relation database of the substation facilities and integration/separation operation algorithm were developed and applied to Auto MTR Processor and pconn Processor Task module. Seven stations test data for seven months were analyzed for the economic analyses, and the results showed that Cost-Benefit ratio was 2.64, and IRR(Internal Rate of Return), 36%, which asserted the economic justification of the proposed system.

• Journal of the Korean Society for information Management
• /
• v.25 no.3
• /
• pp.377-392
• /
• 2008

The need for overall assessment of economic effectiveness of library culture program has been suggested, as its importance continues to grow. Our study proposed a new assessment method by applying DM format and IBM format to contingent valuation method that has been used for analyzing the economic value of culture program. This study also illustrates the process through case analysis so that the public library can apply this model. It is meaningful that the study provides basic framework to evaluate the fair value of the public library by minimizing the bias that the contingent valuation method has.

• Proceedings of the Korean Sanitation Conference
• /
• 2004.11a
• /
• pp.54-65
• /
• 2004

Use of aluminum salts as coagulants In water treatment may lead to increased concentrations of aluminum in finished water. Aluminum is a suspected causative agent of neurological disorders such as Alzheimer's disease. The objective of this study was to examine variation and minimizing in residual aluminum concentration during water treatment process. The aluminum sources at Bokjeong Water Plant were present naturally aluminum in the raw water and derived due to use of PACS as a coagulant. Much of the raw water total aluminum were in particulate and suspended aluminum. In this study was compared the optimize condition to minimize the concentration of residual aluminum using Jar-test with the various coagulants such as alum, PAC, PACS. The results indicated that PACS was more effective than alum, PAC and insufficient or excessive alum, PAC, PACS addition led to increase residual aluminum. Adjustment raw water pH $6.5\~7.0$ before coagulation using PACS was capable of minimizing total and dissolved aluminum. Thus it is important that the optimal dosage of coagulant and the optimal pH adjustment before coagulation can decided to minimize the concentration of residual aluminum in treated water.