• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권8호
• /
• pp.2607-2625
• /
• 2014

Previous studies on multiuser multiple-input multiple-output (MIMO) mostly assume a homogeneous signal-to-noise ratio (SNR), where each user has the same average SNR. However, real networks are more likely to feature heterogeneous SNRs (a random-valued average SNR). Motivated by this fact, we analyze a multiuser MIMO downlink with a zero-forcing (ZF) receiver in a heterogeneous SNR environment. A transmitter with Mantennas constructs M orthonormal beams and performs the SNR-based proportional fairness (S-PF) scheduling where data are transmitted to users each with the highest ratio of the SNR to the average SNR per beam. We develop a new analytical expression for the sum throughput of the multiuser MIMO system. Furthermore, simply modifying the expression provides the sum throughput for important special cases such as homogeneous SNR, max-rate scheduling, or high SNR. From the analysis, we obtain new insights (lemmas): i) S-PF scheduling maximizes the sum throughput in the homogeneous SNR and ii) under high SNR and a large number of users, S-PF scheduling yields the same multiuser diversity for both heterogeneous SNRs and homogeneous SNRs. Numerical simulation shows the interesting result that the sum throughput is not always proportional to M for a small number of users.

• Journal of Communications and Networks
• /
• 제12권3호
• /
• pp.222-230
• /
• 2010

In this paper, we present a closed-form approximation of the average sum rate of zero-forcing (ZF) beamforming (BF) with semi-orthogonal user selection (SUS). We first derive the survival probability associated with the SUS that absolute square of the channel correlation between two users is less than the orthogonalization level threshold (OLT).With this result, each distribution for the number of surviving users at each iteration of the SUS and the number of streams for transmission is calculated. Secondly, the received signal power of ZF-BF is represented as a function of the elements of the upper triangular matrix from QR decomposition of the channel matrix. Thirdly, we approximate the received signal power of ZF-BF with the SUS as the maximum of scaled chisquare random variables where the scaling factor is approximated as a function of both OLT and the number of users in the system. Putting all the above derivations and order statistics together, the approximated ergodic sum rate of ZF-BF with the SUS is shown in a closed form. The simulation results verify that the approximation tightly matches with the sample average for any OLT and even for a small number of users.

• 한국인터넷방송통신학회논문지
• /
• 제10권5호
• /
• pp.201-208
• /
• 2010

이동 Ad Hoc(MANET) 망은 노드들의 이동성으로 말미암아 망 구조가 수시로 바뀌는 동적인 특성을 가지고 있으며 이는 망의 성능 평가나 프로토콜 설계에 많은 도전적인 문제를 야기한다. 우리는 이동성이 망의 성능에 미치는 성능 측도로서 총 경로 붕괴시간, $\sum_{i}T_i$가 개별 연결뿐만 아니라 시스템 전체의 성능을 평가하는 측도로 사용될 수 있음을 보았다. 본 논문에서는 총 경로 붕괴시간 측도를 세 가지 다른 이동성 모델(Random Waypoint, Manhattan, Blocked Manhattan)에 적용하여 각 이동성 모델의 성능을 평가하고, 패킷 전달율, 종단 간 지연 등이 이동성 모델에 따라 왜 달라지는지를 규명하였다. 또한 AODV 라우팅 프로토콜 하에서 경로 붕괴에도 불구하고 AODV Buffer가 패킷전달율을 어떻게 높이고 종단 간 지연을 얼마만큼 증가 시키는지를 해석적으로 분석하였다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제9권1호
• /
• pp.99-110
• /
• 2005

This paper suggests an efficient approach for stochastic bicriteria programming problem (SBCPP) with random variables in both the objective functions and in the right-hand side of the constraints. The suggested approach uses the statistical inference through two different techniques: In one of them, the SBCPP is transformed into an equivalent deterministic bicriteria programming problem (DBCPP), then the nonnegative weighted sum approach will be used to transform the bicriteria programming problem into a single objective programming problem, and the other technique, the nonnegative weighted sum approach is used to transform the SBCPP to an equivalent stochastic single objective programming problem, then apply the same procedure to convert stochastic single objective programming problem into its equivalent deterministic single objective programming problem (DSOPP). In both techniques the resulting problem can be solved as a nonlinear programming problem to get the efficient solutions. Finally, a comparison between the two different techniques is discussed, and illustrated example is given to demonstrate the actual application of these techniques.

• 한국추진공학회:학술대회논문집
• /
• 한국추진공학회 2007년도 제28회 춘계학술대회논문집
• /
• pp.258-261
• /
• 2007

