• 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.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.10
• /
• pp.5156-5161
• /
• 2013

In distributed spatial data stream processing, processed tuples of downstream nodes are replicated to the upstream node in order to increase the utilization of distributed nodes and to recover the whole system for the case of system failure. However, while the data input rate increases and multiple downstream nodes share the operation result of the upstream node, the data which stores to output queues as a backup can be lost since the deletion operation delay may be occurred by the delay of the tuple processing of upstream node. In this paper, the adaptive upstream backup scheme based on operation throughput in distributed spatial data stream system is proposed. This method can cut down the average load rate of nodes by efficient spatial operation migration as it processes spatial temporal data stream, and it can minimize the data loss by fluid change of backup mode. The experiments show the proposed approach can prevent data loss and can decrease, on average, 20% of CPU utilization by node monitoring.

• The KIPS Transactions:PartB
• /
• v.16B no.5
• /
• pp.367-376
• /
• 2009

In this paper, we propose a flame detection method using Haar wavelet and moving averages in outdoor infrared video sequences. Our proposed method is composed of three steps which are Haar wavelet decomposition, flame candidates detection, and their tracking and flame classification. In Haar wavelet decomposition, each frame is decomposed into 4 sub- images(LL, LH, HL, HH), and also computed high frequency energy components using LH, HL, and HH. In flame candidates detection, we compute a binary image by thresholding in LL sub-image and apply morphology operations to the binary image to remove noises. After finding initial boundaries, final candidate regions are extracted using expanding initial boundary regions to their neighborhoods. In tracking and flame classification, features of region size and high frequency energy are calculated from candidate regions and tracked using queues, and we classify whether the tracked regions are flames by temporal changes of moving averages.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.9-10
• /
• 2001

