• Title/Summary/Keyword: Memory improvement

Search Result 698, Processing Time 0.029 seconds

Fast Hilbert R-tree Bulk-loading Scheme using GPGPU (GPGPU를 이용한 Hilbert R-tree 벌크로딩 고속화 기법)

  • Yang, Sidong;Choi, Wonik
    • Journal of KIISE
    • /
    • v.41 no.10
    • /
    • pp.792-798
    • /
    • 2014
  • In spatial databases, R-tree is one of the most widely used indexing structures and many variants have been proposed for its performance improvement. Among these variants, Hilbert R-tree is a representative method using Hilbert curve to process large amounts of data without high cost split techniques to construct the R-tree. This Hilbert R-tree, however, is hardly applicable to large-scale applications in practice mainly due to high pre-processing costs and slow bulk-load time. To overcome the limitations of Hilbert R-tree, we propose a novel approach for parallelizing Hilbert mapping and thus accelerating bulk-loading of Hilbert R-tree on GPU memory. Hilbert R-tree based on GPU improves bulk-loading performance by applying the inversed-cell method and exploiting parallelism for packing the R-tree structure. Our experimental results show that the proposed scheme is up to 45 times faster compared to the traditional CPU-based bulk-loading schemes.

An Algorithm for Switching from Arithmetic to Boolean Masking with Low Memory (저메모리 기반의 산술 마스킹에서 불 마스킹 변환 알고리즘)

  • Kim, HanBit;Kim, HeeSeok;Kim, TaeWon;Hong, SeokHie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.1
    • /
    • pp.5-15
    • /
    • 2016
  • Power analysis attacks are techniques to analyze power signals to find out the secrets when cryptographic algorithm is performed. One of the most famous countermeasure against power analysis attacks is masking methods. Masking types are largely classified into two types which are boolean masking and arithmetic masking. For the cryptographic algorithm to be used with boolean and arithmetic masking at the same time, the converting algorithm can switch between boolean and arithmetic masking. In this paper we propose an algorithm for switching from boolean to arithmetic masking using storage size at less cost than ones. The proposed algorithm is configured to convert using the look-up table without the least significant bit(LSB), because of equal the bit of boolean and arithmetic masking. This makes it possible to design a converting algorithm compared to the previous algorithm at a lower cost without sacrificing performance. In addition, by applying the technique at the LEA it showed up to 26 percent performance improvement over existing techniques.

Design and Implementation of Buffer Management Method for Enhancing Performance of Open GIS Components (개방형 GIS 컴포넌트의 성능 개선을 위한 버퍼 관리 방법의 설계 및 구현)

  • Cho, Dae-Soo;Min, Kyoung-Wook
    • The KIPS Transactions:PartD
    • /
    • v.11D no.1
    • /
    • pp.51-60
    • /
    • 2004
  • In open GIS environment, a GIS client can access spatial data in different types of GIS sowers with the same Interfaces. This means that open GIS components software ensures the interoperability throughout the heterogeneous GIS servers. The user response time, however, tends to be increased, if the client makes use of the standard interfaces for data accesses that can ensure interoperability. This is because the format of spatial data accessed from a specific GIS server must be transformed into common format, such as Rowset in OLE/DB, which is compatible with the standard interfaces. In this paper, we develop efficient techniques for data buffering in GIS client to reduce the response time. We design the buffer management method, which Is based on the space partitioning, and Integrate buffer management components into MapBase, an open GIS component software. And we also, show that buffer management proposed in this paper yields significant performance improvement in GIS client.

