• Publications of The Korean Astronomical Society
• /
• v.15 no.spc1
• /
• pp.133-145
• /
• 2000

Symbiotic stars are known as binary systems with both cool and hot components with enshrounding nebulous gas. The cool component, M-type giant, is presumably loosing its mass into a hot white or main sequence companion star through the inner Lagrangian point. The lines emit from the ionized nebulous region around the hot star while the mass loss or accretion activity is believed to be the main cause of sudden variation of the continuum and line fluxes. We selected 17 symbiotics for which the emission line fluxes were measured from the IUE SWP, LWR data, to find variability of spectrum. We also investigated the periodic variation of emissions or eclipsing effect from the IUE lines. All of our symbiotics show very high electron densities in the emission regions. For other optical symbiotics, the observations had been carried in 1999 with BOAO mid-resolution spectrometer. We classified symbiotics based on their outburst activities, or emission line characteristics, i.e., $OVI{\lambda}6830.\;The\;OVI{\lambda}6830$ emission lines are also found in S-type symbiotics, which have been known as charateristics of D-types.

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.546-549
• /
• 1999

For the safty driving of an automobile which is become individual requisites, a new Neural Network algorithm which recognized the load vehicles in real time is proposed. The proposed neural network technique is the real time computation method through the inter-node diffusion. In the network, a node corresponds to a state in the quantized input space. Each node is composed of a processing unit and fixed weights from its neighbor nodes as well as its input terminal. The most reliable algorithm derived for real time recognition of vehicles, is a dynamic programming based algorithm based on sequence matching techniques that would process the data as it arrives and could therefore provide continuously updated neighbor information estimates. Through several simulation experiments, real time reconstruction of the nonlinear image information is processed 1-D LIPN hardware has been composed and various experiments with static and dynamic signals have been implmented.

• Honam Mathematical Journal
• /
• v.36 no.4
• /
• pp.913-919
• /
• 2014

We investigate the relationships between the space X and the hyperspaces concerning admissibility and connectedness im kleinen. The following results are obtained: Let X be a Hausdorff continuum, and let A, $B{\in}C(X)$ with $A{\subset}B$. (1) If X is c.i.k. at A, then X is c.i.k. at B if and only if B is admissible. (2) If A is admissible and C(X) is c.i.k. at A, then for each open set U containing A there is a continuum K and a neighborhood V of A such that $V{\subset}IntK{\subset}K{\subset}U$. (3) If for each open subset U of X containing A, there is a continuum B in C(X) such that $A{\subset}B{\subset}U$ and X is c.i.k. at B, then X is c.i.k. at A. (4) If X is not c.i.k. at a point x of X, then there is an open set U containing x and there is a sequence $\{S_i\}^{\infty}_{i=1}$ of components of $\bar{U}$ such that $S_i{\longrightarrow}S$ where S is a nondegenerate continuum containing the point x and $S_i{\cap}S={\emptyset}$ for each i = 1, 2, ${\cdots}$.

• 제어로봇시스템학회:학술대회논문집
• /
• 1999.10a
• /
• pp.92-95
• /
• 1999

The design problem of the control system is the ability to synthesize controller that achieve robust stability and robust performance. The paper explains the Finite Inclusions Theorem (FIT) by the procedure namely FIT synthesis. It is developed for synthesizing robustly stabilizing controller for parametrically uncertain system. The fundamental problem in the study of parametrically uncertain system is to determine whether or not all the polynomials in a given family of characteristic polynomials is Hurwitz i.e., all their roots lie in the open left-half plane. By FIT it can prove a polynomial is Hurwitz from only approximate knowledge of the polynomial's phase at finitely many points along the imaginary axis. An example shows the simplicity of using the FIT synthesis to directly search for robust controller of parametrically uncertain system by way of solving a sequence of systems of linear inequalities. The systems of inequalities are solved via the projection method which is an elegantly simple technique fur solving (finite or infinite) systems of convex inequalities in an arbitrary Hilbert space. Results from example show that the controller synthesized by FIT synthesis is better than by H$\sub$$\infty$/ synthesis with parametrically uncertain system as well as satisfied the objectives for a considerably larger range of uncertainty.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.227-245
• /
• 2011

