• Journal of applied mathematics & informatics
• /
• v.31 no.1_2
• /
• pp.199-209
• /
• 2013

In this paper, we study the oscillation problem of the following higher-order neutral differential equation with positive and negative coefficients and mixed arguments $$z^{(n)}(t)+q_1(t)|x(t-{\sigma}_1)|^{\alpha-1}x(t-{\sigma}_1)+q_2(t)|x(t-{\sigma}_2)|^{\beta-1}x(t-{\sigma}_2)=e(t)$$, where $t{\geq}t_0$, $z(t)=x(t)-p(t)x(t-{\tau})$ with $p(t)$ > 0, ${\beta}>1>{\alpha}>0$, ${\tau}$, ${\sigma}_1$ and ${\sigma}_2$ are real numbers. Without imposing any restriction on ${\tau}$, we establish several oscillation criteria for the above equation in two cases: (i) $q_1(t){\leq}0$, $q_2(t)>0$, ${\sigma}_1{\geq}0$ and ${\sigma}_2{\leq}{\tau}$; (ii) $q_1(t){\geq}0$, $q_2(t)<0$, ${\sigma}_1{\geq}{\tau}$ and ${\sigma}_2{\leq}0$. As an interesting application, our results can also be applied to the following higher-order differential equation with positive and negative coefficients and mixed arguments $$x^{(n)}(t)+q_1(t)|x(t-{\sigma}_1)|^{\alpha-1}x(t-{\sigma}_1)+q_2(t)|x(t-{\sigma}_2)|^{\beta-1}x(t-{\sigma}_2)=e(t)$$. Two numerical examples are also given to illustrate the main results.

• Journal of applied mathematics & informatics
• /
• v.35 no.3_4
• /
• pp.267-276
• /
• 2017

The purpose of this paper is to investigate the local asymptotic stability of equilibria, the periodic nature of solutions, the existence of unbounded solutions and the global behavior of solutions of the fractional difference equation $$x_{n+1}=\frac{^{{\alpha}x}n-1(k+1)}{{\beta}+{\gamma}x^p_{n-k}x^q_{n-(k+2)}}$$, $$n=0,1,{\dots}$$ where the parameters ${\alpha}$, ${\beta}$, ${\gamma}$, p, q are non-negative numbers and the initial values $x_{-(k+2)}$,$x_{-(k+1)}$, ${\dots}$, $x_{-1}$, $x_0{\in}\mathb{R}^+$.

• Korean Journal of Mathematics
• /
• v.29 no.1
• /
• pp.75-80
• /
• 2021

For a locus with two alleles (IA and IB), the frequencies of the alleles are represented by $$p=f(I^A)={\frac{2N_{AA}+N_{AB}}{2N} },\;q=f(I^B)={\frac{2N_{BB}+N_{AB}}{2N}}$$ where NAA, NAB and NBB are the numbers of IA IA, IA IB and IB IB respectively and N is the total number of populations. The frequencies of the genotypes expected are calculated by using p2, 2pq and q2. So in this paper, we consider the method of whether some genotypes is in Hardy-Weinburg equilibrium. Also we calculate the probability generating function for the offspring number of genotype produced by a mating of the ith male and jth female under a diploid model of N population with N1 males and N2 females. Finally, we have conditional joint probability generating function of genotype frequencies.

• Asian-Australasian Journal of Animal Sciences
• /
• v.24 no.11
• /
• pp.1552-1559
• /
• 2011

Real time PCR was used in this study to determine the effect of triticale dried distillers grains with solubles (TDDGS) as a replacement for grain or barley silage in finishing diets on the presence of six classical ruminal bacterial species (Succinivibrio dextrinosolvens, Selenomonas ruminantium, Streptococcus bovis, Megasphaera elsdenii, Prevotella ruminicola and Fibrobacter succinogenes) within the rumen contents of feedlot cattle. This study was divided into a step-wise adaptation experiment (112 days) that examined the effects of adaptation to diets containing increasing levels of TDDGS up to 30% (n = 4), a short-term experiment comparing animals (n = 16) fed control, 20%, 25% or 30% TDDGS diets over 28 days, and a rapid transition experiment (56 days) where animals (n = 4) were rapidly switched from a diet containing 30% TDDGS to a barley-based diet with no TDDGS. It was found that feeding TDDGS as replacement for barley grain (control vs. 20% TDDGS) decreased 16S rRNA copy numbers of starch-fermenting S. ruminantium and S. bovis (p<0.001 and p = 0.04, respectively), but did not alter 16S rRNA copy numbers of the other rumen bacteria. Furthermore, feeding TDDGS as a replacement barley silage (20% vs. 25% and 30% TDDGS) increased 16S rRNA copy numbers of S. ruminantium, M. elsdenii and F. succinogenes (p<0.001; p = 0.03 and p<0.001, respectively), but decreased (p<0.001) the 16S rRNA copy number of P. ruminicola. Upon removal of 30% TDDGS and return to the control diet, 16S rRNA copy numbers of S. ruminantium, M. elsdenii and F. succinogenes decreased (p = 0.01; p = 0.03 and p = 0.01, respectively), but S. dextrinosolvens and S. bovis increased (p = 0.04 and p = 0.009, respectively). The results suggest that replacement of TDDGS for grain reduces 16S rRNA copy numbers of starch-fermenting bacteria, whereas substitution for barley silage increases 16S rRNA copy numbers of bacteria involved in fibre digestion and the metabolism of lactic acid. This outcome supports the contention that the fibre in TDDGS is highly fermentable.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.71-76
• /
• 2014

