• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.58-71
• /
• 2002

Generally, multi-dimensional data such as image and spatial data require large amount of storage space. There is a limit to store and manage those large amount of data in single workstation. If we manage the data on parallel computing environment which is being actively researched these days, we can get highly improved performance. In this paper, we propose a parallel high-dimensional index structure that exploits the parallelism of the parallel computing environment. The proposed index structure is nP(processor)-n$\times$mD(disk) architecture which is the hybrid type of nP-nD and lP-nD. Its node structure increases fan-out and reduces the height of a index tree. Also, A range search algorithm that maximizes I/O parallelism is devised, and it is applied to K-nearest neighbor queries. Through various experiments, it is shown that the proposed method outperforms other parallel index structures.

• Journal of Advanced Navigation Technology
• /
• v.18 no.1
• /
• pp.50-55
• /
• 2014

Recently, importance of digital forensics has increased and using analysis methods of digital evidence in the analysis of evidence of various types. However, analysis time and effort is steadily increasing because personal disk capacity is too big and it has many number of files. Most digital evidence has time property, such as access time, creation time, and modification time. These time information of digital evidence is one of most important factors in the digital forensic area. But if digital examiner simply analyze based on binary source only, it is possible to have wrong result because time has various types. In this paper, we classify various type of time in the digital evidence and describe advanced analysis method based on timeline chart for digital forensic investigation.

• Smart Media Journal
• /
• v.8 no.1
• /
• pp.19-26
• /
• 2019

At the opening ceremony of 2018 Winter Olympics in PyeongChang, an unknown cyber-attack occurred. The malicious code used in the attack is based on in-memory malware, which differs from other malicious code in its concealed location and is spreading rapidly to be found in more than 140 banks, telecommunications and government agencies. In-memory malware accounts for more than 15% of all malicious codes, and it does not store its own information in a non-volatile storage device such as a disk but resides in a RAM, a volatile storage device and penetrates into well-known processes (explorer.exe, iexplore.exe, javaw.exe). Such characteristics make it difficult to analyze it. The most recently released in-memory malicious code bypasses the endpoint protection and detection tools and hides from the user recognition. In this paper, we propose a method to efficiently extract the payload by unpacking injection through IDA Pro debugger for Dorkbot and Erger, which are in-memory malicious codes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.191-194
• /
• 2001

The availability of the inexpensive, large main memories coupled with the demand for faster response time are bringing a new perspective to database technology. The Web GIS used by u unspecified number of general public in the internet needs high speed response time and frequent data retrieval for spatial analysis rather than data update. Therefore, it is appropriate to use main memory as a underlying storage structures for the Web GIS data. In this paper, we propose a data representation method based on relative coordinates and the size of the MBR. The method is able to compress the spatial data widely used in the Web GIS into smaller volume of memory. We also propose a memory resident spatial index with simple mechanism for processing point and region queries. The performance test shows that the index is suitable for managing the skewed data in terms of the size of the index and the number of the MBR intersection check operations.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.337-346
• /
• 2000

In a Vod(video0on-demand) system, a scheduling strategy is designed to increase the system efficiency and to eatisfy the isochronous requirements of showing a video to multiple viewers with one disk access. In this paper, we have proposed the Stream Relay Scheme (SRS) which utilizes the client's buffer space to reduce the server's disk I/O, buffer consumption, and stream capacity. Under the SRS which we have proposed in this paper, the server does not service all the requests directly but forwards the new request selectively to the client who is being served currently in order to reduce the initial latency and increase the system throughput. The SRS-BAT which integrated the SRS with the Batching technique is introduced. The results of the simulated experiments which compared the SRS with the conventional technique have shown the noticeable performance improvements in terms of initial latency and the server throughput.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.7
• /
• pp.879-884
• /
• 2020

