• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.595-608
• /
• 2013

Let G = (V, E) be a simple connected graph. The sets of vertices and edges of G are denoted by V = V (G) and E = E(G), respectively. In such a simple molecular graph, vertices represent atoms and edges represent bonds. The distance between the vertices $u$ and $v$ in V (G) of graph G is the number of edges in a shortest path connecting them, we denote by $d(u,v)$. In graph theory, we have many invariant polynomials for a graph G. In this paper, we focus on the Schultz polynomial, Modified Schultz polynomial, Hosoya polynomial and their topological indices of a molecular graph circumcoronene series of benzenoid $H_k$ and specially third member from this family. $H_3$ is a basic member from the circumcoronene series of benzenoid and its conclusions are base calculations for the Schultz polynomial and Hosoya polynomial of the circumcoronene series of benzenoid $H_k$ ($k{\geq}3$).

• The Korean Journal of Ecology
• /
• v.25 no.1
• /
• pp.29-31
• /
• 2002

The purpose of this study is to estimate height growth patterns and site index cuties (base index age 50 years) for Japanese red cedar trees(Cryptomeria japonica D. Don) grown in southern regions of Korea. The Chapman-Richards growth function was selected for stand height prediction using on the results of stem analysis data sets. Anamorphic base age invariant site index cuties were presented based on this height prediction equation. The resulting site index prediction equation can provide an indication of the productivity of the site quality based on Japanese red cedar trees plantation ages planted in southern regions of Korea.

• Journal of information and communication convergence engineering
• /
• v.12 no.2
• /
• pp.128-134
• /
• 2014

In this paper, we present a graphics processing unit (GPU)-based matching technique for the purpose of fast feature matching between different images. The scale invariant feature transform algorithm developed by Lowe for various feature matching applications, such as stereo vision and object recognition, is computationally intensive. To address this problem, we propose a matching technique optimized for GPUs to perform computations in less time. We optimize GPUs for fast computation of keypoints to make our system quick and efficient. The proposed method uses a self-organizing map feature matching technique to perform efficient matching between the different images. The experiments are performed on various image sets to examine the performance of the system under varying conditions, such as image rotation, scaling, and blurring. The experimental results show that the proposed algorithm outperforms the existing feature matching methods, resulting in fast feature matching due to the optimization of the GPU.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.2
• /
• pp.69-77
• /
• 1993

Automatic image recognition system is essential for a better man-to machine interaction. Because of the noise and deformation due to the sensor operation, it is not simple to build an image recognition system even for the fixed images. In this paper neural network which has been reported to be adequate for pattern recognition task is applied to the fixed and variational(rotation, size, position variation for the fixed image)recognition with a hope that the problems of conventional pattern recognition techniques are overcome. At fixed image recognition system. ART model is trained with face images obtained by camera. When recognizing an matching score. In the test when wigilance level 0.6 - 0.8 the system has achievel 100% correct face recognition rate. In the variational image recognition system, 65 invariant moment features sets are taken from thirteen persons. 39 data are taken to train multi-layer perceptron and other 26 data used for testing. The result shows 92.5% recognition rate.

• Journal of the Korean Mathematical Society
• /
• v.41 no.6
• /
• pp.1087-1099
• /
• 2004

We study the metrical and topological pressure for flows without fixed points on a compact metric space, and get the results as follows: (1) The metrical pressure with respect to an ergodic measure can be defined by (t, $\varepsilon$)-spanning sets. (2) The topological pressure is the supremum of metrical pressures with respect to all ergodic measures. (3) The properties that the topological pressure is zero, nonzero, finite or infinite respectively are invariant under weak equivalence.

• International Journal of Aerospace System Engineering
• /
• v.2 no.2
• /
• pp.73-78
• /
• 2015

According to the characteristic of carrier-based aircraft, the method of solving safe set during arresting landing is discussed in this paper based on optimal control and invariant set theory. The safe sets of carrier aircraft are evaluated in different states on the characteristic of longitudinal augmented system by using the level set method. Then, the influence on the boundary of safe set under various factors is analyzed. At last, the maneuverability envelope protection is established based on the corresponding theory, and the validity of the system is verified through simulation. The results demonstrate preliminarily that: compared with mass and thrust, the elevator is the greatest influence factor for the boundary of safe set; the dynamic trajectory of carrier-based aircraft can be located at the interior of safe set effectively with the maneuverability envelope protection.

