• Journal of the military operations research society of Korea
• /
• v.24 no.1
• /
• pp.110-131
• /
• 1998

A stochastic modeling of combat that takes more realistic situations into account has been studied with deep concern. Either the firing strategies or network formations are very important elements in the analysis of combat. The first objective of this study is to evaluate how the different strategies affect the outcomes of combat. An analytical approach has been used in an attempt to understand a small-sized battle. The results are validated and compared with existing simulation models. Extending to the moderate size of battle may be achieved with ease. Secondly, an attempt has been made to study and investigate a way to solve combat in a different fashion. We divided a two-on-two battle into two separate one-on-one battles and connected them into a network. New elements considered such as delay time of starting a firefight on a particular node or search time for the next target when a kill occurs are defined and used as the input parameters. The discussions are made to validate the hypothesized model and ask if the results are meaningful and useful in the analysis of combat operations or not.

• Journal of KSNVE
• /
• v.10 no.6
• /
• pp.941-948
• /
• 2000

Active noise control is an approach to reduce the noise by utilizing a secondary noise source that destructively interferes with the unwanted noise. In general, active noise control systems rely on multiple sensors to measure the unwanted noise field and the effect of the cancellation. This paper develops an approach that utilizes a single sensor. The noise field is modeled as a stochastic process, and an adaptive algorithm is used to adaptively estimate the parameters of the process. Based on these parameter estimates, a canceling signal is generated. Oppenheim assumed that transfer function characteristics from the canceling source to the error sensor is only a propagation delay. This paper proposes a modified Oppenheim algorithm by considering transfer characteristics of speaker-path-sensor This transfer characteristics is adaptively cancelled by the proposed adaptive modeling technique. Feasibility of the proposed method is proved by computer simulations with artificially generated random noises and sine wave noise. The details of the proposed architecture. and theoretical simulation of the noise cancellation system for three dimension enclosure are presented in the Paper.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.4034-4053
• /
• 2015

In order to meet various requirements for transmission quality of both primary users (PUs) and secondary users (SUs) in cognitive radio networks, we introduce a channel bonding mechanism for PUs and a channel reservation mechanism for SUs, then we propose a novel spectrum allocation strategy. Taking into account the mistake detection and false alarm due to imperfect channel sensing, we establish a three-dimensional Markov chain to model the stochastic process of the proposed strategy. Using the method of matrix geometric solution, we derive the performance measures in terms of interference rate of PU packets, average delay and throughput of SU packets. Moreover, we investigate the influence of the number of the reserved (resp. licensed) channels on the system performance with numerical experiments. Finally, to optimize the proposed strategy socially, we provide a charging policy for SU packets.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.4 s.310
• /
• pp.35-44
• /
• 2006

The network induced transmission delay deteriorates the performance and stability of the real-time distributed control system on LonWorks over IP (LonWorks/IP) virtual device network (VDN). LonWorks/IP virtual device network is an integrated form of LonWorks device network and IP data network. The time delay in servo control on the LonWorks/IP-based VDN has highly stochastic nature. In the real-time distributed servo applications for predictive maintenance on the factory floor, timely response is essential.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.97-104
• /
• 2001

In this paper, we present a new hierarchical model for performance analysis of channel allocation and packet service protocol in wireless n network. The proposed hierarchical model consists of two parts : upper and lower layer models. The upper layer model is the structure state model representing the state of the channel allocation and call service. The lower layer model, which captures the performance of the system within a given structure state, is the wireless packet retransmission protocol model. These models are developed using SRN which is an modeling tool. SRN, an extension of stochastic Petri net, provides compact modeling facilities for system analysis. To get the performance index, appropriate reward rates are assigned to its SRN. Fixed point iteration is used to determine the model parameters that are not available directly as input. That is, the call service time of the upper model can be obtained by packet delay in the lower model, and the packet generation rates of the lower model come from call generation rates of the upper model.

• Journal of Digital Convergence
• /
• v.11 no.12
• /
• pp.479-485
• /
• 2013

Virtualization is a promising approach to consolidating multiple online services onto a smaller number of computing resources. A virtualized server environment allows computing resources to be shared among multiple performance isolated platforms called virtual machines. Through server virtualization software, applications servers are encapsulated into VMs, and deployed with APIs on top generalized pools of CPU and memory resources. Networking and security have been moved to a software abstraction layer that transformed computing, network virtualization. And it paves the way for enterprise to rapidly deploy networking and security for any application by creating the virtual network. Stochastic reward net (SRN) is an extension of stochastic Petri nets which provides compact modeling facilities for system analysis. In this paper, we develop SRN model of network virtualization based on virtual switch. Measures of interest such as switching delay and throughput are considered. These measures are expressed in terms of the expected values of reward rate functions for SRNs. Numerical results are obtained according to the virtual switch capacity and number of active VMs.

