• Title/Summary/Keyword: Block Storage

Search Result 392, Processing Time 0.031 seconds

Mass Memory Operation for Telemetry Processing of LEO Satellite (저궤도위성 원격측정 데이터 처리를 위한 대용량 메모리 운용)

  • Chae, Dong-Seok;Yang, Seung-Eun;Cheon, Yee-Jin
    • Aerospace Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.73-79
    • /
    • 2012
  • Because the contact time between satellite and ground station is very limited in LEO (Low Earth Orbit) satellite, all telemetry data generated on spacecraft bus are stored in a mass memory and downlinked to the ground together with real time data during the contact time. The mass memory is initialized in the first system initialization phase and the page status of each memory block is generated step by step. After the completion of the system initialization, the telemetry data are continuously stored and the stored data are played back to the ground by command. And the memory scrubbing is periodically performed for correction of single bit error which can be generated on harsh space environment. This paper introduces the mass memory operation method for telemetry processing of LEO satellite. It includes a general mass memory data structure, the methods of mass memory initialization, scrubbing, data storage and downlink, and mass memory management of primary and redundant mass memory.

Secure Authentication Protocol in Hadoop Distributed File System based on Hash Chain (해쉬 체인 기반의 안전한 하둡 분산 파일 시스템 인증 프로토콜)

  • Jeong, So Won;Kim, Kee Sung;Jeong, Ik Rae
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.23 no.5
    • /
    • pp.831-847
    • /
    • 2013
  • The various types of data are being created in large quantities resulting from the spread of social media and the mobile popularization. Many companies want to obtain valuable business information through the analysis of these large data. As a result, it is a trend to integrate the big data technologies into the company work. Especially, Hadoop is regarded as the most representative big data technology due to its terabytes of storage capacity, inexpensive construction cost, and fast data processing speed. However, the authentication token system of Hadoop Distributed File System(HDFS) for the user authentication is currently vulnerable to the replay attack and the datanode hacking attack. This can cause that the company secrets or the personal information of customers on HDFS are exposed. In this paper, we analyze the possible security threats to HDFS when tokens or datanodes are exposed to the attackers. Finally, we propose the secure authentication protocol in HDFS based on hash chain.

A Quantitative Evaluation and Comparison of Harmonic Elimination Algorithms Based on Moving Average Filter and Delayed Signal Cancellation in Phase Synchronization Applications

  • Xiong, Liansong;Zhuo, Fang;Wang, Feng;Liu, Xiaokang;Zhu, Minghua;Yi, Hao
    • Journal of Power Electronics
    • /
    • v.16 no.2
    • /
    • pp.717-730
    • /
    • 2016
  • The harmonic components of grid voltage result in oscillations of the calculated phase obtained via phase synchronization. This affects the security and stability of grid-connected converters. Moving average filter, delayed signal cancellation and their related harmonic elimination algorithms are major methods for such issues. However, all of the existing methods have their limitations in dealing with multiple harmonics issues. Furthermore, few studies have focused on a comparison and evaluation of these algorithms to achieve optimal algorithm selections in specific applications. In this paper, these algorithms are quantitatively analyzed based on the derived mathematical models. Moreover, an enhanced moving average filter and enhanced delayed signal cancellation algorithms, which are applicable for eliminating a group of selective harmonics with only one calculation block, are proposed. On this basis, both a comprehensive comparison and a quantitative evaluation of all of the aforementioned algorithms are made from several aspects, including response speed, required data storage size, sensitivity to sampling frequency, and elimination of random noise and harmonics. With the conclusions derived in this paper, better overall performance in terms of harmonic elimination can be achieved. In addition, experimental results under different conditions demonstrate the validity of this study.

