Skip to main content

Research Repository

Advanced Search

Outputs (224)

An intuitive Authoring System for a Personalised, Social, Gamified, Visualisation-supporting e-learning System (2018)
Presentation / Conference Contribution
Alamri, A., Rusby, H., Cristea, A. I., Khan, J., Shi, L., & Stewart, C. (2018, June). An intuitive Authoring System for a Personalised, Social, Gamified, Visualisation-supporting e-learning System. Presented at 3rd International Conference on Information and Education Innovations (ICIEI'18), London

Adaptive Educational Hypermedia (AEH) offers more advanced personalisation and customisation features to the field of e-learning compared to the outdated static systems (where every learner is given the same set of learning materials). AEH can improv... Read More about An intuitive Authoring System for a Personalised, Social, Gamified, Visualisation-supporting e-learning System.

TSFC: A Structure-Preserving Form Compiler (2018)
Journal Article
Homolya, M., Mitchell, L., Luporini, F., & Ham, D. A. (2018). TSFC: A Structure-Preserving Form Compiler. SIAM Journal on Scientific Computing, 40(3), C401-C428. https://doi.org/10.1137/17m1130642

A form compiler takes a high-level description of the weak form of partial differential equations and produces low-level code that carries out the finite element assembly. In this paper we present the Two-Stage Form Compiler (TSFC), a new form compil... Read More about TSFC: A Structure-Preserving Form Compiler.

On the (Parameterized) Complexity of Recognizing Well-covered ( r , ℓ )-graph (2018)
Journal Article
Alves, S. R., Dabrowski, K. K., Faria, L., Klein, S., Sau, I., & Souza, U. S. (2018). On the (Parameterized) Complexity of Recognizing Well-covered ( r , ℓ )-graph. Theoretical Computer Science, 746, 36-48. https://doi.org/10.1016/j.tcs.2018.06.024

An (r,ℓ)(r,ℓ)-partition of a graph G is a partition of its vertex set into r independent sets and ℓ cliques. A graph is (r,ℓ)(r,ℓ) if it admits an (r,ℓ)(r,ℓ)-partition. A graph is well-covered if every maximal independent set is also maximum. A graph... Read More about On the (Parameterized) Complexity of Recognizing Well-covered ( r , ℓ )-graph.

Contraction and Deletion Blockers for Perfect Graphs and H -free Graphs (2018)
Journal Article
Diner, Ö., Paulusma, D., Picouleau, C., & Ries, B. (2018). Contraction and Deletion Blockers for Perfect Graphs and H -free Graphs. Theoretical Computer Science, 746, 49-72. https://doi.org/10.1016/j.tcs.2018.06.023

We study the following problem: for given integers d, k and graph G, can we reduce some fixed graph parameter π of G by at least d via at most k graph operations from some fixed set S? As parameters we take the chromatic number χ, clique number ω and... Read More about Contraction and Deletion Blockers for Perfect Graphs and H -free Graphs.

Linear read-once and related Boolean functions (2018)
Journal Article
Lozin, V., Razgon, I., Zamaraev, V., Zamaraeva, E., & Zolotykh, N. (2018). Linear read-once and related Boolean functions. Discrete Applied Mathematics, 250, 16-27. https://doi.org/10.1016/j.dam.2018.05.001

It is known that a positive Boolean function depending on variables has at least extremal points, i.e. minimal ones and maximal zeros. We show that has exactly extremal points if and only if it is linear read-once. The class of linear read-once funct... Read More about Linear read-once and related Boolean functions.

BotDet: A System for Real Time Botnet Command and Control Traffic Detection (2018)
Journal Article
Ghafir, I., Prenosil, V., Hammoudeh, M., Baker, T., Jabbar, S., Khalid, S., & Jaf, S. (2018). BotDet: A System for Real Time Botnet Command and Control Traffic Detection. IEEE Access, 6, 38947-38958. https://doi.org/10.1109/access.2018.2846740

Over the past decade, the digitization of services transformed the healthcare sector leading to a sharp rise in cybersecurity threats. Poor cybersecurity in the healthcare sector, coupled with high value of patient records attracted the attention of... Read More about BotDet: A System for Real Time Botnet Command and Control Traffic Detection.

On the Complexity of the Model Checking Problem (2018)
Journal Article
Madelaine, F. R., & Martin, B. D. (2018). On the Complexity of the Model Checking Problem. SIAM Journal on Computing, 47(3), 769-797. https://doi.org/10.1137/140965715

The complexity of the model checking problem for various fragments of first-order logic (FO) has attracted much attention over the last two decades, in particular for the fragment induced by ∃ and ∧ and that induced by ∀, ∃, and ∧, which are better k... Read More about On the Complexity of the Model Checking Problem.

A conceptual framework for social movements analytics for national security (2018)
Presentation / Conference Contribution
Cárdenas, P., Theodoropoulos, G., Obara, B., & Kureshi, I. (2018, June). A conceptual framework for social movements analytics for national security. Presented at International Conference on Computational Science, Wuxi, China

Social media tools have changed our world due to the way they convey information between individuals; this has led to many social movements either starting on social media or being organised and managed through this medium. At times however, certain... Read More about A conceptual framework for social movements analytics for national security.