• 한국전산유체공학회:학술대회논문집
• /
• 2007.04a
• /
• pp.103-107
• /
• 2007

Computational Fluid Dynamics (CFD in short) approach is now playing an important role in the engineering process recently. Generating proper grid system for the region of interest in time is prerequisite for the efficient numerical calculation of flow physics using CFD approach. Grid generation is, however, usually considered as a major obstacle for a routine and successful application of numerical approaches in the engineering process. CFD approach based on the unstructured grid system is gaining popularity due to its simplicity and efficiency for generating grid system compared to the structured grid approaches. In this paper an automated triangular surface grid generation using CAD surface data is proposed According to the present method, the CAD surface data imported in the STL format is processed to identify feature edges defining the topology and geometry of the surface shape first. When the feature edges are identified, node points along the edges are distributed. The initial fronts which connect those feature edge nodes are constructed and then they are advanced along the CAD surface data inward until the surface is fully covered by triangular surface grid cells using Advancing Front Method. It is found that this approach can be implemented in an automated way successfully saving man-hours and reducing human-errors in generating triangular surface grid system.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.92-95
• /
• 1991

Constant false alarm rate(CFAR) processors are useful for detecting radar targets in background for which all parameters in the statistical distribution are not known and may be nonstationary. The well known "cell averging" (CA) CFAR processor is known to yield best performance in homogeneous case, but exhibits severe performance in the presence of an interfering target in the reference window or/and in the region of clutter edges. The "order statistics"(OS) CFAR processor is known to have a good performance above two nonhomogeneous cases. The modified OS-CFAR processor, known as "trimmed mean"(TM) CFAR processor performs somewhat better than the OS-CFAR processor by judiciously trimming the ordered samples. This paper proposes and analyzes the performance of a new CFAR processor called the "maximum trimmed mean"(MX-TM) CFAR processor combining the "greatest of"(GO) CFAR and TM-CFAR processors. The MAX operation is included to control false alarms at clutter edges. Our analyses show that the proposed CFAR processor has similar performance TM- and OS-CFAR processors in homogeneous case and in the precence of interfering targets, but can control the false rate in clutter edges. Simulation results are presented to demonstrate the qualitative effects of various CFAR processors in nonhomogeneous clutter environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.396-413
• /
• 2017

Dynamically checking the integrity of software at run-time is always a hot and difficult spot for trusted computing. Control-flow integrity is a basic and important safety property of software integrity. Many classic and emerging security attacks who introduce illegal control-flow to applications can cause unpredictable behaviors of computer-based systems. In this paper, we present a software-based approach to checking violation of control flow integrity at run-time. This paper proposes a high-performance and low-overhead software control flow checking solution, control flow checking at virtual edges (CFCVE). CFCVE assigns a unique signature to each basic block and then inserts a virtual vertex into each edge at compile time. This together with insertion of signature updating instructions and checking instructions into corresponding vertexes and virtual vertexes. Control flow faults can be detected by comparing the run-time signature with the saved one at compile time. Our experimental results show that CFCVE incurs only 10.61% performance overhead on average for several C benchmark programs and the average undetected error rate is only 9.29%. Compared with previous techniques, CFCVE has the characteristics of both high fault coverage and low memory and performance overhead.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2011.02a
• /
• pp.171-171
• /
• 2011

Co and Fe doped multi-wall carbon nano-tubes (MWCNTs) synthesized by microwave plasma enhanced chemical vapor deposition (PECVD) technique are investigated with synchrotron radiations at Pohang Light Source (PAL) and European Synchrotron Radiation Facility (ESRF). Near edge x-ray absorption spectroscopy (NEXAFS) measurement at C K, Co $L_{3,2}$ and Fe $L_{3,2}$-edges, and x-ray magnetic circular dichroism (XMCD) at Co and Fe $L_{3,2}$-edges have been carried at 7B1 XAS KIST and 2A MS beamline, respectively, to understand the electronic structure and responsible magnetic interactions at room temperature. X-ray absorption spectroscopy (XAS) at C K-edge shows significant p-bonding and Co and Fe L-edges proves the presence of $Co^{2+}$ and $Fe^{2+}$ in octahedral symmetry. Co and Fe doped MWCNTs show good XMCD spectra at 300K. The effect on the magnetism is also studied through swift heavy ion (SHI) radiations and magnetism is found enhanced and change in the electronic structure in Co-CNTs is investigated.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.2
• /
• pp.91-97
• /
• 2007

Points of sharp variations in signals are the most important factors when analyzing the features of signals. And in the image, edges include diverse information such as the locations, shape and material. There have been a variety of researches on edge detections, among them, methods based on convolution in the spatial domain have been most popular. However at the early stage of the method, if the noise and many kinds of edges exist in the image, it is not easy to separate edges selectively from corrupted images by noise. In meantime, the wavelet transform for multiscale edge detection is being applied widely to analyze the properties of images in various fields. In this paper, we suggest a robust wavelet-based method, which selectively detects line-edge elements from images in the presence of noise.

