Claim Missing Document
Check
Articles

Found 17 Documents
Search

IMPLEMENTASI STEGANOGRAFI DENGAN METODE END OF FILE PADA TEKS YANG TERENKRIPSI MENGGUNAKAN BLOCK CIPHER RIVEST CODE-6 KE DALAM CITRA Andrew Chandra; Willy Sudiarto Raharjo; Junius Karel Tampubolon
Jurnal Informatika Vol 11, No 1 (2015): Jurnal Teknologi Komputer dan Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (10165.31 KB) | DOI: 10.21460/inf.2015.111.420

Abstract

Datas or informations are very important assets nowdays, that is why we have to keep it safe so it will not fall into one who is do not have rights. There are several methods to maintain the confidentiality of datas/informations, which are cryptography and steganography. By using cryptographic Rivest Code-6 algorithm then the datas/informations is converted into a form that cannot be undestood, and then steganographic End of File algorithm the datas/informations is inserted into another media so that ordinaary people do not know the existence of the datas/informations. The results of this research tell that by using both algorithms the secret datas/informations can be hidden and read back properly. In addition there will be increase in file size reservoirs, where the increase in dependent on the size of the secret datas/informations and file size of the reservoir, while the length of the key to be isnerted into reservoir will remain  at 16 bytes.
SUBSTRAKSI BACKGROUND DAN DETEKSI BAYANGAN PADA CITRA GRAYSCALE SEKUENSIAL Binarahandra R.E; Widi Hapsari; Junius Karel Tampubolon
Jurnal Informatika Vol 7, No 2 (2011): Jurnal Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (986.098 KB) | DOI: 10.21460/inf.2011.72.104

Abstract

Ekstraksi objek pada suatu citra grayscale dengan background yang tidak tetap merupakan hal yang rumit sehingga membutuhkan pendekatan dengan computer vision. Penelitian ini menerapkan proses substraksi background dan deteksi bayangan untuk mendapatkan bentuk dari objek yang diinginkan. Proses substraksi bayangan membutuhkan background model yang diperoleh dari pengolah citra sekuensial input dari pengguna. Tujuan dari background model ini adalah untuk menentukan pengelompokan piksel sebagai background atau sebagai objek. Proses deteksi bayangan akan mengkalkulasikan nilai piksel objek dengan background model menggunakan normalized cross-correlation (NCC) untuk melihat apakah nilai objek adalah suatu penguatan nilai dari background model yang menandakan piksel tersebut adalah bayangan. Penelitian ini akan mengimplementasikan metode tersebut dan menganalisa hasil serta pengaruh input pengguna untuk mendapatkan hasil substraksi background dan deteksi bayangan yang optimal. Kata kunci : computer vision, substraksi background, deteksi bayangan
Inovasi Pembelajaran Logika-Simbolik melalui Aplikasi DUTAlogic bagi Siswa Tunarungu Antonius Rachmat Chrismanto; Matahari Bhakti Nendya; Junius Karel Tampubolon; R Gunawan Santosa; Wayan Edi Sudarma; Handi Hermawan
Jurnal Pendidikan (Teori dan Praktik) Vol 5 No 1 (2020): Volume 5, Nomor 1, April 2020
Publisher : Fakultas Ilmu Pendidikan Universitas Negeri Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (752.128 KB) | DOI: 10.26740/jp.v5n1.p%p

Abstract

Logic is an analysis of methods of thinking. Logic emphasizes the form more than the content of  arguments. mathematical logic is often also called the symbolic-logic is a part of mathematics that explores the application of formal logic to mathematics. This has a close relationship with the basic fundamental thinking of mathematics and theoretical computer science.In this research we do three important things, the first is conventional symbolic-logic training for SLB Negeri 1 Bantul. The second step is making of symbolic-logic learning application for deaf students called DUTAlogic and the third is seeing the comparison between conventional learning and learning using the DUTAlogic.Based on data analysis that was done. Thar result show that increase in symbolic logic ability (T) is 50%, increase in the ability of symbolic natural accuracy (N) is 50%. The used of DUTAlogic application is more attractive to deaf students because they feel happier, easier, more-understanding, more concentrated and more creative when doing symbolic-logic learning.
Pelatihan Cara Berpikir Simbolik-Matematik di SMA BOPKRI 2 Yogyakarta Santosa, Raden Gunawan; Tampubolon, Junius Karel
International Journal of Community Service Learning Vol. 4 No. 1 (2020): February 2020
Publisher : Universitas Pendidikan Ganesha

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (644.099 KB) | DOI: 10.23887/ijcsl.v4i1.23099

Abstract

