Gordon A. Manson

dblp:40/3317 · DBLP profile ↗
← Back
15ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 4Systems, architecture and hardware · 3Computer networks · 3Artificial intelligence and machine learning · 2Security and privacy · 2Software engineering, systems software and programming languages · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 50% Storage systems · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › file systems
file organization
0.011990
Parallel Text Searching in Serial Files Using a Processor Farm · SIGIR 1990
Parallel and multicore computing
parallel programming models
0.011990
Parallel Text Searching in Serial Files Using a Processor Farm · SIGIR 1990
YearPublicationVenuePosition
2005 A Novel Environment-Aware Mobility Model for Mobile Ad Hoc Networks
Demetrios Belis, Gordon A. Manson
MSN3
2005 When security meets software engineering: a case of modelling secure information systems
Haralambos Mouratidis, Paolo Giorgini, Gordon A. Manson
Inf. Syst.3
2003 Integrating Security and Systems Engineering: Towards the Modelling of Secure Information Systems
Haralambos Mouratidis, Paolo Giorgini, Gordon A. Manson
CAiSE3
2003 UMAS Learning Requirement for Controlling Network Resources
Abdullah Gani, Nasser Salem Abouzakhar, Gordon A. Manson
IEA/AIE3
2003 An Ontology for Modelling Security: The Tropos Approach
Haralambos Mouratidis, Paolo Giorgini, Gordon A. Manson
KES3
2003 Capacity assignment on asymmetric Bluetooth link
abstract
Bluetooth is a typical short-range radio packet ad-hoc technique that is attractive in the rapid formation of a personal area network and inter-connection of different portable mobile devices. Compared with many high-speed wireless LAN techniques, Bluetooth provides a moderate link speed because each link is only allocated with 1 MHz bandwidth. In order to increase the link utilization, Bluetooth introduces the flexible usage of asymmetric link capacity allocation. It means different speeds are allowed in two directions of a link that flow from the master to the slave and from the slave to the master. Because of this, it is possible for Bluetooth to adaptively adjust the link capacity distribution to increase the link performance with lower latency. In this paper, we use the delay cost function to analyse the capacity assignment for a Bluetooth link. Although it only focuses in solving the capacity assignment of a single link, it is also applicable to large-size multi-link and multi-hop networks. It could be extended to generic data networks with asymmetric links.
R. Luo, R. M. Edwards 0001, Gordon A. Manson
WCNC3
2003 Networks security measures using neuro-fuzzy agents
abstract
The growing dependence of modern society on telecommunication and information networks and e‐type systems has become inevitable. However, those types of systems are vulnerable to malicious attacks. The speed and automation in network attack techniques continue to increase. An achievable automated attack or unauthorised access to a particular organization network could lead to devastating effects on its reputation and imminent loss of life. In this paper an innovative way is proposed to detect network attacks of a distributed nature such as denial of service (DoS) attacks. The proposed scheme is mainly based on neuro‐fuzzy intelligence in order to learn and determine the fuzzy parameter functions that represent network traffic behaviour. Neuro‐fuzzy agents combine the features of fuzzy logic and neural networks and they have been proposed to overcome the limitations of human expertise in defining fuzzy membership functions, especially for complex environments, such as information networks.
Nasser Salem Abouzakhar, Gordon A. Manson
Inf. Manag. Comput. Secur.2
2002 An intelligent approach to prevent distributed systems attacks
abstract
In today’s society, information and communications technology (ICT) is the force that drives prosperity and provides a higher standard of living. All other e‐services and infrastructures tend to play a major role in our daily life and global economy. The growing dependence on such systems, however, has increased their vulnerability to cyber attacks. Any failure to these systems typically would lead to a huge impact, not only on businesses, but also human life, that depends on such interconnected systems. The growing potential for telecommunications network infrastructures problems stems from their nature of openness. A successful attempt for a network attack to a particular organization’s network could have devastating effects on the security of the organisation. In this paper we propose an innovative way to counteract distributed protocols attacks such as distributed denial of service (DDoS) attacks using intelligent fuzzy agents.
Nasser Salem Abouzakhar, Gordon A. Manson
Inf. Manag. Comput. Secur.2
1994 Design and code derivation in the PCSC methodology
Gordon A. Manson, S. Shahrin, Chandran Elamvazuthi
Inf. Softw. Technol.1
1991 Experiments with a transputer-based parallel graph reduction machine
abstract
Abstract This paper is concerned with the implementation of functional languages on a parallel architecture, using graph reduction as a model of computation. Parallelism in such systems is automatically derived by the compiler but a major problem is the fine granularity, illustrated in Divide‐and‐Conquer problems at the leaves of the computational tree. The paper addresses this issue and proposes a method based on static analysis combined with run‐time tests to remove the excess in parallelism. We report experiments on a prototype machine, simulated on several connected INMOS transputers. Performance figures show the benefits in adopting the method and the difficulty of automatically deriving the optimum partitioning due to differences among the problems.
Fethi A. Rabhi, Gordon A. Manson
Concurr. Pract. Exp.2
1991 Network design for the implementation of text searching using a multicomputer
Janey K. Cringean, Roger England, Gordon A. Manson, Peter Willett 0002
Inf. Process. Manag.3
1991 Divide-and-conquer and parallel graph reduction
Fethi A. Rabhi, Gordon A. Manson
Parallel Comput.2
1990 Parallel Text Searching in Serial Files Using a Processor Farm
abstract
This paper discusses the implementation of a parallel text retrieval system using a microprocessor network. The system is designed to allow fast searching in document databases organised using the serial file structure, with a very rapid initial text signature search being followed by a more detailed, but more time-consuming, pattern matching search. The network is built from transputers, high performance microprocessors developed specifically for the construction of highly parallel computing systems, which are linked together in a processor farm. The paper discusses the design and implementation of processor farms, and then reports our initial studies of the efficiency of searching that can be achieved using this approach to text retrieval from serial files.
Janey K. Cringean, Roger England, Gordon A. Manson, Peter Willett 0002
SIGIR3
1988 Chemical graph matching using transputer networks
Andrew T. Brint, Valerie J. Gillet, Michael F. Lynch, Peter Willett 0002, Gordon A. Manson, George A. Wilson
Parallel Comput.5
1986 Lattice and ring array topologies using transputers
G. R. Brookes, Gordon A. Manson, Jon A. Thompson
Comput. Commun.2