Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal Seminar Nasional Aplikasi Teknologi Informasi (SNATI) Operations Research: International Conference Series Jurnal Ilmiah Sains
Benny Pinontoan
Unknown Affiliation
Agriculture, Biological Sciences & Forestry Biochemistry, Genetics & Molecular Biology Chemistry Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Engineering Mathematics Physics

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

Found 4 Documents
Search

 1 
Design Web-Based Information System of Tri Dharma Higher Education for Lecturer Lenshy Aprisilia Anastasia; Benny Pinontoan; Luther Alexander Latumakulita
Operations Research: International Conference Series Vol 3, No 1 (2022)
Publisher : Indonesian Operations Research Association (IORA)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47194/orics.v3i1.130

Abstract

Tri dharma of higher education consisting of education & teaching, research, and community service which must upheld by every lecturer at universities in Indonesia. Lecturer who has implemented the tri dharma of higher education need these tri dharma files for promotion and lecturer performance report to get allowance. It is important to have an online system to store those files. In this research we develop a web-based information system for processing lecturer tri dharma activities data using Rapid Application Development (RAD) Method which started from requirement planning, system design, and implementation.
Numbered Musical Notation Composer Benny Pinontoan; Audy Kenap; Debby Paseru; Inggrid Alista Paendong
Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2007
Publisher : Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia

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

Abstract

Computer and it’s technology has been given so many advantages in any side, also in music. Computer’stechnology allows people to build application to compose music in any musical notation. Besides, computer’stechnology in music also allows to edit and save the composed notation easily, compare to use paper andhandwriting (manually). Some applications of musical notation have been built but generally they were built instandard notation system and it causes the use of the applications are limited to people who know well aboutstandard musical notation. The goal of this thesis is to build the application of musical notation in numberedsystem that can be used by anyone, also provides the simply of editing and safely storage. Numbered MusicalNotation Composer (NMNC) is an application to compose musical notation in numbered system. It is developedbased on algorithm and using Borland Delphi 6.0. By the use of this application user can not only composemusic in numbered notation easily, but also listen the sound, and do not need so much time in editing.Keywords: Computer’s technology in music, standard musical notation, numbered musical notation.
KONSTRUKSI FAMILI GRAF HAMPIR PLANAR DENGAN ANGKA PERPOTONGAN TERTENTU Benny Pinontoan
JURNAL ILMIAH SAINS Volume 11 Nomor 2, Oktober 2011
Publisher : Sam Ratulangi University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (215.065 KB) | DOI: 10.35799/jis.11.2.2011.182

Abstract

KONSTRUKSI FAMILI GRAF HAMPIR PLANAR DENGAN ANGKA PERPOTONGAN TERTENTU Benny Pinontoan1) 1) Program Studi Matematika FMIPA Universitas Sam Ratulangi Manado, 95115ABSTRAK Sebuah graf adalah pasangan himpunan tak kosong simpul dan himpunan sisi. Graf dapat digambar pada bidang dengan atau tanpa perpotongan. Angka perpotongan adalah jumlah perpotongan terkecil di antara semua gambar graf pada bidang. Graf dengan angka perpotongan nol disebut planar. Graf memiliki penerapan penting pada desain Very Large Scale of Integration (VLSI). Sebuah graf dinamakan perpotongan kritis jika penghapusan sebuah sisi manapun menurunkan angka perpotongannya, sedangkan sebuah graf dinamakan hampir planar jika menghapus salah satu sisinya membuat graf yang sisa menjadi planar. Banyak famili graf perpotongan kritis yang dapat dibentuk dari bagian-bagian kecil yang disebut ubin yang diperkenalkan oleh Pinontoan dan Richter (2003). Pada tahun 2010, Bokal memperkenalkan operasi perkalian zip untuk graf. Dalam artikel ini ditunjukkan sebuah konstruksi dengan menggunakan ubin dan perkalian zip yang jika diberikan bilangan bulat k ³ 1, dapat menghasilkan famili tak hingga graf hampir planar dengan angka perpotongan k. Kata kunci: angka perpotongan, ubin graf, graf hampir planar. CONSTRUCTION OF INFINITE FAMILIES OF ALMOST PLANAR GRAPH WITH GIVEN CROSSING NUMBER ABSTRACT A graph is a pair of a non-empty set of vertices and a set of edges. Graphs can be drawn on the plane with or without crossing of its edges. Crossing number of a graph is the minimal number of crossings among all drawings of the graph on the plane. Graphs with crossing number zero are called planar. Crossing number problems find important applications in the design of layout of Very Large Scale of Integration (VLSI). A graph is crossing-critical if deleting of any of its edge decreases its crossing number. A graph is called almost planar if deleting one edge makes the graph planar. Many infinite sequences of crossing-critical graphs can be made up by gluing small pieces, called tiles introduced by Pinontoan and Richter (2003). In 2010, Bokal introduced the operation zip product of graphs. This paper shows a construction by using tiles and zip product, given an integer k ³ 1, to build an infinite family of almost planar graphs having crossing number k. Keywords: Crossing number, tile, almost planar graph.
K-CROSSING CRITICAL ALMOST PLANAR GRAPHS Juwita Rawung; Benny Pinontoan; Winsy Weku
JURNAL ILMIAH SAINS Volume 13 Nomor 1, April 2013
Publisher : Sam Ratulangi University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (623.967 KB) | DOI: 10.35799/jis.13.1.2013.2034

Abstract

K-CROSSING CRITICAL ALMOST PLANAR GRAPHS ABSTRACTA graph is a pair of a non-empty set of vertices and a set of edges. Graphs can be drawn on the plane with or without crossing of its edges. Crossing number of a graph is the minimal number of crossing among all drawings of the graph on the plane. Graphs with crossing number zero are called planar. A graph is crossing critical if deleting any of its edge decreases its crossing number. A graph is called almost planar if deleting one edge makes the graph planar. This research shows graphs, given an integer k ≥ 1, to build an infinite family of crossing critical almost planar graphs having crossing number k.Keywords: Almost planar graph,crossing critical graph. GRAF K-PERPOTONGAN KRITIS HAMPIR PLANAR ABSTRAKSebuah graf adalah pasangan himpunan tak kosong simpul dan himpunan sisi.  Graf dapat digambar pada bidang dengan atau tanpa perpotongan.  Angka perpotongan adalah jumlah perpotongan terkecil di antara semua gambar graf pada bidang.  Graf dengan angka perpotongan nol disebut planar.  Sebuah graf dinamakan perpotongan kritis jika penghapusan sebuah sisi manapun menurunkan angka perpotongannya, sedangkan sebuah graf dinamakan hampir planar jika menghapus salah satu sisinya membuat graf yang sisa menjadi planar.  Dalam penelitian ini ditunjukkan graf, yang jika diberikan bilangan bulatk≥1, dapat menghasilkan famili takhingga graf perpotongan kritis hampir planar dengan angka perpotongan k.Kata kunci: Graf hampir planar, graf perpotongan kritis.
Co-Authors Audy Aldrin Kenap Debby Paseru Inggrid Alista Paendong Juwita Rawung Lenshy Aprisilia Anastasia Luther Latumakulita Winsy Weku