In this paper, we introduce a new iterative method for finding a common element of the set of solutions for mixed equilibrium problem, the set of solutions of the variational inequality for a ${\beta}$inverse-strongly monotone mapping and the set of fixed points of a family of finitely nonexpansive mappings in a real Hilbert space by using the viscosity and Ces$\`{a}$ro mean approximation method. We prove that the sequence converges strongly to a common element of the above three sets under some mind conditions. Our results improve and extend the corresponding results of Kumam and Katchang [A viscosity of extragradient approximation method for finding equilibrium problems, variational inequalities and fixed point problems for nonexpansive mapping, Nonlinear Analysis: Hybrid Systems, 3(2009), 475-86], Peng and Yao [Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems, Mathematical and Computer Modelling, 49(2009), 1816-828], Shimizu and Takahashi [Strong convergence to common fixed points of families of nonexpansive mappings, Journal of Mathematical Analysis and Applications, 211(1) (1997), 71-83] and some authors.

• Journal of Advanced Navigation Technology
• /
• v.14 no.2
• /
• pp.284-288
• /
• 2010

Video surveillance is widely used in establishing the societal security network. In this paper, intrusion detection based on visual information acquired by static camera is proposed. Proposed approach uses background model constructed by approximated median filter(AMF) to find a foreground candidate, and detected object is calculated by analyzing motion information. Motion detection is determined by the relative size of 2D object in RGB space, finally, the threshold value for detecting object is determined by heuristic method. Experimental results showed that the performance of intrusion detection is better one when the spatio-temporal candidate informations change abruptly.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.437-448
• /
• 2007

Suppose K is a nonempty closed convex nonexpansive retract of a real uniformly convex Banach space E with P as a nonexpansive retraction. Let $T_1,\;T_2\;and\;T_3\;:\;K{\rightarrow}E$ be nonexpansive mappings with nonempty common fixed points set. Let $\{\alpha_n\},\;\{\beta_n\},\;\{\gamma_n\},\;\{\alpha'_n\},\;\{\beta'_n\},\;\{\gamma'_n\},\;\{\alpha'_n\},\;\{\beta'_n\}\;and\;\{\gamma'_n\}$ be real sequences in [0, 1] such that ${\alpha}_n+{\beta}_n+{\gamma}_n={\alpha}'_n+{\beta'_n+\gamma}'_n={\alpha}'_n+{\beta}'_n+{\gamma}'_n=1$, starting from arbitrary $x_1{\in}K$, define the sequence $\{x_n\}$ by $$\{zn=P({\alpha}'_nT_1x_n+{\beta}'_nx_n+{\gamma}'_nw_n)\;yn=P({\alpha}'_nT_2z_n+{\beta}'_nx_n+{\gamma}'_nv_n)\;x_{n+1}=P({\alpha}_nT_3y_n+{\beta}_nx_n+{\gamma}_nu_n)$$ with the restrictions $\sum^\infty_{n=1}{\gamma}_n<\infty,\;\sum^\infty_{n=1}{\gamma}'_n<\infty,\; \sum^\infty_{n=1}{\gamma}'_n<\infty$. (i) If the dual $E^*$ of E has the Kadec-Klee property, then weak convergence of a $\{x_n\}$ to some $x^*{\in}F(T_1){\cap}{F}(T_2){\cap}(T_3)$ is proved; (ii) If $T_1,\;T_2\;and\;T_3$ satisfy condition(A'), then strong convergence of $\{x_n\}$ to some $x^*{\in}F(T_1){\cap}{F}(T_2){\cap}(T_3)$ is obtained.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.753-762
• /
• 2010

Let K be a nonempty closed convex subset of a real Hilbert space H. Let T : K $\rightarrow$ K be a nonexpansive mapping with a nonempty fixed point set Fix(T). Let f : K $\rightarrow$ K be a contraction mapping. Let {$\alpha_n$} and {$\beta_n$} be sequences in (0, 1) such that $\lim_{x{\rightarrow}0}{\alpha}_n=0$, (0.1) $\sum_{n=0}^{\infty}\;{\alpha}_n=+{\infty}$, (0.2) 0 < a ${\leq}\;{\beta}_n\;{\leq}$ b < 1 for all $n\;{\geq}\;0$. (0.3) Then it is proved that the modified Krasnoselski-Mann iterative sequence {$x_n$} given by {$x_0\;{\in}\;K$, $y_n\;=\;{\alpha}_{n}f(x_n)+(1-\alpha_n)x_n$, $n\;{\geq}\;0$, $x_{n+1}=(1-{\beta}_n)y_n+{\beta}_nTy_n$, $n\;{\geq}\;0$, (0.4) converges strongly to a point p $\in$ Fix(T} which satisfies the variational inequality

$\leq$ 0, z $\in$ Fix(T). (0.5) This result improves and extends the corresponding results of Yao et al[Y.Yao, H. Zhou, Y. C. Liou, Strong convergence of a modified Krasnoselski-Mann iterative algorithm for non-expansive mappings, J Appl Math Com-put (2009)29:383-389.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4549-4566
• /
• 2017

This work presents a novel facial descriptor, which is named as multiscale adaptive local directional texture pattern (MALDTP) and employed for expression recognition. We apply an adaptive threshold value to encode facial image in different scales, and concatenate a series of histograms based on the MALDTP to generate facial descriptor in term of Gabor filters. In addition, some dedicated experiments were conducted to evaluate the performance of the MALDTP method in a person-independent way. The experimental results demonstrate that our proposed method achieves higher recognition rate than local directional texture pattern (LDTP). Moreover, the MALDTP method has lower computational complexity, fewer storage space and higher classification accuracy than local Gabor binary pattern histogram sequence (LGBPHS) method. In a nutshell, the proposed MALDTP method can not only avoid choosing the threshold by experience but also contain much more structural and contrast information of facial image than LDTP.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2006.05a
• /
• pp.1-4
• /
• 2006

A down construction method is frequently used in these days to reduce popular discontent and to assure sufficient working space at early stage in downtown area. There are two main problems in the existing down construction method. One is a confliction between frame works and excavation works, and the other is a cold joint in retaining wall which is unavoidable due to a sequence of concrete placement and induces a water leakage. Therefore, a new method is needed to overcome these problems. The CWS (buried wale Continuous Wall System) method was developed by authors. By replacing RC perimeter beam with embedded steel wale, the steel frame works of substructure can be simplified and the water leakage can be prevented using continuous retaining wall. Consequently, the improved duality and reduction of construction period can be obtained from CWS method.