• Korean Journal of Food Science and Technology
• /
• v.18 no.1
• /
• pp.61-65
• /
• 1986

This study was performed to examine the drying characteristics of apples at various drying conditions. Air velocity has no effect on the drying rate except the constant rate period. In this experiment the diffusion coefficients of moisture in the apple tissue were in the range of $1.1470-2.2148{\times}10cm^2/sec$. As a result of balance of heat and mass transfer during the falling rate period. an empirical equation based on Fick's law was obtained as follows; $log{\Delta}t\;=\;log\;t_o\;-\;D{\frac{{\pi}^2{\theta}}{4d.}}$ This equation can be used to calculate the temperature of apples during the falling rate period, provided the diffusion coefficients of apple are known. The experimental values of the internal moisture distribution during apple dehydration were nearly in accord with the theoretical values.

• Journal of the Korean Mathematical Society
• /
• v.8 no.1
• /
• pp.25-30
• /
• 1971

Put ($$^*$$) $$G[x,y]={\sum}\limits^{p+q=n}_{p,q=0}[-n]_{p+q}c_{p,q}x^py^q$$, where $[{\lambda}]_m$ is the Pocbhammer symbol and the $c_{p,q}$ are arbitrary constants. Making use of the specialized forms of some of his earlier results (see [8] and [9] the author derives here bilateral generating functions of the type ($$^{**}$$) $${\sum}\limits^{\infty}_{n=0}{\frac{[\lambda]_n}{n!}}_2F_1[\array{{\rho}-n,\;{\alpha};\\{\lambda}+{\rho};}x]\;G[y,z]t^n$$ where ${\alpha}$, ${\rho}$ and ${\lambda}$ are arbitrary complex numbers. In particular, it is shown that when G[y, z] is a double hypergeometric polynomial, the right-band member of ($^{**}$) belongs to a class of general triple hypergeometric functions introduced by the author [7]. An interesting special case of ($^{**}$) when ${\rho}=-m,\;m$ being a nonnegative integer, yields a class of bilateral generating functions for the Jacobi polynomials $\{P_n{^{{\alpha},{\beta}}}(x)\}$ in the form ($$^{***}$$) $${\sum\limits^{\infty}_{n=0}}\(\array{m+n\\n}\)P{^{({\alpha}-n,{\beta}-n)}_{m+n}(x)\;G[y,z]{\frac{t^n}{n!}}$$, which provides a unification of several known results. Further extensions of ($^{**}$) and ($^{***}$) with G[y, z] replaced by an analogous multiple sum $H\[y_1,{\cdots},y_m\]$ are also discussed.

• East Asian mathematical journal
• /
• v.35 no.3
• /
• pp.285-288
• /
• 2019

Let $F_n$, $n{\in}{\mathbb{N}}$ be the n - th Fibonacci number, and let (p, q) be one of ordered pairs ($F_{n+2}$, $F_n$) or ($F_{n+1}$, $F_n$). Then we show that the multiplicative inverse of q mod p as well as that of p mod q are again Fibonacci numbers. For proof of our claim we make use of well-known Cassini, Catlan and dOcagne identities. As an application, we determine the number $N_{p,q}$ of nonzero term of a polynomial ${\Delta}_{p,q}(t)=\frac{(t^{pq}-1)(t-1)}{(t^p-1)(t^q-1)}$ through the Carlitz's formula.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.143-152
• /
• 2013

Given weighted graph G=(V,E), n=|V|, m=|E|, the minimum cut problem is classified with source s and sink t or without s and t. Given undirected weighted graph without s and t, Stoer-Wagner algorithm is most popular. This algorithm fixes arbitrary vertex, and arranges maximum adjacency (MA)-ordering. In the last, the sum of weights of the incident edges for last ordered vertex is computed by cut value, and the last 2 vertices are merged. Therefore, this algorithm runs $\frac{n(n-1)}{2}$ times. Given graph with s and t, Ford-Fulkerson algorithm determines the bottleneck edges in the arbitrary augmenting path from s to t. If the augmenting path is no more exist, we determine the minimum cut value by combine the all of the bottleneck edges. This paper suggests minimum cut algorithm for undirected weighted graph with s and t. This algorithm suggests MA-merging and computes cut value simultaneously. This algorithm runs n-1 times and successfully divides V into disjoint S and V sets on the basis of minimum cut, but the Stoer-Wagner is fails sometimes. The proposed algorithm runs more than Ford-Fulkerson algorithm, but finds the minimum cut value within n-1 processing times.

• Journal of the Korean Mathematical Society
• /
• v.60 no.5
• /
• pp.931-957
• /
• 2023

For an arbitrary integer x, an integer of the form $$T(x)={\frac{x^2+x}{2}}$$ is called a triangular number. Let α₁, ... , α_k be positive integers. A sum ${\Delta}_{{\alpha}_1,{\ldots},{\alpha}_k}(x_1,\,{\ldots},\,x_k)=\{\alpha}_1T(x_1)+\,{\cdots}\,+{\alpha}_kT(x_k)$ of triangular numbers is said to be almost universal with one exception if the Diophantine equation ${\Delta}_{{\alpha}_1,{\ldots},{\alpha}_k}(x_1,\,{\ldots},\,x_k)=n$ has an integer solution (x₁, ... , x_k) ∊ ℤ^k for any nonnegative integer n except a single one. In this article, we classify all almost universal sums of triangular numbers with one exception. Furthermore, we provide an effective criterion on almost universality with one exception of an arbitrary sum of triangular numbers, which is a generalization of "15-theorem" of Conway, Miller, and Schneeberger.

• East Asian mathematical journal
• /
• v.24 no.3
• /
• pp.251-261
• /
• 2008

Let {${\xi}_j;j\;{\geq}\;1$} be a centered strictly stationary random sequence defined by $S_0\;=\;0$, $S_n\;=\;\Sigma^n_{j=1}\;{\xi}_j$ and $\sigma(n)\;=\;33\sqrt {ES^2_n}$ where $\sigma(t),\;t\;>\;0$, is a nondecreasing continuous regularly varying function. Suppose that there exists $n_0\;{\geq}\;1$ such that, for any $n\;{\geq}\;n_0$ and $0\;{\leq}\;{\varepsilon}\;<\;1$, there exist positive constants $c_1$ and $c_2$ such that $c_1e^{-(1+{\varepsilon})x^2/2}\;{\leq}\;P\{\frac{{\mid}S_n{\mid}}{\sigma(n)}\;{\geq}\;x\}\;{\leq}\;c_2e^{-(1-{\varepsilon})x^2/2$, $x\;{\geq}\;1$ Under some additional conditions, we investigate some limsup results for the increments of partial sum processes of the sequence {${\xi}_j;j\;{\geq}\;1$}.

• Communications of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.567-578
• /
• 2017

Many scholars studied the boundedness of $Ces{\grave{a}}ro$ operators between $Q_K$ spaces and Bloch spaces of holomorphic functions in the unit disc in the complex plane, however, they did not describe the compactness. Let 0 < ${\alpha}$ < $+{\infty}$, K(r) be right continuous nondecreasing functions on (0, $+{\infty}$) and satisfy $${\displaystyle\smashmargin{2}{\int\nolimits_0}^{\frac{1}{e}}}K({\log}{\frac{1}{r}})rdr<+{\infty}$$. Suppose g is a holomorphic function in the unit disk. In this paper, some sufficient and necessary conditions for the extended $Ces{\grave{a}}ro$ operators $T_g$ between ${\alpha}$-Bloch spaces and $Q_K$ spaces in the unit disc to be bounded and compact are obtained.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.75-82
• /
• 2014

In this paper, we consider the periodic boundary value problem with sign changing nonlinearity $$u^{{\prime}{\prime}{\prime}}+{\rho}^3u=f(t,u),\;t{\in}[0,2{\pi}]$$, subject to the boundary value conditions: $$u^{(i)}(0)=u^{(i)}(2{\pi}),\;i=0,1,2$$, where ${\rho}{\in}(o,{\frac{1}{\sqrt{3}}})$ is a positive constant and f(t, u) is a continuous function. Using Leggett-Williams fixed point theorem, we provide sufficient conditions for the existence of at least three positive solutions to the above boundary value problem. The interesting point is the nonlinear term f may change sign.

• The Pure and Applied Mathematics
• /
• v.21 no.4
• /
• pp.271-279
• /
• 2014

Let $T_l$ be a transformation on the interval [-1, 1] defined by Chebyshev polynomial of degree $l(l{\geq}2)$, i.e., $T_l(cos{\theta})=cos(l{\theta})$. In this paper, we consider $T_l$ as a measure preserving transformation on [-1, 1] with an invariant measure $\frac{1}{\sqrt[\pi]{1-x^2}}dx$. We show that If f(x) is a nonconstant step function with finite k-discontinuity points with k < l-1, then it satisfies the Central Limit Theorem. We also give an explicit method how to check whether it satisfies the Central Limit Theorem or not in the cases of general step functions with finite discontinuity points.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.9 no.1
• /
• pp.79-90
• /
• 2005

In this paper we study the numerical solutions of the stochastic differential equations of the form $$du(x,\;t)=f(x,\;t,\;u)dt\;+\;g(x,\;t,\;u)dW(t)\;+\;\sum\limits_{|q|\leq2m}\;A_q(x,\;t)D^qu(x,\;t)dt$$ where $0\;{\leq}\;t\;{\leq}\;T,\;x\;{\in}\;R^{\nu}$, ($R^{nu}$ is the $\nu$-dimensional Euclidean space). Here $u\;{\in}\;R^n$, W(t) is an n-dimensional Brownian motion, $$f\;:\;R^{n+\nu+1}\;{\rightarrow}\;R^n,\;g\;:\;R^{n+\nu+1}\;{\rightarrow}\;R^{n{\times}n},$$, and $$A_q\;:\;R^{\nu}\;{\times}\;[0,\;T]\;{\rightarrow}\;R^{n{\times}n}$$ where ($A_q,\;|\;q\;|{\leq}\;2m$) is a family of square matrices whose elements are sufficiently smooth functions on $R^{\nu}\;{\times}\;[0,\;T]\;and\;D^q\;=\;D^{q_1}_1_{\ldots}_{\ldots}D^{q_{\nu}}_{\nu},\;D_i\;=\;{\frac{\partial}{\partial_{x_i}}}$.