• International Journal of Contents
• /
• v.14 no.3
• /
• pp.7-16
• /
• 2018

The extent and depth of the event plan determines the scope of pedagogical experience in situations and consequently the quality of immersive learning based on our simulated world. In contrast to planning in conventional narrative-based systems mainly pursuing dramatic interests, planning in virtual world-based pedagogical systems strive to provide realistic experiences in immersed situations. Instead of story plot comprising predetermined situations, our inter-event planning method aims at simulating diverse situations that each involve multiple events coupled via their associated agents' conditions and meaningful associations between events occurring in a background world. The specific techniques to realize our planning method include, two-phase planning based on inter-event search and intra-event decomposition (down to the animated action level); autonomous and independent agents to behave proactively with their own belief and planning capability; full-blown background world to be used as the comprehensive stage for all events to occur in; coupling events via realistic association types including deontic associations as well as conventional causality; separation of agents from event roles; temporal scheduling; and parallel and concurrent event progression mechanism. Combining all these techniques, diverse exogenous events can be derived and seamlessly (i.e., semantically meaningfully) integrated with the original event to form a wide scope of situations providing chances of abundant pedagogical experiences. For effective implementation of plan execution, we devise an execution scheme based on multiple priority queues, particularly to realize concurrent progression of many simultaneous events to simulate its corresponding reality. Specific execution mechanisms include modeling an action in terms of its component motions, adjustability of priority for agent across different events, and concurrent and parallel execution method for multiple actions and its expansion for multiple events.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3A
• /
• pp.223-232
• /
• 2004

In this paper we propose the hierarchical-based dynamic bandwidth allocation algorithm for multi-class services in Ethernet-PON. The proposed algorithm consists of the high level scheduler in OLT and the low level scheduler in ONU. The hierarchical architecture is able to provide scalability and resource efficiency in Ethernet-PON which has the distributed nature of the scheduling domain, with queues and the scheduler located at a large distance from each other. We also propose three dynamic bandwidth allocation algorithms for the low level scheduler: Proportional Allocation algorithm, Maximum Request First Allocation (MRFA) algorithm and High Priority First Allocation (HPFA) algorithm. We implement the Ethernet-PON standardized in the IEEE 802,3ah using OPNET. We also evaluate and analyze the performance for the proposed algorithms in terms of channel utilization, queuing delay and the amount of remainder.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.1 no.2
• /
• pp.159-168
• /
• 1997

This paper presents a mechanism which supplies tasks with fast turn-around time on real-time multimedia environments. Tasks are classified into periodic and aperiodic tasks according to their executing period, and the types of them are classified into three groups : critical tasks, essential tasks and common tasks by the degree of its urgency. In the case of periodic tasks, we defer the execution of it within the extent to keep the deadline as long as possible and serve the aperiodic tasks, and provide aperiodic tasks with fast turn-around time. Changing the priority of each task is allowed within the same type and it is scheduled by using the dynamic priority. The emergency tasks are executed within deadline in any circumstances, and the least laxity one is served first when many real-time tasks are waiting for execution. The result of simulation shows that the proposed mechanism is better than the EDZL, known as suboptimal in multiprocessor systems, in the point of rum-around time.

• Journal of Advanced Navigation Technology
• /
• v.23 no.4
• /
• pp.302-308
• /
• 2019

Aircraft data network (ADN) is a data networking for signal transmission among avionic systems in aircraft, and it mostly has been applied MIL-STD-1553B that guarantees high reliability considering its application environments. However, commercial Ethernet has been widely applied for ADN recently, and its range of applications have increased. Ethernet provides high speed of data transmission, however, it could not guarantee quality of service (QoS) so high as MIL-STD-1553B. In this paper, we propose dynamic routing and priority based data transmission schemes in order to improve the QoS of legacy Ethernet. Our propose schemes can be applied to Ethernet switch, and it is able to manage network traffic efficiently, and reduce the time for data transmission. We analyze the packet transmission time for both legacy and proposed schemes in Ethernet environments using simulation, and we show that our proposed scheme can reduce the time for data transmission compare to legacy spanning tree protocol.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.3
• /
• pp.181-187
• /
• 2020

In this paper, we proposed a register allocation algorithm and resource allocation algorithm in the high level synthesis process for the SoC design synthesis system of high performance vehicles We have analyzed to the operator characteristics and structure of datapath in the most important high-level synthesis. We also introduced the concept of virtual operator for the scheduling of multi-cycle operations. Thus, we demonstrated the complexity to implement a multi-cycle operation of the operator, regardless of the type of operation that can be applied for commonly use in the resources allocation algorithm. The algorithm assigns the functional operators so that the number of connecting signal lines which are repeatedly used between the operators would be minimum. This algorithm provides regional graphs with priority depending on connected structure when the registers are allocated. The registers with connecting structure are allocated to the maximum cluster which is generated by the minimum cluster partition algorithm. Also, it minimize the connecting structure by removing the duplicate inputs for the multiplexor in connecting structure and arranging the inputs for the multiplexor which is connected to the operators. In order to evaluate the scheduling performance of the described algorithm, we demonstrate the utility of the proposed algorithm by executing scheduling on the fifth digital wave filter, a standard bench mark model.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.533-542
• /
• 2001

