<?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/77440" />
  <subtitle />
  <id>https://www.um.edu.mt/library/oar/handle/123456789/77440</id>
  <updated>2026-04-13T00:52:42Z</updated>
  <dc:date>2026-04-13T00:52:42Z</dc:date>
  <entry>
    <title>Using social media as a basis for marketing initiatives</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/95971" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/95971</id>
    <updated>2022-05-19T08:08:20Z</updated>
    <published>2015-01-01T00:00:00Z</published>
    <summary type="text">Title: Using social media as a basis for marketing initiatives
Abstract: In computing, social media is represented as a mathematical graph which depicts users&#xD;
as nodes, and interactions as edges. Users are either persons or company profiles - even&#xD;
a specific product. The edges convey feelings, likings and acceptance which are known&#xD;
to be very useful for businesses to understand better their product's perception by users&#xD;
and consequently influence the business's marketing tactics. Due to the remarkable&#xD;
popularity reached by social media platforms, the data available is so vast that many&#xD;
marketing experts cannot ascribe significant meaning when looking at it as it is.&#xD;
The purpose of this project is to tap into this data from two popular social media&#xD;
platforms, and transform and process it in a way to enable deeper knowledge extraction&#xD;
that is usable in a marketing initiative. The final artefact of this project acquires data&#xD;
from the two platforms by connecting, and sending requests to their APIs. These requests&#xD;
return responses consisting of data available with regards to that particular request. This&#xD;
data is then processed to create one consolidated model encompassing the data acquired&#xD;
from both sources. This is then stored in a graph based data model which is queried as&#xD;
required.&#xD;
The data returned by the APIs highly depends on the social media platform itself as they&#xD;
have included further privacy concerns in their latest APIs which limits the data in the&#xD;
response. This artefact works with the given public data, however if users give&#xD;
permission to use their data in the application, it would be able to give more insightful&#xD;
information. The end result of this artefact consists of a number of charts which portray&#xD;
significant information that help business users to understand their fans and hence&#xD;
improve their marketing campaign.
Description: B.Sc. IT (Hons)(Melit.)</summary>
    <dc:date>2015-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Exam time-table scheduling</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/95519" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/95519</id>
    <updated>2022-10-06T10:05:00Z</updated>
    <published>2014-01-01T00:00:00Z</published>
    <summary type="text">Title: Exam time-table scheduling
Abstract: Exam timetable scheduling is a complex problem which often has to be dealt with at&#xD;
Universities. This project investigates this problem for the Faculty of ICT in University&#xD;
of Malta (UoM). Currently, examination officers start this process several weeks before&#xD;
examination period. The work involves dedicating approximately 2 working days to produce an initial draft, and performing changes upon student and/ or staff complaints, until&#xD;
a final timetable is prepared, possibly weeks later. This dissertation demonstrates how,&#xD;
using Genetic Algorithms, this process can be complete in just about 1 minute, while also&#xD;
improving the quality of timetables from those generated by hand. Apart from generating&#xD;
a timetable which is conflict free and significantly minimizes near exam occurrences for&#xD;
students during this stressful period, an intuitive user interface, with a calendar design,&#xD;
is also provided to aid examination officers through the whole process of producing a final timetable. This includes making the whole system interactive and providing useful&#xD;
information to accommodate for late changes, optional units from other faculties, and&#xD;
special requests which are especially common in real-word problem applications.
Description: B.Sc. IT (Hons)(Melit.)</summary>
    <dc:date>2014-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Improving airlines' real-time, online reservation systems</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/95381" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/95381</id>
    <updated>2022-05-10T09:35:29Z</updated>
    <published>2013-01-01T00:00:00Z</published>
    <summary type="text">Title: Improving airlines' real-time, online reservation systems
