• Journal of the Korean Dietetic Association
• /
• v.12 no.4
• /
• pp.390-403
• /
• 2006

The purposes of this study were to : (a) examine the using pattern of college foodservice and off-campus restaurant and identify the important service quality attributes and levels for conjoint analysis, (b) investigate the demographic factor and the lunch behavior of "S" college's foodservice customer (c) search the optimum moving time to the college foodservice by cumulative graph, (d) identify the relative importance of the service quality attributes and level at college foodservice by conjoint analysis, and (e) provide the basic data for establishing new college foodservice. Questionnaire developed were conducted with 305 daytime students. A total of 284 were usable and the data was analyzed by the SPSS(ver. 11.0) for the descriptive analysis and conjoint analysis. ‘Low price’ was the reason for using college union foodservice, and the advantages of college union the foodservice were reported to be 'speediness', 'low price', 'near distance', 'wide space' and etc in a college. For off-campus restaurant, the using reasons were mentioned 'near distance', 'menu variety', 'kindness', and 'better taste and quality' and the using advantage found out 'inexpensive and enjoyable food with friends', and 'good taste'. An optimum time required for moving to the college foodservice was calculated 9 min by cumulative graph. As the relative important attributes on college foodservice were identified in the order of the ‘price range', the 'time required for the movement' and the 'food taste', and the level were analyzed the location requiring 6~10 minutes for the movement, the price range of 2,100~2,500 won, and the providing tasty foods by conjoint analysis. As "S" college will be established a new college foodsrevice suggested by the this study result, there should be expected the increasing salse and the college student's satisfaction on campus foodservice.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1996.03a
• /
• pp.132-136
• /
• 1996

A Study is a experiment which is figure out to aptimum discharge cutting condition of the surfaceroughness, electric discharging speed and electro wear ratio with Ton Toff and V(voltage) as an input condition according to the current(Ip) in an electric spark machine ; 1)Electrode is utilized Cu(coper) and Graphite. 2)Work piece is used the material of carbon steel. The condition of experiment is; 1)Current is varied 0.7(A) to 50(A). 2)Pulse time(Ton) is varied 3($\mu$s) to 240($\mu$s) and also Toff is varied 7($\mu$s) to 20($\mu$s). 3)The time of electric discharging to work piece in each time is 30(min) to 60(min) 4)After the upper side of work piece was measured in radius (5${\mu}{\textrm}{m}$) of syulus analyzed the surface roughness to made the table and graph of Rmax by yielding data. 5)Electro wear ratio is; \circled1Coper was measured cx-machining and post machining but the electronic baiance. \circled2The ex-machining of graphite measured by it, the post-machining was found the data from volume specific gravity and analyzed to made its table and graph on ground the data 6)In order to keep the accuracy of voltage affected to the work piece was equipped with the A.V.R(Automatic Voltage Regulator). 7)The memory scope was sticked to the electric spark machine. 8)In order to preserve the precision of current, to get rid of the noise occured by internal resistance of electric spark machine and to force injecting for the discharge fluid, it made the fixed table for a work piece to minimize the work error by means of one's failure during the electric discharging According to above results, the surface roughness by the variation of electrodw and current was analyzed to compare KS(Korea Standards) It was decided the optimum condition of electric discharge cutting through analyzing the effect of electric discharge speed and electro wear ratio.

• Journal of Korea Game Society
• /
• v.7 no.4
• /
• pp.93-104
• /
• 2007

In the complex real-time multi-agent system such as game environment, dynamic task allocations are repeatedly performed to achieve a goal in terms of system efficiency. In this research, we present a task allocation scheme suitable for the real-time multi-agent environment. The scheme is to optimize the task allocation by complementing existing coordination agent with $A^*$ algorithm. The coordination agent creates a status graph that consists of nodes which represent the combinations of tasks and agents, and refines the graph to remove nodes of non-execution tasks and agents. The coordination agent performs the selective utilization of the $A^*$ algorithm method and the greedy method for real-time re-allocation. Then it finds some paths of the minimum cost as optimized results by using $A^*$ algorithm. Our experiments show that the coordination agent with $A^*$ algorithm improves a task allocation efficiency about 25% highly than the coordination agent only with greedy algorithm.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.418-429
• /
• 2001

Recently, a GIS has been applicable to the most important computer applications such as urban information systems and transportation information systems. These applications require spatial operations for an efficient management of a large volume of data. In particular, a spatial join among basic operations has the property that its response time is increased exponentially according to the number of spatial objects included in the operation. Therefore, it is not proper to the systems demanding the fast response time. To satisfy these requirements, the efficient parallel processing of spatial joins has been required. In this paper, the efficient method for creating and allocating tasks to balance statically the load of each processor in a parallel spatial join is presented. A task graph is developed in which a vertex weight is calculated by the cost model I have proposed. Then, it is partitioned through a graph partitioning algorithm. According to the experiments in CC16 parallel machine, our method made an improvement in the static load balance by decreasing the variance of a task execution time on each processor.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.5
• /
• pp.1373-1382
• /
• 2014

