• Journal of the Korean Society of Hazard Mitigation
• /
• v.8 no.6
• /
• pp.7-14
• /
• 2008

The main objective of sewer rehabilitation is to improve its function while eliminating inflow/infiltration (I/I). If we can identify the amount of I/I for an individual pipe, it is possible to estimate the I/Is of sub-areas clearly. However, in real, the amount of I/I for an individual pipe is almost impossible to be obtained due to the limitation of cost and time. In this study, I/I occurrence of each sewer pipe is estimated using AHP (Analytic Hierarch Process) and RPDM (Rehabilitation Priority Decision Model for sewer system) was developed using the estimated I/I of each pipe to perform the efficient sewer rehabilitation. Based on the determined amount of I/I for an individual pipe, the RPDM determines the optimal rehabilitation priority (ORP) using a genetic algorithm for sub-areas in term of minimizing the amount of I/I occurring while the rehabilitation process is performed. The benefit obtained by implementing the ORP for rehabilitation of sub-areas is estimated by the only waste water treatment cost (WWTC) of I/I which occurs during the sewer rehabilitation period. The results of the ORP were compared with those of a numerical weighting method (NWM) which is the decision method for the rehabilitation priority in the general sewer rehabilitation practices and the worst order which are other methods to determine the rehabilitation order of sub-areas in field. The ORP reduced the WWTC by 22% compared to the NWM and by 40% compared to the worst order.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.697-708
• /
• 1996

In this paper, we study reactive congestion control with priority in ATM network. The priority schemes for buffer access, partial buffer sharing have been investigated in order to improve the utilization of ATM network resources the network and to satisfy the most demanding traffic class. We consider in this paper a discrete-time queueing model for partial buffer sharing with two Markov modulated Poisson inputs. This model can be used to analyze the the effects of the partial buffer sharing priority scheme on system performance for realistic cases of bursty services. Explicit formulae are derived for the number of cells in the system and the loss probabilities for the traffic. Congestion may still occur because of unpredictable statistical fluctuation of traffic sources even when preventive control is performed in the network. In this Paper, we study reactive congestion control, in which each source changes its cell emitting rate a daptively to the traffic load at the switching node. Our intention is that,by incorporating such a congcstion control method in ATM network,more efficient congsestion control is established. We develope an analytical model,and carry out an approximateanalysis of reactive congestion con-trol with priority.Numerical results show that several orders of magnitude improvement in the loss probability can be achieved for the high priority class with little impact on the low priority class performance.And the results show that the reactive congestion control with priority are very effective in avoiding congestion and in achieving the statistical gain.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.10a
• /
• pp.302-305
• /
• 2000

The operation of a networked computing system (NCS), such as Internet, can be viewed as a resource allocation problem, and can be analyzed using the techniques of mathematical modeling. We define a general NCS and translate that setup into a model of an economy. The preferences of users are taken as primitives, and servers in the network are viewed as productive firms with priority input queues. Each sewer charges a rental price for its services by priority class. We characterize optimal system allocation, and derive formulae for supporting rental prices and priority premia such that the aggregated individual user demands do not exceed optimal levels and waiting-time expectations are correct. Our economic approach has the added benefit of providing a sound basis for evaluating NCS investment alternatives, using a process analogous to free entry and exit in free-enterprise economies.

• 한국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 Korean Institute of Communications and Information Sciences
• /
• v.19 no.3
• /
• pp.492-504
• /
• 1994

In ATM network was two QOS bearer services for flexible bandwidth assignment, various priority assignment buffer access mechanisms have been sugested. In this paper, a performance model with 3 state discrete time Markov proess in explicit priority assignment is suggested and cell loss probability is analytically derived. Also flexible space priority control mechanism with partial buffer sharing is studied and verified by simulation with OPNET.

• International Journal of Reliability and Applications
• /
• v.11 no.1
• /
• pp.41-53
• /
• 2010

In the present paper we develop a mathematical model that facilitates the calculation of reliability of a complex repairable system having three units namely super priority, priority and ordinary. The system is analyzed with the application of Gumbel Hougaard copula when different types of repair possible at a particular state due to deliberate failure. Various reliability measures such as reliability, MTTF and profit function have been evaluated by using supplementary variable and Laplace transform techniques.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.59-61
• /
• 2004

Researches about scheduling distributed real-time systems have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. This paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system. It is shown that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints. So this paper proposes an end-to-end laxity-based priority assignment algorithm which considers the practical laxity of a task and allocates a proper priority to a task.

• Journal of the Korea Safety Management & Science
• /
• v.18 no.4
• /
• pp.195-209
• /
• 2016

This research determined priority of quality improvement of public institution's education service by using ASC for importance and applying Topsis, a multi-standard decision-making method simplifying various attributes and scales of evaluation items and deciding the comparative priority for satisfaction and discussed the differences so as to measure the quality of public institution's educational service and examine the priority of education service' quality improvement. This research classified the characteristics of quality improvement. As a result, it's significant to suggest positive direction and method to improve satisfaction and education service's quality from an angle of demander by analyzing educational satisfaction of education service quality of public education institution and effects on the following improvement.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.12
• /
• pp.499-506
• /
• 2019

An intelligent robot should decide its behavior accordingly to the dynamic changes in the environment and user's requirements by evaluating options to choose the best one for the current situation. Many intelligent robot systems that use the Procedural Reasoning System (PRS) accomplishes such task management functions by defining the priority functions in the task model and evaluating the priority functions of the applicable tasks in the current situation. The priority functions, however, are defined locally inside of the plan, which exhibits limitation for the tasks for multi-domain services because global contexts for overall prioritization are hard to be expressed in the local priority functions. Furthermore, since the prioritization functions are not defined as an explicit module, reuse or extension of the them for general context is limited. In order to remove such limitations, we propose a policy-based meta-planning for general task management for multi-domain services, which provides the ability to explicitly define the utility of a task in the meta-planning process and thus the ability to evaluate task priorities for general context combining the modular priority functions. The ontological specification of the model also enhances the scalability of the policy model. In the experiments, adaptive behavior of a robot according to the policy model are confirmed by observing the appropriate tasks are selected in dynamic service environments.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3652-3661
• /
• 1999

To support multimedia applications such as a multimedia communication systems and multimedia broadcasting, an operating system need to predict their timing-constraints. So, In this real-time systems, we must solve the priority inversion problem that may make the behavior of unpredictable systems and need a real-time server model that provides a better preemptability and minimizes a system overhead. In current real-time systems, the single thread server model, the worker model and the dynamic server model are being used for synchronization but they cannot propose an effective structure for managing shared resources. In this paper, the priority inheritance protocol is used to solve the priority inversion problem and the hybrid prioritized worker model is proposed, which can provide a more effective structure and a faster response time minimizing a system overhead. The hybrid prioritized worker model is to combine the static and the dynamic prioritized worker model, and have a better performance than other models in response time which is an important factor in a real-time system.