• Title/Summary/Keyword: memory space

Search Result 846, Processing Time 0.026 seconds

Compression Methods for Time Series Data using Discrete Cosine Transform with Varying Sample Size (가변 샘플 크기의 이산 코사인 변환을 활용한 시계열 데이터 압축 기법)

  • Moon, Byeongsun;Choi, Myungwhan
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.5
    • /
    • pp.201-208
    • /
    • 2016
  • Collection and storing of multiple time series data in real time requires large memory space. To solve this problem, the usage of varying sample size is proposed in the compression scheme using discrete cosine transform technique. Time series data set has characteristics such that a higher compression ratio can be achieved with smaller amount of value changes and lower frequency of the value changes. The coefficient of variation and the variability of the differences between adjacent data elements (VDAD) are presumed to be very good measures to represent the characteristics of the time series data and used as key parameters to determine the varying sample size. Test results showed that both VDAD-based and the coefficient of variation-based scheme generate excellent compression ratios. However, the former scheme uses much simpler sample size decision mechanism and results in better compression performance than the latter scheme.

An Efficient Method for Mining Frequent Patterns based on Weighted Support over Data Streams (데이터 스트림에서 가중치 지지도 기반 빈발 패턴 추출 방법)

  • Kim, Young-Hee;Kim, Won-Young;Kim, Ung-Mo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.8
    • /
    • pp.1998-2004
    • /
    • 2009
  • Recently, due to technical developments of various storage devices and networks, the amount of data increases rapidly. The large volume of data streams poses unique space and time constraints on the data mining process. The continuous characteristic of streaming data necessitates the use of algorithms that require only one scan over the stream for knowledge discovery. Most of the researches based on the support are concerned with the frequent itemsets, but ignore the infrequent itemsets even if it is crucial. In this paper, we propose an efficient method WSFI-Mine(Weighted Support Frequent Itemsets Mine) to mine all frequent itemsets by one scan from the data stream. This method can discover the closed frequent itemsets using DCT(Data Stream Closed Pattern Tree). We compare the performance of our algorithm with DSM-FI and THUI-Mine, under different minimum supports. As results show that WSFI-Mine not only run significant faster, but also consume less memory.

A Circle Labeling Scheme without Re-labeling for Dynamically Updatable XML Data (동적으로 갱신가능한 XML 데이터에서 레이블 재작성하지 않는 원형 레이블링 방법)

  • Kim, Jin-Young;Park, Seog
    • Journal of KIISE:Databases
    • /
    • v.36 no.2
    • /
    • pp.150-167
    • /
    • 2009
  • XML has become the new standard for storing, exchanging, and publishing of data over both the internet and the ubiquitous data stream environment. As demand for efficiency in handling XML document grows, labeling scheme has become an important topic in data storage. Recently proposed labeling schemes reflect the dynamic XML environment, which itself provides motivation for the discovery of an efficient labeling scheme. However, previous proposed labeling schemes have several problems: 1) An insertion of a new node into the XML document triggers re-labeling of pre-existing nodes. 2) They need larger memory space to store total label. etc. In this paper, we introduce a new labeling scheme called a Circle Labeling Scheme. In CLS, XML documents are represented in a circular form, and efficient storage of labels is supported by the use of concepts Rotation Number and Parent Circle/Child Circle. The concept of Radius is applied to support inclusion of new nodes at arbitrary positions in the tree. This eliminates the need for re-labeling existing nodes and the need to increase label length, and mitigates conflict with existing labels. A detailed experimental study demonstrates efficiency of CLS.

