• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3684-3693
• /
• 2000

In this paper, performance of a nonblocking high speed packet switch with switching capacity m which adopts a dynamic priority control function (DPCF) of a threshold- based Bernoulli priority jump (TBPJ) scheme is considered. Each input queue has two separate buffers with different sizes for two classes of traffics, delay-sensitive and loss-sensitive traffics, and adopts a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Under the TBP] scheme, a head packet of the delay-sensitive traffic buffer goes into the loss -sensitive traffic buffer with Hernoulli probability p according to systems states that represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. In addition to, TBP] scheme shows better performance than that of HOL scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1305-1313
• /
• 2010

Last few years, wireless personal area network (WPAN) has been widely researched for various healthcare applications. Due to restriction of device hardware (e.g., energy and memory), we need to design a highly-versatile MAC layer protocol for WBAN (Wireless Body Area Network). In addition, when an emergency occurs to a patient, a priority mechanism is necessitated for a urgent message to get through to the final destination. This paper presents a priority mechanism referred to as hybrid priority MAC for WBAN. Through extensive simulation, we show the proposed MAC protocol can minimize the average packet latency for urgent data. Thus, when patients have an emergency situation, our MAC allows adequate assistance time and medical treatment for patients. The simulation based on NS-2 shows that our Hybrid Priority MAC has the good performance and usability.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.20 no.3
• /
• pp.20-33
• /
• 2021

Modern society is steadily implementing policies to encourage public transportation to cope with the growing traffic demand on limited roads. The expectation is rising for transit signal priority to ensure the speed of buses as the installation of the bus rapid transit(BRT) expands nationwide to secure the competitiveness of buses. On the other hand, the form of BRT stops without considering some aspects of bus operation may increase the number of stops on the bus, thereby reducing the effectiveness of bus signal priority applications. This study suggests the type of bus stop to increase the operation efficiency of buses by analyzing the bus signal priority effect according to the BRT station type using Hannuri-daero, Sejong. The bus signal priority is used to maximize the two-way bandwidth of passenger cars and buses. As a result of the application, the effectiveness of the bus signal priority at the stop causing the double stop of the bus was reduced drastically, and the efficiency of the bus signal priority was increased significantly after improvement. These results are expected to be used as basic data in the form of proper bus stops considering the aspects of traffic operation when designing BRT stops in new towns in the future.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2543-2554
• /
• 2000

Packet schedulers for real-time communication must provide bounded delay and efficient use of network resources such as bandwidth, buffers and so on. In order to satisfy them, a large number of packet scheduling methods have been proposed. Among packet scheduling methods, an EDF (Earliest Deadline First) scheduling is the optimal one for a bounded delay service. A disadvantage of EDF scheduling is that queued packets must be sorted according to their deadlines, requiring a search operation whenever a new packet arrives at the scheduler. Although an RPQ (Rotating Priority Queue) scheduler, requiring large size of buffers, does not use such operation, it can closely approximate the schedulability of an EDF scheduler. To overcome the buffer size problem of an RPQ scheduler, this paper proposes a new scheduler named MRPQ (Multiple Rotating Priority Queue). In a MRPQ scheduler, there are several layers with a set of Queues. In a layer, Queues are configured by using a new strategy named block Queue. A MRPQ scheduler needs nearly half of buffer size required in an RPQ scheduler and produces schedulability as good as an RPQ scheduler.

• Knowledge Management Research
• /
• v.22 no.1
• /
• pp.57-84
• /
• 2021

In this paper, we explore market and environmental factors which affecting organization's priority claim application which is more powerful and prompt strategic method to protect technology from competitors under uncertain and volatile environments. This study empirically examines why organizations strategically choose the priority claim application which is more strong tactics to protect technology as the source of sustainable competitive advantage. We suggest that market and environmental factors, such as exogenous shock, volatility, and uncertainty, may also affect strategic decision that organization take patent application with claiming priority. The results of our analysis of priority claim application in the Korean high-tech electronics industry from 1994 to 2008 showed that these three strategic factors affected the technology protection decision and organization's status also moderate theses effects, as predicted in our hypotheses.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.37-40
• /
• 2011

리눅스 운영체제는 처리율(throughput)을 보장하는 것을 우선으로 하고 있으며, 태스크들의 응답시간을 보장하지는 않기 때문에 실시간 처리가 필요한 경우에는 적용하기 어렵다. 이러한 문제를 해결하기 위해 RT 패치는 선점형 커널, 인터럽트 쓰레드화, 뮤텍스의 도입 등을 통해 리눅스의 실시간 처리를 지원한다. 그러나 RT 패치는 우선순위 상속만을 지원하기 때문에, 뮤텍스의 스핀락 대체로 인한 데드락 문제를 야기할 수 있다. 본 논문에서는 이를 해결하기 위하여 PCP(Priority Ceiling Protocol)의 변형인 ICPP(Immediate Ceiling Priority Protocol)을 RT 패치에 통합되도록 구현하고, 그 성능을 분석한다.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.256-261
• /
• 2007

