• Honam Mathematical Journal
• /
• v.35 no.2
• /
• pp.129-136
• /
• 2013

Let G be a commutative group which is 2-divisible, $\mathbb{R}$ the set of real numbers and $f,g:G{\rightarrow}\mathbb{R}$. In this article, we investigate bounded solutions of the Pexider-exponential functional inequality ${\mid}f(x+y)-f(x)g(y){\mid}{\leq}{\epsilon}$ for all $x,y{\in}G$.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.557-562
• /
• 2006

We consider the relationship between absolute continuity for functions of a real variable and absolute continuity of functions of generalized bounded variation. Here, we obtain necessary and sufficient conditions between these two functions.

• Korean Journal of Mathematics
• /
• v.16 no.4
• /
• pp.499-509
• /
• 2008

In this paper we introduce the concepts of the generalized bounded variation in the restricted sense with respect to a strictly increasing function and $Denjoy_*$-Stieltjes integral of real-valued functions and investigate their properties.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.4
• /
• pp.99-105
• /
• 1994

k-bounded circuits are combinational circuits proposed by Fujiwara whose subcircuits are partitioned in a way that they form a tree and have some restricted k inputs respectively. Fujiwara proposed a O($16^{k}m$) fault detection algorithm for k-bounded circuits where m is the number of signal lines in the circuit. This algorithm is very ineffective to be applied to real circuits, even for small values of k. In this paper, it is shown that a single stuck-at fault in k-bounded circuits can be detected in O($2^{k}m$)time, and multiple stuck-at faults are detected in O($4^{k}m$) time by using thable lookup and imput partitionsing.

• Journal of the Korean Mathematical Society
• /
• v.49 no.1
• /
• pp.17-30
• /
• 2012

Let D be an arbitrary domain in $\mathbb{C}^n$, n > 1, and $M{\subset}{\partial}D$ be an open piece of the boundary. Suppose that M is connected and ${\partial}D$ is smooth real-analytic of finite type (in the sense of D'Angelo) in a neighborhood of $\bar{M}$. Let f : $D{\rightarrow}\mathbb{C}^n$ be a holomorphic correspondence such that the cluster set $cl_f$(M) is contained in a smooth closed real-algebraic hypersurface M' in $\mathbb{C}^n$ of finite type. It is shown that if f extends continuously to some open peace of M, then f extends as a holomorphic correspondence across M. As an application, we prove that any proper holomorphic correspondence from a bounded domain D in $\mathbb{C}^n$ with smooth real-analytic boundary onto a bounded domain D' in $\mathbb{C}^n$ with smooth real-algebraic boundary extends as a holomorphic correspondence to a neighborhood of $\bar{D}$.

• Communications of the Korean Mathematical Society
• /
• v.11 no.4
• /
• pp.975-981
• /
• 1996

Let $D \subset C^2$ be a bounded convex domain with real analytic boundary. We get some Lipschitz regularity of the Cauchy transform on the convex domain D.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.4
• /
• pp.1005-1015
• /
• 2016

It is a surprising but now well-known fact that there exist algebraic power series of degree higher than two with partial quotients of bounded degrees in their continued fraction expansions, while there is no single algebraic real number known with bounded partial quotients. However, it seems that these special algebraic power series are quite rare and it is hard to determine their continued fraction expansions explicitly. To the short list of known examples, we add a new family of cubic power series with bounded partial quotients.

• ETRI Journal
• /
• v.32 no.3
• /
• pp.422-429
• /
• 2010

We present guaranteed dynamic priority assignment schemes for multiple real-time tasks subject to (m, k)-firm deadlines. The proposed schemes have two scheduling objectives: providing a bounded probability of missing (m, k)-firm constraints and maximizing the probability of deadline satisfactions. The second scheduling objective is especially necessary in order to provide the best quality of service as well as to satisfy the minimum requirements expressed by (m, k)-firm deadlines. We analytically establish that the proposed schemes provide a guarantee on the bounded probability of missing (m, k)-firm constraints. Experimental studies validate our analytical results and confirm the effectiveness and superiority of the proposed schemes with regard to their scheduling objectives.

• ETRI Journal
• /
• v.33 no.2
• /
• pp.230-239
• /
• 2011

Dynamic memory allocators for real-time embedded systems need to fulfill three fundamental requirements: bounded worst-case execution time, fast average execution time, and minimal fragmentation. Since embedded systems generally run continuously during their whole lifetime, fragmentation is one of the most important factors in designing the memory allocator. This paper focuses on minimizing fragmentation while other requirements are still satisfied. To minimize fragmentation, a part of a memory region is segregated by the proposed budgeting method that exploits the memory profile of the given application. The budgeting method can be applied for any existing memory allocators. Experimental results show that the memory efficiency of allocators can be improved by up to 18.85% by using the budgeting method. Its worst-case execution time is analyzed to be bounded.

• Kyungpook Mathematical Journal
• /
• v.22 no.2
• /
• pp.191-194
• /
• 1982