There is to be virtually impossible to solve the very large digits of prime number p and q from composite number n=pq using integer factorization in typical public-key cryptosystems, RSA. When the public key e and the composite number n are known but the private key d remains unknown in an asymmetric-key RSA, message decryption is carried out by first obtaining ${\phi}(n)=(p-1)(q-1)=n+1-(p+q)$ and then using a reverse function of $d=e^{-1}(mod{\phi}(n))$. Integer factorization from n to p,q is most widely used to produce ${\phi}(n)$, which has been regarded as mathematically hard. Among various integer factorization methods, the most popularly used is the congruence of squares of $a^2{\equiv}b^2(mod\;n)$, a=(p+q)/2,b=(q-p)/2 which is more commonly used then n/p=q trial division. Despite the availability of a number of congruence of scares methods, however, many of the RSA numbers remain unfactorable. This paper thus proposes an algorithm that directly and immediately obtains ${\phi}(n)$. The proposed algorithm computes $2^k{\beta}_j{\equiv}2^i(mod\;n)$, $0{\leq}i{\leq}{\gamma}-1$, $k=1,2,{\ldots}$ or $2^k{\beta}_j=2{\beta}_j$ for $2^j{\equiv}{\beta}_j(mod\;n)$, $2^{{\gamma}-1}$ < n < $2^{\gamma}$, $j={\gamma}-1,{\gamma},{\gamma}+1$ to obtain the solution. It has been found to be capable of finding an arbitrarily located ${\phi}(n)$ in a range of $n-10{\lfloor}{\sqrt{n}}{\rfloor}$ < ${\phi}(n){\leq}n-2{\lfloor}{\sqrt{n}}{\rfloor}$ much more efficiently than conventional algorithms.

• Korean Journal of Mathematics
• /
• v.30 no.1
• /
• pp.67-72
• /
• 2022

For a locus with two alleles (I^A and I^B), the frequencies of the alleles are represented by $$p=f(I^A)={\frac{2N_{AA}+N_{AB}}{2N},\;q=f(I^B)={\frac{2N_{BB}+N_{AB}}{2N}$$ where N_AA, N_AB and N_BB are the numbers of I^AI^A, I^AI^B and I^BI^B respectively and N is the total number of populations. The frequencies of the genotypes expected are calculated by using p², 2pq and q². Choi showed the method of whether some genotypes is in these probabalities. Also he calculate the probability generating function for offspring number of genotype under a diploid model( [1]). In this paper, let x(t, p) be the probability that I^A become fixed in the population by time t-th generation, given that its initial frequency at time t = 0 is p. We find adapted equations for x using the mean change of frequence of alleles and fitness of genotype. Also we apply this adapted equations to several diploid model and it also will apply to actual examples.

• Communications of the Korean Mathematical Society
• /
• v.18 no.3
• /
• pp.541-550
• /
• 2003

We consider the generalized autoregressive model with conditional heteroscedasticity process(GARCH). It is proved that if (equation omitted) β/sub i/ < 1, then there exists a unique invariant initial distribution for the Markov process emdedding the given GARCH process. Geometric ergodicity, functional central limit theorems, and a law of large numbers are also studied.

• Journal of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.367-379
• /
• 1996

Let $V = {(z, y) : f(z, y) = z^n + Ay^\alpha z^p + y^\beta z^q + y^k = 0}$ and $W = {(z, y) : g(z, y) = z^n + By^\gamma z^s + y^\delta z^t + y^k = 0}$ be germs of analytic irreducible subvarieties of a polydisc near the origin in $C^2$ with n < k and (n, k) = 1 where A and B are complex numbers. Assume that V and W are topologically equivalent near the origin.

• Journal of applied mathematics & informatics
• /
• v.35 no.1_2
• /
• pp.83-93
• /
• 2017

The Cayley graph ${\Gamma}=Cay(G,S)$ is called normal edge-transitive if $N_A(R(G))$ acts transitively on the set of edges of ${\Gamma}$, where $A=Aut({\Gamma})$ and R(G) is the regular subgroup of A. In this paper, we determine all hexavalent normal edge-transitive Cayley graphs on groups of order pqr, where p > q > r > 2 are prime numbers.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.6
• /
• pp.19-25
• /
• 2017

This paper deals with integer factorization of two prime p,q of SHA-256 secure hash value n for Bit coin mining. This paper proposes an algorithm that greatly reduces the execution time of Pollard's rho integer factorization algorithm. Rho(${\rho}$) algorithm computes $x_i=x^2_{i-1}+1(mod\;n)$ and $y_i=[(y^2_{i-1}+1)^2+1](mod\;n)$ for intial values $(x_0,y_0)=(2,2)$ to find the factor 1 < $gcd({\mid}x_i-y_i{\mid},n)$ < n. It however fails to factorize some particular composite numbers. The algorithm proposed in this paper applies multiple initial values $(x_0,y_0)=(2^k,2^k)$ and ($2^k,2$), $2{\leq}k{\leq}10$ to the existing Pollard's Rho algorithm. As a results, the proposed algorithm achieves both the factorization of all the composite numbers and the reduction of the execution time of Pollard's Rho by 67.94%.