• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.12 no.2
• /
• pp.265-274
• /
• 1992

A mathematical model was proposed to predict the fate of a priority organic pollutant, anthracene, accidently spilled into a stream. The model consists of 6 differential equations with 5 input variables and 9 rate constants. Volatilization, biodegradation, adsorption/desorption, photodegradation as well as the convective inputs and outputs are included in the model. As a result of a series of dynamic simulations and sensitivity analyses under the given conditions, the concentrations of the organic chemical could be predicted within a detection limit in the stream. It was also suggested that the rate constant for diffusion/transport and adsorption rate constant are the most influential ones for predicting the chemical conentrations in dissolved and particulate phase. The model proposed appears to be a useful tool for assessing chemical spills.

• The Journal of Korean Association of Computer Education
• /
• v.12 no.2
• /
• pp.13-22
• /
• 2009

In this paper, we propose a new dynamic syllabus composition system to solve the problems of a static syllabus which can appear in the field of computer education, where the relationship between pre-post study subjects is clear and teachers may grasp easily the degree of understanding of learners in real time. Our dynamic syllabus composition system is designed to be adjusted according to the physical change of the amount of education and the level of learners, which is based on the priority of educational objects. The result of instance performed on two groups of different entering behavior shows that the proposed method enhances the degree of transfer of education and helps us teach a class around the representative subject which has to be dealt with in the class, so that it is very effective for the achievement of educational objects prior to others.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1997.04a
• /
• pp.93-99
• /
• 1997

Most of the past studies on FMS scheduling problems may be classified into two classes, namely off-line scheduling and on-line scheduling approach. The off-line scheduling methods are used mostly for FMS planning purposes and may not be useful real time control of FMSs, because it generates solutions only after a relatively long period of time. The on-line scheduling methods are used extensively for dynamic real-time control of FMSs although the performance of on-line scheduling algorithms tends vary dramatically depending on various configurations of FMS. Current study is about finding a better on-line scheduling rules for FMS operations. In this study, we propose a method to create priority functions that can be used in setting relative priorities among jobs or machines in on-line scheduling. The priority functions reflect the configuration of FMS and the user-defined objective functions. The priority functions are generated from diverse dispatching rules which may be considered a special priority functions by themselves, and used to determine the order of processing and transporting parts. Overall system of our work consists of two modules, the Priority Function Evolution Module (PFEM) and the FMS Simulation Module (FMSSM). The PFEM generates new priority functions using input variables from a terminal set and primitive functions from a function set by genetic programming. And the FMSSM evaluates each priority function by a simulation methodology. Based on these evaluated values, the PFEM creates new priority functions by using crossover, mutation operation and probabilistic selection. These processes are iteratively applied until the termination criteria are satisfied. We considered various configurations and objective functions of FMSs in our study, and we seek a workable solution rather than an optimum or near optimum solution in scheduling FMS operations in real time. To verify the viability of our approach, experimental results of our model on real FMS are included.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.6
• /
• pp.808-816
• /
• 2016

As the number of CPU/GPU cores and IPs in SOC increases and applications require explosive memory bandwidth, simultaneously achieving good throughput and fairness in the memory system among interfering applications is very challenging. Recent works proposed priority-based thread scheduling and channel partitioning to improve throughput and fairness. However, combining these different approaches leads to performance and fairness degradation. In this paper, we analyze the problems incurred when combining priority-based scheduling and channel partitioning and propose dynamic priority thread scheduling and adaptive channel partitioning method. In addition, we propose dynamic address mapping to further optimize the proposed scheme. Combining proposed methods could enhance weighted speedup and fairness for memory intensive applications by 4.2% and 10.2% over TCM or by 19.7% and 19.9% over FR-FCFS on average whereas the proposed scheme requires space less than TCM by 8%.

• International Journal of Contents
• /
• v.8 no.2
• /
• pp.19-22
• /
• 2012

New and handoff calls control mechanisms are the key point to wireless cellular networks. In this paper, we present an adaptive algorithm for dynamic channel allocation scheme with guard channels and also with handoff calls waiting queue ensuring that handoff calls take priority over new calls. Our goal is to find better tradeoff between handoffs and new calls blocking probabilities in order to achieve more efficient channel utilization. Simpy is a Python based discrete event simulation system. We use Simpy to build our simulation models to get analytical data.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.716-719
• /
• 1999

