<?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 Collection:</title>
  <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/21921" />
  <subtitle />
  <id>https://www.um.edu.mt/library/oar/handle/123456789/21921</id>
  <updated>2026-06-14T12:02:14Z</updated>
  <dc:date>2026-06-14T12:02:14Z</dc:date>
  <entry>
    <title>Application and improvement of genetic algorithms and genetic programming towards the fight against spam and other internet malware</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/73653" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/73653</id>
    <updated>2021-04-14T13:44:31Z</updated>
    <published>2017-01-01T00:00:00Z</published>
    <summary type="text">Title: Application and improvement of genetic algorithms and genetic programming towards the fight against spam and other internet malware
Abstract: While spam is increasingly acknowledged as a very expensive problem on the Internet, &#xD;
spam filters attempt to detect spam from emails with the highest possible accuracy. &#xD;
Reverse Polish Notation (RPN) expressions are proposed as a means to combine a range &#xD;
of evaluated features from emails for the detection of spam. Theoretical arguments for &#xD;
the use of RPN expressions applied to spam detection are proposed, together with a new &#xD;
RPN Block Representation. Theoretical comparisons of RPN expressions with Naïve &#xD;
Bayes and Support Vector Machine are also given. It is shown that such RPN expressions &#xD;
are more expressive. A proof that email spam detection is NP-complete is given by &#xD;
mapping groups of email spams onto malware virus families. Seventy-two features, &#xD;
ranging from Subject-line, Header-based, Message Body-based, URL-based and &#xD;
stylistic, have been used to evolve RPN expressions using Linear Genetic Programming. &#xD;
New features and specifically the application of a group of URL features to spam &#xD;
detection are proposed (since many spams contain links to domains which are at times &#xD;
even malicious). These new features are shown to be useful for spam detection &#xD;
theoretically and in practice. Linear Genetic Programming is a subset of Genetic &#xD;
Programming where chromosomes are computer programs represented using imperative &#xD;
computer language instructions or machine code instead of trees made up of symbolic &#xD;
expressions. Such machine code can encode RPN expressions. The Linear Genetic &#xD;
Programming system is used to “learn” an RPN expression consisting of a combination &#xD;
of features which can be used to detect spam.&#xD;
A number of feature selection algorithms are used to identify which subsets of features &#xD;
are most relevant to classification. The feature selection techniques Minimum &#xD;
Redundancy Maximum Relevance method (this filter technique finds features which are &#xD;
mutually far from each other while still having high “correlation” to classification), the &#xD;
conventional Maximum Relevance method, Principle Component Analysis and using &#xD;
the entire feature set are investigated using the Linear Genetic Programming system &#xD;
applied to the SpamAssassin Spam Corpus, which is a standard ham and spam archive. &#xD;
Theoretical and practical comparisons with literature results and industry open source &#xD;
applications are given for the proposed system.&#xD;
A new Block Crossover operator which helps preserve and keep intact RPN Blocks as &#xD;
well as a new RPN First Subexpression algorithm are also proposed. This algorithm &#xD;
helps to maintain a double check for spam and ham and results in improvement of &#xD;
detection accuracy and other metrics. The system was very demanding computationally, &#xD;
taking a long time to run on a supercomputer. The proposed system achieved 99.17% &#xD;
accuracy and an F1-score of 0.9868, which compare very well with results given in the &#xD;
literature as well as with performance of industrial Bogofilter and SpamAssassin Spam &#xD;
Filters.
Description: PH.D.</summary>
    <dc:date>2017-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Indoor location system</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/41423" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/41423</id>
    <updated>2019-03-21T02:21:15Z</updated>
    <published>2017-01-01T00:00:00Z</published>
    <summary type="text">Title: Indoor location system
Abstract: The objective of this project is to design and develop a mobile oriented, indoor location technique. Existing outdoor triangulation positioning techniques like Global Positioning System (GPS) and Globalnaya Navigazionnaya Sputnikovaya Sistema (GLONASS) prove futile and are generally not suitable or accurate enough for indoors, particularly for multilevel buildings. The set goal is to design a system that enables a single Wi-Fi access point (AP) to locate the client device, without support from any additional infrastructure in place. Further, no prior radio-frequency ﬁnger-printing procedure is required, thus reducing the computational complexity signiﬁcantly. This report reviews attempts to design a novel positioning approach with the help of current knowledge. The method suggested in this report is a hybrid angle of arrival (AoA) and received signal strength (RSS) technique. By making use of ray tracing to characterise the propagation in a multi-path rich environment and taking advantage of beamforming and the multiple-input and multiple-output (MIMO) system, a fairly accurate estimation can be obtained. Making use of a ray-tracing analysis, as presented herein, allows for site-speciﬁc location positioning using only a single AP. The objective of the report is to present the methodologies and complications encountered in implementing such a system and to present a preliminary analysis of calculations, measurement accuracy and simulation of the suggested algorithm.
Description: B.SC.(HONS)COMPUTER ENG.</summary>
    <dc:date>2017-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Hand drawn sketch drawings to vector graphics</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/38983" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/38983</id>
    <updated>2019-02-06T10:30:58Z</updated>
    <published>2017-01-01T00:00:00Z</published>
    <summary type="text">Title: Hand drawn sketch drawings to vector graphics
