• Bulletin of the Korean Mathematical Society
• /
• v.48 no.4
• /
• pp.779-789
• /
• 2011

In this paper we study the Banach space $L^1$(G) of real valued measurable functions which are integrable with respect to a vector measure G in the sense of D. R. Lewis. First, we investigate conditions for a scalarly integrable function f which guarantee $f{\in}L^1$(G). Next, we give a sufficient condition for a sequence to converge in $L^1$(G). Moreover, for two vector measures F and G with values in the same Banach space, when F can be written as the integral of a function $f{\in}L^1$(G), we show that certain properties of G are inherited to F; for instance, relative compactness or convexity of the range of vector measure. Finally, we give some examples of $L^1$(G) related to the approximation property.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1347-1351
• /
• 1987

This thesis aims at studying laplacian pyramid vector quantization which keeps a simple compression algorithm and stability against various kinds of image data. To this end, images are devied into two groups according to their statistical characteristics. At 0.860 bits/pixel and 0.360 bits/pixel respectively, laplacian pyramid vector quantization is compared to the existing spatial domain vector quantization and transform coding under the same condition in both objective and subjective value. The laplacian pyramid vector quantization is much more stable against the statistical characteristics of images than the existing vector quantization and transform coding.

• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.289-293
• /
• 2008

In this paper, we propose the hardware architecture to accelerate 2D Vector graphics process for mobile devices. we propose the Transformation Unit Architecture that considerates the operation dependency. It has 3 cycles excution time and uses 2 multipliers and 2 adders. Proposed paint generation unit uses a LUT method, so it does not execute color interpolation which needs to be calculated every time. The proposed OpenVG 1.0 Accelerator achieved a 2.85 times faster performance in a tiger model.

• Journal of the Optical Society of Korea
• /
• v.1 no.1
• /
• pp.41-43
• /
• 1997

We report the operation of a self-adaptive vector phase conjugate laser (VPCL) oscillator which compensates intracavity polarization distortion and wavefront aberration simultaneously. The VPCL in Nd:YAG gain media produce an output with energy of 125mJ in a 20ns single-longitudinal-mode pulse at 10Hz, which is unaffected by intracavity polarization distortion.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.989-990
• /
• 2006

This paper presents a design of 3D Graphics Geometry processor. A geometry processor needs to cope with a large amount of computation and consists of transformation processor and lighting processor. To deal with the huge computation, a vector processing structure based on pipeline chaining is proposed. The proposed geometry processor performs 4.3M vertices/sec at 100MHz using 11 floating-point units.

• Kyungpook Mathematical Journal
• /
• v.56 no.2
• /
• pp.625-638
• /
• 2016

In this paper, we introduce the notion of semi-slant lightlike submanifolds of indefinite Sasakian manifolds giving characterization theorem with some non-trivial examples of such submanifolds. Integrability conditions of distributions $D_1$, $D_2$ and RadTM on semi-slant lightlike submanifolds of an indefinite Sasakian manifold have been obtained. We also obtain necessary and sufficient conditions for foliations determined by above distributions to be totally geodesic.

• Journal of the Korean Mathematical Society
• /
• v.56 no.6
• /
• pp.1515-1528
• /
• 2019

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A{\subseteq}F^d_q$ and edges assigned the algebraic distance between pairs of vertices. We prove nontrivial results on locating specified subgraphs of maximum vertex degree at most t in dimensions $d{\geq}2t$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1222-1228
• /
• 2006

In this paper, I propose a video watermaking method using adaptive threshold value and half-cell motion vector. Conventional method cause a lot of change of motion vectors and bring about a falling-off in invisibility, because it search embedding condition about whole macroblocks and watermarks are embedded in arbitrary motion vectors. Proposed method improve invisibility and decrease in number of change of motion vectors, because it create threshold value by using power of motion vector(PMV), and watermarks are embedded in motion vectors which greater than threshold value. Consequently, proposed method improve invisibility with on an average 5.4 dB ~9.3dB according to video bit-stream.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.9-9
• /
• 2003

Let $\Omega$ be a bounded, open, and polygonal domain in $R^2$ with re-entrant corners. We consider the following Partial Differential Equations: $$(I-\nabla\nabla\cdot+\nabla^{\bot}\nabla\times)u\;=\;f\;in\;\Omega$$, $$n\cdotu\;0\;0\;on\;{\Gamma}_{N}$$, $${\nabla}{\times}u\;=\;0\;on\;{\Gamma}_{N}$$, $$\tau{\cdot}u\;=\;0\;on\;{\Gamma}_{D}$$, $$\nabla{\cdot}u\;=\;0\;on\;{\Gamma}_{D}$$ where the symbol $\nabla\cdot$ and $\nabla$ stand for the divergence and gradient operators, respectively; $f{\in}L^2(\Omega)^2$ is a given vector function, $\partial\Omega=\Gamma_{D}\cup\Gamma_{N}$ is the partition of the boundary of $\Omega$; nis the outward unit vector normal to the boundary and $\tau$represents the unit vector tangent to the boundary oriented counterclockwise. For simplicity, assume that both $\Gamma_{D}$ and $\Gamma_{N}$ are nonempty. Denote the curl operator in $R^2$ by $$\nabla\times\;=\;(-{\partial}_2,{\partial}_1$$ and its formal adjoint by $${\nabla}^{\bot}\;=\;({-{\partial}_1}^{{\partial}_2}$$ Consider a weak formulation(WF): Find $u\;\in\;V$ such that $$a(u,v):=(u,v)+(\nabla{\cdot}u,\nabla{\cdot}v)+(\nabla{\times}u,\nabla{\times}V)=(f,v),\;A\;v{\in}V$$. (2) We assume there is only one singular corner. There are many methods to deal with the domain singularities. We introduce them shortly and we suggest a new Finite Element Methods by using Singular representation for the solution.

• International Journal of Industrial Entomology and Biomaterials
• /
• v.5 no.1
• /
• pp.67-71
• /
• 2002

The implications of temperature (25,30 and 35$^{\circ}C$) and relative humidity (60, 70 and 80%) on the pupation patterns were studied in the silkworm, Bombyx mori L. Larvae of two pure silkworm breeds, Pure Mysore (PM) and NB4D2 and their hybrid, PM ${\times}4 NB4D2 were reared under experimental conditions under natural day photoperiodic (LD 12: 12) condition. The three developmental marker events viz., larval ripening, pharate pupal formation and pupal formation occurred at or around the beginning of the photo-phase. The computed of mean vector (equation omitted), based on the circular statistics, also confirmed the above. However, the length of mean vector, r and the mean vector angular variance, s varied according to temperature and humidity conditions imposed; the variations being non-significant. Extreme temperature and humidity conditions, however, resulted in reduction in pupation rate (%) for PM and PM ${\times}4 NB4D2. On the other hand, in NB4D2 pupation percentage reduced below the economic level. The temperature and humidity together seems to exert synergic impact on the pupation rate at least in the silkworm Bombyx mori, L.