• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.626-628
• /
• 2004

This paper describes an 8-bit CMOS folding A/D converter for set-top box. Modular low-power, high-speed CMOS A/D converter for embedded systems aims at design techniques for low-power, high-speed A/D converter processed by the standard CMOS technology. The time-interleaved A/D converter or flash A/D converter are not suitable for the low-power applications. The two-step or multi-step flash A/D converters need a high-speed SHA, which represents a tough task in high-speed analog circuit design. On the other hand, the folding A/D converter is suitable for the low-power, high-speed applications(Embedded system). The simulation results illustrate a conversion rate of 40MSamples/s and a Power dissipation of 80mW(only analog block) at 2.5V supply voltage.

• Journal of Bio-Environment Control
• /
• v.24 no.1
• /
• pp.27-33
• /
• 2015

High temperature stress in summer season at plastic house is a limiting factor for tomato fruit set and yield. This study was performed to assess the effects of gibberellic acid ($GA_3$) and 2,4-Dichlophenoxy acetic acid (2,4-D) spray on fruit set, yield, and quality of tomato cv. 'Adoration'(Enza Zaden Co., Ltd.) under the plastic house in Hwacheon, 2011. Four concentrations (0-, 5-, 10- and $15mg{\cdot}L^{-1}$) of $GA_3$, and three concentrations (0-, 5- and $10mg{\cdot}L^{-1}$) 2,4-D were sprayed in early flowering of tomato in the plastic house, and fruit set, yield and quality characters were observed. The results showed that spray of $10mg{\cdot}L^{-1}$ $GA_3$ significantly increased the fruit set by 14.2% than unsprayed. The spray of $GA_3$ significantly increased the marketable fruit number, fruit weight, and yield. The spray of 2,4-D on blossoms significantly affected the fruit set percentage, fruit weight, marketable fruit weight and yield, and the highest fruit set observed as 62.5% in combined spray of $GA_3$ and 2,4-D at each $5mg{\cdot}L^{-1}$. Fruit size and total soluble solids significantly varied with the concentrations of $GA_3$ sprayed. The result indicates that the spray of $10mg{\cdot}L^{-1}$ $GA_3$ and $5mg{\cdot}L^{-1}$ 2,4-D can be more economic and effective to increase the fruit set, and yield in tomato under high temperature condition in plastic house.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2012.10a
• /
• pp.89-92
• /
• 2012

Marine diesel generator(D/G) set which is supported with resilient mounts for vibration isolation has been experienced the resonance problem by the main engine or propeller excitations and rigid body modes. Then the avoidance of resonance is difficult because the several excitations and 6 rigid body modes have to be considered simultaneously. In this paper, stiffness adjustable mounts was developed and proposed to control the natural frequencies of installed D/G set. Operating concept of the mount is that the total stiffness of mount can be changed according to the engagement of secondary rubber element in addition to primary one. The performance of mount was verified with the test rig and actual experiment in D/G set.

• Journal of Korea Game Society
• /
• v.14 no.6
• /
• pp.29-38
• /
• 2014

In the large scale indoor 3D game scenes, the data amount of potentially visible set (PVS) which pre-computes the information of occlusion culling can be huge. However, the large part of them can be represented as zero. In this paper, the effective hardware structure is designed, which compresses PVS data as the way of zero run length encoding (ZRLE) during building the scene trees of 3D games in mobile environments. The compression ratio of the proposed structure and the rendering speed (frame per second: FPS) according to both PVS culling and frustum culling are analyzed under 3D game simulations.

• Bulletin of the Korean Mathematical Society
• /
• v.27 no.2
• /
• pp.183-188
• /
• 1990

The notion of a Dirichlet set has been studied for several decades. Such sets are named in honour of Dirichlet's Theorem [4, pp.235] which, in modern terminology, simply says that every finite set in R is a dirichlet set. In this paper, we present a structure theorem which characterizes all D-sets on the real line. We also use our structure theorem to give a new proof of a known criterion for proving that a set fails to be a D-set.

