• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2173-2183
• /
• 1998

We consider a frequency-hopped multiple-access communication system that employs reed-solomon code over GF(Q) and M-ary FSK signaling ($M{\leq}Q$) in rayleigh fading channel. We investigate the tradeoff among the modulation symbol size (M), the number of frequency slots, and the code rate in maximizing the average number of successfully transmitted information bits per unit time and unit bandwidth (called normalized throughput). We find that it is desirabel to use a large M in noise-limited environment. In interference-limited environment, it is more improtant to prevent errors (hits) by increasing the number of frequency slots than to correct them with formward error correction techniques or to reduce the error rate by increasing M.

• Communications of the Korean Mathematical Society
• /
• v.20 no.3
• /
• pp.521-529
• /
• 2005

We prove that the dimension of the space of positive (bounded, respectively) solutions for the Schrodinger operator whose potential q is nonnegative on a graph with q-regular ends is equal to the number of ends (q-nonparabolic ends, respectively).

• Communications of the Korean Mathematical Society
• /
• v.20 no.3
• /
• pp.467-485
• /
• 2005

Let p and q be odd primes with p=2q+1. We study the number of solutions of congruence equations $ax^i\;+\;by^j\;{\equiv}\;c$ (mod p) and a$ax^i\;+\;by^j\;+\;dz^t\;{\equiv}\;c(modp)$

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.445-446
• /
• 2010

In Gen-2 Q-algorithm, the initial value of $Q_{fp}$, which is the slot-count parameter, is not defined in the standard. In this case, if we let the initial $Q_{fp}$ be large, the number of empty slot will be large during the initial query round. On the other hand, if the initial $Q_{fp}$ is small, almost all the slots will be collided. As a result, it is anticipated that the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we analyze how the performances of Gen-2 Q-algorithm will be affected by the initial slot-count size.

• 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 Institute of Intelligent Systems
• /
• v.16 no.1
• /
• pp.79-85
• /
• 2006

This paper presents a strategy and tactic for robot soccer using furry logic mediator that determines robot action depending on the positions and the roles of adjacent two robots. Conventional Q-learning algorithm, where the number of states increases exponentially with the number of robots, is not suitable for a robot soccer system, because it needs so much calculation that processing cannot be accomplished in real time. A modular Q-teaming algorithm reduces a number of states by partitioning the concerned area, where mediator algorithm for cooperation of robots is used additionally. The proposed scheme implements the mediator algorithm among robots by fuzzy logic system, where simple fuzzy rules make the calculation easy and hence proper for robot soccer system. The simulation of MiroSot shows the feasibility of the proposed scheme.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.5
• /
• pp.1559-1568
• /
• 2015

The relative class number $H_d(f)$ of a real quadratic field $K=\mathbb{Q}(\sqrt{m})$ of discriminant d is the ratio of class numbers of $O_f$ and $O_K$, where $O_K$ denotes the ring of integers of K and $O_f$ is the order of conductor f given by $\mathbb{Z}+fO_K$. In a recent paper of A. Furness and E. A. Parker the relative class number of $\mathbb{Q}(\sqrt{m})$ has been investigated using continued fraction in the special case when $(\sqrt{m})$ has a diagonal form. Here, we extend their result and show that there exists a conductor f of relative class number 1 when the continued fraction of $(\sqrt{m})$ is non-diagonal of period 4 or 5. We also show that there exist infinitely many real quadratic fields with any power of 2 as relative class number if there are infinitely many Mersenne primes.

• Journal of applied mathematics & informatics
• /
• v.30 no.3_4
• /
• pp.455-462
• /
• 2012

The cyclic group $Cn={\langle}(12{\cdots}n){\rangle}$ acts on the set ($^{[n]}_k$) of all $k$-subsets of [$n$]. In this action of $C_n$ the number of orbits of size $d$, for $d|n$, is $$O^{n,k}_d=\frac{1}{d}\sum_{\frac{n}{d}|s|n}{\mu}(\frac{ds}{n})(^{n/s}_{k/s})$$. Stanton and White[7] generalized the above identity to construct the orbit polynomials $$O^{n,k}_d(q)=\frac{1}{[d]_{q^{n/d}}}\sum_{\frac{n}{d}|s|n}{\mu}(\frac{ds}{n})[^{n/s}_{k/s}]{_q}^s$$ and conjectured that $O^{n,k}_d(q)$ have non-negative coefficients. In this paper we give a combinatorial proof for the positivity of coefficients of the orbit polynomial $O^{n,3}_d(q)$.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.2
• /
• pp.599-610
• /
• 2018

We aim to present some formulas for Saigo hypergeometric fractional integral and differential operators involving (p, q)-extended Bessel function $J_{{\nu},p,q}(z)$, which are expressed in terms of Hadamard product of the (p, q)-extended Gauss hypergeometric function and the Fox-Wright function $_p{\Psi}_q(z)$. A number of interesting special cases of our main results are also considered. Further, it is emphasized that the results presented here, which are seemingly complicated series, can reveal their involved properties via those of the two known functions in their respective Hadamard product.

• Korean Journal of Mathematics
• /
• v.25 no.3
• /
• pp.349-358
• /
• 2017

The cyclic group $C_n={\langle}(12{\cdots}n){\rangle}$ acts on the set $(^{[n]}_k)$ of all k-subsets of [n]. In this action of $C_n$ the number of orbits of size d, for d | n, is $$O^{n,k}_d={\frac{1}{d}}{\sum\limits_{{\frac{n}{d}}{\mid}s{\mid}n}}{\mu}({\frac{ds}{n}})(^{n/s}_{k/s})$$. Stanton and White [6] generalized the above identity to construct the orbit polynomials $$O^{n,k}_d(q)={\frac{1}{[d]_{q^{n/d}}}}{\sum\limits_{{\frac{n}{d}}{\mid}s{\mid}n}}{\mu}({\frac{ds}{n}})[^{n/s}_{k/s}]_{q^s}$$ and conjectured that $O^{n,k}_d(q)$ have non-negative coefficients. In this paper we give a constructive proof for the positivity of coefficients of the orbit polynomial $O^{n,2}_d(q)$.