• The Pure and Applied Mathematics
• /
• v.5 no.1
• /
• pp.45-54
• /
• 1998

We study the space-times that have a unique terminal indecomposable past set or a unique terminal indecomposable future set and examine their causal boundary, and we investigate some conditions for the warped product space-times of the form (a, b) ${\times}_fF$ to have a unique terminal indecomposable past set or a unique terminal indecomposable future set.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.5 s.335
• /
• pp.9-14
• /
• 2005

Simulation method for a pure radio-frequency (rf) mode of reflection-type and a pure rf mode of transmission-type radio-frequency single-electron transistor (RF-SET) operation is introduced. In this method, the solutions of differential equations based on Kirchhoff's law are obtained self-consistently at frequency-domain. Also, the steady-sate single-electron transistor (SET) current model and the time-dependent SET current model are used in this method. The reflected wave of a typical reflection-type RF-SET and the transmitted wave of a typical transmission-type RF-SET are calculated, and the accuracy of our developed method including the steady-state SET current model is verified with the method introduced by reference 2. At high frequency over GHz, results of our developed method including the time-dependent SET current model are considerably different from that including the steady-state SET current model. At high frequency over GHz, an exact time-dependent SET current model is needed to analyze RF-SET operation.

• Journal of Intelligence and Information Systems
• /
• v.17 no.4
• /
• pp.109-130
• /
• 2011

One of the major problems in the area of data mining is the size of the data, as most data set has huge volume these days. Streams of data are normally accumulated into data storages or databases. Transactions in internet, mobile devices and ubiquitous environment produce streams of data continuously. Some data set are just buried un-used inside huge data storage due to its huge size. Some data set is quickly lost as soon as it is created as it is not saved due to many reasons. How to use this large size data and to use data on stream efficiently are challenging questions in the study of data mining. Stream data is a data set that is accumulated to the data storage from a data source continuously. The size of this data set, in many cases, becomes increasingly large over time. To mine information from this massive data, it takes too many resources such as storage, money and time. These unique characteristics of the stream data make it difficult and expensive to store all the stream data sets accumulated over time. Otherwise, if one uses only recent or partial of data to mine information or pattern, there can be losses of valuable information, which can be useful. To avoid these problems, this study suggests a method efficiently accumulates information or patterns in the form of rule set over time. A rule set is mined from a data set in stream and this rule set is accumulated into a master rule set storage, which is also a model for real-time decision making. One of the main advantages of this method is that it takes much smaller storage space compared to the traditional method, which saves the whole data set. Another advantage of using this method is that the accumulated rule set is used as a prediction model. Prompt response to the request from users is possible anytime as the rule set is ready anytime to be used to make decisions. This makes real-time decision making possible, which is the greatest advantage of this method. Based on theories of ensemble approaches, combination of many different models can produce better prediction model in performance. The consolidated rule set actually covers all the data set while the traditional sampling approach only covers part of the whole data set. This study uses a stock market data that has a heterogeneous data set as the characteristic of data varies over time. The indexes in stock market data can fluctuate in different situations whenever there is an event influencing the stock market index. Therefore the variance of the values in each variable is large compared to that of the homogeneous data set. Prediction with heterogeneous data set is naturally much more difficult, compared to that of homogeneous data set as it is more difficult to predict in unpredictable situation. This study tests two general mining approaches and compare prediction performances of these two suggested methods with the method we suggest in this study. The first approach is inducing a rule set from the recent data set to predict new data set. The seocnd one is inducing a rule set from all the data which have been accumulated from the beginning every time one has to predict new data set. We found neither of these two is as good as the method of accumulated rule set in its performance. Furthermore, the study shows experiments with different prediction models. The first approach is building a prediction model only with more important rule sets and the second approach is the method using all the rule sets by assigning weights on the rules based on their performance. The second approach shows better performance compared to the first one. The experiments also show that the suggested method in this study can be an efficient approach for mining information and pattern with stream data. This method has a limitation of bounding its application to stock market data. More dynamic real-time steam data set is desirable for the application of this method. There is also another problem in this study. When the number of rules is increasing over time, it has to manage special rules such as redundant rules or conflicting rules efficiently.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.3
• /
• pp.85-90
• /
• 2008

In this paper, we propose a new robot cleaning algorithm, which we call SetClean. The new algorithm cleans from the most less complex area. Sometimes, when the cleaning completion time can be longer or can not be estimated, cleaning larger area first is better than optimizing the whole time for cleaning. To do this, SetClean algorithm divides the whole area into cleanable sub-areas using Set Cover algorithm and cleans the area in the order of high efficiency that maximize the cleanable area per unit time. SetClean algorithm decides the navigation flow by considering not only the size of the area but also the distance from the current robot location to the area to be cleaned and the delay time caused by the number of turns within the area. The experimental results show the mechanism and performance of the SetClean algorithm.

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

