• ETRI Journal
• /
• v.33 no.3
• /
• pp.344-354
• /
• 2011

In this paper, a model is introduced named double relation chains (DRC) based on ordered sets. It is proved that using DRC and special relationships among the members of an alphabet, vectors of this alphabet can be stored and searched in a tree. This idea is general; however, one special application of DRC is the longest prefix matching (LPM) problem in an IP network. Applying the idea of DRC to the LPM problem makes the prefixes comparable like numbers using a pair of w-bit vectors to store at least one and at most w prefixes, where w is the IP address length. This leads to good compression performance. Based on this, two recently introduced structures called coded prefix trees and scalar prefix trees are shown to be specific applications of DRC. They are implementable on balanced trees which cause the node access complexity for prefix search and update procedures to be O(log n) where n is the number of prefixes. As another advantage, the number of node accesses for these procedures does not depend on w. Additionally, they need fewer number of node accesses compared to recent range-based solutions. These structures are applicable on both IPv4 and IPv6, and can be implemented in software or hardware.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.5
• /
• pp.875-885
• /
• 2010

Recently, the role of Ubiquitous Sensor Network(USN) has been considered to be essential for supporting the near future Network Centric Warfare(NCW) and Tactical Information Communication Network(TICN). In this paper, we explore a set of data storage methods(external storage, local storage and data storage) and query processing methods in WSN. In particular, we focus on analyzing a novel data structure for supporting the local storage method, named the partial ordered tree(POT). The main idea behind POT is that sensor readings are usually correlated with the physical spatial domain. With the help of POT, only a small portion of sensor nodes participate in query processing tasks, and thus network lifetime is greatly increased. Through a series of simulation experiments, we demonstrate that the POT based local storage method clearly outperforms the existing data storage methods in terms of the energy-efficiency, which directly affects the network lifetime, for processing exact match queries, range queries and top-k queries.

• Nuclear Engineering and Technology
• /
• v.49 no.3
• /
• pp.609-620
• /
• 2017

We studied the value of a nuclear power plant by considering Koreans' willingness to pay (WTP) for neutralizing the various problems caused by building and operating a new plant. For this, we used a conjoint analysis and ordered logistic regression. We then compared the WTP estimates between various segment groups. The results revealed that each household was willing to pay an additional 99,677 Korean Won (KRW)/mo on average to resolve the negative impacts from a nuclear plant. Therefore, the yearly cognitive and economic value of a nuclear plant in Korea was about 19 trillion KRW. Through a segment analysis, we found that the more educated, younger, and poorer groups gave higher cognitive values than the less educated, older, and richer groups, respectively. Also, people who lived far from a plant gave higher values than people living near a plant, and people with more knowledge about or interest in nuclear energy gave higher values than people with less knowledge or interest. People who felt that nuclear energy is necessary gave higher values to nuclear energy than those who did not. Our results can be used as bases to set targets for promoting nuclear energy and pursuing a national project of building a nuclear power plant.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.4
• /
• pp.19-26
• /
• 2008

Gene set enrichment analysis (GSEA) is a computational method to identify statistically significant gene sets showing significant differences between two groups of microarray expression profiles and simultaneously uncover their biological meanings in an elegant way by employing gene annotation databases, such as Cytogenetic Band, KEGG pathways, gene ontology, and etc. For the gone set enrichment analysis, all the genes in a given dataset are first ordered by the signal-to-noise ratio between the groups and then further analyses are proceeded. Despite of its impressive results in several previous studies, however, gene ranking by the signal-to-noise ratio makes it difficult to consider highly up-regulated genes and highly down-regulated genes at the same time as the candidates of significant genes, which possibly reflect certain situations incurred in metabolic and signaling pathways. To deal with this problem, in this article, we investigate the gene set enrichment analysis method with Fisher criterion for gene ranking and also evaluate its effects in Leukemia related pathway analyses.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.871-882
• /
• 2012

For a connected graph G of order $n$, an ordered set $S=\{u_1,u_2,{\cdots},u_k\}$ of vertices in G is a linear edge geodetic set of G if for each edge $e=xy$ in G, there exists an index $i$, $1{\leq}i$ < $k$ such that e lie on a $u_i-u_{i+1}$ geodesic in G, and a linear edge geodetic set of minimum cardinality is the linear edge geodetic number $leg(G)$ of G. A graph G is called a linear edge geodetic graph if it has a linear edge geodetic set. The linear edge geodetic numbers of certain standard graphs are obtained. Let $g_l(G)$ and $eg(G)$ denote the linear geodetic number and the edge geodetic number, respectively of a graph G. For positive integers $r$, $d$ and $k{\geq}2$ with $r$ < $d{\leq}2r$, there exists a connected linear edge geodetic graph with rad $G=r$, diam $G=d$, and $g_l(G)=leg(G)=k$. It is shown that for each pair $a$, $b$ of integers with $3{\leq}a{\leq}b$, there is a connected linear edge geodetic graph G with $eg(G)=a$ and $leg(G)=b$.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.71-77
• /
• 2011

