7,040 research outputs found
An Integrated Deep Learning Model with Genetic Algorithm (GA) for Optimal Syngas Production Using Dry Reforming of Methane (DRM)
The dry reforming of methane is a chemical process transforming two primary sources of greenhouse gases, i.e., carbon dioxide (CO2) and methane (CH4), into syngas, a versatile precursor in the industry, which has gained significant attention over the past decades. Nonetheless, commercial development of this eco-friendly process faces barriers such as catalyst deactivation and high energy demand. Artificial intelligence (AI), specifically deep learning, accelerates the development of this process by providing advanced analytics. However, deep learning requires substantial training samples and collecting data on a bench scale encounters cost and physical constraints. This study fills this research gap by employing a pretraining approach, which is invaluable for small datasets. It introduces a software sensor for regression (SSR) powered by deep learning to estimate the quality parameters of the process. Moreover, combining the SSR with a genetic algorithm offers a prescriptive analysis, suggesting optimal thermodynamic parameters to improve the process efficiency
Resource-aware scheduling for 2D/3D multi-/many-core processor-memory systems
This dissertation addresses the complexities of 2D/3D multi-/many-core processor-memory systems, focusing on two key areas: enhancing timing predictability in real-time multi-core processors and optimizing performance within thermal constraints. The integration of an increasing number of transistors into compact chip designs, while boosting computational capacity, presents challenges in resource contention and thermal management. The first part of the thesis improves timing predictability. We enhance shared cache interference analysis for set-associative caches, advancing the calculation of Worst-Case Execution Time (WCET). This development enables accurate assessment of cache interference and the effectiveness of partitioned schedulers in real-world scenarios. We introduce TCPS, a novel task and cache-aware partitioned scheduler that optimizes cache partitioning based on task-specific WCET sensitivity, leading to improved schedulability and predictability. Our research explores various cache and scheduling configurations, providing insights into their performance trade-offs. The second part focuses on thermal management in 2D/3D many-core systems. Recognizing the limitations of Dynamic Voltage and Frequency Scaling (DVFS) in S-NUCA many-core processors, we propose synchronous thread migrations as a thermal management strategy. This approach culminates in the HotPotato scheduler, which balances performance and thermal safety. We also introduce 3D-TTP, a transient temperature-aware power budgeting strategy for 3D-stacked systems, reducing the need for Dynamic Thermal Management (DTM) activation. Finally, we present 3QUTM, a novel method for 3D-stacked systems that combines core DVFS and memory bank Low Power Modes with a learning algorithm, optimizing response times within thermal limits. This research contributes significantly to enhancing performance and thermal management in advanced processor-memory systems
A heuristic with a performance guarantee for the Commodity constrained Split Delivery Vehicle Routing Problem
The Commodity constrained Split Delivery Vehicle Routing Problem (C-SDVRP) is a routing problem where customer demands are composed of multiple commodities. A fleet of capacitated vehicles must serve customer demands in a way that minimizes the total routing costs. Vehicles can transport any set of commodities and customers are allowed to be visited multiple times. However, the demand for a single commodity must be delivered by one vehicle only. In this work, we developed a heuristic with a performance guarantee to solve the C-SDVRP. The proposed heuristic is based on a set covering formulation, where the exponentially-many variables correspond to routes. First, a subset of the variables is obtained by solving the linear relaxation of the formulation by means of a column generation approach which embeds a new pricing heuristic aimed to reduce the computational time. Solving the linear relaxation gives a valid lower bound used as a performance guarantee for the heuristic. Then, we devise a restricted master heuristic to provide good upper bounds: the formulation is restricted to the subset of variables found so far and solved as an integer program with a commercial solver. A local search based on a mathematical programming operator is applied to improve the solution. We test the heuristic algorithm on benchmark instances from the literature. Several new (best-known) solutions are found in reasonable computational time. The comparison with the state of the art heuristics for solving C-SDVRP shows that our approach significantly improves the solution time, while keeping a comparable solution quality
LIPIcs, Volume 251, ITCS 2023, Complete Volume
LIPIcs, Volume 251, ITCS 2023, Complete Volum
An Optimization Model for Offline Scheduling Policy of Low-density Parity-check Codes
In this study, an optimization model for offline scheduling policy of
low-density parity-check (LDPC) codes is proposed to improve the decoding
efficiency of the belief propagation (BP). The optimization model uses the
number of messages passed (NMP) as a metric to evaluate complexity, and two
metrics, average entropy (AE), and gap to maximum a posteriori (GAP), to
evaluate BP decoding performance. Based on this model, an algorithm is proposed
to optimize the scheduling sequence for reduced decoding complexity and
superior performance compared to layered BP. Furthermore, this proposed
algorithm does not add the extra complexity of determining the scheduling
sequence to the decoding process
- …