• Journal of the Korean Mathematical Society
• /
• v.55 no.1
• /
• pp.29-42
• /
• 2018

We construct bounded linear integral operators that giving solutions to the ${\bar{\partial}}$-equation in $L^p$-spaces and with compact supports on a q-convex intersection ($q{\geq}1$) with ${\mathcal{C}}^3$ boundary in $K{\ddot{a}}hler$ manifolds, and we apply it to obtain a Hartogs-like extension theorems for ${\bar{\partial}}$-closed forms for some bidegree.

• The Korean Journal of Applied Statistics
• /
• v.22 no.5
• /
• pp.1097-1102
• /
• 2009

Classification of subjects with unknown distribution in small sample size setup may involve order-restricted constraints in multivariate parameter setups. Those problems makes optimality of conventional likelihood ratio based statistical inferences not feasible. Fortunately, Roy (1953) introduced union-intersection principle(UIP) which provides an alternative avenue. Redescending M-estimator along with that principle yields a considerably appropriate robust testing procedure. Furthermore, conditionally distribution-free test based upon exact permutation theory is used to generate p-values, even in small sample. Applications of this method are illustrated in simulated data and read data example (Lobenhofer et al., 2002)

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.854-858
• /
• 2001

본 논문에서는 평면 형상에 대한 꼬임(self-intersection)의 발생을 배제한 계층적 표현을 제안하였다. 기존의 계층적 표현들에서는 실제 활용에 많은 문제를 초래하는 꼬인 형상의 발생을 피할 수 없으며, 이는 반드시 제거될 필요가 있다. 그러나 n개의 점으로 구성된 형상의 고임 문제를 해결하는 데는 O(n$^2$)의 계산량이 요구되므로, 본 논문에서는 계층적 지역화의 경계 영역간 교차 상태를 나타내는 cross-link 개념을 도입하여 효율적으로 해결할 수 있는 꼬임 해결 알고리즘을 제안하고 실험을 통해 그 효율성을 확인하였다.

• Honam Mathematical Journal
• /
• v.36 no.3
• /
• pp.605-622
• /
• 2014

We provide a minimal free resolution for a class of Gorenstein ideal of grade 4 which is the sum of an almost complete intersection J of grade 3 and a perfect ideal I of grade 3 with type 2 and ${\lambda}(I)$ > 0 geometrically linked by a regular sequence, where I is generated by odd elements.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.94-96
• /
• 2009

In this paper, we present the Q-learning method for adaptive traffic signal control on the basis of multi-agent technology. The structure is composed of sixphase agents and one intersection agent. Wireless communication network provides the possibility of the cooperation of agents. As one kind of reinforcement learning, Q-learning is adopted as the algorithm of the control mechanism, which can acquire optical control strategies from delayed reward; furthermore, we adopt dynamic learning method instead of static method, which is more practical. Simulation result indicates that it is more effective than traditional signal system.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.1016-1021
• /
• 1989

In this paper, we introduce a recursively-defined natural join operation as well as well-known object composition operations (union, intersection) for composing CAD database objects. Then, we will discuss how to realize these operations by the message passing computing mechanism. Next, we will discuss what kind of behaviours (methods) are preserved under our natural join operations. Finally, we investigate mathematical properties about the relationships among several object composition operations (natural join, union and intersection).

• Honam Mathematical Journal
• /
• v.36 no.2
• /
• pp.387-398
• /
• 2014

In this paper, we give a structure theorem for a class of Gorenstein ideal of grade 4 which is the sum of an almost complete intersection of grade 3 and a Gorenstein ideal of grade 3 geometrically linked by a regular sequence. We also present the Hilbert function of a Gorenstein ideal of grade 4 induced by a Gorenstein matrix f.

• The Pure and Applied Mathematics
• /
• v.18 no.3
• /
• pp.245-253
• /
• 2011

Some new results on the intersection property of all nonzero solutions of a class of planar systems of Li$\acute{e}$nard type with vertical isoclines are obtained. The results of this paper generalize some previous results on this field.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.2E
• /
• pp.27-31
• /
• 2000

Evaluating log-likelihood of Gaussian mixture density is major computational burden for the keyword spotting system using continuous HMM. In this paper, we employ the bucket box intersection (BBI) algorithm to reduce the computational complexity of keyword spotting. We make some modification in implementing BBI algorithm in order to increase the discrimination ability among the keyword models. According to our keyword spotting experiments, the modified BBI algorithm reduces 50% of log-likelihood computations without performance degradation, while the original BBI algorithm under the same condition reduces only 30% of log-likelihood computations.

• Journal of applied mathematics & informatics
• /
• v.35 no.3_4
• /
• pp.331-347
• /
• 2017

Soft sets are fantastic mathematical tools to handle imprecise and uncertain information in complicated situations. In this paper, we defined the hybrid structure which is the combination of soft set and complex number representation of intuitionistic fuzzy set. We defined basic set theoretic operations such as complement, union, intersection, restricted union, restricted intersection etc. for this hybrid structure. Moreover, we developed this theory to establish some more set theoretic operations like Disjunctive sum, difference, product, conjugate etc.