• Journal of Korean Society of Disaster and Security
• /
• v.13 no.2
• /
• pp.39-51
• /
• 2020

Recently, flood damage has been increasing in Korea due to frequent local torrential rains caused by abnormal weather conditions. According to the calculation of the recurrence period of torrential rain that occurred in North Chungcheong Province on July 16, 2017, it was estimated that the rainfall frequency in the upper are of Goessan Dam was around 1,524 years, and the highest level of Goesan Dam rose to EL.137.60 meters, leaving only 5 cm of margin until the height of the dam floor (EL.137.65 meters). The Goesan Dam, which operated for 62 years since 1957, needs to be prepared to cope with the increase of floodgate volume in the basin, the development of a single purpose dam for power generation only, and there are no measurement facilities for flood control, so efficient operation methods are needed to secure the safety of residents in upper and lower regions. In this study, a method of dam operation was proposed by constructing a rain matrix for quick decision making in flood prediction, calculating the highest level of dam for each condition in advance, and preparing a survey table, and quickly finding the level corresponding to the conditions in case of a situation.

• Journal of Korean Institute of Industrial Engineers
• /
• v.38 no.3
• /
• pp.208-219
• /
• 2012

As the number of end-of-life vehicles (ELVs) has kept increasing, the management of ELV has also become one of the academic research focuses and European Union recently adopted the directive on ELVs. For the stakeholders has become a principle agent of dealing with all about ELVs, it is relevant investment decision to set up and to decide high-cost ELVs entity locations and to forecast future ELVs' amount in advance. In this paper, transition probability matrixes between months are made by using Markov Chain and the number of ELVs is predicted with them. This study will perform a great role as a fundamental material in Korea where just started having interests about recycling resources and studies related to the topic. Moreover, the forecasting method developed for this research can be adopted for other enhancements in different but comparable situations.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.93-96
• /
• 2005

We propose a computationally efficient sphere decoding (SD) algorithm with smart radius control (SRC). As a baseline algorithm for SD, we consider the modified Schnorr-Euchner (SE) algorithm [1] (hereafter, called as the MSE algorithm). In principle, the radius after zero-forcing decision feedback equalization (ZF-DFE) estimation can be reduced further if we select a new lattice vector closer to the received signal vector than the lattice vector corresponding to the ZF-DFE estimate does. In our case, we obtain such a better lattice vector by performing a sequence of alternating one-dimensional searches, starting from the ZF-DFE estimate. We then develop a novel SRC algorithm that adopts adaptively the additional radius reduction process according to the estimated signal-to-noise-power ratio (SNR) after ZF-DFE estimation. In addition, we analyze the effect of detection ordering on the complexity for SD. Column-norm ordering of the channel matrix and optimal ordering [1] are considered here. From our analyses, we see that SRC can reduce greatly the complexity for SD and the degree of complexity reduction gets significant as the SNR decreases, irrespective of detection ordering schemes used.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1131-1145
• /
• 2013

Energy detection is a widely used method for spectrum sensing in cognitive radios due to its simplicity and accuracy. However, it is severely affected by the noise uncertainty. To solve this problem, a blind multiband spectrum sensing scheme which is robust to noise uncertainty is proposed in this paper. The proposed scheme performs spectrum sensing over the total frequency channels simultaneously rather than a single channel each time. To improve the detection performance, the proposal jointly utilizes the likelihood function combined with Gerschgorin radii of unitary transformed covariance matrix. Unlike the conventional sensing methods, our scheme does not need any prior knowledge of noise power or PU signals, and thus is suitable for blind spectrum sensing. In addition, no subjective decision threshold setting is required in our scheme, making it robust to noise uncertainty. Finally, numerical results based on the probability of detection and false alarm versus SNR or the number of samples are presented to validate the performance of the proposed scheme.

• Fashion & Textile Research Journal
• /
• v.22 no.5
• /
• pp.639-649
• /
• 2020

This study investigates consumer opinions of clothing care and provides fundamental data to decision-making for oncoming development of clothing care system. Textom, a web-matrix program, was used to analyze big data collected from Naver and Daum with a keyword of "clothing care" from March 2019 to February 2020. A total of 22, 187 texts were shown from the big data collection. Collected big data were analyzed using text-mining, network, and CONCOR analysis. The results of this study were as follows. First, many keywords related to clothing care were shown from the result of frequency analysis such as style, Dryer, LG Electronics, Product, Customer, Clothing, and Styler. Consumers were well recognizing and having an interest in recent information related to the clothing care system. Second, various keywords such as product, function, brand, and performance, were linked to each other which were fundamentally related to the clothing care. The interest in products of the clothing care system were linked to product brands that were also naturally linked to consumer interest. Third, the keywords in the network showed similar attributes from the result of CONCOR analysis that were classified into 4 groups such as the characteristics of purchase, product, performance, and interest. Lastly, positive emotions including goodwill, interest, and joy on the clothing care system were strongly expressed from the result of the sentimental analysis.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.1
• /
• pp.98-107
• /
• 2008