본 논문은 이미지 완성(Image Completion)을 위한 근사적 에너지 최적화 알고리즘을 제안한다. 이미지 완성이란 이미지의 특정영역이 지워진 상태에서, 그 지워진 부분을 나머지 부분과 시각적으로 어울리도록 완성시키는 기법을 말한다. 본 논문에서 이미지 완성은 유사-확률적(pseudo-probabilistic) 시스템인 Markov Random Field로 모델링된다. MRF로 모델링된 이미지 완성 시스템에서 사후 확률(posterior probability)을 최대로 만드는 MAP(Maximum A Posterior) 문제는 결국 시스템의 전체 에너지를 낮추는 에너지 최적화 문제와 동일하다. 본 논문에서는 MRF의 최적화 알고리즘들 중에서 Belief Propagation 알고리즘을 이용한다. BP 알고리즘이 이미지 완성 분야에 적용될 때 다음 두 가지가 계산시간을 증가시키는 요인이 된다. 첫 번째는 완성시킬 영역이 넓어 MRF를 구성하는 정점의 수가 증가할 때이다. 두 번째는 비교할 후보 이미지 조각의 수가 증가할 때이다. 기존에 제안된 Priority-Belief Propagation 알고리즘은 우선순위가 높은 정점부터 메시지를 전파하고 불필요한 후보 이미지 조각의 수를 제거함으로써 이를 해결하였다. 하지만 우선순위를 정점에 할당하기 위한 최초 메시지 전파의 경우 Belief Propagation의 단점은 그대로 남아있다. 이를 개선하기 위해 본 논문에서는 이미지 완성을 위한 MRF 모델을 피라미드 구조와 같이 층위로 나누어 정점의 수를 줄이고, 계층적으로 메시지를 전파하여 시스템의 적합성(fitness)을 정교화 해나가는 Hierarchical Priority Belief Propagation 알고리즘을 제안한다.

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.11-22
• /
• 2004

A distributed constraint satisfaction problem (distributed CSP) is a constraint satisfaction problem(CSP) in which variables and constraints are distributed among multiple automated agents. ACSP is a problem to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI (Distributed AI) that are concerned with finding a consistent combination of agent actions can be formalized as distributed CAPs. In recent years, many new backtracking algorithms for solving distributed CSPs have been proposed. But most of all, they have common drawbacks that the algorithm assumes the priority of agents is static. In this thesis, we establish a basic algorithm for solving distributed CSPs called dynamic priority search algorithm that is more efficient than common backtracking algorithms in which the priority order is static. In this algorithm, agents act asynchronously and concurrently based on their local knowledge without any global control, and have a flexible organization, in which the hierarchical order is changed dynamically, while the completeness of the algorithm is guaranteed. And we showed that the dynamic priority search algorithm can solve various problems, such as the distributed 200-queens problem, the distributed graph-coloring problem that common backtracking algorithm fails to solve within a reasonable amount of time. The experimental results on example problems show that this algorithm is by far more efficient than the backtracking algorithm, in which the priority order is static. The priority order represents a hierarchy of agent authority, i.e., the priority of decision-making. Therefore, these results imply that a flexible agent organization, in which the hierarchical order is changed dynamically, actually performs better than an organization in which the hierarchical order is static and rigid. Furthermore, we describe that the agent can be available to hold multiple variables in the searching scheme.

• Analytical Science and Technology
• /
• v.11 no.4
• /
• pp.297-304
• /
• 1998

The three analysis methods, EPA method 3050, the method offered by Ministry of Environment in Korea, and modified method corrected in this laboratory, were studied to investigate the effect of matrix on the analysis of inorganic priority pollutants. 7 inorganic priority pollutants(Ni, Cr, Cu, Zn, Pb, Cd, Hg) were spiked to the plating, leather, paper, electric, and dye sludges. Mean recovery of the elements except Hg was 95.5% when the procedure of EPA method was applied. However, recovery by the two other extraction methods showed 11.1% and 27.7%, respectively. Digestions were done by MDS (microwave digestion system) and $HNO_3+HClO_4$ methods. To study organic and inorganic matrix effect, samples were made by adding triethanol amine as a organic matrix and $FeCl_3{\cdot}6H_2O$+$AlCl_3{\cdot}6H_2O$ as a inorganic matrix, respectively. The extracts were analyzed by AAS and HG-AAS. Mean recovery of the elements by the $HNO_3+HClO_4$ procedure, except Hg, gave better result than that of the MDS method. Mean recovery of elements was decreased when organic and inorganic matrices were added in the sludge samples. The procedure of MDS and $HNO_3+HClO_4$ digestion gave higher recoveries than that of direct analysis. In general, the results of the studies showed a significant matrix effect on the inorganic priority pollutants analysis in sludges.

• Journal of Korean Society of Transportation
• /
• v.24 no.7 s.93
• /
• pp.101-114
• /
• 2006

Recently due to the increase of cars and city life, the traffic congestion has worsened. It Is particularly worse in the center of the metropolis. Within the general public means, the public transport buses have the advantage of being more cheap, accessible and mobile. But as there is no separate lane for buses, the collision of cars and buses are creating damage to public service. In order to solve this situation, the bus priority signal system has been introduced to reduce the bus travel time and improve its services. The purpose of this study is to establish bus priority signal algorithm which builds bus efficiency under the real-time traffic signal control system and to analyze the effect of it. As the green time was calculated against real time (under the real-time traffic signal control system), compared to existing bus priority signal there was a reduction in cross street loss. The modified cycle was used to maintain signal progression. A case study was carried out using VISSIM simulation model. In result of this study, we found that there was a decrease in bus travel time despite some evidence of car delays and compared to existing bus priority signal the delay of dishonor could be reduced dramatically. The analysed result of person delay using MOE, is that there is evidence that when bus priority signal is in effect, the person delay is reduced.