Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Journal of Mathematics Technology and Education

Poisson Regression Modeling Case Study Dengue Fever in Medan City in 2019 Sinaga, Juhenni Putri; Sinulingga, Ujian
Journal of Mathematics Technology and Education Vol. 1 No. 1 (2021): Journal of Mathematics Technology and Education
Publisher : Talenta Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (628.486 KB) | DOI: 10.32734/jomte.v1i1.7500

Abstract

Dengue Hemorrhagic Fever (DHF) is an infectious disease caused by the dengue virus carried by the Aedes aegypti or Aedes albopictus mosquito which is spread in Southeast Asia. Medan City is one of the endemic areas for dengue fever in North Sumatra Province. This study aims to model the variable cases of dengue fever and determine the factors that have a significant effect on cases of dengue fever in the city of Medan. The method used in modeling the DHF case variable is the Poisson regression method with the response variable (Y) namely the number of DHF cases in Medan City, while the predictor variables are population density, number of health workers, number of health facilities, area height, and average waste production. In Poisson regression analysis, the response variable (Y) must meet the assumption of equidispersion. However, the assumption is often violated, namely overdispersion. Then Negative Binomial Regression was chosen as a non-linear model derived from the Poisson-gamma mixture distribution which is the application of the Generalized Linear Model (GLM) which describes the relationship between the response variable (Y) and the predictor variable (X).
The Implementation of Dijkstra Algorithm in Searching the Shortest Path for Fire Engines in Medan City Sidabutar, Juni Artha; Sinulingga, Ujian
Journal of Mathematics Technology and Education Vol. 1 No. 2 (2022): Journal of Mathematics Technology and Education
Publisher : Talenta Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (922.557 KB) | DOI: 10.32734/jomte.v1i2.7659

Abstract

Dijkstra algorithm is one of the algorithms to determine the shortest path from one vertex to another. In this study, the authors examine the shortest path that fire engines can choose from at the Regional I Fire Unit Post and Region II Fire Unit Post to the most densely populated villages that predict fires, namely Tegal Sari I Village, Sari Rejo Village and Kampung Baru Village. The results obtained are that if a fire occurs in the Tegal Sari I and Sari Rejo Villages, the Regional I Fire Unit which has the closest distance with the shortest route length is 5.16 km and 7.28 km, while if a fire occurs in Kampung Baru Village, the Regional Fire Unit is II which has the closest distance with the shortest route length of 5.32 km.