• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.1
• /
• pp.202-215
• /
• 2023

This paper proposes a non-orthogonal multiple access (NOMA) based low-complexity relaying approach for multiuser cellular two-way relay channels (CTWRCs). In the proposed scheme, the relay detects the signal using successive interference cancellation (SIC) and re-generates the transmit signal with zero-forcing (ZF) transmit precoding. The achievable data rates of the NOMA-based multiuser two-way relaying (TWR) approach is analyzed. We further study the power allocation among different data streams to maximize the weighted sum-rate (WSR). We re-form the resultant non-convex problem into a standard monotonic program. Then, we design a polyblock outer approximation algorithm to sovle the WSR problem.The proposed optimal power allocation algorithm converges fast and it is shown that the NOMA-TWR-OPA scheme outperforms a NOMA benchmark scheme and conventional TWR schemes.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.4
• /
• pp.943-956
• /
• 2023

Let p(z) be a polynomial of degree n and for any complex number 𝛽, let D_𝛽p(z) = np(z) + (𝛽 - z)p'(z) denote the polar derivative of the polynomial with respect to 𝛽. In this paper, we consider the class of polynomial $$p(z)=(z-z_0)^s \left(a_0+\sum\limits_{{\nu}=0}^{n-s}a_{\nu}z^{\nu}\right)$$ of degree n having a zero of order s at z₀, |z₀| < 1 and the remaining n - s zeros are outside |z| < k, k ≥ 1 and establish upper bound estimates for the maximum of |D_𝛽p(z)| as well as |p(Rz) - p(rz)|, R ≥ r ≥ 1 on the unit disk.

• Kyungpook Mathematical Journal
• /
• v.64 no.2
• /
• pp.271-286
• /
• 2024

In this paper, we prove the existence of distributional solutions in the anisotropic Sobolev space $\mathring{W}^{1,\overrightarrow{p}(\cdot)}(\Omega)$ with variable exponents and zero boundary, for a class of variable exponents anisotropic nonlinear elliptic equations having a compound nonlinearity $G(x, u)=\sum_{i=1}^{N}(\left|f\right|+\left|u\right|)^{p_i(x)-1}$ on the right-hand side, such that f is in the variable exponents anisotropic Lebesgue space $L^{\vec{p}({\cdot})}(\Omega)$, where $\vec{p}({\cdot})=(p_1({\cdot}),{\ldots},p_N({\cdot})){\in}(C(\bar{\Omega},]1,+{\infty}[))^N$.

• Korean journal of applied entomology
• /
• v.61 no.4
• /
• pp.549-554
• /
• 2022

Life table-related studies in insect ecology have been an interesting topic for insect researchers. Two calculation methods are commonly applied to estimate the intrinsic rate of natural increase (r_m) in the life table statistics. The first method is to estimate an approximate r_m by dividing the natural logarithm of the net reproductive rate (R₀) by mean generation time (T) (namely mean generation time-based method). Another approach is to apply the Lotka-Euler equation derived from the population growth equation of Lotka-Volterra to estimate accurate r_m using the maximum likelihood method (Lotka-Euler equation-based method). In the latter case, there is a difference in the estimated r_m value when the initial age class of the target cohort was set to "0" or "1", which confused the application. In this short review, a brief history of the calculation process of the life table was reviewed. It was again confirmed in the Lotka-Euler equation-based method that the form of $\sum\limits_{x=1}^{w}e^{-rx}l_xm_x=1$ should be applied to estimate r_m when the first age class was set to zero, while the form of $\sum\limits_{x=0}^{w}e^{-r(x+1)}l_xm_x=1$ when set to one.

• Korean Journal of Remote Sensing
• /
• v.34 no.6_2
• /
• pp.1251-1260
• /
• 2018

