Claim Missing Document
Check
Articles

Found 3 Documents
Search

PEMANFAATAN DAN PELATIHAN PENGGUNAAN TEKNOLOGI INFORMASI DALAM PENGOLAHAN DATA INDUSTRI KULINER “ROSA CAKE” Rezania Agramanisti Azdy; Febriyanti Darnis
Aptekmas Jurnal Pengabdian pada Masyarakat Vol 2 No 3 (2019): APTEKMAS Volume 2 Nomor 3 2019
Publisher : Politeknik Negeri Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (532.343 KB) | DOI: 10.36257/apts.v2i3.1844

Abstract

Partners in the activities of the Stimulus Community Partnership Program (Program Kemitraan Masyarakat Stimulus/PKMS) is a home industry engaged in the culinary field, Rosa Cake. Rosa Cake offers products in the form of goods and services like ordering culinary products or organizing training in making food. The process of recording the order and registration of training in Rosa Cake is still done manually so that it is susceptible to data loss or damage in the recording which results in a decrease in the production process and the level of public confidence. This PKMS activity analyzes further the process of recording experienced by partners, as well as offering solutions by utilizing the use of information technology that is increasingly developing, especially in terms of system developers (developers). The data processed is the product order data and training registration organized by Rosa Cake. The research methods used adopting the system development methods that are commonly carried out, namely conducting socialization (needs analysis), system development (system design and manufacturing), training (as well as system testing), submission (sending the system to users), and evaluation (and maintenance). The results of this activity in the form of a system that can be a solution to the problem and in accordance with the needs of partners.
Implementasi Bellman-Ford untuk Optimasi Rute Pengambilan Sampah di Kota Palembang Rezania Agramanisti Azdy; Febriyanti Darnis
Jurnal Nasional Teknik Elektro dan Teknologi Informasi Vol 8 No 4: November 2019
Publisher : Departemen Teknik Elektro dan Teknologi Informasi, Fakultas Teknik, Universitas Gadjah Mada

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1292.273 KB)

Abstract

The problem of waste in big cities in Indonesia is still the main focus of the related department. Generally, the problem is the lack of garbage transport facilities that can beused to transport waste from the temporary shelter (Tempat Penampungan Sementara, TPS) to the final processing site (Tempat Pemrosesan Akhir, TPA). This lack of garbage transport makes the garbage contained in TPS not fully transportable to TPA due to limited capacity and operational time of the relatedservice. In overcoming this problem, optimization of garbage transport facility utilization can be carried out to optimize the capacity of the garbage transported by finding the shortest path that can be traversed by the garbage transporter. This paper aims to apply the Bellman-Ford algorithm for determining waste collection routes. The Bellman-Ford algorithm allows a negative weighting for its edge value, so that it can anticipate the possible costs to be incurred in the selection of the garbage collection path. The stages of this paper were data requirements analysis, design, implementation, and testing. The results of the study are trajectories with a minimum cost from the origin location to the destination location, although it does not pass through all TPS that must be visited.
Tanda tangan Digital Menggunakan Algoritme Keccak dan RSA Rezania Agramanisti Azdy
Jurnal Nasional Teknik Elektro dan Teknologi Informasi Vol 5 No 3: Agustus 2016
Publisher : Departemen Teknik Elektro dan Teknologi Informasi, Fakultas Teknik, Universitas Gadjah Mada

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1498.935 KB)

Abstract

Just like conventional signatures, digital signatures can be used to prove the authenticity of a document in digital form. In addition, digital signatures can also be used to prove the validity of the author of the document, so that the author of the document can not deny that he had made the document. Digital signature is done by applying two cryptographic algorithms sequentially. The first algorithm is to impose hash function on a real document to produce message digest, and the second one is to impose a public key algorithm to the digest form. Keccak hash function is an algorithm that has been set as SHA-3 in a competition held by NIST and can be used to determine if a document has been modified or not. RSA is a public key algorithm which ensures the safety in the form of authentication and non-repudiation, so it is suitable with the actual purpose of digital signature. This paper implements the Keccak and RSA algorithm on digital signature as well as comparing it with the use of MD5. The test results of the implementation of both algorithms show that the establishment of digital signature on a whole process requires a relatively short time, and it is able to achieve the goals of digital signatures to guarantee the security in the aspects of integrity, authentication and non-repudiation.