• Journal of the Korea Society for Simulation
• /
• v.28 no.2
• /
• pp.15-22
• /
• 2019

Simulation methods are being studied for various service models that can be used in industries as the development of web technology. DEVS is being used as a tool to simulate through scenarios using various information. In addition, DEVS/WS integrates web-based DEVS models through a distributed computing environment and can be used as tools for high-performance computing and data distribution. This paper describes a method for simulating an intelligent transportation system in DEVS/WS environment. This paper propose dynamic interest management model(DIMM) applied the genetic algorithm, manage efficiently road information of moving node. And, this paper evaluates performance of the dynamic interest management model in comparing to the none interest management model(NIMM). The transmitted messages and simulation time of the DIMM is saved than that of the NIMM.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.24 no.6
• /
• pp.637-643
• /
• 2011

The bond-based peridynamic model is able to capture many of the essential characteristics of dynamic brittle fracture observed in experiments: crack branching, crack-path instability, asymmetries of crack paths, successive branching, secondary cracking at right angles from existing crack surfaces, etc. In this paper we investigate the influence of the stress waves on the crack branching angle and the velocity profile. We observe that crack branching in peridynamics evolves as the phenomenology proposed by the experimental evidence: when a crack reaches a critical stage(macroscopically identified by its stress intensity factor) it splits into two or more branches, each propagating with the same speed as the parent crack, but with a much reduced process zone.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.9
• /
• pp.2036-2040
• /
• 2013

In this paper, we consider two dynamic spectrum access schemes in cognitive network with two independent and identically distributed channels. Under the first scheme, secondary users switch channel only after transmission failure. On the other hand, under the second one, they switch channel only after successful transmission. We develop a mathematical model to investigate the performance of the second one and analyze the model using 3-dimensional embedded Markov chain. Numerical results and simulations are presented to compare between the two schemes.

• KIISE Transactions on Computing Practices
• /
• v.23 no.9
• /
• pp.564-571
• /
• 2017

The burst loading of a pre-created cache-image is an effective method to reduce the instruction cache misses in the early stage of the program execution. It is useful to alleviate the performance degradation as well as the energy inefficiency, which is induced by the concentrated cold misses at the instruction cache. However, there are some defects, including software overhead on the compiler and installer. Furthermore, there are several mismatches as a result of the dynamic properties for specific applications. This paper addresses these issues and proposes a cache-image maintenance/recreation policy that can conduct dynamic management using a hardware-assisted method. The results of the simulation show that the proposed method can maintain the cache-image with a proper size and validity.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.95-101
• /
• 2004

The scheduling problem that maps independent tasks to heterogeneous resources in distributed computing systems is known as NP-complete［1］. GRID［2］ is an example of distributed systems that consisted of heterogeneous resources. Many algorithms to solve this problem have been presented［1,3,4,5］. The scheduling algorithm can be classified into static scheduling algorithms and dynmic scheduling algorithms. A dynamic scheduling algorithm can be used when we can not predict the priority of tasks. Moreover, a dynamic scheduling algorithm can be divided into on-line mode algorithm and batch mode algorithm according to the scheduling time［1,6］. In this paper, we propose a new on-line mode scheduling algorithm. By extensive simulation, we can see that our scheduling algorithm outperforms previous scheduling algorithms.

• Journal of Advanced Navigation Technology
• /
• v.24 no.2
• /
• pp.121-127
• /
• 2020

In this paper, we propose a dynamic spectrum hole grouping method that changes the grouping range of spectrum hole according to the resources amount required by secondary users in wideband spectrum cognitive wireless networks, and then the proposed method is applied to channel allocation for the secondary user service. The proposed method can improve waste of resources in the existing static spectrum hole grouping in virtue of grouping dynamically as much the predicted spectrum holes resources as secondary users require. Simulation results show that channel allocation method with the proposed dynamic grouping outperforms that with the static grouping method in resources utilization under acceptable secondary user service performance.

• Journal of Digital Contents Society
• /
• v.18 no.1
• /
• pp.123-132
• /
• 2017

The physical display technology is the ultimate display technology that human beings aspire, and the world makes use of laser, plasma and reflector plate. Besides, technology development of binocular stereoscopic display has been actively progressed, but there is a limitation to the intact physical representation such as influence of optical ambient light and brightness. In this paper, the display technology using physical deformation different from the existing optical display is approached as a cultural and emotional perspective. The purpose of this paper is to develop the multivariate display technology that can create 3D realistic stereoscopic images through projecting dynamic images on physically diversified screen by overcoming the limitations of 2D planar digital signage and study how to apply them to video, exhibition and performance.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.481-486
• /
• 2004

The biped robot has the better mobility than the conventional wheeled robot. Since a biped robot tends to tip over easily, it is necessary to take stability into account when determining a walking pattern. To ensure the dynamic stability of the biped robot, we have to adapt the ground conditions with a foot motion and maintain motion, and ensure its stability through the kinematics and dynamics analysis. But its mathematic model is not too easy. In this paper, in order to ensure the dynamic stability of a biped robot, we design the fuzzy model and confirm the realization possibility of the proposed method through some simulations.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.951-958
• /
• 2004

This paper describes problems when visited ISP subscriber gets dynamic IP address in home ISP for wireless internet service on GPRS network. We propose a specific DHCP relay for wireless internet service of visited ISP subscriber on GPRS network. We designed and implemented the specific DHCP relay and installed it in ISP testbed. We show the allocated dynamic IP address using specific DHCP relay for visited ISP subscriber on GPRS network. Now we think it is possible the visited ISP subscriber can access wireless internet service on GPRS network using specific DHCP relay, and UMTS system can be managed IP address for subscriber roaming.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.38 no.12
• /
• pp.995-1006
• /
• 1989

If robots have the ability to track the parts on a moving conveyor belt, the efficiency of the manipulation tasks will be increased. This paper presents a motion planning algorithm for conveyor tracking. Tracking trajectory of a robot manipulator is determined by belt speed, initial part position, and initial robot position. Torque limit, maximum velocity, maximum acceleration and maximum jerk are also taken into account. To obtain the tracking solution, the problem is converted to the linear quadratic tracking problem. We describe the manipulator dynamics as second order state equation using parametric functions. Constraints on torques and smoothness are converted to those on input and state variables. The solution of the state equation which minimizes the performance index is obtained by dynamic programming method. Numerical examples are then presented to demonstrate the utility of the motion planning method developed.