• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.3
• /
• pp.463-470
• /
• 2010

If P(f, r) is the set of endpoints of radii which have length greater than or equal to r > 0 under a conformal mapping f of the unit disc. Then for large r, the logarithmic capacity of P(f, r), $\frac{1}{\sqrt[2]{r}}{\leq}cap(P(f,r)){\leq}\frac{k}{\sqrt{r}}$. Where k is the positive constant.

• Communications of the Korean Mathematical Society
• /
• v.38 no.3
• /
• pp.937-941
• /
• 2023

For each positive integer n, a square congruence graph S(n) is the graph with vertex set H = {1, 2, 3,...., n} and two vertices a, b are adjacent if they are distinct and a² ≡ b² (mod n). In this paper we investigate some structural properties of square congruence graph and we obtain the relationship between clique number, chromatic number and maximum degree of square congruence graph. Also we study square congruence graph with p vertices or 2p vertices for any prime number p.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.1
• /
• pp.17-30
• /
• 1992

This paper concerns with (p$_{1}$, p$_{2}$)-Plant Location problem in which entire set of candidate sites for facility locations is divided by two overlapping subsets, each of which with its own number of facilities to be established. We propose an algorithm which attempts to solve the Lagrangean dual of (p$_{1}$, p$_{2}$)-PLP by dividing sub-problem into twop-Plant Location Problems and solving them based on the convexity of the Lagrangean dual problem with respect to the number of facilities to be established. In doing so, Orthogonal Move procedure is proposed to provide easy-to-obtain lower bound to the Lagrangean Dual of (p$_{1}$, p$_{2}$)-PLP. Computational experience is reported.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.39 no.12
• /
• pp.1207-1212
• /
• 2015

A vibro ripper utilizes high-frequency vibration for rock fragmentation. This concept is different from those used by other existing breakers. The gearbox-shank welded joint of a vibro ripper is a very important part. Because it delivers the vibromotive force to the tooth, it is important to predict its soundness. This study was conducted to predict the fatigue life under welding conditions. The shank materials were Hardox-Hituf and AR400, and the filler metals were CSF-71T and CSF-81T. Fatigue tests were conducted under each set of conditions. P-S-N curves are presented based on the statistical testing method recommended by JSME-S002, and a comparison is made of the results under each set of conditions. The life was estimated using a P-S-N curve.

• Preventive Nutrition and Food Science
• /
• v.17 no.4
• /
• pp.274-279
• /
• 2012

For the quantitative analysis of genetically modified (GM) maize in processed foods, primer sets and probes based on the 35S promoter (p35S), nopaline synthase terminator (tNOS), p35S-hsp70 intron, and zSSIIb gene encoding starch synthase II for intrinsic control were designed. Polymerase chain reaction (PCR) products (80~101 bp) were specifically amplified and the primer sets targeting the smaller regions (80 or 81 bp) were more sensitive than those targeting the larger regions (94 or 101 bp). Particularly, the primer set 35F1-R1 for p35S targeting 81 bp of sequence was even more sensitive than that targeting 101 bp of sequence by a 3-log scale. The target DNA fragments were also specifically amplified from all GM labeled food samples except for one item we tested when 35F1-R1 primer set was applied. A reference plasmid pGMmaize (3 kb) including the smaller PCR products for p35S, tNOS, p35S-hsp70 intron, and the zSSIIb gene was constructed for real-time PCR (RT-PCR). The linearity of standard curves was confirmed by using diluents ranging from $2{\times}10^1{\sim}10^5$ copies of pGMmaize and the $R^2$ values ranged from 0.999~1.000. In the RT-PCR, the detection limit using the novel primer/probe sets was 5 pg of genomic DNA from MON810 line indicating that the primer sets targeting the smaller regions (80 or 81 bp) could be used for highly sensitive detection of foreign DNA fragments from GM maize in processed foods.

• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.485-490
• /
• 2002

