• Journal of the Society of Disaster Information
• /
• v.18 no.1
• /
• pp.29-37
• /
• 2022

Purpose: The purpose of this research is to develop an evaluation index for reliable information provision and operation management of traffic safety facilities. Method: As for the analysis method, evaluation indicators were selected by grasping the current state of operation and management of traffic safety facilities, and the importance of each indicator was analyzed through the AHP survey. Result: As a result of the comprehensive importance analysis, it was found that the highest priority was given in the evaluation index for information accuracy and computer system construction. On the other hand, the evaluation index corresponding to the service management was analyzed as having the lowest priority. Conclusion: The results of this study are expected to serve as a yardstick for understanding the management level of each institution for efficient operation and management of traffic safety facilities, and it is expected to establish a foundation for providing accurate information in consideration of the commercialization of autonomous driving in the future.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4405-4418
• /
• 2016

Automatic image completion techniques have difficulty processing images in which the target region has multiple planes or is non-facade. Here, we propose a new image completion method that uses belief propagation based on planar priorities. We first calculate planar information, which includes planar projection parameters, plane segments, and repetitive regularity extractions within the plane. Next, we convert this planar information into planar guide knowledge using the prior probabilities of patch transforms and offsets. Using the energy of the discrete Markov Random Field (MRF), we then define an objective function for image completion that uses the planar guide knowledge. Finally, in order to effectively optimize the MRF, we propose a new optimization scheme, termed Planar Priority-belief propagation that includes message-scheduling-based planar priority and dynamic label cropping. The results of experiment show that our approach exhibits advanced performance compared with existing approaches.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.689-692
• /
• 2008

Hierarchical modulation has been considered for achieving higher data rates in Terrestrial-DMB(T-DMB) systems. And for achieving a higher data rates transmission, the low-priority (LP) data, which is used to carry additional data, such as video data, audio data and textual data, should be perfectly decoded in a certain value of $E_b/N_o$. Unfortunately, the man-made noise badly affects the high-priority (HP) symbol, which is used to carry the conventional data in the existed T-DMB system; and since the advanced T-DMB system is proposed to fit for the legacy T-DMB receivers, the low-priority symbols in the hierarchical modulation are much worse affected by the neighbors, who are both in the same quadrant. Because of the feature that mentioned previously, the turbo code has been considered to deal with the LP data. And due to the degradation which caused by the shortened symbol distance, the error performance of LP data is not sufficient by only using the turbo code. In this paper, we propose a Reed-Solomon code used outside of turbo code, and with the turbo code, it becomes a concatenated code. In this paper, there are some simulation results, within the comparison of those performances, we can see how a Reed-Solomon code is utilized for degradation of error performance which is caused by the hierarchical constellation, and how to design a Reed-Solomon code which is suitable for improving the degradation of error performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7B
• /
• pp.433-439
• /
• 2005

In this paper, we propose a Flow Based Waiting Time Priority (FB-WTP) scheduler that supports the proportional delay differentiated services between classes. Existing scheduling algorithms utilize the configuration of scheduler, which is operated as class unit, applied to wired network. However, FB-WTP scheduler is operated as flow unit and can take advantage of multi-flow diversity effect in time-varying channel state environment. As a result, FB-WTP improves the average queueing delay on each class as well as supporting the average queueing delay ratio between classes. It also solves the HOL packet blocking problem implicitly. Simulation results show that FB-WTP scheduler has better system queueing delay performance than Look-ahead Waiting Time Priority (LWTP) scheduler and supports the larger queueing delay ratio between classes that network operator set.

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

In this paper, we propose a transmission scheme to reduce energy consumption on wireless multi-channel sensor networks. This proposed scheme differentiates the number of usable channels based on a priority. Sensor nodes consume the most energy to transmit data. Also, as transmission distance is far, they consume the more energy. Therefore retransmission due to transmission failure of sensor nodes that are long transmission distance is required more energy consumption. In this paper, we provide a stable transmission environment by allocating a high priority for data that is sent far away. The received data with a high priority is more allocated the number of usable channels. In the experiment results, the receiving failure probability and the restransmission energy consumption of proposed scheme is superior to ones of comparison scheme.

• Journal of Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.339-346
• /
• 1999

