• The Journal of the Korea Contents Association
• /
• v.4 no.4
• /
• pp.189-196
• /
• 2004

Most of the recent researches for ATM switches have been based on multistage interconnection network known as regularity and self-routing property. These networks can switch packets simultaneously and in parallel. However, they are blocking networks in the sense that packet is capable of collision with each other Mainly Banyan network have been used for structure. There are several ways to reduce the blocking or to increase the throughput of banyan-type switches: increasing the internal link speeds, placing buffers in each switching node, using multiple path, distributing the load evenly in front of the banyan network and so on. Therefore, this paper proposes the use of recirculating shuffle-exchange network to reduce the blocking and to improve hardware complexity. This structures are recirculating shuffle-exchange network as simplified in hardware complexity and Rank network with tree structure which send only a packet with highest priority to the next network, and recirculate the others to the previous network. after it decides priority number on the Packets transferred to the same destination, The transferred Packets into banyan network use the function of self routing through decomposition and composition algorithm and all they arrive at final destinations. To analyze throughput, waiting time and packet loss ratio according to the size of buffer, the probabilities are modeled by a binomial distribution of packet arrival. If it is 50 percentage of load, the size of buffer is more than 15. It means the acceptable packet loss ratio. Therefore, this paper simplify the hardware complexity as use of recirculating shuffle-exchange network instead of bitonic sorter.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.10
• /
• pp.709-718
• /
• 2016

The study considers viewpoints for qualitative improvement of landscape planning based on research literature, books and reports. By classifying items used in this study, evaluation criteria was derived for viewpoint selection using SPSS Statistics. In addition, we establish weights and prioritize viewpoints by measuring the relative importance within the hierarchical index. The analysis results are as follows: First, 16 viewpoints were determined using surveys from experts to establish specific and systematic plans for landscape simulation. Second, with respect to the medium classification level of viewpoint evaluation, the most important factor found was 'view' followed by 'publicness' and 'place.' Third, priority by viewpoint was found to exhibit the following order of relative importance: visual openness of viewpoint, favorability as view target, cultural property space, historicity, public place, gateway place, area where the target can be observed, thickly-populated or most-used place, place where various shapes of targets and surrounding landscape can be identified, ecological protection area, river and waterside area, viewing angle (relief-etching), viewing direction, major roads, distance between the viewpoint and the target, and plains and farmland. These results can contribute to developing systematic and reliable analysis frame for qualitative improvement of landscape planning and evaluating landscape simulation.

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.849-850
• /
• 2009

하드웨어와 소프트웨어의 통합설계를 이용한 시스템 개발에서는 하드웨어와 소프트웨어 요소가 가지는 비용, 개발 시간, 유연성, 재사용성, 수행성능과 같은 특징간 trade-off를 고려해야 한다. 개발조직에서는 통합설계 및 개발을 위한 릴리스 플랜 수립 시에 개념적 수준의 하드웨어/소프트웨어 분할 아키텍처 스타일 후보들을 도출하고, 요구사항 선택을 위해 도출된 후보들에 대한 상대적 중요도를 결정한다. 본 논문에서는 제품의 릴리스 플랜 수립을 목표로 우선순위에 기반한 아키텍처 스타일 우선순위 선정 프로세스를 제안한다. 이를 위해 하드웨어와 소프트웨어 요소 사이의 trade-off를 고려하여 우선순위를 결정한다. 개발조직의 이해당사자는 주어진 자원 및 제약사항 내에서 제품의 목표를 달성할 수 있도록 우선순위화를 통해 릴리스 플랜의 완성도를 높일 수 있다.

• Proceedings of the Korea Institute of Fire Science and Engineering Conference
• /
• 2011.04a
• /
• pp.447-452
• /
• 2011

산림 인접 시설은 산불의 발화원이자 주요 보호대상으로써, 이에 대한 관리와 소방 우선 순위의 결정은 인명과 재산의 보호를 위해 매우 중요하다고 할 수 있다. 본 연구에서는 이에 대한 설문조사를 실시하여 인접시설의 대상물과 우선순위에 대한 조사를 실시하였다. 설문조사결과 산불발생 취약대상에 대한 인지도는 높으나, 산불보호 대상에 대한 인지도는 낮으므로, 이에 대한 분류체계 수립과 교육이 필요하며, 산불관련 공무원들은 논밭두렁, 묘지, 과수원을 취약대상으로 인지하며, 문화재와 천연보호림을 보호대상으로 인식하고, 주요 피해 대상은 문화재와 주거 시설이라고 제시하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.489-492
• /
• 2011

