Garuda - Garba Rujukan Digital

OPTIMIZATION OF LEARNING MANAGEMENT SYSTEM BASED ON DIGITAL MODULES IN POST- COVID -19 PANDEMIC DIFFERENTIAL CALCULUS COURSES Entit Puspita; Ririn Sispiyati; Cece Kustiawan
Jurnal Pengajaran MIPA Vol 27, No 2 (2022): JPMIPA: Volume 27, Issue 2, 2022
Publisher : Faculty of Mathematics and Science Education, Universitas Pendidikan Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18269/jpmipa.v27i2.52225

This study aims to describe the experiences experienced by students regarding optimizing the use of digital module-based LMS in post-pandemic differential calculus lectures. This study's qualitative descriptive method was chosen and involved 46 third-semester students at one of the tertiary institutions in Indonesia who have experienced online and offline classes. Questionnaire and interview data analysis was carried out through identification, clarification, reduction, analysis, and description techniques according to the problem under study. The study results show that the sudden shift from face-to-face to online learning has positive aspects in the form of documentation of lecture activities and presentation of digital-based and varied lecture content. The learning videos were most in demand by the participants because they had advantages over other displays. The weaknesses in implementing online lectures are more technically related (internet or electricity network stability). The positive things detected from online courses can be followed up after the pandemic, especially in the development of LMS content which can be integrated into face-to-face classes

E-Cordial Labeling for Cupola Graph Cu(3, b, n) Yulianti, Kartika; Rokhmatillah, Fitri; Sispiyati, Ririn
InPrime: Indonesian Journal of Pure and Applied Mathematics Vol 4, No 1 (2022)
Publisher : Department of Mathematics, Faculty of Sciences and Technology, UIN Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/inprime.v4i1.24210

Graph labeling is a map that maps graph elements such as vertices, edges, vertices, and edges to a set of numbers. A graph labeling is named e-cordial if there is a binary mapping f:E(G)→{0,1} which induces the vertex labeling defined by g(v)=Ʃ_{uvϵE(G)}f(uv)(mod 2), so that it satisfies the absolute value of the difference between the number of vertices labeled 1 and the number of vertices labeled 0 is less than equal to 1, and also for the number of edges labeled 0 and labeled 1. A graph that admits the e-cordial labeling is called an e-cordial graph. In this paper, we proved that some of the cupola graph Cu(3,b,n) is e-cordial.Keywords: E-Cordial Labeling; E-Cordial Graph; Cupola Graph Cu(a, b, n). AbstrakPelabelan graf merupakan pemetaan yang memetakan unsur-unsur graf seperti simpul, sisi, simpul dan sisi ke himpunan bilangan. Sebuah pelabelan dinamakan pelabelan e-cordial jika terdapat pemetaan biner f:E(G)→{0,1} yang menginduksi pelabelan simpul yang didefinisikan g(v)=Ʃ_{uvϵE(G)}f(uv)(mod 2) sehingga nilai mutlak dari selisih banyaknya simpul yang dilabeli 1 dan banyaknya simpul yang dilabeli 0 kurang dari sama dengan 1, dan nilai mutlak dari selisih banyaknya sisi yang dilabeli 1 dan banyaknya sisi yang dilabeli 0 kurang dari sama dengan 1. Sebuah graf yang dapat dilabeli secara e-cordial dinamakan graf e-cordial. Pada makalah ini dibuktikan bahwa beberapa graf kubah Cu(3,b,n) adalah e-cordial.Kata Kunci : Pelabelan E-Cordial; Graf E-Cordial; Graf Kubah Cu(a, b, n).

Penggabungan Affine Cipher dan Least Significant Bit-2 untuk Penyisipan Pesan Rahasia pada Gambar Kurniasih, Firda; Marwati, Rini; Sispiyati, Ririn
Jurnal EurekaMatika Vol 11, No 2 (2023): Jurnal Eurekamatika
Publisher : Universitas Pendidikan Indonesia (UPI)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17509/jem.v11i2.62115

