• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2607-2627
• /
• 2017

Nonnegative matrix factorization (NMF) has received considerable attention due to its effectiveness of reducing high dimensional data and importance of producing a parts-based image representation. Most of existing NMF variants attempt to address the assertion that the observed data distribute on a nonlinear low-dimensional manifold. However, recent research results showed that not only the observed data but also the features lie on the low-dimensional manifolds. In addition, a few hard priori label information is available and thus helps to uncover the intrinsic geometrical and discriminative structures of the data space. Motivated by the two aspects above mentioned, we propose a novel algorithm to enhance the effectiveness of image representation, called Dual graph-regularized Constrained Nonnegative Matrix Factorization (DCNMF). The underlying philosophy of the proposed method is that it not only considers the geometric structures of the data manifold and the feature manifold simultaneously, but also mines valuable information from a few known labeled examples. These schemes will improve the performance of image representation and thus enhance the effectiveness of image classification. Extensive experiments on common benchmarks demonstrated that DCNMF has its superiority in image classification compared with state-of-the-art methods.

• 한국정밀공학회지
• /
• 제25권7호
• /
• pp.103-110
• /
• 2008

This paper presents a new approach of recognizing a 3D object using a single camera, based on the extended convex hull of its silhouette. It aims at minimizing the DB size and simplifying the processes for matching and feature extraction. For this purpose, two concepts are introduced: extended convex hull and measurable region. Extended convex hull consists of convex curved edges as well as convex polygons. Measurable region is the cluster of the viewing vectors of a camera represented as the points on the orientation sphere from which a specific set of surfaces can be measured. A measurable region is represented by the extended convex hull of the silhouette which can be obtained by viewing the object from the center of the measurable region. Each silhouette is represented by a relation graph where a node describes an edge using its type, length, reality, and components. Experimental results are included to show that the proposed algorithm works efficiently even when the objects are overlapped and partially occluded. The time complexity for searching the object model in the database is O(N) where N is the number of silhouette models.

• 한국경영과학회지
• /
• 제39권2호
• /
• pp.131-140
• /
• 2014

Customer networks go through constant changes. They may expand or shrink once they are formed. In dynamic environments, it is a critical corporate challenge to identify and manage influential customer groups in a cost effective way. In this context, we apply inverse optimization theory to suggest an efficient method to manage customer networks. In this paper, we assume that there exists a subset of nodes that might have a large effect on the network and that the network can be modified via some strategic actions. Rather than making efforts to find influential nodes whenever the network changes, we focus on a subset of selective nodes and perturb as little as possible the interaction between nodes in order to make the selected nodes influential in the given network. We define the following problem based on the inverse optimization. Given a graph and a prescribed node subset, the objective is to modify the structure of the given graph so that the fixed subset of nodes becomes a minimum dominating set in the modified graph and the cost for modification is minimum under a fixed norm. We call this problem the inverse dominating set problem and investigate its computational complexity.

• 정보처리학회논문지B
• /
• 제8B권6호
• /
• pp.651-656
• /
• 2001

본 논문은 기존의 신경망을 이용한 세선화 방법 중에서 자기 구성 그래프(Self-Organized Graph：SOG) 세선화 기법의 우수한 세선화 결과를 유지하면서, 수행 속도를 향상시키기 위하여 Kohonen Features Map의 새로운 점증 기법을 변형된 SOG에 적용한 개선된 SOG(Improved SOG：$SOG^*$) 세선화 기법을 제안한다. 실험 결과로써 숫자와 문자 모두 기존의 SOG와 같은 우수한 세선화 결과를 나타내며, O((logM)3)의 시간 복잡도를 가지는 속도 향상을 이루었다. 따라서 본 논문에서 제안한 방법은 숫자 또는 문자 인식에 있어 특징 추출의 빠른 전처리 과정으로 사용할 수 있다.

• 한국세라믹학회지
• /
• 제53권5호
• /
• pp.521-528
• /
• 2016

Kinetic Monte Carlo (KMC) and graph searches show that proton conduction limiting barriers and trajectories in $BaZr_{0.875}Y_{0.125}O_3$ are affected by the presence of other protons. At 1000 K, KMC limiting conduction barriers increase from 0.39 eV to 0.45 eV as the proton number is increased. The proton-proton radial distribution begins to rise at $2{\AA}$ and peaks at $4{\AA}$, which is half the distance expected, based on the proton concentration. Density functional theory (DFT) calculations find proton/proton distances of 2.60 and $2.16{\AA}$ in the lowest energy two-proton configurations. A simple average of the limiting barriers for 7-10 step periodic long range paths found via graph theory at 1100 K shows an increase in activation barrier from 0.32 eV to 0.37 eV when a proton is added. Both KMC and graph theory show that protons can affect each other's pathways and raise the overall conduction barriers.

