• Journal of KIISE
• /
• v.43 no.3
• /
• pp.304-313
• /
• 2016

We present a novel memory-efficient parallel ray casting algorithm for unstructured grid volume rendering on multi-core CPUs. Our method is based on the Bunyk ray casting algorithm. To solve the high memory overhead problem of the Bunyk algorithm, we allocate a fixed size local buffer for each thread and the local buffers contain information of recently visited faces. The stored information is used by other rays or replaced by other face's information. To improve the utilization of local buffers, we propose an image-plane based ray grouping algorithm that makes ray groups have high coherency. The ray groups are then distributed to computing threads and each thread processes the given groups independently. We also propose a novel hash function that uses the index of faces as keys for calculating the buffer index each face will use to store the information. To see the benefits of our method, we applied it to three unstructured grid datasets with different sizes and measured the performance. We found that our method requires just 6% of the memory space compared with the Bunyk algorithm for storing face information. Also it shows compatible performance with the Bunyk algorithm even though it uses less memory. In addition, our method achieves up to 22% higher performance for a large-scale unstructured grid dataset with less memory than Bunyk algorithm. These results show the robustness and efficiency of our method and it demonstrates that our method is suitable to volume rendering for a large-scale unstructured grid dataset.

• Applied Biological Chemistry
• /
• v.41 no.1
• /
• pp.23-30
• /
• 1998

The cryIB, truncated cryIB$[cryIB({\alpha})]$, cryIA(b), and cytA genes, encoding 135-, 89-, 131-, and 27-kDa proteins, respectively, from Bacillus thuringiensis were cloned into a shuttle vector pBES and expressed in E. coli and Bacillus species. The morphology and solubility in alkaline buffer of the insecticidal crystal proteins were investigated. Transformation of intact cells of E. coli and Bacillus species was achieved by electroporation. High field strength of 11.0 kV/cm and resistance of 129 ohms were required for efficient transformation of E. coli strains and 4.5 kV/cm and 48 ohms for Bacillus species. Strains of recombinant E. coli and Bacillus species produced the insecticidal crystal proteins and accumulated as the same bipyramidal and irregular structures as those of CryIB and IA(b) and CytA of B. thuringiensls, respectively. The insecticidal crystal proteins accumulated in recombinant E. coli wire smaller in size than those in recombinant Bacillus species. The solubility in alkaline buffer of the insecticidal crystal proteins of recombinant E. coli increased gradually as the pH increased, whereas in the case of Bacillus species the solubility increased gradually as the pH increased up to 9 and then the solubility increased greatly up to two times higher than that of E. coli proteins.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.35 no.3
• /
• pp.82-91
• /
• 2007

Rural areas dominate country landscape, where the population is rich in traditional and natural heritage. Dangsan forests and Rural community forests (RCF) have been maintained by local residents for hundreds of years. However, many of these forests have been disturbed, and only small amount of Dangsan forests and the RCF remain due to the efforts of local residents. Recently, the remnants of Dangsan forests and RCF have been regarded as living traditional landscapes representing the cultural and rural background of Korea. But the value of Dangsan forests and the RCFs has not been recognized by many. This study aims to understand the characteristics and management status of Dangsan forests in Sungnam-ri, Wonju. Sungnam-ri has four villages, each of which is bordered by a Dangsan forest at the riparian buffer. Sungnam-ri has been selsected as a site for a rural village development project by the Ministry of Agriculture & Forestry of Korea. Sunghwanglim (the Upper Dangsan forest) is designated as Natural Monument No.93 and entrance is limited in this area. The size of Sunghwanglim is $21,133m^2$, and the major tree species are Kalopanax pictus (Dangsan tree, Divine tree), Pinus densiflora, Abies holophylla, Acer triflorum, Ulmus davidiana, Fraxinus rhynchophylla and Quercus serrata. In total, 124 trees with more than 40 cm in DBH are at this site. As for cultural activities, the Dangsan festival is held on April 8th and September 9th of the lunar calendar at shrines in the forests. Although other Dangsan forests are smaller than Sunghwanglim, they also have similar cultural activities. The landscape of the Dangsan forests have been managed for several hundred years by the local people, and they intend to continue maintaining the Dangsan forests for the purpose of festivals and other cultural activities. The findings in this study suggest that Dangsan forests have the potential for the development of rural villages and for the improvement of cultural and natural landscapes in Korea.

• Applied Microscopy
• /
• v.17 no.1
• /
• pp.83-97
• /
• 1987

