<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>OAR@UM Collection:</title>
    <link>https://www.um.edu.mt/library/oar/handle/123456789/14678</link>
    <description />
    <pubDate>Sun, 12 Apr 2026 03:18:39 GMT</pubDate>
    <dc:date>2026-04-12T03:18:39Z</dc:date>
    <item>
      <title>Implementation of an automatic phoneme recognition system</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/101544</link>
      <description>Title: Implementation of an automatic phoneme recognition system
Abstract: Automatic Speech Recognition (ASR) is becoming increasingly more popularly used &#xD;
in most applications in today's technologies. Over the past years, a lot of research has &#xD;
been carried out, with the current trend being speech recognition in &#xD;
speaker-independent continuous speech environments with large vocabulary. However, &#xD;
most of the research carried out so far focused on software applications, and not much &#xD;
work has been carried out on the design of hardware recognisers, which is also &#xD;
necessary in order to attain further improvement in the field of ASR. Over the past &#xD;
years, ASR was not used widely in potential applications due to a number of &#xD;
limitations, such as processing power and limited hardware resources [1]. However, &#xD;
with today's advances in customised hardware, the design of ASR systems on-chip has &#xD;
become more feasible. &#xD;
In this research, different phoneme recognition systems for multi-speaker continuous &#xD;
speech environments are being proposed. The feature extraction stage was based on the &#xD;
Discrete Wavelet Transform (DWT), and for the classification stage, different &#xD;
Artificial Neural Networks (ANNs) and Support Vector Machines (SVMs) were &#xD;
analysed. From the methods considered, the One-against-one SVM method provided &#xD;
the highest recognition rates. Furthermore, a priorities scheme was also added, so that &#xD;
the three most likely phoneme representations were obtained at the output. The &#xD;
software implementation of this phoneme recognition system has the potential to &#xD;
achieve an accuracy of 75.41%, for the recognition of 42 phoneme classes from the &#xD;
DARPA TIMIT Acoustic-Phonetic Continuous Speech Corpus (TIMIT) corpus. The &#xD;
results obtained were either comparable, or slightly better, than the best results found &#xD;
in the literature [2] - [7], which evaluated their systems on the TIMIT corpus. On &#xD;
average, the potential recognition rate which can be achieved with the proposed &#xD;
phoneme recognition system, results in an increase in accuracy of approximately 6%, &#xD;
when compared to the phoneme recognition systems presented in [2] - [7]. However, &#xD;
the proposed system is more adequate to be implemented on hardware. &#xD;
The phoneme recognition system was then designed on a dedicated chip, in order to &#xD;
evaluate its potential into becoming a portable and efficient system which can be &#xD;
employed in battery-powered devices. The final design can provide a speed which is &#xD;
approximately 4 times faster than the software-based approach, and consumes only &#xD;
12.Sm W, making it appealing to mobile devices. The performance results obtained &#xD;
from the hardware design demonstrated that this system is a promising basis for future &#xD;
hardware ASR systems.
Description: PH.D.</description>
      <pubDate>Wed, 01 Jan 2014 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/101544</guid>
      <dc:date>2014-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>A planar circuit model for the analysis of pixel microstrip antennas</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/101264</link>
      <description>Title: A planar circuit model for the analysis of pixel microstrip antennas
Abstract: A mobile handset needs to transmit/receive data on multiple frequency bands to access&#xD;
a diverse range of services. This implies both an increase in real estate for mobile&#xD;
terminal antennas as well as ever escalating challenges for the antenna design and&#xD;
manufacturing departments. The pixel patch antenna has been proposed as a possible&#xD;
solution. The pixel patch antenna is made up of a large number of pixels which by&#xD;
themselves do not resonate at any frequency of practical interest. However, when a set&#xD;
of selected pixels are connected/switched together, antennas of different shapes are&#xD;
synthesized to deliver the required electrical characteristics. Ideally these properties are&#xD;
optimized for a given operating environment in real-time. Given the antenna hardware&#xD;
architecture, the problem of synthesizing the various shapes can be casted as a search&#xD;
among many configurations, which is not a trivial problem because of the large search&#xD;
space defined by the pixel array.&#xD;
Early research has focused mostly on the physical construction and architecture of the&#xD;
pixel patch antenna and it is only recently that attention has increased on the search&#xD;
algorithm. A series of experiments using shorting ports, switches and varactor diodes&#xD;
are carried out as part of the literature review, to study tuning techniques. As a result&#xD;
of this study, novel architectures are proposed. The model based search algorithm is&#xD;
reviewed and its performance is compared to the Genetic Algorithm with and without&#xD;
pruning methods. This thesis builds upon the idea of making use of an antenna model&#xD;
in the search and optimization loop. To this end the known planar circuit model,&#xD;
augmented with segmentation and desegmentation methods, is further developed to&#xD;
yield an efficient model that is used to analyse a given arbitrary pixel antenna&#xD;
configuration. In the model's formulation, the Green's function approach is chosen to&#xD;
analyse the planar circuit. The Green's function is available for regular shapes only,&#xD;
and for arbitrary shaped structures, segmentation techniques are used to connect&#xD;
regular shapes together. The Generalized Cavity Model is used to model radiation and&#xD;
the fields beneath the patch.&#xD;
In order to realize the model several studies and novel methods had to be developed.&#xD;
An analysis of the behaviour of the Green's function with respect to the number of&#xD;
modes needed for convergence was carried out. It was determined that that the number&#xD;
of modes needed is a function of frequency and the permittivity of the substrate Er, at&#xD;
which the Green's function is evaluated. It was also found that the maximum number&#xD;
of modes is needed when the value of effective loss tangent is zero. These studies are&#xD;
used to dynamically estimate the number of modes needed per segment. A study is&#xD;
performed on the errors generated by multiple applications of the segmentation&#xD;
technique. The results from this study indicate that the number of segments used to&#xD;
represent the pixel patch antenna should be minimized. This is implemented in the&#xD;
Model Order Reduction algorithm.&#xD;
The relationships between the pixels are represented in a tree and a graph. This tree is&#xD;
traversed in order to build the order of segmentation. The use of these data structures&#xD;
allows the analysis of any arbitrary pixel patch antenna. A novel method to calculate&#xD;
the current passing through a number of n-port networks is developed and described.&#xD;
This method is more computationally efficient than the method used in the original&#xD;
segmentation method. The graph is used to determine the edges of the segments that&#xD;
will be used in the segmentation algorithm.&#xD;
A set of solvers are developed and their application in terms of efficiency are studied.&#xD;
In particular an algorithm that evaluates the input impedance of the antenna only in a&#xD;
set of intervals and interpolates between these points to find the minimum value of the&#xD;
input reflection coefficient is developed. The fields are only evaluated once the&#xD;
resonant frequency is found.&#xD;
The results obtained from this model are compared to CST microwave studio&#xD;
simulations. A set of pixel patch antennas configured in regular shapes, and a set of&#xD;
arbitrary shaped pixel patch configurations are used in the evaluation. The planar&#xD;
circuit model yields accurate results for the resonant frequency while it gives a good&#xD;
estimate of the impedance matching. The different variants of the model are considered&#xD;
to study the trade-off between accuracy and computational efficiency. Finally,&#xD;
developments to the model that potentially improve computational efficiency are&#xD;
suggested and discussed.
Description: PH.D.</description>
      <pubDate>Wed, 01 Jan 2014 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/101264</guid>
      <dc:date>2014-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Optimisation of the field description for the Large Hadron Collider during beam commissioning</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/100906</link>
      <description>Title: Optimisation of the field description for the Large Hadron Collider during beam commissioning