Music Therapy Interventions for Mathematical Development of Young Children with Special Needs: A Review of Literature (지적장애영유아의 수학개념 발달을 위한 음악치료 활동에 대한 이론적 고찰)

  • Kwak, Eunmi Emily
    • Journal of Music and Human Behavior
    • /
    • v.7 no.1
    • /
    • pp.1-15
    • /
    • 2010
  • The purpose of this study is to inquire into the theoretical background of music therapy interventions for the improvement of mathematical concepts among young children with special needs. The researcher provides a basis of theoretical background about musical activities as an effective tool for young children to understand and promote their mathematical concepts, and the necessity of practical application in the field of mathematics education is suggested. Music, as a multi-sensory modality, has an ability to hold and maintain one's attention, and can be used as a memory aid and a powerful and effective motivator and reinforcer for young children. Therefore, musical activities can be used to facilitate mathematical concepts in the field of education for young children. Possible musical activities for promoting mathematical development are suggested, and the necessity for developing various musical activities is discussed.

  • PDF

Massive 3D Point Cloud Visualization by Generating Artificial Center Points from Multi-Resolution Cube Grid Structure (다단계 정육면체 격자 기반의 가상점 생성을 통한 대용량 3D point cloud 가시화)

  • Yang, Seung-Chan;Han, Soo Hee;Heo, Joon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.4
    • /
    • pp.335-342
    • /
    • 2012
  • 3D point cloud is widely used in Architecture, Civil Engineering, Medical, Computer Graphics, and many other fields. Due to the improvement of 3D laser scanner, a massive 3D point cloud whose gigantic file size is bigger than computer's memory requires efficient preprocessing and visualization. We suggest a data structure to solve the problem; a 3D point cloud is gradually subdivided by arbitrary-sized cube grids structure and corresponding point cloud subsets generated by the center of each grid cell are achieved while preprocessing. A massive 3D point cloud file is tested through two algorithms: QSplat and ours. Our algorithm, grid-based, showed slower speed in preprocessing but performed faster rendering speed comparing to QSplat. Also our algorithm is further designed to editing or segmentation using the original coordinates of 3D point cloud.

Relation Based Bayesian Network for NBNN

  • Sun, Mingyang;Lee, YoonSeok;Yoon, Sung-eui
    • Journal of Computing Science and Engineering
    • /
    • v.9 no.4
    • /
    • pp.204-213
    • /
    • 2015
  • Under the conditional independence assumption among local features, the Naive Bayes Nearest Neighbor (NBNN) classifier has been recently proposed and performs classification without any training or quantization phases. While the original NBNN shows high classification accuracy without adopting an explicit training phase, the conditional independence among local features is against the compositionality of objects indicating that different, but related parts of an object appear together. As a result, the assumption of the conditional independence weakens the accuracy of classification techniques based on NBNN. In this work, we look into this issue, and propose a novel Bayesian network for an NBNN based classification to consider the conditional dependence among features. To achieve our goal, we extract a high-level feature and its corresponding, multiple low-level features for each image patch. We then represent them based on a simple, two-level layered Bayesian network, and design its classification function considering our Bayesian network. To achieve low memory requirement and fast query-time performance, we further optimize our representation and classification function, named relation-based Bayesian network, by considering and representing the relationship between a high-level feature and its low-level features into a compact relation vector, whose dimensionality is the same as the number of low-level features, e.g., four elements in our tests. We have demonstrated the benefits of our method over the original NBNN and its recent improvement, and local NBNN in two different benchmarks. Our method shows improved accuracy, up to 27% against the tested methods. This high accuracy is mainly due to consideration of the conditional dependences between high-level and its corresponding low-level features.

Usefulness of Functional MRI for the study of concentration sheet (Functional MRI를 이용한 학습집중력 향상 시트 개발)

  • Kim, Chang-Gyu
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.10
    • /
    • pp.2985-2989
    • /
    • 2009
  • An experiment was conducted to examine the effects of ceramic sheet on concentration of students studies. To demonstrate the improvement in the concentration of study, we obtained functional magnetic resonance imaging (fMRI), which has superior time resolution and measures brain noninvasively by using intrinsic contrast agent. As a result of Brainwave measurement, we could verify the blood flow's activate in the nearby frontal lobe related to memory process and noticeable ratio change in absolute alpha wave and beta wave after the analysis of Brainwave measurement. fMRI ascertains the physiological function of the brain and is being used to prevent the trouble medically that can be caused before and after the operation. For the visibility of cranial nerve network, many researches will be carried out to develope the product which is related to brain like concentration of study.

