• Journal of the Korean Mathematical Society
• /
• 제47권5호
• /
• pp.1001-1015
• /
• 2010

Let M be a $C^{\infty}$ real hypersurface in $\mathbb{C}^{n+1}$, $n\;{\geq}\;1$, locally given as the zero locus of a $C^{\infty}$ real valued function r that is defined on a neighborhood of the reference point $P\;{\in}\;M$. For each k = 1,..., n we present a necessary and sufficient condition for there to exist a complex manifold of dimension k through P that is contained in M, assuming the Levi form has rank n - k at P. The problem is to find an integral manifold of the real 1-form $i{\partial}r$ on M whose tangent bundle is invariant under the complex structure tensor J. We present generalized versions of the Frobenius theorem and make use of them to prove the existence of complex submanifolds.

• Communications of the Korean Mathematical Society
• /
• 제29권4호
• /
• pp.569-579
• /
• 2014

We consider a condition under which the projectivization $P(E^k)$ of a complex k-bundle $E^k{\rightarrow}M$ over an even-dimensional manifold M can have the hard Lefschetz property, affected by [10]. It depends strongly on the rank k of the bundle $E^k$. Our approach is purely algebraic by using rational Sullivan minimal models [5]. We will give some examples.

• Journal of applied mathematics & informatics
• /
• 제30권5_6호
• /
• pp.787-792
• /
• 2012

We present a graphical algorithm and theorems for calculating the ranks of reaction networks. The ranks are needed to study behaviors of the networks from their structures. This approach can graphically simplify complex networks for the calculation. We show an example of a large network for the practical advantage.

• Bulletin of the Korean Mathematical Society
• /
• 제47권4호
• /
• pp.787-792
• /
• 2010

Let A and B be some standard operator algebras on complex Banach spaces X and Y, respectively. We give the concrete forms of linear idempotence preserving maps $\Phi\;:\;A\;{\rightarrow}\;B$ on finite-rank operators.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• 제42권1호
• /
• pp.67-78
• /
• 2005

We proposed a blind watermarking for 3D mesh model using the patch CEGIs. The CEGI is the 3D orientation histogram with complex weight whose magnitude is the mesh area and phase is the normal distance of the mesh from the designated origin. In the proposed algorithm we divide the 3D mesh model into the number of patch that determined adaptively to the shape of model and calculate the patch CEGIs. Some cells for embedding the watermark are selected according to the rank of their magnitudes in each of patches after calculating the respective magnitude distributions of CEGI for each patches of a mesh model. Each of the watermark bit is embedded into cells with the same rank in these patch CEGI. Based on the patch center point and the rank table as watermark key, watermark extraction and realignment process are performed without the original mesh. In the rotated model, we perform the realignment process using Euler angle before the watermark extracting. The results of experiment verify that the proposed algorithm is imperceptible and robust against geometrical attacks of cropping, affine transformation and vertex randomization as well as topological attacks of remeshing and mesh simplification.

• Bulletin of the Korean Mathematical Society
• /
• 제29권1호
• /
• pp.9-13
• /
• 1992

In this paper, we consider the function related with almost hermitian structure on a copact complex manifold. More precisely, on a 2n-diminsional complex manifold M admitting 2-form .ohm. of rank 2n everywhere, assume that M admits a metric g such that g(JX, JY)=g(X,Y), that is, assume that g defines an hermitian structure on M admitting .ohm. as fundamental 2-form-the 'almost complex structure' J being determined by g and .ohm.:g(X,Y)=.ohm.(X,JY). We consider the function I(g):=.int.$_{M}$ $N^{2}$d $V_{g}$, where N is the norm of Nijenhuis tensor N defined by (J,g). by (J,g).

• Bulletin of the Korean Mathematical Society
• /
• 제37권1호
• /
• pp.91-102
• /
• 2000