When a multicast video conference system utilizes RTP (Real Time Protocol) and RTCP (Real Time Control Protocol), the loss rate and the synchronization of transfer in RTCP affect the scalability of the system. The random delay technique introduced to resolve the problems is so simple that leads the network to meet some congestion in synchronizing feedback information when lots of people transfer the feedback information simultaneously, which reduces the scalability of system. In this paper, we propose a new feedback control algorithm that provides priority levels with the RTCP packet, which cuts down the feedback delay and increases the scalability. The criteria of providing priority Based on the decided priority level, Agent forced the session participants to provide much more RTCP packets, positively controlled, and the possible bandwidth can be measured. The simulation on this technique decreases the delay, and the feedback messages are equally distributed on a given time period.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.191-199
• /
• 1996

In this paper, We assume that the closed computer system model composed of multiprocessor system is analyzed by BCMP queueing network theory with priority levels. In this system that contains terminals, processors and I/O devices, We show maximum throughput and the number of active terminals in the optimum multiprogramming levels. It is compared the performance with the other. In the result, it is obtained the optimum number of processors and active terminals. Therefore, the system model consisted of the optimum number of processor and multiprogramming level m is analyzed by the servers with a priority level. Each server is applied to the type of server which is characterized terminal, processor I/O device etc.. This model is analyzed by the server with a probability ditribution. Ideal state is proposed by the modeling for priority levels. Finally, we try to increase the performance in overload system.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.1-10
• /
• 2004

This study discusses Application-layer FEC using erasure codes. Because of the simple decoding process, erasure codes are used effectively in Application-layer FEC to deal with Packet-level errors. The large number of parity packets makes the loss rate to be small, but causes the network congestion to be worse. Thus, a redundancy control algorithm that can adjust the number of parity packets depending on network conditions is necessary. In addition, it is natural that high-priority frames such as I frames should produce more parity packets than low-priority frames such as P and B frames. In this paper, we propose a redundancy control algorithm that can adjust the amount of redundancy depending on the network conditions and depending on data priority, and test the performance in simple links and congestion links.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.5
• /
• pp.425-432
• /
• 2014

The Enhanced Distributed Channel Access (EDCA) function of IEEE 802.11e standard defines contention window (CW) for different Access Category (AC) limits to support Quality-of-Service (QoS). However, it have been remained the problem that the collision probability of transmission is increasing in congested network. Several different solutions have been proposed but the collision occurs among same priority queue within the same station to compete the channel access. This paper presents an APCA (Advanced Priority Collision Avoidance) algorithm for EDCA that increases the throughput in saturated situation. The proposed algorithm use reserved field's bits of FC(Frame Control) using IEEE 802.11e standard's RTS/CTS (Request to Send / Clear to Send) mechanism to avoid data collision. The simulation results show that the proposed algorithm improves the performance of EDCA in packet loss. Using Jain's fairness index formula, we also prove that the proposed APCA algorithm achieves the better fairness than EDCA method under network congested condition.

• Culinary science and hospitality research
• /
• v.23 no.5
• /
• pp.58-66
• /
• 2017

The purpose of this study was to assess priority of educational needs for the development of curriculum based on key competencies of NCS for departments related to culinary arts in a 2-year college. In order to achieve this objective, the survey has been distributed to cooks working in hotel restaurants or restaurant companies by social network service and a total of 360 responses were analyzed excluding 18 responses. The collected surveys were analysed by using paired t-test, Borich's needs analysis and the locus for focus analysis. The results of this study were as follows. First, the difference between the level of importance and present level about key competencies recognized by cooks working in restaurant company was statistically significant in 9 fields of key competencies excluding mathematical competence. The difference recognized by cooks working in hotel was statistically significant in all 10 fields of key competencies. Second, the results of Borich's needs assessment showed that the education needs of problem solving competence were the highest, followed by interpersonal, resource management, communication, information competence. Finally, considering both Borich's needs assessment and the locus for focus analysis, cooks working in hotel restaurants recognized that educational needs of communication, interpersonal, problem-solving, information competence were the top priority, and cooks working in restaurant companies recognized that educational needs of communication, interpersonal, skill, resource management competence were the top priority. Therefore, it is necessary to develop curriculum for culinary arts specialists based on key competence of top priority.