Category: Computer Science

Review maps large language models in automated program repair
—
Systematic review of 189 papers examining Large Language Models for Automated Program Repair from 2020-2025, analyzing LLM architectures, deployment strategies, and applications in bug repair and.

Hybrid reinforcement learning improved music teaching interaction
—
Hybrid reinforcement learning architecture for adaptive music education systems combining PPO with CNN for real-time pedagogical strategy optimization and multimodal learner state classification.

Self-assessment framework standardizes data center efficiency evaluation
—
Modular assessment framework for automated evaluation of data center thermal and energy efficiency using standardized KPI calculations from monitoring systems and historical datasets.

Algorithm generates one-stroke kolams with symmetric gate switching
—
Algorithm for autonomous one-stroke kolam generation using iterative gate-switching on symmetrically arranged anchor-dots, addressing digital preservation of Indian floor art heritage.

Migration-based maintenance is proposed as a future direction
—
Systematic research agenda for migration-based software maintenance automation, establishing a four-stage lifecycle model for transferring knowledge and solutions across software systems.

AGENT improved makespan in heterogeneous cloud task allocation
—
AGENT framework improves task allocation in cloud systems using elitism-guided genetic algorithm with adaptive parameters, achieving 3-29% makespan improvements for heterogeneous VM scheduling.

Website-based POS system improved laundry operations
—
Development and implementation of a website-based POS system for optimizing transaction processing, inventory management, and business operations at a laundry MSME.

FLAT uses formal languages to type strings
—
FLAT uses context-free grammars as type definitions to distinguish semantically different string encodings, enabling type-safe handling of URLs, file paths, and other structured data.

Temporal-clique query processing is made more efficient
—
Temporal-clique subgraph pattern matching via integrated topological and temporal selectivity optimization with specialized join operators and cardinality estimation.