In this paper, we propose a learning based super resolution algorithm using local block for image enhancement of vehicle license plate. Local block is defined as the minimum measure of block size containing the associative information in the image. Proposed method essentially generates appropriate local block sets suitable for various imaging conditions. In particular, local block training set is first constructed as ordered pair between high resolution local block and low resolution local block. We then generate low resolution local block training set of various size and blur conditions for matching to all possible blur condition of vehicle license plates. Finally, we perform association and merging of information to reconstruct into enhanced form of image from training local block sets. Representative experiments demonstrate the effectiveness of the proposed algorithm.

• Research in Mathematical Education
• /
• v.8 no.2
• /
• pp.107-114
• /
• 2004

University teachers of linear algebra often feel annoyed and disarmed when faced with the inability of their students to cope with concepts that they consider to be very simple. Usually, they lay the blame on the impossibility for the students to use geometrical intuition or the lack of practice in basic logic and set theory. J.-L. Dorier [(2002): Teaching Linear Algebra at University. In: T. Li (Ed.), Proceedings of the International Congress of Mathematicians (Beijing: August 20-28, 2002), Vol. III: Invited Lectures (pp. 875-884). Beijing: Higher Education Press] mentioned that the situation could not be improved substantially with the teaching of Cartesian geometry or/and logic and set theory prior to the linear algebra. In East Asian countries, science-orientated mathematics curricula of the high schools consist of calculus with many other materials. To understand differential and integral calculus efficiently or for other reasons, students have to learn a lot of content (and concepts) in linear algebra, such as ordered pairs, n-tuple numbers, planar and spatial coordinates, vectors, polynomials, matrices, etc., from an early age. The content of linear algebra is spread out from grades 7 to 12. When the high school teachers teach the content of linear algebra, however, they do not concern much about the concepts of content. With small effort, teachers can help the students to build concepts of vocabularies and languages of linear algebra.

• Journal of Fashion Business
• /
• v.11 no.3
• /
• pp.35-45
• /
• 2007

This study examined how to create 2D basic pattern of individuals by means of 3-D body figure, which is to develop a flat of individual basic pattern directly from the 3-D body scan data of each subject using that of the upper body of a male adult. In terms of methodology, this study adopted 3D body scan data on system and body to make examinations in the following steps: 1. Standard point and line were set on human body, along with 3-D definition points(feature points). 2. PB was created by modifying horizontal and longitudinal section of scan data. 3. Ways to set reserve were established in the findings of PB planar development. Respective developed flat patterns were compared with pattern findings in previous studies by means of sensory evaluation. As a result, it was found that both system and body model are basic pattern and belong to appropriate pattern as semi-tight-fit basic pattern with overall appropriate tolerances. Thus, this study came to a conclusion that it is feasible and valid to develop theories for flat development as considered herein.

• East Asian mathematical journal
• /
• v.5 no.2
• /
• pp.191-198
• /
• 1989

It is shown that a near-ring N which has no nonzero nilpotent elements is a partially ordered set where $x{\leq}y$ if and only if $yx=x^2$. Also it is shown that $(N,{\leq})$ is infinitely distributive for central elements that is $r(supx_i)=sup(rx_i)$ for every central element r of N and any subset $\{x_i\}$ of N. By using some lemmas we showed that a near-ring without nilpotent elements is isomorphic to a direct product of near-fields if and only if N is hyperatomic and orthogonally complete under the condition that every idempotent of N is central.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.5
• /
• pp.102-108
• /
• 1996

Adaptive resonance theory (ART2) characterized by its built-in mechanism of handling the stability-plasticity switching and by the adaptive learning without forgetting informations learned in the past, is based on an unsupervised template matching. We propose an improved tow-stage learning algorithm for aRT2: the original unsupervised learning followed by a new supervised learning. Each of the output nodes, after the unsupervised learning, is labeled according to the category informations to reinforce the template pattern associated with the target output node belonging to the same category some dominant classes from exhausting a finite number of template patterns in ART2 inefficiently. Experimental results on a set of 2545 FLIR images show that the ART2 trained by the two-stage learning algorithm yields better accuracy than the original ART2, regardless of th esize of the network and the methods of evaluating the accuracy. This improvement shows the effectiveness of the two-stage learning process.