In this paper, a real-time control system for robot manipulator is implemented using real-time operating system with capabilities of multitasking, intertask communication and synchronization, event-driven, priority-driven scheduling, real-time clock control, etc. The hardware system with VME bus and related devices is developed and applied to implement a dynamic learning control scheme for robot manipulator. Real-time performance of the proposed dynamic learning controller is tested for tasks of tracking moving objects and compared with the conventional servo controller.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1770-1780
• /
• 1997

Our problem is improvement of image quality because it is inevitable cell loss of image data when traffic congestion occurs. If cells are discarded indiscriminately in transmission of MPEG video data, it occurs severe degradation in quality of service(QOS). In this paper, to solve this problem, we propose two method. The first, we analyze the traffic characteristics of an MPEG encoder and generate high priority and low priority data stream. During network congestion, only the least low priority cells are dropped, and this ensures that the high priority cells are successfully transmitted, which, in turn, guarantees satisfactory QoS. In this case, the prioritization scheme for the encoder assigns components of the data stream to each priority level based on the value of a parameter ${\beta}$. The second, Number of high priority cells are increased when value of ${\beta}$ is large. It occurs the loss of high priority cell in the congestion. To prevent it, this paper is regulated to data stream rate as buffer occupancy with UPC controller. Therefore, encoder's bandwidth can be calculated renegotiation of the encoder and networks. In this paper, the encoder's bandwidth requirements are characterized by a usage parameter control (UPC) set consisting of peak rate, burstness, and sustained rate. An adaptive encoder rate control algorithm at the Networks Interface Card(NIC) computes the necessary UPC parameter to maintain the user specified quality of service. Simulation results are given for a rate-controlled VBR video encoder operating through an ATM network interface which supports dynamic UPC. These results show that dynamic bandwidth renegotiation of prioritized data stream could provided bandwidth saving and significant quality gains which guarantee high priority data stream.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.57-60
• /
• 2005

In this paper, a dynamic priority-based QoS (DPQoS) provision scheme is proposed for the required QoS from one end of the network to the other in wireless mobile networks. The DPQoS model is used to meet diversity multimedia traffic requirements. This model is come up with a framework for the wireless network of which consists of a core-IP network and also a number of wireless access networks. For the true end-to-end QoS, it is required that the core network is able to support the required QoS for the wireless users. This paper shows a solution to optimize the performance for different traffic classes according to the traffic characteristics. The performance of the proposed scheme is evaluated at delay aspects such as delay and throughput.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.3
• /
• pp.65-77
• /
• 1994

There are so many situations in which production schedules need to be rescheduled, due to the uncertainty or dynamic characteristics existing in manufacturing environment. Under the circumstances, it is necessary to build a system which helps a schedule manager understand the dynamic situations and reflect his insight into the system easily. We developed a system that can improve a production schedule. The system consists of a schedule editor and a schedule generator. The schedule editor, a rule-based system, always keeps a schedule feasible by keeping track of local changes in the revised one. The schedule generator consists of a two-phase heuristic method. In the lst phase it generates a schedule by a priority rule with Giffler and Thompson algorithm then it improves the performance in terms of the makespan in the 2nd phase. Experimental results show that, most of the times, the system generates a better schedule than the one with ordinary priority rules only.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.81-84
• /
• 2000

Scheduling algorithm proposed in this paper is based on both DWRR(Dynamic Weighed Round Robin) method and QLT(Queue Length Threshold) method. The proposed scheduling algorithm guarantees delay property of realtime traffic, not considered in previous DWRR method, with serving realtime traffic preferentially by using RR(Round Robin) method which service each channel equally and QLT algorithm that is dynamic time priority method. Proposed cell scheduling algorithm may increase some complexity over conventional DWRR scheme because of delay priority based cell transmission method. However, due to reliable ABR service and congesition avoidance capacity, proposed scheduling algorithm has good performance over conventional DWRR scheme. Also, delay property based cell transmission method in proposed algorithm minimizes cell delay and requires less temporary buffer size