Article Per Year (5 Year)
p-Index From 2021 - 2026
0.61
P-Index
This Author published in this journals
All Journal Jurnal Ilmiah Matrik Komputasi: Jurnal Ilmiah Ilmu Komputer dan Matematika International Journal of Applied Sciences and Smart Technologies Pattimura Proceeding : Conference of Science and Technology
Ricky Aditya
Universitas Sanata Dharma
Agriculture, Biological Sciences & Forestry Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Energy Engineering Industrial & Manufacturing Engineering Materials Science & Nanotechnology Mathematics Physics

Published : 5 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 5 Documents
Search

 1 
ELEMEN IDEMPOTEN DI GELANGGANG Z_n DAN KAITANNYA DENGAN HOMOMORFISMA GELANGGANG Ricky Aditya; Maria Vianney Any Herawati
KOMPUTASI Vol 18, No 1 (2021): Komputasi: Jurnal Ilmiah Ilmu Komputer dan Matematika
Publisher : Ilmu Komputer, FMIPA, Universitas Pakuan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33751/komputasi.v18i1.2326

Abstract

Homomorfisma gelanggang merupakan salah satu topik yang dipelajari dalam perkuliahan aljabar abstrak untuk jenjang S1. Definisi dari homomorfisma gelanggang merupakan perluasan dari definisi homomorfisma grup, dengan sifat “mengawetkan struktur” berlaku untuk kedua operasi binernya. Karena aksiomanya lebih banyak, akan lebih sulit untuk mencari contoh-contoh dari homomorfisma gelanggang daripada contoh-contoh homomorfisma grup. Dalam makalah ini akan dikaji suatu karakterisasi dari homomorfisma gelanggang untuk kasus spesifik dari Z_m ke Z_n, yang ternyata berkaitan erat dengan elemen idempoten di gelanggang Z_n. Karakterisasi lebih detail untuk berbagai macam kemungkinan keterkaitan antara nilai m dan n juga akan dipaparkan. Dengan menggunakan karakterisasi-karakterisasi tersebut, akan lebih mudah bagi para dosen pengampu mata kuliah aljabar abstrak dalam memberikan contoh-contoh homomorfisma gelanggang.
Identity Graph of Finite Cyclic Groups Maria Vianney Any Herawati; Priscila Septinina Henryanti; Ricky Aditya
International Journal of Applied Sciences and Smart Technologies Volume 03, Issue 01, June 2021
Publisher : Universitas Sanata Dharma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24071/ijasst.v3i1.3256

Abstract

This paper discusses how to express a finite group as a graph, specifically about the identity graph of a cyclic group. The term chosen for the graph is an identity graph, because it is the identity element of the group that holds the key in forming the identity graph. Through the identity graph, it can be seen which elements are inverse of themselves and other properties of the group. We will look for the characteristics of identity graph of the finite cyclic group, for both cases of odd and even order.
Measuring privacy leakage in term of Shannon entropy Ricky Aditya; Boris Skoric
International Journal of Applied Sciences and Smart Technologies Volume 01, Issue 02, December 2019
Publisher : Universitas Sanata Dharma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24071/ijasst.v1i2.1882

Abstract

Differential privacy is a privacy scheme in which a database is modified such that each users personal data are protected without affecting significantly the characteristics of the whole data. Example of such mechanism is Randomized Aggregatable Privacy-Preserving Ordinal Response (RAPPOR). Later it is found that the interpretations of privacy, accuracy and utility parameters in differential privacy are not totally clear. Therefore in this article an alternative definition of privacy aspect are proposed, where they are measured in term of Shannon entropy. Here Shannon entropy can be interpreted as number of binary questions an aggregator needs to ask in order to learn information from a modified database. Then privacy leakage of a differentially private mechanism is defined as mutual information between original distribution of an attribute in a database and its modified version. Furthermore, some simulations using the MATLAB software for special cases in RAPPOR are also presented to show that this alternative definition does make sense.
Application of MDS Codes in Solving Problem of Distributing Exam Questions Ricky Aditya
Pattimura Proceeding 2023: Prosiding KNM XXI
Publisher : Pattimura University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/PattimuraSci.2023.KNMXXI.9-16

Abstract

In online learning, giving an objective assessment is quite tricky task. Most of exams in online learning are done as take-home exams. Unlike in face-to-face onsite class, in which the students can be observed directly when doing the exam, in online class the students have chance to cheat and work together to gain unfair advantage. To tackle this, the teachers need to modify the exam format. One possible solution is to create some variations of exam questions and distribute them to the students such that they do not get the same set of questions. However, we cannot create too many variations since it would make the grading process more difficult for the teacher. Thus, we need to find an optimal way to do so. In this article, we will discuss how Maximum Separable Distance (MDS) Codes in coding theory can be applied to provide a solution for this problem. Moreover, distribution patterns for class of size 27, 64 and 125 students will also be presented.
ALGORITMA “HANCURKAN SEMUA SIKEL” UNTUK MENENTUKAN POHON PERENTANG MINIMUM DARI SUATU GRAF BERBOBOT Ricky Aditya
Jurnal Ilmiah Matrik Vol 21 No 2 (2019): Jurnal Ilmiah Matrik
Publisher : Direktorat Riset dan Pengabdian Pada Masyarakat (DRPM) Universitas Bina Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33557/jurnalmatrik.v21i2.571

Abstract

The minimum spanning tree is one of the applications of graph theory in various fields. There are several algorithms for determining the minimum spanning tree of a weighted graph, such as Kruskal's algorithm and Prim's algorithm. These two algorithms are not really easy to teach to students in general. Therefore in this paper presented an alternative algorithm called the algorithm "Destroy All Sikel", which is more intuitive and easier to understand. Furthermore, there are also examples of implementation and comparison with two other algorithms.
Co-Authors Boris Skoric Maria Vianney Any Herawati Priscila Septinina Henryanti