Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Seminar Nasional Aplikasi Teknologi Informasi (SNATI) Jurnal TIMES Jurnal Ilmiah Sains d'Cartesian: Jurnal Matematika dan Aplikasi
Benny Pinontoan
Unknown Affiliation
Agriculture, Biological Sciences & Forestry Biochemistry, Genetics & Molecular Biology Chemistry Computer Science & IT Mathematics Physics

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

Found 9 Documents
Search

 1 
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.
Rectilinear Monotone r-Regular Planar Graphs for r = {3, 4, 5} Arthur Wulur; Benny Pinontoan; Mans Mananohas
d\'Cartesian: Jurnal Matematika dan Aplikasi Vol. 4 No. 1 (2015): Maret 2015
Publisher : Sam Ratulangi University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35799/dc.4.1.2015.8318

Abstract

A graph G consists of non-empty set of vertex/vertices (also called node/nodes) and the set of lines connecting two vertices called edge/edges. The vertex set of a graph G is denoted by V(G) and the edge set is denoted by E(G). A Rectilinear Monotone r-Regular Planar Graph is a simple connected graph that consists of vertices with same degree and horizontal or diagonal straight edges without vertical edges and edges crossing. This research shows that there are infinite family of rectilinear monotone r-regular planar graphs for r = 3and r = 4. For r = 5, there are two drawings of rectilinear monotone r-regular planar graphs with 12 vertices and 16 vertices. Keywords: Monotone Drawings, Planar Graphs, Rectilinear Graphs, Regular Graphs
Derivation of Quantum Guarded Command Language Program for Average Cherry Telap; Benny Pinontoan; Jullia Titaley
d\'Cartesian: Jurnal Matematika dan Aplikasi Vol. 4 No. 2 (2015): September 2015
Publisher : Sam Ratulangi University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35799/dc.4.2.2015.9055

Abstract

Has conducted research to determine the derivation of quantum guarded command language (qGCL) program for average. Initially calculation of average value was made in guaded command language (GCL) which is then implemented on a digital computer into the Pascal programming language. Furthermore GCL to calculate the average value was analyzed again to be made in the quantum guarded command language (qGCL). qGCL implementation is on a quantum computer is a future computer could perform calculations very quickly because it uses a superposition state is referred to as quantum bits (qubits). Keywords : GCL, qGCL, Quantum Computer
Quantum Guarded-Command Language (qGCL) for Maximum Value Aisya Putri; Jullia Titaley; Benny Pinontoan
d\'Cartesian: Jurnal Matematika dan Aplikasi Vol. 6 No. 1 (2017): Maret 2017
Publisher : Sam Ratulangi University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35799/dc.6.1.2017.14988

Abstract

On a classical computer or a binary computer, calculations are done simultaneously so as to produce the equations and algorithms. The result of this research shows that to determined maximum value specified in the algorithm using quantum Guarded-Command Language (qGCl) in quantum computer. Initially determine of maximum value was construct in Djikstra’s Guarded-Command Language (GCL) which is then implemented on Zuliani’s probability Guarded-Command Language (pGCL) furthermore applying to quantum Guarded-Command Language (qGCL) for last result. Of concern here is the speed in resolving a problem or calculate problem. Due to the Quantum Computer has a Quantum Bit (qubit) and a phenomenon commonly called superposition. Keywords: GCL, pGCL, qGCL, quantum computer.
Application of Decision Support System Based On GUI to Determine The Best Mall In Manado City By Using ELECTRE Method Kenedi Binowo; Altien Jonathan Rindengan; Benny Pinontoan
d\'Cartesian: Jurnal Matematika dan Aplikasi Vol. 7 No. 1 (2018): Maret 2018
Publisher : Sam Ratulangi University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35799/dc.7.1.2018.19550

Abstract