High-quality sea-ice surface models generated from aerial images can be used effectively as field data for developing satellite-based remote sensing methods but also as analysis data for understanding geometric variations of Arctic sea-ice. However, the lack of texture information on sea-ice surfaces can reduce the accuracy of image matching. In this paper, we analyze the performance of matching cost functions for homogeneous sea-ice surfaces as a part of high-quality sea-ice surface model generation. The matching cost functions include sum of squared differences (SSD), normalized cross-correlation (NCC), and zero-mean normalized cross-correlation (ZNCC) in image domain and phase correlation (PC), orientation correlation (OC), and gradient correlation (GC) in frequency domain. In order to analyze the matching performance for texture changes clearly and objectively, a new evaluation methodology based on the principle of object-space matching technique was introduced. Experimental results showed that it is possible to secure reliability and accuracy of image matching only when optimal search windows are variably applied to each matching point in textureless regions such as sea-ice surfaces. Among the matching cost functions, NCC and ZNCC showed the best performance for texture changes.

• Communications of the Korean Mathematical Society
• /
• v.32 no.1
• /
• pp.193-200
• /
• 2017

Given a pair p, q of relative prime positive integers, we have uniquely determined positive integers x, y, u and v such that vx-uy = 1, p = x + y and q = u + v. Using this property, we show that$${\sum\limits_{1{\leq}i{\leq}x,1{\leq}j{\leq}v}}\;{t^{(i-1)q+(j-1)p}\;-\;{\sum\limits_{1{\leq}k{\leq}y,1{\leq}l{\leq}u}}\;t^{1+(k-1)q+(l-1)p}$$ is the Alexander polynomial ${\Delta}_{p,q}(t)$ of a torus knot t(p, q). Hence the number $N_{p,q}$ of non-zero terms of ${\Delta}_{p,q}(t)$ is equal to vx + uy = 2vx - 1. Owing to well known results in knot Floer homology theory, our expanding formula of the Alexander polynomial of a torus knot provides a method of algorithmically determining the total rank of its knot Floer homology or equivalently the complexity of its (1,1)-diagram. In particular we prove (see Corollary 2.8); Let q be a positive integer> 1 and let k be a positive integer. Then we have $$\begin{array}{rccl}(1)&N_{kq}+1,q&=&2k(q-1)+1\\(2)&N_{kq}+q-1,q&=&2(k+1)(q-1)-1\\(3)&N_{kq}+2,q&=&{\frac{1}{2}}k(q^2-1)+q\\(4)&N_{kq}+q-2,q&=&{\frac{1}{2}}(k+1)(q^2-1)-q\end{array}$$ where we further assume q is odd in formula (3) and (4). Consequently we confirm that the complexities of (1,1)-diagrams of torus knots of type t(kq + 2, q) and t(kq + q - 2, q) in [5] agree with $N_{kq+2,q}$ and $N_{kq+q-2,q}$ respectively.

• Journal of the Korean Mathematical Society
• /
• v.36 no.6
• /
• pp.1061-1073
• /
• 1999

Let X be a real normed linear space. Let T : D(T) ⊂ X \longrightarrow X be a uniformly continuous and ∮-strongly quasi-accretive mapping. Let {${\alpha}$n}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} , {${\beta}$n}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} be two real sequences in [0, 1] satisfying the following conditions: (ⅰ) ${\alpha}$n \longrightarrow0, ${\beta}$n \longrightarrow0, as n \longrightarrow$\infty$ (ⅱ) {{{{ SUM from { { n}=0} to inf }}}} ${\alpha}$=$\infty$. Set Sx=x-Tx for all x $\in$D(T). Assume that {u}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} and {v}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} are two sequences in D(T) satisfying {{{{ SUM from { { n}=0} to inf }}}}∥un∥<$\infty$ and vn\longrightarrow0 as n\longrightarrow$\infty$. Suppose that, for any given x0$\in$X, the Ishikawa type iteration sequence {xn}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} with errors defined by (IS)1 xn+1=(1-${\alpha}$n)xn+${\alpha}$nSyn+un, yn=(1-${\beta}$n)x+${\beta}$nSxn+vn for all n=0, 1, 2 … is well-defined. we prove that {xn}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} converges strongly to the unique zero of T if and only if {Syn}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} is bounded. Several related results deal with iterative approximations of fixed points of ∮-hemicontractions by the ishikawa iteration with errors in a normed linear space. Certain conditions on the iterative parameters {${\alpha}$n}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} , {${\beta}$n}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} and t are also given which guarantee the strong convergence of the iteration processes.

