<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>OAR@UM Community:</title>
  <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/14102" />
  <subtitle />
  <id>https://www.um.edu.mt/library/oar/handle/123456789/14102</id>
  <updated>2026-05-21T18:48:12Z</updated>
  <dc:date>2026-05-21T18:48:12Z</dc:date>
  <entry>
    <title>Feedback loops and bias in machine learning algorithms for predictive policing</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/146069" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/146069</id>
    <updated>2026-04-30T09:37:45Z</updated>
    <published>2025-01-01T00:00:00Z</published>
    <summary type="text">Title: Feedback loops and bias in machine learning algorithms for predictive policing
Abstract: Predictive policing describes several emerging practices of implementing artificial&#xD;
intelligence and machine learning in police work, specifically in attempting to predict&#xD;
future crimes through algorithmic crime forecasting. These emerging practices have&#xD;
introduced many new opportunities for improved police work, but critics of predictive&#xD;
policing have raised both ethical and practical concerns. These concerns include the&#xD;
risk of feedback loops and bias. This thesis aims to contribute to this ongoing debate&#xD;
by examining how algorithmic crime forecasting tools produce bias and feedback loops&#xD;
and by exploring if it is possible to create algorithmic crime forecasting tools with&#xD;
reduced tendencies towards bias and feedback loops.&#xD;
Specifically, the focus is on the seminal and widely adopted PredPol system,&#xD;
which is based on an earthquake prediction system known as Epidemic Type&#xD;
Aftershock Sequence (ETAS). The methodology used in this studywas to replicate&#xD;
studies detailing the PredPol system, as well as studies criticising it. Based on previous&#xD;
findings by critics, a synthetic population and urn modelling was used to demonstrate&#xD;
the negative tendencies of the system.&#xD;
Based on this, an original framework was developed for evaluating&#xD;
modifications made to the algorithm by measuring the effectiveness in reducing&#xD;
feedback loop tendencies and improving fairness. This is done through metrics like&#xD;
the Predictive Accuracy Index (PAI), variations in the mean conditional intensity&#xD;
rates, λ, and the total fairness score, which evaluates the consistency of law&#xD;
enforcement attention across different demographic groups.&#xD;
To reduce the algorithm’s tendencies towards bias and feedback loops, a&#xD;
modified algorithm using rejection sampling and a fairness penalty was developed.&#xD;
While the proposed algorithmic adjustments lead to increased fairness and reduced&#xD;
feedback loop generation in predictive policing, they also introduce some trade-offs in&#xD;
predictive performance, particularly noted in the PAI values. However, the&#xD;
enhancements significantly mitigate biased policing practices and reduce the&#xD;
perpetuation of historical inequities, aligning more closely with ethical standards.
Description: M.Sc. ICT(Melit.)</summary>
    <dc:date>2025-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Monitoring incomplete traces navigating uncertainty</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/146067" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/146067</id>
    <updated>2026-04-30T09:33:16Z</updated>
    <published>2025-01-01T00:00:00Z</published>
    <summary type="text">Title: Monitoring incomplete traces navigating uncertainty
Abstract: As software systems scale in size and complexity, manual code reviews&#xD;
become increasingly more resource intensive, underscoring the critical&#xD;
need for reliable Runtime Verification (RV) techniques. Traditional RV                                                                    approaches assume complete access to error-free execution trace, an                                                                  assumption that is untenable in real-world scenarios. This work address&#xD;
the challenges of monitoring such incomplete traces by proposing a novel&#xD;
methodology that synthesises sound and modular runtime monitors.&#xD;
Building upon detectEr, our monitors are able to handle non-consecutive&#xD;
missing events in observed traces. We demonstrate a scalable and sound&#xD;
framework that facilitates verdict generation through deterministic state&#xD;
inference, enabling monitors to achieve greater completeness on data&#xD;
restricted traces. The methodology combines a theoretically rigorous                                                                            approach with practicality in mind, utilising an automaton-guided state                                                                    regeneration technique for state inference.&#xD;
The findings from our evaluation demonstrate the efficacy of the                                                                           proposed solution across several examples. The modular monitors are                                                                  capable of navigating through data-restricted traces and producing sound,&#xD;
irrevocable verdicts. This thesis contributes to the field of RV by establishing                                                           a sound foundation for the deterministic inference of missing events&#xD;
in incomplete traces, and also provides a framework that increases the&#xD;
applicability of monitors by taking a compositional approach to monitor&#xD;
synthesis.&#xD;
By bridging a gap that is often overlooked in this field,such a solution is                                                                  required, especially in recent years, as systems are becoming exponentially&#xD;
more complex.
Description: M.Sc. ICT(Melit.)</summary>
    <dc:date>2025-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Investment portfolio through evolutionary algorithm</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/146015" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/146015</id>
    <updated>2026-04-29T09:56:23Z</updated>
    <published>2025-01-01T00:00:00Z</published>
    <summary type="text">Title: Investment portfolio through evolutionary algorithm