Induction of Pacemaker Currents by DA-9701, a Prokinetic Agent, in Interstitial Cells of Cajal from Murine Small Intestine

  • Choi, Seok;Choi, Jeong June;Jun, Jae Yeoul;Koh, Jae Woong;Kim, Sang Hun;Kim, Dong Hee;Pyo, Myoung-Yun;Choi, Sangzin;Son, Jin Pub;Lee, Inki;Son, Miwon;Jin, Mirim
    • Molecules and Cells
    • /
    • v.27 no.3
    • /
    • pp.307-312
    • /
    • 2009
  • The interstitial cells of Cajal (ICC) are pacemaking cells required for gastrointestinal motility. The possibility of whether DA-9701, a novel prokinetic agent formulated with Pharbitis Semen and Corydalis Tuber, modulates pacemaker activities in the ICC was tested using the whole cell patch clamp technique. DA-9701 produced membrane depolarization and increased tonic inward pacemaker currents in the voltage-clamp mode. The application of flufenamic acid, a non-selective cation channel blocker, but not niflumic acid, abolished the generation of pacemaker currents induced by DA-9701. Pretreatment with a $Ca^{2+}$-free solution and thapsigargin, a $Ca^{2+}$-ATPase inhibitor in the endoplasmic reticulum, abolished the generation of pacemaker currents. In addition, the tonic inward currents were inhibited by U-73122, an active phospholipase C inhibitor, but not by $GDP-{\beta}-S$, which permanently binds G-binding proteins. Furthermore, the protein kinase C inhibitors, chelerythrine and calphostin C, did not block the DA-9701-induced pacemaker currents. These results suggest that DA-9701 might affect gastrointestinal motility by the modulation of pacemaker activity in the ICC, and the activation is associated with the non-selective cationic channels via external $Ca^{2+}$ influx, phospholipase C activation, and $Ca^{2+}$ release from internal storage in a G protein-independent and protein kinase C-independent manner.

Removal of Anodic Aluminum Oxide Barrier Layer on Silicon Substrate by Using Cl2 BCl3 Neutral Beam Etching

  • Kim, Chan-Gyu;Yeon, Je-Gwan;Min, Gyeong-Seok;O, Jong-Sik;Yeom, Geun-Yeong
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2011.02a
    • /
    • pp.480-480
    • /
    • 2011
  • 양극산화(anodization)는 금속을 전기화학적으로 산화시켜 금속산화물로 만드는 기술로서 최근 다양한 크기의 나노 구조를 제조하는 기술로 각광받고 있으며, 이러한 기술에 의하여 얻어지는 anodic aluminum oxide(AAO)는 magnetic data storage, optoelectronic device, sensor에 적용될 수 있는 nano device 뿐만 아니라 nanostructure를 제조하기 위한 template 및 mask로써 최근 광범위 하게 연구되고 있다. 또한, AAO는 Al2O3의 단단한 구조를 가진 무기재료이므로 solid mask로써 다른 porous materials 보다 뛰어난 특성을 갖고 있다. 또한 electron-beam lithography 및 block co-polymer 에 의한 patterning 과 비교하여 매우 경제적이며, 재현성이 우수할 뿐만 아니라 대면적에서 나노 구조의 크기 및 형상제어가 비교적 쉽기 때문에 널리 사용되고 있다. 그러나, AAO 형성 시 생기게 되는 반구형 모양의 barrier layer는 물질(substance)과 기판과의 direct physical and electrical contact을 방해하기 때문에 해결해야 할 가장 큰 문제점 중 하나로 알려져 있다. 따라서 본 연구에서는 실리콘 기판위의 형성된 AAO의 barrier layer를 Cl/BCl3 gas mixture에서 Neutral Beam Etching (NBE)과 Ion Beam Etching (IBE) 로 각각 식각한 후 그 결과와 비교하였다. NBE와 IBE 모두 Cl2/BCl3 gas mixture에서 BCl3 gas의 첨가량이 60% 일 경우 etch rate이 가장 높게 나타났고, optical emission spectroscopy (OES)로 Cl2/BCl3 플라즈마 내의 Cl radical density와 X-ray photoelectron spectroscopy (XPS)로 AAO 표면 위를 관찰한 결과 휘발성 BOxCly의 형성이 AAO 식각에 크게 관여함을 확인 할 수 있었다. 또한, NBE와 IBE 실험한 다양한 Cl2/BCl3 gas mixture ratio 에서 AAO가 식각이 되지만, 이온빔의 경우 나노사이즈의 AAO pore의 charging에 의해 pore 아래쪽의 위치한 barrier layer를 어떤 식각조건에서도 제거하지 못하였다. 하지만, NBE에서는 BCl3-rich Cl2/BCl3 gas mixture인 식각조건에서 AAO pore에 휘발성 BOxCly를 형성하면서 barrier layer를 제거할 수 있었다.

  • PDF

An Efficient Address Mapping Table Management Scheme for NAND Flash Memory File System Exploiting Page Address Cache (페이지 주소 캐시를 활용한 NAND 플래시 메모리 파일시스템에서의 효율적 주소 변환 테이블 관리 정책)

  • Kim, Cheong-Ghil
    • Journal of Digital Contents Society
    • /
    • v.11 no.1
    • /
    • pp.91-97
    • /
    • 2010
  • Flash memory has been used by many digital devices for data storage, exploiting the advantages of non-volatility, low power, stability, and so on, with the help of high integrity, large capacity, and low price. As the fast growing popularity of flash memory, the density of it increases so significantly that its entire address mapping table becomes too big to be stored in SRAM. This paper proposes the associated page address cache with an efficient table management scheme for hybrid flash translation layer mapping. For this purpose, all tables are integrated into a map block containing entire physical page tables. Simulation results show that the proposed scheme can save the extra memory areas and decrease the searching time with less 2.5% of miss ratio on PC workload and can decrease the write overhead by performing write operation 33% out of total writes requested.