As technology develops, improving message security is very important. One approach that can be taken to improve message security is to combine cryptography and steganography. In this study, the authors combined Affine Cipher cryptographic and Least Significant Bit-2 (LSB-2) steganography. In this merge method, the Affine Cipher cryptography is applied first, then, the encrypted message is inserted into an image using LSB-2. Specifically, LSB-2 is a modification of the Least Significant Bit (LSB) method which works by exchanging the sixth bits of each pixel color element in the image with the bits of the secret message. The LSB-2 used is a random LSB-2. In this case, the random numbers are generated by the Pseudo Random Number Generator (PRNG). The results of this research are a computer application with the Python language version 3.11 which can disguise messages and insert them in an image. Based on the implementation, the combination Affine Cipher and LSB-2 can complicate cryptanalysis because it has to hack two algorithms and the message is hidden randomly in an image.Keywords: Affine Cipher, Cryptography, LSB-2, Message Security, Steganography. AbstrakSeiring berkembangnya teknologi, peningkatan keamanan pesan menjadi sangat penting. Salah satu pendekatan yang dapat dilakukan untuk meningkatkan keamanan pesan adalah dengan menggabungkan kriptografi dan steganografi. Pada penelitian ini, penulis melakukan penggabungan antara teknik kriptografi Affine Cipher dan steganografi Least Significant Bit-2 (LSB-2). Dalam metode penggabungan ini, keamanan pesan dilakukan dengan menerapkan kriptografi Affine Cipher terlebih dahulu. Kemudian, pesan yang telah dienkripsi disisipkan ke dalam citra menggunakan LSB-2. Lebih spesifiknya, LSB-2 merupakan modifikasi dari metode Least Significant Bit (LSB) dengan menukarkan bit ke enam dari setiap elemen warna pixel pada gambar dengan bit-bit dari pesan rahasia yang ingin disembunyikan. LSB-2 yang digunakan merupakan LSB-2 secara acak. Bilangan acak yang diperlukan dalam proses ini dihasilkan melalui Pseudo Random Number Generator (PRNG). Hasil penelitian ini berupa aplikasi komputer dengan bahasa pemrograman Python versi 3.11 yang dapat menyamarkan pesan dan menyisipkannya dalam gambar. Berdasarkan implementasi, diperoleh hasil bahwa penggabungan Affine Cipher dan LSB-2 dapat mempersulit kriptanalisis karena harus meretas dua algoritma dan pesan disembunyikan secara acak keberadaannya di dalam gambar.

Implementasi QR Code dengan Algoritma SHA-256 dan RSA yang Ditingkatkan untuk Autentikasi Dokumen Digital Az-Zahra, Fatimah; Marwati, Rini; Sispiyati, Ririn
Jurnal EurekaMatika Vol 12, No 1 (2024): Jurnal EurekaMatika
Publisher : Universitas Pendidikan Indonesia (UPI)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17509/jem.v12i1.67161

Digital technology is developing very rapidly, including document digitization. With the shift in the form of documents, wet signatures have also shifted to electronic signatures. During the distribution process of digital documents, there is no guarantee that the contents of the document are not modified by other parties, so a tool is needed to authenticate the authenticity of the document. Cryptography can be a solution, especially asymmetric key cryptography. The Rivest-Shamir-Adleman (RSA) algorithm is a type of asymmetric cryptography with security that lies in the integer factoring problem. To speed up the encryption and decryption process, an improved RSA is used by adding one prime number to the key generation process. In addition to asymmetric key cryptography, there is one function that is useful in creating electronic signatures, which is the hash function. The combinations of the RSA algorithm and the SHA-256 hash function can be one solution for digital document authentication. In addition, the addition of a QR Code can also make it easier to sign and check the authenticity of documents.Keywords: Document Authentication, Electronic Signature, Enhanced RSA, QR Code, SHA-256. AbstrakTeknologi menjadi salah satu bidang yang berkembang dengan sangat pesat saat ini dan membuat banyak hal didigitalisasi, salah satunya adalah dokumen. Dengan adanya peralihan bentuk dokumen, tanda tangan basah juga beralih menjadi tanda tangan elektronik. Selama proses distribusi dokumen digital, tidak ada jaminan bahwa isi dokumen tidak dimodifikasi oleh pihak lain sehingga diperlukan alat untuk melakukan autentikasi keaslian dokumen. Ilmu kriptografi dapat menjadi solusi, khususnya kriptografi kunci asimetri. Algoritma Rivest-Shamir-Adleman (RSA) adalah jenis kriptografi asimetri dengan keamanan yang terletak pada masalah pemfaktoran bilangan bulat. Untuk mempercepat proses enkripsi dan dekripsi, digunakan RSA yang ditingkatkan dengan cara menambahkan satu bilangan prima pada proses pembangkitan kunci. Selain kriptografi kunci asimetri, terdapat satu fungsi yang berguna dalam pembuatan tanda tangan elektronik, yaitu fungsi hash. Penggabungan algoritma RSA dan fungsi hash jenis SHA-256 dapat menjadi salah satu solusi untuk autentikasi dokumen digital. Selain itu, adanya penambahan QR Code juga dapat lebih mempermudah dalam proses penandatanganan dan pemeriksaan keaslian dokumen.