In this paper, we present a scheduling method for real-time mobile transaction manager in mobile computing environment. The proposed method checks whether a transaction is executable or not. It is able to by considering not only the deadline of real-time data in mobile hosts. And then, it schedules the real-time mobile transactions by making optimal execution window based on the priority queue, while considering transaction value and deadline. Disconnection with mobile hosts is monitored in selecting the transaction for execution. Using the proposed method reduces the number of restarting times after transaction aborts which is caused by the violation of the validity constraints of real-time data. And in has merits of maximizing the sum of values of real-time mobile transactions which meet the deadline. The performance evaluation demonstrates that the number of committed real-time transactions within the deadline is improved by 20%. This method can be used in real-time mobile transaction manager is such environments as cellular communications, emergency medicine information system and so on.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.8
• /
• pp.67-74
• /
• 2020

One of the missions of active-duty units in charge of managing reserve forces is providing combat supplies to reserve forces to exercise their combat capabilities quickly when declaring a mobilization order. Rear area active-duty units must support large local reserve forces. On the other hand, military units have difficulties due to a lack of forces and the storage of large quantities of firearms and ammunition. For this reason, local reserve forces should move to an integrated storing place and receive their firearms and ammunition. The existing distribution plan (existing plan) is a first-in-first-out plan that can produce inconsistent distribution orders. The inconsistent distribution orders can increase the complete distribution time, which will affect the combat power of local reserve forces. Therefore, firearms and ammunition should be distributed quickly. Accordingly, this paper proposes the priority selection of firearms and ammunition for local reserve forces with a minimum complete distribution time using Dynamic Programming. To verify the proposed model, the existing plan was compared with the proposed model using real data, and the result showed that the proposed model outperformed the existing plan.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.14 no.3
• /
• pp.186-195
• /
• 2006

In real-time control systems, the traditional timing analysis based on worst-case response-time(WCRT) is too conservative for the firm and soft real-time control systems, which permit the maximum utilization factor greater than one. We suggested a probabilistic analysis method possible to apply the firm and soft real-time control systems under considering dependency relationship between tasks. The proposed technique determines the deadline miss probability(DMP) of each task from computing the average response-time distribution under a fixed-priority scheduling policy. The method improves the predictable ability forthe average performance and the temporal behavior of real-time control systems.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.6 no.4
• /
• pp.195-200
• /
• 2013

This paper proposes an SNS and Web Data Analytics System which can utilize a business marketing strategy by analyzing negative SNS and Web Data that can do great damage to a business image. It consists of the Data Collection Module collecting SNS and Web Data, the Hbase Module storing the collected data, the Data Analysis Module estimating and classifying the meaning of data after an semantic analysis of the collected data, and the PHS Module accomplishing an optimized Map Reduce by using SNS and Web data involved a Businesse. This paper can utilize this analysis result for a business marketing strategy by efficiently managing SNS and Web data with these modules.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06b
• /
• pp.388-393
• /
• 2008

유비쿼터스 지능 공간 환경에서 중요한 이슈는 사용자에게 현재 상황에 최적의 서비스를 제공하는 것이며, 이를 위해서 상황 인식(Context Aware) 기법에 대한 연구가 널리 진행되고 있다. 유비쿼터스 지능 공간은 분산 배치된 수많은 애플리케이션 및 장치와 같은 스마트 객체들이 존재하여 사용자에게 최적의 서비스를 제공하는 환경이다. 유비쿼터스 지능 공간에서는 각 스마트 객체가 수집하는 데이터는 무수히 많다. 사용자에게 최적의 서비스를 제공하기 위해선 데이터들을 빠르게 처리하여 서비스를 제공하여야 한다. 현재 연구된 스케줄링 방법은 데이터 처리에만 중점을 두었기 때문에 스스로 상황을 인지하여 예측하여야 하는 유비쿼터스 지능 공간을 위한 미들웨어에는 적합하지 않다. 본 논문은 수집한 데이터를 바탕으로 상황을 인식하고 태스크의 우선순위를 재조정하는 상황 인지형 실시간 스케줄링 기법을 제안한다. 제안하는 상황 인지형 실시간 스케줄링 기법인 U-RM, U-EDF와 기존의 RM, EDF 알고리즘을 비교하여 성능평가를 한 결과 U-RM은 기존의 RM보다 최대 20.7%의 성능 향상을 보였으며, U-EDF의 경우 기존의 EDF 보다 최대 26.8%의 성능 향상을 보였다.