This paper presents a new method for forecasting construction project cost and time at completion or at any intermediate time horizon of the project duration. The method is designed to overcome identified limitations of current applications of earned value method in forecasting project cost and time. The proposed method usesfuzzy set theory to model uncertainties associated with project performance and it integrates the earned value technique and the contractors' judgement. The fuzzy set theory is applied as an alternative approach to deterministic and probabilistic methods. Using fuzzy set theory allows contractors to: (1) perform risk analysis for different scenarios of project performance indices, and (2) perform different scenarios expressing vagueness and imprecision of forecasted project cost and time using a set of measures and indices. Unlike the current applications of Earned Value Method(EVM), The proposed method has a numberof interesting features: (1) integrating contractors' judgement in forecasting project performance; (2) enabling contractors to evaluate the risk associated with cost overrun in much simpler method comparing with that of simulation, and (3) accounting for uncertainties involved in the forecasting project cost.

• Journal of Nutrition and Health
• /
• v.31 no.8
• /
• pp.1347-1354
• /
• 1998

The purposes of this study were to : (a) anlayze wating time, service rate, arrival rate, and coustomer expectations/satisfaction in cafeteria business foodservices and (b) identify the differences in those factors between foodservices by menu managmenet systems. The samples were two business foodservices operated by contract management in Seoul. The queue, laptime , service rate, and arrival rate were measured at each foodservice by stopwatch observation. The menu type, delivery system, number of meals served , servide time, and turnover rate of each foodservic was investigated. Questionnaires were developed to survey customer expectations and satisfaction. Satistical data analysis was completed using the SAS package programs for descriptive analysis and t-test. The mean waiting time of island type dafeteria system with separte set -menu was shorter than that of the other. In both foodservices, arrival rates were not significantly different from one another , but sevice rates were significnatly high in dafeteria menu systems. The peak time of the queue was found out at combination set menu line. The separate set menu line had a higher servide rate than the combination set menu line. The mean waiting time of the island type cafeteria line was shorter than that of the straifth type . At the straight type dafeterial line, both arrival rate and service rate were higher than those of island-type. The results of this study suggested that a separate set-menu would be more desirable than a combination set-menu in case of providing set menu with cafeteria menu.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.13-26
• /
• 1992

Set-up reduction is an important aspect of the Japanese Just-In-Time (JIT) and Zero Inventory (ZI) concepts. In this paper, we first analyze the effects of set-up cost reduction on tatal inventory, average lot size and forecast horizon in the dynamic lot size model. We also examine the various effects of set-up cost reduction in the EOQ model and explain why many Japanese firms try to cut set-up cost and/or set-up time greatly.

• Journal of the military operations research society of Korea
• /
• v.8 no.1
• /
• pp.53-70
• /
• 1982

This thesis develops a more realistic and applicable new set covering model that is adjusted and supplied by the existing set covering models, and induces an algorithm for solving the new set covering model, and applies the new model and the algorithm to an actual set covering problems. The new set covering model introduces a probabilistic covering aistance ($0{\eqslantless}p{\eqslantless}1$)or time($0{\eqslantless}p{\eqslantless}1$) instead of a deterministic covering distance(0 or 1) or time (0 or 1) of the existing set covering model. The existing set covering model has not considered the merit of the overcover of customers. But this new set covering model leads a concept of this overcover to a concept of the parallel system reliability. The algorithm has been programmed on the UNIVAC 9030 for solving large-scale covering problems. An application of the new set covering model is presented in order to determine the locations of the air surveillance radars as a set covering problem for a case-study.

• Korean Management Science Review
• /
• v.21 no.1
• /
• pp.39-55
• /
• 2004

Efficient crew scheduling for cockpit crew is important in airline industry due to operational safety and cost associated with the flight duty time. Because of complexity of regulations imposed to the cockpit crew. it is complicated to generate an efficient schedule. Schedule of cockpit crew can be generated through two steps; selecting of flight patterns. and scheduling of them to the specific time horizon. Heuristic method is developed and applied with massive data in a limited time of computation. A set of flight patterns is selected from all possible flight patterns. which are generated by composing the flight leg based on regulations. by using the set partitioning problem with objective function of oversea stay cost. The selected set of flight patterns found at the first step is allocated to 4 week crew schedule to minimize the variance of total fight time assigned to each crew. The crew schedules obtained are evaluated and compared with the ones currently used in one of major airline company.

• Proceedings of the Korea Concrete Institute Conference
• /
• 1998.10b
• /
• pp.694-700
• /
• 1998

PSC box bridge by MSS construction method may not be set at cross section at one step. Web and bottom flange(U member) would be set at first, top flange will be set later with a time lag. In this case, U member and top flange concrete have different strain history. As two different aged section behaves as the composite section, there would happen the redistribution of stress. This is come from time-dependent strain characteristics of concrete itself. In this study, two models are considered, one with considering the set time of cross section and the other without. By performing longitudinal analysis of two models on considering construction stage, the stress differences of two are compared. As the analysis results show a considerable differences in the stresses of cross section between two models, the set time of cross section is needed for rational design f PSC box girder bridge.