In order to discriminate the enteroendocrine cell types in the mucosal epithelium of the normal duodenum of the Korean hedgehog (Erinaceus koreanus). The tissues were fixed in the mixture of 1% paraformaldehyde and 1% glutaraldehyde in phosphate buffer (pH 7.2), and postfixed in 2% osmium tetroxide (phosphate buffer, pH 7.2). They were embedded in Araldite, and the ultrathin sections were made by LKB-V ultratome following the inspection of semithin sections stained with toluidine blue-borax solutions. Ultrathin sections contrasted with uranyl acetate and lead citrate were observed with JEM 100B electron microscope. At least six types of enteroendocrine cells distributed in the mucosal epithelium of the duodenum were identified according to their morphological characteristics mainly based on the size, shape, number and electron density of the secretory granules. Type I cells had moderately developed organelles. The secretory granules were pleomorphic ($370X510nm$), and the granule cores with high electron density were enveloped in limiting membrane and characterized by a narrow halo. Type II cells contained an indented nucleus and well-developed organelles. The secretory granules were round (350 nm) and classified in two kinds by electron density, moderate and high. Both granules were surrounded by limiting membrane and those with high electron density showed often a wide halo. Type III cells had an indented nucleus. The secretory granules with various electron density were round (220 nm) in shape. The granules with high electron density were enveloped in limiting membrane and characterized by a narrow halo, but those with low or moderate electron density had not been observed the limiting membrane. Type IV cells contained an indented nucleus and moderately developed organelles. The secretory granules were round (180 nm) in shape, and the granule cores with high electron density were enveloped in limiting membrane and showed often a wide halo. Type V cells had a large amount of rough endoplasmic reticulum. Secretory granules with low or moderate electron density were round (230 nm) in shape, and surrounded by limiting membrane and showed a narrow halo. Type VI cells contained an oval nucleus and well-developed organelles, especially Golgi complex. The secretory granules with high electron density were round (210 nm) in shape. The granules were enveloped in limiting membrane and showed often a wide halo.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.11a
• /
• pp.379-384
• /
• 2002

개발적인 측면에서 온라인 게임 환경에서의 NPC(Non Playable Character)들은 환경인식능력, 이동능력, 특수 능력 및 아이템의 소유 배분 등을 원활히 하기 위한 능력들을 소유해야 하며, 게임 환경을 인식, 저장하기 위한 데이터구조와 자신만의 독특한 임무(mission)를 달성하기 위한 계획을 갖고 행위를 해야 한다. 이런 의미에서 NPC는 자신만의 고유한 규칙과 행동 패턴, 그리고 목표(Goal)와 이를 실행하기 위한 계획(plan)을 소유하는 에이전트로 인식되어야 할 것이다. 그러나, 기존 게임의 NPC 제어 구조나 구현 방법은 이러한 요구조건에 부합되지 못한 부분이 많았다. C/C++ 같은 컴퓨터 언어들을 이용한 구현은 NPC의 유연성이나, 행위에 많은 문제점이 있었다. 이들 언어의 switch 문법은 NPC의 몇몇 특정 상태를 묘사하고, 그에 대한 행위를 지정하는 방법으로 사용되었으나, 게임 환경이 복잡해지면서, 더욱더 방대한 코드를 만들어야 했고, 해석하는데 많은 어려움을 주었으며, 동일한 NPC에 다른 행동패턴을 적용시키기도 어려웠다. 또한, 대부분의 제어권을 게임 서버 폭에서 도맡아 함으로써, 서버측에 많은 과부하 요인이 되기도 하였다. 이러한 어려움을 제거하기 위해서 게임 스크립트를 사용하기도 하였지만, 그 또한 단순 반복적인 패턴에 사용되거나, 캐릭터의 속성적인 측면만을 기술 할 수 있을 뿐이었다 이러한 어려움을 해소하기 위해서는 NPC들의 작업에 필요한 지식의 계층적 분화를 해야 하고, 현재 상황과 목표 변화에 적합한 반응을 표현할 수 있는 스크립트의 개발이 필수 적이라 할 수 있다 또한 스크립트의 실행도 게임 서버 측이 아닌 클라이언트 측에서 수행됨으로써, 서버에 걸리는 많은 부하를 줄일 수 있어야 할 것이다. 본 논문에서는, 대표적인 반응형 에이전트 시스템인 UMPRS/JAM을 이용하여, 에이전트 기반의 게임 캐릭터 구현 방법론에 대해 알아본다.퓨터 부품조립을 사용해서 Template-based reasoning 예를 보인다 본 방법론은 검색노력을 줄이고, 검색에 있어 Feasibility와 Admissibility를 보장한다.매김할 수 있는 중요한 계기가 될 것이다.재무/비재무적 지표를 고려한 인공신경망기법의 예측적중률이 높은 것으로 나타났다. 즉, 로지스틱회귀 분석의 재무적 지표모형은 훈련, 시험용이 84.45%, 85.10%인 반면, 재무/비재무적 지표모형은 84.45%, 85.08%로서 거의 동일한 예측적중률을 가졌으나 인공신경망기법 분석에서는 재무적 지표모형이 92.23%, 85.10%인 반면, 재무/비재무적 지표모형에서는 91.12%, 88.06%로서 향상된 예측적중률을 나타내었다.ting LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity of computation. Adaptive transversal filter with proposed data recycling buffer algorithm could efficiently reject ISI of channel and increase speed of convergence in avoidance burden of computational complexity in reality when it was experimented having

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.11a
• /
• pp.535-542
• /
• 2002

