• Journal of Korea Game Society
• /
• v.7 no.4
• /
• pp.93-104
• /
• 2007

In the complex real-time multi-agent system such as game environment, dynamic task allocations are repeatedly performed to achieve a goal in terms of system efficiency. In this research, we present a task allocation scheme suitable for the real-time multi-agent environment. The scheme is to optimize the task allocation by complementing existing coordination agent with $A^*$ algorithm. The coordination agent creates a status graph that consists of nodes which represent the combinations of tasks and agents, and refines the graph to remove nodes of non-execution tasks and agents. The coordination agent performs the selective utilization of the $A^*$ algorithm method and the greedy method for real-time re-allocation. Then it finds some paths of the minimum cost as optimized results by using $A^*$ algorithm. Our experiments show that the coordination agent with $A^*$ algorithm improves a task allocation efficiency about 25% highly than the coordination agent only with greedy algorithm.

• Korean Journal of Social Welfare
• /
• v.65 no.3
• /
• pp.29-52
• /
• 2013

This study examined how middle-aged and elderly persons allocated their time in overall perspective and whether the patterns were varied by age, socio-demographic factors, and the interaction effect between them. This study analyzed the 2009 Time Use Survey Data (17,096 time-diaries of people aged 45 or more) of the National Statistical Office using tobit regression model. The main results are as follows. First, middle-aged and elderly people gradually decreased paid work times. Second, the patterns of time allocation were varied by age, gender, education level, marital status and household type(Agricultural/non-agricultural). Third, there were interaction effects between age and the socio-demographic factors on paid work time and leisure time. Highly educated or urban persons were likely to have less time in paid work less than other groups with increasing age. And females were likely to have less time in domestic labor and care work than males with increasing age. But they had more time in social and economic productive activities than males. Based on these findings, this study suggests comprehensive approach to analyze the time use of elderly beyond economic working time or leisure time. To establish effective ageing society policy, it is necessary to consider the time allocation of elderly which divided into the social stratification.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.26 no.1
• /
• pp.25-36
• /
• 2018

This paper presents a new airport slot allocation model that uses AIP model to balance the use of airport slots within existing capacity based on the limitation of capacity expansion of airport slots. This new model is called a 'balanced airport slot allocation model', which integrates the airport facility usage system, which is applied independently without linkage, with the airport slot allocation system, introducing the market logical characteristic of 'administered incentive pricing. In this paper, we propose a new proposal to dramatically change the airport slot allocation system in the current situation where the expansion of facilities is limited in the urgent problem of the airport slot shortage, and it is necessary to balance the airport slot allocation. Airline paying for the use of an airport slot can determine the slot of the desired time slot based on the costs incurred by differentiating in the new airport slot allocation model. This is a system that allows the airlines that are willing to pay a lot of money in the market to use preferred airport slots.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.3008-3025
• /
• 2012

In this paper, the downlink resource allocation of OFDMA system with decode-and-forward (DF) relaying is investigated. A non-convex optimization problem maximizing system throughput with users' satisfaction constraints is formulated with joint relay selection, subcarrier assignment and power allocation. We first transform it to a standard convex problem and then solve it by dual decomposition. In particular, an Optimal resource allocation scheme With Time-sharing (OWT) is proposed with combination of relay selection, subcarrier allocation and power control. Due to its poor adaption to the fast-varying environment, an improved version with subcarrier Monopolization (OWM) is put forward, whose performance promotes about 20% compared with that of OWT in the fast-varying vehicular environment. In fact, OWM is the special case of OWT with binary time-sharing factor and OWT can be seen as the tight upper bound of the OWM. To the best of our knowledge, such algorithms and their relation have not been accurately investigated in cooperative OFDMA networks in the literature. Simulation results show that both the system throughput and the users' satisfaction of the proposed algorithms outperform the traditional ones.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.890-900
• /
• 1999

In homogeneous multiprocessor systems, the task allocation algorithm which equally assigns tasks to processors if possible is generally used. But this algorithm is not suitable to accomplish to accomplish effective task allocation in heterogeneous multiprocessor systems. JSQ (Join the Shortest Queue) algorithm is often used in heterogeneous multiprocessor systems. Unfortunately, JSQ algorithm is not efficient when the differences of capabilities of processors are far large. To solve this problem, we suggest a heuristic task allocation algorithm that makes use of dynamic information such as task arrival time, task service time, and number of finished tasks. The results of simulation show that the proposed heuristic allocation algorithm improves the system performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.8
• /
• pp.1-8
• /
• 2007

In this paper, we evaluate a performance on a resource allocation algorithm for prioritized data services in CDMA networks supporting real-time and non-real-time data services. The weighted aggregate data throughput is used to characterize the performance of the prioritized data service. Our prioritized data service is implemented so that the weighted aggregate data throughput is maximized via efficient power and spreading gain allocation. Numerical experiments are performed to evaluate a suboptimal resource allocation algorithm for typical parameters.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.75-84
• /
• 2015

A data allocation technique is essential to improve the performance of data broadcast systems. This paper explores the issues for allocating data items on broadcast channels to process multiple-data queries in the environment where query profiles and query request rates are given, and proposes a new data allocation scheme named IDAS. The proposed scheme employs the strategy that the broadcast frequency of each data is determined by the square root value of its relative access probability. IDAS could enhance the performance of query response time since it can process queries of high request rate fast and show a resonable degree of query data adjacency. Simulation is performed to evaluate the performance of the proposed scheme. The simulation results show that IDAS outperforms other schemes in terms of the average response time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.35-43
• /
• 2014

A data allocation technique is essential to improve the performance of data broadcast systems. This paper explores the issues for allocating data items on broadcast channels in the environment where multiple-data queries are submitted, and proposes a new data allocation scheme named DAMA. The proposed scheme employs the strategy that the broadcast frequency of each data is determined by the moving average of its access probability. DAMA could enhance the performance of query response time since it is capable of controlling the influence of access probability properly according to the query size. Simulation is performed to evaluate the performance of the proposed scheme. The simulation results show that the performance of DAMA is superior to other schemes in terms of the average response time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.691-708
• /
• 2010

An important issue of supporting multi-users with diverse quality-of-service (QoS) requirements over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resource while, at the same time, to meet each communication service QoS requirement. In this work, we study the problem of a variety of communication services over multi-media heterogeneous cognitive OFDM system. We first divide the communication services into two parts. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive (DS) and need guaranteed throughput. On the other side, services like file transmission and email service are relatively delay tolerant (DT) so varying-rate transmission is acceptable. Then, we formulate the scheduling as a convex optimization problem, and propose low complexity distributed solutions by jointly considering channel assignment, bit allocation, and power allocation. Unlike prior works that do not care computational complexity. Furthermore, we propose the FAASA (Fairness Assured Adaptive Sub-carrier Allocation) algorithm for both DS and DT users, which is a dynamic sub-carrier allocation algorithm in order to maximize throughput while taking into account fairness. We provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.

• Journal of information and communication convergence engineering
• /
• v.7 no.2
• /
• pp.199-202
• /
• 2009

Adaptive memory management is a serious issue in data stream management. Data stream differ from the traditional stored relational model in several aspect such as the stream arrives online, high volume in size, skewed data distributions. Data skew is a common property of massive data streams. We propose the predicted allocation strategy, which uses predictive processing to cope with time varying data skew. This processing includes memory usage estimation and indexing with timestamp. Our experimental study shows that the predictive strategy reduces both required memory space and latency time for skewed data over varying time.