• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.175-187
• /
• 2006

The data cube is an aggregation operator that computes group-bys for all possible combination of dimension attributes. %on the number of the dimension attributes is n, a data cube computes $2^n$ group-bys. Each group-by in a data cube is called a cuboid. Data cubes are often precomputed and stored as materialized views in data warehouses. These data cubes need to be updated when source relation change. The incremental maintenance of a data cube is to compute and propagate only its changes. To compute the change of a data cube of $2^n$ cuboids, previous works compute a delta cube that has the same number of cuboids as the original data cube. Thus, as the number of dimension attributes increases, the cost of computing a delta cube increases significantly. Each cuboid in a delta cube is called a delta cuboid. In this paper. we propose an incremental cube maintenance method that can maintain a data cube by using only $_nC_{{\lceil}n/2{\rceil}}$ delta cuboids. As a result, the cost of computing a delta cube is substantially reduced. Through various experiments, we show the performance advantages of our method over previous methods.

• Proceedings of the Korean Institute of Industrial Safety Conference
• /
• 2004.10a
• /
• pp.409-414
• /
• 2004

• Proceedings of the KIEE Conference
• /
• 2004.07c
• /
• pp.1872-1873
• /
• 2004

보이드, 이물, 돌기등 고부자 절연체 내의 결함은 이곳에 전계가 가해질 때, 국부적 전계집중을 유발하며, 절연체 내의 미소 방전을 일으킨다. 이 때 발생한 미소 방전에 의해 보이드 표면의 고분자 물질은 기계적, 화학적 열화를 일으키며, 이에 따라 전기적 트리를 형성하게 된다. 이러한 트리는 결국 절연체의 절연파괴로 진전되므로, 고분자 물질을 절연물로 사용하는 전력기기의 경우에는 신뢰성에 큰 문제를 유발한다. 따라서, 이러한 방전(부분방전)이 일어날 때 생기는 전기적 신호를 검출하여, 절연물의 신회성을 평가하는 것은 매우 중요하다. 본 논문에서는 이러한 미소방전이 일으키는 방전의 파형이 트리의 진전에 따라 어떻게 변화하는지에 대해 연구하였다.

• Proceedings of the KIEE Conference
• /
• 2005.07c
• /
• pp.1896-1897
• /
• 2005

보이드, 이물, 돌기 둥 고분자 절연체 내의 결함은 이곳에 전계가 가해질 때, 국부적 전계집중을 유발하며, 절연체 내의 미소 방전을 일으킨다. 이 때 발생한 미소 방전에 의해 보이드 표면의 고분자 물질은 기계적, 화학적 열화를 일으키며, 이에 따라 전기적 트리를 형성하게 된다. 이러한 트리는 결국 절연체의 절연파괴로 진전되므로, 고분자 물질을 절연물로 사용하는 전력기기의 경우에는 신뢰성에 큰 문제를 유발한다. 따라서, 이러한 방전(부분방전)이 일어날 때 생기는 전기적 신호를 검출하여, 절연물의 신회성을 평가하는 것은 매우 중요하다. 이러한 부분방전은 IEC둥 국제기술기준에 그 제한 값이 정하여져 있으며, 본 논문에서는 이러한 값을 수학적으로 평가하는 방법에 대해 연구하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.59-67
• /
• 2009

In wireless sensor networks (WSNs), geographic greedy forwarding fails to move a packet further towards its destination if the sender does not have any closer node to the destination in its one hop transmission region. In this paper, we propose a enhanced geographic routing, called CGR(Cost based Geographic Routing) for efficient data delivery against void problem environment. CGR first establishes Shadow Bound Region and then accomplishes Renewing Cost Function Algorithm for effective greedy forwarding data delivery. Our simulation results show significant improvements compared with existing schemes in terms of routing path length, success delivery ratio and energy efficiency.

• Proceedings of the Materials Research Society of Korea Conference
• /
• 2003.11a
• /
• pp.159-159
• /
• 2003

• Composites Research
• /
• v.16 no.6
• /
• pp.10-15
• /
• 2003

In RTM process, the content of microvoids can be critical due to the fact that the presence of microvoids degrades mechanical properties on the fabricated composite parts. The present paper proposes an experimental method of observation in void formation and transport. VARTM processes are performed under observation with a digital video camera and then the microvoid formation in the flow front and transport are videotaped and observed both in channels and tows. The obtained data are used in the mathematical model in order to determine the model constants. Experimental results and expected results from the mathematical model show a good agreement with each other.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.2
• /
• pp.195-200
• /
• 2004

Computer games use an intelligent method called flocking for boids' group behavioral modeling. Flocking can naturally model group behavioral patterns of unpredictable forms such as birds and fishes using some computer resource. In this paper, we implemented an ecosystem which is composed of predator and prey for group behavioral modeling of real underwater ecosystem. Also fuzzy logic is applied to implement instinct desire of ecosystem elements. As the result, we confirmed that the model can overcome breakdown of ecosystem and model naturally ecosystem behavior.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2006.05a
• /
• pp.35-40
• /
• 2006

최근 전기에너지의 사용비율은 해가 거듭될수록 증가되고 있으며, 경량화 소형화로 인한 전력기기의 스트레스가 증가되었다. 또한 고압송전으로 인해 전기적 사고는 대형사고를 유발하므로 전력기기의 수명예측은 매우 중요한 과제이다. 이에 본 논문에서는 XLPE 절연체의 보이드 유무에 따른 부분방전 패턴을 K-means 분포통계함수를 이용하여 부분방전 패턴의 그룹화를 시도하였다. 또한 전하량과 방전빈도수의 분포를 비교하기 위해 위상-전하랑 및 위상-전하량-빈도수에 의한 그룹의 centroid 이동 변화에 대하여 조사하였다. 그 결과 보이드가 존재하는 경우 전하량의 높은 점에서 중심점을 형성하였고, 방전발생위상의 차이는 크지 않았다. 또한 위상-전하량의 클러스터보다 위상-전하량-빈도수의 클러스터에서 객체간 편차가 더 커짐을 발견하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.10
• /
• pp.29-39
• /
• 2008

Greedy routing which is easy to apply to geographic wireless sensor networks is frequently used. Greedy routing works well in dense networks whereas in sparse networks it may fail. When greedy routing fails, it needs a recovery algorithm to get out of the communication void. However, additional recovery algorithm causes problems that increase both the amount of packet transmission and energy consumption. Communication void is a condition where all neighbor nodes are further away from the destination than the node currently holding a packet and it therefore cannot forward a packet using greedy forwarding. Therefore we propose a VODUA(Virtually Ordered Distance Upgrade Algorithm) as a novel idea to improve and solve the problem of void. In VODUA, nodes exchange routing graphs that indicate information of connection among the nodes and if there exist a stuck node that cannot forward packets, it is terminated using Distance Cost(DC). In this study, we indicate that packets reach successfully their destination while avoiding void through upgrading of DC. We designed the VODUA algorithm to find valid routes through faster delivery and less energy consumption without requirement for an additional recovery algorithm. Moreover, by using VODUA, a network can be adapted rapidly to node's failure or topological change. This is because the algorithm utilizes information of single hop instead of topological information of entire network. Simulation results show that VODUA can deliver packets from source node to destination with shorter time and less hops than other pre-existing algorithms like GPSR and DUA.