cover
Contact Name
Anggri Sartika Wiguna
Contact Email
jurnal_smartics@unikama.ac.id
Phone
-
Journal Mail Official
jurnal_smartics@unikama.ac.id
Editorial Address
-
Location
Kota malang,
Jawa timur
INDONESIA
SMARTICS Journal
ISSN : -     EISSN : 24769754     DOI : -
SMARTICS Journal's aims is to disseminate research on applied computer science or information technology by publishing the original articles. The scope of SMARTICS are electrical, electronics, controls, information system, and applied technology.
Arjuna Subject : -
Articles 6 Documents
Search results for , issue "Vol 7 No 1: SMARTICS Journal (April 2021)" : 6 Documents clear
Hasil Pengujian Aplikasi Permainan Pada Anak Usia 7-11 Tahun Untuk Meningkatkan Konsentrasi Dimas Wahyu Wibowo; Pramana Yoga Saputra; Eka Larasati Amalia
SMARTICS Journal Vol 7 No 1: SMARTICS Journal (April 2021)
Publisher : Universitas PGRI Kanjuruhan Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21067/smartics.v7i1.4782

Abstract

Research on the results of testing game applications in children aged 7-11 years aims to determine how to improve concentration skills. By using a children's concentration-enhancing game application, data will be collected using the results of the points obtained from each child who plays the game. These points are used as statistical calculations. These statistics are used to determine the comparison of the level of concentration in each game that has been carried out as an independent evaluation for children
Configuration and Analysis Link-State Open Shortest Path First Routing Performance Multi-Area Nur Hayati; Ratih Titi Komala Sari; Dede Wandi
SMARTICS Journal Vol 7 No 1: SMARTICS Journal (April 2021)
Publisher : Universitas PGRI Kanjuruhan Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21067/smartics.v7i1.5009

Abstract

Open Shortest Path First (OSPF) is a routing protocol that uses a link-state algorithm to build and calculate the best path to all known destinations. The link-state algorithm is also known as the Dijkstra algorithm or Shortest Path First (SPF) algorithm. The Dijkstra algorithm applied in the OSPF protocol to choose the best route. That a data packet must take from an origin address to arrive at the destination address with the least cost metric. The results showed that using the OSPF routing protocol between the Head Office and Branch can communicate with each other by sending each OSPF database to each router where the maximum data transmission value is 1-millisecond sending data successfully reaches100%
Laron v2: Pengembangan Aplikasi Forensik Logikal untuk Mengakusisi Percakapan Whatsapp di Android: Laron v2: Logical Forensic Application Development to Acquire Whatsapp Conversations on Android Dedy Hariyadi; Arif Akbarul Huda; Kharisma; Adri Priadana
SMARTICS Journal Vol 7 No 1: SMARTICS Journal (April 2021)
Publisher : Universitas PGRI Kanjuruhan Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21067/smartics.v7i1.5026

Abstract

Forensik digital dapat diartikan sebagai pendekatan pengungakapan fakta-fakta tindak kejahatan dari barang bukti dan/atau elektronik menggunakan metode ilmiah untuk menegakan perundangan-undangan yang berlaku. Saat ini forensik digital digunakan sebagai instrumen untuk mengungkap tindak kejahatan atau investigasi. Hal ini dipengaruhi meningkatnya pertumbuhan dan penggunaan teknologi informasi. Pelaku tindak kejahatan telah memanfaatkan teknologi informasi pada suatu tindak kejahatan. Whatsapp sebagai platform komunikasi yang populer juga dimanfaatkan untuk melakukan tindak kejahatan. Maka pada penelitian ini diusulkan pengembangan aplikasi untuk melakukan pengamanan barang bukti percakapan pada Whatsapp. Aplikasi yang kembangkan akan dilepas ke publik dengan lisensi yang selaras dengan Free Open Source Software. Harapannya aplikasi ini dapat mendukung proses pembuktian dan investigasi oleh pihak kepolisian.
Application of Simulation of Dining Philosophers Problem in Concurrent Process Parasian DP Silitonga; Irene Sri Morina; Romanus Damanik
SMARTICS Journal Vol 7 No 1: SMARTICS Journal (April 2021)
Publisher : Universitas PGRI Kanjuruhan Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21067/smartics.v7i1.5229

Abstract

A classic simulation that can describe concurrent processes on an operating system is the dining philosopher problem. In the dining philosophers problem, there is the possibility of a deadlock, a condition in which two or more processes cannot continue their execution. This research produces a software application that can simulate the concurrent process and prevent deadlock problems that occur. The benefit of the simulation in this study is as a visualization of the completion of dining philosophers problems and as an additional facility in the teaching and learning process, especially in operating system courses
Digitasi Produktivitas Panen Padi Berbasis K-Means Clustering Fitri Marisa; Abi Zahma; Adrianus Muit Bau; Egy Noviansa; Adi Semri Neno; Almaukar Anastasia
SMARTICS Journal Vol 7 No 1: SMARTICS Journal (April 2021)
Publisher : Universitas PGRI Kanjuruhan Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21067/smartics.v7i1.5270

Abstract

Paddy as an ingredient of staple food by people in Indonesia includes in East Java Province. Therefore attention to the production of paddy in East Java is necessary, and this attention will give a piece of knowledge about which region produces paddy optimally or less optimal. This study aim is to do a clustering about paddy production in each region in East Java. K-Means algorithm uses to do clustering. The result is 3 clusters obtained, high, medium, and less productivity cluster. There are six regions in high productivity cluster, 20 regions in medium productivity cluster, and 12 regions in less productivity cluster.
Discourse Connectors Pada Peringkasan Dokumen Berbahasa Indonesia Irwan Darmawan; Nirwana Haidar Hari
SMARTICS Journal Vol 7 No 1: SMARTICS Journal (April 2021)
Publisher : Universitas PGRI Kanjuruhan Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21067/smartics.v7i1.5046

Abstract

Documents that have a lot of content will make it difficult for readers to find the essence or topics in a document. Therefore, a system that can summarize documents is needed to find the topics discussed by the document. In the research, the documents used as test materials were the final project papers of informatics engineering students, Madura University. Various methods have been applied in summarizing a document, including using the cosine of similarity to determine the weight and the relationship between one sentence and another and then dumping the sentences which have small weight based on the threshold value of the user. If the length of a sentence has little weight, it does not mean that the sentence is not important when it comes to other sentences. Therefore a discourse connector is needed to connect one sentence to another sentence and then it is given weight according to the discourse connector formula. In this study, it is expected that the document has a better value than before as evidenced by a size that is higher than 70%

Page 1 of 1 | Total Record : 6