In the conventional video file system, videos are stored in a high performance server which has mass storage hard disks or disk arrays. For 3D internet broadcasting, real time operations are required to transmit video files to many clients. This paper describes the design of the 3D internet broadcasting system which can provide realtime streaming service to many users in the 5G environment. In reality, unicast is used to transmit multimedia contents over the internet rather than IP multicast since IP multicast has its own drawbacks in deployment, security, maintenance and so on. In addition, multimedia broadcasting service system like VoD has difficulties in applying to 3D internet broadcasting system since it requires a large amount of system and network resources. In this work, we develop a 3D internet broadcasting system which can construct effective data delivery by minimizing performance-degrading factors.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06b
• /
• pp.273-278
• /
• 2007

검사점 및 복구 도구(Checkpointing & Recovery Facility)를 이용하여 임베디드 시스템에서 결함 허용(Fault Tolerance) 기법을 적용할 경우 쓰기 작업의 오버헤드로 인해 실용성이 크게 떨어지게 된다. 실시간 운영체제와 함께 어떠한 한계 상황에서 결함 허용 및 복구 도구가 오히려 시스템의 성능을 저하시키는 요인으로 작용하게 되면 이는 결국 쓸모없는 도구가 되어 사용되지 않을 것이다. 따라서 프로세스의 복구를 위해 저장하는 프로세스 이미지의 기록에 소요되는 시간을 크게 낮추어야만 비로소 검사점 도구가 그 진가를 발휘하게 될 수 있다. 본 논문에서는 NVSRAM(Non Volatile SRAM)을 검사점 및 복구 도구의 저장 장치로 활용함으로써 기존의 검사점 도구에서 성능을 저하시키는 주원인이었던 검사점 기록의 오버헤드를 개선하기 위한 연구를 수행하였다. 검사점 기록 시간을 줄이기 위한 방법으로 주 메모리에 저장된 프로세스의 복구와 관련된 데이터를 SRAM 특성을 갖는 비휘발성 저장 장치인 NVSRAM에 저장하여 디스크 접근에 소요되는 시간을 최소화시킴으로써 임베디드 시스템에서 실용적으로 사용 가능한 검사점 도구를 구현하였고, 이러한 연구의 결과를 검증하기 위해 기존 시스템에서 저장 장치로 사용되던 플래시 메모리, 주 메모리, 원격 메모리를 사용하는 경우의 성능과 NVSRAM을 활용할 때의 성능을 비교해 보았다. 본 연구에서 제안하는 결함 허용 도구는 실제 시스템에 적용하여 효과적인 성능을 발휘할 수 있을 것이며, 차세대 메모리를 이용한 결함 허용 도구의 연구에 기여를 할 수 있을 것으로 기대된다.ate첨가배지(添加培地)에서 가장 저조(低調)하였다. vitamin중(中)에서는 niacin과 thiamine첨가배지(添加培地)에서 근소(僅少)한 증가(增加)를 나타내었다.소시켜 항이뇨 및 Na 배설 감소를 초래하는 작용과, 둘째는 신경 경로를 통하지 않고, 아마도 humoral factor를 통하여 신세뇨관에서 Na 재흡수를 억제하는 작용이 복합적으로 나타내는 것을 알 수 있었다.으로 초래되는 복합적인 기전으로 추정되었다., 소형과와 기형과는 S-3에서 많이 나왔다. 이상 연구결과에서 입도분포가 1.2-5mm인 것이 바람직한 것으로 나타났다.omopolysaccharides로 확인되었다. EPS 생성량이 가장 좋은 Leu. kimchii GJ2의 평균 분자량은 360,606 Da이었으며, 나머지 두 균주에 대해서는 생성 EPS 형태와 점도의 차이로 미루어 보아 생성 EPS의 분자구조와 분자량이 서로 다른 것으로 판단하였다.TEX>개로 통계학적으로 유의한 차이가 없었다. Heat shock protein-70 (HSP70)과 neuronal nitric oxide synthase (nNOS)에 대한 면역조직화학검사에서 실험군 Cs2군의 신경세포가 대조군 12군에 비해 HSP70과 nNOS의 과발현을 보였으며, 이는 통계학적으로 유의한 차이를 보였다(p<0.05). nNOS와 HSP70의 발현은 강한 연관성을 보였고(상관계수 0.91, p=0.000), nNOS를 발현하는 세포가 동시에 HSP70도 발현함을 확인할 수 있었다. 결론: 우리는 cyclosporin A가 토끼의 25분간의 척수허혈에 대해 척수보호 효과가 있었으며 이는 HSP70의

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.441-451
• /
• 2005

