Publication Search

This study designs and implements an up-down counter system based on an AT89C2051 microcontroller programmed in assembly using the MC-51 application. The system modifies an existing digital clock board by mapping the display selector pins, seven-segment segment pins, pushbuttons, and buzzer to the microcontroller ports. The research method consists of literature review, hardware identification, algorithm design, assembly programming, program downloading, and functional testing using a 5 V DC supply. The implementation uses a four-digit common-cathode seven-segment display and a multiplexing routine to show the counter value in real time. The functional test shows that the system can display the initial value, increase the value through the up button, and decrease the value through the down button. The display is readable during operation, and the program can run on the target circuit after being downloaded to the AT89C2051. This study confirms that assembly programming on MC-51 can be applied to implement a simple counter system on a reused digital clock circuit. The main limitations are the absence of explicit button debouncing, overflow and underflow protection, quantitative response-time measurement, and non-volatile data retention.

Python programming has become a fundamental competence in the digital era, yet students often struggle to transform algorithmic logic into functional code. This gap between conceptual understanding and practical implementation skills requires a thorough investigation into learning challenges within the Industrial Informatics Engineering Technology (TRIN) program at Politeknik Manufaktur Bandung. Grounded in Bloom's Revised Taxonomy and Cognitive Load Theory, this descriptive quantitative study utilized a Likert-scale questionnaire and an objective comprehension test administered to 87 third-year students. Data were analyzed using descriptive statistics to map performance across three aspects: conceptual understanding, syntactic comprehension, and implementation ability. Results indicate the conceptual aspect achieved the highest average of 4.15, followed by syntax at 3.56 and implementation at 3.54, with objective test accuracy rates of 76.09%, 65.52%, and 67.36%, respectively. Major obstacles identified include difficulties with looping, debugging, and comparison operators. Therefore, enhanced structured practice and Project-Based Learning approaches are recommended to strengthen students' implementation competencies.

The increase in activity and security threats on Ubuntu server causes the volume of system logs to become very large and difficult to analyze manually. This condition potentially leads administrators to experience delays in detecting abnormal activities, such as repeated login attempts and web access patterns related to online gambling promotions. Therefore, this research aims to develop a machine learning-based Early Warning System capable of automatically detecting anomalous activities. The system is developed using the Python programming language and runs on an Ubuntu server by utilizing authentication logs and web access logs as the main data sources. The anomaly detection model is trained using normal activity data collected directly from the Ubuntu server logs to learn standard system behavior patterns. During the operational phase, the system reads server logs in real-time, extracts activity features, and analyzes them using the Isolation Forest algorithm. Activities detected as anomalies trigger alert notifications via Telegram to the administrator without performing automatic blocking. The results show that the system is able to provide early warnings for suspicious activities, thereby helping to improve server security more effectively.

The distribution of social assistance in Indonesia faces challenges such as inaccurate recipient data, overlapping programs, and limitations of traditional data management systems that lead to inaccurate targeting of aid. This study proposes a social assistance distribution optimization system using the Greedy algorithm that assesses recipient priorities based on economic conditions, number of family members, location, and urgency of needs with certain weights to produce objective rankings. This system is implemented in a JavaScript-based web application without external frameworks, making it lightweight and easily accessible. Simulations with 20 prospective recipients and a quota of 10 slots and validation with a dataset of 10,000 entries show that the Greedy algorithm produces identical results to Dynamic Programming but is much faster (669 times faster). In terms of complexity, this algorithm has O(n log n) time and O(n) space, and meets the requirements of the Greedy Choice Property and Optimal Substructure, making it a practical and efficient solution for managing large-scale social assistance distribution in Indonesia.

Optimization problems in computer science often arise when a system must select the best combination from several alternatives under limited resources such as capacity, time, or cost. One commonly used optimization model is the Knapsack Problem, which involves selecting a number of items with specific weights and values to obtain the maximum profit without exceeding the available capacity. This study aims to analyze and compare the performance of the Greedy algorithm and Dynamic Programming in solving the 0–1 Knapsack Problem. The research employs a quantitative experimental approach by implementing both algorithms in a computer program and testing them on several datasets with different sizes. The evaluation parameters include the maximum value obtained and the algorithm execution time. The results show that the Greedy algorithm has faster execution time and more efficient memory usage, but it does not always produce an optimal solution. In contrast, the Dynamic Programming algorithm consistently produces an optimal solution, although it requires greater computational time. Therefore, the choice of algorithm should be adjusted to system requirements, whether prioritizing computational efficiency or optimal solution quality.

This study examines the development of a Crude Palm Oil (CPO) price forecasting model using an artificial neural network algorithm, specifically the backpropagation algorithm. As one of Indonesia’s main export commodities, CPO has a significant economic impact and influences the income of oil palm farmers. The CPO price data used in this study were obtained from CIF Rotterdam, covering the period from January 2019 to December 2023. The research methodology consists of several stages, including data collection, preprocessing, model design, and model implementation using Python programming. The training results of the backpropagation algorithm show an error value of 0.537829578 after 1,000 epochs, while the evaluation using Mean Squared Error (MSE) indicates an MSE of 0.022709 during the training process and 0.017604 during the testing process. The model also produces CPO price predictions for the next three months, namely 932.578 for the first month, 949.568 for the second month, and 774.855 for the third month. These findings indicate that the developed model is capable of predicting future CPO prices with adequate accuracy, which can assist companies in making better financial decisions and managing risks associated with CPO price fluctuations.

This study investigates the integration of computational thinking (CT) principles with adaptive curricula to enhance problem-solving skills in undergraduate programming education. Traditional programming curricula often emphasize syntax and basic concepts, neglecting critical problem-solving strategies. The adaptive curriculum framework used in this study combines CT skills such as decomposition, pattern recognition, abstraction, and algorithmic thinking with personalized learning experiences. A mixed-method approach, combining qualitative and quantitative research, was employed to assess the effectiveness of this integrated approach. The results show significant improvements in students' problem-solving abilities, conceptual understanding, and engagement compared to a control group following a traditional curriculum. Students in the experimental group, which received the adaptive curriculum, demonstrated better performance in applying algorithms and debugging code. Additionally, students expressed higher levels of engagement and motivation, suggesting that the personalized learning environment fostered greater academic involvement. The study highlights the importance of integrating CT principles with adaptive learning frameworks to create a more inclusive and effective learning environment that accommodates diverse learning needs. The findings suggest that adaptive curricula can bridge gaps in traditional education by providing personalized support and ensuring that students progress at their own pace. This approach is especially beneficial for programming education, where both conceptual understanding and practical problem-solving skills are critical for success. Future research should explore the long-term impact of adaptive learning frameworks and investigate how these technologies can be integrated with traditional teaching methods to maximize their effectiveness.

This study evaluates the efficiency of two artificial intelligence models, DeepSeek and OpenAI, in generating code for algorithmic systems. Efficiency is assessed through execution speed, code accuracy, and the number of code characters produced. Data were collected from 100 tests covering search, sorting, graph, dynamic programming, optimization, data processing, text, and machine learning algorithms. The objective is to compare the performance of both models to support the development of efficient information retrieval systems. The method involves algorithm testing with statistical analysis of execution time, accuracy, and code length. Results indicate that DeepSeek has an average execution time of 28.74 seconds, slightly slower than OpenAI’s 28.49 seconds. However, DeepSeek’s accuracy (85.88%) surpasses OpenAI’s (85.03%). The average number of code characters is identical at 96.35 characters. The study concludes that DeepSeek excels in accuracy, while OpenAI is faster in certain cases, providing valuable insights for developers in selecting AI models for information retrieval applications.