Article Per Year (5 Year)
p-Index From 2021 - 2026
1.259
P-Index
This Author published in this journals
All Journal Jurnal Ilmu Dasar Jurnal Edukasi Universitas Jember KADIKMA BERKALA SAINSTEK CAUCHY: Jurnal Matematika Murni dan Aplikasi Electronic Journal of Graph Theory and Applications (EJGTA) Saintifika Journal of Mathematical and Fundamental Sciences Prosiding Seminar Matematika dan Pendidikan Matematik INFORMAL: Informatics Journal JURNAL NASIONAL TEKNIK ELEKTRO UNEJ e-Proceeding Proceeding of the Electrical Engineering Computer Science and Informatics Prosiding SI MaNIs (Seminar Nasional Integrasi Matematika dan Nilai-Nilai Islami) Kinetik: Game Technology, Information System, Computer Network, Computing, Electronics, and Control Limits: Journal of Mathematics and Its Applications International Journal of Supply Chain Management Indonesian Journal of Combinatorics CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Pancaran Pendidikan SAINTIFIKA Jurnal Sains Natural
S Slamin
CGANT University Of Jember Indonesia; System Information. Depart. University Of Jember
Agriculture, Biological Sciences & Forestry Arts Humanities Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Education Electrical & Electronics Engineering Energy Engineering Environmental Science Health Professions Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Mathematics Medicine & Pharmacology Nursing Physics Public Health Social Sciences Transportation Other

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

Found 69 Documents
Search

 2   3   4   5   6 
Sistem Informasi Kartu Pegawai Elektronik (SI-KPE) Berbasis Web dan Mobile KPE Berbasis Android Dengan Menggunakan Metode AES-128 Yanuar Nurdiansyah; Slamin Slamin; Juniar Priaditama
INFORMAL: Informatics Journal Vol 3 No 3 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v3i3.10075

Abstract

East Java regional development Bank, known as the Bank of East Java was founded on august 17th 1951 in Surabaya. Bank of East Java has a lot of products and services for both civil society or non- civilservants.Oneofthemistheproduct elektronicservisservantcard(KPE).Datamanagementservices servants electronic card is very simple, make inefficient in terms of time and effort because the input file and file storage are still using manual system, as well as to disseminate announcements or events newest still using posters and other print media. File and information would be usefull if it is delivered to the user with an interest in the proper way. Currently, almost all file and information submitted throught the internet network. Security and confidentiality of file submitted via the internet is vulnerable to file theft by unauthorized parties. One way to maitain the security and confidentiality of such file is by using cryptographic methods. There are many cryptographic algorithms that are used to secure the file. One of which is an Algorithm Advanced Encryption Standard (AES). AES algorithm used in the reseacrh, namely AES-128 algorithm to encode digital files. So that the information contained in the file become more secure after converted into the file encrypt because the information can only be read by the party entitled. Employee card elektorinic information system (SI-KPE) and android based Mobile KPE using AES-128 method is a solution for Bank of East Java Jember branch
Rancang Bangun Aplikasi Transaksi Elektronik Ritel Pupuk Dengan Metode Electronic Data Interchange (EDI) Nelly Oktavia Adiwijaya; Nurul Istiana M; Slamin .
JURNAL NASIONAL TEKNIK ELEKTRO Vol 4 No 1: Maret 2015
Publisher : Jurusan Teknik Elektro Universitas Andalas

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1028.169 KB) | DOI: 10.25077/jnte.v4n1.133.2015

Abstract

Fertilizer distribution from distributor to agents, are required to be responsive in addressing the demand for fertilizers. Distributors are also required to be able to manage inventory in the warehouse, to avoid overstocking of fertilizer. Design and implementation of  a fertilizer retail electronic commerce applications using electronic data interchange (EDI) method is applied in this study. The system is built to help distributors to control the existence of the stock of fertilizer so no excess stock. In addition, the use of EDI can provide information quickly (real-time) without having to go directly to the warehouse locations.Keywords : Application, Retail,  Electronic data interchange (EDI) 
On The Metric Dimension with Non-isolated Resolving Number of Some Exponential Graph S. M. Yunika; Slamin Slamin; Dafik Dafik; Kusbudiono Kusbudiono
UNEJ e-Proceeding 2016: Proceeding The 1st International Basic Science Conference
Publisher : UPT Penerbitan Universitas Jember

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

Abstract

