• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.80-85
• /
• 2008

Images are often corrupted by noises during signal acquisition and transmission. Among those noises, additive white Gaussian noise (AWGN) and impulse noise are most representative. For different types of noise have different characters, how to remove them separately from degraded image is one of the most fundamental problems. Thus, a modified image restoration algorithm is proposed in this paper, which can not only remove impulse noise of random values, but also remove the AWGN selectively. The noise detection step is by calculating the intensity difference and the spatial distance between pixels in a mask. To divide two different noises, the method is based on three weighted parameters. And the weighted parameters in the filtering mask depend on spatial distances, positions of impulse noise and standard deviation of AWGN. We also use the peak signal-to-noise ratio (PSNR) to evaluate restoration performance, and simulation results demonstrate that the proposed method performs better than conventional median-type filters, in preserving edge details.

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.3
• /
• pp.615-623
• /
• 2013

In this paper we establish a central limit theorem for weighted sums of $Y_n={\sum_{i=1}^{n}}a_n,_iX_i$, where $\{a_{n,i},\;n{\in}N,\;1{\leq}i{\leq}n\}$ is an array of nonnegative numbers such that ${\sup}_{n{\geq}1}{\sum_{i=1}^{n}}a_{n,i}^2$ < ${\infty}$, ${\max}_{1{\leq}i{\leq}n}a_{n,i}{\rightarrow}0$ and $\{X_i,\;i{\in}N\}$ is a sequence of linear negatively quadrant dependent random variables with $EX_i=0$ and $EX_i^2$ < ${\infty}$. Using this result we will obtain a central limit theorem for partial sums of linear processes.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.2
• /
• pp.183-192
• /
• 2000

This paper considers the problem of scheduling a set of n jobs on m parallel machines to minimize total weighted tardiness. For the problem a genetic algorithm is proposed, in which solutions are encoded using the random key method suggested by Bean and new crossover operators are employed to increase performance of the algorithm. The algorithm is compared with the Modified Due-Date (MDD) algorithm after series of tests to find appropriate values for genetic parameters. Results of computational tests on randomly generated test problems show that the suggested algorithm performs better than the MDD algorithm and gives good solutions in a reasonable amount of computation time.

• The Journal of Natural Sciences
• /
• v.8 no.2
• /
• pp.5-7
• /
• 1996

Let {X,$X_n$,n$\geq$1} be i.i.d. random variables with mean zero and {$a_ni$, 1$\leq$i$\leq$n,n$\geq$1} a triangular array of constants. In this paper we give sufficient conditions on X and {$a_ni$} such that $sum_{i=1}^n$$a_{ni}$$X_i$ converges to zero almostly surely.

• Communications for Statistical Applications and Methods
• /
• v.17 no.2
• /
• pp.183-191
• /
• 2010

Support vector quantile regression(SVQR) is capable of providing more complete description of the linear and nonlinear relationships among random variables. In this paper we propose an iterative reweighted least squares(IRWLS) procedure to solve the problem of SVQR with a weighted quadratic loss function. Furthermore, we introduce the generalized approximate cross validation function to select the hyperparameters which affect the performance of SVQR. Experimental results are then presented which illustrate the performance of the IRWLS procedure for SVQR.

• Journal of applied mathematics & informatics
• /
• v.42 no.3
• /
• pp.709-723
• /
• 2024

We study the distributions of waiting times in variations of the geometric distribution of order k. Variation imposes length on the runs of successes and failures. We study two types of waiting time random variables. First, we consider the waiting time for a run of k consecutive successes the first time no sequence of consecutive k failures occurs prior, denoted by T^(k). Next, we consider the waiting time for a run of k consecutive failures the first time no sequence of k consecutive successes occurred prior, denoted by J^(k). In addition, we study the distribution of the weighted average. The exact formulae of the probability mass function, mean, and variance of distributions are also obtained.

• Structural Engineering and Mechanics
• /
• v.52 no.2
• /
• pp.405-426
• /
• 2014

In this paper, a new meta-heuristic algorithm named Ranked Particles Optimization (RPO), is presented. This algorithm is not inspired from natural or physical phenomena. However, it is based on numerous researches in the field of meta-heuristic optimization algorithms. In this algorithm, like other meta-heuristic algorithms, optimization process starts with by producing a population of random solutions, Particles, located in the feasible search space. In the next step, cost functions corresponding to all random particles are evaluated and some of those having minimum cost functions are stored. These particles are ranked and their weighted average is calculated and named Ranked Center. New solutions are produced by moving each particle along its previous motion, the ranked center, and the best particle found thus far. The robustness of this algorithm is verified by solving some mathematical and structural optimization problems. Simplicity of implementation and reaching to desired solution are two main characteristics of this algorithm.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.1E
• /
• pp.26-32
• /
• 2003

We propose new time-frequency (TF) tools for analyzing linear time-varying (LTV) systems and nonstationary random processes showing hyperbolic TF structure. Obtained through hyperbolic warping the narrowband Weyl symbol (WS) and spreading function (SF) in frequency, the new TF tools are useful for analyzing LTV systems and random processes characterized by hyperbolic time shifts. This new TF symbol, called the hyperbolic WS, satisfies the hyperbolic time-shift covariance and scale covariance properties, and is useful in wideband signal analysis. Using the new, hyperbolic time-shift covariant WS and 2-D TF kernels, we provide a formulation for the hyperbolic time-shift covariant TF symbols, which are 2-D smoothed versions of the hyperbolic WS. We also propose a new interpretation of linear signal transformations as weighted superposition of hyperbolic time shifted and scale changed versions of the signal. Application examples in signal analysis and detection demonstrate the advantages of our new results.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.628-632
• /
• 2001

We propose time-frequency (TF) tools for analyzing linear time-varying (LTV) systems and nonstationary random processes. Obtained warping the narrowband Weyl symbol (WS) and spreading function (SF), the new TF tools are useful for analyzing LTV systems and random processes characterized by generalized frequency shifts, This new Weyl symbol (WS) is useful in wideband signal analysis. We also propose WS an tools for analyzing systems which produce dispersive frequency shifts on the signal. We obtain these generalized, frequency-shift covariant WS by warping conventional, narrowband WS. Using the new, generalized WS, we provide a formulation for the Weyl correspondence for linear systems with instantaneous of linear signal transformation as weighted superpositions of non-linear frequency shifts on the signal. Application examples in signal and detection demonstrate the advantages of our new results.

• Journal of information and communication convergence engineering
• /
• v.16 no.1
• /
• pp.6-11
• /
• 2018

It is important to find the random estimation points in wireless sensor network. A link quality indicator (LQI) is part of a network management service that is suitable for a ZigBee network and can be used for localization. The current quality of the received signal is referred as LQI. It is a technique to demodulate the received signal by accumulating the magnitude of the error between ideal constellations and the received signal. This proposed model accepts any number of random estimation point in the network and calculated its nearest anchor centroid node pair. Coordinates of the LQI sphere are calculated from the pair and are added iteratively to the initially estimated point. With the help of the LQI and weighted centroid localization, the proposed system finds the position of target node more accurately than the existing system by solving the problems related to higher error in terms of the distance and the deployment of nodes.