Claim Missing Document
Check
Articles

Found 17 Documents
Search

On size multipartite Ramsey numbers for stars versus paths and cycles Anie Lusiani; Edy Tri Baskoro; Suhadi Wido Saputro
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 5, No 1 (2017): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2017.5.1.5

Abstract

Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets and $t$ vertices in each partite set. For given two graphs $G_1$ and $G_2$, and integer $j\geq 2$, the size multipartite Ramsey number $m_j(G_1,G_2)$ is the smallest integer $t$ such that every factorization of the graph $K_{j\times t}:=F_1\oplus F_2$ satisfies the following condition: either $F_1$ contains $G_1$ or $F_2$ contains $G_2$. In 2007, Syafrizal et al. determined the size multipartite Ramsey numbers of paths $P_n$ versus stars, for $n=2,3$ only. Furthermore, Surahmat et al. (2014) gave the size tripartite Ramsey numbers of paths $P_n$ versus stars, for $n=3,4,5,6$. In this paper, we investigate the size tripartite Ramsey numbers of paths $P_n$ versus stars, with all $n\geq 2$. Our results complete the previous results given by Syafrizal et al. and Surahmat et al. We also determine the size bipartite Ramsey numbers $m_2(K_{1,m},C_n)$ of stars versus cycles, for $n\geq 3,m\geq 2$.
On Size Bipartite and Tripartite Ramsey Numbers for The Star Forest and Path on 3 Vertices Anie Lusiani; Edy Tri Baskoro; Suhadi Wido Saputro
Journal of Mathematical and Fundamental Sciences Vol. 52 No. 1 (2020)
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.2020.52.1.1

Abstract

For simple graphs G and H the size multipartite Ramsey number mj(G,H) is the smallest natural number t such that any arbitrary red-blue coloring on the edges of Kjxt contains a red G or a blue H as a subgraph. We studied the size tripartite Ramsey numbers m3(G,H) where G=mK1,n and H=P3. In this paper, we generalize this result. We determine m3(G,H) where G is a star forest, namely a disjoint union of heterogeneous stars, and H=P3. Moreover, we also determine m2(G,H) for this pair of graphs G and H.
On size multipartite Ramsey numbers for stars Anie Lusiani; Edy Tri Baskoro; Suhadi Wido Saputro
Indonesian Journal of Combinatorics Vol 3, No 2 (2019)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (322.917 KB) | DOI: 10.19184/ijc.2019.3.2.4

Abstract

Burger and Vuuren defined the size multipartite Ramsey number for a pair of complete, balanced, multipartite graphs mj(Kaxb,Kcxd), for natural numbers a,b,c,d and j, where a,c >= 2, in 2004. They have also determined the necessary and sufficient conditions for the existence of size multipartite Ramsey numbers mj(Kaxb,Kcxd). Syafrizal et al. generalized this definition by removing the completeness requirement. For simple graphs G and H, they defined the size multipartite Ramsey number mj(G,H) as the smallest natural number t such that any red-blue coloring on the edges of Kjxt contains a red G or a blue H as a subgraph. In this paper, we determine the necessary and sufficient conditions for the existence of multipartite Ramsey numbers mj(G,H), where both G and H are non complete graphs. Furthermore, we determine the exact values of the size multipartite Ramsey numbers mj(K1,m, K1,n) for all integers m,n >= 1 and j = 2,3, where K1,m is a star of order m+1. In addition, we also determine the lower bound of m3(kK1,m, C3), where kK1,m is a disjoint union of k copies of a star K1,m and C3 is a cycle of order 3.
Peningkatan Manajemen Mutu Pos PAUD Melati 10 dan Kenanga 12 Menuju Persiapan Akreditasi PAUD Ratu Fenny Muldiani; Kunlestiowati Hadiningrum; Siti Syamsiah Purwaningsih; Nani Yuningsih; Anie Lusiani
JURNAL PENGABDIAN KEPADA MASYARAKAT Vol 10, No 1 (2020): Juli 2020
Publisher : LPPM UNINUS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30999/jpkm.v10i1.758

Abstract

