• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.899-914
• /
• 2003

It is generally accepted that self-similar (or fractal) processes may provide better models for teletraffic in modern telecommunication networks than Poisson Processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. Three generators of pseudo-random self-similar sequences, based on the FFT〔20〕, RMD〔12〕 and SRA methods〔5, 10〕, are compared and analysed in this paper. Properties of these generators were experimentally studied in the sense of their statistical accuracy and times required to produce sequences of a given (long) length. While all three generators show similar levels of accuracy of the output data (in the sense of relative accuracy of the Horst parameter), the RMD- and SRA-based generators appear to be much faster than the generator based on FFT. Our results also show that a robust method for comparative studies of self-similarity in pseudo-random sequences is needed.

• Journal of the Korea Society for Simulation
• /
• v.28 no.4
• /
• pp.21-32
• /
• 2019

Inspired by the social behavior models of a bird flock or fish school, particle swarm optimization (PSO) is a popular metaheuristic optimization algorithm and has been widely used from solving a complex optimization problem to learning a artificial neural network. However, PSO is difficult to apply to many real-life optimization problems involving stochastic noise, since it is originated in a deterministic environment. To resolve this problem, this paper incorporates a resampling method called the uncertainty evaluation (UE) method into PSO. The UE method allows the particles to converge on the accurate optimal solution quickly in a noisy environment by selecting the particles' global best position correctly, one of the significant factors in the performance of PSO. The results of comparative experiments on several benchmark problems demonstrated the improved performance of the propose algorithm compared to the existing studies. In addition, the results of the case study emphasize the necessity of this work. The proposed algorithm is expected to be effectively applied to optimize complex systems through digital twins in the fourth industrial revolution.

• Journal of Information Processing Systems
• /
• v.12 no.2
• /
• pp.275-294
• /
• 2016

A primary task in wireless sensor networks (WSNs) is data collection. The main objective of this task is to collect sensor readings from sensor fields at predetermined sinks using routing protocols without conducting network processing at intermediate nodes, which have been proved as being inefficient in many research studies using a static sink. The major drawback is that sensor nodes near a data sink are prone to dissipate more energy power than those far away due to their role as relay nodes. Recently, novel WSN architectures based on mobile sinks and mobile relay nodes, which are able to move inside the region of a deployed WSN, which has been developed in most research works related to mobile WSN mainly exploit mobility to reduce and balance energy consumption to enhance communication reliability among sensor nodes. Our main purpose in this paper is to propose a solution to the problem of deploying mobile data collectors for alleviating the high traffic load and resulting bottleneck in a sink's vicinity, which are caused by static approaches. For this reason, several WSNs based on mobile elements have been proposed. We studied two key issues in WSN mobility: the impact of the mobile element (sink or relay nodes) and the impact of the mobility model on WSN based on its performance expressed in terms of energy efficiency and reliability. We conducted an extensive set of simulation experiments. The results obtained reveal that the collection approach based on relay nodes and the mobility model based on stochastic perform better.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.4
• /
• pp.499-505
• /
• 2015

Trend Impact Analysis(: TIA) is an advanced forecasting tool used in futures studies for identifying, understanding and analyzing the consequences of unprecedented events on future trends. An adaptive neuro-fuzzy inference system is a kind of artificial neural network that integrates both neural networks and fuzzy logic principles, It is considered to be a universal estimator. In this paper, we propose an advanced mechanism to generate more justifiable estimates to the probability of occurrence of an unprecedented event as a function of time with different degrees of severity using Adaptive Neuro-Fuzzy Inference System(: ANFIS). The key idea of the paper is to enhance the generic process of reasoning with fuzzy logic and neural network by adding the additional step of attributes simulation, as unprecedented events do not occur all of a sudden but rather their occurrence is affected by change in the values of a set of attributes. An ANFIS approach is used to identify the occurrence and severity of an event, depending on the values of its trigger attributes. The trigger attributes can be calculated by a stochastic dynamic model; then different scenarios are generated using Monte-Carlo simulation. To compare the proposed method, a simple simulation is provided concerning the impact of river basin drought on the annual flow of water into a lake.

• The Journal of Engineering Geology
• /
• v.3 no.2
• /
• pp.125-148
• /
• 1993