PENENTUAN LINTASAN OPTIMAL DISTRIBUSI BARANG MENGGUNAKAN HYPERGRAPH - PARTITIONING DAN ALGORITMA GENETIKA Sadiyyah, Fitriani Halimatus; Yulianti, Kartika; Sispiyati, Ririn
Jurnal Ilmiah Matematika dan Pendidikan Matematika Vol 16 No 2 (2024): Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Publisher : Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20884/1.jmp.2024.16.2.13545

Efficient distribution of goods is critical in logistics management, which requires the selection of optimal distribution paths to achieve delivery targets with minimal total distance. This research combines Hypergraph-Partitioning and genetic algorithm to determine the optimal distribution path of goods to several customers. The Hypergraph-Partitioning divides the goods to be distributed equally to several vehicles, while the genetic algorithm is applied to determine the best distribution path in each partition. The results showed that the Hypergraph-Partitioning method successfully divided 62 customers into two partitions. The first partition serves 31 customers with a total demand of 865 loaves of bread, while the second partition also serves 31 customers with a total demand of 1,035 loaves of bread. The genetic algorithm was then used to find the shortest path for each partition, resulting in an efficient distribution solution.

Teaching and learning process for mathematization activities: The case of solving maximum and minimum problems Jupri, Al; Usdiyana, Dian; Sispiyati, Ririn
JRAMathEdu (Journal of Research and Advances in Mathematics Education) Volume 6 Issue 2 April 2021
Publisher : Lembaga Pengembangan Publikasi Ilmiah dan Buku Ajar, Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23917/jramathedu.v6i2.13263

One of the topics within the course of Essential Concepts in School Mathematics (ECSM) for prospective mathematics teachers concerns maximum and minimum problems. This type of problems requires mathematization, i.e., the activity of transforming a problem into a symbolic mathematics problem and of reorganizing within the mathematical system, in the solution process. This research aims to investigate the implementation of the learning and teaching process of the ECSM course that strengthen prospective mathematics teachers’ conceptual understanding and problem solving abilities through mathematization activities. To reach this aim, this qualitative study was conducted through an observation of the learning and teaching process, including the formative written assessment, for the case of maximum and minimum problems, involving 19 students of mathematics education program. The results of this study revealed that the learning and teaching process is implemented by emphasizing the use of a deductive approach. The written assessment showed students’ strategies and difficulties in dealing with maximum and minimum problems. Main difficulties included constructing visual representations and mathematical models in the mathematization processes. It can be concluded that the learning and teaching processes of the ECSM course need to be improved so as to develop better conceptual understanding and problem solving abilities through mathematization activities.

An investigation of students’ algebraic proficiency from a structure sense perspective Jupri, Al; Sispiyati, Ririn; Chin, Kin Eng
Journal on Mathematics Education Vol. 12 No. 1 (2021): Journal on Mathematics Education
Publisher : Universitas Sriwijaya in collaboration with Indonesian Mathematical Society (IndoMS)

Show Abstract | Download Original | Original Source | Check in Google Scholar

Structure sense can be interpreted as an intuitive ability towards symbolic expressions, including skills to perceive, to interpret, and to manipulate symbols in different roles. This ability shows student algebraic proficiency in dealing with various symbolic expressions and is considered important to be mastered by secondary school students for advanced study or professional work. This study, therefore, aims to investigate students’ algebraic proficiency in terms of structure sense. To reach this aim, we set up a qualitative case study with the following three steps. First, after conducting a literature study, we designed structure sense tasks according to structure sense characteristics for the topic of equations. Second, we administered an individual written test involving 28 grade XI students (16-17 year-old). Third, we analyzed students’ written work using a structure sense perspective. The results showed that about two-thirds of the participated students lack of structure sense in which they tend to use more procedural strategies than structure sense strategies in solving equations. We conclude that the perspective of structure sense provides a fruitful lens for assessing students’ algebraic proficiency.

Best Practices for Implementing the Case Method and Team-Based Project Models: Efforts to Fulfill Higher Education Key Performance Indicators Puspita, Entit; Sispiyati, Ririn; Agustina, Fitriani
QALAMUNA: Jurnal Pendidikan, Sosial, dan Agama Vol. 17 No. 1 (2025): Qalamuna - Jurnal Pendidikan, Sosial, dan Agama
Publisher : Lembaga Penerbitan dan Publikasi Ilmiah Program Pascasarjana IAI Sunan Giri Ponorogo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37680/qalamuna.v17i1.6362

