• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.01a
• /
• pp.91-93
• /
• 2020

본 연구는 항공 종사자를 대상으로 조직갈등에 대한 구성원의 이직의도를 파악하였다. 설문 대상은 아시아나항공, 대한항공, LCC로 부산 김해국내/국제공항과 서울 김포공항, 인천 국제공항 내에서 주로 예약발권, 탑승수속, 출도착, 카운터 등의 업무를 담당하는 지상직원이고, 2018년 8월20일~2016년 10월 16일 동안 400부의 설문이 진행되었고 그 중 회수되지 않거나 응답이 불성실한 설문지를 제외하고 총 227부를 최종분석에 이용하였다. 수집된 자료는 SPSS 22을 이용하여 신뢰도 분석과 상관관계를 이용하였고, AMOS 18을이용하여 확인적 요인분석, 측정모델 분석 및 제안모델 분석 등을 검정하였고, 추가로 대안모델 개발을 하였다. 분석을 위해 SPSS 18과 AMOS 18을 이용하였고, 신뢰도 분석을 위해Crombach's Alpha와 변수 간의 인과관계 파악을 위해 측정변수모델(SEM)을 이용하였으며, 추가분석으로 갈등(역할갈등, 상사부하간갈등)과 이직의도간의 관계에서 셀프리더십의매개효과를 검정하였다. 본 연구에서 설정된 가설은 총 4개로 연구결과를 기초로 결론과 시사점, 그리고 본 연구의 한계점과 향후 연구의 방향을 제시하고자한다.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.29-37
• /
• 2000

Asynchronous transfer mode is flexible to support multimedia communication services using asynchronous time-sharing and statistical multimedia techniques to the existing data communication area, ATM ABR service controls network traffic using feedback information on the network congestion situation in order to guarantee the demanded service qualities and the available cell rates, In this paper we apply the control method using queue length prediction to the formation of feedback information for more efficient ABR traffic control. If backward node receive the longer delayed feedback information on the impending congestion, the switch can be already congested from the uncontrolled arriving traffic and the fluctuation of queue length can be inefficiently high in the continuing time intervals, The feedback control method proposed in this paper predicts the queue length in the switch using the slope of queue length prediction function and queue length changes in time-series, The predicted congestion information is backward to the node, NLMS and neural network are used as the predictive control functions, and they are compared from performance on the queue length prediction. Simulation results show the efficiency of the proposed method compared to the feedback control method without the prediction, Therefore, we conclude that the efficient congestion and stability of the queue length controls are possible using the prediction scheme that can resolve the problems caused from the longer delays of the feedback information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.681-688
• /
• 2008

In this paper, we propose a new price-based call admission control algorithm for multi-class communication networks. When a call arrives at the network, it informs the network of the number of requested circuits and the minimum amount of time that it will require. The network provides the optimal price for the arrived call with which it tries to maximize its expected revenue. The optimal price is dynamically adjusted based on the information of the arrived call, and the present and the estimated future congestion level of the network during the reservation time of the call. If the call accepts the price, it is admitted. Otherwise, it is rejected. We compare the performance of our dynamic pricing algorithm with that of the static pricing algorithm by Courcoubetis and Reiman [1], and Paschalidis and Tsitsiklis [2]. By the comparison, we show that our dynamic pricing algorithm has better performance aspects such as higher call admission ratio and lower price than the static pricing algorithm, although these two algorithms result in almost the same revenue as shown in [2]. This implies that, in the competitive situation, the dynamic pricing algorithm can attract more users than the static pricing algorithm, generating more revenue. Moreover, we show that if a certain fixed connection fee is introduced to the price for a call, our dynamic pricing algorithm yields more revenue.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.7
• /
• pp.297-306
• /
• 2017

Citizens want more accurate forecast information using Bus Information System. However, most bus information systems that use an average based short-term prediction algorithm include many errors because they do not consider the effects of the traffic flow, signal period, and halting time. In this paper, we try to improve the precision of forecast information by analyzing the influencing factors of the error, thereby making the convenience of the citizens. We analyzed the influence factors of the error using BIS data. It is shown in the analyzed data that the effects of the time characteristics and geographical conditions are mixed, and that effects on halting time and passes speed is different. Therefore, the halt time is constructed using Generalized Additive Model with explanatory variable such as hour, GPS coordinate and number of routes, and we used Hidden Markov Model to construct a pattern considering the influence of traffic flow on the unit section. As a result of the pattern construction, accurate real-time forecasting and long-term prediction of route travel time were possible. Finally, it is shown that this model is suitable for travel time prediction through statistical test between observed data and predicted data. As a result of this paper, we can provide more precise forecast information to the citizens, and we think that long-term forecasting can play an important role in decision making such as route scheduling.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.2
• /
• pp.113-127
• /
• 2018

This study develops a fusion priority signal control algorithm to pass without delay in emergency events. Fusion priority signal control is method combined center control with local control. The center control method applies signal times for each signalized intersection on the emergency vehicle's route when an emergency call is received. As signals are controlled before the emergency vehicle leaves for its destination, it is possible to clear the queues at each intersection more effectively. However, since the traffic information (speed, position) of the real-time emergency vehicle is not used, the intersection arrival time predicted by center control and actual arrival time of the emergency vehicle may be different from each other. In the case, it is possible to experience a delay caused by the signal. Local control method operate priority signal use the real-time information of EV, but there is a limitation that queue elimination time can not be reflected. In this study, fusion(center+local) control algorithm is proposed to compensate the disadvantages of center and local control also maximizing its advantages. Proposed algorithm is expected to decrease delay time of EV in emergency situation.