As the products of internet appliance, such as digital TV, internet set-top box, and internet phone, are continually produced, the market of real time operating system which controls those products is being highly increased. ETRI developed the extensible real time operating system, Qplus-P, which can be used from PDA to internet set-top box and home server. This paper describes the design and implementation of C standard library for real-time operating system Qplus-P. The Qplus-P C standard library follows EL/IX API level, which is proposed to the real-time operating system international standard by the RedHat. And, the C standard library functions, which are needed to support the Tiny-X and Kaffe, are also implemented. The implemented C standard library can reduce the size of library about 30% compare to the C library that does not follow EL/IX API level.

• Korean Journal of Poultry Science
• /
• v.17 no.2
• /
• pp.127-133
• /
• 1990

This study was undertaken to find out the effect of heating time and temperature, pH and NaCl concentration on the heat stability of egg albumen gel during heat treatment. With the transient decrease at 110-$130^{\circ}C$, hardness of heat-set albumen gel was increased as the heating temperature increased. The cohesiveness showed similar trend as well. The lightness was decreased while the yellowness was increased as the heating time and temperature increased. Heat-set albumen gel showed maximum hardness at pH 4.5-5.0 and pH 9.0 High heat treatment($120^{\circ}C$, 30min) showed higher hardness at alkaline range compared to low heat treatment($96^{\circ}C$, 30min.). Color of the albumen gel was relatively dark at acidic range and bright at alkaline range. High heat treatment caused darker albumen gel at alkaline range and brighter albumen gel at acidic range. The addition of NaCl increased hardness and cohesiveness of the albumen gel and improved the lightness after high heat treatment regardless of NaCl concentration.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.6
• /
• pp.1829-1839
• /
• 2014

Let (${\Omega}$, $\mathcal{S}$, ${\mu}$) be a probabilistic measure space, ${\varepsilon}{\in}\mathbb{R}$, ${\delta}{\geq}0$, p > 0 be given numbers and let $P{\subset}\mathbb{R}$ be an open interval. We consider a class of functions $f:P{\rightarrow}\mathbb{R}$, satisfying the inequality $$f(EX){\leq}E(f{\circ}X)+{\varepsilon}E({\mid}X-EX{\mid}^p)+{\delta}$$ for each $\mathcal{S}$-measurable simple function $X:{\Omega}{\rightarrow}P$. We show that if additionally the set of values of ${\mu}$ is equal to [0, 1] then $f:P{\rightarrow}\mathbb{R}$ satisfies the above condition if and only if $$f(tx+(1-t)y){\leq}tf(x)+(1-t)f(y)+{\varepsilon}[(1-t)^pt+t^p(1-t)]{\mid}x-y{\mid}^p+{\delta}$$ for $x,y{\in}P$, $t{\in}[0,1]$. We also prove some basic properties of such functions, e.g. the existence of subdifferentials, Hermite-Hadamard inequality.

• Communications of the Korean Mathematical Society
• /
• v.22 no.2
• /
• pp.277-287
• /
• 2007

We prove that if a graph G of bounded degree has finitely many p-hyperbolic ends($1) in which every bounded energy finite p-harmonic function is asymptotically constant for almost every path, then the set $\mathcal{HBD}_p(G)$ of all bounded energy finite p-harmonic functions on G is in one to one corresponding to $\mathbf{R}^l$, where $l$ is the number of p-hyperbolic ends of G. Furthermore, we prove that if a graph G' is roughly isometric to G, then $\mathcal{HBD}_p(G')$ is also in an one to one correspondence with $\mathbf{R}^l$.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.9
• /
• pp.121-129
• /
• 2013

This paper proposes a linear-time algorithm that has been designed to obtain an accurate solution for Dominating Set (DS) problem, which is known to be NP-complete due to the deficiency of polynomial-time algorithms that successfully derive an accurate solution to it. The proposed algorithm does so by repeatedly assigning vertex v with maximum degree ${\Delta}(G)$among vertices adjacent to the vertex v with minimum degree ${\delta}(G)$ to Minimum Independent DS (MIDS) as its element and removing all the incident edges until no edges remain in the graph. This algorithm finally transforms MIDS into Minimum DS (MDS) and again into Minimum Connected DS (MCDS) so as to obtain the accurate solution to all DS-related problems. When applied to ten different graphs, it has successfully obtained accurate solutions with linear time complexity O(n). It has therefore proven that Dominating Set problem is rather a P-problem.