Abstract: The Large Hadron Collider (LHC) at CERN is a 27km circumference particle&#xD;
accelerator. It is made out of 1232 superconducting dipole magnets and&#xD;
392 superconducting quadrupole magnets, which guide the particles around the LHC.&#xD;
It is designed to have two counter-rotating beams of particles collided at nominal&#xD;
centre of mass energy of 14 TeV to study and explore the fundamental forces and&#xD;
constituents of matter.&#xD;
The operation of the LHC is a challenging task. All the superconducting magnets have to be controlled simultaneously in order to successfully steer the beams around the LHC. Any field variations of the superconducting magnets, which are not immediately corrected, will affect the trajectories of the beam and therefore the LHC performance.&#xD;
Unfortunately, a feedback control system based solely on beam-based measurements is not enough and therefore, a feed-forward control system is also required. The feed-forward control system is used to predict the behaviour of the field variations such that it reduces the load from the feedback system.&#xD;
The Field Description for the Large Hadron Collider (FiDeL) is the feed-forward&#xD;
control system designed to predict the magnetic field variations that result from the&#xD;
inherent properties of the superconducting magnets. This system is based on the&#xD;
analysis of the data obtained from the magnetic measurements of all the&#xD;
superconducting magnets before the magnets were installed in the LHC.&#xD;
This thesis is focused on determining the precision of the FiDeL model and optimising it where necessary. However, in this work, the magnetic behaviour is not studied through magnetic measurements of individual magnets, but through beam-based measurements performed during the operation of the LHC. This is done by measuring the tune and the chromaticity of the LHC, two important beam parameters which ensure beam stability. These two parameters are directly dependent on the magnetic field quality and the control of its harmonic content. Therefore, by analysing such beam-based measurements, the behaviour of the FiDeL model is compared to the behaviour of the whole LHC.&#xD;
Furthermore, this study also gives an outlook of the FiDeL model at the LHC nominal&#xD;
operation of 7 TeV. This consists of studying the main elements of FiDeL that can&#xD;
become critical at such operation in order to anticipate any possible issues and how&#xD;
these can be overcome.&#xD;
The work presented in this thesis has been adopted by CERN during the first LHC&#xD;
running period (2008-2013). It will continue to be used in 2015, following the two-&#xD;
year shutdown after which the LHC will be operating at the nominal design parameters.
Description: PH.D.</description>
      <pubDate>Wed, 01 Jan 2014 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/100906</guid>
      <dc:date>2014-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Services and engines for a recommender system</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/95973</link>
      <description>Title: Services and engines for a recommender system
Abstract: The number of ecommerce websites has grown rapidly over the past few years.&#xD;
Most of these websites use a back end database and support clients by providing&#xD;
ordinary database query facilities. However, using this approach has the major&#xD;
drawback that searching for a required product becomes difficult: Often users&#xD;
are faced with situations were the database either returns too many results or&#xD;
none at all. Also these websites, regardless of the fact they are used by a large&#xD;
number of users, they rarely take advantage of its population.&#xD;
Recommender systems can help dealing with the mass of products that are&#xD;
available in the databases of online organizations. They take advantage of the&#xD;
users of a web site and exploit personalization technologies to recommend items&#xD;
of interest to what other have liked.&#xD;
To overcome the problems of information overload and help customers receive&#xD;
better suggestions, a Framework is being proposed that identifies a common set&#xD;
of services which software developers should find helpful when implementing a&#xD;
recommender system, and implement these services through engines which are&#xD;
powered by knowledge based technologies. The framework should then be used&#xD;
by developers in order to create recommender systems in a shorter time.
Description: B.Sc. IT (Hons)(Melit.)</description>
      <pubDate>Thu, 01 Jan 2004 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/95973</guid>
      <dc:date>2004-01-01T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