• The Journal of the Korea Contents Association
• /
• v.14 no.10
• /
• pp.562-569
• /
• 2014

The purpose of this study was to investigate the determinants of total payment for mental and behavioral disorders patients admitted through the emergency room. Study data was selected from the Korean National Health Insurance sample data in 2009. This data was consisted of 753 inpatients who are 331 inpatients with only main sick(F31-F39) and 422 inpatients with main sick codes(F31-F39) and sub sick(F00-F99) admitted through the emergency room. SPSS v.18 was used for the statistical analysis such as descriptive analysis, t-test, ANOVA, and multiple regression analysis. In multiple regression analysis, significant variables affecting total payment of main sick patients were gender(p<.01), treatment result(p<.001), path of the emergency room(p<.001), and length of stay(p<.001). Also, main sick patients with sub sick were gender(p<.01), age(p<.001), treatment result(p<.001), path of the emergency room(p<.001), and length of stay(p<.001). These findings implied that it is necessary to build short, middle, and longterm program and system for high risk mental and behavioral disorders groups.

• Journal of IKEEE
• /
• v.14 no.1
• /
• pp.25-32
• /
• 2010

In this paper, we analyze the location accuracy of real-time locating systems (RTLS) in multipath environments, where the RTLS complies with an ISO/IEC 24730-2 international standard. RTLS readers should have an ability not only to recover the transmitted signal but also provide arrival timing information from the received signal. In the multipath environments, in general, the transmitted signal goes through both direct and indirect paths, and then it becomes some distorted form of the transmitted signal. Such multipath components have a critical effect on deciding the first arrival timing of the received signal. To analyze the location error of the RTLS in the multipath environments, we assume two multipath components without considering an additive white Gaussian noise. Through the simulation and real test results, we confirm that the location error does not occur when the time difference between two paths is more than 1.125Tc, but the location error of about 2.4m happens in case of less than 0.5Tc. In particular, we see that the resolvability of two different paths depends largely on the phase difference for the time difference of less than 1Tc.

• The Journal of the Korea Contents Association
• /
• v.10 no.3
• /
• pp.44-52
• /
• 2010

The most popular world wide web traffic in the Internet uses TCP as the transport layer protocol. Since TCP utilizes the single path, it can not communicate with the correspondent host during the link-down. On the other hand, SCTP can still communicate with the other SCTP entity by using alternate path even while the primary path is down. Most of previous studies have conducted the performance comparison research between TCP and SCTP by using typical file transfer. Since web traffic with self-similarity is characterized by the packet inter-arrival times and shape parameter affecting the size of web file in the Pareto distribution, it is necessary to perform the experiments considering these parameters. This paper aims to compare the throughput between TCP and SCTP while varying parameters reflecting the web traffic characteristics in link-down environment. Experimental results for web traffic using NS-2 simulator show that the throughput of SCTP using multi-homing is better than that of TCP. Simulation also shows that TCP is more affected than SCTP by mean inter-arrival and shape parameters with regard to the web traffic. These results can be applied to estimate the performance variation of web traffic due to the duration of link-down.

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.4
• /
• pp.37-44
• /
• 2012

There are approximately 25,724 shelters to which people can be quickly evacuated for safety in case of emergency across the nation, and Seoul has about 3,870 shelters. Those nationwide shelters are located at a point within a five-minute radius for quick evacuation. Seoul's shelter capacity can hold 285% of its population. The problem is, however, that there is no knowing how many shelters are reachable within five minutes when considering walking speed according to individual differences in age, height, health state, and physical condition. In addition, available service areas become different according to the spatial allocation and distribution of shelters with possible vulnerable points. This study thus defined the pedestrian walking speed at 1m/s, 1.3m/s, and 2m/s by reviewing previous studies and conducted network analysis of the Location Allocation Model with the designated shelters and road networks in Seoul. The results identified the shelter service and vulnerable areas in each administrative district of Seoul according to walking speeds. It was analyzed that the vulnerable areas in which the elderly could not reach a shelter were more than twice as big as those of adult men and women with a fast walking speed.

• Journal of the Economic Geographical Society of Korea
• /
• v.18 no.4
• /
• pp.539-555
• /
• 2015

This study proposes the methodology for measuring the time-distance accessibility on the Seoul bus system based on the T-card transaction databases and analyzes the results. T-card transaction databases contain the time/space information of each passenger's locations and times of the departure, transfers, and destination. We introduce the bus network graph and develop the algorithms for time-distance accessibility measurement. We account the average speed based on each passenger's get-in and getoff information in the T-card data as well as the average transfer time from the trip chain transactions. Employing the modified Floyd APSP algorithm, the shortest time distance between each pair of bus stops has been accounted. The graph-theoretic nodal accessibility has been given by the sum of the inverse time distance to all other nodes on the network. The results and spatial patterns are analyzed. This study is the first attempt to measure the time-distance accessibility for such a large transport network as the Seoul bus system consists of 34,934 bus stops on the 600 bus routes, and each bus route can have different properties in terms of speed limit, number of lanes, and traffic signal systems, and thus has great significance in the accessibility measurement studies.