Stuart Chalmers
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Stuart Chalmers has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
Alun Preece
Cardiff Univ. (United Kingdom)
10 shared publicationsDiego Pizzocaro
Cardiff University, Cardiff
4 shared publications- Michael Luck
King's College London
4 shared publications - Timothy J. Norman
University of Southampton
4 shared publications Amotz Bar-Noy
City University of New York, New York
3 shared publicationsHosam Rowaihy
King Fahd University of Petroleum and Minerals (KFUPM), Dhahran
3 shared publications
Latest Publications
- Open Access
- 7 November 2022
- Published by Association for Computing Machinery (ACM)
- p. 163-170
Industrial Internet of Things Security Modelling using Ontological Methods
The Industrial Internet of Things (IIoT) trend presents many significant benefits for improving industrial operations. However, its emergence from the convergence of legacy Industrial Control Systems (ICS) and Information and Communication Technologies (ICT) has introduced newer security issues such as weak or lack of end-to-end security. These challenges have weakened the interest of many critical infrastructure industries in adopting IIoT-enabled systems. Implementing security in IIoT is challenging because this involves many heterogeneous Information Technology (IT) and Operational Technology (OT) devices and complex interactions with humans, and the environments in which these are operated and monitored. This article presents the initial results of the PETRAS Secure Ontologies for Internet of Things Systems (SOfIoTS) project, which consists of key security concepts and a modular design of a base security ontology, which supports security knowledge representation and analysis of IIoT security.
- 7 November 2022
- Published by Association for Computing Machinery (ACM)
- p. 163-170
Open AccessIndustrial Internet of Things Security Modelling using Ontological Methods
The Industrial Internet of Things (IIoT) trend presents many significant benefits for improving industrial operations. However, its emergence from the convergence of legacy Industrial Control Systems (ICS) and Information and Communication Technologies (ICT) has introduced newer security issues such as weak or lack of end-to-end security. These challenges have weakened the interest of many critical infrastructure industries in adopting IIoT-enabled systems. Implementing security in IIoT is challenging because this involves many heterogeneous Information Technology (IT) and Operational Technology (OT) devices and complex interactions with humans, and the environments in which these are operated and monitored. This article presents the initial results of the PETRAS Secure Ontologies for Internet of Things Systems (SOfIoTS) project, which consists of key security concepts and a modular design of a base security ontology, which supports security knowledge representation and analysis of IIoT security.
- 18 February 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 21 (11) , 1692-1705
Sensor-Mission Assignment in Constrained Environments
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match sensor resources to mission demands thus become necessary. In this paper, we consider new sensor-assignment problems motivated by frugality, i.e., the conservation of resources, for both static and dynamic settings. In the most general setting, the problems we study are NP-hard even to approximate, and so we focus on heuristic algorithms that perform well in practice. In the static setting, we propose a greedy centralized solution and a more sophisticated solution that uses the Generalized Assignment Problem model and can be implemented in a distributed fashion. In what we call the dynamic setting, missions arrive over time and have different durations. For this setting, we give heuristic algorithms in which available sensors propose to nearby missions as they arrive. We find that the overall performance can be significantly improved if available sensors sometimes refuse to offer utility to missions they could help, making this decision based on the value of the mission, the sensor's remaining energy, and (if known) the remaining target lifetime of the network. Finally, we evaluate our solutions through simulations.
- 18 February 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 21 (11) , 1692-1705
Sensor-Mission Assignment in Constrained Environments
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match sensor resources to mission demands thus become necessary. In this paper, we consider new sensor-assignment problems motivated by frugality, i.e., the conservation of resources, for both static and dynamic settings. In the most general setting, the problems we study are NP-hard even to approximate, and so we focus on heuristic algorithms that perform well in practice. In the static setting, we propose a greedy centralized solution and a more sophisticated solution that uses the Generalized Assignment Problem model and can be implemented in a distributed fashion. In what we call the dynamic setting, missions arrive over time and have different durations. For this setting, we give heuristic algorithms in which available sensors propose to nearby missions as they arrive. We find that the overall performance can be significantly improved if available sensors sometimes refuse to offer utility to missions they could help, making this decision based on the value of the mission, the sensor's remaining energy, and (if known) the remaining target lifetime of the network. Finally, we evaluate our solutions through simulations.
- 2 October 2008
- Published by SPIE-Intl Soc Optical Eng
- p. 711205-711205-12
A knapsack approach to sensor-mission assignment with uncertain demands
A sensor network in the field is usually required to support multiple sensing tasks or missions to be accomplished simultaneously. Since missions might compete for the exclusive usage of the same sensing resource we need to assign individual sensors to missions. Missions are usually characterized by an uncertain demand for sensing resource capabilities. In this paper we model this assignment problem by introducing the Sensor Utility Maximization (SUM) model, where each sensor-mission pair is associated with a utility offer. Moreover each mission is associated with a priority and with an uncertain utility demand. We also define the benefit or profit that a sensor can bring to a mission as the fraction of mission's demand that the sensor is able to satisfy, scaled by the priority of the mission. The goal is to find a sensor assignment that maximizes the total profit, while ensuring that the total utility cumulated by each mission does not exceed its uncertain demand. SUM is NP-Complete and is a special case of the well known Generalized Assignment Problem (GAP), which groups many knapsack-style problems. We compare four algorithms: two previous algorithms for problems related to SUM, an improved implementation of a state-of-the-art pre-existing approximation algorithm for GAP, and a new greedy algorithm. Simulation results show that our greedy algorithm appears to offer the best trade-off between quality of solution and computation cost.
- 2 October 2008
- Published by SPIE-Intl Soc Optical Eng
- p. 711205-711205-12
A knapsack approach to sensor-mission assignment with uncertain demands
A sensor network in the field is usually required to support multiple sensing tasks or missions to be accomplished simultaneously. Since missions might compete for the exclusive usage of the same sensing resource we need to assign individual sensors to missions. Missions are usually characterized by an uncertain demand for sensing resource capabilities. In this paper we model this assignment problem by introducing the Sensor Utility Maximization (SUM) model, where each sensor-mission pair is associated with a utility offer. Moreover each mission is associated with a priority and with an uncertain utility demand. We also define the benefit or profit that a sensor can bring to a mission as the fraction of mission's demand that the sensor is able to satisfy, scaled by the priority of the mission. The goal is to find a sensor assignment that maximizes the total profit, while ensuring that the total utility cumulated by each mission does not exceed its uncertain demand. SUM is NP-Complete and is a special case of the well known Generalized Assignment Problem (GAP), which groups many knapsack-style problems. We compare four algorithms: two previous algorithms for problems related to SUM, an improved implementation of a state-of-the-art pre-existing approximation algorithm for GAP, and a new greedy algorithm. Simulation results show that our greedy algorithm appears to offer the best trade-off between quality of solution and computation cost.
- 1 September 2008
- Published by Elsevier in Electronic Commerce Research and Applications
- Vol. 7 (3) , 264-273
A Semantic web approach to handling soft constraints in virtual organisations
- 1 September 2008
- Published by Elsevier in Electronic Commerce Research and Applications
- Vol. 7 (3) , 264-273
A Semantic web approach to handling soft constraints in virtual organisations
- 1 January 2008
- Published by Springer Nature
- p. 333-338
Sensor Assignment In Virtual Environments Using Constraint Programming
- 1 January 2008
- Published by Springer Nature
- p. 333-338
Sensor Assignment In Virtual Environments Using Constraint Programming
- 1 January 2008
- Published by Springer Nature
- p. 203-216
Player Collaboration in Virtual Environments using Hierarchical Task Network Planning
- 1 January 2008
- Published by Springer Nature
- p. 203-216
Player Collaboration in Virtual Environments using Hierarchical Task Network Planning
- 14 December 2006
- Published by Elsevier in Knowledge-Based Systems
- Vol. 20 (2) , 143-151
A reusable commitment management service using Semantic Web technology
- 14 December 2006
- Published by Elsevier in Knowledge-Based Systems
- Vol. 20 (2) , 143-151
A reusable commitment management service using Semantic Web technology
- 1 January 2006
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 27-34
Assisting Domain Experts to Formulate and Solve Constraint Satisfaction Problems
- 1 January 2006
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 27-34
Assisting Domain Experts to Formulate and Solve Constraint Satisfaction Problems
- 1 January 2006
- Published by Springer Nature in BT Technology Journal
- Vol. 24 (1) , 141-152
Delivering services by building and running virtual organisations
- 1 January 2006
- Published by Springer Nature in BT Technology Journal
- Vol. 24 (1) , 141-152
Delivering services by building and running virtual organisations