• ETRI Journal
• /
• 제33권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.

• 한국군사과학기술학회지
• /
• 제13권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
• /
• 제49권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.

• 전자공학회논문지CI
• /
• 제45권4호
• /
• pp.19-26
• /
• 2008

Gene set enrichment analysis (GSEA)는 두 개의 클래스를 가지는 마이크로어레이 실험 데이터 분석을 위해 생물학적 특징을 기반으로 구성된 다양한 유전자-집합 중에서 두 클래스의 발현값들이 통계적으로 중요한 차이를 나타내는 유의한 유전자-집합을 추출하기 위한 분석 방법이다. 특히, 유전자에 대한 다양한 생물학적인 정보를 지닌 유전자 주석 데이터베이스(Cytogenetic Band, KEGG pathway, Gene Ontology 등)를 이용하여 마이크로어레이 실험에 사용된 전체 유전자 중 특정 기능을 가지는 유전자들을 그룹화하여 다양한 유전자-집합을 발굴하고, 각 유전자-집합 내에서 두 클래스간에 발현값의 차이를 참조하여 유의한 유전자들을 결정하여, 이를 기반으로 통계적으로 유의한 유전자-집합들을 최종 검출하는 방법이다. 본 논문에서는 GSEA 분석 과정에서 현재 주로 사용되고 있는 signal-to-noise ratio 기반 유전자 서열화(gene ranking) 방법 대신에, Fisher criterion을 이용한 유전자 서열화 방법을 적용함으로써 기존의 GSEA 방법에서 추출하지 못한 생물학적으로 의미 있는 새로운 유의 유전자-집합을 추출하는 방법을 제안하고자 한다. 또한, 제안한 방법의 성능을 고찰하기 위하여 공개된 Leukemia 관련 마이크로어레이 실험 데이터 분석에 적용하였으며, 기존의 알려진 결과와 비교 분석함으로써 제안한 방법의 유용성을 검증하고자 하였다.

• Journal of applied mathematics & informatics
• /
• 제30권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$.

• 한국컴퓨터정보학회논문지
• /
• 제16권6호
• /
• pp.71-77
• /
• 2011

본 논문에서는 번호판 인식 시스템에서 번호판 영상의 화질 개선을 위하여 국부 블록(Local block : LB) 학습기반의 초해상도 알고리즘을 제안한다. 본 논문에서 국부 블록은 영상 내에서 정보를 담고 있는 최소 단위로 정의하였으며, 학습의 기본 단위가 된다. 제안된 방법은 먼저 다양한 환경에 적합한 훈련 국부 블록 set을 생성하였다. 훈련 국부 블록 set은 고해상도 국부 블록과 저해상도 국부 블록의 순서쌍으로 구성되며 다양한 크기의 번호판과 열화 영상에 대응하기 위하여 다양한 크기와 열화를 갖는 저해상도 국부 블록 훈련 set을 구성하였다. 그 다음으로는 저해상도 입력 영상에서 복원해야할 정보를 훈련 국부 블록 set에서 추출/융합하는 과정을 제안하였다. 모의 실험결과, 열화된 저해상도 번호판 영상에 대해 제안한 방법이 효과적인 복원 성능을 나타내는 것을 확인할 수 있었다.

• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제8권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.

• 패션비즈니스
• /
• 제11권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
• /
• 제5권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.

• 전자공학회논문지B
• /
• 제33B권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.