• Journal of the Korean Institute of Landscape Architecture
• /
• v.24 no.1
• /
• pp.42-54
• /
• 1996

Many of urban parks which have been designated for urban planning regulation are not well developed because the priority of investment is inferior to that of other public facilities. Park development is an urgent urban policy and it is hard to decide priority among parks. Therefore, it is necessary to evaluate the priority of park development. Thus the Analytic Hierarchy Process has been introduced because it is suitable for achieving objectivity by collecting the professional opinions. The goals of park development are evaluated by AHP method and the priorities among goals are conservation of natural environment, satisfying the residents' residents' needs, population density, regional pollution, land acquisition cost, ratio of greeneries and facilities within park areas. Priority of park development is decided by the standardization of each individual inventory data and considering of the professional opinions. Among the multi-attribute judgement methods, AHP method may be the most widely used. Despite the critical evaluations of the AHP, such as limitation of the nine-point scale and the rank reversal problem, application of AHP to decide the priority of park development is suitable for actual circumstances.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.237-239
• /
• 2004

Wireless LAN Voice over IP(VoIP) equipment needs Quality-of-Service(QoS) with priority for processing real-time traffic. This paper shows transmit function implementation of wireless LAN(WLANs) media access control(MAC) support VoIP, and it has an advantage of guarantee of QoS and is adaptable to VoIP or mobile wireless equipment. The IEEE 802.11e standard in progress has four queues according to four access categories(AC) for transmit and the MAC transmits the data based on EDCA. The value of AC is from AC0 to AC3 and AC3 has the highest priority. The transmit method implemented at this paper ensure QoS using one transmit FIFO in hardware since real-time traffic data and non real-time traffic data has the different priority. The device driver classifies real-time data and non real-time data and transmit data to hardware with information about data type. The hardware conducts shorter backoff and selects faster AIFS slot for real-time data than it for non real-time data. Therefor It make give the real-time traffic data faster channel access chance than non real-time data and enhances QoS.

• 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.

• Journal of Korean Society for Quality Management
• /
• v.43 no.2
• /
• pp.127-140
• /
• 2015

Purpose: To obtain the area for improvement, the Importance-Performance analysis(IPA) uses relatively simple questions, that is, satisfaction and importance at attribute level. However, no attempt has been made to consider the gap between own company's performance and those of competitors in IPA, in the field of quality management. This study is aimed to suggest a new prioritizing method for improvement and to test for validity of the proposed technique. Methods: This study used data collected from Song and Lim(2015), which is satisfaction of employees, customers and competitors as well as importance data for 7 quality attributes of K animal hospital. A correlation comparison with other priority methods such as Bacon(2003)'s model and Matzler and Hinterhuber(1998)'s QI index is conducted. Results: The priority results by the proposed method shows better in correlation coefficient with customer perceived priority for improvement than other methods. Conclusion: From the result of the current study, it can be concluded that the result of the proposed method is valid, while it is relatively easy to understand and analyze, and therefore no additional survey is necessary for improvement priority.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.72-78
• /
• 2002

The distance join is a spatial join which finds data pairs in the order of distance between two spatial data sets using R-trees. The distance join stores node pairs in a priority queue, which are retrieved while traversing R-trees in a top-town manner, in the order of distance. This paper first shows that a priority strategy for the tied pairs in the priority queue during distance join processing has much effect on its performance, and then proposes an optimized secondary priority method. The experiments show that the proposed method is always better than the other methods in the performance perspectives.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.2
• /
• pp.29-34
• /
• 2019

Priority queues, one of the fundamental data structures, have been studied for a long time by computer scientists. This paper proposes an implicit double-ended priority queue, called IMI-heap, in which insert operation takes constant amortized time and each of removal operation of the minimum key or the maximum key takes O(logn) time. To the author's knowledge, all implicit double-ended priority queues that have been published, perform insert, removeMin and removeMax operations in O(logn) time each. So, the proposed IMI-heap is superior than the published heaps in terms of insertion time complexity.The abstract should concisely state what was done, how it was done, principal results, and their significance.

• Journal of Multimedia Information System
• /
• v.6 no.4
• /
• pp.239-244
• /
• 2019

With the development of Cyber-Physical Systems(CPS), several technologies such as automation control, automotive and intelligent house systems have been developed. To enable communication among various components of such systems, several wired and wireless communication protocols are used. The Controller Area Network(CAN) is one of such wired communication protocols that is popularly used for communication in automobiles and other machinery in the industry. In this paper, we designed and implemented a response time analysis system for CAN communication. The reliable data transfer among various electronic components in a significant time is crucial for the smooth operation of an electric vehicle. Therefore, this system is designed to conveniently analyze the response time of various electronic components of a CAN enabled system. The priority for transmission of the messages in the CAN bus is determined by the message identifier. As the number of nodes increases the transmission of low priority messages is delayed due to the existence of higher priority messages on the bus. We used Raspberry Pi3 and PiCAN2 board to simulate the data transfer for studying the comparative delay in low priority nodes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.237-252
• /
• 2017

In recent years, data centers have become the core infrastructure to deal with big data processing. For these big data applications, network transmission has become one of the most important factors affecting the performance. In order to improve network utilization and reduce job completion time, in this paper, by real-time monitoring from the application layer, we propose job-aware priority scheduling. Our approach takes the correlations of flows in the same job into account, and flows in the same job are assigned the same priority. Therefore, we expect that flows in the same job finish their transmissions at about the same time, avoiding lagging flows. To achieve load balancing, two approaches (Flow-based and Spray) using ECMP (Equal-Cost multi-path routing) are presented. We implemented our scheme using NS-2 simulator. In our evaluations, we emulate real network environment by setting background traffic, scheduling delay and link failures. The experimental results show that our approach can enhance the Hadoop job execution efficiency of the shuffle stage, significantly reduce the network transmission time of the highest priority job.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.959-962
• /
• 2003

At the processing capabilities and operating frequency of embedded system are growing, so is the needed data bandwidth to fully utilize the processing capability. The ability to transfer huge amount of data between the embedded core and external devices is required for efficient system operation. In this paper, the data communication architecture for the mixed-clock system is proposed. The dynamic priority adaptation algorithm for bus arbitration is proposed for bandwidth guarantee. The communication architecture that incorporates the proposed arbitration algorithm adapts the priority of communication components dynamically based on the information from FIFO. The experiments show that the measured bandwidth of each component traces the required bandwidth well compared to the other arbitration algorithms

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2A
• /
• pp.187-194
• /
• 2004

We propose priority-based reservation code multiple access (P-RCMA) which can enhance voice traffic quality of the previous RCMA. The proposed protocol maintains two power levels and consider traffic characteristics in contending shared available codes to transmit packets. P-RCMA gives priority to the voice request packets rather than data packets by capture effect at the receiver part of base station. We show numerical results from EPA (equilibrium point analysis) analysis and simulation study in terms of voice packet dropping probability and average data packet transmission delay.