cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Wamiliana
Contact Email
integrajimcs@gmail.com
Phone
-
Journal Mail Official
integrajimcs@gmail.com
Editorial Address
Jl. Prof. Dr. Soemantri Brodjonegoro No.1. Bandar Lampung 35145, INDONESIA
Location
Kota bandar lampung,
Lampung
INDONESIA
Integra: Journal of Integrated Mathematics and Computer Science
Published by Universitas Lampung
ISSN : -     EISSN : 31091792     DOI : https://doi.org/10.26554/integrajimcs
Core Subject : Science, Education,
Computer Science & IT Mathematics
Integra : Journal of Integrated Mathematics and Computer Science is the international journal in the field of Mathematics and Computer Science. Integra : Journal of Integrated Mathematics and Computer Science publish original research work both in a full article or in a short communication form, review article, and technical article in the field of Mathematics and Computer Science. Scope of this journal is : Mathematics Applied Mathematics Statistics Applied Statistics Data Science Computer Science
Arjuna Subject : Matematika - Matematika Komputer
Articles 5 Documents
 1 
Search results for , issue "Vol. 1 No. 1 (2024): March" : 5 Documents clear
The Relation of Noncrossing Partitioning of Odd and Even Numbers with Catalan Numbers Amansyah, Wahyu Dwi; Wamiliana; Hamzah, Nur
Integra: Journal of Integrated Mathematics and Computer Science Vol. 1 No. 1 (2024): March
Publisher : Magister Program of Mathematics, Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/integrajimcs.2024114

Abstract

Catalan numbers, denoted by Cn, are generally defined by the equation Cn = 1/(n+1) (2nn) with n ≥ 0 and n ∈ ℤ. Catalan numbers have forms that can be determined through generaland recursive forms. Catalan numbers have several applications to various combinatorialproblems, such as in recursive analysis and the application of combinatorial theory topartitions that can form Catalan numbers. The odd numbers are defined as integers that arenot divisible by two, expressed in the form {2k + 1; k ∈ ℤ} . Meanwhile, even numbers aredefined as integers that are divisible by two, expressed in the form {2k; k ∈ ℤ} . In this studywe discuss the noncrossing partitions of positive odd numbers and positive even numbers.The results show those the noncrossing partitions have relationship with Catalan numbers.
Products Distribution from Suppliers to Retailers in Bandarlampung City (Case Study: Retailers location in Teluk Betung) Salsabila, Annisa; Nikmah, Nadhir Rotun; Bakhtiananda, Rafif Syadid; Aswin, Micelle Yap; Nurvazly, Dina Eka
Integra: Journal of Integrated Mathematics and Computer Science Vol. 1 No. 1 (2024): March
Publisher : Magister Program of Mathematics, Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/integrajimcs.2024116

Abstract

Traveling Salesman Problem(TSP) is a problem where a salesman visits cities, each city is connected, and there are weights to move between cities, thus forming a complete weighted graph. The objective of the TSP is to determine all city routes with the lowest total weight. Cheapest Insertion Heuristic (CIH), one of the algorithms to solve TSP. This algorithm provides different travel routes depending on the order of city elimination on the subtour in question. In this study, the CIH algorithm will be discussed to determine the shortest route for distribution of goods from suppliers to several retailers in the city of Bandarlampung, especially for 23 retailers whose locations in Teluk Betung sub-district. The result shows that the total distance travel from the supplier to the 23 retailers and then back to the supplier location is 34.84 km.
Solving the Traveling Salesman Problem on a Directed Graph Using Greedy Algorithm (Case Study: Locations of BRI Bank in Bandar Lampung City) Nurfabella, Rehsya; Chasanah, Siti Laelatul; Notiragayu
Integra: Journal of Integrated Mathematics and Computer Science Vol. 1 No. 1 (2024): March
Publisher : Magister Program of Mathematics, Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/integrajimcs.2024117

Abstract

The traveling salesman problem is the idea that a salesman must discover the shortest path between an origin point and many destination points, returning to the origin point after visiting the destination point once. In this study, the Greedy Algorithm will be used to solve the Traveling Salesman Problem on a directed graph which represented BRI Banks in Bandar Lampung city. The locations of the banks are represented by points, while the journey time between BRI Banks is represented by lines. According to the results, 130 minutes was the same amount of time spent manually and with the Python software.
Analysis of the Relationship Between Library Services and Education Factors on the Community Literacy Development Index Using Path Analysis Benaya; Marga, Diva Aura; Banisa, Rizkia Syefira; Yuniar; Loves, Luvita
Integra: Journal of Integrated Mathematics and Computer Science Vol. 1 No. 1 (2024): March
Publisher : Magister Program of Mathematics, Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/integrajimcs.2024118

Abstract

The application of Path Analysis for causal modelling is widely used in various fields of study, one of which is education. Path Analysis is applied to test the relationship model between variables: CLDI (Community Literacy Development Index) (Y0), library service equity (X1), library collection adequacy (X2), library staff adequacy ratio (X3), community visit rate per day (X4), and education completion rate (X5). In addition, the adequacy of the library collection (X2), the level of community visits (X4), and the level of education completion (X5) significantly affect the CLDI (Y0). The combination of library and education service variables explained 70.19 per cent of the variation in CLDI. This study concludes the importance of synergy between libraries and education in improving community literacy and recommends strengthening literacy programmes based on library services and quality education.
The Expert System for Diagnosing Pest and Disease in Pineapple Plant Using the Iterative Deepening Search (IDS) Method on the Android Platform Amalia, Ayu; Junaidi, Akmal; Sudarsono, Hamim; Lumbanraja, Favorisen R.
Integra: Journal of Integrated Mathematics and Computer Science Vol. 1 No. 1 (2024): March
Publisher : Magister Program of Mathematics, Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/integrajimcs.2024119

Abstract

This research was conducted to design and develop pineapple pests and diseases diagnosis expert system with Iterative Deepening Search (IDS). This expert system runs on android platform. The certainty factor of this expert system is initialized by an expert and the final certainty factor is computed by the system. The data used in this expert system consist of 5 types of pineapple pests, 6 types of pineapple diseases. 31 types of symptoms and 11 types of rules are used to diagnose pineapple pests and diseases. To validate this expert system, two types of tests were conducted, which are expert system verification and system evaluation by users. Expert system verification was conducted by comparing 10 results from the diagnosis system and the results of the diagnosis by an expert. The compare result shows that the expert system result 100% is similar to the result of the expert. To evaluate the system, 30 respondents were asked to evaluate using questionnaires, which were grouped into three groups, i.e. group I (pineapple experts), group II (pineapple farmers and agriculture students) and group III (computer science students). All three stated this expert system runs well (75.56%, 72.44%, and 79.83% respectively).

Page 1 of 1 | Total Record : 5

 1 

Filter by Year

2024 2024


Reset
Filter By Issues
All Issue Vol. 2 No. 3 (2025): November Vol. 2 No. 2 (2025): July Vol. 2 No. 1 (2025): March Vol. 1 No. 3 (2024): November Vol. 1 No. 2 (2024): July Vol. 1 No. 1 (2024): March