• Honam Mathematical Journal
• /
• v.43 no.1
• /
• pp.17-25
• /
• 2021

A set D ⊆ V (G) is an independent transversal dominating set of G if D is a dominating set and also intersects every maximum independent set in G. The minimum cardinality of such a set is equal to the transversal domination number, denoted by ��it(G). This paper is devoted to the computation of the independent transversal domination number of some complementary prism.

• Journal of the Korean Mathematical Society
• /
• v.46 no.4
• /
• pp.759-773
• /
• 2009

A dominating set for a graph G is a set D of vertices of G such that every vertex of G not in D is adjacent to a vertex of D. Reed [11] considered the domination problem for graphs with minimum degree at least three. He showed that any graph G of minimum degree at least three contains a dominating set D of size at most $\frac{3}{8}$ |V (G)| by introducing a covering by vertex disjoint paths. In this paper, by using this technique, we show that every graph on n vertices of minimum degree at least four contains a dominating set D of size at most $\frac{4}{11}$ |V (G)|.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.2
• /
• pp.63-70
• /
• 2015

In the absence of a polynomial time algorithm capable of obtaining the exact solutions to it, the domatic number problem (DNP) of dominating set (DS) has been regarded as NP-complete. This paper suggests polynomial-time complexity algorithm about DNP. In this paper, I select a vertex $v_i$ of the maximum degree ${\Delta}(G)$ as an element of a dominating set $D_i,i=1,2,{\cdots},k$, compute $D_{i+1}$ from a simplified graph of $V_{i+1}=V_i{\backslash}D_i$, and verify that $D_i$ is indeed a dominating set through $V{\backslash}D_i=N_G(D_i)$. When applied to 15 various graphs, the proposed algorithm has succeeded in bringing about exact solutions with polynomial-time complexity O(kn). Therefore, the proposed domatic number algorithm shows that the domatic number problem is in fact a P-problem.

• Journal of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.863-872
• /
• 2007

Let D be an integral domain with quotient field K, A a nonempty set of height-one maximal t-ideals of D, F$({\Lambda})={I{\subseteq}D|I$ is an ideal of D such that $I{\subseteq}P$ for all $P{\in}A}$, and $D_F({\Lambda})={x{\in}K|xA{\subseteq}D$ for some $A{\in}F({\Lambda})}$. In this paper, we prove that if each $P{\in}A$ is the radical of a finite type v-ideal (resp., a principal ideal), then $D_{F({\Lambda})}$ is a weakly Krull domain (resp., generalized weakly factorial domain) if and only if the intersection $D_{F({\Lambda})}={\cap}_{P{\in}A}D_P$ has finite character, if and only if $F({\Lambda})$ is a t-splitting set of ideals, if and only if $F({\Lambda})$ is v-finite.

• Journal of the Korean Mathematical Society
• /
• v.54 no.4
• /
• pp.1301-1316
• /
• 2017

It is well known that every $x{\in}(0,1]$ can be expanded to an infinite $L{\ddot{u}}roth$ series with the form of $$x={\frac{1}{d_1(x)}}+{\cdots}+{\frac{1}{d_1(x)(d_1(x)-1){\cdots}d_{n-1}(x)(d_{n-1}(x)-1)d_n(x)}}+{{\cdots}}$$, where $d_n(x){\geq}2$ for all $n{\geq}1$. In this paper, the set of points with some restrictions on the digits in $L{\ddot{u}}roth$ series expansions are considered. Namely, the Hausdorff dimension of following the set $$F_{\phi}=\{x{\in}(0,1]\;:\;d_n(x){\geq}{\phi}(n),\;i.o.n}$$ is determined, where ${\phi}$ is an integer-valued function defined on ${\mathbb{N}}$, and ${\phi}(n){\rightarrow}{\infty}$ as $n{\rightarrow}{\infty}$.