• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.10
• /
• pp.397-406
• /
• 2014

In order to answer the questions successfully on behalf of the human in DeepQA environments such as Jeopardy! of the American quiz show, the computer is required to have the capability of fast temporal and spatial reasoning on a large-scale commonsense knowledge base. In this paper, we present a scalable spatial reasoning algorithm for deriving efficiently new directional and topological relations using the MapReduce framework, one of well-known parallel distributed computing environments. The proposed reasoning algorithm assumes as input a large-scale spatial knowledge base including CSD-9 directional relations and RCC-8 topological relations. To infer new directional and topological relations from the given spatial knowledge base, it performs the cross-consistency checks as well as the path-consistency checks on the knowledge base. To maximize the parallelism of reasoning computations according to the principle of the MapReduce framework, we design the algorithm to partition effectively the large knowledge base into smaller ones and distribute them over multiple computing nodes at the map phase. And then, at the reduce phase, the algorithm infers the new knowledge from distributed spatial knowledge bases. Through experiments performed on the sample knowledge base with the MapReduce-based implementation of our algorithm, we proved the high performance of our large-scale spatial reasoner.

• The Bulletin of The Korean Astronomical Society
• /
• v.38 no.2
• /
• pp.56.2-56.2
• /
• 2013

We study the three-dimensional genus topology of large-scale structure using the CMASS Data Release 11 sample of the SDSS-III Baryon Oscillation Spectroscopic Survey (BOSS). The CMASS sample yields a genus curve that is characteristic of one produced by Gaussian random-phase initial conditions. The data thus supports the standard model of inflation where random quantum fluctuations in the early universe produced Gaussian random-phase initial conditions. Modest deviations in the observed genus from random phase are as expected from the nonlinear evolution of structure. We construct mock SDSS CMASS surveys along the past light cone from the Horizon Run 3 (HR3) N-body simulations, where gravitationally bound dark matter subhalos are identified as the sites of galaxy formation. We study the genus topology of the HR3 mock surveys with the same geometry and sampling density as the observational sample, and the observed genus topology to be consistent with LCDM as simulated by the HR3 mock samples.

• Journal of Powder Materials
• /
• v.18 no.2
• /
• pp.172-175
• /
• 2011

We developed a 3D simulation model of microstructure evolution of vertically aligned porous structure due to phase separation during film growth. The model proves its validity by reproducing the results of previous researches which are topological features of the microstructures and effects of varied processing parameters. The model will be extended by including bulk diffusion effect and elastic effect.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.3
• /
• pp.523-530
• /
• 2014

In this article, we deal with the notion of ­${\Omega}$-limit sets in dynamical systems. We show that the ${\Omega}$­-limit set of a compact subset of a phase space is quasi-attracting.

• Proceedings of the Optical Society of Korea Conference
• /
• 2003.07a
• /
• pp.160-161
• /
• 2003

위상특이점이라고도 불리는 광 보텍스(optical vortex)를 포함한 빔은 파면의 특이성 때문에 많은 관심을 끌어왔다. 위상을 정의할 수 없는 위상특이점을 따라서는 빔의 동일위상파면이 소용돌이 형태를 가진다. 그 소용돌이 정도는 위상전하(topological charge) 라는 양으로 특징지을 수 있다. 광 보텍스는 선형 및 비선형적 특성에 대해 많은 연구가 이루어져왔다. 레이저 공진기를 변형하거나, 홀로그램이나 위상마스크에 레이저를 조사하여 보텍스를 발생시키는 방법 등의 여러 방법이 알려져 있다. (중략)

• Proceedings of the KOSOMBE Conference
• /
• v.1994 no.05
• /
• pp.69-71
• /
• 1994