Abstract: Computer Numerical Control (CNC) machines and 3D printers are becoming more&#xD;
accessible. This allows artists and consumers to create physical objects from their&#xD;
drawn ideas. However, many artists are more familiar with the traditional method of&#xD;
sketching which uses raster format. For these kind of devices, a special instruction set&#xD;
based on vector notations is used which requires specialised software. One problem is&#xD;
that learning a new interface or technology for 3D modelling is not trivial and some&#xD;
might give up before trying. A bridge that easily connects these two worlds would&#xD;
be beneficial to both. However, even though the interpretation of sketches appears to&#xD;
be trivial for humans, so cannot be said for machines. This holds particularly true&#xD;
when artists use artistic cues such as shadows to represent depth. Additionally, hand&#xD;
drawn sketches are intrinsically imperfect and might contain curves making the gap&#xD;
between raster to vector hard to reduce. In this research, a method that automatically&#xD;
converts hand-drawn sketches in presence of shadows and curves is presented. The&#xD;
following study is divided into two section. The first section deals with junction&#xD;
localisation and identification to ensure that the topological fidelity of the drawing&#xD;
is retained. When compared to current state of the art, the results obtained shows&#xD;
an improvement of 61% when the proposed methodology was evaulated for junction&#xD;
spatial localisation using Salient Point Error over the same dataset. Even though&#xD;
junction type identification was not used during the proposed vectorisation pipeline,&#xD;
a number of methods were described and evaluated for junction type classification.&#xD;
Classification was performed using three methodologies and the best classification&#xD;
results obtained an F-score of 0.95. The second section dealt with contour extraction&#xD;
to remove shadows and other artefacts from the drawings. Each pixel was assigned&#xD;
an orientation based on the direction of the surrounding pixels and used the result&#xD;
was used to identify the path between two connected junctions. Unconnected lines&#xD;
and recovery of missed junctions were also considered. An average F-measure score of&#xD;
0.992 was obtained over the whole dataset when the ground truths and the vectorised&#xD;
images were compared using a contour evaluation protocol. A dataset of 17 images was&#xD;
used to cover drawings created in sketching software and on paper using straight and&#xD;
curved lines. The reconstruction was performed using either lines, arcs or splines as&#xD;
deemed the most adequate. We showed that our method performed better in junction&#xD;
and contour detection and the results obtained were consistent throughout the whole&#xD;
dataset including straight and curved lines drawings.
Description: M.SC.ARTIFICIAL INTELLIGENCE</summary>
    <dc:date>2017-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Semi-automatic segmentation of human anatomical imagery</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/38859" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/38859</id>
    <updated>2019-02-12T08:37:23Z</updated>
    <published>2018-01-01T00:00:00Z</published>
    <summary type="text">Title: Semi-automatic segmentation of human anatomical imagery
Abstract: Manual segmentation of anatomical imagery is a challenging and laborious task&#xD;
which this dissertation attempts to alleviate. We present a semi-automatic segmentation&#xD;
system which operates on a new data set of photographic human anatomical&#xD;
imagery. A morphological tree-based segmentation method was utilised in order&#xD;
to reach this aim. We placed a particular focus on elongated structures in order&#xD;
to demonstrate the e ectiveness of the algorithms. The resultant outputs&#xD;
were presented to academics in the anatomical sciences for evaluation. Qualitative&#xD;
and quantitative results which were collected throughout the course of the experimentation&#xD;
phase indicate that the system was successful in producing meaningful&#xD;
labelled segmentation outputs with particularly good performance on elongation,&#xD;
which were commended by the experts. We believe that these results provide a&#xD;
good initialisation step for more re ned labelled images which can be used in a&#xD;
number of di erent professional and educational tools. Furthermore, the outcome&#xD;
of this dissertation demonstrates that a technical window exists in this area, and&#xD;
a foundation for further research has been created in this work.
Description: M.SC.ARTIFICIAL INTELLIGENCE</summary>
    <dc:date>2018-01-01T00:00:00Z</dc:date>
  </entry>
</feed>