최근 IT 산업이 급성장하면서 화상 회의, 게임, 채팅 등에서의 아바타(avatar) 제어를 위한 자연스러운 인터페이스 기술이 요구되고 있다. 본 논문에서는 동적 윤곽선 모델(active contour models; snakes)을 이용하여 복잡한 배경이 있는 컬러 CCD 카메라 영상에서 얼굴과 눈, 입, 눈썹, 코 등의 얼굴 요소에 대해 윤곽선을 추출하거나 위치를 파악하는 방법을 제안한다. 일반적으로 스네이크 알고리즘은 잡음에 민감하고 초기 모델을 어떻게 설정하는가에 따라 추출 성능이 크게 좌우되기 때문에 주로 단순한 배경의 영상에서 정면 얼굴의 추출에 사용되어왔다 본 연구에서는 이러한 단점을 파악하기 위해, 먼저 YIQ 색상 모델의 I 성분을 이용한 색상 정보와 차 영상 정보를 사용하여 얼굴의 최소 포함 사각형(minimum enclosing rectangle; MER)을 찾고, 이 얼굴 영역 내에서 기하학적인 위치 정보와 에지 정보를 이용하여 눈, 입, 눈썹, 코의 MER을 설정한다. 그런 다음, 각 요소의 MER 내에서 1차 미분과 2차 미분에 근거한 내부 에너지와 에지에 기반한 영상 에너지를 이용한 스네이크 알고리즘을 적용한다. 이때, 에지 영상에서 얼굴 주변의 복잡한 잡음을 제거하기 위하여 색상 정보 영상과 차 영상에 각각 모폴로지(morphology)의 팽창(dilation) 연산을 적용하고 이들의 AND 결합 영상에 팽창 연산을 다시 적용한 이진 영상을 필터로 사용한다. 총 7명으로부터 양 눈이 보이는 정면 유사 방향의 영상을 20장씩 취득하여 총 140장에 대해 실험한 결과, MER의 오차율은 얼굴, 눈, 입에 대해 각각 6.2%, 11.2%, 9.4%로 나타났다. 또한, 스네이크의 초기 제어점을 얼굴은 44개, 눈은 16개, 입은 24개로 지정하여 MER추출에 성공한 영상에 대해 스네이크 알고리즘을 수행한 결과, 추출된 영역의 오차율은 각각 2.2%, 2.6%, 2.5%로 나타났다.해서 Template-based reasoning 예를 보인다 본 방법론은 검색노력을 줄이고, 검색에 있어 Feasibility와 Admissibility를 보장한다.매김할 수 있는 중요한 계기가 될 것이다.재무/비재무적 지표를 고려한 인공신경망기법의 예측적중률이 높은 것으로 나타났다. 즉, 로지스틱회귀 분석의 재무적 지표모형은 훈련, 시험용이 84.45%, 85.10%인 반면, 재무/비재무적 지표모형은 84.45%, 85.08%로서 거의 동일한 예측적중률을 가졌으나 인공신경망기법 분석에서는 재무적 지표모형이 92.23%, 85.10%인 반면, 재무/비재무적 지표모형에서는 91.12%, 88.06%로서 향상된 예측적중률을 나타내었다.ting LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity of computation. Adaptive transversal filter with proposed data recycling buffer algorithm could efficiently reject ISI of channel and increase speed of convergence in avoidance burden of computational complexity in reality when it was experimented having the same condition of

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.20 no.4
• /
• pp.77-87
• /
• 2017