• Nuclear Engineering and Technology
• /
• 제48권2호
• /
• pp.386-403
• /
• 2016

The safety of nuclear power plants is analyzed by a probabilistic risk assessment, and the fault tree analysis is the most widely used method for a risk assessment with the event tree analysis. One of the well-known disadvantages of the fault tree is that drawing a fault tree for a complex system is a very cumbersome task. Thus, several graphical modeling methods have been proposed for the convenient and intuitive modeling of complex systems. In this paper, the reliability graph with general gates (RGGG) method, one of the intuitive graphical modeling methods based on Bayesian networks, is improved for the reliability analyses of dynamic systems that have various operation modes with time. A reliability matrix is proposed and it is explained how to utilize the reliability matrix in the RGGG for various cases of operation mode changes. The proposed RGGG with a reliability matrix provides a convenient and intuitive modeling of various operation modes of complex systems, and can also be utilized with dynamic nodes that analyze the failure sequences of subcomponents. The combinatorial use of a reliability matrix with dynamic nodes is illustrated through an application to a shutdown cooling system in a nuclear power plant.

• 터널과지하공간
• /
• 제18권4호
• /
• pp.243-251
• /
• 2008

최근 환경문제 및 법적규제의 강화로 광산의 개발이 노천채광에서 갱내채광으로 전환됨에 따라 지하채굴 공동의 안정성이 광산의 운영 및 생산성 부분에서 최대 관심사로 대두되고 있다. 따라서 본 연구에서는 갱내채광 설계와 안정성 평가의 입력 자료로 활용하기 위해 지질조사, 불연속면 조사, 실내 암석실험, 암반분류를 수행하였으며, 암반분류 결과를 이용하여 무지보로 안정을 유지할 수 있는 채굴 공동과 광주의 규격을 결정하였다. 또한, 경험적 방법(stability graph, 한계 공동폭 곡선)과 3차원 수치해석을 통하여 지하채굴 공동의 안정성을 평가하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.2211-2232
• /
• 2018

The unstructured and semi-structured big data in social network poses new challenges in query retrieval. This requirement needs to be met by introducing quality retrieval time measures like indexing. Due to the huge volume of data storage, there originate the need for efficient index algorithms to promote query processing. However, conventional algorithms fail to index the huge amount of frequently obtained information in real time and fall short of providing scalable indexing service. In this paper, a new LIndex algorithm, which is a heuristic on Lucene is built on Neo4jHA architecture that holds the social network Big data. LIndex is a flexible and simplified adaptive indexing scheme that ascendancy decomposed shortest paths around term neighbors as basic indexing unit. This newfangled index proves to be effectual in query space pruning of graph database Neo4j, scalable in index construction and deployment. A graph query is processed and optimized beyond the traditional Lucene in a time-based manner to a more efficient path method in LIndex. This advanced algorithm significantly reduces query fetch without compromising the quality of results in time. The experiments are conducted to confirm the efficiency of the proposed query retrieval in Neo4j graph NoSQL database.

• 대한토목학회논문집
• /
• 제38권6호
• /
• pp.831-838
• /
• 2018

본 논문에서는 합류부 배수영향을 받는 지점에서 유량을 산정할 수 있는 방법을 제안하였다. 먼저, 최근 2개의 홍수사상에 대한 HEC-RAS 부정류 모의를 수행하여 모형을 보정하였으며, 관심구간 상하류 수위와 유량과의 관계 그래프를 작성하고 크리깅 보간을 수행함으로써 HPG (Hydraulic Performance Graph)를 작성하였다. 대상 홍수기간 동안 HPG와 상하류 연속 수위 자료를 이용하여 구간 유량을 산정하였고, ADVM 같은 자동유량측정 자료와 비교하여 비교적 잘 일치하는 것을 확인하였다. 본 연구결과는 수위-유량 관계곡선의 이력현상이 큰 배수영향 구간에서 유량을 산정하는데 경제적이고 실용적인 방법을 제공할 것이다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2008년도 추계학술발표대회
• /
• pp.275-278
• /
• 2008

데이터마이닝은 현재 매우 각광 받고 있는 분야다. 연관규칙탐사는 트랜잭션 데이터베이스에서 일정빈도 이상의 패턴을 찾아내는 작업을 말한다. 그중 빈발서브그래프패턴 마이닝은 최근 관심이 늘어나고 있으며, 그 활용도 또한 매우 높다. 그래프마이닝은 아이템셋마이닝보다 훨씬 더 많은 계산을 필요로 한다. 중복을 최소화 하는 방법이 필요하며, 그중 가장 좋은 성능을 보이는 GASTON 알고리즘을 분석한다.