Let w, w ∈ G = (V, E). A distance in a simple, undirected and connected graph G, denoted by d(v, w), is the length of the shortest path between v and w in G. For an ordered set W = {w1, w2, w3, . . . , wk} of vertices and a vertex v ∈ G, the ordered k-vector r(v|W) = (d(v, w1), d(v, w2), . . . , d(v, wk)) is representations of v with respect to W. The set W is called a resolving set for G if distinct vertices of G have distinct representations with respect to W. The metric dimension dim(G) of G is the minimum cardinality of resolving set for G. The resolving set W of graph G is called non-isolated resolving set if subgraph W is induced by non-isolated vertex. While the minimum cardinality of non-isolated resolving set in graph is called a non-isolated resolving number, denoted by nr(G). In this paper we study a metric dimension with non-isolated resolving number of some exponential graph.
The Rainbow (1,2)-Connection Number of Exponential Graph and It’s Lower Bound Gembong A. W.; Dafik Dafik; Ika Hesti Agustin; Slamin Slamin
UNEJ e-Proceeding 2016: Proceeding The 1st International Basic Science Conference
Publisher : UPT Penerbitan Universitas Jember

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

Abstract

Let G = (V, E) be a simple, nontrivial, finite, connected and undirected graph. Let c be a coloring c : E(G) → {1, 2, . . . , k}, k ∈ N. A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph G is rainbow connected if there exists a rainbow u − v path for every two vertices u and v of G. The rainbow connection number of a graph G, denoted by rc(G), is the smallest number of k colors required to edge color the graph such that the graph is rainbow connected. Furthermore, for an l-connected graph G and an integer k with 1 ≤ k ≤ l, the rainbow k-connection number rck(G) of G is defined to be the minimum number of colors required to color the edges of G such that every two distinct vertices of G are connected by at least k internally disjoint rainbow paths. In this paper, we determine the exact values of rainbow connection number of exponential graphs, namely Path of ladder as exponent, Cycle of Ladder as exponent, Cycle of Triangular Ladder as exponent, Cycle of Complete as exponent. We also proved that rc2(G) = diam(G) + 1.
On the Rainbow Vertex Connection Number of Edge Comb of Some Graph Agustina M.; Dafik Dafik; Slamin Slamin; Kusbudiono Kusbudiono
UNEJ e-Proceeding 2016: Proceeding The 1st International Basic Science Conference
Publisher : UPT Penerbitan Universitas Jember

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

Abstract

By an edge comb, we mean a graph formed by combining two graphs G and H, where each edge of graph G is replaced by the which one edge of graph H, denote by G D H. A vertex colored graph G D H = (V (G D H);E(G D H)) is said rainbow vertex-connected, if for every two vertices u and v in V (G D H), there is a u ???? v path with all internal vertices have distinct color. The rainbow vertex connection number of G D H, denoted by rvc(G D H) is the smallest number of color needed in order to make G D H rainbow vertex-connected. This research aims to find an exact value of the rainbow vertex connection number of exponential graph, namely rvc(G D H) when G D H are Pn D Btm, Sn D Btm, Ln D Btm, Fm;n D Btp, rvc(Pn D Sm), rvc(Cn D Sm), and rvc(Wn D Sm) Wn D Btm. The result shows that the resulting rainbow vertex connection attain the given lower bound.
Determination of Router Location for Optimizing Computer Network Using Dominating Set Methods Nova El Maidah; Ivan Hardja; Slamin Slamin
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 5: EECSI 2018
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (429.703 KB) | DOI: 10.11591/eecsi.v5.1647

Abstract

The aims of this research is to develop a system to determine an optimal router location in a computer network. The router location is optimal if the computer network need the minimal number of router without losing the network connectivity. The methods used in order to optimize the router location are dominating set and Greedy algorithm. The data is the router location of computer network in University of Jember. The result showed that the optimal router needed in the networks is 4. These routers were found by using the determination system that implement Greedy algorithm to find the minimum number of dominating set.
On The Existence of Non-Diregular Digraphs of Order Two Less than the Moore Bound S Slamin; Mirka Miller
Jurnal ILMU DASAR Vol 12 No 1 (2011)
Publisher : Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (258.617 KB)

Abstract

A communication network can be modelled as a graph or a directed graph, where each processing element is represented by a vertex and the connection between two processing elements is represented by an edge (or, in case of directed connections, by an arc). When designing a communication network, there are several criteria to be considered. For example, we can require an overall balance of the system. Given that all the processing elements have the same status, the flow of information and exchange of data between processing elements will be on average faster if there is a similar number of interconnections coming in and going out of each processing element, that is, if there is a balance (or regularity) in the network. This means that the in-degree and out-degree of each vertex in a directed graph (digraph) must be regular. In this paper, we present the existence of digraphs which are not diregular (regular out-degree, but not regular in-degree) with the number of vertices two less than the unobtainable upper bound for most values of out-degree and diameter, the so-called Moore bound.
On Total Vertex Irregularity Strength of Cocktail Party Graph Kristiana Wijaya; S Slamin; Mirka Miller
Jurnal ILMU DASAR Vol 12 No 2 (2011)
Publisher : Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (85.984 KB)

Abstract