Groundwater flow in fractured rock masses is controlled by combined effects of fracture networks, state of geostafic stresses and crossflow between fractures and rock matrix. Furthermore the scaie dependent, anisotropic properties of hydraulic parameters results mainly from irregular paftems of fracture system, which can not be evaluated properly with the methods available at present. The basic assumpfion of discrete fracture network model is that groundwater flows only along discrete fractures and the flow paths in rock mass are determined by geometric paftems of interconnected fractures. The characteristics of fracture distribution in space and fracture hydraulic parameters are represented as the probability density functions by stochastic simulation. The discrete fracture network modelling was aftempted to characterize the groundwater flow in the vicinity of existing large cavems located in Wonjeong-ri, Poseung-myon, Pyeungtaek-kun. The fracture data of $1\textrm{km}^2$ area were analysed. The result indicates that the fracture sets evaluated from an equal area projection can be grouped into 6 sets and the fracture sizes are distributed in longnormal. The conductive fracture density of set 1 shows the highest density of 0.37. The groundwater inflow into a carvem was calculated as 29ton/day with the fracture transmissivity of $10^{-8}\textrm{m}^2/s$. When the fracture transmissivity increases in an order, the inflow amount estimated increases dramatically as much as fold, i.e 651 ton/day. One of the great advantages of this model is a forward modelling which can provide a thinking tool for site characterization and allow to handle the quantitative data as well as qualitative data.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.5B
• /
• pp.397-408
• /
• 2009

In this study, a stochastic precipitation generation framework for simultaneous simulation of daily precipitation at multiple sites is presented. The precipitation occurrence at individual sites is generated using hybrid-order Markov chain model which allows higher-order dependence for dry sequences. The precipitation amounts are reproduced using Anscombe residuals and gamma distributions. Multisite spatial correlations in the precipitation occurrence and amount series are represented with spatially correlated random numbers. The proposed model is applied for a network of 17 locations in the middle of Korean peninsular. Evaluation statistics are reported by generating 50 realizations of the precipitation of length equal to the observed record. The analysis of results show that the model reproduces wet day number, wet and dry day spell, and mean and standard deviation of wet day amount fairly well. However, mean values of 50 realizations of generated precipitation series yield around 23% Root Mean Square Errors (RMSE) of the average value of observed maximum numbers of consecutive wet and dry days and 17% RMSE of the average value of observed annual maximum precipitations for return periods of 100 and 200 years. The provided model also reproduces spatial correlations in observed precipitation occurrence and amount series accurately.

• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.281-288
• /
• 2005

It is generally accepted that self-similar (or fractal) Processes may provide better models for teletraffic in modem computer networks than Poisson processes. f this is not taken into account, it can lead to inaccurate conclusions about performance of computer networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. A generator of pseudo-random self similar sequences, based on the SRA (successive random addition) method, is implemented and analysed in this paper. Properties of this generator were experimentally studied in the sense of its statistical accuracy and the time required to produce sequences of a given (long) length. This generator shows acceptable level of accuracy of the output data (in the sense of relative accuracy of the Hurst parameter) and is fast. The theoretical algorithmic complexity is O(n).

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.621-632
• /
• 2004

Recent measurement studies of real teletraffic data in modern telecommunication networks have shown that self-similar (or fractal) processes may provide better models of teletraffic in modern telecommunication networks than Poisson processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. A new generator of pseu-do-random self-similar sequences, based on the fractional Gaussian nois and a wavelet transform, is proposed and analysed in this paper. Specifically, this generator uses Daubechies wavelets. The motivation behind this selection of wavelets is that Daubechies wavelets lead to more accurate results by better matching the self-similar structure of long range dependent processes, than other types of wavelets. The statistical accuracy and time required to produce sequences of a given (long) length are experimentally studied. This generator shows a high level of accuracy of the output data (in the sense of the Hurst parameter) and is fast. Its theoretical algorithmic complexity is 0(n).

• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.145-154
• /
• 2004

The growing demand for customer-responsive, made-to-order manufacturing is stimulating the need for improved dynamic decision-making processes in commercial fleet operations. Moreover, the rapid growth of electronic commerce through the internet is also requiring advanced and precise real-time operation of vehicle fleets. Accompanying these demand side developments/pressures, the growing availability of technologies such as AVL(Automatic Vehicle Location) systems and continuous two-way communication devices is driving developments on the supply side. These technologies enable the dispatcher to identify the current location of trucks and to communicate with drivers in real time affording the carrier fleet dispatcher the opportunity to dynamically respond to changes in demand, driver and vehicle availability, as well as traffic network conditions. This research investigates key aspects of real time dynamic routing and scheduling problems in fleet operation particularly in a truckload pickup-and-delivery problem under various settings, in which information of stochastic demands is revealed on a continuous basis, i.e., as the scheduled routes are executed. The most promising solution strategies for dealing with this real-time problem are analyzed and integrated. Furthermore, this research develops. analyzes, and implements hybrid algorithms for solving them, which combine fast local heuristic approach with an optimization-based approach. In addition, various partitioning algorithms being able to deal with large fleet of vehicles are developed based on 'divided & conquer' technique. Simulation experiments are developed and conducted to evaluate the performance of these algorithms.