SIP (Session Initiation Protocol)는 사용자간의 멀티미디어 세션의 초기화, 변경 및 종료를 위한 응용 계층의 시그널링 프로토콜이다. SIP는 실시간 멀티미디어 서비스 통신에 많이 이용되기 때문에 주로 Unreliable Transport Protocol을 사용한다. 따라서 손실된 SIP 메시지들의 신뢰성을 보장하기 위하여 재전송 메커니즘을 제공한다. 하지만 이러한 재전송 메커니즘은 SIP 프록시 서버가 과부하 상황일 경우 신뢰성보다는 오버헤드가 증가되는 문제점을 가진다. 기존의 여러 SIP 과부하 제어 방법이 제안되었지만 네트워크 혼잡이 증가함에 따라 프록시 서버의 처리율이나 호 설정 시간의 지연 문제를 효율적으로 해결하지 못한다. 본 논문에서는 SIP 시그널링 네트워크에서 프록시 서버가 과부하 상황일 경우 낮은 호 설정 지연시간과 높은 처리율을 위해 우선순위 스케줄링 기반의 과부하 제어 알고리즘을 제안한다. 그리고 기존 과부하 제어에서 사용하는 알고리즘과 제안하는 알고리즘을 비교하여 보았다. 성능 평가 결과 부하에 따른 프록시 서버의 처리율과 호 설정 시간의 지연 측면에서 기존의 과부하 제어 알고리즘보다 향상됨을 보였다.

• Journal of KIISE
• /
• v.44 no.8
• /
• pp.782-790
• /
• 2017

The service, 'Hot Search Keywords', provides a list of the most hot search terms of different web services such as Naver or Daum. The service, bases the changes in rank of a specific search keyword on changes in its users' interest. This paper introduces a temporal modelling framework for predicting the rank change of hot search keywords using past rank data and machine learning. Past rank data shows that more than 70% of hot search keywords tend to disappear and reappear later. The authors processed missing rank value, using deletion, dummy variables, mean substitution, and expectation maximization. It is however crucial to calculate the optimal window size of the past rank data. We proposed an optimal window size selection approach based on the minimum amount of time a topic within the same or a differing context disappeared. The experiments were conducted with four different machine-learning techniques using the Naver, Daum, and Nate 'Hot Search Keywords' datasets, which were collected for 2 years.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.6
• /
• pp.261-268
• /
• 2015

In spoken chatting systems, users'spoken queries are converted to text queries using automatic speech recognition (ASR) engines. If the top-1 results of the ASR engines are incorrect, these errors are propagated to the spoken chatting systems. To improve the top-1 accuracies of ASR engines, we propose a post-processing model to rearrange the top-n outputs of ASR engines using a ranking support vector machine (RankSVM). On the other hand, a number of chatting sentences are needed to train chatting systems. If new chatting sentences are not frequently added to training data, responses of the chatting systems will be old-fashioned soon. To resolve this problem, we propose a data collection model to automatically select chatting sentences from TV and movie scenarios using a support vector machine (SVM). In the experiments, the post-processing model showed a higher precision of 4.4% and a higher recall rate of 6.4% compared to the baseline model (without post-processing). Then, the data collection model showed the high precision of 98.95% and the recall rate of 57.14%.

• KOREAN JOURNAL OF PACKAGING SCIENCE & TECHNOLOGY
• /
• v.24 no.3
• /
• pp.131-140
• /
• 2018

As global environmental problems become more serious, bio plastic suppliers in developed countries are expected to drive demand for eco friendly packaging materials due to recycling regulations and consumer's attention. To catch up with this demand, various types of bio plastics have been introduced using plants such as corn and domestic companies are increasingly interested in this. Industrial interest in bio plastics is increasing to solve the recent environmental problems. The critical disadvantages of the weak mechanical strength and expensive product cost were gradually solved by extensive researches. In order to promote the active use of bio plastics, countries around the world are operation certification marks and standard systems. In this article, we have summarized recent trends in domestic and overseas bio plastics regulations, certification marks and identification labels.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.11
• /
• pp.1225-1230
• /
• 2015

MAC protocol for WBAN performs CSMA/CA(:Carrier Sense Multiple Access with Collision Avoidance)algorithm that handles traffic which occurs in emergency with top priority in order to deal with variable data of sensor node for medicine. Emergency message that node sends undergoes collision and delay of transmission by retransmission of emergency message and waste of energy by retransmission. This paper suggests algorithm that minimizes loss of frame caused by collision and applies different backoff parameters by setting order of priority between MAC instruction frame and data frame in CSMA/CA algorithm case which applies order of priority queuing to improve aforementioned problem. According to performance evaluation, it has been found that using suggested MAC protocol showed lower collision probability, higher packet transmission processing ratio and lower packet loss compared with using IEEE 802.15.6.