Mall is a shopping center that has numerous functions, and the mall has become a place of human survival, therefore this research is done to choose the best mall in Manado city which is Jumbo, Mega Trade Center, Manado Town Square, Mega Mall, and Multimart. The ELECTRE method is one of the multi-criteria decision-making methods based on the concept of outranking by using pairwise comparisons of alternatives based on each appropriate criterion.  The purpose of this research is to find out the best mall in Manado city based on ELECTRE method, and to find out the most important thing in designing GUI based application system. GUI is a decision support program in mathematics programs. From the research result using ELECTRE method can be known that the best mall in Manado city is Mega Mall, because from the best calculation result is (Alternative 4), where if indicates that alternative is the chosen alternative. The results of GUI-based applications it has been perform a result that the most important thing in the making is: There must be a place of input value, there should be an output display, and there should be execution buttons, and most importantly also that must create a coding in accordance with the programming language that can be read by mathematics programs.K e y w o r d s:  Mall, ELECTRE Method, Decision Support System, GUI Application
Application Of Vehicle Routing Problem Using Clarke And Wright Algorithm For Distribution Of White Sugar By “Toko Bersama Trader” Rondo Morihito; Chriestie Montolalu; Benny Pinontoan
d\'Cartesian: Jurnal Matematika dan Aplikasi Vol. 7 No. 2 (2018): September 2018
Publisher : Sam Ratulangi University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35799/dc.7.2.2018.20627

Abstract

The problem which is often experienced in the delivery of goods from distributor to the destination is the delivery route which is not sufficient with the capacity of the vehicle. This matter is very important because it can affect the trust of the clients on the shippers in the distributor. This problem can be analyzed using Capacitated Vehicle Routing Problem (CVRP) with Clarke and Wright Algorithm. This research begins with determining the distance between all coordinates with Euclidean Distance, making the distance matrix between places to go. After that, the calculation CVRP using Clarke and Wright Algorithm is exected in this study, a calculate CVRP using Clarke and Wright algorithm can help of the computer. The study was conducted at 15 shop coordinates, the results obtained by 4 routes with total load 3750 kg and distance 29.8510 km. Route of delivery the first route 1100 kg load and distance 11.5963 km, second route 1000 kg load and distance 6.6493 km, third route 1000 kg load and distance 2.7549 km, and the fourth route 650 kg load and distance 8.8505 km.Keywords:  Distributor, Vehicle Routing Problem, Capacitated Vehicle Routing Problem, Clarke and Wright Algorithm
DEVELOPMENT OF E-MARKETPLACE FOR MARKETING AGRICULTURAL PRODUCTS (CASE STUDY IN TUMARATAS VILLAGE) Prisilia Lumentah, Sweety; Benny Pinontoan; Edwin Tenda; Eliasta Ketaren
Jurnal TIMES Vol 13 No 1 (2024): Jurnal TIMES
Publisher : STMIK TIME

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.51351/jtm.13.1.2024744

Abstract

Tumaratas is an agricultural village where most of the people's livelihood is farming. However, sales of agricultural products are still carried out traditionally and are tied to certain times, this can make it difficult for farmers and consumers to carry out the buying and selling process whenever they want. Limited market reach, farmers still rely on intermediaries or retailers so that products are only available in local shops or traditional markets, and do not reach consumers outside the area. E-Marketplace is an intermediary media that brings together sellers and buyers on the internet, helping sellers market and offer merchandise on the internet. The aim of this research is to build and develop an E-Marketplace for farmers as a forum for promoting and marketing their agricultural products and to make it easier for consumers to find the agricultural products they want. This e-Marketplace was developed using the PHP programming language with the Laravel framework and MySQL as the database. With the development of this E-Marketplace, it is hoped that it can help local farmers market their agricultural products and make transactions widely.
Co-Authors Aisya Putri Altien Jonathan Rindengan Arthur Wulur Audy Aldrin Kenap Cherry Telap Chriestie Montolalu Debby Paseru Eliasta Ketaren Inggrid Alista Paendong Jullia Titaley Juwita Rawung Kenedi Binowo Mans Mananohas Prisilia Lumentah, Sweety Rondo Morihito Tenda, Edwin Winsy Weku