Abstract: This dissertation investigates the application of evolutionary algorithms—specifically &#xD;
the Genetic Algorithm (GA) and Simulated Annealing (SA)—for portfolio optimisation &#xD;
within the S&amp;P 500, addressing the limitations of traditional models. The &#xD;
methodology uses Gower’s distance to handle mixed numerical and categorical data, &#xD;
allowing for the construction of factor-aligned portfolios based on Growth, Value, and &#xD;
Quality dimensions. The primary optimisation objective is to maximise the Sortino &#xD;
Ratio, focusing on downside-risk-adjusted returns. &#xD;
The methodology employs composite feature engineering to rank stocks across &#xD;
Growth, Value, and Quality dimensions, followed by distance-based clustering and &#xD;
anomaly detection to reveal market structures. GA and AGA are then applied with &#xD;
objective functions designed to maximise the Sortino Ratio, which emphasises &#xD;
downside-risk-adjusted returns. Hyperparameters such as population size, mutation &#xD;
rate, crossover probability, and annealing temperature schedules are tuned to &#xD;
balance exploration and exploitation. &#xD;
Empirical evaluation demonstrates that both GA and AGA generate highly diversified &#xD;
portfolios with competitive performance. The GA-optimised maximum Sortino &#xD;
portfolio achieved an annualised return of 18.95%, a Sortino Ratio of 1.0999, and a &#xD;
beta of 0.98, indicating strong returns with reduced downside risk relative to the &#xD;
market. Comparative analysis reveals that AGA converges faster and achieves &#xD;
marginally superior downside protection, validating its advantage in complex search &#xD;
landscapes. Complementary tools such as similarity maps, hierarchical clustering, &#xD;
and a diversification recommender further enhance interpretability and practical &#xD;
applicability. &#xD;
The results underscore the potential of evolutionary algorithms to construct robust, &#xD;
risk-aware investment portfolios that go beyond linear optimisation frameworks. By &#xD;
combining factor-based insights with evolutionary optimisation, this work contributes &#xD;
to the growing literature on computational finance and demonstrates actionable &#xD;
applications for institutional and retail portfolio managers.
Description: M.Sc.(Melit.)</summary>
    <dc:date>2025-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Hand-gesture recognition based on sEMG using deep learning architectures</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/146014" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/146014</id>
    <updated>2026-04-29T09:50:06Z</updated>
    <published>2025-01-01T00:00:00Z</published>
    <summary type="text">Title: Hand-gesture recognition based on sEMG using deep learning architectures
Abstract: Hand gesture recognition is a key area in non-verbal communication, &#xD;
enabling intuitive and touchless interaction between individuals and digital &#xD;
systems. As non-verbal communication plays a vital role in human &#xD;
interaction, hand gesture recognition systems can improve accessibility and &#xD;
increase communication efficiency. Over time, hand-gesture recognition &#xD;
has been considered more important, and this can be achieved by using &#xD;
surface electromyography (sEMG) signals. SEMG is a type of &#xD;
electromyography (EMG) procedure where the signals are recorded on the &#xD;
skin surface rather than within the muscle. &#xD;
The main problem with sEMG signals is that there are several physiological &#xD;
processes in the skeletal muscles underlying their generation. This is the &#xD;
main reason gesture recognition using an sEMG is a non-trivial task. &#xD;
Noise is also a contributing factor to the problem with sEMG signals. A &#xD;
dataset is created with 30 participants and 10 communication hand &#xD;
gestures that is then split between training, validation, and testing. To &#xD;
create the dataset, sEMG signals are collected via a controlled experiment &#xD;
using a hand gesture recording device such as the Myo armband. &#xD;
This study explores deep learning algorithms for hand gesture classification &#xD;
and evaluation. The implementation of real-time hand gesture recognition &#xD;
is studied using Convolutional Neural Networks (CNNs) and Long Short&#xD;
Term Memory (LSTM). The research examines how these models can adapt &#xD;
to dynamic movement and positioning, which may affect recognition &#xD;
accuracy. A key objective of this study is to provide a reliable and efficient &#xD;
manner in predicting hand gestures, making it applicable in various fields. &#xD;
One of those fields is verbal communication throughout the day. &#xD;
Experimental results demonstrate the reliability of integrating gesture &#xD;
recognition into an information system that predicts hand gestures in real&#xD;
time, offering improved accessibility and communication support. By &#xD;
optimising feature selection and model performance, this research &#xD;
contributes valuable insights for advancing gesture-based predictive &#xD;
systems, by achieving a net result of 80.67% for the recognition of 10 hand &#xD;
gestures. This dissertation enhances the field of non-verbal communication &#xD;
through gesture recognition, paving the way for more sophisticated and &#xD;
accessible interaction technologies.
Description: M.Sc.(Melit.)</summary>
    <dc:date>2025-01-01T00:00:00Z</dc:date>
  </entry>
</feed>

