<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>OAR@UM Community:</title>
    <link>https://www.um.edu.mt/library/oar/handle/123456789/10956</link>
    <description />
    <pubDate>Wed, 08 Apr 2026 05:01:29 GMT</pubDate>
    <dc:date>2026-04-08T05:01:29Z</dc:date>
    <item>
      <title>Towards the efficient adaptation of offline physically based methods for real-time rendering</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/144338</link>
      <description>Title: Towards the efficient adaptation of offline physically based methods for real-time rendering
Abstract: Rendering physically accurate caustics in real-time remains a persistent challenge due&#xD;
to their complex light interactions and high-frequency features. This thesis presents a&#xD;
comprehensive exploration into adapting oìine physically based rendering techniques&#xD;
for real-time caustic synthesis on modern GPU architectures. Central to this work is&#xD;
CandelaDXR, a GPU-accelerated light tracer that employs novel importance sampling&#xD;
strategies to improve convergence speed and visual adelity for caustics. By generating dynamic probability distribution functions conditioned on scene geometry, camera&#xD;
parameters, and material properties, CandelaDXR prioritises specular interactions and&#xD;
focuses sampling eêorts on perceptually relevant regions. To support this system, two&#xD;
auxiliary tools were developed: Anvil, a modular visual debugging platform for rendering pipelines,      and Forge, an evaluation framework designed to facilitate reproducible,&#xD;
cross-system comparisons. These tools provide both insight and rigour in diagnosing&#xD;
rendering artefacts and validating algorithmic improvements. Additionally, the thesis&#xD;
introduces a spectral denoising pipeline tailored to the distinct characteristics of caustic&#xD;
signals, demonstrating the eêectiveness of Fourier, wavelet and curvelet-based transforms in preserving detail while reducing noise. Quantitative results across multiple&#xD;
scenes and viewpoints reveal signiacant performance gains, noise reduction, and perceptual improvements in CandelaDXR over baseline methods. Collectively, this work&#xD;
contributes a uniaed architecture for real-time caustic rendering, debugging, and evaluation,         offering practical advances in both rendering theory and implementation for&#xD;
real-time physically based graphics.
Description: Ph.D.(Melit.)</description>
      <pubDate>Wed, 01 Jan 2025 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/144338</guid>
      <dc:date>2025-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Beyond single traces : implementing multiple execution monitoring in DetectEr</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/140084</link>
      <description>Title: Beyond single traces : implementing multiple execution monitoring in DetectEr
Abstract: Runtime verification (RV) has emerged as a crucial technique for ensuring software&#xD;
correctness by monitoring system execution against formally specified properties.&#xD;
However, traditional RV approaches are limited to analyzing single execution traces,&#xD;
restricting their ability to verify properties that require evidence from multiple system&#xD;
runs, particularly in branching-time systems. This project extends DetectEr, an&#xD;
open-source runtime verification tool for actor-based systems, to support multiple&#xD;
execution monitoring. The extension enables verification of safety properties&#xD;
expressed in sHML∨&#xD;
Det, an enhanced specification language that incorporates disjunctive&#xD;
operators beyond the original Safety Hennessy-Milner Logic (sHML). The&#xD;
implementation addresses three key challenges: adapting the theoretical framework to&#xD;
handle first-order events with data values, developing a robust history aggregation&#xD;
mechanism using Erlang Term Storage tables with trace normalisation, and&#xD;
implementing a breadth-first search algorithm for the history analysis proof system.&#xD;
The approach successfully demonstrates the practical feasibility of multiple execution&#xD;
monitoring through evaluation using a calculator server case study. The results show&#xD;
that the extended framework maintains backward compatibility with existing DetectEr&#xD;
functionality while enabling verification of previously unmonitorable properties, such&#xD;
as implication-based conditions requiring evidence across multiple execution traces.&#xD;
This work contributes to the runtime verification field by demonstrating that multiple&#xD;
execution monitoring can be effectively integrated into existing RV frameworks,&#xD;
expanding their verification capabilities.
Description: B.Sc. (Hons)(Melit.)</description>
      <pubDate>Wed, 01 Jan 2025 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/140084</guid>
      <dc:date>2025-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>A novel data structure for voxel rendering</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/140083</link>
      <description>Title: A novel data structure for voxel rendering
Abstract: This project presents a novel data structure implementation designed specifically for&#xD;
voxel‐based rendering. The primary aim is to develop a dynamic system capable of&#xD;
managing voxel data efficiently while supporting real‐time updates and rendering. By&#xD;
leveraging a tiered hierarchy of sectors, chunks, and compact voxel arrays, the system&#xD;
allows for fast access, minimal memory overhead, and smooth integration with a mesh&#xD;
generation pipeline. Key features include spatial indexing, chunk‐level organisation,&#xD;
and dynamic streaming, all geared towards maintaining responsiveness in large or&#xD;
procedurally generated worlds.&#xD;
To evaluate the effectiveness of the design, a range of configurations and&#xD;
workloads were tested, including variations in voxel storage models, mesh generation&#xD;
strategies, and level‐of‐detail (LOD) approaches. Benchmarks were gathered to assess&#xD;
memory usage, update times, and mesh complexity across different scenarios. While&#xD;
the implementation does not aim to outperform all alternatives, it prioritises simplicity,&#xD;
extensibility, and practical performance for real‐time applications, offering a solid&#xD;
foundation for further development and experimentation.
Description: B.Sc. (Hons)(Melit.)</description>
      <pubDate>Wed, 01 Jan 2025 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/140083</guid>
      <dc:date>2025-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Comparing performance and scalability of a microservice oriented architecture vs a monolithic architecture for e‐commerce platforms</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/140081</link>
      <description>Title: Comparing performance and scalability of a microservice oriented architecture vs a monolithic architecture for e‐commerce platforms
Abstract: This dissertation presents a comprehensive performance evaluation and architectural&#xD;
comparison between microservices and monolithic systems within the context of an&#xD;
e‐commerce application. The study involves the development of two implementations:&#xD;
one as a distributed system comprising several microservices, namely the user‐service,&#xD;
order‐service, and product‐service, coordinated by an Application Programming&#xD;
Interface (API) gateway that converts JSON Web Token (JWT) tokens into custom&#xD;
headers for inter‐service communication, and the other as a traditional monolithic&#xD;
system. The microservices integrate Kafka for asynchronous messaging, and both&#xD;
architectures integrate PostgreSQL for shared data persistence, with container&#xD;
orchestration provided via Docker.&#xD;
Performance tests using Apache JMeter reveal that, under identical resource&#xD;
allocations, the monolithic architecture consistently delivers lower latency and higher&#xD;
throughput due to the absence of inter‐service overhead. Only when compute cores&#xD;
are reallocated to the hot path in the microservices setup does it surpass the monolith,&#xD;
achieving a 37% reduction in mean latency and a 59% increase in throughput, albeit at&#xD;
the expense of nearly double the peak CPU utilisation.&#xD;
In addition, database statistics gathered and visualised using&#xD;
Postgres‐exporter, cAdvisor and Grafana provide insights into query patterns&#xD;
and resource utilisation, confirming that neither architecture is database bound and&#xD;
that application and network factors dominate end to end performance.
Description: B.Sc. (Hons)(Melit.)</description>
      <pubDate>Wed, 01 Jan 2025 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/140081</guid>
      <dc:date>2025-01-01T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

