Skip to main content

Research Repository

Advanced Search

All Outputs (216)

Temporal vertex cover with a sliding time window (2018)
Conference Proceeding
Akrida, E., Mertzios, G., Spirakis, P., & Zamaraev, V. (2018). Temporal vertex cover with a sliding time window. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) : Prague, Czech Republic, July 9-13, 2018 ; proceedings (148:1-148:14). https://doi.org/10.4230/lipics.icalp.2018.148

Modern, inherently dynamic systems are usually characterized by a network structure, i.e. an underlying graph topology, which is subject to discrete changes over time. Given a static underlying graph G, a temporal graph can be represented via an assi... Read More about Temporal vertex cover with a sliding time window.

Kernelization Lower Bounds for Finding Constant-Size Subgraphs (2018)
Book Chapter
Fluschnik, T., Mertzios, G., & Nichterlein, A. (2018). Kernelization Lower Bounds for Finding Constant-Size Subgraphs. In F. Manea, R. Miller, & D. Nowotka (Eds.), Sailing routes in the world of computation : 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30-August 3, 2018. Proceedings (183-193). Springer Verlag. https://doi.org/10.1007/978-3-319-94418-0_19

Kernelization is an important tool in parameterized algorithmics. Given an input instance accompanied by a parameter, the goal is to compute in polynomial time an equivalent instance of the same problem such that the size of the reduced instance only... Read More about Kernelization Lower Bounds for Finding Constant-Size Subgraphs.

A large-scale category-based evaluation of a visual language for adaptive hypermedia (2018)
Conference Proceeding
Khan, J., Cristea, A., & Alamri, A. (2018). A large-scale category-based evaluation of a visual language for adaptive hypermedia. In Proceedings of the 2018 the 3rd International Conference on Information and Education Innovations (ICIEI'18) : London, United Kingdom, June 30 - July 02, 2018 (94-98). https://doi.org/10.1145/3234825.3234834

Adaptive Hypermedia (AH) provides a personalised and customised approach, enhancing the usability of hypermedia, by building a model of various qualities of a user and applying this information to adapt the content and the navigation to their require... Read More about A large-scale category-based evaluation of a visual language for adaptive hypermedia.

On the need for fine-grained analysis of Gender versus Commenting Behaviour in MOOCs (2018)
Conference Proceeding
Alshehri, M., Foss, J., Cristea, A. I., Kayama, M., Shi, L., Alamri, A., & Tsakalidis, A. (2018). On the need for fine-grained analysis of Gender versus Commenting Behaviour in MOOCs. In Proceedings of the 2018 the 3rd International Conference on Information and Education Innovations (ICIEI'18) : London, United Kingdom, June 30 - July 02, 2018 (73-77). https://doi.org/10.1145/3234825.3234833

Stereotyping is the first type of adaptation ever proposed. However, the early systems have never dealt with the numbers of learners that current Massive Open Online Courses (MOOCs) provide. Thus, the umbrella question that this work tackles is if le... Read More about On the need for fine-grained analysis of Gender versus Commenting Behaviour in MOOCs.

An intuitive Authoring System for a Personalised, Social, Gamified, Visualisation-supporting e-learning System (2018)
Conference Proceeding
Alamri, A., Rusby, H., Cristea, A. I., Khan, J., Shi, L., & Stewart, C. (2018). An intuitive Authoring System for a Personalised, Social, Gamified, Visualisation-supporting e-learning System. In Proceedings of the 2018 the 3rd International Conference on Information and Education Innovations (ICIEI'18) : London, United Kingdom, June 30 - July 02, 2018 (57-61). https://doi.org/10.1145/3234825.3234835

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.

Combining Machine Learning Classifiers for the Task of Arabic Characters Recognition (2018)
Journal Article
Alabbas, M., Jaf, S., & Khudeyer, S. R. (2018). Combining Machine Learning Classifiers for the Task of Arabic Characters Recognition. Journal of Chinese Language and Computing, 28(1), 1-12

There is a number of machine learning algorithms for recognizing Arabic characters. In this paper, we investigate a range of strategies for multiple machine learning algorithms for the task of Arabic characters recognition, where we are faced with im... Read More about Combining Machine Learning Classifiers for the Task of Arabic Characters Recognition.

Real-time Low-Cost Omni-directional Stereo Vision via Bi-Polar Spherical Cameras (2018)
Conference Proceeding
Lin, K., & Breckon, T. (2018). Real-time Low-Cost Omni-directional Stereo Vision via Bi-Polar Spherical Cameras. In Proc. Int. Conf. Image Analysis and Recognition (315-325). https://doi.org/10.1007/978-3-319-93000-8_36

With the rise of consumer-grade spherical cameras, offering full omni-directional 360∘ image capture, the potential for low-cost omni-directional stereo vision is ever present. Whilst this potentially offers novel low-cost omni-directional depth sens... Read More about Real-time Low-Cost Omni-directional Stereo Vision via Bi-Polar Spherical Cameras.

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.

A conceptual framework for social movements analytics for national security (2018)
Conference Proceeding
Cárdenas, P., Theodoropoulos, G., Obara, B., & Kureshi, I. (2018). A conceptual framework for social movements analytics for national security. In Computational Science – ICCS 2018 : 18th International Conference, Wuxi, China, June 11–13, 2018, Proceedings, Part I (302-315). https://doi.org/10.1007/978-3-319-93698-7_23

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.

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.

Extended Patch Prioritization for Depth Filling Within Constrained Exemplar-Based RGB-D Image Completion (2018)
Conference Proceeding
Atapour-Abarghouei, A., & Breckon, T. P. (2018). Extended Patch Prioritization for Depth Filling Within Constrained Exemplar-Based RGB-D Image Completion. In A. Campilho, F. Karray, & B. T. H. Romeny (Eds.), Image analysis and recognition : 15th International Conference, ICIAR 2018, Póvoa de Varzim, Portugal, June 27–29, 2018 ; proceedings (306-314). https://doi.org/10.1007/978-3-319-93000-8_35

We address the problem of hole filling in depth images, obtained from either active or stereo sensing, for the purposes of depth image completion in an exemplar-based framework. Most existing exemplar-based inpainting techniques, designed for color i... Read More about Extended Patch Prioritization for Depth Filling Within Constrained Exemplar-Based RGB-D Image Completion.