Jeffrey Ray
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Jeffrey Ray has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Marcello Trovati
University of Lancashire, Lancashire, U.K.
7 shared publications Marcello Trovati
2 shared publications- Xiaolong Xu
School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, China
2 shared publications Francesco Palmieri
Department of Computer Science, University of Salerno, Italy
1 shared publicationHao Yuan
Nanjing University of Posts and Telecommunications
1 shared publication- Hari Mohan Pandey
Bournemouth University
1 shared publication
Latest Publications
- 24 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 16 (9) , 6033-6041
An Entropy-Based Approach to Real-Time Information Extraction for Industry 4.0
Industry 4.0 has drawn considerable attention from industry and academic research communities.
- 24 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 16 (9) , 6033-6041
An Entropy-Based Approach to Real-Time Information Extraction for Industry 4.0
Industry 4.0 has drawn considerable attention from industry and academic research communities.
- Open Access
- 18 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (5) , 4607-4615
DLCD-CCE: A Local Community Detection Algorithm for Complex IoT Networks
Internet of Things (IoT) refers to the complex systems generated by the interconnections among widely available objects. Such interactions generate large networks, whose complexity needs to be addressed to provide suitable computationally efficient approaches. In this article, we propose a distributed local community detection algorithm based on specific properties of community centre expansions (DLCD-CCE) for large-scale complex networks. The algorithm is evaluated via a prototype system, based on Spark, to verify its accuracy and scalability. The results demonstrate that compared to the typical local community detection algorithms, DLCD-CCE has better accuracy, stability and scalability, and effectively overcomes the problem that existing algorithms are sensitive to the location of initial seeds.
- 18 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (5) , 4607-4615
Open AccessDLCD-CCE: A Local Community Detection Algorithm for Complex IoT Networks
Internet of Things (IoT) refers to the complex systems generated by the interconnections among widely available objects. Such interactions generate large networks, whose complexity needs to be addressed to provide suitable computationally efficient approaches. In this article, we propose a distributed local community detection algorithm based on specific properties of community centre expansions (DLCD-CCE) for large-scale complex networks. The algorithm is evaluated via a prototype system, based on Spark, to verify its accuracy and scalability. The results demonstrate that compared to the typical local community detection algorithms, DLCD-CCE has better accuracy, stability and scalability, and effectively overcomes the problem that existing algorithms are sensitive to the location of initial seeds.
- Open Access
- 21 September 2019
- Published by Springer Nature in Soft Computing
- Vol. 24 (10) , 7197-7210
GORTS: genetic algorithm based on one-by-one revision of two sides for dynamic travelling salesman problems
The dynamic travelling salesman problem (DTSP) is a natural extension of the standard travelling salesman problem, and it has attracted significant interest in recent years due to is practical applications. In this article, we propose an efficient solution for DTSP, based on a genetic algorithm (GA), and on the one-by-one revision of two sides (GORTS). More specifically, GORTS combines the global search ability of GA with the fast convergence feature of the method of one-by-one revision of two sides, in order to find the optimal solution in a short time. An experimental platform was designed to evaluate the performance of GORTS with TSPLIB. The experimental results show that the efficiency of GORTS compares favourably against other popular heuristic algorithms for DTSP. In particular, a prototype logistics system based on GORTS for a supermarket with an online map was designed and implemented. It was shown that this can provide optimised goods distribution routes for delivery staff, while considering real-time traffic information.
- 21 September 2019
- Published by Springer Nature in Soft Computing
- Vol. 24 (10) , 7197-7210
Open AccessGORTS: genetic algorithm based on one-by-one revision of two sides for dynamic travelling salesman problems
The dynamic travelling salesman problem (DTSP) is a natural extension of the standard travelling salesman problem, and it has attracted significant interest in recent years due to is practical applications. In this article, we propose an efficient solution for DTSP, based on a genetic algorithm (GA), and on the one-by-one revision of two sides (GORTS). More specifically, GORTS combines the global search ability of GA with the fast convergence feature of the method of one-by-one revision of two sides, in order to find the optimal solution in a short time. An experimental platform was designed to evaluate the performance of GORTS with TSPLIB. The experimental results show that the efficiency of GORTS compares favourably against other popular heuristic algorithms for DTSP. In particular, a prototype logistics system based on GORTS for a supermarket with an online map was designed and implemented. It was shown that this can provide optimised goods distribution routes for delivery staff, while considering real-time traffic information.
- 15 August 2019
- Published by Springer Nature
- p. 463-472
Towards a Computational Model of Artificial Intuition and Decision Making
- 15 August 2019
- Published by Springer Nature
- p. 463-472
Towards a Computational Model of Artificial Intuition and Decision Making
- 26 August 2018
- Published by Springer Nature
- p. 473-478
On the Need for a Novel Intelligent Big Data Platform: A Proposed Solution
- 26 August 2018
- Published by Springer Nature
- p. 473-478
On the Need for a Novel Intelligent Big Data Platform: A Proposed Solution
- Open Access
- 2 August 2018
- Published by MDPI AG in Big Data and Cognitive Computing
- Vol. 2 (3) , 22
The Rise of Big Data Science: A Survey of Techniques, Methods and Approaches in the Field of Natural Language Processing and Network Theory
The continuous creation of data has posed new research challenges due to its complexity, diversity and volume. Consequently, Big Data has increasingly become a fully recognised scientific field. This article provides an overview of the current research efforts in Big Data science, with particular emphasis on its applications, as well as theoretical foundation.
- 2 August 2018
- Published by MDPI AG in Big Data and Cognitive Computing
- Vol. 2 (3) , 22
Open AccessThe Rise of Big Data Science: A Survey of Techniques, Methods and Approaches in the Field of Natural Language Processing and Network Theory
The continuous creation of data has posed new research challenges due to its complexity, diversity and volume. Consequently, Big Data has increasingly become a fully recognised scientific field. This article provides an overview of the current research efforts in Big Data science, with particular emphasis on its applications, as well as theoretical foundation.
- 17 August 2017
- Published by Springer Nature in Lecture Notes on Data Engineering and Communications Technologies
- p. 594-600
A Survey of Topological Data Analysis (TDA) Methods Implemented in Python
- 17 August 2017
- Published by Springer Nature in Lecture Notes on Data Engineering and Communications Technologies
- p. 594-600
A Survey of Topological Data Analysis (TDA) Methods Implemented in Python
- 17 August 2017
- Published by Springer Nature
- p. 585-593
A Preliminary Automated Approach to Assess Hospital Patient Feedback
- 17 August 2017
- Published by Springer Nature
- p. 585-593
A Preliminary Automated Approach to Assess Hospital Patient Feedback
- 17 August 2017
- Published by Springer Nature
- p. 576-584
The “Gut-Feeling” in the Decision-Making Process: A Computationally Efficient Approach to Influence Relation Assessment
- 17 August 2017
- Published by Springer Nature
- p. 576-584
The “Gut-Feeling” in the Decision-Making Process: A Computationally Efficient Approach to Influence Relation Assessment