Abstract: The use of online Airline Reservation Systems in these last years has lead to an&#xD;
increase demand for customer satisfaction and loyalty which would then enable the&#xD;
airline to remain competitive. State of the art technology advancement in this area is&#xD;
vital in order to make online booking systems more user-friendly and customer oriented especially nowadays with the notion of low cost airlines and other external&#xD;
forces in the industry. It is clear from this study that not all the airlines realise the&#xD;
difference between a common website and an ideal one. [ 4]&#xD;
In order to achieve my aims and objectives, the following procedures were&#xD;
incorporated. Firstly, information was gathered by making use of a survey and a set of&#xD;
fifteen questionnaires, to formulate a better picture as to what customers expect from&#xD;
such systems. Apart from that existing frameworks were considered as the foundation&#xD;
on which to build up my improved airline reservation system.&#xD;
The airline website was developed using the .NET technology, specifically the&#xD;
ASP.NET for the front-end of the system. C# was then used for the handling of logic&#xD;
aspects of the site. Additionally, the database tables were stored in Sequel Server 2008&#xD;
RS.&#xD;
This research evaluates some of the most leading airline websites in the industry. The&#xD;
aim is to propose and design an improved airline reservation website following certain&#xD;
specified criteria which encourages more users to make use of the new e-commerce&#xD;
phenomenon and rendering more money to the company. The final result is aimed at&#xD;
providing passengers with an inbuilt, user friendly interface and additional features to&#xD;
cater for their needs.&#xD;
Finally, the online booking system is geared at integrating travellers from all sectors of&#xD;
society. This is setup to manifest the benefit of e-commerce to both passengers using conventional methods and also those technological oriented individuals. &#xD;
conventional methods and also those technological oriented individuals.
Description: B.Sc. IT (Hons)(Melit.)</summary>
    <dc:date>2013-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Decision tree learning algorithms in a cloud computing environment, utilizing the map reduce programming framework</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/95316" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/95316</id>
    <updated>2022-05-09T13:16:15Z</updated>
    <published>2013-01-01T00:00:00Z</published>
    <summary type="text">Title: Decision tree learning algorithms in a cloud computing environment, utilizing the map reduce programming framework
Abstract: Decision tree learning algorithms are one of the most commonly used techniques for&#xD;
learning from sets of collected data [22] [21 J. Their wide use in several real-life applications means that such algorithms have to work on data sets with ever-increasing&#xD;
sizes and on machines with limited processing power.&#xD;
The recently discovered MapReduce framework is a parallel programming framework, which enables users to develop parallel algorithms [36]. These parallel algorithms&#xD;
are executed in a grid-computing environment in order to utilize resources from the&#xD;
various machines connected to the grid. In this project a cloud-based, grid-computing&#xD;
environment is used, which is pre-set to execute MapReduce algorithms.&#xD;
This project explores the use of Apache Hadoop, which is an open-source implementation of the MapReduce framework [14], to parallelize algorithms, particularly&#xD;
Decision Tree Learning algorithms. An implementation of a parallelized version of&#xD;
Quinlan's [23] ID3 algorithm using the MapReduce framework is presented.&#xD;
Two more variations of the algorithm are also presented in this project; one implemented using breadth-first tree induction and the other implemented in a partially&#xD;
parallel manner. The aim of these implementations is to propose other methods for&#xD;
the implementation of decision tree learning algorithms which execute more efficiently&#xD;
on larger data sets. Reference was made to other similar parallel decision tree learning algorithm implementations [19] [28] [22] in order to develop the aforementioned&#xD;
algorithm variations.&#xD;
The evaluation of the project shows that all the implemented algorithms successfully&#xD;
derive a decision tree from the data set supplied. The performance of the algorithms&#xD;
was compared and the results show that having partially parallelized algorithm can&#xD;
be more efficient than a completely parallel one. Findings have also shown that implementing such algorithms using a breadth-first induction have a hidden inefficiency&#xD;
which could lead to a less efficient performance of the algorithm.
Description: B.Sc. IT (Hons)(Melit.)</summary>
    <dc:date>2013-01-01T00:00:00Z</dc:date>
  </entry>
</feed>