• Journal of the Korean Mathematical Society
• /
• v.42 no.3
• /
• pp.573-597
• /
• 2005

A continuous linear operator T, on the space of entire functions in d variables, is PDE-preserving for a given set $\mathbb{P}\;\subseteq\;\mathbb{C}|\xi_{1},\ldots,\xi_{d}|$ of polynomials if it maps every kernel-set ker P(D), $P\;{\in}\;\mathbb{P}$, invariantly. It is clear that the set $\mathbb{O}({\mathbb{P}})$ of PDE-preserving operators for $\mathbb{P}$ forms an algebra under composition. We study and link properties and structures on the operator side $\mathbb{O}({\mathbb{P}})$ versus the corresponding family $\mathbb{P}$ of polynomials. For our purposes, we introduce notions such as the PDE-preserving hull and basic sets for a given set $\mathbb{P}$ which, roughly, is the largest, respectively a minimal, collection of polynomials that generate all the PDE-preserving operators for $\mathbb{P}$. We also describe PDE-preserving operators via a kernel theorem. We apply Hilbert's Nullstellensatz.

• Journal of Korea Multimedia Society
• /
• v.18 no.1
• /
• pp.1-8
• /
• 2015

In recent years, ear has emerged as a new biometric trait, because it has advantage of higher user acceptance than fingerprint and can be captured at remote distance in an indoor or outdoor environment. This paper proposes an individual identification method using ear region based on SIFT(shift invariant feature transform). Unlike most of the previous studies using rectangle shape for extracting a region of interest(ROI), this study sets an ROI as a flexible expanded region including ear. It also presents an effective extraction and matching method for SIFT keypoints. Experiments for evaluating the performance of the proposed method were performed on IITD public database. It showed correct identification rate of 98.89%, and it showed 98.44% with a deformed dataset of 20% occlusion. These results show that the proposed method is effective in ear recognition and robust to occlusion.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.6
• /
• pp.88-100
• /
• 1998

In this paper, an algorithm for a real-time automatic fingerprint identification system is proposed. The fingerprint feature volume is extracted by considering distinct and local characteristics(such as intensity and image quality difference etc.) in fingerprint images, which makes the algorithm properly adaptive to various image acquisitionj methods. Also the matching technique is designed to be invariant on rotation, scaling and translation (RST) changes while being capable of real-time processing. And the classification of fingerprints is performed based on the ridge flow and the relations among singular points such as cores and deltas. The developed fingerprint identification algorithm has been applied to various sets of fingerprint images such as one from NIST(National Institute of Standards and Technology, USA), a pressed fingerprint database constructed according to Korean population distributions in sex, ages and jobs, and a set of rolled-than-scanned fingerprint images. The overall performance of the algorithm has been analyzed and evaluated to the false rejection ratio of 0.07% while holding the false acceptance ratio of 0%.

• Tunnel and Underground Space
• /
• v.31 no.1
• /
• pp.66-81
• /
• 2021

The effects of directional fracture tensor components and first invariant of fracture tensor on deformation moduli and shear moduli of fractured rock masses is analyzed based on regression analysis performed between 3-D fracture tensor parameters and deformability of DFN blocks. Using one or two deterministic joint sets, a total of 224 3-D discrete fracture network (DFN) cube blocks were generated with various configurations of deterministic density and probabilistic size distribution. The fracture tensor parameters were calculated for each generated DFN systems. Also, deformability moduli with respect to three perpendicular direction of the DFN cube blocks were estimated based on distinct element method. The larger the first invariant of fracture tensor, the smaller the values for the deformability moduli of the DFN blocks. These deformability properties present an asymptotic pattern above the certain threshold. It is found that power-law function describes the relationship between the directional deformability moduli and the corresponding fracture tensor components estimated in same direction.