POS PAUD is one of the non-formal educational institutions that plays an important role in children's education. All learning activities in PAUD and the supporting facilities must meet the standards according to the provisions of PAUD Education. To find out the achievement of these standards accreditation activities are needed, because one of the efforts to maintain the quality and improvement of an educational institution is through accreditation activities. POS PAUD Melati 10 and Kenanga 12 are located in Kelurahan Pasir Kaliki Kecamatan Cimahi Utara are PAUD institutions that have not been accredited. In order for POS PAUD to be accredited properly, it must meet the accreditation eligibility criteria based on the National Education Standards which include eight standards.. The methods used in the preparation of the two POS PAUD accreditations are literature study, interviews, field surveys, discussions, technical guidance for preparation of accreditation standard documents in the form of workshops for school principals, teachers and operators. Through this accreditation preparation assistance activity, it has succeeded in bringing POS PAUD Melati 10 to meet the accredited criteria and POS Kenanga 12 PAUD with additional time being ready for accreditation.
Algoritma Prim dalam Penentuan Lintasan Terpendek dan Lintasan Tercepat pada Pendistribusian Logistik Bulog Jawa Barat Anie Lusiani; Euis Sartika; Endang Habinuddin; Agus Binarto; Irfani Azis
Prosiding Industrial Research Workshop and National Seminar Vol 12 (2021): Prosiding 12th Industrial Research Workshop and National Seminar (IRWNS)
Publisher : Politeknik Negeri Bandung

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

Abstract

Algoritma Prim dalam Penentuan Lintasan Terpendek dan Lintasan Tercepat pada Pendistribusian Logistik Bulog Jawa Barat
Forecasting COVID-19 cases for Top-3 countries of Southeast Asian Nation Hedi Hedi; Anie Lusiani; Anny Suryani; Agus Binarto
International Journal of Trends in Mathematics Education Research Vol 5, No 2 (2022)
Publisher : SAINTIS Publishing

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1014.213 KB) | DOI: 10.33122/ijtmer.v5i2.138

Abstract

Several countries continue controlling the spread of the corona virus to decrease the number of new COVID-19 cases. Currently some Southeast Asian countries require an estimate of the num-ber of daily new COVID-19 cases of in the future in order to reopen or consider lifting strict pre-vention policies. This study applies ARIMA and SARIMA forecasting models to predict the de-cline in the number of new cases in three Southeast Asian countries. The first modelling is carried out using the ARIMA model with optimized model parameters based on the Akaike Information Criterion (AIC) and Bayesian Information Criterion (BIC) analysis. Then, the Mean Absolute Error (MAE), Root Mean Square Error (RMSE) and Mean Absolute Percent Error (MAPE) are evaluated is applied a criterion to select the best model. The best ARIMA and SARIMA models are selected manually and they are used to predict the number of new cases in three Southeast Asian coun-tries. It is expected that the number of new cases in these countries will experience a significant decline in the next month from September 2021. The prediction of SARIMA model indicates a better result than the ARIMA model which confirms the existence of a season in COVID-19 data.
Prediction of the number of daily active COVID-19 in Indonesia Hedi Hedi; Anie Lusiani; Anny Suryani; Agus Binarto
International Journal of Trends in Mathematics Education Research Vol 5, No 3 (2022)
Publisher : SAINTIS Publishing

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (613.903 KB) | DOI: 10.33122/ijtmer.v5i3.157

Abstract

In Indonesia, the coronavirus disease (COVID-19) decreased from April to May 2022 and in-creased slowly from May to June 2022. Statistical predictions are needed to monitor the increase in cases of this pandemic spike, as happened at the end of February 2022. This study aims to predict the rise in the number of active COVID-19 cases by applying the autoregressive integrated moving average (ARIMA) mathematical model. and multiple linear regression (MLR). Daily observation data of active cases, new cases, recovered cases, and deaths were recorded from January to June 2022 totalling 152 observations. Then ARIMA modelling for active cases and MLR modelling for daily active case observation data that depended on new cases were carried out , recovered, and died. Furthermore, the prediction results from the two models were determined the root mean squared error (RMSE), the mean absolute error (MAE), and the mean absolute percent error (MAPE). From the calculation results, the ARIMA model is smaller than the MLR. However, the prediction of the next thirty days in the MLR model is close to the actual value, while in the ARI-MA model it is below the actual value.
P PENGELOLAAN SAMPAH MANDIRI MELALUI PEMBERDAYAAN MASYARAKAT RW 12 DESA CIWARUGA DALAM MEMANFAATKAN SAMPAH RUMAH TANGGA: pengelolaan sampah organik dan sampah organik serta bank sampah Euis Sartika; Siti Yuliah; Sri Murniati; Fatmi Hadiani; Anie Lusiani
Jurnal Pengabdian Masyarakat Bumi Raflesia Vol. 6 No. 2 (2023): Agustus : Jurnal Pengabdian Kepada Masyarakat Bumi Raflesia
Publisher : Universitas Muhammadiyah Bengkulu

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36085/jpmbr.v6i2.5575

Abstract