Let ${\gamma}{\equiv}{\gamma}^{(2n)}$ denote a sequence of complex numbers ${\gamma}{00},{\gamma}{01},\cdots,{\gamma}0, 2n,...,{\gamma}{2n},0\;with\; {\gamma}{00}\;>\;0,{\gamma}{ji}={{\overline}{\gamma_{ij}}}$,and let K denote a closed subset of the complex plane C. The truncated K complex moment problem entails finding a positive Borel measure $\mu$ such that ${\gamma}{ij}={\int}{{\overline}{z}}^{i}z^{j}d{\mu}\;(0{\leq}\;i+j\;{\leq}\;2n)$ and supp ${\mu}{\subseteq}\;K$. If n=2, then is called the quartic moment problem. In this paper, we give partial solutions for the singular quartic moment problem with rank M(2)=5 and ${{\overline}{Z}}Z{\in}\;<1,Z,{{\overline}{Z}},Z^{2},{{\overline}{Z}}^2>$.

• Journal of Institute of Control, Robotics and Systems
• /
• 제12권5호
• /
• pp.489-496
• /
• 2006

The random-based cleaning algorithm is a simple algorithm widely used in commercial vacuum cleaning robots. This algorithm has two limitations, that is, cleaning takes a long time and there is no guarantee that the cleaning will cover the whole cleaning area. This has lead to customer dissatisfaction. Thus, in recent years, many intelligent cleaning algorithms that takes into consideration information gathered from the cleaning area environment have been proposed. The plowing-based algorithm, which is the most efficient algorithm known to date when there are no obstacles in the cleaning area, has a deficiency that when obstacle prevail, its performance is not guaranteed. In this paper, we propose the Group-k algorithm that is efficient for that situation, that is, when obstacle prevail. The goal is not to complete the cleaning as soon as possible, but to clean the majority of the cleaning area as fast as possible. The motivation behind this is that areas close to obstacles are usually difficult for robots to handle, and hence, many require human assistance anyway In our approach, obstacles are grouped by the complexity of the obstacles, which we refer to as 'complex rank', and then decide the cleaning route based on this complex rank. Results from our simulation-based experiments show that although the cleaning completion time takes longer than the plowing-based algorithm, the Group-k algorithm cleans the majority of the cleaning area faster than the plowing algorithm.

• Journal of KIISE
• /
• 제44권6호
• /
• pp.581-586
• /
• 2017

For automatic web scraping, unnecessary components such as menus and advertisements need to be removed from web pages and main contents should be extracted automatically. A content block tends to be located in the middle of a web page. In particular, Korean web documents rarely include metadata and have a complex design; a suitable method of content extraction is therefore needed. Existing content extraction algorithms use the textual and structural features of content blocks because processing visual features requires heavy computation for rendering and image processing. In this paper, we propose a new content extraction method using the tag positions in HTML as a quasi-visual feature. In addition, we develop a tag rank position, a type of tag position not affected by text length, and show that gradient boosting with the tag rank position is a very accurate content extraction method. The result of this paper shows that the content extraction method can be used to collect high-quality text data automatically from various web pages.

• Journal of the Korean Institute of Landscape Architecture
• /
• 제22권3호
• /
• pp.121-135
• /
• 1994

The Purpose of this study was to obtain data about management of the landscape plants and facility in APT. complex. Because of be completed 2 years ago, landscape plants ware damaged by transplantation and lost the nature tree shape. As well, the management conditions of plants and facility were wholly bad. In details, tree-species consisted of 52 species arbors and 35 species shrubs in APT. complex. The high rank 5 species were planted as main plants. The rates were 45.6-62.8% in arbors and 81.8-97.0% in shrubs. In the degree of tree shape and damage by diseuse and pest, the bad level of 1-2points were ranked highly as 13.9% and 10.4%. In the degree of tree shape and damage by disease and pest, the bad level of 1-2points were showed as 5.1% and 4.7%. In the interview Survey, the main problems of management-maintenance were expressed deficiency of budget, specialist and concern of residents. In the future, methods for the intensive management of APT. complex; First, the management of landscape plants and facility should be attained by a expert and need to establishment of maintenance scheme thoroughly. Above all, for improvement of residential life, we should be lead to convert of a resident recognition in the management -maintenance of exterior space.