Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Yanne Irene"'
Publikováno v:
JTAM (Jurnal Teori dan Aplikasi Matematika), Vol 8, Iss 3, Pp 780-799 (2024)
The analysis of water infiltration channels requires significant time and cost when conducted through laboratory experiments. Alternatively, mathematical modeling followed by numerical method can be employed. The mathematical model of water infiltrat
Externí odkaz:
https://doaj.org/article/feb58a46099c46d7918fe2d27f023907
Publikováno v:
InPrime, Vol 2, Iss 2, Pp 71-78 (2020)
Abstract Investment is a process of investing money for profit or material result. One investment commodity is gold. Gold is a precious metal in which the value tends to fluctuate over time. This indicates that there is a non-constant variance called
Externí odkaz:
https://doaj.org/article/25a5c64d879f4c87953f773359c8a63a
Publikováno v:
InPrime, Vol 2, Iss 1, Pp 24-32 (2020)
Abstract In this paper, we use chest x-ray images of Tuberculosis and Pneumonia to diagnose the patient using a convolutional neural network model. We use 4273 images of pneumonia, 1989 images of normal, and 394 images of tuberculosis. The data are d
Externí odkaz:
https://doaj.org/article/e86f7f5ac9924d4eb043a6e6cb17bed1
Publikováno v:
InPrime, Vol 1, Iss 1, Pp 40-47 (2019)
Abstract Let be a nontrivial connected graph, the rainbow-k-coloring of graph G is the mapping of c: E(G)-> {1,2,3,…,k} such that any two vertices from the graph can be connected by a rainbow path (the path with all edges of different colors). The
Externí odkaz:
https://doaj.org/article/903336a41767416fb21ed246fbe92046
Autor:
Yanne Irene, Bambang Ruswandi
Publikováno v:
Jurnal Matematika Integratif, Vol 9, Iss 2, Pp 147-160 (2013)
ABSTRAK Penelitian ini dilakukan untuk mengeksplorasi faktor-faktor yang berpengaruh terhadap kualitas pelayanan Laboratorium Matematika Pusat laboratorium Terpadu serta merencanakan strategi peningkatan kualitas pelayanan dengan menggunakan Metode
Externí odkaz:
https://doaj.org/article/1098e70095754d97b9a6677990a0dcf5
Publikováno v:
Jurnal Kajian Matematika dan Aplikasinya (JKMA). 3:21
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a173f40b974080c8259598135a7956eb
https://doi.org/10.17977/um055v3i22022p21-25
https://doi.org/10.17977/um055v3i22022p21-25
Publikováno v:
InPrime: Indonesian Journal of Pure and Applied Mathematics. 1
Let be a nontrivial connected graph, the rainbow-k-coloring of graph G is the mapping of c: E(G)-> {1,2,3,…,k} such that any two vertices from the graph can be connected by a rainbow path (the path with all edges of different colors). The least nat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad9eb13400e9a6bf3bd703b8c263a7ac
https://doi.org/10.15408/inprime.v1i1.12732
https://doi.org/10.15408/inprime.v1i1.12732
Publikováno v:
Journal of Physics: Conference Series. 1008:012052
Let G be a nontrivial connected graph. We follow Chartrand, et al in [2] for the definiton of rainbow connection and strong rainbow connection number. For t N and t > 2, let {P(3,2)i|i {1, 2, ..., t}} is a finite collection of prism graph P3,2 that h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33256b7171ebc1cb532b587bc0547bc7
https://doi.org/10.1088/1742-6596/1008/1/012052
https://doi.org/10.1088/1742-6596/1008/1/012052