본 논문은 항공엔진이 전 운용범위 및 운용조건에서 성능요구조건을 만족할 수 있도록 설계 및 운용 한계를 설정하는 MEPS 기법에 관한 내용이다. 대기습도, 엔진품질, 추력설정부정확 및 성능감쇠 등의 영향이 산술적으로 반영되는 Direct Adder와 Root Sum Square로 반영되는 Random Adder에 대해 기술하였다. 본 기법을 4,000Ib급의 상용 터보팬 엔진개발에 적용하여, 각 Adder의 영향성을 분석하여 엔진설계 및 운용한계 설정을 위한 MEPS를 구축하였다.

• 한국멀티미디어학회논문지
• /
• 제13권6호
• /
• pp.875-883
• /
• 2010

In this paper, we present a secure biometric hashing scheme for face recognition by random fusion of global and local features. The Fourier-Mellin transform and Radon transform are adopted respectively to form specialized representation of global and local features, due to their invariance to geometric operations. The final biometric hash is securely generated by random weighting sum of both feature sets. A fourfold key is involved in our algorithm to ensure the security and privacy of biometric templates. The proposed biometric hash can be revocable and replaced by using a new key. Moreover, the attacker cannot obtain any information about the original biometric template without knowing the secret key. The experimental results confirm that our scheme has a satisfactory accuracy performance in terms of EER.

• 호남수학학술지
• /
• 제34권2호
• /
• pp.241-252
• /
• 2012

Let $\{X_{ni},\;1{\leq}i{\leq}n,\;n{\geq}1\}$ be a sequence of LNQD which are dominated randomly by another random variable X. We obtain the complete convergence and almost sure convergence of weighted sums ${\sum}^n_{i=1}a_{ni}X_{ni}$ for LNQD by using a new exponential inequality, where $\{a_{ni},\;1{\leq}i{\leq}n,\;n{\geq}1\}$ is an array of constants. As corollary, the results of some authors are extended from i.i.d. case to not necessarily identically LNQD case.

• International Journal of Control, Automation, and Systems
• /
• 제6권3호
• /
• pp.444-452
• /
• 2008

We propose an intelligent predictive control approach for a nonlinear networked control system (NCS) with time-varying delay and random observation. The control is given by the sum of a nominal control and a corrective control. The nominal control is determined analytically using a linearized system model with fixed time delay. The corrective control is generated online by a neural network optimizer. A Markov chain (MC) dynamic Bayesian network (DBN) predicts the dynamics of the stochastic system online to allow predictive control design. We apply our proposed method to a satellite attitude control system and evaluate its control performance through computer simulation.

• Structural Engineering and Mechanics
• /
• 제53권6호
• /
• pp.1127-1141
• /
• 2015

The optimum design of liquid column dampers in seismic vibration control considering system parameter uncertainty is usually performed by minimizing the unconditional response of a structure without any consideration to the variation of damper performance due to uncertainty. However, the system so designed may be sensitive to the variations of input system parameters due to uncertainty. The present study is concerned with robust design optimization (RDO) of liquid column vibration absorber (LCVA) considering random system parameters characterizing the primary structure and ground motion model. The RDO is obtained by minimizing the weighted sum of the mean value of the root mean square displacement of the primary structure as well as its standard deviation. A numerical study elucidates the importance of the RDO procedure for design of LCVA system by comparing the RDO results with the results obtained by the conventional stochastic structural optimization procedure and the unconditional response based optimization.

• 대한안전경영과학회지
• /
• 제15권1호
• /
• pp.77-85
• /
• 2013

In the location science, environmental effect becomes a new main consideration for site selection. For the unwanted facility location selection, decision makers should consider the cost of resolving the environmental conflict. We introduced the negative influence cost for the facility which was inversely proportional to distance between the facility and residents. An unwanted facility location problem was suggested to minimize the sum of the negative influence cost and the transportation cost. The objective cost function was analyzed as nonlinear type and was neither convex nor concave. Three GRASP (Greedy Randomized adaptive Search Procedure) methods as like Random_GRASP, Epsilon_GRASP and GRID_GRASP were developed to solve the unwanted facility location problem. The Newton's method for nonlinear optimization problem was used for local search in GRASP. Experimental results showed that quality of solution of the GRID_GRASP was better than those of Random_GRASP and Epsilon_GRASP. The calculation time of Random_GRASP and Epsilon_GRASP were faster than that of Grid_GRASP.