• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4355-4371
• /
• 2020

Phase retrieval, recovering a signal from phaseless measurements, is generally considered to be an NP-hard problem. This paper adopts an amplitude-based nonconvex optimization cost function to develop a new stochastic gradient algorithm, named stochastic reweighted phase retrieval (SRPR). SRPR is a stochastic gradient iteration algorithm, which runs in two stages: First, we use a truncated sample stochastic variance reduction algorithm to initialize the objective function. The second stage is the gradient refinement stage, which uses continuous updating of the amplitude-based stochastic weighted gradient algorithm to improve the initial estimate. Because of the stochastic method, each iteration of the two stages of SRPR involves only one equation. Therefore, SRPR is simple, scalable, and fast. Compared with the state-of-the-art phase retrieval algorithm, simulation results show that SRPR has a faster convergence speed and fewer magnitude-only measurements required to reconstruct the signal, under the real- or complex- cases.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.95.1-95
• /
• 2001

This paper is concerned with a novel S-stability (stochastic-stability) concept in linear time-invariant stochastic systems, where a stochastic mode in dynamics depends on both the external disturbance and the inner-parameter variations. This leads to an EAG (eigenstructure assignment gaussian) problem; that is, the problem of associating S-eigenvalues (stochastic-eigenvalues), S-eigenvectors (stochastic-eigenvectors), and their PDFs (probability density functions) with the stochastic information of the systems with the required stochastic specifications. These results explicitly characterize how S-eigenvalues, S-eigenvectors and their PDFs in the complex plane may impose S-stability on stochastic systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.3273-3308
• /
• 2017

Building appropriate trust evaluation models is an important research issue for security guarantee in social networks. Most of the existing works usually consider the trust values at the current time slot, and model trust as the stochastic variable. However, in fact, trust evolves over time, and trust is a stochastic process. In this paper, we propose a novel time-variant stochastic trust evaluation (TSTE) model, which models trust over time and captures trust evolution by a stochastic process. Based on the proposed model, we derive the time-variant bound of untrustworthy probability, which provides stochastic trust guarantee. On one hand, the time-variant trust level of each node can be measured by our model. Meanwhile, by tolerating nodes with relatively poor performance, our model can effectively improve the node resource utilization rate. Numerical simulations are conducted to verify the accuracy and consistency of the analytical bounds on distinguishing misbehaved nodes from normal ones. Moreover, simulation results on social network dataset show the tradeoff between trust level and resource utilization rate, and verify that the successful transmission rate can be improved by our model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.12
• /
• pp.2828-2835
• /
• 2015

In this paper, we analyse the effect of redundancy types and non-stop forwarding scheme on network service availability. We use stochastic reward net models as enabling modeling approach for the analytical evaluation. We first design stochastic reward nets for redundancy models with or without non-stop forwarding and then evaluate their availability using Stochastic Petri Net Package.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.4
• /
• pp.835-841
• /
• 2005

IGARCH and Stochastic Volatility Model(SVM, for short) have frequently provided useful approximations to the real aspects of financial time series. This article is concerned with modeling various Korean financial time series using both IGARCH and stochastic volatility models. Daily data sets with sample period ranging from 2000 and 2004 including KOSPI, KOSDAQ and won-dollar exchange rate are comparatively analyzed using IGARCH and SVM.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2003.05a
• /
• pp.1054-1057
• /
• 2003

A Real Time Mode Selecting Stochastic Controller (RTMSSC) is developed as a new control strategy for a vibrating system under irregular disturbance. Displacement information and frequency characteristics obtained from me::id analysis of the system are used to design a Mode Selecting Controller. This Paper explains design technique of RTNSSC by applying it to the suppression of a flexible beam experiencing random vibration. The RTMSSC is designed by stochastic control from the modal information. The frequency information of the flexible system is utilized from the Mode Selecting Unit (MSU) based on a Fast-Fourier Transformation algorithm. The performance of the proposed technique, RTMSSC, is compared with that of Real Time Stochastic Controller developed recently, which show quite promising results.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.411-419
• /
• 2016

This article investigates the problem of distributed channel selection in opportunistic spectrum access networks from a perspective of interference minimization. The traditional physical (PHY)-layer interference model is for information theoretic analysis. When practical multiple access mechanisms are considered, the recently developed binary medium access control (MAC)-layer interference model in the previous work is more useful, in which the experienced interference of a user is defined as the number of competing users. However, the binary model is not accurate in mathematics analysis with poor achievable performance. Therefore, we propose a real-valued one called stochastic MAC-layer interference model, where the utility of a player is defined as a function of the aggregate weight of the stochastic interference of competing neighbors. Then, the distributed channel selection problem in the stochastic MAC-layer interference model is formulated as a weighted stochastic MAC-layer interference minimization game and we proved that the game is an exact potential game which exists one pure strategy Nash equilibrium point at least. By using the proposed stochastic learning-automata based uncoupled algorithm with heterogeneous learning parameter (SLA-H), we can achieve suboptimal convergence averagely and this result can be verified in the simulation. Moreover, the simulated results also prove that the proposed stochastic model can achieve higher throughput performance and faster convergence behavior than the binary one.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.1
• /
• pp.43-48
• /
• 2016

We propose plain fingerprint classification based on a core stochastic algorithm that effectively uses a core stochastic model, acquiring more fingerprint minutiae and direction, in order to increase matching performance. The proposed core stochastic algorithm uses core presence/absence and contains a ridge direction and distribution map. Simulations show that the fingerprint classification accuracy is improved by more than 14%, on average, compared to other algorithms.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.18 no.2
• /
• pp.44-53
• /
• 1981

This paper deals with two quantization systems with a stochastic refernce and gives the unified statical properties of the two systems. The conditions are derived for the invariance of the output quantized signal with respect to the imput signal for the two systems and it is shown that they are same. The correlation function by a polarity method using stochastic reference signals is show to be a special case of the general properties derived here. We have also shown that the classical stochastic computing is derived from the general properties of the first system and that L.G. roberts has used a special characteristic of the general properties of the second system in his image processing.

• Journal of the military operations research society of Korea
• /
• v.31 no.2
• /
• pp.28-44
• /
• 2005

The previous studies approach the field artillery fire scheduling problem as deterministic and do not explicitly include information on the potential scenario changes. Unfortunately, the effort used to optimize fire sequences and reduce the total time of engagement is often inefficient as the collected military intelligence changes. Instead of modeling the fire sequencing problem as deterministic model, we consider a stochastic artillery fire scheduling model and devise a solution methodology to integrate possible enemy attack scenarios in the evaluation of artillery fire sequences. The goal is to use that information to find robust solutions that withstand disruptions in a better way, Such an approach is important because we can proactively consider the effects of certain unique scheduling decisions. By identifying more robust schedules, cascading delay effects will be minimized. In this paper we describe our stochastic model for the field artillery fire sequencing problem and offer revised robust stochastic model which considers worst scenario first. The robust stochastic model makes the solution more stable than the general two-stage stochastic model and also reduces the computational cost dramatically. We present computational results demonstrating the effectiveness of our proposed method by EVPI, VSS, and Variances.