$(Ba, Sr)TiO_3$박막의 전기적 성질과 전도기구 해석

  • 정용국;손병근;이창효
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2000.02a
    • /
    • pp.69-69
    • /
    • 2000
  • (Ba, Sr)TiO3 (BST)[1-3] 박막은 유전상수가 크고 고주파에서도 유전특성 저하가 적기 때문에 ULSI DRAM(Dynamic Random Access Memory)에 응용 가능한 물질로 최근 각광을 받고 있다. 하지만, 아직 BST 박막을 DRSM에 바로 적용하기 위해선 몇 가지 문제점이 있다. 그 중 누설전류 문제는 디바이스 응용시 매우 중요한 요소이다. 특히, DRAM에서 refresh time와 직접적인 관련이 있어 디바이스 내의 신뢰도 및 전력소모를 결정하는 주된 인자가 된다. 지금까지, BST 박막의 인가전업, 온도, 그리고 전극물질에 따른 누설전류 현상들이 고찰되었고, 이에 관한 많은 전도기구 모델들이 제시되었다. Schottky emission, Poole-Frenkel emission, space charge limited conduction 등이 그 대표적인 예이다. 하지만 아쉽게도 BST 박막의 정확한 누설 전류 전도 기구를 완전히 설명하는데는 아직 한계가 있다. 따라서 본 연구에서는 제작된 BST 커패시터 내의 기본적인 전기적 성질을 조사하고, 정확한 누설전류 기구 규명에 초점을 두고자 한다. 이를 위해 기존의 여러 기구들과 비교 분석할 것이다. 하부전극으로 사용하기 위해 스퍼터링 방법으로 p-Si(100) 기판위에 RuO2 박막을 약 120nm 증착하였다. 증착전의 chamberso의 초기압력은 5$\times$10-6 Torr이하의 압력으로 유지시켰다. Ar/O2의 비는 이전 실험에서 최적화된 9/1로 하였다. BST 박막 증착 시 5분간 pre-sputtering을 실시한 후 하부전극 기판위에 BST 박막을 증착하였다. 증착이 끝난 후 시편을 상온까지 냉각시킨 후 꺼내었다. 전기적 특성을 측정하기 상부전극으로 RuO2와 Al 박막을 각각 상온에서 100nm 증착하였다. 이때 hole mask를 이용하여 반경이 140um인 원형의 상부전극을 증착하였다. BST 박막의 증착온도가 증가하고 Ar/O2 비가 감소할수록 제작된 BST-커패시터의 전기적 성질이 우수하였다. 증착온도 $600^{\circ}C$, ASr/O2=5/5에서 증착된 막의 누설전류는 4.56$\times$10-8 A/cm2, 유전상수는 600 정도의 값을 나타내었다. 인가전압에 따른 BST 커패시터의 transition-current는 Curie-von Schweider 모델을 따랐다. BST 박막의 누설전류 전도기구는 기존의 Schottky 모델이 아니라 modified-Schottky 무델로 잘 설명되었다. Modified-Schottky 모델을 통해 BST 박막의 광학적 유전율 $\varepsilon$$\infty$=4.9, 이동도 $\mu$=0.019 cm2/V-s, 장벽 높이 $\psi$b=0.79 eV를 구하였다.

  • PDF

A Study on the Prefetch Method for Multimedia Presentations to play on the Low Bandwidth Mobile Devices (낮은 대역폭을 갖는 이동 단말기에서 멀티미디어 프리젠테이션을 재생하기 위한 프리패치 방법)

  • Hong Maria;Yang Hyuck;Lim Young-Haw
    • Journal of Internet Computing and Services
    • /
    • v.4 no.4
    • /
    • pp.65-74
    • /
    • 2003
  • Recently, It is required that multimedia data display on not only PC but also the Mobile device such as cellar phone, PDA. Mobile divieces has not sufficient of storage space or main memory and has slow network speed. So we can't process the multimedia data with the existing way on PC. This paper presents various methods for MultimediaPresentation which are able to display on the mobile device with the low-bandwidth and small storage. There Is an analysis that Is playable on the mobile device using presentation area devision method and replayable analysis method. If the display of multimedia presentation is impossible from this analysis, to apply prefetch techniques a using EPOB apoint and as User QoS of multimedia data through prefetch techniques have keep, do so that playable. Then, it is proposed to playable smooth multimedia presentation as that each of the presentations through prefetch Scheduling techniques point and quantity of data which are prefetch.

  • PDF

Ultra low-power active wireless sensor for structural health monitoring

  • Zhou, Dao;Ha, Dong Sam;Inman, Daniel J.
    • Smart Structures and Systems
    • /
    • v.6 no.5_6
    • /
    • pp.675-687
    • /
    • 2010
  • Structural Health Monitoring (SHM) is the science and technology of monitoring and assessing the condition of aerospace, civil and mechanical infrastructures using a sensing system integrated into the structure. Impedance-based SHM measures impedance of a structure using a PZT (Lead Zirconate Titanate) patch. This paper presents a low-power wireless autonomous and active SHM node called Autonomous SHM Sensor 2 (ASN-2), which is based on the impedance method. In this study, we incorporated three methods to save power. First, entire data processing is performed on-board, which minimizes radio transmission time. Considering that the radio of a wireless sensor node consumes the highest power among all modules, reduction of the transmission time saves substantial power. Second, a rectangular pulse train is used to excite a PZT patch instead of a sinusoidal wave. This eliminates a digital-to-analog converter and reduces the memory space. Third, ASN-2 senses the phase of the response signal instead of the magnitude. Sensing the phase of the signal eliminates an analog-to-digital converter and Fast Fourier Transform operation, which not only saves power, but also enables us to use a low-end low-power processor. Our SHM sensor node ASN-2 is implemented using a TI MSP430 microcontroller evaluation board. A cluster of ASN-2 nodes forms a wireless network. Each node wakes up at a predetermined interval, such as once in four hours, performs an SHM operation, reports the result to the central node wirelessly, and returns to sleep. The power consumption of our ASN-2 is 0.15 mW during the inactive mode and 18 mW during the active mode. Each SHM operation takes about 13 seconds to consume 236 mJ. When our ASN-2 operates once in every four hours, it is estimated to run for about 2.5 years with two AAA-size batteries ignoring the internal battery leakage.

