cover
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,
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
Articles 31 Documents
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).
Robust Panel Data Regression Analysis using the Least Trimmed Squares (LTS) Estimator on Poverty Line Data in Lampung Province Lestari, Windi; Widiarti; Utami, Bernadhita Herindri Samodera; Usman, Mustofa; Handayani, Vitri Aprilla
Integra: Journal of Integrated Mathematics and Computer Science Vol. 1 No. 2 (2024): July
Publisher : Magister Program of Mathematics, Universitas Lampung

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

Abstract

Robust regression is an alternative method in regression analysis designed to produce stable parameter estimates, even when the data contain outliers or deviate from classical assumptions. One of its estimation techniques, the Least Trimmed Square (LTS),works by minimizing the smallest squared residuals, thereby assigning smaller weights to extreme data points. This method serves as a solution when classical approaches, such as Ordinary Least Squares (OLS), fail to meet the assumptions, especially in socio-economic data that are often complex and prone to outliers. This study employs robust regression with the LTS estimator on panel data to examine the impact of population size , population density , and registered job vacancies on poverty lines in Lampung Province. The data cover 15 districts and cities from 2019 to 2023. The analysis results show that the model obtained has a coefficient of determination of R2=0.8909. This means that the three predictor variables can explain 89.09% of the variation in the poverty line.
Key Matrix Generation Using Random Functions in Hill Cipher Modulo 95 Cryptography Bahtiar, Nurdin; Widodo, Aris Puji; Puspita, Nikken Prima
Integra: Journal of Integrated Mathematics and Computer Science Vol. 2 No. 1 (2025): March
Publisher : Magister Program of Mathematics, Universitas Lampung

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

Abstract

In symmetric cryptography, the confidentiality of the chosen key and the security of its delivery mechanism are paramount to minimize the risk of unauthorized disclosure. Typically, in such systems, the sender and recipient focus primarily on the message (plaintext and ciphertext) rather than the complexities associated with key management. This approach aims to alleviate the burden of selecting a suitable and robust key for communicating parties. This study introduces a Hill Cipher modulo 95 cryptography method employing a matrix-based key, where key generation is achieved through a quantifiable randomization algorithm. The developed 2x2 key matrix facilitates a substantial number of possible keys, specifically 954 (exceeding 81 million). The key matrix generation process incorporates several functions, including those for ASCII character conversion, prime number verification, relative primality checks, modulo arithmetic, inverse modulo computation, determinant calculation, and inverse matrix determination. To simulate the encryption and decryption process, a desktop application was developed using the Lazarus Development IDE version 3.6. The application demonstrates effective generation of the required key matrix.
A Hybrid ARIMA–GRU Model for Forecasting Palm Oil Prices at PT Sawit Sumbermas Sarana in Central Kalimantan Kurniasari, Dian; Shella, Tiara Pramay; Usman, Mustofa; Warsono
Integra: Journal of Integrated Mathematics and Computer Science Vol. 2 No. 1 (2025): March
Publisher : Magister Program of Mathematics, Universitas Lampung

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

Abstract

The palm oil industry plays a strategic role in Indonesia's economic landscape. As one of the world’s largest producers, Indonesia holds substantial potential in marketing both crude palm oil (CPO) and palm kernel oil on domestic and international fronts. Palm oil prices consistently correlate with CPO prices, given that the pricing of palm oil is benchmarked against CPO, resulting in market fluctuations. Forecasting future palm oil prices becomes an essential measure in response to this volatility. The ARIMA (AutoRegressive Integrated Moving Average) model has been widely recognized as a reliable method for time series forecasting. Despite its strengths, ARIMA faces challenges in identifying the non-linear components that are often present in real-world data. The Gated Recurrent Unit (GRU) model, which incorporates an update gate and a reset gate, offers an alternative that effectively captures complex non-linear patterns. A hybrid model integrating ARIMA and GRU has therefore been developed with the aim of improving predictive accuracy. This hybrid approach includes two stages: the ARIMA model for initial predictions and a GRU model that processes the residuals from the ARIMA output. In this study, the ARIMA-GRU hybrid model demonstrated strong performance, yielding a Mean Squared Error (MSE) of 868.4690, a Root Mean Squared Error (RMSE) of 29.4698, a Mean Absolute Percentage Error (MAPE) of 0.0117, and an overall accuracy of 99.9824%.
Implementation of Christofides Algorithm to Determine the Shortest Tour of Some Hospitals in Palembang City Putri, Dwi Rizka Amelia; Oktavia, Niken Sabella; Chasanah, Siti Laelatul; Sawitri, Riza; Paskalia, Felicia Andrade
Integra: Journal of Integrated Mathematics and Computer Science Vol. 2 No. 1 (2025): March
Publisher : Magister Program of Mathematics, Universitas Lampung

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

Abstract

Determining the shortest route to connect hospitals is a very important aspect of improving the efficiency of medical service distribution in a big city like Palembang. The shortest tour will result in a shorter time required. This study aims to minimize the time needed for a team of technicians who want to distribute medical equipment and provide simple usage examples to some hospitals in Palembang city. There are 20 hospitals under consideration, and the data on time needed from one hospital to another were obtained from Google Maps. The distance between locations was calculated based on travel time using a four-wheeled vehicle. The Christofides Algorithm will be used in this  problem to determine the shortest tour. The results show that the travel time needed is 171 minutes (only for traveling from one hospital to another and back to the origin, not including the time needed for giving the simple usage of medical equipment). This study provides practical solutions to improve time efficiency, such as delivering medical supplies or emergency response.
The Cleanness Property of The Integers Modulo n (ℤn) 'Aliyah, Dheva Ufiz; Puspita, Nikken Prima; Tjahjana, Redemtus Heru
Integra: Journal of Integrated Mathematics and Computer Science Vol. 1 No. 2 (2024): July
Publisher : Magister Program of Mathematics, Universitas Lampung

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

Abstract

Assume that R is a ring with identity. A ring R is said to be clean when each of its elements can be written as the sum of an idempotent and a unit element within the ring. A stronger condition, known as strongly clean, requires that these elements commute under multiplication. As a special case, a module M over ring R is called a clean module when the endomorphism ring of the M is a clean module over R. Moreover, when the ring endomorphism of R-module M is a strongly clean, then the module M is referred to as a strongly clean. We know that the integers modulo n, denoted by ℤn, is a ring by the set of congruence classes modulo n, with standard addition and multiplication operations. In this study, we explore the cleanness properties of the ring ℤn and establish that it is a strongly clean ring. Furthermore, we study about the cleanness of ℤn as a module over ℤ and investigate the strongly cleanness of it module.

Page 1 of 4 | Total Record : 31