Articles
<![CDATA[Implementasi Artificial Neural Network dalam Identifikasi Fatalitas Kecelakaan Lalu Lintas (Studi Kasus: Kota Leeds-Inggris) ]]>
<![CDATA[Aryatama, Andrew Ananta]]>;
<![CDATA[Wowor, Alz Danny]]>
<![CDATA[ Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi) Vol 7 No 4 (2023): OCTOBER-DECEMBER 2023 ]]>
Publisher : <![CDATA[Lembaga Otonom Lembaga Informasi dan Riset Indonesia (KITA INFO dan RISET) ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.35870/jtik.v7i4.1102
<![CDATA[Traffic accidents are a serious worldwide problem, including in Leeds, England. The high fatality rate of traffic accidents is a significant challenge in improving road safety. Therefore, this research aims to implement artificial neural networks in analyzing the factors contributing to traffic accident fatalities in Leeds. The method used in this research involves collecting data of traffic accidents from 2009 to 2018 in the town of Leeds. This method was chosen because artificial neural networks can perform complex and in-depth analyses of large and complex data. This research concludes that artificial neural networks can be used as an effective tool in analyzing traffic accident data and helping policymakers improve road safety in Leeds and possibly elsewhere.]]>
<![CDATA[Implementasi Algoritma Long Short-Term Memory dalam Prediksi Konsentrasi Gas Metana (CH4) di Kota Salatiga ]]>
<![CDATA[Putri, Febyola Kurnia Tiara]]>;
<![CDATA[Wowor, Alz Danny]]>
<![CDATA[ Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi) Vol 8 No 2 (2024): APRIL-JUNE 2024 ]]>
Publisher : <![CDATA[Lembaga Otonom Lembaga Informasi dan Riset Indonesia (KITA INFO dan RISET) ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.35870/jtik.v8i2.1917
<![CDATA[Implementation of the Long Short Term Memory (LSTM) algorithm is done to build a prediction model that can handle complex time series data. Model development uses training and testing data and combines multiple time series to improve prediction accuracy. Model testing is done by measuring the root mean square error (RMSE) value as a performance indicator. The test results show that the application of the LSTM algorithm to the (CH4) sensor provides an optimal RMSE value, namely with a value for training data of 20% (0.09) and test data of 80% (0.14), indicating the prediction accuracy of methane gas (CH4) concentration is potentially unexploded, the results obtained have important implications for safety monitoring. This test contributes to the development of predictive methods to monitor and manage potential risks associated with (CH4) concentrations. The application of LSTM to (CH4) sensors not only improves prediction accuracy but also opens up opportunities for the development of safety systems that can more effectively predict and prevent potentially harmful phenomena due to methane gas.]]>
<![CDATA[Chaos CSPRNG Design As a Key in Symmetric Cryptography Using Logarithmic Functions ]]>
<![CDATA[Nathanael, Hizkia]]>;
<![CDATA[Wowor, Alz Danny]]>
<![CDATA[ Komputasi: Jurnal Ilmiah Ilmu Komputer dan Matematika Vol 21, No 1 (2024): Komputasi: Jurnal Ilmiah Ilmu Komputer dan Matematika ]]>
Publisher : <![CDATA[Ilmu Komputer, FMIPA, Universitas Pakuan ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.33751/komputasi.v21i1.9265
<![CDATA[ This research uses the logarithm function as a key component in generating random numbers in the Chaos CSPRNG framework. The main problem addressed here is the generation of keys for cryptography, recognizing the important role of cryptographic keys in safeguarding sensitive information. By using mathematical functions, specifically logarithmic functions, as a key generation method, this research explores the potential for increasing the uncertainty and strength of cryptographic keys.The proposed approach involves the systematic utilization of various mathematical functions to generate diverse and unpredictable data sets. This data set, derived from the application of logarithmic functions, serves as the basis for generating random numbers. Through a series of tests such as Randomness Test and Cryptography Test, this research shows that the data generated from these functions can be utilized effectively as a reliable source for generating random numbers, and has a low correlation value, thereby contributing to the overall security of a symmetric cryptographic system.]]>
<![CDATA[RANDOMNESS IDENTIFICATION VIA XOR REPOSITION IN LFSR A5/1'S SECOND BLOCK ]]>
<![CDATA[Pallangan, Jorghie Theodore]]>;
<![CDATA[Wowor, Alz Danny]]>
<![CDATA[ INTERNATIONAL JOURNAL ON ADVANCED TECHNOLOGY, ENGINEERING, AND INFORMATION SYSTEM Vol. 3 No. 4 (2024): NOVEMBER ]]>
Publisher : <![CDATA[Transpublika Publisher ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.55047/ijateis.v3i4.1451
<![CDATA[This study designs a random number generation method using the LFSR approach with the A5/1 scheme on three feedback functions. XOR is used as an operation in determining the value of the new bit output against the next iteration of the feedback function. Runs Test, Mono Bit, and Block bit, are used as test materials in producing random output against an input. The use of three feedback functions is used in testing, compared to previous studies that produce random numbers. In the plaintext and ciphertext encryption tests, it shows a "Very Small" correlation level with an average value approaching 0. The use of the LFSR A5/1 scheme with three XOR functions produces random output and can be used for Stream Cipher.]]>
<![CDATA[Perancangan Distribusi Hasil Produk Textil dengan Rute Terdekat dengan Algoritma Greedy ]]>
<![CDATA[Wibowo, Alvin Cahyo]]>;
<![CDATA[Wowor, Alz Danny]]>
<![CDATA[ J-SAKTI (Jurnal Sains Komputer dan Informatika) Vol 7, No 1 (2023): EDISI MARET ]]>
Publisher : <![CDATA[STIKOM Tunas Bangsa Pematangsiantar ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.30645/j-sakti.v7i1.592
<![CDATA[Delivery is one of the keys to a business because if there is no delivery, the work or flow of a business will be disrupted. The textile industry is one of many industries that really need delivery services with the closest route in order to save time. Greedy algorithm is an algorithm that is heuristic and its logical sequence is arranged based on problem solving steps that are arranged systematically. This study aims to design the distribution of textile products with the closest route using the Greedy Algorithm with a case study of CV. Karya Cahaya Lestari with the benefit of speeding up delivery times and helping drivers to save travel time. The final result of designing the distribution of textile products is in the form of a graph, specifically the Directed Graph, a map like the one in the picture basically only shows interconnected points, with a certain distance at each point..]]>
<![CDATA[Optimalisasi Database Mysql Pada Sistem Perancangan Sistem Housekeeping Transaction History Dengan Pentaho Data Integration ]]>
<![CDATA[Simanjuntak, Yohanes Albryan]]>;
<![CDATA[Wowor, Alz Danny]]>
<![CDATA[ Kesatria : Jurnal Penerapan Sistem Informasi (Komputer dan Manajemen) Vol 6, No 1 (2025): Edisi Januari ]]>
Publisher : <![CDATA[LPPM STIKOM Tunas Bangsa ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.30645/kesatria.v6i1.542
<![CDATA[The volume of transaction data in the banking industry is growing with the increase in customers and transaction complexity. Ineffi-cient data management can lead to server overload, affect system performance, and hinder the delivery of fast, accurate services. Housekeeping processes are needed to move inactive data to sepa-rate storage, allowing the main server to function more efficiently. Pentaho Data Integration (PDI) offers an effective solution for man-aging the ETL (Extract, Transform, Load) process, which is crucial for data housekeeping. This research aims to optimize the manage-ment of banking transaction data using PDI to reduce server load and improve operational efficiency. This quantitative study applies an experimental method, with the ETL process managing Bank XYZ’s transaction data older than six months. The study uses trans-action data from Bank XYZ’s MySQL server, which will be trans-ferred to a data warehouse. The analysis applies clustering algo-rithms to filter and separate active from inactive transactions. The implementation of PDI for housekeeping effectively reduces server load and improves data management efficiency, significantly lower-ing processing time. The combined use of clustering algorithms and PDI delivers substantial improvements in managing banking transac-tion data, enhancing operational efficiency while significantly re-ducing the load on the main server]]>
<![CDATA[Perancangan Distribusi Hasil Produk Textil dengan Rute Terdekat dengan Algoritma Greedy ]]>
<![CDATA[Wibowo, Alvin Cahyo]]>;
<![CDATA[Wowor, Alz Danny]]>
<![CDATA[ J-SAKTI (Jurnal Sains Komputer dan Informatika) Vol 7, No 1 (2023): EDISI MARET ]]>
Publisher : <![CDATA[STIKOM Tunas Bangsa Pematangsiantar ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.30645/j-sakti.v7i1.592
<![CDATA[Delivery is one of the keys to a business because if there is no delivery, the work or flow of a business will be disrupted. The textile industry is one of many industries that really need delivery services with the closest route in order to save time. Greedy algorithm is an algorithm that is heuristic and its logical sequence is arranged based on problem solving steps that are arranged systematically. This study aims to design the distribution of textile products with the closest route using the Greedy Algorithm with a case study of CV. Karya Cahaya Lestari with the benefit of speeding up delivery times and helping drivers to save travel time. The final result of designing the distribution of textile products is in the form of a graph, specifically the Directed Graph, a map like the one in the picture basically only shows interconnected points, with a certain distance at each point..]]>
<![CDATA[Identifikasi Nilai Acak Melalui Pemosisian Ulang Fungsi XOR di Blok Pertama LFSR A5/1 ]]>
<![CDATA[Susilo Wibowo, Ayub]]>;
<![CDATA[Wowor, Alz Danny]]>
<![CDATA[ The Indonesian Journal of Computer Science Vol. 12 No. 6 (2023): The Indonesian Journal of Computer Science (IJCS) ]]>
Publisher : <![CDATA[AI Society & STMIK Indonesia ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.33022/ijcs.v12i6.3601
<![CDATA[Skema A5/1 menggunakan linear feedback shift register (LFSR) untuk menghasilkan keacakan. Reposisi awal dari fungsi linier pertama didasarkan pada pemilihan 4 dari 19-bit menurut hukum komutatif, dengan paling banyak 60 peristiwa reposisi. Bit-bit yang dipilih ini menjalani proses iterasi fungsi XOR yang menghasilkan output bit acak maksimum. Hasil akhir dihasilkan oleh XOR yang memproses output dari setiap fungsi linier. Pengujian ekstensif dilakukan pada kemampuan algoritma untuk menghasilkan bit keluaran acak menggunakan metode perhitungan statistik seperti Runs Test, Block Bit, dan Mono Bit untuk mengukur keacakan. Hasilnya secara konsisten menunjukkan bahwa algoritma ini menghasilkan output acak untuk berbagai jenis input. Untuk mengevaluasi kemampuan enkripsi, sepuluh keluaran dipilih dan diuji tingkat korelasinya. Sembilan dari keluaran tersebut menghasilkan tingkat korelasi yang 'sangat rendah', sementara satu keluaran memiliki tingkat korelasi 'rendah'. Hasil ini mendukung keandalan desain sebagai generator kunci untuk melindungi informasi.]]>
<![CDATA[Identifikasi Nilai Keacakan Berdasarkan Reposisi Fungsi XOR Pada Blok Kedua LFSR A5/1 ]]>
<![CDATA[Pallangan, Jorghie Theodore Kenzo]]>;
<![CDATA[Wowor, Alz Danny]]>
<![CDATA[ Journal of Information System Research (JOSH) Vol 6 No 1 (2024): Oktober 2024 ]]>
Publisher : <![CDATA[Forum Kerjasama Pendidikan Tinggi (FKPT) ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.47065/josh.v6i1.6112
<![CDATA[This research plans a random number generation method using the Linear Feedback Shift Register (LFSR) method with the A5/1 scheme which involves three feedback functions. XOR is used to determine the new output bit value in the next iteration in the feedback mechanism. The test material produces random output for an input using Run Test, Mono Bit, and Block bit. Tests using three feedback functions were carried out to compare with previous research which generated random numbers. Testing of plaintext and ciphertext encryption shows a very small level of correlation with an average value close to 0. The use of LFSR with the A5/1 scheme which involves three XOR functions, creates random output and can be used against Stream Chipers.]]>
<![CDATA[Integrasi Tangga Nada Diatonis Mayor pada Kriptografi dalam Merancang Skema Transposisi ]]>
<![CDATA[Widiana, Kadek]]>;
<![CDATA[Wowor, Alz Danny]]>
<![CDATA[ JURNAL INFORMATIKA DAN KOMPUTER Vol 9, No 2 (2025): Juni 2025 ]]>
Publisher : <![CDATA[Lembaga Penelitian dan Pengabdian Masyarakat - Universitas Teknologi Digital Indonesia ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.26798/jiko.v9i2.1921
<![CDATA[Di era digital yang semakin maju, keamanan data menjadi aspek krusial yang memerlukan perhatian serius. Metode transposisi yang digunakan pada algoritma AES dan DES memiliki kerentanan pada indeks transposisinya membentuk pola dan tidak sepenuhnya acak, sehingga berpotensi memudahkan kriptanalis mencari relasi cipherteks. Penelitian ini mengeksplorasi pendekatan baru dalam merancang skema transposisi pada algoritma square transposition dengan mengintegrasikan teori musik, khususnya tangga nada diatonis mayor kedalam kotak skema. Pendekatan ini diharapkan menghasilkan pola transposisi yang unik dan lebih acak. Penelitian ini merancang kotak skema diatonis mayor sebagai acuan dalam mengatur urutan indeks dan memodifikasi tiga skema yang digunakan pada penelitian terdahulu, yaitu skema papan catur, spiral dan cermin. Pola pada ketiga skema tersebut diimplementasikan ke dalam kotak skema diatonis mayor, sehingga urutan indeks yang dihasilkan menjadi berbeda. Nilai keacakan dan korelasi yang dihasilkan pada modifikasi skema tersebut dibandingkan dengan hasil pengujian penelitian terdahulu. Diperoleh bahwa dari dua modifikasi skema tersebut menghasilkan uji keacakan dan uji korelasi yang lebih baik. Penelitian ini menunjukkan bahwa penggabungan konsep musik ke dalam algoritma square transposition merupakan pendekatan baru yang menjanjikan.]]>