Design of AES-Based Encryption Chip for IoT Security (IoT 보안을 위한 AES 기반의 암호화칩 설계)

  • Kang, Min-Sup
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.1
    • /
    • pp.1-6
    • /
    • 2021
  • The paper proposes the design of AES-based encryption chip for IoT security. ROM based S-Box implementation occurs a number of memory space and some delay problems for its access. In this approach, S-Box is designed by pipeline structure on composite field GF((22)2) to get faster calculation results. In addition, in order to achieve both higher throughput and less delay, shared S-Box are used in each round transformation and the key scheduling process. The proposed AES crypto-processor is described in Veilog-HDL, and Xilinx ISE 14.7 tool is used for logic synthesis by using Xilinx XC6VLX75T FPGA. In order to perform the verification of the crypto-processor, the timing simulator(ModelSim 10.3) is also used.

Performance Analysis of TNS System for Improving DDS Discovery (DDS 검색 방식 개선을 위한 TNS 시스템 성능 분석)

  • Yoon, Gunjae;Choi, Jeonghyun;Choi, Hoon
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.14 no.6
    • /
    • pp.75-86
    • /
    • 2018
  • The DDS (Data Distribution Service) specification defines a discovery method for finding participants and endpoints in a DDS network. The standard discovery mechanism uses the multicast protocol and finds all the endpoints in the network. Because of using multicasting, discovery may fail in a network with different segments. Other problems include that memory space wastes due to storing information of all the endpoints. The Topic Name Service (TNS) solves these problems by unicasting only the endpoints, which are required for communication. However, an extra delay time is inevitable in components of TNS, i.e, a front-end server, topic name servers, and a terminal server. In this paper, we analyze the performance of TNS. Delay times in the servers of TNS and time required to receive endpoint information are measured. Time to finish discovery and number of receiving endpoints compare with the standard discovery method.

Hiding Shellcode in the 24Bit BMP Image (24Bit BMP 이미지를 이용한 쉘코드 은닉 기법)

  • Kum, Young-Jun;Choi, Hwa-Jae;Kim, Huy-Kang
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.22 no.3
    • /
    • pp.691-705
    • /
    • 2012
  • Buffer overflow vulnerability is the most representative one that an attack method and its countermeasure is frequently developed and changed. This vulnerability is still one of the most critical threat since it was firstly introduced in middle of 1990s. Shellcode is a machine code which can be used in buffer overflow attack. Attackers make the shellcode for their own purposes and insert it into target host's memory space, then manipulate EIP(Extended Instruction Pointer) to intercept control flow of the target host system. Therefore, a lot of research to defend have been studied, and attackers also have done many research to bypass security measures designed for the shellcode defense. In this paper, we investigate shellcode defense and attack techniques briefly and we propose our new methodology which can hide shellcode in the 24bit BMP image. With this proposed technique, we can easily hide any shellcode executable and we can bypass the current detection and prevention techniques.

Correlation Power Analysis Attacks on the Software based Salsa20/12 Stream Cipher (소프트웨어 기반 스트림 암호 Salsa20/12에 대한 상관도 전력분석 공격)

  • Park, Young-Goo;Bae, Ki-Seok;Moon, Sang-Jae;Lee, Hoon-Jae;Ha, Jae-Cheul;Ahn, Mahn-Ki
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.5
    • /
    • pp.35-45
    • /
    • 2011
  • The Salsa20/12 stream cipher selected for the final eSTREAM portfolio has a better performance than software implementation of AES using an 8-bit microprocessor with restricted memory space, In the theoretical approach, the evaluation of exploitable timing vulnerability was 'none' and the complexity of side-channel analysis was 'low', but there is no literature of the practical result of power analysis attack. Thus we propose the correlation power analysis attack method and prove the feasibility of our proposed method by practical experiments, We used an 8-bit RISC AVR microprocessor (ATmegal128L chip) to implement Salsa20/12 stream cipher without any countermeasures, and performed the experiments of power analysis based on Hamming weight model.