Simulation has been evolved with the advance of computer and technique of modeling application systems. Early simulations were numerical analysis of engineering models known as continuous simulation, analysis of random events using various random number generators thus named as Monte Carlo simulation, iud analysis o(\\\\`queues which are prevalent in many real world systems including manufacturing, transportation, telecommunication. Discrete-event simulation has been used far modeling and analyzing the systems with waiting lines and inefficient delays. These simulations, either discrete-event, continuous, or hybrid, have played a key role in industrial age by helping to design and implement the efficient real world systems. In the information age which has been brought up by the advent of Internet, e-business has emerged. E-business, any business using Internet, can be characterized by the network of extended enterprises---extended supply and demand chains. The extension of value chains spans far reaching scope in business functions and space globally. It also extends to the individual customer, customer preferences and behaviors, to find the best service and product fit for each individual---mass customization. Simulation should also play a key role in analyzing and evaluating the various phenomena of e-business where the phenomena can be characterized by dynamics, uncertainty, and complexity. In this tutorial, applications of simulation to e-business phenomena will be explained and illustrated. Examples are the dynamics of new economy, analysis of e-business processes, virtual manufacturing system, digital divide phenomena, etc. Partly influenced by e-business, a new trend of simulation has emerged called agent-based simulation, Agent-based simulation is a technique of simulation using software agent that have autonomy and proactivity which are useful in analyzing and integrating numerous individual customer's behavior. One particular form of agent-based simulation is swarm. This tutorial concludes with the illustration of swarm or swarm Intelligence applied to various e-business applications, and future directions and implications of this new trend of simulation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.129-137
• /
• 2016

Transmission Control Protocol as a transport layer protocol provides steady data transfer service. There are some serious concerns about the performance of TCP over diverse networks. The vital concern in TCP network environment is congestion which may occur due to quick transmission rates or because of large number of new connections entering the network at the same time. Size of queues in routers grows thus resulting in packet drops. Retransmission of the dropped packets, and reduced throughput can prove costly. Explicit Congestion Notification (ECN) in conjunction with Active Queue Management mechanisms (AQM) such as Random early detection (RED) is used for packet marking rather than dropping. In IP packet header ECN bits can be added as a sign of congestion thus avoiding needless packet drops. The proposed ECN and AQM mechanism can be implemented with help of ns2 simulator and the performance can be tested on different TCP variants.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.5D
• /
• pp.663-669
• /
• 2011

In this study, the optimal length of left-turn lane in permissive left-turn signal system at the signalized intersection which has a left-turn bay is estimated. It is a simulation analysis using the queueing theory that estimate the length of left-turn lane. Traffic density conform to the standards of operating a permissive left-turn system of the Practical Manual Traffic Safety Facilities. And each of a left-turn arrival rate, a left-turn service rate, left-turn average queueing time, for green time average queueing vehicle, for red time average queueing vehicle and average queueing vehicle cycle is calculated. As a result of this study, we would learn how much the space should be secured at the signalized intersection which has a left-turn bay. The methodology using the queueing theory to work out the optimal length of waiting lane in the permissive left-turn signal system was presented.

• Journal of Advanced Navigation Technology
• /
• v.10 no.4
• /
• pp.291-298
• /
• 2006

A new intelligent paging algorithm is proposed in this paper to maximize the paging capacity in wireless link of mobile communication systems. Intelligent paging algorithms have been studied to utilize limited wireless resource efficiently, in which a location area is divided to several paging areas which are searched sequentially. Previous intelligent paging methods mainly use location probability distribution of the paging target terminal to determine paging areas. However, these methods make the paging traffic of each cell non-uniformly distributed. Therefore, in relatively low paging load conditions, there exist cells congested with paging traffic in which paging traffic queues are overflowed and paging messages are lost. The proposed method determines paging areas to make the paging traffic distributed uniformly among cells by considering current paging traffic distribution in each cell. Performance evaluation shows that the proposed method outperforms the previous paging schemes much with respect to paging processing capacity.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.659-662
• /
• 2012

In this paper, the service system the urgent of the danger area or the managed object region is proposed whether the system is autonomously the police or situation where it informs through the police car and it can convey the contextual information or not. In case the nodes location is continuously confirmed from the gateway and it queues and the event is generated in the server of system whether it is the situation, or not the system to be proposed transmits the event triggered message and system transmitting the video message to the nearby which the event is generated node. As a result of the test, in case the event was generated in the server whether it was the situation, or not it confirmed to transmit the video message as the route where it is stored in the server.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.2
• /
• pp.63-81
• /
• 2008

WiMAX has been introduced as a competitive alternative for metropolitan broadband wireless access technologies. It is connection oriented and it can provide very high data rates, large service coverage, and flexible quality of services (QoS). Due to the large number of connections and flexible QoS supported by WiMAX, the uplink access in WiMAX networks is very challenging since the medium access control (MAC) protocol must efficiently manage the bandwidth and related channel allocations. In this paper, we propose and investigate a cost-effective WiMAX bandwidth management scheme, named the WiMAX partial sharing scheme (WPSS), in order to provide good QoS while achieving better bandwidth utilization and network throughput. The proposed bandwidth management scheme is compared with a simple but inefficient scheme, named the WiMAX complete sharing scheme (WCPS). A maximum entropy (ME) based analytical model (MEAM) is proposed for the performance evaluation of the two bandwidth management schemes. The reason for using MEAM for the performance evaluation is that MEAM can efficiently model a large-scale system in which the number of stations or connections is generally very high, while the traditional simulation and analytical (e.g., Markov models) approaches cannot perform well due to the high computation complexity. We model the bandwidth management scheme as a queuing network model (QNM) that consists of interacting multiclass queues for different service classes. Closed form expressions for the state and blocking probability distributions are derived for those schemes. Simulation results verify the MEAM numerical results and show that WPSS can significantly improve the network’s performance compared to WCPS.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1522-1545
• /
• 2012

Call admission control (CAC) plays an important role in mobile cellular network to guarantee the quality of service (QoS). In this paper, a dynamic hybrid CAC scheme with integrated cutoff priority and handoff queue for mobile cellular network is proposed and some performance metrics are derived. The unique characteristic of the proposed CAC scheme is that it can support any number of service types and that the cutoff thresholds for handoff calls are dynamically adjusted according to the number of service types and service priority index. Moreover, timeouts of handoff calls in queues are also considered in our scheme. By modeling the proposed CAC scheme with a one-dimensional Markov chain (1DMC), some performance metrics are derived, which include new call blocking probability ($P_{nb}$), forced termination probability (PF), average queue length, average waiting time in queue, offered traffic utilization, wireless channel utilization and system performance which is defined as the ratio of channel utilization to Grade of Service (GoS) cost function. In order to validate the correctness of the derived analytical performance metrics, simulation is performed. It is shown that simulation results match closely with the derived analytic results in terms of $P_{nb}$ and PF. And then, to show the advantage of 1DMC modeling for the performance analysis of our proposed CAC scheme, the computing complexity of multi-dimensional Markov chain (MDMC) modeling in performance analysis is analyzed in detail. It is indicated that state-space cardinality, which reflects the computing complexity of MDMC, increases exponentially with the number of service types and total channels in a cell. However, the state-space cardinality of our 1DMC model for performance analysis is unrelated to the number of service types and is determined by total number of channels and queue capacity of the highest priority service in a cell. At last, the performance comparison between our CAC scheme and Mahmoud ASH's scheme is carried out. The results show that our CAC scheme performs well to some extend.