Sampah meningkat seiring dengan pertumbuhan ekonomi dan peningkatan penduduk. Jumlah pendatang di wilayah RW 12 Desa Ciwaruga yang berpenduduk padat, makin menambah tumpukan sampah. Belum lagi, kepedulian masyarakat akan sampah masih kurang, terbukti dari pembuangan sampah sembarang. Kondisi ini memicu masalah baru, pemandangan yang tidak sedap serta polusi asap pembakaran. Berdasarkan wawancara dengan warga, di wilayah ini belum pernah diadakan sosialisasi pemanfaatan sampah, dan belum mempunyai sistem pengelolaan sampah mandiri. Politeknik Negeri Bandung sebagai instansi pendidikan yang berlokasi di desa Ciwaruga, melalui unit Pengabdian kepada Masyarakat bermaksud membantu menyelesaikan permasalahan. Solusi yang ditawarkan : sosialisasi pemilahan sampah, pelatihan pengelolaan sampah anorganik menjadi produk daur ulang dan Ecobrics, pemanfaatan sampah organik melalui pupuk, dan pendirian Bank Sampah yang memberi manfaat menambah penghasilan, sekaligus meminimalisir sampah. Metode pendekatan yaitu : pelatihan, Bimtek, pendampingan, dan evaluasi. Berdasarkan kuesioner, pengetahuan awal peserta mengenai persampahan cukup baik, begitu juga dengan sikap mencapai persentasi masing-masing 83% dan 80%. Sedangkan persentasi tindakan peserta dalam menangani sampah masih mencapai 60%. Untuk itu, hasil kegiatan diarahkan agar aktivitas masyarakat sudah mulai memilah sampah sejak dari rumah. Kresek sebagai sampah dominan diolah menjadi produk daur ulang yakni dompet, tas, sandal, dan Ecobrics. Sampah organik diolah menjadi pupuk dan hasilnya dimanfaatkan untuk media tanaman pekarangan. Bank sampah RW 12 dengan nama “ Parigi Lame Cempaka 12 Berseri” sudah terbentuk berikut kepengurusannya. Penyelesaian permasalahan sampah harus secara menyeluruh (organik dan anorganik) serta harus melibatkan seluruh komponen, tidak hanya pemerintah, tetapi, instansi lainnya, serta masyarakat, termasuk keberlangsungan aktivitas bank sampah. Kata Kunci: sampah organik dan anorganik, bank sampah, Ecobrics
DIJKSTRA ALGORITHM IN DETERMINING THE SHORTEST ROUTE FOR DELIVERY SERVICE BY J&T EXPRESS IN BANDUNG Anie Lusiani; Siti Samsiyah Purwaningsih; Euis Sartika
Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistika Vol. 4 No. 2 (2023): Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistik
Publisher : LPPM Universitas Bina Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46306/lb.v4i2.337

Abstract

The determination of the shortest route can be done using various methods, one of which is the Dijkstra algorithm. This algorithm is often used in routing problems with minimum weight in computer networks, communication networks and transportation networks. There are several applications of the Djikstra algorithm, namely solving the problem of the shortest path of neutrosophy, mapping tourism potential, and developing geographic information systems in the health sector. In this research, Dijkstra algorithm will be applied to optimize the mileage of the delivery of goods packages. Data and information namely the address, weight and number of customer packages carried by a courier in one delivery trip are obtained from the drop point of PT. J&T Express in Sarijadi area of Bandung City. Meanwhile, data about mileage is obtained from the Google Maps application. All this data is used to construct an initial model graph that is a connected weighted graph, where the location of a drop point or a customer is a vertex and a road connecting two locations is an edge on the graph. The weight in this graph is the mileage from the drop point to the customers or from one customer to another. Then, the Djikstra algorithm is run on this graph where the drop point is the starting point of the route, so that the courier visits all customers and returns again to the drop point. The resulting route is a cycle in the graph which is the shortest closed route at 1890 meters.
TSP METHOD USING NEAREST NEIGHBOR ALGORITHM AT PT. J&T EXPRESS IN BANDUNG Anie Lusiani; Siti Samsiyah Purwaningsih; Euis Sartika
Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistika Vol. 4 No. 3 (2023): Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistik
Publisher : LPPM Universitas Bina Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46306/lb.v4i3.449

Abstract

Effectiveness and efficiency are very important for an expedition company in optimizing the delivery of goods by a courier. The Traveling salesman problem (TSP) method using the Nearest Neighbor Algorithm can optimize the delivery of goods to all consumer location points with only one visit in one trip. The purpose of this study is to find the shortest route using the TSP method based on the travel distance data from drop point PT. J&T Express Sarijadi Bandung to all consumer points and back to this drop point. This data is processed using Matlab and Excel Solver software based on the Nearest Neighbor Algorithm. The results of this study show that the TSP method produces the shortest route, which is 1,944 meters. The delivery route generated by this method provides travel distance efficiency of 50.09% from the route without the TSP method, which is 3,960 meters. Thus, it is expected that there will also be optimization of time and transportation costs in this delivery.