• Proceeding of EDISON Challenge
• /
• 2015.03a
• /
• pp.324-329
• /
• 2015

First-principles investigations on the hybrid one dementional hexagonal hybrboron-nitride nano ribbons (BNNRs) with a armchair graphene nano-ribbons(AGRNRs), are presented. Electronics properties of the mixed armchair BNC nano-ribbon (BNCNRs) structure show control of a band gap on all cases at the special K-point. And we have studied, the band gap is direct in all cases. The band gap of mixed ABNCNRs could be divided into three groups (${\Delta}3p$, ${\Delta}3p+1$ and ${\Delta}3p+2$) and decrease with the increase of the width. Also these results show similar to the AGNRs case. Different from the band gap value ordering of AGNRs (${\Delta}3p+1$ > ${\Delta}3p$ > ${\Delta}3p+2$), the ordering of ABNCNRs is ${\Delta}3p$ > ${\Delta}3p+1$ > ${\Delta}3p+2$. The discrepancy may come from the differences between the edges of AGRNRs and the boundaries of hybrid BNCNRs. In addition, the bandgap of ABNCNRs are much smaller than those of the corresponding AGNRs. Our results show that the origin of band gap for BNCNRs with armchair shaped edges arises from both quantum confinement effect of the edges. These results similar to thecase of AGNRs. These properties of hybrid BN/C nano-ribbon structure may offer suitable bandgap to develop nnanoscale electronics and solar cell beyond individual GNRs and BNNRs.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.212-215
• /
• 2008

In this paper, we develop the optimal path planning algorithm using the improved Dijkstra algorithm and the particle swarm optimization. To get the optimal path, at first we construct the MAKLINK on the world environment and then make a graph associated with the MAKLINK. The MAKLINK is a set of edges which consist of the convex set. Some of the edges come from the edges of the obstacles. From the graph, we obtain the Dijkstra path between the starting point and the destination point. From the optimal path, we search the improved Dijkstra path using the graph. Finally, applying the particle swarm optimization to the improved Dijkstra path, we obtain the optimal path for the mobile robot. It turns out that the proposed method has better performance than the result in [1] through the experiment.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.74-86
• /
• 1994

In this paper a hierarchical stereo matching algorithm to obtain the disparity in wavelet transformed domain by using locally adaptive window and weights is proposed. The pyramidal structure obtained by wavelet transform is used to solve the loss of information which the conventional Gaussian or Laplacian pyramid have. The wavelet transformed images are decomposed into the blurred image the horizontal edges the vertical edges and the diagonal edges. The similarity between each wavelet channel of left and right image determines the relative importance of each primitive and make the algorithm perform the area-based and feature-based matching adaptively. The wavelet transform can extract the features that have the dense resolution as well as can avoid the duplication or loss of information. Meanwhile the variable window that needs to obtain precise and stable estimation of correspondense is decided adaptively from the disparities estimated in coarse resolution and LL(low-low) channel of wavelet transformed stereo image. Also a new relaxation algorithm that can reduce the false match without the blurring of the disparity edge is proposed. The experimental results for various images show that the proposed algorithm has good perfpormance even if the images used in experiments have the unfavorable conditions.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.3
• /
• pp.316-321
• /
• 2007

We propose a quatitative annotation method for edges in Bayesian networks using given sets of condition-specific data. Bayesian network model has been used widely in various fields to infer probabilistic dependency relationships between entities in target systems. Besides the need for identifying dependency relationships, the annotation of edges in Bayesian networks is required to analyze the meaning of learned Bayesian networks. We assume the training data is composed of several condition-specific data sets. The contribution of each condition-specific data set to each edge in the learned Bayesian network is measured using the ratio of likelihoods between network structures of including and missing the specific edge. The proposed method can be a good approach to make quantitative annotation for learned Bayesian network structures while previous annotation approaches only give qualitative one.

• Journal of computational fluids engineering
• /
• v.12 no.4
• /
• pp.68-73
• /
• 2007

Computational Fluid Dynamics (CFD) approach is now playing an important role in the engineering process in these days. Generating proper grid system in time for the region of interest is prerequisite for the efficient numerical calculation of flow physics using CFD approach. Grid generation is, however, usually considered as a major obstacle for a routine and successful application of numerical approaches in the engineering process. CFD approach based on the unstructured grid system is gaining popularity due to its simplicity and efficiency for generating grid system compared to the structured grid approaches, especially for complex geometries. In this paper an automated triangular surface grid generation using CAD(Computer Aided Design) surface data is proposed. According to the present method, the CAD surface data imported in the STL(Stereo-lithography) format is processed to identify feature edges defining the topology and geometry of the surface shape first. When the feature edges are identified, node points along the edges are distributed. The initial fronts which connect those feature edge nodes are constructed and then they are advanced along the CAD surface data inward until the surface is fully covered by triangular surface grid cells using Advancing Front Method. It is found that this approach can be implemented in an automated way successfully saving man-hours and reducing human-errors in generating triangular surface grid system.