The purpose of this paper is to present an optimization scheme that aims at minimizing the expected cost per unittime. This study considers a linear connected-(r, s)-ouI-of-(m, n):f lattice system whose components are orderedlike the elements of a linear (m, n)-matrix. We assume that all components are in the state 1 (operating) or 0(failed) and identical and s-independent. The system fails whenever at least one connected (r, s)-submatrix offailed components occurs. To find the optimal threshold of maintenance intervention, we use a simulatedannealing(SA) algorithm for the cost optimization procedure. The expected cost per unit time is obtained byMonte Carlo simulation. We also has made sensitivity analysis to the different cost parameters. In this study,utility maintenance model is constructed so that minimize the expense under full equipment policy throughcomparison for the full equipment policy and preventive maintenance policy. The full equipment cycle and unitcost rate are acquired by simulated annealing algorithm. The SA algorithm is appeared to converge fast inmulti-component system that is suitable to optimization decision problem.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.699-712
• /
• 2016

Recently, greedy algorithm has received much attention as a cost-effective means to reconstruct the sparse signals from compressed measurements. Much of previous work has focused on the investigation of a single candidate to identify the support (index set of nonzero elements) of the sparse signals. Well-known drawback of the greedy approach is that the chosen candidate is often not the optimal solution due to the myopic decision in each iteration. In this paper, we propose a tree search based sparse signal recovery algorithm referred to as the tree search matching pursuit (TSMP). Two key ingredients of the proposed TSMP algorithm to control the computational complexity are the pre-selection to put a restriction on columns of the sensing matrix to be investigated and the tree pruning to eliminate unpromising paths from the search tree. In numerical simulations of Internet of Things (IoT) environments, it is shown that TSMP outperforms conventional schemes by a large margin.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.2
• /
• pp.129-139
• /
• 2016

This paper presented a robust ship scheduling model using the quadratic programming problem. Given a set of available carriers under control and a set of cargoes to be transported from origin to destination, a robust ship scheduling that can minimize the mean-variance objective function with the required level of profit can be modeled. Computational experiments concerning relevant maritime transportation problems are performed on randomly generated configurations of tanker scheduling in bulk trade. In the first stage, the optimal transportation problem to achieve maximum revenue is solved through the traditional set-packing model that includes all feasible schedules for each carrier. In the second stage, the robust ship scheduling problem is formulated as mentioned in the quadratic programming. Single index model is used to efficiently calculate the variance-covariance matrix of objective function. Significant results are reported to validate that the proposed model can be utilized in the decision problem of ship scheduling after considering robustness and the required level of profit.

• Journal of the Korean Society for Precision Engineering
• /
• v.27 no.11
• /
• pp.63-71
• /
• 2010

FormFactors is one of the most critical design factors in early development of mobile phone, and proper selection of FormFactors is necessary for smoothness of product development and customer satisfaction. Especially, emergence of mobile convergence added so various functions besides its original call function that importance of selecting FormFactors has increased because multiform FormFactors are needed. However there is problem such as frequent change of decision making in existing process because established process picks out FormFactors sensibly and arbitrarily through idea pull and so forth. We proposed FormFactors selection process by Axiomatic Design, set approach method and block approach method for reasonable and systematical FormFactors selection. First of all, we set the purpose of mobile phone development, and it is examined by Axiomatic Design. FormFactors design matrix is deduced through this process, the numbers of axes and rails are proposed using set approach method, and then patterns of FormFactors are embodied by block approach method. Particularly process application was tried through case study of mobile phone development, and we ensured that new FormFactors can be presented to a designer by systematical verification if change of customer requirements occurs through our process.

• Journal of Nutrition and Health
• /
• v.36 no.3
• /
• pp.319-326
• /
• 2003

The purposes of this study were to : (a) analyze the menus of food service operations using the menu analysis techniques of Kasavana & Smith, Miller, Merricks & Jones, Pavesic and Uman, (b) closely examine the characteristics of the five analysis techniques. Calculations for the menu analysis were done by computer using the MS 2000 Excel spreadsheet program. Menu mix% and unit contribution margin were used as variables by Kasavana & Smith, sales volume and food cost% by Miller, sales volume and cash contribution by Merrick & Jones, weighted contribution margin and food cost% by Pavesic, and total cash contribution and unit contribution margin by Uman. In each case, a four-cell matrix was created, and menu items were located in each according they achieved high or low scores with respect to two variables. Items that scored favorably on both variables were rated in the top category (e.g., star, prime, signature, group A, winner) and those that scored below average on both were rated in the lowest category (e.g., dog, problem, loser, group D, loser). While the 3 methods of Kasavana & Smith, Miller, Merrick & Jones focus on customers' viewpoints, the others consider the managers' viewpoints. Therefore, it is more likely to be desirable for decision-making on menus if the menu analysis technique chosen is suited to its purpose.