This paper presents a hydraulic performance graph model in which the flow carrying capacity of a channel system was determined by accounting the interacting backwater effect among channel reaches and incoming lateral flow. The method utilizes hydraulic performance graphs (HPGs), and the method is applied to a natural channel Nakdong River to examine its applicability. This research shows that estimation results using HPG are close to records from the stage station and the results from a widely-accepted model, HEC-RAS. Assuming that a water level gage site is ungaged, water level estimations by HPGs compared with observation show that with a flood event, the HPGs underestimate in the water level ascension phase, but in the recession phase they overestimate results. The accuracy of estimation with HPGs was greatly improved by considering the time difference of flooding between the observation and estimation locations.

• Journal of the Korean Society for information Management
• /
• v.31 no.1
• /
• pp.231-250
• /
• 2014

Due to the recent development of Information and Communication Technologies (ICT), the amount of research publications has increased exponentially. In response to this rapid growth, the demand of automated text processing methods has risen to deal with massive amount of text data. Biomedical text mining discovering hidden biological meanings and treatments from biomedical literatures becomes a pivotal methodology and it helps medical disciplines reduce the time and cost. Many researchers have conducted literature-based discovery studies to generate new hypotheses. However, existing approaches either require intensive manual process of during the procedures or a semi-automatic procedure to find and select biomedical entities. In addition, they had limitations of showing one dimension that is, the cause-and-effect relationship between two concepts. Thus;this study proposed a novel approach to discover various relationships among source and target concepts and their intermediate concepts by expanding intermediate concepts to multi-levels. This study provided distinct perspectives for literature-based discovery by not only discovering the meaningful relationship among concepts in biomedical literature through graph-based path interference but also being able to generate feasible new hypotheses.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.72-77
• /
• 2014

There are two main technologies to implement cloud effect in flight simulator, cloud modeling using particle system and texture mapping. In former case, this approach may cause a low frame rate while unrealistic cloud effect is observed in latter case. To Solve this problem, in this paper, we propose how to apply fog effect into camera to display more realistic cloud effect with high frame rate. The proposed method is tested with massive terrain database environment through implemented software by using OpenSceneGraph. As a result, compared to texture mapping method, the degree of difference on frame rate is 1 or 2Hz while the cloud effect is significantly improved as realistic as particle system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.954-957
• /
• 2016

In cases of military communication plan, it often requires to find a proper solution for frequency assignment within feasible time. Minimizing the number of used resources are related to cost issue, hence it is a critical objective. When the dual polar antenna is used, the performance can be much developed by exploiting the polarization separation. In this paper, we propose an algorithm that assigns polarizations and frequencies within complexity of $O(N^2)$ based on the graph matching theory. We have verified that the proposed algorithm shows almost twice performance relative to the uni-polar frequency assignment algorithms and it approaches very closely to its theoretical optima.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.447-453
• /
• 2001

In this paper, we consider the scheduling of SE(switching element)-disjoint multicasting in photonic Banyan-type switching networks constructed with directional couplers. This ensures that at most, one connection holds each SE in a given time thus, neither crosstalk nor blocking will arise in the network. Such multicasting usually takes several routing rounds hence, it is desirable to keep the number of rounds(i.e., scheduling length) to a minimum. We first present the necessary and sufficient condition for connections to pass through a common SE(i.e., make crosstalk) in the photonic Banyan-type networks capable of supporting one-to-many connections. With definition of uniquely splitting a multicast connection into distinct subconnections, the crosstalk relationship of a set of connections is represented by a graph model. In order to analyze the worst case crosstalk we characterize the upper bound on the degree of the graph. The successor paper(Part II)[14] is devoted to the scheduling algorithm and the upper bound on the scheduling length. Comparison with related results is made in detail.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.10
• /
• pp.47-55
• /
• 1999

In this paper, a new function hazard elimination algorithm is proposed for asynchronous circuit synthesis. In previous approach, function hazard is eliminated by using state graph which is obtained from the state assignment on STG(signal transition graph) representing transition relationship among signals. These algorithms can use conventional hazard removal and synthesis method applied in synchronous system, but it has much computational complexity and takes much time to handle the state graph. Although some hazard elimination algorithm from STG were proposed, it could not reduce the area overhead due to the addition of new signals. The proposed algorithm eliminate function hazard directly on STG and also control the number of minterms and product-term of added signal in order to minimize the area overhead. Experimental results on benchmark data shows that overall circuit area after hazard elimination is decreased about 15% on the average than that of previous method.