In this study, we investigated the physical form of planting foundation of the parks and green spaces in the waterside of Korea and classified them into groups showing common features. It was clssified into 7 kinds of parks and green spaces of 27 waterside parks in Korea including landscape, ecology, art, shields, site boundaries, windbreaks, and soundproofing. As a result, the study was carried out on the detailed type and size estimation through the sampling survey of planting foundation of landscape and ecological type mounding which can be statistically analyzed. Landscape and ecological mounding have the characteristics of securing the ecological stability of the waterside planting areas and the diversity of planting landscape. It is possible to create a green landscape through various terrain changes such as enclosing, focusing, and panoramic view. The physical characteristics of ecological and landscape type mounding can be expressed as height, width, and length And physical data can appear in various forms and sizes depending on the purpose and function of the buffer effect of the land use in the waterside planting areas, the landscape creation, the ecological buffer. In this study, the range of the physical scale for landscape and ecological mounding of waterside parks and green spaces was calculated. The range of the mounding height was analyzed to be less than 1.25m and more than 1.25m and the average height was 0.74~1.08m and 1.75~2.75m respectively. In addition, the range of width of mounding was less than 6.13m, 6.13~17.5m, and more than 17.5m, and the average width of each was 3.45~4.95m, 7.05~10.85m and 31.54~51.54m respectively. The range for the length of mounding was less than 50m, 50~500m, and more than 500m. The mean length of each mounding was 34.0m, 116.3m and 955.8m. It is difficult to distinguish the difference between the waterside planting areas and the urban greenery in the purpose and function of landscape and ecological mounding. However, considering the average distance of 60m from the waterside and the average height of 1.26m, we can conclud that opened planting foundation is prefered to high mounding designs in waterside planting areas. It is expected that the results presented for the improvement of the logical and spatial value of the waterside parks and green areas planting foundation design can be served as the basic data helpful for practical application in landscape architecture planning and design.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.1
• /
• pp.100-108
• /
• 2003

By choosing Multicast for transmission of educational contents in the Remote Educational System, we can reduce the server load and increase network bandwidth utilization. We design and implement Multicast Middleware for the Remote Educational System in this paper. There are three characteristics in this Multicast Middleware: 1) Through Centralized Multicast Group Management for passive members, it allows a host to make multicast group, which is composed of receivers, called Group Member and who are chosen by the host, called group Maker. Because, all groups are created by the Group Maker in Centralized Group Management, Group Member's join action will be passive 2) Maintenance and recovery of multicast group information in order to restore from exception and crash; the maintenance and recovery mechanism of Group Maker is distinct from that of Group Member. 3) The mechanism which enables to transmit large size multimedia data through multicasting and remove additional copy operation through shared buffer. Fragmentation/de-fragmentation for large data delivery results in additional copy operation in user level. But by using user level shared buffer, it can be done without user Bevel copy operation. By applying to Remote Educational environment which consists of 30 PCs and Fast Ethernet, we can examine the efficiency of this middleware, which can transmit 18frames/sec movie which resolution 320 $\times$ 120 pixels, 128Kbps encoded sound data and some text data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.2010-2024
• /
• 1998

In video coding, it is important to improve the average picture quality as well as to maintain cosistent picture quality between consecutive pictures. In this paper, we propose a distortion-rate estimation method for MPEG-2 video and a forward rate control method, using the proposed estimation result, to be able to obtain the improved and consistent picture quality of CBR (Constant Bit Rate) encoded MPEG-2 video. The proposed distortion-rate estimation enable us to predict the distortion and the bits generated from an encoded picture at a given quantization step size and vice versa. The most attactive features of proposed distortion-rate estimation are its accuracy and low computational complexity enough to be applied to the practical video coding. In addition, the proposed rate control first determined a quantization parameter per frame by following procedure: distortion-rate estimation, target bit allocation, distortion constraint and VBV(Video Buffer Verification) constraint. And then this quantization parameter is applied to the encoding so that improved and consisten picture quality can be obtained. Furthermore the proposed rate control method can solve the error propagation problem caused by scene change or anchor picture degradation by using the B-picture skipping and the guarantee of the minimum bit allocation for the anchor picture. Experimental results, comparing the proposed forward rate control method with TM5 method, show that the proposed method makes more improed and consistent picture quality than TM5.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.149-158
• /
• 2005

This paper proposes a congestion avoidance algorithm which provides stable throughput and transmission rate regardless of buffer size by limiting the TCP congestion window in fixed bandwidth networks. Additive Increase, Multiplicative Decrease (AIMD) is the most commonly used congestion control algorithm. But, the AIMD-based TCP congestion control method causes unnecessary packet losses and retransmissions from the congestion window increment for available bandwidth verification when used in fixed bandwidth networks. In addition, the saw tooth variation of TCP throughput is inappropriate to be adopted for the applications that require low bandwidth variation. We present an algorithm in which congestion window can be limited under appropriate circumstances to avoid congestion losses while still addressing fairness issues. The maximum congestion window is determined from delay information to avoid queueing at the bottleneck node, hence stabilizes the throughput and the transmission rate of the connection without buffer and window control process. Simulations have performed to verify compatibility, steady state throughput, steady state packet loss count, and the variance of congestion window. The proposed algorithm can be easily adopted to the sender and is easy to deploy avoiding changes in network routers and user programs. The proposed algorithm can be applied to enhance the performance of the high-speed access network which is one of the fixed bandwidth networks.