Storage I/O Subsystem for Guaranteeing Atomic Write in Database Systems (데이터베이스 시스템의 원자성 쓰기 보장을 위한 스토리지 I/O 서브시스템)

  • Han, Kyuhwa;Shin, Dongkun;Kim, Yongserk
    • Journal of KIISE
    • /
    • v.42 no.2
    • /
    • pp.169-176
    • /
    • 2015
  • The atomic write technique is a good solution to solve the problem of the double write buffer. The atomic write technique needs modified I/O subsystems (i.e., file system and I/O schedulers) and a special SSD that guarantees the atomicity of the write request. In this paper, we propose the writing unit aligned block allocation technique (for EXT4 file system) and the merge prevention of requests technique for the CFQ scheduler. We also propose an atomic write-supporting SSD which stores the atomicity information in the spare area of the flash memory page. We evaluate the performance of the proposed atomic write scheme in MariaDB using the tpcc-mysql and SysBench benchmarks. The experimental results show that the proposed atomic write technique shows a performance improvement of 1.4~1.5 times compared to the double write buffer technique.

A Study of Network Forensics related to Internet Criminal at UCC (UCC와 관련된 인터넷 범죄에 대한 네트워크 포렌식 연구)

  • Lee, Gyu-An;Park, Dea-Woo;Shin, Young-Tae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.2
    • /
    • pp.143-151
    • /
    • 2008
  • 74% of Internet users use the UCC, and You Tube using firearms in a crime occurred. Internet crime occurred in the online, non-face transaction, anonymous, encapsulation. In this paper, we are studied a Network Forensic Way and a technique analyze an aspect criminal the Internet haying appeared at Internet UCC, and to chase. Study ID, IP back-tracking and position chase through corroborative facts collections of the UCC which used UCC search way study of the police and a public prosecutor and storage way and network forensic related to crimes of Internet UCC. Proof data encrypt, and store, and study through approach control and user authentication so that they are adopted to legal proof data through integrity verification after transmission and storages. This research via the Internet and criminal conspiracy to block the advance promotion, and for the criminal investigative agencies of the Internet will contribute to the advancement forensics research.

  • PDF

Image Coding Using LOT and FSVQ with Two-Channel Conjugate Codebooks (LOT와 2-채널 결합 코드북을 갖은 FSVQ를 이용한 영상 부호화)

  • 채종길;황찬식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.4
    • /
    • pp.772-780
    • /
    • 1994
  • Vector quantization with two-channel conjugate codebook has been researched as an efficient coding technique that can reduce the computational complexity and codebook storage. This paper proposes FSVQ using two-channel conjugate codebook in order to reduce the number of state codebooks. Input vector in the two-channel conjugate FSVQ is coded with state codebook of a seperated state according to each codebook. In addition, LOT is adopted to obtain to obtain a high coding gain and to reduce blocking effect which appears in the block coding. As a result, although FSVQ can achieve higher data compression ratio than general vector quantization, it has a disadvantage of having a very large number of state codebooks. However FSVQ with two-channel conjugate codebooks can employ a significantly reduced number of state codebooks, even though it has a small loss in the PSNR compared with the conventional FSVQ using one codebook. Moreover FSVQ in the LOT domain can reduce blocking effect and high coding gain compared with FSVQ in the spatial domain.

  • PDF

Sanitization of Open-Source Based Deduplicated Filesystem (오픈 소스 중복 제거 파일시스템에서의 완전 삭제)

  • Cho, Hyeonwoong;Kim, SeulGi;Kwon, Taekyoung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.5
    • /
    • pp.1141-1149
    • /
    • 2016
  • Deduplicated filesystem can reduce usage of storage. However, it be able to recover deleted block. We studied sanitization of deduplicated filesystem, LessFS which is based on FUSE(Filesystem in USErspace). First, we show a vulnerability recover deleted data in the deduplicated filesystem. We implement sanitization of deduplicated filesystem considering the part of fingerprint DB with data blocks. It takes 60~70 times compared to without sanitization. Which means access time to fingerprint DB and overhead derived from increase of number of chunk have a critical impact on sanitization time. But in case of more than 65,536 Byte of chunksize, it is faster than normal filesystem without deduplication.