An Improvement of the JCVM System Architecture for Large Scale Smart Card having Seamless Power Supply (전원 공급이 지속적인 대용량 스마트 카드를 위한 JCVM 시스템 구조 개선)

  • Lee, Dong-Wook;Hwang, Chul-Joon;Yang, Yoon-Sim;Jung, Min-Soo
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.8
    • /
    • pp.1029-1038
    • /
    • 2007
  • A smart card based on the existing Java card platform executes and installs an application only when the power is supplied for a minute. And preparing for unexpected power outrage, the execution state of an application and all the data that are modified during execution are saved in the heap. This kind of frequent data update of an EEPROM data is a main cause of reducing the life-cycle of a smart card. This is because the smart card has been developed not considering the current situation that the power is always supplied, and by this time it has continuously kept its old architecture. This paper explains the high performance Java card system free power restriction. The system improves not only application saving mechanism, but memory architecture. In special, we deploy RAM for running an applet, as well as EEPROM for downloading an application. Through proposed mechanism, we can find out performance evaluation that the creation speed of an applet and the execution speed of a method increase up to 58% and 33% respectively.

  • PDF

A Study on the Preparation and Properties of $RuO_2$ Thin Films for Ferroelectric Memory Device Applications (강유전체 메모리 소자 응용을 위한 $RuO_2$ 박막의 제작과 특성에 관한 연구)

  • 강성준;정양희
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.10a
    • /
    • pp.494-498
    • /
    • 2000
  • RuO$_2$ thin films are prepared by RF magnetron reactive sputtering and their characteristics of crystallization, microstructure, surface roughness and resistivity are studied with various $O_2$/ (Ar+O$_2$) ratios and substrate temperatures. As $O_2$/(Ar+O$_2$) ratio decreases and substrate temperature increases, the preferred growing plane of RuO$_2$ thin films are changed from (110) to (101) plane. With increase of the $O_2$/(Ar+O$_2$) ratio from 20% to 50%, the surface roughness and the resistivity of RuO$_2$ thin films increase from 2.38nm to 7.81 nm, and from 103.6 $\mu$$\Omega$-cm to 227 $\mu$$\Omega$-cm, respectively, but the deposition rate decreases from 47 nm/min to 17 nm/min. On the other hand, as the substrate temperature increases from room temperature to 500 $^{\circ}C$, resistivity decreases from 210.5 $\mu$$\Omega$-cm to 93.7 $\mu$$\Omega$-cm. RuO$_2$ thin film deposited at 300 $^{\circ}C$ shows a excellent surface roughness of 2.38 nm. As the annealing temperature increases in the range between 400 $^{\circ}C$ and 650 $^{\circ}C$, the resistivity decreases because of the improvement of crystallinity. We find that RuO$_2$ thin film deposited at 20% of $O_2$/(Ar+O$_2$) ratio and 300 t of substrate temperature shows excellent combination of surface smoothness and low resistivity so that it is well Qualified for bottom electrodes for ferroelectric thin films.

  • PDF

Performance Improvement and ASIC Design of OAM Function Using Special Cell Field (특별 셀 영역을 이용한 OAM 기능의 성능 향상 및 ASIC 설계)

  • Park, Hyoung-Keun;Kim, Hwan-Yong
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.2
    • /
    • pp.26-36
    • /
    • 1999
  • In this paper, the novel scheme of OAM performance management function is proposed to supply the most of network resources and reliable services by processing data having various QoS(quality of service) in the view of cell loss and cell delay of ATM networks Also, the special fields of OAM cell are defined in order to improve correlate control, operation, and management technique between networks which is required to flexibility and precision control as detecting the performance information of the variable networks periodically. The proposed OAM function, the input/output function of cell, and the interface function of the accessory device which is likely to the memory/CPU are designed to ASIC. The designed chip is carried out the back-end simulation using Verilog-XL simulator of Cadence. In result, it is able to performs an accurate control in $2{\mu}s$.

  • PDF