Claim Missing Document
Check
Articles

Found 12 Documents
Search

Base-Delta Dynamic Block Length and Optimization on File Compression Tommy; Riza, Ferdy; Siregar, Rosyidah; Yeni, Manovri; Elhanafi, Andi Marwan; Nurmadi, Ruswan
Journal of Computer Networks, Architecture and High Performance Computing Vol. 5 No. 1 (2023): Article Research Volume 5 Issue 1, January 2023
Publisher : Information Technology and Science (ITScience)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47709/cnahpc.v5i1.1993

Abstract

Delta compression uses the previous block of bytes to be used as a reference in the compression process for the next blocks. This approach is increasingly ineffective due to the duplication of byte sequences in modern files. Another delta compression model uses the numerical difference approach of the sequence of bytes contained in a file. Storing the difference value will require fewer representation bits than the original value. Base + Delta is a compression model that uses delta which is obtained from the numerical differences in blocks of a fixed size. Developed with the aim of compressing memory blocks, this model uses fixed-sized blocks and does not have a special mechanism when applied to file compression in general. This study proposes a compression model by developing the concept of Base+Delta encoding which aims to be applicable to all file types. Modification and development carried out by adopting a dynamic block size using a sliding window and block header optimization on compressed and uncompressed blocks giving promising test results where almost all file formats tested can be compressed with a ratio that is not too large but consistent for all file formats where the ratio compression for all file formats obtained between 0.04 to 12.3. The developed compression model also produces compression failures in files with high uncompressed blocks where the overhead of additional uncompressed blocks of information causes files to become larger with a negative ratio obtained of -0.39 to -0.48 which is still relatively small and acceptable.
Floyd-Warshall Algorithm for Web-Based Route Optimization for a Road Network Study in Medan City Faridawaty Marpaung; Arnita; Tommy; Putri Harliana
Jurnal Multidisiplin Madani Vol. 3 No. 11 (2023): November, 2023
Publisher : PT FORMOSA CENDEKIA GLOBAL

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55927/mudima.v3i11.6674

Abstract

The socio-demographic conditions of the region have an influence on the transportation performance in the region. This study aims to determine the shortest path between two specified points, namely the starting and the end point of several sub-districts in Medan city, especially the sub-district of Medan Amplas. To get the output, several steps are needed, namely collecting the coordinates of street names and road lengths, which is obtained from Google maps. Graphs are used to present the data. Data analysis is used by Floyd–Warshall Algorithm with HTML Web Application supported by PHP programming language, JavaScript and MySQL database. The test results using the Black Box method show that the system functionality is 100% running well. For testing, the results of the final W_ij and Z^* final matrix calculations generated by the system is same with the manual calculations. Finally, to test the reliability of the system made, the results of the reliability test show the truth of working well and it can be accepted. There are no path deviations, so that the results are as expected