This study describes the best practices of implementing case methods and team-based projects in Consulting Project lectures related to achieving Higher Education Key Performance Indicators (KPI-HE). The study used a qualitative descriptive method to describe and depict the best practices of implementing case method and team-based project models in Consulting Project lectures. The research participants were 82 students taking consulting project lectures in the Mathematics Study Program. The case method and team-based project models were carried out simultaneously in lectures, directly confronting students with real problems, challenging students to develop creativity and critical thinking in determining various alternative solutions. The creation of various alternative solutions to partner issues and the formal signing of the Cooperation Agreement between the study program and partners prove that the consulting project lecture supports the achievement of the study program's KPI, especially KPI 6 related to partnerships and KPI 7 related to collaborative participatory classes. The best practices reported in this study will contribute to the study program in improving the quality of learning and, in general, in revising the curriculum, especially for courses aimed at training students to become part of the world of work and industry.

E-Cordial Labeling for Cupola Graph Cu(3, b, n) Yulianti, Kartika; Rokhmatillah, Fitri; Sispiyati, Ririn
InPrime: Indonesian Journal of Pure and Applied Mathematics Vol. 4 No. 1 (2022)
Publisher : Department of Mathematics, Faculty of Sciences and Technology, UIN Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/inprime.v4i1.24210

Graph labeling is a map that maps graph elements such as vertices, edges, vertices, and edges to a set of numbers. A graph labeling is named e-cordial if there is a binary mapping f:E(G)→{0,1} which induces the vertex labeling defined by g(v)=Ʃ_{uvϵE(G)}f(uv)(mod 2), so that it satisfies the absolute value of the difference between the number of vertices labeled 1 and the number of vertices labeled 0 is less than equal to 1, and also for the number of edges labeled 0 and labeled 1. A graph that admits the e-cordial labeling is called an e-cordial graph. In this paper, we proved that some of the cupola graph Cu(3,b,n) is e-cordial.Keywords: E-Cordial Labeling; E-Cordial Graph; Cupola Graph Cu(a, b, n). AbstrakPelabelan graf merupakan pemetaan yang memetakan unsur-unsur graf seperti simpul, sisi, simpul dan sisi ke himpunan bilangan. Sebuah pelabelan dinamakan pelabelan e-cordial jika terdapat pemetaan biner f:E(G)→{0,1} yang menginduksi pelabelan simpul yang didefinisikan g(v)=Ʃ_{uvϵE(G)}f(uv)(mod 2) sehingga nilai mutlak dari selisih banyaknya simpul yang dilabeli 1 dan banyaknya simpul yang dilabeli 0 kurang dari sama dengan 1, dan nilai mutlak dari selisih banyaknya sisi yang dilabeli 1 dan banyaknya sisi yang dilabeli 0 kurang dari sama dengan 1. Sebuah graf yang dapat dilabeli secara e-cordial dinamakan graf e-cordial. Pada makalah ini dibuktikan bahwa beberapa graf kubah Cu(3,b,n) adalah e-cordial.Kata Kunci : Pelabelan E-Cordial; Graf E-Cordial; Graf Kubah Cu(a, b, n).

Model Matematika Penjadwalan Obat Kemoterapi Kanker secara Optimal Menggunakan Non-dominated Sorting Genetic Algorithm-II (NSGA-II) Ashilah Azmii, Yusyifa; Yulianti, Kartika; Sispiyati, Ririn
Jurnal Fourier Vol. 14 No. 1 (2025)
Publisher : Program Studi Matematika Fakultas Sains dan Teknologi UIN Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14421/fourier.2025.141.45-55

In this study, a mathematical model for cancer chemotherapy drug scheduling was developed, which is the problem of scheduling drugs given to patients. The mathematical model developed has an objective function of reducing cancer cells while reducing toxicity in the patient's body, with constraints in the form of limits for the number of healthy cells, cancer cells, drug concentration, and patient toxicity. The influential and interrelated variables are arranged in a system of differential equations consisting of the number of healthy cells, number of cancer cells, drug dose, drug concentration, patient toxicity and drug effect, which describes the chemotherapy of non-specific cancer cell cycles. Optimal solution was obtain numerically using Runge-Kutta Method and Non-dominated Sorting Genetic Algorithm-II (NSGA-II). The results showed that this algorithm was able to produce a solution with an optimal dosing schedule every 8 days for 106 days with 14 drug doses. Doses ranged from 20.00 to 29.55 mg/m² with an average of 24.28 mg/m² and a standard deviation of 3.64 mg/m² so as to minimize the number of cancer cells and damage to healthy cells.

Title

Found 31 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 31 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 31 Documents
Search