1Hz에서 20Hz까지의 단속 주파수를 지닌 청각자극을 가해 얻은 EEG신호에서 자극에 따른 신호의 정성적이고 정량적인 특성을 카오스 분석방법을 통해 밝혔다. 먼저, 뇌전위 신호에 전반적으로 나타나는 일반적인 카오스 특징(fractal mechanism, 1/f frequency spectrum, positive lyapunov exponent등등)이 확인되어졌다. 유발전위에 대해서는 자극의 주파수에 따른 주기 배증을 경유한 카오스로 가는 길(route to chaos)과 2차원 pseudo-phase portrait의 뿌앙까레 단면에서의 기하학적 모양(topological property)의 변화가 관찰되어졌고, 자발전위가 포함된 유발전위에 대해서는 적절한 bases를 지닌 3차원 phase space에서 기이한 끌개(chaotic attractor)가, 유발전위의 정보를 지닌채 보여졌다. 끝으로 자극 주파수(단속 주파수와 반송 주파수) 변화와 측정이 이루어진 머리표면에서의 공간적 위치에 따른, lyapunov exponent값 변화가 의미있게 해석되어졌다. 이 결과는 무질서하게 보이는 뇌전위신호에서 주어진 청각자극에 대한 정보를 얻는 새로운 방법을 제시하게 된다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.6
• /
• pp.24-35
• /
• 2002

The wavelet transform is combined with the boundary element method (BEM), to solve efficiently the Maxwell's equation and the proposed method is applied to the electromagnetic problem for the analysis of topological effects of phase-shifting masks. The accuracy of the module developed was verified by comparison with both analytic solutions and published results. In addition, it was found that the boundary element method in combination with the wavelet matrix transform would be more efficient than the conventional methods based on the BEM in views of the calculation speed and the usage of computer memory.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.5
• /
• pp.1769-1777
• /
• 2018

This paper proposes a method for optimal placement of Phasor Measurement Units (PMUs) considering system configuration and its attributes during the planning phase of PMU deployment. Each bus of the system is assessed on four diverse attributes; namely, redundancy of measurements, rotor angle and frequency monitoring of generator buses, reactive power deficiency, and maximum loading limit under transmission line outage contingency, and a consolidated 'degree of criticality' is determined using Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS). The major contribution of the proposed work is the development of modified objective function which incorporates values of the degree of criticality of buses. The problem is formulated as maximization of the aggregate degree of criticality of the system. The resultant PMU configuration extends complete observability of the system and majority of the PMUs are located on critical buses. As budgetary restrictions on utilities may not allow installation PMUs even at optimal locations in a single phase, multi-horizon deployment of PMUs is also addressed. The proposed approach is tested on IEEE 14-bus, IEEE 30-bus, New England (NE) 39-bus, IEEE 57-bus and IEEE 118-bus systems and compared with some existing methods.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.4
• /
• pp.28-36
• /
• 2009

Sequence-Pair(SP) model represents the topological relation between modules. In general, SP model based floorplanners search solutions using Simulated-Annealing(SA) algorithm. Several SA based floorplanning techniques using SP model have been published. To improve the performance of those techniques they tried to improve the speed for evaluation function for SP model, to find better scheduling methods and perturb functions for SA. In this paper we propose a two phase SA based algorithm. In the first phase, white space between modules is reduced by applying compaction technique to the floorplan obtained by an SP. From the compacted floorplan, the corresponding SP is determined. Solution space has been searched by changing the SP in the SA framework. When solutions converge to some threshold value, the first phase of the SA based search stops. Then using the typical SA based algorithm, ie, without using the compaction technique, the second phase of our algorithm continues to find optimal solutions. Experimental results with MCNC benchmark circuits show that how the proposed technique affects to the procedure for SA based floorplainning algorithm and that the results obtained by our technique is better than those obtained by existing SA-based algorithms.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.367-376
• /
• 2003

This study deals with the DCMST (Delay constrained Capacitated Minimum Spanning Tree) problem applied in the topological design of local networks or finding several communication paths from root node. While the traditional CMST problem has only the traffic capacity constraint served by a port of root node, the DCMST problem has the additional mean delay constraint of network. The DCMST problem consists of finding a set of spanning trees to link end-nodes to the root node satisfying the traffic requirements at end-nodes and the required mean delay of network. The objective function of problem is to minimize the total link cost. This paper presents two-phased heuristic algorithm, which consists of node exchange, and node shift algorithm based on the trade-off criterions, and mean delay algorithm. Actual computational experience and performance analysis show that the proposed algorithm can produce better solution than the existing algorithm for the CMST problem to consider the mean delay constraint in terms of cost.