Speaker: Ariel Fernandez

Abstract:
We take a proof-complexity approach to study the LLL algorithm for lattice-reductions. The LLL algorithm, while ubiquitous and very well known, is still not completely understood; for example, the relationship between the various constants and the running time.

Speaker: Mohammed Alshayeb

Abstract:
This presentation gives an introduction to ontologies and the domains of ontologies. We give examples of ontology usage and how the software engineering domain relates to ontologies. We look at the structure of ontologies and discuss the main features. We aim at discovering the objective of using ontologies in different domains.