HTML is mostly stored in native file systems instead of specialized repositories such as a database. Like HTML, XML, the standard for the exchange and the representation of data in the Internet, is mostly resident on native file systems. However. since XML data is irregular and verbose, the disk space and the network bandwidth are wasted compared to those of regularly structured data. To overcome this inefficiency of XML data, the research on the compression of XML data has been conducted. Among recently proposed XML compression techniques, some techniques do not support querying compressed data, while other techniques which support querying compressed data blindly encode data values using predefined encoding methods without considering the types of data values which necessitates partial decompression for processing range queries. As a result, the query performance on compressed XML data is degraded. Thus, this research proposes an XML compression technique which supports direct and efficient evaluations of queries on compressed XML data. This XML compression technique adopts an encoding method, called dictionary encoding, to encode each tag of XML data and applies proper encoding methods for encoding data values according to the inferred types of data values. Also, through the implementation and the performance evaluation of the XML compression technique proposed in this research, it is shown that the implemented XML compressor efficiently compresses real-life XML data lets and achieves significant improvements on query performance for compressed XML data.

• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.301-308
• /
• 2014

The mass storage of data and the importance of storage capacity lately has emerged. In this paper, we suggest the new method which estimate life cycle from acceleration life test about 2.5 inch hard disk driver as mass storage, which minimize the difference between real market annual failure rate and estimated failure rate. we obtain market transfer capacity per hours from returned 2.5inch hard disk drives about 309 numbers and accelerating transfer capacity per hours from acceleration life test. we calculate acceleration factor about duty cycle and estimate annual failure rate from failure rate and acceleration factors: temperature acceleration factor, duty cycle acceleration factor, the transfer capacity per hour represent the 93.4 % of user is 5.8 GB/hour, the transfer capacity per hour from acceleration life test is 81.4 GB/hour. the acceleration factor of duty cycle is 14.1. annual failure rate is stabilized at market one year after, annual failure rate is between 0.3 and 0.378. estimated annual failure rate is 0.4, so it is matched at 75~94 % between estimate annual failure rate and market annual failure rate. This study influence the estimate method of annual failure rate by the result of acceleration life cycle of manufacture.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.108-121
• /
• 2004

In this paper, we propose an enhanced snapshot technique that solves performance degradation when snapshot is initiated for the storage cluster system. However, traditional snapshot technique has some limits adapted to large amount storage shared by multi-hosts in the following aspects. As volume size grows, (1) it deteriorates crucially the performance of write operations due to additional disk access to verify COW is performed. (2) Also it increases excessively the blocking time of write operation performed during the snapshot creation time. (3)Finally, it deteriorates the performance of write operations due to additional disk I/O for mapping block caused by the verification of COW. In this paper, we propose an efficient snapshot technique for large amount storage shared by multi-hosts in SAN Environments. We eliminate the blocking time of write operation caused by freezing while a snapshot creation is performing. Also to improve the performance of write operation when snapshot is taken, we introduce First Allocation Bit(FAB) and Snapshot Status Bit(SSB). It improves performance of write operation by reducing an additional disk access to volume disk for getting snapshot mapping block. We design and implement an efficient snapshot technique, while the snapshot deletion time, improve performance by deallocation of COW data block using SSB of original mapping entry without snapshot mapping entry obtained mapping block read from the shared disk.