A vertex irregular total k-labeling of a graph G is a function λ from both the vertex and the edge sets to {1,2,3,,k} such that for every pair of distinct vertices u and x, λ(u)+∑λ(uv)≠λ(x)+∑λ(xy). uv∈E xy∈E. The integer k is called the total vertex irregularity strength, denoted by tvs (G ) , is the minimum value of the largest label over all such irregular assignments. In this paper, we prove that the total vertex irregularity strength of the Cocktail Party graph H2,n ,that is tvs(H2,n )= 3 for n ≥ 3.
Finite Difference Method and Newton's Theorem to Determine the Sum of Series Tri Mulyani; Moh. Hasan; S. Slamin
Jurnal ILMU DASAR Vol 14 No 2 (2013)
Publisher : Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (740.382 KB) | DOI: 10.19184/jid.v14i2.515

Abstract

Problems that are often faced to prove the truth of a formula if the presented series is a series that is not the formula of arithmetic and geometric series. One proof among the most commonly proofs used is the proof by mathematical induction. This study was conducted to determine the sum of the first n terms formula of: (1) arithmetic series, storied arithmetic series with the basis of arithmetic series, (2) geometric series, (3) storied arithmetic series with the basis of geometric series, and (4) series which are not arithmetic and geometric series that the formula of the n terms is given, by using the finite difference method and Newton's theorem. The formula of the sum of the first n terms obtained from the results of this study and then it is verified by using mathematical induction. Keywords : Series, finite difference, mathematical induction, Newton’s theorem
On Commutative Characterization of Graph Operation with Respect to Metric Dimension Liliek Susilowati; Mohammad Imam Utoyo; Slamin Slamin
Journal of Mathematical and Fundamental Sciences Vol. 49 No. 2 (2017)
Publisher : Institute for Research and Community Services (LPPM) ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/j.math.fund.sci.2017.49.2.5

Abstract

Let  G be a connected graph with vertex set V(G) and W={w1, w2, ..., wm} ⊆ V(G). A representation of a vertex v âˆˆ V(G) with respect to W is an ordered m-tuple r(v|W)=(d(v,w1),d(v,w2),...,d(v,wm)) where d(v,w) is the distance between vertices v and w. The set W is called a resolving set for G if every vertex of G has a distinct representation with respect to W. A resolving set containing a minimum number of vertices is called a basis for G. The metric dimension of G, denoted by dim (G), is the number of vertices in a basis of G. In general, the comb product and the corona product are non-commutative operations in a graph. However, these operations can be commutative with respect to the metric dimension for some graphs with certain conditions. In this paper, we determine the metric dimension of the generalized comb and corona products of graphs and the necessary and sufficient  conditions of the graphs in order for the comb and corona products to be commutative operations with respect to the metric dimension.
Co-Authors Abdul Rouf Alghofari Agustina M. Andrea Semanicova-Fenovcikova Antonius Cahya Prihandoko Ar Ruhimat, Qurrota A'yuni Arif Fatahillah Arifin, Mohammad D. Dafik Desy Nurjannah Desy Tri Puspasari Desy Tri Puspasari, Desy Tri Dian Anita Hadi, Dian Anita Diari Indriati Diksy Media Firmansyah Dinawati Trapsilasiwi Dzurrotun Nasyika Ermita Rizki Albirri Faisal Susanto Gembong A. W. Hardja, Ivan Hidayat, Noor Hilmiyah Hanani I Wayan Sudarsana Ika Hesti Agustin, Ika Hesti Inge Yosanda Arianti, Inge Yosanda Irma Azizah Ivan Hardja Juniar Priaditama Kiki A. Sugeng Kristiana Wijaya Kristiana Wijaya Kusbudiono Kusbudiono, Kusbudiono Liliek Susilowati Lubis Muzaki Lusia Dewi Minarti Lusia Dewi Minarti M, Nurul Istiana M. Utomo Malinda, Alvira Martin Baca Mirka Miller Moch Bustommy Maulana Moch. Zaenal A Moh Febri Nurul Qorik Moh. Hasan Mohammad Imam Utoyo Mohammad Zarkasi Muhlisatul Mahmudah, Muhlisatul Nova El Maidah Novalita Anjelia Nuris Hisan Nazula Nurul Istiana M Oktalia Juwita Oktavia, Nelly Prabhu, Savari Priza Pandunata Qurrotul A’yun R Rohmatullah Robiatul Adawiyah Robiatul Adawiyah Rukmana Sholehah, Rukmana S. M. Yunika Safira Izza Ghafrina Safira Izza Ghafrina Saiful Bukhori Santoso, Kiswara Agung Septiyani Setyo Wulandari Shapbian Novindasari, Shapbian Sholihah, Siti Mar’atus Siti Mar’atus Sholihah Sulistio, Wahyu Susi Setiawani Tanti Windartini, Tanti Tri Mulyani Tri Mulyani Umilasari, Reni Wahyu, Ria Ammelia Wijayanti, Dian Eka Wiji Utami Windi Eka Yulia Retnani Yanuar Nurdiansyah, Yanuar Yayuk Wahyuni Yudha Alif Auliya