• Real time 10Gb-ethernet transmission over 2D indoor passive beam steered optical wireless system based on high port arrayed waveguide gratings

      Khalid, Amir Masood; Vega, Maria Torres; Mekonen, Ketamaw A.; Cao, Zizheng; Liotta, Antonio; Koonen, A.M. J. (VDE, 2016)
    • Real-time automated image segmentation technique for cerebral aneurysm on reconfigurable system-on-chip.

      Zhai, Xiaojun; Eslami, Mohammad; Hussein, Ealaf Sayed; Filali, Maroua Salem; Shalaby, Salma Tarek; Amira, Abbes; Bensaali, Faycal; Dakua, Sarada; Abinahed, Julien; Al-Ansari, Abdulla; et al. (Elsevier, 2018-05-03)
      Cerebral aneurysm is a weakness in a blood vessel that may enlarge and bleed into the surrounding area, which is a life-threatening condition. Therefore, early and accurate diagnosis of aneurysm is highly required to help doctors to decide the right treatment. This work aims to implement a real-time automated segmentation technique for cerebral aneurysm on the Zynq system-on-chip (SoC), and virtualize the results on a 3D plane, utilizing virtual reality (VR) facilities, such as Oculus Rift, to create an interactive environment for training purposes. The segmentation algorithm is designed based on hard thresholding and Haar wavelet transformation. The system is tested on six subjects, for each consists 512 × 512 DICOM slices, of 16 bits 3D rotational angiography. The quantitative and subjective evaluation show that the segmented masks and 3D generated volumes have admitted results. In addition, the hardware implement results show that the proposed implementation is capable to process an image using Zynq SoC in an average time of 5.2 ms.
    • Realization of blockchain in named data networking-based internet-of-vehicles

      Ahmad, Farhan; Kerrache, Chaker Abdelaziz; Kurugollu, Fatih; Hussain, Rasheed; Cyber Security Research Group, University of Derby, UK; Department of Mathematics and Computer Science, University of Ghardaia, Algeria; Institute of Information Systems, Innopolis University, Russia (IEEE, 2019-07-15)
      The revolution of Internet-of-vehicles (IoV) has stimulated a substantial response from academia, research and industry due to its massive potential to improve overall transportation. Current IoV faces huge challenges due to its reliance on the IP-based network architecture. Therefore, Named Data Networking (NDN) is proposed as a promising architecture to solve issues posed by IP-based systems. Recently, Blockchains (BCs) are utilized within IoV to increase network security. However, the integration of BC within NDN-enabled IoV is still an open research problem. In this study, we proposed a novel tier-based architecture known as “Blockchain in NDN-enabled Internet-of-Vehicles (BINDN)” which can support BC within NDN-enabled IoV. BINDN can be used as a reference architecture to design security solutions in NDN-enabled IoV using BC. Further, it provides an extensive set of applications including IoV security, trust management and privacy enhancements. Moreover, we highlighted major challenges and issues when integrating BC within NDN-enabled IoV.
    • Realtime execution of automated plans using evolutionary robotics

      Thompson, Tommy; Levine, John; University of Strathclyde (Computational Intelligence and Games, 2009. CIG 2009. IEEE Symposium on, 2009-08)
      Applying neural networks to generate robust agent controllers is now a seasoned practice, with time needed only to isolate particulars of domain and execution. However we are often constrained to local problems due to an agents inability to reason in an abstract manner. While there are suitable approaches for abstract reasoning and search, there is often the issues that arise in using offline processes in real-time situations. In this paper we explore the feasibility of creating a decentralised architecture that combines these approaches. The approach in this paper explores utilising a classical automated planner that interfaces with a library of neural network actuators through the use of a Prolog rule base. We explore the validity of solving a variety of goals with and without additional hostile entities as well as added uncertainty in the the world. The end results providing a goal driven agent that adapts to situations and reacts accordingly.
    • Recommender Systems Evaluator: A Framework for Evaluating the Performance of Recommender Systems

      dos Santos, Paulo V.G.; Tardiole Kuehne, Bruno; Batista, Bruno G.; Leite, Dionisio M.; Peixoto, Maycon L.M.; Moreira, Edmilson Marmo; Reiff-Marganiec, Stephan; University of Derby; Federal University of Itajubá, Itajubá, Brazil; Federal University of Mato Grosso do Sul (UFMS), Ponta Porã, Brazil; et al. (Springer, 2021-06-05)
      Recommender systems are filters that suggest products of interest to customers, which may positively impact sales. Nowadays, there is a multitude of algorithms for recommender systems, and their performance varies widely. So it is crucial to choose the most suitable option given a situation, but it is not a trivial task. In this context, we propose the Recommender Systems Evaluator (RSE): a framework aimed to accomplish an offline performance evaluation of recommender systems. We argue that the usage of a proper methodology is crucial when evaluating the available options. However, it is frequently overlooked, leading to inconsistent results. To help appraisers draw reliable conclusions, RSE is based on statistical concepts and displays results intuitively. A comparative study of classical recommendation algorithms is presented as an evaluation, highlighting RSE’s critical features.
    • Recurrent sequences: Key results, applications, and problems

      Andrica, Dorin; Bagdasar, Ovidiu; University of Derby (Springer International Publishing, 2020-09)
      This self-contained text presents state-of-the-art results on recurrent sequences and their applications in algebra, number theory, geometry of the complex plane and discrete mathematics. It is designed to appeal to a wide readership, ranging from scholars and academics, to undergraduate students, or advanced high school and college students training for competitions. The content of the book is very recent, and focuses on areas where significant research is currently taking place. Among the new approaches promoted in this book, the authors highlight the visualization of some recurrences in the complex plane, the concurrent use of algebraic, arithmetic, and trigonometric perspectives on classical number sequences, and links to many applications. It contains techniques which are fundamental in other areas of math and encourages further research on the topic. The introductory chapters only require good understanding of college algebra, complex numbers, analysis and basic combinatorics. For Chapters 3, 4 and 6 the prerequisites include number theory, linear algebra and complex analysis. The first part of the book presents key theoretical elements required for a good understanding of the topic. The exposition moves on to to fundamental results and key examples of recurrences and their properties. The geometry of linear recurrences in the complex plane is presented in detail through numerous diagrams, which lead to often unexpected connections to combinatorics, number theory, integer sequences, and random number generation. The second part of the book presents a collection of 123 problems with full solutions, illustrating the wide range of topics where recurrent sequences can be found. This material is ideal for consolidating the theoretical knowledge and for preparing students for Olympiads.
    • Reduced reference image quality assessment via boltzmann machines

      Mocanu, Decebal Constantin; Exarchakos, Georgios; Ammar, Haitham Bou; Liotta, Antonio (IEEE, 2015)
    • Reduced topologically real-world networks: a big-data approach

      Trovati, Marcello; University of Derby (2015)
    • Reducing packet delay through filter merging

      Comerford, Paul; Davies, John, N.; Grout, Vic; University of Derby; Glyndwr University (IEEE, 2016-12-06)
      The use of packet filters has increased considerably due to the growth of Internet users and network services. A number of header fields must be examined by the filter, causing delay for each packet processed. The problem is compounded when considering multiple filters across a network. To maximize network performance, it would be desirable to minimize the number of packet filters for each path across a domain. Due to the interactions of rules between filters, the underlying network topology and the actions of dynamic routing protocols, it is computationally infeasible to implement this strategy by collectively considering all packet filters across the network. A simpler approach is the elimination of a filter by merging two filters on a common network segment. This work presents a novel packet filter merging algorithm using decision diagrams. A large number of practical and simulated experimental results are provided to demonstrate the effectiveness of the technique and possible enhancements are considered in the conclusion. The results show an average 20% performance improvement can be obtained using the technique.
    • Redundancy reduction in Wireless Sensor Networks via Centrality Metrics

      Mocanu, Decebal Constantin; Torres Vega, M.; Liotta, Antonio (IEEE, 2015)
    • Reframing petrol heads – encouraging motorsport students to think about sustainability

      Robertson-Begg, John; University of Derby (2014-08-11)
      Motorsport students are sometimes seen as people who want to get maximum performance with little regard to the effect their passion has on sustainability and the environment. A core module delivered in the final year of a three year undergraduate motorsport course is “Advanced Engineering Materials and Applications”. This module is also an option on the final year of a manufacturing and production engineering degree that is studied by mainly part time students employed by local industry. An assignment in the 2012/2013 academic year required the cohort to consider sustainable solutions for car body panels. This paper discusses and evaluates the submissions of the motorsport students in terms of sustainability outcomes and compares these with the submissions of mainly part time students on the manufacturing and production degree. Students made extensive use of CES EduPack in their work. They were able to use the software to explore sustainability using appropriate materials indices and some used a synthesizer tool to model their own novel materials. Both groups of students were able to justify their materials selection and confirm these by carrying out simple eco-audits. The manufacturing and production students though showed much more awareness of issues around the processes of actually making the panels and their environmental impact. The work shows that different groups engineering students can become aware of sustainability but that their previous background and study can influence their holistic thinking abilities. It is pleasing to note that one of the motorsport students went to work for a renowned motor manufacturer in a job role with specific responsibilities for making interior fittings more sustainable.
    • A regression method for real-time video quality evaluation

      Torres Vega, M.; Mocanu, Decebal Constantin; Liotta, Antonio (2016)
    • Rel

      Voorhis, Dave; University of Derby (2004)
      Rel is a free, open-source, true relational database management system with an advanced query language called Tutorial D.
    • Rel

      Voorhis, Dave; University of Derby (2016-08-31)
      Rel is a free, open-source, cross-platform, true relational database management system that implements C J Date and Hugh Darwen's Tutorial D database language. First released in 2004, this version 3.000 release provides a significantly revamped graphical user interface, a graphical query language, and a native look-and-feel on Windows, Linux and OS X. Rel is primarily intended for research and education, but is increasingly an effective alternative to commercial desktop database management systems.
    • Rel: The 'true' relational model for desktop data processing.

      Voorhis, Dave; University of Derby (University of Derby, 2017-01)
      Discovered by noted IBM researcher E. F. “Ted” Codd in 1970, Codd's Relational Model of Data became the inspiration for the SQL database query language. Whilst SQL is the basis for most popular database management systems, they do not faithfully implement the relational model and deviate from it in problematic ways. Rel is a database management system — developed by Dave Voorhis at the University of Derby — that faithfully implements the relational model and is the first and most complete implementation of the innovative Tutorial D database query language designed by database researcher and author C J Date and former IBM developer and SQL Standards Committee member Hugh Darwen. In continuous development since 2004, Rel is used for research and database education at various universities worldwide. With the recent addition of features for integrating external data sources, Rel is evolving into an increasingly viable and effective “desktop database" tool for manipulating and querying data on personal computers. This session provides a background to Rel and demonstrates some of its significant new features.
    • Relevance in cyber?physical systems with humans in the loop

      Gopalakrishna, Aravind Kota; Ozcelebi, Tanir; Lukkien, Johan J; Liotta, Antonio (2017)
    • Relevance prevails: missing data treatment in intelligent lighting

      Gopalakrishna, Aravind Kota; Ozcelebi, Tanir; Liotta, Antonio; Lukkien, Johan J. (Springer, Cham, 2014)
    • Reliable low-power wireless networks over unstable transmission power

      Kotian, Roshan; Exarchakos, Georgios; Liotta, Antonio (IEEE, 2017)
    • Reliable, distributed scheduling and rescheduling for time-critical, multiagent systems

      Whitbrook, Amanda; Meng, Qinggang; Chung, Paul W. H.; University of Derby; Loughborough University (IEEE, 2017-04-26)
      This paper addresses two main problems with many heuristic task allocation approaches – solution trapping in local minima and static structure. The existing distributed task allocation algorithm known as PI (Performance Impact) is used as the vehicle for developing solutions to these problems as it has been shown to out-perform the state-of-the-art Consensus Based Bundle Algorithm (CBBA) for time-critical problems with tight deadlines, but is both static and sub-optimal with a tendency towards trapping in local minima. The paper describes two additional modules that are easily integrated with PI. The first extends the algorithm to permit dynamic online rescheduling in real time, and the second boosts performance by introducing an additional soft max action selection procedure that increases the algorithm’s exploratory properties. The paper demonstrates the effectiveness of the dynamic rescheduling module and shows that the average time taken to perform tasks can be reduced by up to 9% when the soft max module is used. In addition, the solution of some problems that baseline PI cannot handle is enabled by the second module. These developments represent a significant advance in the state-of-the-art for multi-agent, time-critical task assignment.
    • Remarks on a family of complex polynomials

      Andrica, Dorin; Bagdasar, Ovidiu; University of Derby (University of Belgrade, 2019-10-30)
      Integral formulae for the coefficients of cyclotomic and polygonal polynomials were recently obtained in [2] and [3]. In this paper, we define and study a family of polynomials depending on an integer sequence m1, . . . , mn, . . . , and on a sequence of complex numbers z1, . . . , zn, . . . of modulus one. We investigate some particular instances such as: extended cyclotomic, extended polygonal-type, and multinomial polynomials, for which we obtain formulae for the coefficients. Some novel related integer sequences are also derived.