• Hwankyungkyoyuk
• /
• v.10 no.2
• /
• pp.51-62
• /
• 1997

The objective of this study was to review the meaning and problems of Scientific Knowledge and Ethical Value in Environmental Education. The ultimate goal of environmental education is shaping proenvironmental human behavior. The factors of human behavioral decision making are ideology, value, attitude and behavioral intentions. Ideology is a kind of belief system used by social groups to interpret their social world. The main elements of belief system are knowledge and value. The traditional thinking in education has been that we can change behavior by making human beings more knowledgeable and more valuable. In environmental education, the aim of scientific inquiry is to analysis cause-effect relation of human beings behavior and environmental phenomenon, and ethical education is to change the mind of human beings from zero-sum to positive-sum about the relations between human beings and natural environments. But, there are many problems of knowledge education and value education in environmental education. For example scientific knowledge without ethical value is dangerous to environment protection, and ethical value without scientific knowledge is vague. Therefore, we must recognize that the relationship of ethical value and scientific knowledge is not substitutional but complementary. The teaching-learning methods which can integrate knowledge and value in environmental education are rational decision making model. For this model, we can construct teaching contents with inquiry materials. To earn the benefits of specialization among several subjects in environmental education, social studies can focus on social science knowledge and decision making, science education can focus on pure natural science knowledge and scientific investigation, moral education can focus on problems of ethical value system, home economics can focus on practical action and environmental education(Environments in middle school, Ecology and Environments in high school) can integrate social-national science knowledge and ethical value in broad perspective about human beings and ecosystem. That is the method to protect from law of diminishing marginal utility of learning in environmental education.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.865-875
• /
• 2012

In this paper, we optimize antenna locations for a distributed antenna system (DAS) with distributed antenna (DA) ports equipped with multiple antennas under per-DA port power constraint. Maximum ratio transmission and scaled zero-forcing beamforming are employed for single-user and multi-user DAS, respectively. Instead of maximizing the cell average ergodic sum rate, we focus on a lower bound of the expected signal-to-noise ratio (SNR) for the single-cell scenario and the expected signal-to-leakage ratio (SLR) for the two-cell scenario to determine antenna locations. For the single-cell case, optimization of the SNR criterion generates a closed form solution in comparison to conventional iterative algorithms. Also, a gradient ascent algorithm is proposed to solve the SLR criterion for the two-cell scenario. Simulation results show that DAS with antenna locations obtained from the proposed algorithms achieve capacity gains over traditional centralized antenna systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12C
• /
• pp.764-773
• /
• 2011

Despite enormous performance gain with multi-antenna transmission in the single cell environment, its gain diminishes out in the multi-cell environment due to interference. It is also very hard to solve the efficient downlink beamforming with low complexity in multi-cell environment. First, this paper shows that the asymptotically sum rate optimal downlink beamformings at low and high SNR are maximum ratio transmit (MRT) and zero forcing (ZF) beamforming in the multi-cell system, respectively. Secondly, exploiting the asymptotically optimal downlink beamforming, we develop simple two types of near optimal downlink beamforming schemes having the form of minimum mean squared error (MMSE) beamforming obtained from the dual uplink problem. For each type, three different subclasses are also considered depending on the computational complexity. The simulation results show that the proposed near optimum algorithms provide the trade-off between the complexity and the performance.