Symbolic-Mathematical Thinking is a technique of thinking to solve mathematical problems. This technique is the result of a combination of Symbolic Logic and Mathematics. In general there are three symbolic logic activities that are applied to Mathematics, namely reading symbols, logical equivalents and logical implications.                 This Pengabdian kepada Masyarakat (PkM)  has activities to train Symbolic-Mathematical  thinking using 15 strategies for BOPKRI 2 high school students.                 The results of this training are three important things. The first result is the type of problem that is most difficult for students to face is the type of problem that requires drawing conclusions that refer to standard mathematical definitions. The second thing is for the type of use of model settlement strategies in a system and the type of seeing patterns, students tend to be able to solve problems after being given instructions on how the model fits the problem and the pattern the problem has. Whereas the third is from two groups of students the class turns out that the continuous class attending the training gets more symbolic-mathematical thinking skills improvement than the other classes.
ESENSI DAN PROSES PEMBUKTIAN EKUIVALENSI LOGIS MENGGUNAKAN SIMBOL LINGKARAN PUTIH DAN LINGKARAN HITAM Tampubolon, Junius Karel; Santosa, Raden Gunawan
JUPIKA: JURNAL PENDIDIKAN MATEMATIKA Vol. 8 No. 1 (2025): Volume 8 Nomor 1 Maret 2025
Publisher : Program Studi Pendidikan Matematika

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37478/jupika.v8i1.5368

Abstract

The essence of the equivalence of P and Q is a condition that shows that P and Q have the same meaning based on the established reference. Achieving equivalence between P and Q involves transforming the form of P into Q while consistently obeying the established reference. The process of transforming P into Q using the symbols white circle and black circle while maintaining their equivalence is known as the equivalence step. The essence of logical equivalence steps are simplification, substitution and construction. The purpose of this study is to explore the process of the equivalence step more deeply to simplify the expression of propositions and ensure that the meaning of the symbols remains consistent and does not change the meaning of its original context after the equivalence step is carried out. The method used in this study has four stages, namely the preparation of equivalence guidelines, the development of problem-solving questions, simulation experiments, and the last is error evaluation. This study concludes that errors in the equivalence step often occur due to misunderstandings in the use of logical relationships such as "and," "or," and "if-then." Furthermore, incorrect equivalence steps can also occur due to inconsistent steps, steps that do not follow the rules of precedent, and steps that result in contradictions.
PERBANDINGAN TIGA ALGORITMA PEWARNAAN GRAF DALAM MEWARNAI GAMBAR MOZAIK GEOMETRIS Raden Gunawan Santosa; Junius Karel Tampubolon
Epsilon: Jurnal Matematika Murni dan Terapan Vol 19, No 2 (2025)
Publisher : Mathematics Study Program, Faculty of Mathematics and Natural Sciences, Lambung Mangkurat

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20527/epsilon.v19i2.16712

Abstract

This study compares three graph coloring algorithms (Greedy, Welch–Powell (WP), and Marble–Matula–Isaacson (MMI)) applied to geometric mosaic images in the form of undirected graphs. Each vertex represents a region in the image, while edges connect neighboring regions. Two graphs are used as research objects, namely graph (a) with |V(GA)| = 56, |E(GA)| = 96, D(GA) = 0.062234, δ(GA) = 2, Δ(GA) = 7, and graph (b) with |V(GB)| = 55, |E(GB)| = 115, D(GB) = 0.0174, δ(GB) = 3, Δ(GB) = 6. The three algorithms are tested through 15 experiments to minimize the number of colors so that no two neighboring vertices have the same color. The Wilcoxon Rank-Sign statistical test shows that WP and MMI are significantly more efficient than Greedy, with p-values of 0.0006269 and 0.01073 (<0.05), respectively. The theoretical reason why the Greedy algorithm is not optimal compared to the other two algorithms is because the Greedy algorithm colors the vertices according to the input order without a vertex selection strategy based on degree or graph structure. These results confirm that WP and MMI are able to approach the theoretical limit of planar graph coloring as stated by the Four Color Theorem, which states that every planar graph can be colored with no more than four colors.
UNIFIKASI JALUR TRANSFORMASI DAN SIFAT SIKLIS DARI VARIABEL ACAK RUMPUN DISTRIBUSI KONTINU: DARI NORMAL HINGGA t-STUDENT Raden Gunawan Santosa; Junius Karel Tampubolon
Epsilon: Jurnal Matematika Murni dan Terapan Vol 20, No 1 (2026)
Publisher : Mathematics Study Program, Faculty of Mathematics and Natural Sciences, Lambung Mangkurat

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20527/epsilon.v20i1.19139

Abstract

Probability distributions serve as the cornerstone of inferential statistics, yet the mathematical proofs of their genealogical relationships are frequently presented fragmentedly using inconsistent methodologies in academic literature. This study aims to reconstruct and unify the transformation pathways of major continuous probability distributions—comprising Standard Normal, Chi-Square, Gamma , Beta , F-Snedecor (F), and t-Student into a single, cohesive theoretical framework. The analytical derivation relies on the rigorous application of multistage bivariate Jacobian matrix transformations and asymptotic analysis, thereby eliminating dependency on Moment Generating Functions (MGF) which often fail to converge within specific parameter spaces. The results demonstrate that this transformation chain does not merely form a one-way linear trajectory, but rather a cyclic (circular) conceptual structure. The Standard Normal distribution acts as the origin that derives Chi-Square, Gamma, Beta, and F, before culminating in the t-distribution. Furthermore, through asymptotic limit proofs as the degrees of freedom approach infinity, the probability density function of the t-Student distribution mathematically converges back into the Standard Normal distribution, perfectly closing the genealogical loop. The theoretical contribution of this study clarifies the underlying mathematical assumptions, eliminating the "black-box" perspective on t-tests, ANOVA, and Chi-Square tests, while providing a computational foundation for optimizing random number generator algorithms in stochastic simulations.