• Journal of Korean Society of Transportation
• /
• v.17 no.5
• /
• pp.137-149
• /
• 1999

For decades, many traffic flow studies on the analysis and determination of level of service (LOS) for the weaving sections have been made to Provide several regression equations. Weaving and non-weaving speeds were dependent variables for the equations, with independent variables being weaving length, number of lanes, and weaving ratios. One of the difficulties in developing the equations was that the weaving areas were rare in Korea, so the statistical analyses for calibrating the equation parameter could not be performed in a desirable manner. In this regard, a new and stochastic methodology for predicting the weaving and non-weaving speeds within the weaving sections was required. In this study the following design variables were developed; influence area of the weaving section. headway distribution within the weaving section, maximum weaving volume of the weaving section, length of the ideal weaving section, and speed estimations for the weaving and non-weaving flows. The evaluation of the new model was made comparing the delay in the weaving section with the one in the freeway basic section.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.8 s.350
• /
• pp.35-43
• /
• 2006

In the paper, we propose a new method for power optimization that uses path balancing based on stochastic estimation of glitch in Statistical Static Timing Analysis (SSTA). The proposed method estimates the probability of glitch occurrence using tightness probability of each node in timing graph. In addition, we propose efficient gate sizing technique for glitch reduction using accurate calculation of sizing effect in delay considering probability of glitch occurrence. The efficiency of proposed method has been verified on ISCAS85 benchmark circuits with $0.16{\mu}m$ model parameters. Experimental results show up to 8.6% of accuracy improvement in glitch estimation and 9.5% of optimization improvement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2473-2492
• /
• 2012

Energy conservation is a vital issue in wireless sensor networks. Recently, employing mobile sinks for data gathering become a pervasive trend to deal with this problem. The sink can follow stochastic or pre-defined paths; however the controlled mobility pattern nowadays is taken more into consideration. In this method, the sink moves across the network autonomously and changes its position based on the energy factors. Although the sink mobility would reduce nodes' energy consumption and enhance the network lifetime, the overhead caused by topological changes could waste unnecessary power through the sensor field. In this paper, we proposed EEDARS, an energy-efficient dual-sink algorithm with role switching mechanism which utilizes both static and mobile sinks. The static sink is engaged to avoid any periodic flooding for sink localization, while the mobile sink adaptively moves towards the event region for data collection. Furthermore, a role switching mechanism is applied to the protocol in order to send the nearest sink to the recent event area, hence shorten the path. This algorithm could be employed in event-driven and multi-hop scenarios. Analytical model and extensive simulation results for EEDARS demonstrate a significant improvement on the network metrics especially the lifetime, the load and the end-to-end delay.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.14 no.1
• /
• pp.11-18
• /
• 2012

Daily temperature data produced by harmonic analysis of monthly climate summary have been used as an input to plant phenology model. This study was carried out to evaluate the performance of the harmonic based daily temperature data in prediction of major phenological developments and to apply the results in improving decision support for agricultural production in relation to the climate change scenarios. Daily maximum and minimum temperature data for a climatological normal year (Jan. 1 to Dec. 31, 1971-2000) were produced by harmonic analysis of the monthly climate means for Seoul weather station. The data were used as inputs to a thermal time - based phenology model to predict dormancy, budburst, and flowering of Japanese cherry in Seoul. Daily temperature measurements at Seoul station from 1971 to 2000 were used to run the same model and the results were compared with the harmonic data case. Leaving no information on annual variation aside, the harmonic based simulation showed 25 days earlier release from endodormancy, 57 days longer period for maximum cold tolerance, delayed budburst and flowering by 14 and 13 days, respectively, compared with the simulation based on the observed data. As an alternative to the harmonic data, 30 years daily temperature data were generated by a stochastic process (SIMMETEO + WGEN) using climatic summary of Seoul station for 1971-2000. When these data were used to simulate major phenology of Japanese cherry for 30 years, deviations from the results using observed data were much less than the harmonic data case: 6 days earlier dormancy release, 10 days reduction in maximum cold tolerance period, only 3 and 2 days delay in budburst and flowering, respectively. Inter-annual variation in phenological developments was also in accordance with the observed data. If stochastically generated temperature data could be used in agroclimatic mapping and zoning, more reliable and practical aids will be available to climate change adaptation policy or decision makers.