Advanced move-to-front for list access problem

Nanda, Shradha S.; Das, Kalyan; Padhi, Jagamohan; Hota, Santwana

doi:10.1109/iccpct.2016.7530202

Cited by 2 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…One problem with the basic MTF transform is that it makes the same changes for any character, regardless of frequency, which can result in decreased compression, as characters that occur rarely may push frequent characters to higher values [75]. Due to the fact that there is a risk of negative compression, especially in grids with high distortion, proper algorithm calibration is needed.…”

Section: List) Movetofront(output_arr[i] List) End For Return Output_arrmentioning

confidence: 99%

Compression Techniques for Real-Time Control and Non-Time-Critical Big Data in Smart Grids: A Review

Prokop,

Bień,

Barczentewicz

2023

Energies

View full text Add to dashboard Cite

Significant amounts of data need to be transferred in order to optimize the operation of power grids. The development of advanced metering and control infrastructure ensures a growth in the amount of data transferred within smart grids. Data compression is a strategy to reduce the burden. This paper presents current challenges in the field of time-series data compression. This paper’s novel contribution is the division of data in smart grids to real-time data used for control purposes and big data sets used for non-time-critical analysis of the system. Both of these two applications have different requirements for effective compression. Currently used algorithms are listed and described with their advantages and drawbacks for both of these applications. Details needed for the implementation of an algorithm were also provided. Comprehensive analysis and comparison are intended to facilitate the design of a data compression method tailored for a particular application. An important contribution is the description of the influence of data compression methods on cybersecurity, which is one of the major concerns in modern power grids. Future work includes the development of adaptive compression methods based on artificial intelligence, especially machine learning and quantum computing. This review will offer a solid foundation for the research and design of data compression methods.

show abstract

Section: List) Movetofront(output_arr[i] List) End For Return Output_arrmentioning

confidence: 99%

Compression Techniques for Real-Time Control and Non-Time-Critical Big Data in Smart Grids: A Review

Prokop,

Bień,

Barczentewicz

2023

Energies

View full text Add to dashboard Cite

show abstract

“…Hsail penelitian ini didapatkan rasio kompresi yang sama namun waktu kompresi menjadi lebih cepat [3]. Kemudian Itoh dan Tanaka [4] menggunakan MTF yang asli untuk kebutuhan akses daftar elemen-elemen yang letaknya berjauhan [5] Dalam penelitian ini akan dicoba untuk memodifikasi tahap kedua BWCA yaitu tahap GST dengan tujuan untuk menganalisis algoritma manakah yang dapat memberikan rasio kompresi yang lebih baik, apakah MTF yang asli, atau modifikasi pertama (MTF-1) atau modifikasi kedua (MTF-2) untuk seluruh data uji yang digunakan.…”

Section: Pendahuluanunclassified

Analisis Algoritma Mtf, MTF-1 Dan MTF-2 Pada Burrows Wheeler Compression Algorithm

Sunaryo¹,

Chrisantyo²,

Lukito³

2019

JUTEI

View full text Add to dashboard Cite

Kebutuhan kompresi data teks di era komputasi awan saat ini masih cukup tinggi. Data teks perlu dikompresi sekecil mungkin agar mudah dikirimkan. Burrows Wheeler Compression Algorithm (BWCA) adalah salah satu algoritma kompresi teks jenis block sorting yang bersifat non-proprietary dan cukup populer digunakan. Dalam prosesnya, BWCA menggunakan metode pemrosesan awal yang disebut Global Structure Transformation (GST) untuk menyusun karakter agar lebih baik hasil kompresinya. Penelitian ini membandingkan tiga metode pemrosesan awal Move-to-Front, yaitu MTF, MTF-1 dan MTF-2. Bahan uji kompresi berupa data Alkitab Bahasa Inggris, Indonesia dan Jawa, dan beberapa data yang berasal dari Calgary Corpus. Oleh karena kompresi teks adalah kompresi yang bersifat lossless dan reversibel, maka selain melakukan pengujian untuk pengompresian data, juga dilakukan pengujian untuk pendekompresian data dengan Inverse Burrows Wheeler Transform. Pengujian kompresi dan dekompresi pada data Alkitab maupun Calgary Corpus berhasil dilakukan dan menunjukkan MTF-1 mampu memberikan rasio kompresi yang lebih baik dikarenakan jumlah total tiap bit pada proses Huffman lebih sedikit dibandingkan dua metode lainnya.

show abstract

Advanced move-to-front for list access problem

Cited by 2 publications

References 5 publications

Compression Techniques for Real-Time Control and Non-Time-Critical Big Data in Smart Grids: A Review

Compression Techniques for Real-Time Control and Non-Time-Critical Big Data in Smart Grids: A Review

Analisis Algoritma Mtf, MTF-1 Dan MTF-2 Pada Burrows Wheeler Compression Algorithm

Contact Info

Product

Resources

About