• 대한수학회지
• /
• 제41권5호
• /
• pp.883-894
• /
• 2004

We discuss in this paper the strong convergence for weighted sums of negative associated (in abbreviation: NA) arrays. Meanwhile, the central limit theorem for weighted sums of NA variables and linear process based on NA variables is also considered. As corollary, we get the results on iid of Li et al. ([10]) in NA setting.

• 대한수학회보
• /
• 제54권3호
• /
• pp.935-952
• /
• 2017

It is natural to try to find a kernel such that its convolution of integrable functions converges faster than that of the $Fej{\acute{e}}r$ kernel. In this paper, we introduce a weighted Fourier partial sums which are written as the convolution of signed good kernels and prove that the weighted Fourier partial sum converges in $L^2$ much faster than that of the $Ces{\grave{a}}ro$ means. In addition, we present two numerical experiments.

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

This study presents a power and Physical Resource Blocks (PRBs) joint allocation algorithm to coordinate uplink (UL) interference in the device-to-device (D2D) underlaying Long Term Evolution-Advanced (LTE-A) networks. The objective is to find a mechanism to mitigate the UL interference between the two subsystems and maximize the weighted sum throughput as well. This optimization problem is formulated as a mixed integer nonlinear programming (MINLP) which is further decomposed into PRBs assignment and transmission power allocation. Specifically, the scenario of applying imperfect channel state information (CSI) is also taken into account in our study. Analysis reveals that the proposed PRBs allocation strategy is energy efficient and it suppresses the interference not only suffered by the LTE-A system but also to the D2D users. In another side, a low-complexity technique is proposed to obtain the optimal power allocation which resides in one of at most three feasible power vectors. Simulations show that the optimal power allocation combined with the proposed PRBs assignment achieves a higher weighted sum throughput as compared to traditional algorithms even when imperfect CSI is utilized.

• Journal of Communications and Networks
• /
• 제12권5호
• /
• pp.449-458
• /
• 2010

In this paper, we present a distributed resource allocation algorithm for multi-cell uplink systems that increases the weighted sum of the average data rates over the entire network under the average transmit power constraint of each mobile station. For the distributed operation, we arrange each base station (BS) to allocate the resource such that its own utility gets maximized in a noncooperative way. We define the utility such that it incorporates both the weighted sum of the average rates in each cell and the induced interference to other cells, which helps to instigate implicit cooperation among the cells. Since the data rates of different cells are coupled through inter-cell interferences, the resource allocation taken by each BS evolves over iterations. We establish that the resource allocation converges to a unique fixed point under reasonable assumptions. We demonstrate through computer simulations that the proposed algorithm can improve the weighted sum of the average rates substantially without requiring any coordination among the base stations.

• Journal of the Korean Data and Information Science Society
• /
• 제25권2호
• /
• pp.423-429
• /
• 2014

본 논문은 이원고정효과모형의 분산분석에서 오차의 독립성과 등분산성이 만족되지 않는 경우를 가정하고 있다. 자료분석을 위한 모수추정방법으로 가중최소제곱법을 가정하고 있으며 모수를 추정하기 위한 방법으로 모형의 순차적 적합방식을 이용하고 있다. 또한, 모형의 행렬표현식으로부터 벡터공간에서의 사영을 이용하여 자료를 분석하는 방법을 제시하고 있다. 모형의 순차적 적합에 해당하는 제1종 제곱합을 구하기 위하여 모형행렬에 의한 부분공간으로의 사영을 다루고 있다. 이 경우에 사영에 의한 제곱합을 사영제곱합으로 취급한다.

• International Journal of Aeronautical and Space Sciences
• /
• 제14권4호
• /
• pp.324-333
• /
• 2013

The purpose of this paper is to improve the efficiency of multi-objective topology optimization using a genetic algorithm (GA) with bar-system representation. We proposed a new GA using an elite initial population obtained from a Solid Isotropic Material with Penalization (SIMP) using a weighted sum method. SIMP with a weighted sum method is one of the most established methods using sensitivity analysis. Although the implementation of the SIMP method is straightforward and computationally effective, it may be difficult to find a complete Pareto-optimal set in a multi-objective optimization problem. In this study, to build a more convergent and diverse global Pareto-optimal set and reduce the GA computational cost, some individuals, with similar topology to the local optimum solution obtained from the SIMP using the weighted sum method, were introduced for the initial population of the GA. The proposed method was applied to a structural topology optimization example and the results of the proposed method were compared with those of the traditional method using standard random initialization for the initial population of the GA.

• 충청수학회지
• /
• 제26권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.

• 통합자연과학논문집
• /
• 제8권2호
• /
• pp.145-146
• /
• 2015

In this note, we provide some examples of polynomials $z^n-p(z)$, where $p(z)={\limits\sum_{k=o}^{n-1}}a_kz^k$, and ${\limits\sum_{k=o}^{n-1}}a_kz^k=1$, $a_k{\geq}0$ for each k such that p(z) has all its zeros on ${\mid}z{\mid}=c<1$, and $z^n-p(z)$ has all its zeros on two circles ${\mid}z{\mid}=1$ and ${\mid}z{\mid}=d<1$.

• Communications for Statistical Applications and Methods
• /
• 제29권4호
• /
• pp.487-498
• /
• 2022

Social network analysis (SNA) techniques have recently been developed to monitor and detect abnormal behaviors in social networks. As a useful tool for process monitoring, control charts are also useful for network monitoring. In this paper, the degree and closeness centrality measures, in which each has global and local perspectives, respectively, are applied to an exponentially weighted moving average (EWMA) chart and a multinomial cumulative sum (CUSUM) chart for monitoring undirected weighted networks. In general, EWMA charts monitor only one variable in a single chart, whereas multinomial CUSUM charts can monitor a categorical variable, in which several variables are transformed through classification rules, in a single chart. To monitor both degree centrality and closeness centrality simultaneously, we categorize them based on the average of each measure and then apply to the multinomial CUSUM chart. In this case, the global and local attributes of the network can be monitored simultaneously with a single chart. We also evaluate the performance of the proposed procedure through a simulation study.

• 디지털융복합연구
• /
• 제12권8호
• /
• pp.321-327
• /
• 2014

특징 선택은 중복 또는 서로간의 관련이 없는 특징을 제거하여 분류 성능을 향상시키는 기술이다. 본 논문에서는 가중 퍼지소속함수 기반 신경망 (Neural Network with Weighted Fuzzy Membership Functions; NEWFM)에서 제공하는 가중 퍼지소속함수의 경계합 (Bounded Sum of Weighted Fuzzy Membership functions, BSWFM)의 무게중심간의 거리를 이용한 새로운 특징 선택을 제안하여 분류 성능을 향상시켰다. 이러한 거리 기반의 특징 선택을 이용하여 초기 24개의 특징으로부터 무게중심간의 거리가 짧은 특징을 하나씩 제거되면서 분류 성능이 가능 높은 22개의 최소 특징을 선택하였다. 이들 22개의 최소 특징을 NEWFM의 입력으로 사용하여 97.7%, 99.7%, 98.7%의 민감도, 특이도, 정확도를 각각 구하였다.