2024-03-29T10:20:26Zhttp://uobrep.openrepository.com/oai/requestoai:uobrep.openrepository.com:10547/2245182020-04-23T08:42:53Zcom_10547_132192col_10547_132230
Heuristic-based neural networks for stochastic dynamic lot sizing problem
Şenyiğit, Ercan
Düğenci, Muharrem
Aydin, Mehmet Emin
Zeydan, Mithat
University of Bedfordshire
G400 Computer Science
heuristic-based learning approaches
genetic algorithm
bee algorithm
revised silver meal
revised least unit cost
cost benefit
feed-forward neural network model
neural networks
This is the final version of the manuscripted accepted before production by the publisher
Multi-period single-item lot sizing problem under stochastic environment has been tackled by few researchers and remains in need of further studies. It is mathematically intractable due to its complex structure. In this paper, an optimum lot-sizing policy based on minimum total relevant cost under price and demand uncertainties was studied by using various artificial neural networks trained with heuristic-based learning approaches; genetic algorithm (GA) and bee algorithm (BA). These combined approaches have been examined with three domain-specific costing heuristics comprising revised silver meal (RSM), revised least unit cost (RLUC), cost benefit (CB). It is concluded that the feed-forward neural network (FF-NN) model trained with BA outperforms the other models with better prediction results. In addition, RLUC is found the best operating domain-specific heuristic to calculate the total cost incurring of the lot-sizing problem. Hence, the best paired heuristics to help decision makers are suggested as RLUC and FF-NN trained with BA.
2012-05-18
2012-05-18
2012-05-18
Article
Şenyiğit, E., Düğenci, M., Aydin, M.E. & Zeydan, M. (2012) 'Heuristic-based neural networks for stochastic dynamic lot sizing problem', Applied Soft Computing, .
15684946
10.1016/j.asoc.2012.02.026
http://hdl.handle.net/10547/224518
Applied Soft Computing
en
http://linkinghub.elsevier.com/retrieve/pii/S1568494612001196
http://creativecommons.org/licenses/by-nc-nd/4.0/
Archived with thanks to Applied Soft Computing
Elsevier
oai:uobrep.openrepository.com:10547/2244712020-04-23T08:42:54Zcom_10547_132192col_10547_132230
A hybrid swarm intelligence algorithm for multiuser scheduling in HSDPA
Aydin, Mehmet Emin
Kwan, Raymond
Leung, Cyril
Maple, Carsten
Zhang, Jie
University of Bedfordshire
multiuser scheduling
wireless networks
channel state information
channel quality indicator
HSDPA
particle swarm optimization
simulated annealing
Multiuser scheduling is an important aspect in the performance optimization of a wireless network since it allows multiple users to access a shared channel efficiently by exploiting multiuser diversity. To perform efficient scheduling, channel state information (CSI) for users is required, and is obtained via their respective feedback channels. In this paper, a more realistic imperfect CSI feedback, in the form of a finite set of Channel Quality Indicator (CQI) values, is assumed as specified in the HSDPA standard. A mathematical model of the problem is developed for use in the optimization process. A hybrid heuristic approach based on particle swarm optimization and simulated annealing is used to solve the problem. Simulation results indicate that the hybrid approach outperforms individual implementations of both simulated annealing and particle swarm optimisation.
2012-05-17
2012-05-17
2012-05-17
Article
Aydin, M.E., Kwan, R., Leung, C., Maple, C. & Zhang, J. (2012) 'A hybrid swarm intelligence algorithm for multiuser scheduling in HSDPA', Applied Soft Computing.
15684946
10.1016/j.asoc.2011.12.007
http://hdl.handle.net/10547/224471
Applied Soft Computing
en
http://linkinghub.elsevier.com/retrieve/pii/S1568494611004911
http://creativecommons.org/licenses/by-nc-nd/4.0/
Archived with thanks to Applied Soft Computing
Elsevier
oai:uobrep.openrepository.com:10547/2244512020-04-23T08:39:57Zcom_10547_132192col_10547_132230
Multiuser scheduling on the LTE downlink with meta-heuristic approaches
Aydin, Mehmet Emin
Kwan, Raymond
Wu, Joyce
University of Bedfordshire
RanPlan Ltd.
2012-05-17
2012-05-17
2012-05-17
Article
Aydin, M.E., Kwan, R. & Wu, J. (2012) 'Multiuser scheduling on the LTE downlink with meta-heuristic approaches', Physical Communication.
18744907
10.1016/j.phycom.2012.01.004
http://hdl.handle.net/10547/224451
Physical Communication
en
http://linkinghub.elsevier.com/retrieve/pii/S1874490712000134
Archived with thanks to Physical Communication
oai:uobrep.openrepository.com:10547/2252932020-04-23T07:28:37Zcom_10547_132192col_10547_132230
Coordinating metaheuristic agents with swarm intelligence
Aydin, Mehmet Emin
University of Bedfordshire
metaheuristic agents
swarm intelligence
particle swarm optimization
simulated annealing
Coordination of multi agent systems remains as a problem since there is no prominent method suggests any universal solution. Metaheuristic agents are specific implementations of multi-agent systems, which imposes working together to solve optimisation problems using metaheuristic algorithms. An idea for coordinating metaheuristic agents borrowed from swarm intelligence is introduced in this paper. This swarm intelligence-based coordination framework has been implemented as swarms of simulated annealing agents collaborated with particle swarm optimization for multidimensional knapsack problem. A comparative performance analysis is also reported highlighting that the implementation has produced much better results than the previous works.
2012-05-22
2012-05-22
2010-07
Animation
Aydin, M. (2010) 'Coordinating metaheuristic agents with swarm intelligence'. Journal of Intelligent Manufacturing
23 (4) pp 991-999
0956-5515
1572-8145
10.1007/s10845-010-0435-y
http://hdl.handle.net/10547/225293
Journal of Intelligent Manufacturing
en
http://www.springerlink.com/index/10.1007/s10845-010-0435-y
SpringerLink
oai:uobrep.openrepository.com:10547/2252952020-04-23T07:28:39Zcom_10547_132192col_10547_132230
Multiuser scheduling in high speed downlink packet access
Kwan, Raymond
Aydin, Mehmet Emin
Leung, Cyril
Zhang, J.
Multiuser scheduling is an important aspect in the performance optimisation of a wireless network as it allows multiple users to efficiently access a shared channel by exploiting multiuser diversity. For example, the 3GPP cellular standard supports multiuser scheduling in the high speed downlink packet access (HSDPA) feature. To perform efficient scheduling, channel state information (CSI) for users is required, and is obtained via their respective feedback channels. Multiuser scheduling is studied assuming the availability of perfect CSI, which would require a high bandwidth overhead. A more realistic imperfect CSI feedback in the form of a finite set of channel quality indicator values is assumed, as specified in the HSDPA standard. A global optimal approach and a simulated annealing (CSA) approach are used to solve the optimisation problem. Simulation results suggest that the performances of the two approaches are very close even though the complexity of the simulated annealing (SA) approach is much lower. The performance of a simple greedy approach is found to be significantly worse.
2012-05-22
2012-05-22
2009-08
Article
Kwan, R., Aydin, M., Leung, C. & Zhang, J. (2009) 'Multiuser scheduling in high speed downlink packet access', IET Communications, 3 (8), pp.1363-70.
17518628
10.1049/iet-com.2008.0340
http://hdl.handle.net/10547/225295
IET Communications
en
http://link.aip.org/link/ICEOCW/v3/i8/p1363/s1&Agg=doi
Archived with thanks to IET Communications
IET
oai:uobrep.openrepository.com:10547/2509382020-04-23T07:29:08Zcom_10547_132192col_10547_132230
Genetic algorithm based solution to dead-end problems in robot navigation
Kang, Xiaoming
Yue, Yong
Li, Dayou
Maple, Carsten
dead end areas
genetic algorithms
obstacle avoidance
robot navigation
mobile robots
robotic exploration
dead-end detection
escape mechanisms
dead ends
In robot navigation, mobile robots can suffer from dead-end problems, that is, they can be stuck in areas which are surrounded by obstacles. Attempts have been reported to avoid a robot entering into such a dead-end area. However, in some applications, for example, rescue work, the dead-end areas must be explored. Therefore, it is vital for the robot to come out from the dead-end areas after exploration. This paper presents an approach which enables a robot to come out from dead-end areas. There are two main parts: a dead-end detection mechanism and a genetic algorithm (GA) based online training mechanism. When the robot realises that it is stuck in a dead-end area, it will operate the online training to produce a new best chromosome that will enable the robot to escape from the area.
2012-11-05
2012-11-05
2011
Article
Genetic algorithm based solution to dead-end problems in robot navigation 2011, 41 (3/4):177-184 International Journal of Computer Applications in Technology
0952-8091
1741-5047
10.1504/IJCAT.2011.042693
http://hdl.handle.net/10547/250938
International Journal of Computer Applications in Technology
en
http://www.inderscience.com/link.php?id=42693
Archived with thanks to International Journal of Computer Applications in Technology
Inderscience
oai:uobrep.openrepository.com:10547/2509502020-04-23T07:29:09Zcom_10547_132192col_10547_132230
Integrating the semiotic into UML via enhancing and cross-validating use case with an enriched domain model
Oussena, Samia
French, Tim
Use case models are a representation of the way in which users of the system interact with it. The UML specification driven approach to system development enable the use case model to be continuously refined and cross-validated from a number of system viewpoints. However, little has been done for validating the model against the organisational and workgroup setting in which the system will reside. This article aims to address this gap by the use of techniques derived from organisational semiotics for validating use case models against a wider aspect of organisational culture and meaning making at the organisational, workgroup and actor level of abstraction. Such approach will enhance the system development by providing “goodness of fit” between system model and organisational values and beliefs.
2012-11-05
2012-11-05
2011
Article
Integrating the Semiotic into UML via Enhancing and Cross-validating Use Case with an Enriched Domain Model 2009, 1 (3):15-31 International Journal of Sociotechnology and Knowledge Development
1941-6253
1941-6261
10.4018/jskd.2009070102
http://hdl.handle.net/10547/250950
International Journal of Sociotechnology and Knowledge Development
en
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jskd.2009070102
Archived with thanks to International Journal of Sociotechnology and Knowledge Development
IGI Global
oai:uobrep.openrepository.com:10547/2509372020-04-23T07:29:08Zcom_10547_132192col_10547_132230
Robotic nanoassembly: current developments and challenges
Wang, Zuobin
Li, Dayou
Zhang, Jin
Ji, Ze
Qiu, Renxi
robotic nanoassembly
robotics
nanomanipulation
nanohandling
nanometrology
nanomanufacturing
nanotechnology
robotic assembly
object-oriented nanoassembly
Robotic nanoassembly is an emerging field that deals with the controlled manipulation, handling and assembly of atoms, molecules and nano objects by robots for manufacturing of nano structures, devices and systems. Nanoassembly is expected to have revolutionary applications in almost all the scientific and technological areas. This paper presents a general review of nanoassembly by robots considering its current developments and challenges. It discusses scanning probe-based 2D nanomanipulation, gripper-based 3D nanohandling, object-oriented nanoassembly and hybrid nanoassembly techniques, which are the main topics of interest in the field. The challenging issues in robotic nanoassembly are outlined together with the topics.
2012-11-05
2012-11-05
2011
Article
Wang, Z. et al (2011) 'Robotic nanoassembly: current developments and challenges' International Journal of Computer Applications in Technology 41 (3/4):185-194
0952-8091
1741-5047
10.1504/IJCAT.2011.042694
http://hdl.handle.net/10547/250937
International Journal of Computer Applications in Technology
en
http://www.inderscience.com/link.php?id=42694
Inderscience
oai:uobrep.openrepository.com:10547/2509142020-04-23T08:42:53Zcom_10547_132192col_10547_132230
A new orthogonal array based crossover, with analysis of gene interactions, for evolutionary algorithms and its application to car door design
Chan, K.Y.
Kwong, C.K.
Jiang, H.
Aydin, Mehmet Emin
Fogarty, T.C.
Recent research shows that orthogonal array based crossovers outperform standard and existing crossovers in evolutionary algorithms in solving parametrical problems with high dimensions and multi-optima. However, those crossovers employed so far, ignore the consideration of interactions between genes. In this paper, we propose a method to improve the existing orthogonal array based crossovers by integrating information of interactions between genes. It is empirically shown that the proposed orthogonal array based crossover outperforms significantly both the existing orthogonal array based crossovers and standard crossovers on solving parametrical benchmark functions that interactions exist between variables. To further compare the proposed orthogonal array based crossover with the existing crossovers in evolutionary algorithms, a validation test based on car door design is used in which the effectiveness of the proposed orthogonal array based crossover is studied.
2012-11-05
2012-11-05
2010-05
Article
Chan, K.Y. et al (2010) 'A new orthogonal array based crossover, with analysis of gene interactions, for evolutionary algorithms and its application to car door design' Expert Systems with Applications 37 (5):3853-3862
0957-4174
10.1016/j.eswa.2009.11.033
http://hdl.handle.net/10547/250914
Expert Systems with Applications
en
http://linkinghub.elsevier.com/retrieve/pii/S0957417409009750
Elsevier
oai:uobrep.openrepository.com:10547/2509482020-04-23T08:42:54Zcom_10547_132192col_10547_132230
Modelling of a self-led critical friend topology in inter-cooperative grid communities
Bessis, Nik
Huang, Ye
Norrington, Peter
Brown, Antony
Kuonen, Pierre
Hirsbrunner, Beat
grid
grid scheduling
critical friend model
CFM
self-led critical friend
inter-cooperative grid
For decades, much work has been done to increase the effectiveness and efficiency of job sharing amongst available computational resources. Resources can be organized into a variety of topologies, and recent work has shown that a decentralized distributed resource topology is a crucial but complicated scenario. This is because decentralized resources are normally grouped into independent virtual organizations (VOs) and isolated from each other by VO boundaries. To convey jobs across gaps between various virtual organizations, a novel resource topology called the self-led critical friend model (CFM) is proposed in this work. The CFM deals with trust credits between resources according to their historical collaboration records. This trust reveals a feasible, realistic, and transferable correlation to facilitate the resource selection process for job delegation between arbitrarily connected physical resources. Consequently, the CFM is able to overcome the constraints caused by virtual organization boundaries.
2012-11-05
2012-11-05
2011-01
Article
Bessis, N. et al (2011) 'Modelling of a self-led critical friend topology in inter-cooperative grid communities' Simulation Modelling Practice and Theory 19 (1):5-16
1569190X
10.1016/j.simpat.2010.06.020
http://hdl.handle.net/10547/250948
Simulation Modelling Practice and Theory
en
http://linkinghub.elsevier.com/retrieve/pii/S1569190X10001413
Elsevier
oai:uobrep.openrepository.com:10547/2509202020-04-23T07:29:09Zcom_10547_132192col_10547_132230
A mathematical analysis of a disaster management data-grid push service
Bessis, Nik
Brown, Antony
Asimakopoulou, Eleana
Much work is under way within the Grid technology community on issues associated with the development of services fostering the integration and exploitation of multiple autonomous, distributed data sources through a seamless and flexible virtualized interface. These developments involve fluid and dynamic, ad hoc based interactions between dispersed service providers and consumers. However, several obstacles arise in the design and implementation of such services. In this article, the authors examine a notable obstacle, namely how to keep service consumers informed of relevant changes about data committed in multiple and distributed service provider levels, and most importantly, when these changes can affect others’ well-being. To achieve this, the authors use aggregated case scenarios to demonstrate the need for a data-Grid push service in a disaster management situation. In this regard, the article describes in detail the service architecture, as well as its mathematical analysis for keeping interested stakeholders informed automatically about relevant and critical data changes.
2012-11-05
2012-11-05
2010
Article
A Mathematical Analysis of a Disaster Management Data-Grid Push Service 2010, 1 (3):56-70 International Journal of Distributed Systems and Technologies
1947-3532
1947-3540
10.4018/jdst.2010070104
http://hdl.handle.net/10547/250920
International Journal of Distributed Systems and Technologies
en
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdst.2010070104
Archived with thanks to International Journal of Distributed Systems and Technologies
IGI Global
oai:uobrep.openrepository.com:10547/2509212020-04-23T07:29:09Zcom_10547_132192col_10547_132230
Modelling self-led trust value management in grid and service oriented infrastructures
Brown, Antony
Sant, Paul
Bessis, Nik
French, Tim
Maple, Carsten
Current developments in grid and service oriented technologies involve fluid and dynamic, ad hoc based interactions between delegates, which in turn, serves to challenge conventional centralised structured trust and security assurance approaches. Delegates ranging from individuals to large-scale VO (Virtual Organisations) require the establishment of trust across all parties as a prerequisite for trusted and meaningful e-collaboration. In this paper, a notable obstacle, namely how such delegates (modelled as nodes) operating within complex collaborative environment spaces can best evaluate in context to optimally and dynamically select the most trustworthy ad hoc based resource/service for e-consumption. A number of aggregated service case scenarios are herein employed in order to consider the manner in which virtual consumers and provider ad hoc based communities converge. In this paper, the authors take the view that the use of graph-theoretic modelling naturally leads to a self-led trust management decision based approach in which delegates are continuously informed of relevant up-to-date trust levels. This will lead to an increased confidence level, which trustful service delegation can occur. The key notion is of a self-led trust model that is suited to an inherently low latency, decentralised trust security paradigm.
2012-11-05
2012-11-05
2010
Article
Modelling Self-Led Trust Value Management in Grid and Service Oriented Infrastructures 2010, 1 (4):1-18 International Journal of Systems and Service-Oriented Engineering
1947-3052
1947-3060
10.4018/jssoe.2010100101
http://hdl.handle.net/10547/250921
International Journal of Systems and Service-Oriented Engineering
en
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jssoe.2010100101
Archived with thanks to International Journal of Systems and Service-Oriented Engineering
IGI Global
oai:uobrep.openrepository.com:10547/2509492020-04-23T07:29:09Zcom_10547_132192col_10547_132230
Categorizing facial expressions: a comparison of computational models
Shenoy, Aruna
Anthony, Sue
Frank, Ray
Davey, Neil
Recognizing expressions is a key part of human social interaction, and processing of facial expression information is largely automatic for humans, but it is a non-trivial task for a computational system. The purpose of this work is to develop computational models capable of differentiating between a range of human facial expressions. Raw face images are examples of high-dimensional data, so here we use two dimensionality reduction techniques: principal component analysis and curvilinear component analysis. We also preprocess the images with a bank of Gabor filters, so that important features in the face images may be identified. Subsequently, the faces are classified using a support vector machine. We show that it is possible to differentiate faces with a prototypical expression from the neutral expression. Moreover, we can achieve this with data that has been massively reduced in size: in the best case the original images are reduced to just 5 components. We also investigate the effect size on face images, a concept which has not been reported previously on faces. This enables us to identify those areas of the face that are involved in the production of a facial expression.
2012-11-05
2012-11-05
2011-09
Article
Categorizing facial expressions: a comparison of computational models 2011, 20 (6):815-823 Neural Computing and Applications
0941-0643
1433-3058
10.1007/s00521-010-0446-9
http://hdl.handle.net/10547/250949
Neural Computing and Applications
en
http://www.springerlink.com/index/10.1007/s00521-010-0446-9
Archived with thanks to Neural Computing and Applications
Springer Link
oai:uobrep.openrepository.com:10547/2509232020-04-23T07:29:09Zcom_10547_132192col_10547_132230
Virtual organisational trust requirements
French, Tim
It is suggested that the use of the semiotic ladder, together with a supportive trust agent can be used together to better explicate “soft” trust issues in the context of Grid services. The contribution offered here is intended to fill a gap in current understanding and modelling of such issues and to support Grid service designers to better conceptualise, hence manage trust issues. The semiotic paradigm is intended to offer an integrative viewpoint within which to explicate “soft” trust issues throughout the Grid life-cycle. A computationally lightweight trust agent is described that can be used to verify high level trust of a Virtual Organisation. The potential benefits of the approach that is advocated here include the reduction of risk and potential improvements in the quality and reliability of Grid service partnerships. For these benefits to accrue, explicit “soft” as well as “hard” trust management is essential as is an integrative viewpoint.
2012-11-05
2012-11-05
2009
Article
Virtual Organisational Trust Requirements 2009, 5 (2):1-16 International Journal of Intelligent Information Technologies
1548-3657
1548-3665
10.4018/jiit.2009040101
http://hdl.handle.net/10547/250923
International Journal of Intelligent Information Technologies
en
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jiit.2009040101
Archived with thanks to International Journal of Intelligent Information Technologies
IGI Global
oai:uobrep.openrepository.com:10547/2509252020-04-23T07:29:09Zcom_10547_132192col_10547_132230
Towards a corporate governance trust agent scoring model for collaborative virtual organisations
French, Tim
Bessis, Nik
Xhafa, Fatos
Maple, Carsten
semiotic ladders
lightweight trust agents
scoring systems
corporate governance scores
past performance historys
grid services
cloud computing
collaborative virtual organisations
context-aware trust
grid computing
collaboration
trust management
reputation management
e-services
electronic services
online services
trustworthiness
In this 'visionary' paper, we describe how a semiotic ladder, together with a supportive trust agent, can be used to address 'soft' trust issues in the context of collaborative Virtual Organisations (VOs). The intention is to offer all parties better support for trust (as reputation) management, including the reduction of risk and improved reliability of VO e-services. The semiotic ladder is intended to support the VO e-service life cycle through the articulation of e-trust at various levels of system abstraction, including trust as a measurable confidence level. A novel trust agent is used to provide the consumer with an objective measure of the trustworthiness of the e-service at runtime, just prior to its actual consumption. Specifically, VO consumer confidence level is informed via a set of Corporate Governance (CG) scores, which are used as a trust proxy for the 'real' owner of the VO.
2012-11-05
2012-11-05
2011
Article
Towards a corporate governance trust agent scoring model for collaborative virtual organisations 2011, 2 (2):98-108 International Journal of Grid and Utility Computing
1741-847X
1741-8488
10.1504/IJGUC.2011.040597
http://hdl.handle.net/10547/250925
International Journal of Grid and Utility Computing
en
http://www.inderscience.com/link.php?id=40597
Archived with thanks to International Journal of Grid and Utility Computing
Inderscience
oai:uobrep.openrepository.com:10547/2509242020-04-23T07:29:09Zcom_10547_132192col_10547_132230
Trust issues on crowd-sourcing methods for urban environmental monitoring
French, Tim
Bessis, Nik
Maple, Carsten
Asimakopoulou, Eleana
This paper explores trust related issues arising from the use of a crowd-sourcing method. Crowd-sourcing is a relatively new method that utilises modern technologies to gather, analyse and visualise specific “on-the-fly” data. The data is typically acquired through the employment of mobile technology, with each device running a bespoke application that captures the desired information. The resulting “crowd sourced” data is readily available and the corresponding maps produced can in turn, be used to support strategic planning and to facilitate overall, more informed decision-making. The purpose is to provide insights into this novel approach to data collection, aggregation and subsequent visualisation. Specifically, the focus centres upon issues of trust and security that are inherent not merely to the use of crowd sourced data capture itself, but also crucially, to the stewardship and usage of the resultant data sets within e-government settings. A novel community centric usage scenario is presented that seeks to show how issues of trust pervade the technology. Hence, both rewards and risks are revealed and we go on to outline a preliminary approach intended to support a trusted and reputable “crowdy” data architecture.
2012-11-05
2012-11-05
2012
Article
Trust Issues on Crowd-Sourcing Methods for Urban Environmental Monitoring 2012, 3 (1):35-48 International Journal of Distributed Systems and Technologies
1947-3532
1947-3540
10.4018/jdst.2012010103
http://hdl.handle.net/10547/250924
International Journal of Distributed Systems and Technologies
en
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdst.2012010103
Archived with thanks to International Journal of Distributed Systems and Technologies
IGI Global
oai:uobrep.openrepository.com:10547/2509222020-04-23T07:29:09Zcom_10547_132192col_10547_132230
Defining minimum requirements of inter-collaborated nodes by measuring the weight of node interactions
Sotiriadis, Stelios
Bessis, Nik
Huang, Ye
Sant, Paul
Maple, Carsten
This paper focuses on defining the minimum requirements to support the inter-cooperation between various scales, dynamically evolved Virtual Organizations (VOs). This proposed method is able to assign a weighted value to each pair-wise path that each member (node) can select in order to locate neighbouring nodes according to their preferences. The method also takes into account the communication overhead between each node interaction. The weight of each path is to be measured by the analysis of prerequisites in order to achieve a mutually agreed interaction between nodes. Requirements are defined as the least parameters or conditions that a node needs to achieve in order to determine its accessibility factor. The motivation behind this work is the vision of the Critical Friends Community model, which is a suitable topology for interoperable grid environments. The topology suggests that capturing inter-cooperated nodes interactions that can be publicly available could lead to knowledge of neighbouring VO members which, in turn, could be used for facilitating a more effective resource discovery and selection decision.
2012-11-05
2012-11-05
2011
Article
Defining Minimum Requirements of Inter-Collaborated Nodes by Measuring the Weight of Node Interactions 2011, 2 (3):19-37 International Journal of Distributed Systems and Technologies
1947-3532
1947-3540
10.4018/jdst.2011070102
http://hdl.handle.net/10547/250922
International Journal of Distributed Systems and Technologies
en
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdst.2011070102
Archived with thanks to International Journal of Distributed Systems and Technologies
IGI Global
oai:uobrep.openrepository.com:10547/2509162020-04-23T08:42:53Zcom_10547_132192col_10547_132230
A novel hybrid tabu search approach to container loading
Liu, Jiamin
Yue, Yong
Dong, Zongran
Maple, Carsten
Keech, Malcolm
heuristic
tabu search
container loading
stability
weight distribution
The container loading problem, which is significant for a number of industrial sectors, aims to obtain a high space utilisation in the container while satisfying practical constraints. This paper presents a novel hybrid tabu search approach to the container loading problem. A loading heuristic is devised to incorporate heuristic strategies with a handling method for remaining spaces to generate optimal loading arrangements of boxes with stability considered. The tabu search technique, which covers the encoding, evaluation criteria and configuration of neighbourhood and candidate solutions, is used to improve the performance of the loading heuristic. Experimental results with benchmark data show that the hybrid approach provides a better space utilisation than the published approaches under the condition of all loaded boxes with one hundred percent support from below. Moreover, it is shown that the hybrid tabu search can solve problems with the constraints of weight limit and weight distribution with real world data.
2012-11-05
2012-11-05
2011-04
Article
Liu, J. et al (2011) 'A novel hybrid tabu search approach to container loading' Computers & Operations Research 38 (4):797-807
0305-0548
10.1016/j.cor.2010.09.002
http://hdl.handle.net/10547/250916
Computers & Operations Research
en
http://linkinghub.elsevier.com/retrieve/pii/S0305054810001917
Elsevier
oai:uobrep.openrepository.com:10547/2509442020-04-23T07:35:29Zcom_10547_132192col_10547_132230
Managing inconsistencies in data grid environments
Ahmed, Ejaz
Bessis, Nik
Norrington, Peter
Yue, Yong
Much work has been done in the area of data access and integration using various data mapping, matching, and loading techniques. One of the main concerns when integrating data from heterogeneous data sources is data redundancy. The concern is mainly due to the different business contexts and purposes from which the data systems were originally built. A common process for accessing data from integrated databases involves the use of each data source’s own catalogue or metadata schema. In this article, the authors take the view that there is a greater chance of data inconsistencies, such as data redundancies when integrating them within a grid environment as compared to traditional distributed paradigms. The importance of improving the data search and matching process is briefly discussed, and a partial service oriented generic strategy is adopted to consolidate distinct catalogue schemas of federated databases to access information seamlessly. To this end, a proposed matching strategy between structure objects and data values across federated databases in a grid environment is presented.
2012-11-05
2012-11-05
2010
Article
Managing Inconsistencies in Data Grid Environments 2010, 2 (4):51-65 International Journal of Grid and High Performance Computing
1938-0259
1938-0267
10.4018/jghpc.2010100105
http://hdl.handle.net/10547/250944
International Journal of Grid and High Performance Computing
en
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jghpc.2010100105
Archived with thanks to International Journal of Grid and High Performance Computing
IGI Global
oai:uobrep.openrepository.com:10547/2509412020-04-23T07:29:10Zcom_10547_132192col_10547_132230
Speckle tracking in intracardiac echocardiography for the assessment of myocardial deformation
Yong Yue
Clark, J.W.
Khoury, D.S.
cardiac imaging
myocardial strain
elastic registration
non-rigid deformation
sonomicrometry
Intracardiac echocardiography has proven to be useful for online anatomical imaging during catheterization. Our objective was to develop a speckle tracking method for myocardial motion estimation from intracardiac echocardiographic image sequences in order to provide a mean for regional functional imaging. Our approach was to solve two problems in motion estimation from two-dimensional intracardiac echocardiographic image sequences: non-rigid myocardial deformation and speckle decorrelation. To achieve robust noise resistance, we employed maximum likelihood estimation while fully exploiting ultrasound speckle statistics, and treated the maximization of motion probability as the minimization of an energy function. Non-rigid myocardial deformation was estimated by optimizing this energy function within a framework of parametric elastic registration. Evaluation of the method was carried out using a computer model that synthesized echocardiographic image sequences, and subsequently an animal model that provided continuous intracardiac echocardiographic images as well as reference measurements using sonomicrometry crystals. In conclusion, accurate estimation of regional myocardial deformation from intracardiac echocardiography by novel speckle tracking is feasible. This approach may have important clinical implications for multimodal imaging during catheterization.
2012-11-05
2012-11-05
2008-10
Article
Speckle Tracking in Intracardiac Echocardiography for the Assessment of Myocardial Deformation 2009, 56 (2):416-425 IEEE Transactions on Biomedical Engineering
0018-9294
1558-2531
10.1109/TBME.2008.2006036
http://hdl.handle.net/10547/250941
IEEE Transactions on Biomedical Engineering
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4639510
Archived with thanks to IEEE Transactions on Biomedical Engineering
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2509402020-04-23T08:42:53Zcom_10547_132192col_10547_132230
A novel risk assessment and optimisation model for a multi-objective network security countermeasure selection problem
Viduto, Valentina
Maple, Carsten
Huang, Wei
López-Peréz, David
financial decision support
risk assessment
countermeasure selection problem
multi-objective optimisation
tabu search
Budget cuts and the high demand in strengthening the security of computer systems and services constitute a challenge. Poor system knowledge and inappropriate selection of security measures may lead to unexpected financial and data losses. This paper proposes a novel Risk Assessment and Optimisation Model (RAOM) to solve a security countermeasure selection problem, where variables such as financial cost and risk may affect a final decision. A Multi-Objective Tabu Search (MOTS) algorithm has been developed to construct an efficient frontier of non-dominated solutions, which can satisfy organisational security needs in a cost-effective manner.
2012-11-05
2012-11-05
2012-06
Article
Viduto, V. et al (2012) 'A novel risk assessment and optimisation model for a multi-objective network security countermeasure selection problem' Decision Support Systems 53 (3):599-610
0167-9236
10.1016/j.dss.2012.04.001
http://hdl.handle.net/10547/250940
Decision Support Systems
en
http://linkinghub.elsevier.com/retrieve/pii/S0167923612000978
els
oai:uobrep.openrepository.com:10547/2509192020-04-23T07:36:54Zcom_10547_132192col_10547_132230
This is my body: the uses and effects of the avatar in the virtual world
Conrad, Marc
Neale, Jo
Charles, Alec
University of Bedfordshire
The study focuses on the relationship users of virtual worlds, such as Second Life, may or may not develop toward the avatar they use. A questionnaire was developed to collect both qualitative and quantitative data from students engaged in a university assignment that required them to use an avatar in Second Life. The findings are contextualized and discussed: The distinctions between software, hardware and self are blurred.
2012-11-05
2012-11-05
2010-12
Article
Conrad, M.,Neale, J.,Charles, A. (2010) 'This Is My Body: The Uses and Effects of the Avatar in the Virtual World', International Journal for Infonomics, 3 (4): 360-368
1742-4712
http://hdl.handle.net/10547/250919
International Journal for Infonomics
en
http://www.infonomics-society.org/IJI/Contents%20Page%20Volume%203%20Issue%204.pdf
Infonomics Society
oai:uobrep.openrepository.com:10547/2509392020-04-23T07:30:53Zcom_10547_132192col_10547_132230
Sparse matrix operations on several multi-core architectures
Trinitis, Carsten
Küstner, Tilman
Weidendorfer, Josef
Smajic, Jasmin
multicore
pinning
cache optimization
performance optimization
sparse matrices
From the issue entitled "Special Issue on Parallel Computing Technologies"
This paper compares various contemporary multicore-based microprocessor architectures from different vendors with different memory interconnects regarding performance, speedup, and parallel efficiency. Sparse matrix decomposition is used as a benchmark application. The example matrix used in the experiments comes from an electrical engineering application, where numerical simulation of physical processes plays an important role in the design of industrial products. Within this context, thread-to-core pinning and cache optimization are two important aspects which are investigated in more detail.
2012-11-05
2012-11-05
2010
Article
Trinitis, C. et al (2010) 'Sparse matrix operations on several multi-core architectures' The Journal of Supercomputing 57 (2):132-140
0920-8542
1573-0484
10.1007/s11227-010-0428-9
http://hdl.handle.net/10547/250939
The Journal of Supercomputing
en
http://www.springerlink.com/index/10.1007/s11227-010-0428-9
SpringerLink
oai:uobrep.openrepository.com:10547/2518142020-04-23T07:29:13Zcom_10547_132192col_10547_132230
Off-loading application controlled data prefetching in numerical codes for multi-core processors
Trinitis, Carsten
Weidendorfer, Josef
An important issue when designing numerical code in High Performance Computing is cache optimisation in order to exploit the performance potential of a given target architecture. This includes techniques to improve memory access locality as well as prefetching. Inherent algorithm constrains often limit the first approach, which typically uses a blocking technique. While there exist automatic prefetching mechanisms in hardware and/or compilers, they can not complement blocking with additional prefetching. We provide an infrastructure for off-loading application controlled prefetching on a chip multiprocessor, allowing to further improve numerical code already optimised by standard cache optimisation. Clear benefits are shown for real workloads on existing hardware.
2012-11-12
2012-11-12
2008-11
Article
Weidendorfer, J., Trinitis, C.
(2008) 'Off-loading application controlled data prefetching in numerical codes for multicore
processors', 4 (1): 22-28, Int. J. of Computational Science and Engineering
1742-7185
http://hdl.handle.net/10547/251814
1742-7193
International Journal of Computational Science and Engineering
en
http://dl.acm.org/citation.cfm?id=1457171
Inderscience
oai:uobrep.openrepository.com:10547/2550522018-06-19T10:34:36Zcom_10547_132192col_10547_132230
Discovering exclusive patterns in frequent sequences
Chen, Weiru
Lu, Jing
Keech, Malcolm
G560 Data Management
G510 Information Modelling
data mining
2012-12-10
2012-12-10
2010
Article
Chen, w. Lu, J, Keech, M (2010) Discovering exclusive patterns in frequent sequences. International Journal of Data Mining, Modelling and Management,Vol.2,(3) pp.252 - 267
1759-1163
1759-1171
http://hdl.handle.net/10547/255052
International Journal of Data Mining, Modelling and Management
en
http://www.inderscience.com/info/inarticle.php?artid=33536
An error occurred getting the license - uri.
An error occurred on the license name.
Inderscience Publishers
oai:uobrep.openrepository.com:10547/2682922020-04-23T07:29:19Zcom_10547_132192col_10547_132230
Preliminary study of technical terminology for the retrieval of scientific book metadata records
Larsen, Birger
Lioma, Christina
Frommholz, Ingo
Schütze, Hinrich
G500 Information Systems
book records
technical terminology
information storage and retrieval
metadata
Books only represented by brief metadata (book records) are particularly hard to retrieve. One way of improving their retrieval is by extracting retrieval enhancing features from them. This work focusses on scientific (physics) book records. We ask if their technical terminology can be used as a retrieval enhancing feature. A study of 18,443 book records shows a strong correlation between their technical terminology and their likelihood of relevance. Using this finding for retrieval yields >+5% precision and recall gains.
2013-02-05
2013-02-05
2012-08
Conference papers, meetings and proceedings
Birger Larsen, Christina Lioma, Ingo Frommholz, and Hinrich Schütze. 2012. Preliminary study of technical terminology for the retrieval of scientific book metadata records. In Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval (SIGIR '12). ACM, New York, NY, USA, 1131-1132. DOI=10.1145/2348283.2348504 http://doi.acm.org/10.1145/2348283.2348504
10.1145/2348283.2348504
http://hdl.handle.net/10547/268292
SIGIR, 2012
en
http://dl.acm.org/citation.cfm?doid=2348283.2348504
Association for Computing Machinery (ACM)
oai:uobrep.openrepository.com:10547/2705782020-04-23T07:29:24Zcom_10547_132192col_10547_132230
Cyberstalking in the United Kingdom: an analysis of the ECHO Pilot Survey
Maple, Carsten
Short, Emma
Brown, Antony
University of Bedfordshire
cyber security
cyberstalking
An Analysis of the ECHO Pilot Survey
Network for Surviving Stalking is internationally recognised as the leading Registered Charity in the United Kingdom dedicated to supporting victims of stalking, free of cost or commercial gain. It aims to provide support to victims, potential victims and others affected by stalking or harassment throughout the UK, to raise awareness of the subject and to provide information about stalking and harassment to professionals, relevant agencies and the public. As we have moved into an age of electronic information and communication, stalkers have found new, more effective and efficient means to perpetrate their malicious acts; stalkers have become Cyberstalkers. Cyberstalking has become somewhat of an epidemic stretching across the globe. Network for Surviving Stalking began to notice that an increasing number of people searching for support were being stalked or harassed online, making the charity concerned as to the prevalence, nature and impact of cyberstalking. The charity commissioned a team of researchers and together developed an online questionnaire to establish answers to these questions. This report provides an analysis of the responses to the questionnaire.
2013-02-27
2013-02-27
2011
Technical Report
Maple, C., Shart, E., Brown, A. (2011) Cyberstalking in the United Kingdom: An Analysis of the ECHO Pilot Survey.
http://hdl.handle.net/10547/270578
en
http://www.beds.ac.uk/__data/assets/pdf_file/0003/83109/ECHO_Pilot_Final.pdf
University of Bedfordshire
oai:uobrep.openrepository.com:10547/2706072020-04-23T07:29:24Zcom_10547_132192col_10547_132230
A survey of localization in wireless sensor network
Cheng, Long
Wu, Chengdong
Zhang, Yunzhou
Wu, Hao
Li, Mengxin
Maple, Carsten
wireless sensor networks
Localization is one of the key techniques in wireless sensor network. The location estimation methods can be classified into target/source localization and node self-localization. In target localization, we mainly introduce the energy-based method. Then we investigate the node self-localization methods. Since the widespread adoption of the wireless sensor network, the localization methods are different in various applications. And there are several challenges in some special scenarios. In this paper, we present a comprehensive survey of these challenges: localization in non-line-of-sight, node selection criteria for localization in energy-constrained network, scheduling the sensor node to optimize the tradeoff between localization performance and energy consumption, cooperative node localization, and localization algorithm in heterogeneous network. Finally, we introduce the evaluation criteria for localization in wireless sensor network.
2013-02-27
2013-02-27
2012
Article
Cheng, L., Wu, C., Zhang, Y., Wu, H., Li, M. and Maple, C. (2012) “A Survey of Localization in Wireless Sensor Network,” International Journal of Distributed Sensor Networks, 2012,. doi:10.1155/2012/962523
1550-1329
1550-1477
10.1155/2012/962523
http://hdl.handle.net/10547/270607
International Journal of Distributed Sensor Networks
en
http://www.hindawi.com/journals/ijdsn/2012/962523/
Archived with thanks to International Journal of Distributed Sensor Networks
Hindawi Publishing Corporation
oai:uobrep.openrepository.com:10547/2729732020-04-23T07:36:21Zcom_10547_132192col_10547_132230
Implementation and co-simulation of hybrid pilot-aided channel estimation with decision feedback equalizer for OFDM systems
Li, Wei
Zhang, Yue
Huang, Li-Ke
Maple, Carsten
Cosmas, John
University of Bedfordshire
CFO
DFE
EVM
FPGA
MMSE
OFDM
SFO
channel estimation
co-simulation
OFDM modulation
This paper introduces novel hybrid pilot-aided channel estimation with decision feedback equalizer(DFE) for OFDM systems and its corresponding hardware co-simulation platform. This pilot-aided channel estimation algorithm consists of two parts: coarse estimation and fine estimation. In the coarse estimation, the combined classical channel estimation methods including carrier frequency offset (CFO) and channel impulse response (CIR) estimation are used. Based on the received training sequence and pilot tones in the frequency domain, the major CFO, sampling clock frequency offset (SFO) and CIR effect coefficients are derived. In the fine estimation, the pilot-aided polynomial interpolation estimation combined with a new decision feedback equalizer scheme based on minimum mean squared error (MMSE) criteria is proposed to reduce the residual effect caused by imperfect CIR equalizer, SFO and CFO. At the same time, for the purpose of speeding up the whole development and verification process, a new architecture of co-simulation platform which combines software and hardware is introduced. The simulation results on the co-simulation platform indicate that the proposed hybrid channel estimation scheme can enhance the receiver performance by 6 dB in terms of error vector magnitude (EVM) over large ranges of CFO and SFO and BER performance by 7 dB for SNR range over 15 dB.
2013-03-15
2013-03-15
2012
Article
Li, W., Zhang, Y., Huang, L.K., Maple, C., Cosmas, J.P. (2012) 'Implementation and Co-Simulation of Hybrid Pilot-Aided Channel Estimation With Decision Feedback Equalizer for OFDM Systems' IEEE Transactions on Broadcasting 58 (4):590-602
0018-9316
1557-9611
10.1109/TBC.2012.2207249
http://hdl.handle.net/10547/272973
IEEE Transactions on Broadcasting
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6279474
Archived with thanks to IEEE Transactions on Broadcasting
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2729722020-04-23T07:29:26Zcom_10547_132192col_10547_132230
Fuzzy optimisation based symbolic grounding for service robots
Liu, Beisheng
Li, Dayou
Qiu, Renxi
Yue, Yong
Maple, Carsten
Gu, Shuang
University of Bedfordshire
collision avoidance
grasping
grounding
optimization
robot sensing systems
trajectory
robotics
fuzzy optimisation
Symbolic grounding is a bridge between high-level planning and actual robot sensing, and actuation. Uncertainties raised by the unstructured environment make a bottleneck for integrating traditional artificial intelligence with service robotics. This paper presents a fuzzy logic based approach to formalise the grounding problems into a fuzzy optimization problem, which is robust to uncertainties. Novel techniques are applied to establish the objective function, to model fuzzy constraints and to perform fuzzy optimisation. The outcome is tested with a service robot fetch and carry task, where the fuzzy optimisation approach helps the robot to determine the most comfortable position (location and orientation) for grasping objects. Experimental results show that the proposed approach improves the robustness of the task implementation in unstructured environments.
2013-03-15
2013-03-15
2012
Conference papers, meetings and proceedings
Liu, B., Li, D., Qiu, R., Yue, Y., Maple, C., Gu, S. (2012) 'Fuzzy optimisation based symbolic grounding for service robots' Intelligent Robots and Systems (IROS), 2012 IEEE/RSJ International Conference on , vol., no., pp.1658-1664, 7-12 Oct. 2012
9781467317375
10.1109/IROS.2012.6385777
http://hdl.handle.net/10547/272972
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6385777
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2729542020-04-23T07:36:21Zcom_10547_132192col_10547_132230
Effectively handling three-dimensional spaces for container loading
Liu, Jiamin
Zhang, Xiaorui
Yue, Yong
Maple, Carsten
Shenyang University of Technology
University of Bedfordshire
space utilization
To improve space utilization, the method for handling spaces plays an important role in the container loading problem. This paper deals with loading a set of cuboid items into a single container to maximize the utilization of the space. Six space partitions are presented and a set of rules for merging spaces is proposed. Through experimentation, using a benchmark data set, the influence of partitioning and merging are analyzed. The experimental results show that partitioning and merging in which all loaded boxes have one hundred percent support from below can produce good space utilization.
2013-03-15
2013-03-15
2012
Conference papers, meetings and proceedings
Liu, J., Zhang, X., Yue, Y., Maple, C., (2012) 'Effectively handling three-dimensional spaces for container loading' 2012 International Conference on Numerical Analysis and Applied Mathematics, Kos, Greece, 19-25 September 2012
9780735410916
10.1063/1.4756569
http://hdl.handle.net/10547/272954
en
http://link.aip.org/link/APCPCS/v1479/i1/p1960/s1&Agg=doi
American Institute of Physics
oai:uobrep.openrepository.com:10547/2729532020-04-23T07:29:26Zcom_10547_132192col_10547_132230
Fuzzy logic based symbolic grounding for best grasp pose for homecare robotics
Liu, Beisheng
Li, Dayou
Yue, Yong
Maple, Carsten
Gu, Shuang
Qiu, Renxi
University of Bedfordshire
fuzzy logic
homecare robots
robotics
symbolic grounding
unstructured environments
Symbolic grounding in unstructured environments remains an important challenge in robotics [7]. Homecare robots are often required to be instructed by their human users intuitively, which means the robots are expected to take highlevel commands and execute corresponding tasks in a domestic environment. High-level commands are represented with symbolic terms such as “near” and “close” and, on the other hand, robots are controlled based on trajectories. The robots need to translate the symbolic terms to trajectories. In addition, domestic environment is unstructured where the same objects can be placed in different places over the time. This increases the difficulties in symbolic grounding. This paper presents a fuzzy logic based approach to symbolic grounding. In this approach, grounded concepts are modelled as fuzzy sets and the existing knowledge is used to deduce grounded values given real-time sensory inputs. Experiments results show that this approach works well in unstructured environment.
2013-03-15
2013-03-15
2012
Conference papers, meetings and proceedings
Beisheng Liu;, Dayou Li, Yong Yue, Maple, C., Shuang Gu, Renxi Qiu, (2012) 'Fuzzy logic based symbolic grounding for best grasp pose for homecare robotics', Industrial Informatics (INDIN), 10th IEEE International Conference on , pp.1164-1169, 25-27 July 2012
9781467303125
10.1109/INDIN.2012.6300855
http://hdl.handle.net/10547/272953
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6300855
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2707782020-04-23T07:29:33Zcom_10547_132192col_10547_132230
A multi-objective genetic algorithm for minimising network security risk and cost
Viduto, Valentina
Maple, Carsten
Huang, Wei
Bochenkov, Alexey
countermeasure selection problem
decision making
genetic algorithm
IT security
risk optimisation
computer security
Security countermeasures help ensure information security: confidentiality, integrity and availability(CIA), by mitigating possible risks associated with the security event. Due to the fact, that it is often difficult to measure such an impact quantitatively, it is also difficult to deploy appropriate security countermeasures. In this paper, we demonstrate a model of quantitative risk analysis, where an optimisation routine is developed to help a human decision maker to determine the preferred trade-off between investment cost and resulting risk. An offline optimisation routine deploys a genetic algorithm to search for the best countermeasure combination, while multiple risk factors are considered. We conduct an experimentation with real world data, taken from the PTA(Practical Threat Analysis) case study to show that our method is capable of delivering solutions for real world problem data sets. The results show that the multi-objective genetic algorithm (MOGA) approach provides high quality solutions, resulting in better knowledge for decision making.
2013-03-01
2013-03-01
2012
Conference papers, meetings and proceedings
Viduto, V., Maple, C., Huang. W. and Bochenkov, A. (2012) "A multi-objective genetic algorithm for minimising network security risk and cost," High Performance Computing and Simulation (HPCS), 2012 International Conference on , pp.462-467, 2-6 July 2012
9781467323598
10.1109/HPCSim.2012.6266959
http://hdl.handle.net/10547/270778
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6266959
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2706052020-04-23T07:29:24Zcom_10547_132192col_10547_132230
UK security breach investigations report: an analysis of data compromise cases
Maple, Carsten
Phillips, Alan
University of Bedfordshire
7Safe
security policy
breach investigations
This report, rather than relying on questionnaires and self-reporting, concerns cases that were investigated by the forensic investigation team at 7Safe. Whilst removing any inaccuracies arising from self-reporting, the authors acknowledge that the limitation of the sample size remains. It is hoped that the unbiased reporting by independent investigators has yielded interesting facts about modern security breaches. All data in this study is based on genuine completed breach investigations conducted by the compromise investigation team over the last 18 months.
2013-02-27
2013-02-27
2010
Technical Report
Maple C., Phillips, A. (2010) UK Security Breach Investigations Report: An Analysis of Data Compromise Cases
http://hdl.handle.net/10547/270605
en
http://www.7safe.com/breach_report/
7Safe
oai:uobrep.openrepository.com:10547/2706122020-04-23T07:37:24Zcom_10547_132192col_10547_132230
Music is the key: using our enduring memory for songs to help users log on
Gibson, Marcia
Renaud, Karen
Conrad, Marc
Maple, Carsten
sound based passwords
Devising access control systems to support needs and capabilities of users, as well as the security requirements of organisations, is a key challenge faced in many of today’s business environments. If users are to behave securely, they must not be overburdened with unworkable authentication policies and methods. Yet the prevailing alphanumeric password can be a double-edged sword: secure passwords are inherently difficult to recall and vice-versa. Consequentially, a growing number of alternatives are emerging. In this chapter, the authors describe one novel scheme - a musical password. Musipass was designed with the user in mind and is tailored toward the task of authentication on the Web, where biometric and token-based systems have proved unsuccessful in replacing the flawed, yet prevalent traditional password. This chapter, which includes discussion on current thinking in the field of authentication, will be of interest to information managers, security practitioners, and HCI professionals.
2013-02-28
2013-02-28
2012
Book chapter
Gibson, M., Renaud K., Conrad, M., Maple, C. (2012) “Music is the key: Using our superior memory for songs to help users log on”, in: Gupta, M., Walp, J., Sharman, R. (eds), Strategic and Practical Approaches for Information Security Governance, ch.8, pages 137-157. Technology and Applied Solutions, IGI Global.
9781466601970
10.4018/978-1-4666-0197-0.ch008
http://hdl.handle.net/10547/270612
en
http://www.igi-global.com/book/strategic-practical-approaches-information-security/58283
IGI Global
oai:uobrep.openrepository.com:10547/2706322024-02-06T10:42:41Zcom_10547_132192col_10547_132230
Fuzzy logic based localisation in wireless sensor networks for disaster environment
Gu, Shuang
Yue, Yong
Maple, Carsten
Wu, Chengdong
University of Bedfordshire
WSNs
fuzzy logic
localisation
Progress in micro-electromechanical systems (MEMS) and radio frequency (RF) technology has fostered the development of wireless sensor networks (WSNs). Although WSNs have been successfully applied in built environments, their applications and benefits have not been fully explored in the areas of disaster recovery and rescuing. In this paper, a novel probabilistic fuzzy logic based Range-free localisation algorithm (PFRL) is proposed. The proposed algorithm is compared with other range free localisation algorithms. Simulation results demonstrate the accurate and effectiveness of the proposed algorithm.
2013-02-28
2013-02-28
2012
Conference papers, meetings and proceedings
Gu, S., Yue, Y., Maple, C., Wu, C., (2012) "Fuzzy logic based localisation in wireless sensor networks for disaster environments," Automation and Computing (ICAC), 2012 18th International Conference on , pp.1-5, 7-8 Sept.
9781467317221
http://hdl.handle.net/10547/270632
en
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=6330549
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2706132024-02-06T10:40:36Zcom_10547_132192col_10547_132230
Classification of multi-channels SEMG signals using wavelet and neural networks on assistive robot
Gu, Shuang
Yue, Yong
Wu, Chengdong
Maple, Carsten
Liu, Beisheng
University of Bedfordshire
assistive robot
neural networks
surface electromyography
wavelet
Recently, the robot technology research is changing from manufacturing industry to non-manufacturing industry, especially the service industry related to the human life. Assistive robot is a kind of novel service robot. It can not only help the elder and disabled people to rehabilitate their impaired musculoskeletal functions, but also help healthy people to perform tasks requiring large forces. This kind of robot has a broad application prospect in many areas, such as medical rehabilitation, special military operations, special/high intensity physical labour, space, sports, and entertainment. SEMG (Surface Electromyography) of Palmaris longus, brachioradialis, flexor carpiulnaris and biceps brachii are analysed with a wavelet transform method. The absolute variance of 3-layer wavelet coefficients is distilled and regarded as signal characteristics to compose eigenvectors. The eigenvectors are input data of a neural network classifier used to identify 5 different kinds of movement patterns including wrist flexor, wrist extensor, elbow flexion, forearm pronation and forearm rotation. Experiments verify the effectiveness of the proposed method.
2013-02-28
2013-02-28
2012
Conference papers, meetings and proceedings
Shuang Gu; Yong Yue; Maple, C.; Beisheng Liu; Chengdong Wu; , "Classification of multi-channels SEMG signals using wavelet and neural networks on assistive robot," Industrial Informatics (INDIN), 2012 10th IEEE International Conference on , pp.1158-1163, 25-27 July 2012
9781467303125
10.1109/INDIN.2012.6301140
http://hdl.handle.net/10547/270613
en
http://ieeexplore.ieee.org/xpls/abs_all.jsp?tp=&arnumber=6301140
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2706142020-04-23T07:29:25Zcom_10547_132192col_10547_132230
A parallel algorithm to calculate the costrank of a network
Hamid, Thaier K.A.
Maple, Carsten
Yue, Yong
parallel computing
distributed algorithms
pagerank
We developed analogous parallel algorithms to implement CostRank for distributed memory parallel computers using multi processors. Our intent is to make CostRank calculations for the growing number of hosts in a fast and a scalable way. In the same way we intent to secure large scale networks that require fast and reliable computing to calculate the ranking of enormous graphs with thousands of vertices (states) and millions or arcs (links). In our proposed approach we focus on a parallel CostRank computational architecture on a cluster of PCs networked via Gigabit Ethernet LAN to evaluate the performance and scalability of our implementation. In particular, a partitioning of input data, graph files, and ranking vectors with load balancing technique can improve the runtime and scalability of large-scale parallel computations. An application case study of analogous Cost Rank computation is presented. Applying parallel environment models for one-dimensional sparse matrix partitioning on a modified research page, results in a significant reduction in communication overhead and in per-iteration runtime. We provide an analytical discussion of analogous algorithms performance in terms of I/O and synchronization cost, as well as of memory usage.
2013-02-28
2013-02-28
2012
Article
Hamid, T., Maple, C. and Yue, Y. (2012) 'A parallel algorithm to calculate the costrank of a network', International Journal of Computer Applications, 44 (3), pp.17-22.
0975-8887
10.5120/6243-8161
http://hdl.handle.net/10547/270614
International Journal of Computer Applications
en
http://research.ijcaonline.org/volume44/number3/pxc3878161.pdf
Foundation of Computer Science, New York, USA
oai:uobrep.openrepository.com:10547/2709562020-04-23T07:29:26Zcom_10547_132192col_10547_132230
Case study: multi-role shadow robotic system for independent living
Maple, Carsten
Yue, Yong
Li, Dayou
Bochenkov, Alexey
University of Bedfordshire
EU FP7
EU Project
international collaboration
robotics
robotic system
SRS robot
assisted living
personalised home care
The project is focused on development and prototyping of remotely-controlled, semi-autonomous robotic solutions in domestic environments to support elderly people. In particular, the SRS project is demonstrating an innovative, practical and efficient system called "SRS robot" for personalised home care and assisted living.
2013-03-04
2013-03-04
2012
Article
Maple, C., Yong Yue, Dayou Li, Bochenkov, A. (2012 ) 'Case study: Multi-role shadow robotic system for independent living' High Performance Computing and Simulation (HPCS), 2012 International Conference pp.415
9781467323598
10.1109/HPCSim.2012.6266950
http://hdl.handle.net/10547/270956
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6266950
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2707842024-02-06T10:46:32Zcom_10547_132192col_10547_132230
Vulnerability, victims and free movement: the case of cyberstalking
Maple, Carsten
Lang, Richard
University of Bedfordshire
cyberstalking
Any crime can have enormous emotional and physical consequences for the victim. However, two potential attributes of a crime which can signifi cantly worsen the ordeal suff ered by the victim are, fi rstly, that it is committed behind closed doors, especially the doors of one’s home, and secondly, that it is committed anonymously.1 Cyberstalking, by which high-tech methods are used to distress, frighten and intimidate the victim, is almost unique in that it can possess both of these attributes, sometimes even both at once. Despite this, the European Commission, in a recent proposal for a directive, has not seen fi t to include it on a list of crimes the victims of which are “particularly vulnerable”. In this article, the authors consider the proposal in detail, before looking at cyberstalking itself, and demonstrating why, in their opinion, the new directive should be amended to contain a specific reference to this crime. Going forward, they call for bespoke EU legislation to protect victims of cyberstalking throughout Europe.
2013-03-01
2013-03-01
2012
Article
Maple, C. and Lang, R. (2012) “Vulnerability, Victims and Free Movement: the Case of Cyberstalking”, New Journal of European Criminal Law, 3 (2): 208-221
http://hdl.handle.net/10547/270784
2032-2844
New Journal of European Criminal Law
en
http://www.njecl.eu/table_of_content.aspx?sy=2012&pn=2
Intersentia
oai:uobrep.openrepository.com:10547/2708012020-04-23T07:29:26Zcom_10547_132192col_10547_132230
Cyberstalking in the UK: analysis and recommendations.
Maple, Carsten
Short, Emma
Brown, Antony
Bryden, Chris
Salter, Michael
cyberstalking
The growth in the use of interconnected devices in the UK is well-documented. Society has embraced new technology allowing access to information, systems, and people; children are being described as digital natives and social networking, internet telephony, and accessing digital entertainment are a major part of their lives. However, whilst the ubiquitous nature of modern communication systems has brought many benefits, there exist a minority that uses the technology to harass others. This paper considers the phenomenon of Cyberstalking and presents an analysis of the problem and the responses provided on the first survey that addresses issue specifically. The paper discusses the nature of attacks, the victim-attacker relationship, the impact of the attacks and the actions taken to resolve the issue. The paper also considers both the legal and technological aspects and presents recommendations to help reduce the occurrence of Cyberstalking.
2013-03-01
2013-03-01
2012
Article
Maple, C., Short, E., Brown, A., Bryden, C., & Salter, M. (2012). 'Cyberstalking in the UK: Analysis and Recommendations.' International Journal of Distributed Systems and Technologies (IJDST), 3(4), 34-51. doi:10.4018/jdst.2012100104
1947-3532
1947-3540
10.4018/jdst.2012100104
http://hdl.handle.net/10547/270801
International Journal of Distributed Systems and Technologies
en
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdst.2012100104
Archived with thanks to International Journal of Distributed Systems and Technologies
IGI Global
oai:uobrep.openrepository.com:10547/2707802020-04-23T07:29:26Zcom_10547_132192col_10547_132230
DDH-MAC: a novel dynamic de-centralized hybrid MAC protocol for cognitive radio networks
Shah, Munam Ali
Safdar, Ghazanfar Ali
Maple, Carsten
co-operative communication
cognitive radio
common control channel
MAC protocols
security
The radio spectrum (3kHz - 300GHz) has become saturated and proven to be insufficient to address the proliferation of new wireless applications. Cognitive Radio Technology which is an opportunistic network and is equipped with fully programmable wireless devices that empowers the network by OODA cycle and then make intelligent decisions by adapting their MAC and physical layer characteristics such as waveform, has appeared to be the only solution for current low spectrum availability and under utilization problem. In this paper a novel Dynamic De-Centralized Hybrid “DDH-MAC” protocol for Cognitive Radio Networks has been presented which lies between Global Common Control Channel (GCCC) and non-GCCC categories of cognitive radio MAC protocols. DDH-MAC is equipped with the best features of GCCC MAC protocols but also overcomes the saturation and security issues in GCCC. To the best of authors' knowledge, DDH-MAC is the first protocol which is hybrid between GCCC and non-GCCC family of protocols. DDH-MAC provides multiple levels of security and partially use GCCC to transmit beacon which sets and announces local control channel for exchange of free channel list (FCL) sensed by the co-operatively communicating cognitive radio nodes, subsequently providing secure transactions among participating nodes over the decided local control channel. This paper describes the framework of the DDH-MAC protocol in addition to its pseudo code for implementation; it is shown that the pre-transmission time for DDH-MAC is on average 20% better while compared to other cognitive radio MAC protocols.
2013-03-01
2013-03-01
2011
Conference papers, meetings and proceedings
Shah, M., Safdar, G. and Maple, C. (2011) "DDH-MAC: A novel Dynamic De-Centralized Hybrid MAC protocol for Cognitive Radio Networks," Roedunet International Conference (RoEduNet), 2011 10th , pp.1-6, 23-25 June 2011
9781457712333
10.1109/RoEduNet.2011.5993685
http://hdl.handle.net/10547/270780
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5993685
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2707792024-02-06T10:40:08Zcom_10547_132192col_10547_132230
An analysis on decentralized adaptive MAC protocols for Cognitive Radio networks
Shah, Munam Ali
Zhang, Sijing
Maple, Carsten
University of Bedfordshire
cognitive radio
common control channel
co-operative communication
MAC protocols
The scarcity of bandwidth in the radio spectrum has become more vital since the demand for more and more wireless applications has increased. Most of the spectrum bands have been allocated although many studies have shown that these bands are significantly underutilized most of the time. The problem of unavailability of spectrum and inefficiency in its utilization has been smartly addressed by the Cognitive Radio (CR) Technology which is an opportunistic network that senses the environment, observes the network changes, and then using knowledge gained from the prior interaction with the network, makes intelligent decisions by dynamically adapting their transmission characteristics. In this paper some of the decentralized adaptive MAC protocols for CR networks have been critically analyzed and a novel adaptive MAC protocol for CR networks, DNG-MAC which is decentralized and non-global in nature, has been proposed. The results show the DNG-MAC out performs other CR MAC protocols in terms of time and energy efficiency.
2013-03-01
2013-03-01
2012
Conference papers, meetings and proceedings
Shah, M., Zhang, S. and Maple, C. (2012) "An analysis on decentralized adaptive MAC protocols for Cognitive Radio networks," Automation and Computing (ICAC), 2012 18th International Conference on , pp.1-5, 7-8 Sept. 2012
9781467317221
10.1007/s11633-013-0695-z
http://hdl.handle.net/10547/270779
en
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6330514
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2707972020-04-23T07:29:27Zcom_10547_132192col_10547_132230
A novel multi-fold security framework for cognitive radio wireless ad-hoc networks
Shah, Munam Ali
Zhang, Sijing
Maple, Carsten
University of Bedfordshire
co-operative communication
cognitive radio
control channel
MAC protocols
security framework
Cognitive Radio (CR) Technology has emerged as a smart and intelligent technology to address the problem of spectrum scarcity and its under-utilization. CR nodes sense the environment for vacant channels, exchange control information, and agree upon free channels list (FCL) to use for data transmission and conclusion. CR technology is heavily dependent on the control channel to dialogue on the exchanged control information which is usually in the Industrial-Scientific-Medical (ISM) band. As the ISM band is publically available this makes the CR network more prone to security vulnerabilities and flaws. In this paper a novel multi-fold security framework for cognitive radio wireless ad-hoc networks has been proposed. Multiple security levels, such as, encryption of beacon frame and privately exchanging the FCL, and the dynamic and adaptive behaviour of the framework makes the proposed protocol more resilient and secure against the traditional security attacks when compared with existing protocols.
2013-03-01
2013-03-01
2012
Conference papers, meetings and proceedings
Shah, M., Zhang, S. Maple, C. (2012) "A novel multi-fold security framework for cognitive radio wireless ad-hoc networks," Automation and Computing (ICAC), 2012 18th International Conference on , pp.1-6, 7-8 Sept. 2012
9781467317221
http://hdl.handle.net/10547/270797
en
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6330515
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2707772020-04-23T07:29:27Zcom_10547_132192col_10547_132230
A Graph theoretical approach to Network Vulnerability Analysis and Countermeasures
Hamid, Thaier K.A.
Maple, Carsten
ranking attack graph
network security
security metrics
Computer networks are certainly vulnerable as long as they deliver services from different machines. An attack graph is a security model representing the chains of vulnerability exploits in a network displays the ways an attacker can compromise a network or host. A number of researchers have admitted attack graph visual complications and a large amount of source data must be assembled to accurately build an attack graph, the difficulty scaling to large, enterprise-size networks with tens of thousands of hosts and the lack comprehensive understanding. Information on vulnerabilities is present in public vulnerability databases, such as the National Vulnerability Database and Nessus. But current attack graph tools are reserved to only limited attributes. The automatic formation of vulnerability information has been troublesome and vulnerability descriptions were created by hand or based on limited information. Much vulnerability has still not been discov-ered and many others without patches or solutions Our approach to developing a cost metric exploits the Markov’s model using combinations well known vulnerabilities (the Common Vulnerability Scoring System, CVSS) and Risk Assessment Values (RAV) and using ranking algorithms (similar to V. Mehta et al. 2006 and kijsanayothin, 2010) but instead of using vulnerabilities. For each host we have developed a cost rank Markov’s model reducing the complexity in the attack graph, representing the network topology and dipping the problem of visibility.
2013-03-01
2013-03-01
2011
Article
Hamid, T. and Maple, C. (2011) 'A Graph theoretical approach to Network Vulnerability Analysis and Countermeasures', International Journal of Computer Applications, 1, pp.13-18
10.5120/4320-007
http://hdl.handle.net/10547/270777
IJCA Special Issue on Network Security and Cryptography NSC
en
http://www.ijcaonline.org/specialissues/nsc/number1/4320-spe007t
Foundation of Computer Science, New York, USA
oai:uobrep.openrepository.com:10547/2707762024-02-06T10:46:09Zcom_10547_132192col_10547_132230
Towards optimal multi-objective models of network security: survey
Viduto, Valentina
Huang, Wei
Maple, Carsten
University of Bedfordshire
multi-objective models
network security optimisation
risk assessment
survey
visualisation techniques
Information security is an important aspect of a successful business today. However, financial difficulties and budget cuts create a problem of selecting appropriate security measures and keeping networked systems up and running. Economic models proposed in the literature do not address the challenging problem of security countermeasure selection. We have made a classification of security models, which can be used to harden a system in a cost effective manner based on the methodologies used. In addition, we have specified the challenges of the simplified risk assessment approaches used in the economic models and have made recommendations how the challenges can be addressed in order to support decision makers.
2013-03-01
2013-03-01
2011
Conference papers, meetings and proceedings
Viduto, V., Wei Huang and Maple, C. (2011) "Toward optimal multi-objective models of network security: Survey," Automation and Computing (ICAC), 2011 17th International Conference on , pp.6-11, 10-10 Sept. 2011
9781467300001
http://hdl.handle.net/10547/270776
en
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6084892&tag=1
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2707932020-04-23T07:29:36Zcom_10547_132192col_10547_132230
Enhancing usability and security in click-based visual password systems
al-Khateeb, Haider
Maple, Carsten
Conrad, Marc
University of Bedfordshire
click-based systems
HybridPass
visual passwords
cued recall
usable security
authentication
computer security
Security and usability are key elements in system design. A bad design might result in unnecessary inverse proportion between the two, while a good design must find a balance to achieve usable security. In this paper we present and discuss the results of a user study to show how good application of click-based systems can produce a system people can easily use while maintaining security. In this study, participants were asked to do trials using 5 different prototypes of the system. A comparison between them helped to find the best criteria where there is an acceptable balance between security and usability. For instance, using a relatively small tolerance distance enhances security by increasing the password space, the comparison helps to find how small the distance can be while maintaining usability. Another objective of this study was to distinguish between two types of images; the results revealed that using cartoon images have positive impact on usability. Nevertheless, hotspots occurred and that makes particular images more vulnerable to dictionary attacks. Experiments also show that, if they can chose, users select images more vulnerable to hotspots.
2013-03-01
2013-03-01
2010
Conference papers, meetings and proceedings
Al-khateeb,H., Maple,C. and Conrad,M. (2010) Enhancing Usability and Security in Click-Based Visual Password Systems”, IADIS e-Society 2010 (ES 2010),pp.371-376, Porto, Portugal.
9789728939076
http://hdl.handle.net/10547/270793
en
http://www.iadis.net/dl/Search_list_open.asp?code=6912
IADIS
oai:uobrep.openrepository.com:10547/2707742020-04-23T07:29:27Zcom_10547_132192col_10547_132230
A high-level semiotic trust agent scoring model for collaborative virtual organisations
French, Timothy Stewart
Bessis, Nik
Maple, Carsten
risk management
security of data
virtual enterprises
data security
In this paper, we describe how a semiotic ladder, together with a supportive trust agent, can be used to address “soft” trust issues in the context of collaborative Virtual Organisations (VO). The intention is to offer all parties better support for trust (as reputation) management including the reduction of risk and improved reliability of VO e-services. The semiotic ladder is intended to support the VO e-service lifecycle through the articulation of e-trust at various levels of system abstraction, including trust as measurable confidence. At the social level, reputation and reliability measures of e-trust are the relevant dimensions as regards choice of VO partner and are also relevant to the negotiation of service level agreements between the VO partners. By contrast, at the lower levels of the trust ladder, e-trust measures typically address the degree to which secure sign on and message level security conforms to various tangible technological security protocols. The novel trust agent provides the e-service consumer with an objective measure of the trustworthiness of the e-service at run-time, just prior to its actual consumption. Specifically, VO e-service consumer confidence level is informed, by leveraging third party objective evidence. This evidence comprises a set of Corporate Governance (CG) scores. These scores are used as a trust proxy for the "real" owner of the VO. There are also inherent limitations associated with the use of CG scores. These are duly acknowledged.
2013-03-01
2013-03-01
2010
Conference papers, meetings and proceedings
French, T., Bessis, N. and Maple, C. (2010) “A High-level Trust Agent Scoring System for Collaborative Virtual Organisations”, In Proceedings: International Workshop on Advances in Mobile Computing and Applications: Security, Privacy and Trust (AMCA), in conjunction with the IEEE 24th International Conference on Advanced Information Networking and Application (AINA 2010), 20th-23rd April 2010, Perth, pp.: 1114-1120.
150-445X
10.1109/WAINA.2010.173
http://hdl.handle.net/10547/270774
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5480988
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2706932020-04-23T07:37:20Zcom_10547_132192col_10547_132230
Accessible and secure? design constraints on image and sound based passwords
Gibson, Marcia
Conrad, Marc
Maple, Carsten
Renaud, Karen
University of Bedfordshire
authentication
media
psychology
synchronization
usability
visualization
visual passwords
sound based passwords
When members of society cannot access the World Wide Web, or the information and services it contains in a meaningful or useful way, they can become digitally excluded. Many factors have been highlighted as having an effect on the likelihood of exclusion, including psychological, material and skills related barriers. In this paper, we consider the role played by authentication systems in the divide. In light of the widely researched tension between aspects of usability and security in authentication, we identify a number of conflicting accessibility and security goals as manifested in image and sound based schemes.
2013-02-28
2013-02-28
2010
Conference papers, meetings and proceedings
Gibson, M., Conrad, M., Maple, C. and Renaud, K. (2010) "Accessible and secure? Design constraints on image and sound based passwords," Information Society (i-Society), 2010 International Conference on , pp.423-428, 28-30 June 2010
9780956426338
http://hdl.handle.net/10547/270693
en
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6018741&tag=1
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2706602024-02-06T10:45:48Zcom_10547_132192col_10547_132230
Towards decentralized grid agent models for continuous resource discovery of interoperable grid Virtual Organisations
Sotiriadis, Stelios
Bessis, Nik
Huang, Ye
Sant, Paul
Maple, Carsten
University of Bedfordshire
grid
mMobile agents
self-led critical friends
Grid technology enables resource sharing among a massive number of dynamic and geographically distributed resources. The significance of such environments is based on the aptitude of grid members to look across multiple grids for resource discovery and allocation. Parallel to grid, agents are autonomous problem solvers capable of self-directed actions in flexible environments. As grid systems require self-sufficiency, agents may be the means by which to achieve a robust autonomy infrastructure. In this direction we propose a resource discovery method of interoperable grid agents which travel within Virtual Organizations (VOs) and by capturing resource information regarding their action domain; they update the internal data of each grid member. Moreover we propose that resource discovery is a systematic and continually updating process that occurs within a VO and allows information exchange to happen. This exchange takes place between various community members at a pre-defined interval, aiming to distribute internal knowledge about the domain.
2013-02-28
2013-02-28
2010
Conference papers, meetings and proceedings
Sotiriadis, S., Bessis, N., Ye Huang, Sant, P. and Maple, C. (2010) "Towards decentralized grid agent models for continuous resource discovery of interoperable grid Virtual Organisations," Digital Information Management (ICDIM), 2010 Fifth International Conference on , pp.530-535, 5-8 July 2010
978-1-4244-7572-8
10.1109/ICDIM.2010.5664653
http://hdl.handle.net/10547/270660
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5664653
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2707732024-02-06T10:41:07Zcom_10547_132192col_10547_132230
Defining minimum requirements of inter-collaborated nodes by measuring the weight of node interactions
Sotiriadis, Stelios
Bessis, Nik
Huang, Ye
Sant, Paul
Maple, Carsten
University of Bedfordshire
graph theory
grid technology
metadata snapshot profile
self-led critical friends
In this paper we are focusing on the minimum requirements to be addressed in order to demonstrate a inter-node communication within a Virtual Organisation (VO) using the method of Self-led Critical Friends (SCF). The method is able to decide paths that a node can choose in order to locate neighbouring nodes by aiming at realizing the overhead of each communication. The weight of each path will be measured by the analysis of prerequisites in order to achieve the interaction between nodes. We define requirements as the least fundamentals that a node needs to achieve in order to determine its accessibility factor. The information gathered from an interaction is then stored in a snapshot, a profile that is made available during the discovery stage.
2013-03-01
2013-03-01
2010
Conference papers, meetings and proceedings
Sotiriadis, S., Bessis, N., Ye Huang, Sant, P. and Maple, C. (2010) "Defining Minimum Requirements of Inter-collaborated Nodes by Measuring the Weight of Node Interactions," Complex, Intelligent and Software Intensive Systems (CISIS), 2010 International Conference on , pp.291-298, 15-18 Feb. 2010
9781424459179
10.1109/CISIS.2010.84
http://hdl.handle.net/10547/270773
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5447439
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2706422024-02-06T10:42:22Zcom_10547_132192col_10547_132230
From grids to clouds: a collective intelligence study for inter-cooperated infrastructures
Sotiriadis, Stelios
Bessis, Nik
Sant, Paul
Maple, Carsten
University of Bedfordshire
Recently, more effort has been put into developing interoperable and distributed environments that offer users exceptional opportunities for utilizing resources over the internet. By utilising grids and clouds, resource consumers and providers, they gain significant benefits by either using or purchasing the computer processing capacities and the information provided by data centres. On the other hand, the collective intelligence paradigm is characterized as group based intelligence that emerges from the collaboration of many individuals, who in turn, define a coordinated knowledge model. It is envisaged that such a knowledge model could be of significant advantage if it is incorporated within the grid and cloud community. The dynamic load and access balancing of the grid and cloud data centres and the collective intelligence provides multiple opportunities, involving resource provisioning and development of scalable and heterogeneous applications. The contribution of this paper is that by utilizing grid and cloud resources, internal information stored within a public profile of each participant, resource providers as well as consumers, can lead to an effective mobilization of improved skills of members. We aim to unify the grid and cloud functionality as consumable computational power, for a) discussing the supreme advantages of such on-line resource utilization and provisioning models and b) analyzing the impact of the collective intelligence in the future trends of the aforementioned technologies.
2013-02-28
2013-02-28
2010
Conference papers, meetings and proceedings
Sotiriadis,S., Bessis, N., Sant, P. and Maple, C. (2010) “From Grids to Clouds: A collective intelligence study for inter-cooperated infrastructures”, The Fourth International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP-2010), IARIA, 25 – 30 October 2010, Florence, Italy, p.p.: 142-147
9781612081014
http://hdl.handle.net/10547/270642
en
http://www.iaria.org/conferences2010/ADVCOMP10.html
IARIA
oai:uobrep.openrepository.com:10547/2706532024-02-06T10:44:16Zcom_10547_132192col_10547_132230
A mobile agent strategy for grid interoperable virtual organisations
Sotiriadis, Stelios
Bessis, Nik
Sant, Paul
Maple, Carsten
University of Bedfordshire
2013-02-28
2013-02-28
2010
Conference papers, meetings and proceedings
Sotiriadis,S., Bessis, N., Sant, P. and Maple, C. (2010) “A Mobile Agent Strategy for Grid Interoperable Virtual Organisations”, 1st International Conference on Collaborative Technologies (ICCT-2010), IADIS, 26th – 28thJuly, Freiburg, pp.: 168-172.
9789728939212
http://hdl.handle.net/10547/270653
en
http://www.iadisportal.org/ct-2010-proceedings
IADIS
oai:uobrep.openrepository.com:10547/2706382020-04-23T07:29:36Zcom_10547_132192col_10547_132230
A visualisation technique for the identification of security threats in networked systems
Maple, Carsten
Viduto, Valentina
This paper is primarily focused on the increased IT complexity problem and the identification of security threats in networked systems. Modern networking systems, applications and services are found to be more complex in terms of integration and distribution, therefore, harder to be managed and protected. CIOs have to put their effort on threat's identification, risk management and security evaluation processes. Objective decision making requires measuring, identifying and evaluating all enterprise events, either positive (opportunities) or negative (risks) and keeping them in perspective with the business objectives. Our approach is based on a visualisation technique that helps in decision making process, focusing on the threat identification using attack scenarios. For constructing attack scenarios we use the notion of attack graphs, as well as layered security approach. The proposed onion skin model combines attack graphs and security layers to illustrate possible threats and shortest paths to the attacker's goal. By providing few examples we justify the advantage of the threat identification technique in decision making process.
2013-02-28
2013-02-28
2010
Conference papers, meetings and proceedings
Viduto, V., Maple, C. (2010) “A visualisation technique for the identification of security threats in networked systems”, In 14th International Conference on Information Visualisation, IV 2010, 26-29 July, London, UK, IEEE Computer Society, 2010,pp. 551-556.
9780769541655
10.1109/IV.2010.81
http://hdl.handle.net/10547/270638
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5571147
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2706042018-06-19T10:29:54Zcom_10547_132192col_10547_132230
A novel strategy for optimal security investments
Viduto, Valentina
Huang, Wei
Maple, Carsten
University of Bedfordshire
2013-02-27
2013-02-27
2010
Conference papers, meetings and proceedings
Viduto, V., Huang, W., and Maple, C. (2010) “A novel strategy for optimal security investments”. In Proceedings of the 16th International Conference on Automation and Computing, Birmingham, UK, September 2010.
http://hdl.handle.net/10547/270604
en
oai:uobrep.openrepository.com:10547/2705762020-04-23T07:29:36Zcom_10547_132192col_10547_132230
Hybrid pass: authentication mechanism for web applications – both secure and user-friendly
al-Khateeb, Haider
Maple, Carsten
Conrad, Marc
University of Bedfordshire
secure login
authentication
visual password
user-friendly
usable security
A variety of visual passwords approaches were proposed that aim to replace conventional text passwords. The main advantage of both systems is that unlike biometrics and tokens they do not require special hardware. However they still fail to provide a satisfying solution to the usability problems of today’s authentication systems. Both text and visual passwords have limitations. We show how those limitations can be minimized by combining the two systems together to provide an integrated login mechanism suitable for web applications. The design is user friendly and makes use of the human factor to enhance security and usability. Due to the hybrid nature of our approach, it includes an anti-phishing technique.
2013-02-27
2013-02-27
2009
Conference papers, meetings and proceedings
Al-Khateeb, H., Maple, C., Conrad, M., (2009) "Hybrid Pass: Authentication Mechanism for Web Applications – Both Secure and User-Friendly"; In IADIS International Conference e-Society 2009, 1, pp.332-338, Barcelona, Spain
9789728924782
http://hdl.handle.net/10547/270576
en
http://www.iadis.net/dl/Search_list_open.asp?code=5667
IADIS
oai:uobrep.openrepository.com:10547/2706032020-04-23T07:37:20Zcom_10547_132192col_10547_132230
Musipass: authenticating me softly with "my" song
Gibson, Marcia
Renaud, Karen
Conrad, Marc
Maple, Carsten
sound based passwords
The modern world increasingly requires us to prove our identity. When this has to be done remotely, as is the case when people make use of web sites, the most popular technique is the password. Unfortunately the profusion of web sites and the associated passwords reduces their efficacy and puts severe strain on users' limited cognitive resources. There is clearly a need for some creativity in terms of providing viable alternatives to passwords. This paper reports experiences of the use of a musical password, one composed of melodies instead of alphanumerics. Music is universal all over the globe and humans have superior memory for music. We report here on the evaluation of a prototype of such a musical password system, which demonstrates superior memorability.
2013-02-27
2013-02-27
2009
Conference papers, meetings and proceedings
Gibson, M., Renaud, K., Conrad, M., Maple, C. (2009) “Musipass: Authenticating me softly with ‘my’ song”, New Security Paradigms Workshop (NSPW'09),pp. 85-100, The Queens College, University of Oxford, UK
9781605588452
10.1145/1719030.1719043
http://hdl.handle.net/10547/270603
en
http://portal.acm.org/citation.cfm?doid=1719030.1719043
ACM
oai:uobrep.openrepository.com:10547/2707942020-04-23T07:36:21Zcom_10547_132192col_10547_132230
Design of software defined down-conversion and up-conversion: an overview
Zhang, Yue
Huang, Li-Ke
Maple, Carsten
Xuan, Qing
SDR down-conversion
up-conversion
direct-conversion
super-heterodyne conversion
In recent years, much attention has been paid to software-defined radio (SDR) technologies for multimode wireless systems. SDR can be defined as a radio communication system that uses software to modulate and demodulate radio signals. This article describes concepts, theory, and design principles for SDR down-conversion and up-conversion. Design issues in SDR down-conversion are discussed, and two different architectures, super-heterodyne and direct-conversion, are proposed. Design issues in SDR up-conversion are also discussed, and trade-offs in the design of filters, mixers, NCO, DAC, and signal processing are highlighted.
2013-03-01
2013-03-01
2011-12
Article
Zhang,Y., Huang,L.-K., Maple,C. and Xuan, Q. (2011) 'Design of Software-Defined Down-Conversion and Up-Conversion: An Overview', ZTE Communications 9(4):10-14,
1673-5188
http://hdl.handle.net/10547/270794
ZTE Communications
en
http://wwwen.zte.com.cn/endata/magazine/ztecommunications/2011Year/no4/articles/201202/t20120202_283025.html
ZTE corporation, China
oai:uobrep.openrepository.com:10547/2706512024-02-06T10:41:46Zcom_10547_132192col_10547_132230
Encoding minimum requirements of ad hoc inter-connected grids to a genetic algorithm infrastructure
Sotiriadis, Stelios
Bessis, Nik
Sant, Paul
Maple, Carsten
University of Bedfordshire
2013-02-28
2013-02-28
2010
Conference papers, meetings and proceedings
Sotiriadis,S., Bessis, N., Sant, P. and Maple, C. (2010) “Encoding minimum requirements of ad hoc inter-connected grids to a genetic algorithm infrastructure”, 1st International Conference on Collaborative Technologies (ICCT-2010), IADIS, 26th – 28th July, Freiburg, p.p.: 142-149.
9789728939212
http://hdl.handle.net/10547/270651
en
http://www.iadisportal.org/ct-2010-proceedings
IADIS
oai:uobrep.openrepository.com:10547/2706412024-02-06T10:45:24Zcom_10547_132192col_10547_132230
A resource discovery architecture of loosely coupled grid inter-cooperated virtual organisations using mobile agents and neural networks
Sotiriadis, Stelios
Bessis, Nik
Sant, Paul
Maple, Carsten
University of Bedfordshire
grid
metadata snapshot profile
mobile agents
self organizing maps
self-led critical friends
Grid computing offers a service for sharing resources over uncertain and complex environments. In such multi-participated settings it is essential to make the grid middleware functionality transparent to members by providing the ability to act autonomous and learning from the environment. Parallel to grid, artificial neural networks is a paradigm for processing information, which is inspired by the processes of biological nervous systems. The latter fields can be really promoted from the artificial intelligent agents, which offer an autonomous acting infrastructure of members with proactive and reactive aptitude. As grid is about sharing and allocating resources within uncertain domains, intelligent agents and neural networks may be the mean of achieving an autonomous learning environment of self-motivated members. In this study, we focus on the mobility agents' model aiming to discovery resources dynamically, parallel to the artificial neural networks as a way to achieve the best resource discovery paths. Our work is fundamentally based on the Self-led Critical Friends method, a technique for realizing inter-cooperation among various scales Virtual Organisations (VOs). Their mediator acting nature redirects communication to other parties of different VOs by utilizing a public profile of data stored within VO members.
2013-02-28
2013-02-28
2010
Conference papers, meetings and proceedings
Sotiriadis, S., Bessis, N., Sant, P. and Maple, C.(2010) "A Resource Discovery Architecture of Loosely Coupled Grid Inter-cooperated Virtual Organisations Using Mobile Agents and Neural Networks," P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), 2010 International Conference on , pp.320-325, 4-6 Nov. 2010
978-0-7695-4237-9
10.1109/3PGCIC.2010.53
http://hdl.handle.net/10547/270641
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5662769
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2705772020-04-23T07:29:36Zcom_10547_132192col_10547_132230
An analytical evaluation of network security modelling techniques applied to manage threats
Viduto, Valentina
Maple, Carsten
Huang, Wei
attack graph
attack tree
network hardening
threats
computer security
The current ubiquity of information coupled with the reliance on such data by businesses has led to a great deal of resources being deployed to ensure the security of this information. Threats can come from a number of sources and the dangers from those insiders closest to the source have increased significantly recently. This paper focuses on techniques used to identify and manage threats as well as the measures that every organisation should consider to put into action. A novel game-based onion skin model has been proposed, combining techniques used in theory-based and hardware-based hardening strategies.
2013-02-27
2013-02-27
2010
Conference papers, meetings and proceedings
Viduto, V.; Maple, C.; Huang, W.; (2010) "An Analytical Evaluation of Network Security Modelling Techniques Applied to Manage Threats," Broadband, Wireless Computing, Communication and Applications (BWCCA), 2010 International Conference on , pp.117-123, 4-6 Nov. 2010
9780769542362
10.1109/BWCCA.2010.58
http://hdl.handle.net/10547/270577
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5633801
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2706012018-07-16T13:06:32Zcom_10547_132192col_10547_132230
A dynamically adaptive dimensionalised experience feedback mechanism within Second Life
Shukla, Mitul
Bessis, Nik
Conrad, Marc
Maple, Carsten
University of Bedfordshire
2013-02-27
2013-02-27
2009
Conference papers, meetings and proceedings
Shukla, M., Bessis, N., Conrad, M., Maple, C. (2009) A Dynamically Adaptive Dimensionalised Experience Feedback Mechanism within Second Life, in Proceedings of the International Conference Applied Computing 2009, IADIS, 19th-21st November, Rome
9789728924973
http://hdl.handle.net/10547/270601
en
http://www.iadisportal.org/applied-computing-2009-proceedings
IADIS
oai:uobrep.openrepository.com:10547/2706002020-04-23T07:29:27Zcom_10547_132192col_10547_132230
Active robot learning for building up high-order beliefs
Li, Dayou
Liu, Beisheng
Maple, Carsten
Jiang, Daming
Yue, Yong
active learning
cognitive robotics
fuzzy logic
High-order beliefs of service robots regard the robots' thought about their users' intention and preference. The existing approaches to the development of such beliefs through machine learning rely on particular social cues or specifically defined award functions. Their applications can, therefore, be limited. This paper presents an active robot learning approach to facilitate the robots to develop the beliefs by actively collecting/discovering evidence they need. The emphasis is on active learning. Hence social cues and award functions are not necessary. Simulations show that the presented approach successfully enabled a robot to discover evidences it needs.
2013-02-27
2013-02-27
2008
Conference papers, meetings and proceedings
Dayou Li; Beisheng Liu; Maple, C.; Daming Jiang; Yong Yue; (2008) Active Robot Learning for Building Up High-Order Beliefs, Fuzzy Systems and Knowledge Discovery, FSKD '08, Fifth International Conference on , vol.3, pp.201-205
9780769533056
10.1109/FSKD.2008.186
http://hdl.handle.net/10547/270600
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4666240
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2705952020-04-23T07:29:28Zcom_10547_132192col_10547_132230
Reliability, availability and security of wireless networks in the community
Maple, Carsten
Williams, Geraint
Yue, Yong
security
WEP
WLAN
WPA
risk assessment
risk management
threat analysis
computer security
wireless networks
Wireless networking increases the flexibility in the home, work place and community to connect to the Internet without being tied to a single location. Wireless networking has rapidly increased in popularity over recent years. There has also been a change in the use of the internet by users. Home users have embraced wireless technology and businesses see it as having a great impact on their operational efficiency. Both home users and industry are sending increasingly sensitive information through these wireless networks as online delivery of banking, commercial and governmental services becomes more widespread. However undeniable the benefits of wireless networking are, there are additional risks that do not exist in wired networks. It is imperative that adequate assessment and management of risk is undertaken by businesses and home users. This paper reviews wireless network protocols, investigates issues of reliability, availability and security when using wireless networks. The paper, by use of a case study, illustrates the issues and importance of implementing secured wireless networks, and shows the significance of the issue. The paper presents a discussion of the case study and a set of recommendations to mitigate the threat.
2013-02-27
2013-02-27
2007
Article
Maple, C., Williams, G., Yue, Y. (2007) Reliability, Availability and Security of Wireless Networks in the Community,31 (2):201-208 Informatica
0350-5596
http://hdl.handle.net/10547/270595
Informatica
en
http://www.informatica.si/vol31.htm#No2
he Slovene Society Informatika, Ljubljana
oai:uobrep.openrepository.com:10547/2705742020-04-23T07:29:28Zcom_10547_132192col_10547_132230
The Bayesian decision tree technique using an adaptive sampling scheme
Schetinin, Vitaly
Krzanowski, Wojtek
Maple, Carsten
Bayesian methods
Decision trees (DTs) provide an attractive classification scheme because clinicians responsible for making reliable decisions can easily interpret them. Bayesian averaging over DTs allows clinicians to evaluate the class posterior distribution and therefore to estimate the risk of making misleading decisions. The use of Markov chain Monte Carlo (MCMC) methodology of stochastic sampling makes the Bayesian DT technique feasible to perform. The Reversible Jump (RJ) extension of MCMC allows sampling from DTs of different sizes. However, the RJ MCMC process may become stuck in a particular DT far away from the region with maximal posterior. This negative effect can be mitigated by averaging the DTs obtained in different starts. In this paper we describe a new approach based on an adaptive sampling scheme. The performances of Bayesian DT techniques with the restarting and adaptive strategies are compared on a synthetic dataset as well as on some medical datasets. By quantitatively evaluating the classification uncertainty, we found that the adaptive strategy is superior to the restarting strategy.
2013-02-27
2013-02-27
2007
Conference papers, meetings and proceedings
Schetinin, V., Krzanowski, W. J., and Maple, C.,(2007) The Bayesian Decision Tree Technique Using an Adaptive Sampling Scheme, The 20th IEEE International Symposium on Computer-Based Medical Systems, CBMS-2007, Maribor, pp. 121-126
1063-7125
10.1109/CBMS.2007.109
http://hdl.handle.net/10547/270574
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4262637
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2706022015-10-21T23:05:18Zcom_10547_132192col_10547_132230
Employment opportunities for the future
Gleni, Sofia
Petratos, Panagiotis
Maple, Carsten
2013-02-27
2013-02-27
2009
Article
Maple, C., Petratos, P. and Gleni, S. (2009) Employment opportunities for the future,IEEE GOLD Rush, September issue, 16-17
http://hdl.handle.net/10547/270602
IEEE GOLD Rush
en
http://www.ieee.org/membership_services/membership/gold/newsletter_archive.html
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2705982020-04-23T07:29:27Zcom_10547_132192col_10547_132230
Web application development lifecycle for small medium-sized enterprises (SMEs)
Huang, Wei
Li, Ru
Maple, Carsten
Yang, Hongji
Foskett, David
Cleaver, Vince
web design
small to medium-sized enterprises
SMEs
Software engineering has proven to be very important for standard software development. But, can Web applications be engineered as well? Currently, J2EE, Apache/Perl/PDP/MySQL and .NET have been universally accepted as Web application development technology, but there is no universal accepted methodology for Web application development process. Web application needs to be engineered by moving focus from technology to process. In this paper, a novel lifecycle model for Web application development in SMEs has been proposed. It includes two iterative process phases with a pre-iterative sequential process phase. This model has been applied to a real-world project and the result has proved its potential to shape the way on how web applications can be engineered in SMEs.
2013-02-27
2013-02-27
2008
Conference papers, meetings and proceedings
Huang, W.; Ru Li; Maple, C.; Hongji Yang; Foskett, D.; Cleaver, V.; (2009) Web Application Development Lifecycle for Small Medium-Sized Enterprises (SMEs) (Short Paper), Quality Software, QSIC '08. The Eighth International Conference on , pp.247-252
9780769533124
1550-6002
10.1109/QSIC.2008.43
http://hdl.handle.net/10547/270598
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4601551
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2705972020-04-23T07:29:27Zcom_10547_132192col_10547_132230
An evolutionary-based approach to learning multiple decision models from underrepresented data
Schetinin, Vitaly
Li, Dayou
Maple, Carsten
The use of multiple Decision Models (DMs) enables to enhance the accuracy in decisions and at the same time allows users to evaluate the confidence in decision making. In this paper we explore the ability of multiple DMs to learn from a small amount of verified data. This becomes important when data samples are difficult to collect and verify. We propose an evolutionary-based approach to solving this problem. The proposed technique is examined on a few clinical problems presented by a small amount of data.
2013-02-27
2013-02-27
2008
Conference papers, meetings and proceedings
Schetinin, V., Li, D., Maple, C. (2008) An Evolutionary-Based Approach to Learning Multiple Decision Models from Underrepresented Data, The 4th International Conference on Natural Computation (ICNC'08), 1, pp.40-44
9780769533049
10.1109/ICNC.2008.409
http://hdl.handle.net/10547/270597
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4666807
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2705752020-04-23T07:29:27Zcom_10547_132192col_10547_132230
Synchronous bandwidth allocation for real-time communications with the timed-token MAC protocol
Han, Ching-Chih
Shin, K.G.
Hou, Chao-Ju
One of the key issues in tailoring the timed-token MAC protocol for real-time applications is synchronous bandwidth allocation (SBA), whose objective is to meet both the protocol and deadline constraints. The former constraint requires that the total time allocated to all nodes for transmitting synchronous messages should not exceed the target token rotation time. The latter constraint requires that the minimum time available for a node to transmit its synchronous messages before their deadlines should be no less than the maximum message transmission time. Several nonoptimal local SEA schemes and an optimal global SBA scheme have been proposed. Local SBA schemes use only information available locally to each node and are thus preferred to global schemes because of their lower network-management overhead. If optimal local SBA schemes, if any, can be devised, they will be superior to their global counterparts both in performance and in ease of network management. In this paper, we formally prove that there does not exist any optimal local SBA scheme. We also propose an optimal global SBA scheme which has an O(nM) polynomial-time worst-case complexity, where n is the number of synchronous message streams in the system and M is the time complexity for solving a linear programming problem with 3n constraints and n variables
2013-02-27
2013-02-27
2008
Article
Han, C., Shin, K.G. and Hou, C. (2001) Synchronous bandwidth allocation for real-time communications with the timed-token MAC protocol 2001, 50 (5):414-431 IEEE Transactions on Computers
00189340
10.1109/12.926157
http://hdl.handle.net/10547/270575
IEEE Transactions on Computers
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=926157
Archived with thanks to IEEE Transactions on Computers
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2705942020-04-23T07:29:28Zcom_10547_132192col_10547_132230
A Bayesian model averaging methodology for detecting EEG artifacts
Schetinin, Vitaly
Maple, Carsten
artifact detection
electroencephalogram
machine learning
uncertainty estimation
In this paper we describe a Bayesian Model Averaging (BMA) methodology developed for detecting artifacts in electroencephalograms (EEGs). The EEGs can be heavily corrupted by cardiac, eye movement, muscle and noise artifacts, so that EEG experts need to automatically detect them with a given level of confidence. In theory, the BMA methodology allows experts to evaluate the confidence in decision making most accurately. However, the non- stationary nature of EEGs makes the use of this methodology difficult. In our experiments with the sleep EEGs, the proposed BMA technique is shown to provide a better performance in terms of predictive accuracy.
2013-02-27
2013-02-27
2007
Conference papers, meetings and proceedings
Schetinin, V.; Maple, C.; (2007) A Bayesian Model Averaging Methodology for Detecting EEG Artifacts, Digital Signal Processing, 15th International Conference on , pp.499-502
1424408822
10.1109/ICDSP.2007.4288628
http://hdl.handle.net/10547/270594
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4288628
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2706372020-04-23T07:36:18Zcom_10547_132192col_10547_132230
Enriching the object-oriented paradigm via shadows in the context of mathematics
Conrad, Marc
French, Tim
Huchard, Marianne
Maple, Carsten
Pott, Sandra
object oriented programming
shadows
It is well-known that few object-oriented programming languages allow objects to change their nature at run-time. In this paper we discuss the need for object-oriented programming languages to reflect the dynamic nature of problems, particularly those arising in a mathematical context. It is from this context that we present a framework, together with a Java-like implementation of that framework, that realistically represents the dynamic and evolving characteristic of problems and algorithms.
2013-02-28
2013-02-28
2006
Article
Conrad, M., French, T., Huchard, M., Maple, C., and Pott, S. (2006) Enriching the Object-Oriented Paradigm via Shadows in the Context of Mathematics, 5(6): 107-126 Journal of Object Technology
1660-1769
http://hdl.handle.net/10547/270637
Journal of Object Technology
en
http://hal-lirmm.ccsd.cnrs.fr/lirmm-00120306/en/
http://www.jot.fm/issues/issue_2006_07/article4/
ETH Zurich, Chair of Software Engineering
oai:uobrep.openrepository.com:10547/2706452020-04-23T07:29:28Zcom_10547_132192col_10547_132230
An integrated approach to web application development
Pollonais, Sean
Maple, Carsten
web security
software development
security design
Software systems are prone to attack regardless of their deployment environment. Securing the applications that are part of these systems should be a first consideration of the architects. This paper discusses the dangers and costs of treating security as a post-deployment notion and proposes an integrated methodology that stresses the importance of designing in the security features of an application and of writing code that passes tests designed to ensure correct and focused functionality. This amalgamated methodology is meant to produce applications that minimal and secure across all trust boundaries.
2013-02-28
2013-02-28
2006
Conference papers, meetings and proceedings
Maple, C., and Pollonais, S. (2006) 'An Integrated Approach to Web Application Development', in IADIS International Conference e-Society 2006, 13-16 July, Dublin, Ireland
972892416X
http://hdl.handle.net/10547/270645
en
http://www.iadis.net/dl/Search_list_open.asp?code=2802
IADIS
oai:uobrep.openrepository.com:10547/2706432020-04-23T07:36:18Zcom_10547_132192col_10547_132230
A lightweight model of trust propagation in a multi-client network environment: to what extent does experience matter?
Conrad, Marc
French, Tim
Huang, Wei
Maple, Carsten
experimentation
multi-client systems
security
The increasing growth in the application of global computing and pervasive systems has necessitated careful consideration of security issues. In particular, there has been a growth in the use of electronic communities, in which there exist many relationships between different entities. Such relationships require establishing trust between entities and a great deal of effort has been expended in developing accurate and reliable models of trust in such multi-client environments. Many of these models are complex and not necessarily guaranteed to give accurate trust predictions. In this paper we present a review of some of these models before proposing a simple, lightweight model for trust. The proposed model does not require the estimation of a large parameter set, nor make great assumptions about the parameters that affect trust.
2013-02-28
2013-02-28
2006
Conference papers, meetings and proceedings
Conrad, M.; French, T.; Huang, W.; Maple, C.; (2006) A lightweight model of trust propagation in a multi-client network environment: to what extent does experience matter?, Availability, Reliability and Security, ARES 2006, The First International Conference on , pp. 6
0769525679
10.1109/ARES.2006.8
http://hdl.handle.net/10547/270643
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1625346
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2706442020-04-23T07:29:28Zcom_10547_132192col_10547_132230
A networked multi-player game to facilitate pupil to pupil contact within the context of a school twinning scheme
Manton, Rob
Maple, Carsten
collaborative virtual environment
There has been a large amount of interest in the potential of computer games in education. While there has been much done on experimental prototypes, there is lit tle work on the application of games to facilitate contact between students in remote schools. Likewise there is little work on the particular constraints caused by the highly controlled school IT environment which make commercial multip layer games unworkable in this context. This paper addresses the nature of these constraints and proposes a prototype solution which will work within that environment.
2013-02-28
2013-02-28
2006
Conference papers, meetings and proceedings
Manton, R., and Maple, C. (2006) 'A Networked Multi-player Game to Facilitate Pupil to Pupil Contact within the Context of a School Twinning Scheme', in IADIS International Conference e-Society 2006, 13-16 July, Dublin, Ireland
972-8924-16-X
http://hdl.handle.net/10547/270644
en
http://www.iadis.net/dl/final_uploads/200604S081.pdf
IADIS
oai:uobrep.openrepository.com:10547/2707982020-04-23T07:29:28Zcom_10547_132192col_10547_132230
Can intelligent optimisation techniques improve computing job scheduling in a Grid environment? review, problem and proposal
Huang, Wei
French, Tim
Maple, Carsten
Bessis, Nik
intelligent optimisation
Grid scheduling
In the existing Grid scheduling literature, the reported methods and strategies are mostly related to high-level schedulers such as global schedulers, external schedulers, data schedulers, and cluster schedulers. Although a number of these have previously considered job scheduling, thus far only relatively simple queue-based policies such as First In First Out (FIFO) have been considered for local job scheduling within Grid contexts. Our initial research shows that it is worth investigating the potential impact on the performance of the Grid when intelligent optimisation techniques are applied to local scheduling policies. The research problem is defined, and a basic research methodology with a detailed roadmap is presented. This paper forms a proposal with the intention of exchanging ideas and seeking potential collaborators.
2013-03-01
2013-03-01
2006
Conference papers, meetings and proceedings
Maple, C., Huang, W., French, T., and Bessis, N. (2006) 'Can intelligent optimisation techniques improve computing job scheduling in a Grid environment? Review, problem and proposal.' Proceedings of the UK e-Science all hand meeting, pp. 328-331
0955398800
http://hdl.handle.net/10547/270798
en
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.3273
http://www.allhands.org.uk/2006/proceedings/
NeSC
oai:uobrep.openrepository.com:10547/2709142020-04-23T07:35:30Zcom_10547_132192col_10547_132230
The usability and practicality of biometric authentication in the workplace
Maple, Carsten
Norrington, Peter
authentication
biometrics
computer security
This paper discusses usability and practicality issues for authentication systems based on biometrics. The effectiveness of a system incorporating an authentication method depends not only on theoretical and technological issues, but also on user interaction with and practical implementation of the system by an organisation. It is becoming increasingly common that IT and physical security are converging, especially in the workplace. This has significant ramifications for the workforce and operational matters. In this paper we pay particular attention to the potential issues that arise when companies introduce biometrics for IT or physical security and provide recommendations that help ensure a usable and practical implementation of the technology.
2013-03-04
2013-03-04
2006
Conference papers, meetings and proceedings
Maple, C., and Norrington, P. (2006) “The Usability and Practicality of Biometric Authentication in the Workplace”, in First International Conference on Availability, Reliability and Security (ARES06), Vienna University of Technology, pp. 958-964.
0769525679
10.1109/ARES.2006.133
http://hdl.handle.net/10547/270914
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1625410
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2708952020-04-23T07:29:29Zcom_10547_132192col_10547_132230
A graph theoretic framework for trust - from local to global
Sant, Paul
Maple, Carsten
graph theory
trust management
trust
Traditional approaches to trust, be it in agent-based societies, or within a more theoretical framework often consider trust to be a local phenomenon. Here we propose that trust should be viewed from a global perspective. Our motivation is the area of pervasive computing although we believe that our formal framework applies in many domains. Here we present our framework and formalize it in the form of graph theory. We present some open problems and discuss the wider application of our work.
2013-03-04
2013-03-04
2006
Conference papers, meetings and proceedings
Sant, P., and Maple, C. (2006) “A Graph Theoretic Framework for Trust - From Local to Global”, in 10th International Conference on Information Visualisation, London (IV06), UK; pp. 497-503
1550-6037
10.1109/IV.2006.9
http://hdl.handle.net/10547/270895
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1648305
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2707992020-04-23T07:29:28Zcom_10547_132192col_10547_132230
Using a Bayesian averaging model for estimating the reliability of decisions in multimodal biometrics
Maple, Carsten
Schetinin, Vitaly
Bayes procedure
multimodal biometrics
biometrics
The issue of reliable authentication is of increasing importance in modern society. Corporations, businesses and individuals often wish to restrict access to logical or physical resources to those with relevant privileges. A popular method for authentication is the use of biometric data, but the uncertainty that arises due to the lack of uniqueness in biometrics has lead there to be a great deal of effort invested into multimodal biometrics. These multimodal biometric systems can give rise to large, distributed data sets that are used to decide the authenticity of a user. Bayesian model averaging (BMA) methodology has been used to allow experts to evaluate the reliability of decisions made in data mining applications. The use of decision tree (DT) models within the BMA methodology gives experts additional information on how decisions are made. In this paper we discuss how DT models within the BMA methodology can be used for authentication in multimodal biometric systems.
2013-03-01
2013-03-01
2006
Conference papers, meetings and proceedings
Maple, C. and Schetinin, V.; (2006) 'Using a Bayesian averaging model for estimating the reliability of decisions in multimodal biometrics', Availability, Reliability and Security, ARES 2006. The First International Conference on , pp. 7
0769525679
10.1109/ARES.2006.141
http://hdl.handle.net/10547/270799
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1625407
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2708932020-04-23T07:29:28Zcom_10547_132192col_10547_132230
Awareness of wireless security by home and business users
Maple, Carsten
Jacobs, Helen
Reeve, Matthew
WLAN
WEP
security
WPA
wireless networks
computer security
There has been rapid increase in the popularity of wireless networks in both the home and the small office environment. However, with the convenience wireless networking brings there is also an added risk in terms of security. From surveys conducted in a number of countries, it appears there is still lack of awareness of the need for securing wireless networks and the level of security provided by the different wire less encryption protocols. With increasing quantities of e-Government services being available online, such as income tax returns, car registration and health-related services, it is important that the public are aware of the risks of submitting personal information on unsecured or weakly secured networks. This paper highlights the types of wireless encryption protocols available,the cost of using these protocols and provides recommendation for home and business users when us ing e-Government services.
2013-03-04
2013-03-04
2006
Conference papers, meetings and proceedings
Maple, C., Jacobs, H., and Reeve, M.(2006) “Awareness of Wireless Security by Home and Business Users”, in IADIS International Conference e-Society, pp 468-476
972892416X
http://hdl.handle.net/10547/270893
en
http://www.iadis.net/dl/final_uploads/200604F060.pdf
IADIS
oai:uobrep.openrepository.com:10547/2708942020-04-23T07:29:29Zcom_10547_132192col_10547_132230
Choosing the right wireless LAN security protocol for the home and business user
Maple, Carsten
Jacobs, Helen
Reeve, Matthew
TKIP
WEP
WLAN
computer security
wireless networks
The introduction and evolution of security standards for wireless networking has been a problematic process. Flaws in the initial security standard resulted in quick-fix solutions and interoperability issues. As wireless networks are not confined to a building, there is an added security risk that radio signals can be detected externally. Wireless networking has rapidly increased in popularity over the last few years due to the flexibility it provides. Given the simultaneous growth of e-government services there is particular risk to the citizen of identity theft. This article discusses the progression of wireless security protocols since their introduction and the effect this has had on home and business users. The risks of using wireless networks are outlined in the paper and recommendations for securing wireless networks are reviewed.
2013-03-04
2013-03-04
2006
Conference papers, meetings and proceedings
Maple, C., Jacobs, H., and Reeve, M. (2006) “Choosing the Right Wireless LAN Security Protocol for the Home and Business User”, in First International Conference on Availability, Reliability and Security (ARES06), Vienna University of Technology, pp. 1025-1032.
0769525679
10.1109/ARES.2006.42
http://hdl.handle.net/10547/270894
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1625420
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2709152020-04-23T07:35:30Zcom_10547_132192col_10547_132230
Extending e-government to e-society: usability lessons from the UK ID Card Trial
Norrington, Peter
Maple, Carsten
identity cards
biometrics
authentication
The United Kingdom’s Government is embarking on an ambitious project to issue 60 million citizens with a biometric identity card. The card is intended not only to provide identity checking for access to public sector services but also for private sector ones, creating a gold standard identity document for both physical and online authentication. Whilst the many technological, legal and social issues of biometric systems are widely covered, little direct evaluation of usability issues appears in academic literature. We present unique first-hand evidence concerning the usability difficulties of biometric systems, evaluating this and making recommendations on the impact usability should have on the design, implementation and accreditation of biometric identity systems which employ the Identity Card Scheme in the private sector.
2013-03-04
2013-03-04
2006
Conference papers, meetings and proceedings
Norrington, P., and Maple, C. (2006) “Extending e-Government to e-Society: Usability Lessons from the UK ID Card Trial”, in IADIS International Conference e-Society, Dublin, Ireland, pp.296-304
972892416X
http://hdl.handle.net/10547/270915
en
http://www.iadis.net/dl/final_uploads/200604F038.pdf
IADIS
oai:uobrep.openrepository.com:10547/2709162020-04-23T07:29:29Zcom_10547_132192col_10547_132230
Maintaining a random binary search tree dynamically
Vinod, Prasad
Pushpa, Suri
Maple, Carsten
graph theory
Binary tree is a graph, without cycle, that is frequently used in computer science for fast data access and retrieval. To ensure faster insertion and deletion, the tree height has to be kept to a minimum. A random tree starts losing its randomness after a series of insertions and deletions and, in the worst case, a tree with n nodes, could grow up to the height of n - 1. In this paper, we present modified insertion and deletion algorithms to maintain the tree in better shape dynamically. Without applying any complex rebalancing technique, or using considerable amount of space, both algorithms maintain the tree in such a way that even a series of insertions and asymmetric deletions do not cause the tree to grow beyond n/2. A comparative study of traditional and modified insert algorithms shows that for random input, the modified insert algorithm produces a tree with 20% to 30% reduction in height, forcing the average number of comparisons required for a successful search to go down by 15% to 20%.
2013-03-04
2013-03-04
2006
Conference papers, meetings and proceedings
Vinod, P., Pushpa, S., and Maple, C. “Maintaining a Random Binary Search Tree Dynamically”, in 10th International Conference on Information Visualisation, London (IV06), UK; pp. 483-488
1550-6037
10.1109/IV.2006.72
http://hdl.handle.net/10547/270916
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1648303
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2791782020-04-23T08:42:55Zcom_10547_132192col_10547_132230
Supermartingales in prediction with expert advice
Chernov, Alexey
Kalnishkan, Yuri
Zhdanov, Fedor
Vovk, Vladimir
The paper applies the method of defensive forecasting, based on the use of game-theoretic supermartingales, to prediction with expert advice. In the traditional setting of a countable number of experts and a finite number of outcomes, the Defensive Forecasting Algorithm is very close to the well-known Aggregating Algorithm. Not only the performance guarantees but also the predictions are the same for these two methods of fundamentally different nature. The paper also discusses a new setting where the experts can give advice conditional on the learner's future decision. Both the algorithms can be adapted to the new setting and give the same performance guarantees as in the traditional setting. Finally, an application of defensive forecasting to a setting with several loss functions is outlined.
2013-04-07
2013-04-07
2010
Article
Chernov, A., Kalnishkan, Y., Zhdanov, F. and Vovk, V., (2010) 'Supermartingales in prediction with expert advice' 411 (29-30):2647-2669 Theoretical Computer Science
0304-3975
10.1016/j.tcs.2010.04.003
http://hdl.handle.net/10547/279178
Theoretical Computer Science
en
http://linkinghub.elsevier.com/retrieve/pii/S0304397510001982
Archived with thanks to Theoretical Computer Science
Elsevier
oai:uobrep.openrepository.com:10547/2791772020-04-23T07:29:33Zcom_10547_132192col_10547_132230
Prediction with advice of unknown number of experts
Chernov, Alexey
Vovk, Vladimir
In the framework of prediction with expert advice, we consider a recently introduced kind of regret bounds: the bounds that depend on the effective instead of nominal number of experts. In contrast to the NormalHedge bound, which mainly depends on the effective number of experts and also weakly depends on the nominal one, we obtain a bound that does not contain the nominal number of experts at all. We use the defensive forecasting method and introduce an application of defensive forecasting to multivalued supermartingales.
2013-04-07
2013-04-07
2010
Working Paper
Chernov, A. and Vovk, V. (2010) Prediction with Advice of Unknown Number of Experts.
http://hdl.handle.net/10547/279177
en
http://event.cwi.nl/uai2010/papers/UAI2010_0203.pdf
oai:uobrep.openrepository.com:10547/2791792020-04-23T07:29:33Zcom_10547_132192col_10547_132230
Prediction with expert advice under discounted loss
Chernov, Alexey
Zhdanov, Fedor
We study prediction with expert advice in the setting where the losses are accumulated with some discounting and the impact of old losses can gradually vanish. We generalize the Aggregating Algorithm and the Aggregating Algorithm for Regression, propose a new variant of exponentially weighted average algorithm, and prove bounds on the cumulative discounted loss
2013-04-07
2013-04-07
2010
Conference papers, meetings and proceedings
Chernov, A. and Zhdanov. F. (2010) ' Prediction with Expert Advice under Discounted Loss' in Algorithmic Learning Theory, proceeding of the 21st International Conference, ALT 2010, vol. 6331: 255-269
978-3-642-16107-0
0302-9743
10.1007/978-3-642-16108-7_22
http://hdl.handle.net/10547/279179
Algorithmic Learning Theory
en
http://link.springer.com/chapter/10.1007%2F978-3-642-16108-7_22
Springer
oai:uobrep.openrepository.com:10547/2791802020-04-23T07:29:33Zcom_10547_132192col_10547_132230
Prediction with expert evaluators’ advice
Chernov, Alexey
Vovk, Vladimir
We introduce a new protocol for prediction with expert advice in which each expert evaluates the learner’s and his own performance using a loss function that may change over time and may be different from the loss functions used by the other experts. The learner’s goal is to perform better or not much worse than each expert, as evaluated by that expert, for all experts simultaneously. If the loss functions used by the experts are all proper scoring rules and all mixable, we show that the defensive forecasting algorithm enjoys the same performance guarantee as that attainable by the Aggregating Algorithm in the standard setting and known to be optimal. This result is also applied to the case of “specialist” experts. In this case, the defensive forecasting algorithm reduces to a simple modification of the Aggregating Algorithm.
2013-04-07
2013-04-07
2009
Conference papers, meetings and proceedings
Chernov. A. and Vovk, V., (2009) 'Prediction with Expert Evaluators’ Advice' in Algorithmic Learning Theory, proceedings of the 20th International Conference, ALT 2009, vol. 5809: 8-22
9783642044137
10.1007/978-3-642-04414-4_6
http://hdl.handle.net/10547/279180
Algorithmic Learning Theory
en
http://link.springer.com/chapter/10.1007%2F978-3-642-04414-4_6?LI=true
Springer
oai:uobrep.openrepository.com:10547/2791812020-04-23T07:29:33Zcom_10547_132192col_10547_132230
On-line probability, complexity and randomness
Chernov, Alexey
Shen, Alexander
Vereshchagin, Nikolai
Vovk, Vladimir
Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situations where only part of the process is controlled by some probability distribution while for the other part we know only the set of possibilities without any probabilities assigned. We adapt the notions of algorithmic information theory (complexity, algorithmic randomness, martingales, a priori probability) to this framework and show that many classical results are still valid.
2013-04-07
2013-04-07
2008
Conference papers, meetings and proceedings
Chernov, A., Shen, A., Vereshchagin, N. and Vovk , V., (2008) 'On-Line Probability, Complexity and Randomness' in Algorithmic Learning Theory, proceedings on the 19th International Conference, ALT 2008, vol. 5254: 138-153
9783540879862
10.1007/978-3-540-87987-9_15
http://hdl.handle.net/10547/279181
Algorithmic Learning Theory
en
http://link.springer.com/chapter/10.1007/978-3-540-87987-9_15
Springer
oai:uobrep.openrepository.com:10547/2720382020-04-23T07:29:33Zcom_10547_132192col_10547_132230
Parallel MLEM on multicore architectures
Kustner, Tilman
Weidendorfer, Josef
Schirmer, Jasmine
Klug, Tobias
Trinitis, Carsten
Ziegler, Sybille
Technische Universität München
sparse matrix-vector multiplication
maximum likelihood expectation maximization
The efficient use of multicore architectures for sparse matrix-vector multiplication (SpMV) is currently an open challenge. One algorithm which makes use of SpMV is the maximum likelihood expectation maximization (MLEM) algorithm. When using MLEM for positron emission tomography (PET) image reconstruction, one requires a particularly large matrix. We present a new storage scheme for this type of matrix which cuts the memory requirements by half, compared to the widely-used compressed sparse row format. For parallelization we combine the two partitioning techniques recursive bisection and striping. Our results show good load balancing and cache behavior. We also give speedup measurements on various modern multicore systems.
2013-03-13
2013-03-13
2009
Conference papers, meetings and proceedings
Küstner, T., Weidendorfer, J., Schirmer, J., Klug, T., Trinitis, C., Ziegler, S. (2009) 'Parallel MLEM on Multicore Architectures' in ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I: 491-500
978-3-642-01969-2
10.1007/978-3-642-01970-8_48
http://hdl.handle.net/10547/272038
en
http://dl.acm.org/citation.cfm?id=1561015.1560813
Springer
oai:uobrep.openrepository.com:10547/2791822020-04-23T07:29:33Zcom_10547_132192col_10547_132230
Coordinated iterative learning control schemes for train trajectory tracking with overspeed protection
Sun, Heqing
Hou, Zhongsheng
Li, Dayou
input constraint
iterative learning control
ILC
This work embodies the overspeed protection and safe headway control into an iterative learning control (ILC) based train trajectory tracking algorithm to satisfy the high safety requirement of high-speed railways. First, a D-type ILC scheme with overspeed protection is proposed. Then, a corresponding coordinated ILC scheme with multiple trains is studied to keep the safe headway. Finally, the control scheme under traction/braking force constraint is also considered for this proposed ILC-based train trajectory tracking strategy. Rigorous theoretical analysis has shown that the proposed control schemes can guarantee the asymptotic convergence of train speed and position to its desired profiles without requirement of the physical model aside from some mild assumptions on the system. Effectiveness is further evaluated through simulations.
2013-04-07
2013-04-07
2012
Article
Sun, H.; Hou, Z. and Li, D., (2012) 'Coordinated Iterative Learning Control Schemes for Train Trajectory Tracking With Overspeed Protection,' vol.PP (99):1 IEEE Transactions on Automation Science and Engineering
1545-5955
10.1109/TASE.2012.2216261
http://hdl.handle.net/10547/279182
IEEE Transactions on Automation Science and Engineering
en
https://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6338304&contentType=Early+Access+Articles&sortType%3Dasc_p_Sequence%26filter%3DAND%28p_IS_Number%3A4358066%29
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2791832020-04-23T07:29:33Zcom_10547_132192col_10547_132230
Integration of symbolic task planning into operations within an unstructured environment
Qiu, Renxi
Noyvirt, Alexandre
Ji, Ze
Soroka, Anthony
Li, Dayou
Liu, Beisheng
Arbeiter, Georg
Weisshardt, Florian
Xu, Shuo
robot operation system
To ensure a robot capable of robust task execution in unstructured environments, task planners need to have a high-level understanding of the nature of the world, reasoning for deliberate actions, and reacting to environment changes. Proposed is a practical task planning approach that seamlessly integrating deeper domain knowledge, real time perception and symbolic planning for robot operation. A higher degree of autonomy under unstructured environment will be endowed to the robot with the proposed approach.
2013-04-07
2013-04-07
2012
Article
Qiu, R.; Noyvirt, A.; Ji, Z.; Soroka, A.; Li, D.; Liu, B.; Arbeiter, G.; Weisshardt, F.; and Xu, S. (2012) 'Integration of Symbolic Task Planning into Operations within an Unstructured Environment', 2 (3):38-57 International Journal of Intelligent Mechatronics and Robotics
2156-1664
2156-1656
10.4018/ijimr.2012070104
http://hdl.handle.net/10547/279183
International Journal of Intelligent Mechatronics and Robotics
en
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijimr.2012070104
Archived with thanks to International Journal of Intelligent Mechatronics and Robotics
IGI Global
oai:uobrep.openrepository.com:10547/2791842020-04-23T08:39:57Zcom_10547_132192col_10547_132230
Scalable communications for a million-core neural processing architecture
Patterson, Cameron
Garside, Jim D.
Painkras, Eustace
Temple, Steve
Plana, Luis A.
Navaridas, Javier
Sharp, Thomas
Furber, Steve B.
GALS
HPC
network-on-chip
The design of a new high-performance computing platform to model biological neural networks requires scalable, layered communications in both hardware and software. SpiNNaker's hardware is based upon Multi-Processor System-on-Chips (MPSoCs) with flexible, power-efficient, custom communication between processors and chips. The architecture scales from a single 18-processor chip to over 1 million processors and to simulations of billion-neuron, trillion-synapse models, with tens of trillions of neural spike-event packets conveyed each second. The communication networks and overlying protocols are key to the successful operation of the SpiNNaker architecture, designed together to maximise performance and minimise the power demands of the platform. SpiNNaker is a work in progress, having recently reached a major milestone with the delivery of the first MPSoCs. This paper presents the architectural justification, which is now supported by preliminary measured results of silicon performance, indicating that it is indeed scalable to a million-plus processor system.
2013-04-07
2013-04-07
2012
Article
Patterson, C.; Garside, J.; Painkras, E.; Temple, S., Plana, L., Navaridas, J., Sharp, T. and Furber, S. (2012) 'Scalable communications for a million-core neural processing architecture' 72 (11):1507-1520 Journal of Parallel and Distributed Computing
07437315
10.1016/j.jpdc.2012.01.016
http://hdl.handle.net/10547/279184
Journal of Parallel and Distributed Computing
en
http://linkinghub.elsevier.com/retrieve/pii/S0743731512000287
Elsevier
oai:uobrep.openrepository.com:10547/2791642020-04-23T07:29:26Zcom_10547_132192col_10547_132230
Overview of the SpiNNaker system architecture
Furber, Steve B.
Lester, David R.
Plana, Luis A.
Garside, Jim D.
Painkras, Eustace
Temple, Steve
Brown, Andrew D.
interconnection architectures
SpiNNaker (a contraction of Spiking Neural Network Architecture) is a million-core computing engine whose flagship goal is to be able to simulate the behaviour of aggregates of up to a billion neurons in real time. It consists of an array of ARM9 cores, communicating via packets carried by a custom interconnect fabric. The packets are small (40 or 72 bits), and their transmission is brokered entirely by hardware, giving the overall engine an extremely high bisection bandwidth of over 5 billion packets/s. Three of the principle axioms of parallel machine design -- memory coherence, synchronicity and determinism -- have been discarded in the design without, surprisingly, compromising the ability to perform meaningful computations. A further attribute of the system is the acknowledgement, from the initial design stages, that the sheer size of the implementation will make component failures an inevitable aspect of day-to-day operation, and fault detection and recovery mechanisms have been built into the system at many levels of abstraction. This paper describes the architecture of the machine and outlines the underlying design philosophy; software and applications are to be described in detail elsewhere, and only introduced in passing here as necessary to illuminate the description
2013-04-07
2013-04-07
2012
Article
Furber, S.; Lester, D.; Plana, L.; Garside, J.; Painkras, E.; Temple, S. and Brown, A. (2012) 'Overview of the SpiNNaker System Architecture',1 IEEE Transactions on Computers, 99 pp. 1-14
0018-9340
10.1109/TC.2012.142
http://hdl.handle.net/10547/279164
IEEE Transactions on Computers
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6226357
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
oai:uobrep.openrepository.com:10547/2791652020-04-23T07:29:37Zcom_10547_132192col_10547_132230
SpiNNaker: design and implementation of a GALS multicore system-on-chip
Plana, Luis A.
Clark, David
Davidson, Simon
Furber, Steve B.
Garside, Jim D.
Painkras, Eustace
Pepper, Jeffrey
Temple, Steve
Bainbridge, John
asynchronous system
network-on-chip
The design and implementation of Globally Asynchronous Locally Synchronous Systems-on-Chip is a challenging activity. The large size and complexity of the systems require the use of Computer-Aided Design (CAD) tools but, unfortunately, most tools do not work adequately with asynchronous circuits. This paper describes the successful design and implementation of SpiNNaker, a GALS multi-core system-on-chip. The processes was completed using commercial CAD tools from synthesis to layout. A hierarchical methodology was devised to deal with the asynchronous sections of the system, encapsulating and validating timing assumptions at each level. The crossbar topology combined with a pipelined asynchronous fabric implementation allows the on-chip network to meet the stringent requirements of the system. The implementation methodology constrains the design in a way which allows the tools to complete their tasks successfully. A first test chip, with reduced resources and complexity was taped-out using the proposed methodology. Test chips were received in December 2009 and were fully functional. The methodology had to be modified to cope with the increased complexity of the SpiNNaker SoC. SpiNNaker chips were delivered in May 2011 and were also fully operational, and the interconnect requirements were met.
2013-04-07
2013-04-07
2011
Article
Plana, L.; Clark, D.; Davidson, S.; Furber, S.; Garside, J.; Painkras, E.; Pepper, E.; Temple, S. and Bainbridge, J. (2011) 'SpiNNaker: Design and Implementation of a GALS Multi-Core System-on-Chip' 7 (4), article 17:1-17 ACM Journal on Emerging Technologies in Computing Systems
15504832
10.1145/2043643.2043647
http://hdl.handle.net/10547/279165
ACM Journal on Emerging Technologies in Computing Systems
en
http://dl.acm.org/citation.cfm?doid=2043643.2043647
ACM
oai:uobrep.openrepository.com:10547/2791662020-04-23T07:37:46Zcom_10547_132192col_10547_132230
Effects of iterative block ciphers on quality of experience for Internet Protocol Security enabled voice over IP calls
Safdar, Ghazanfar Ali
Sant, Paul
Epiphaniou, Gregory
Maple, Carsten
IP networks
Internet telephony
Voice over IP (VoIP) is the technology used to transport real-time voice over a packet-switched network. This study analyses the effects of encrypted VoIP streams on perceived Quality of Experience (QoE) from a user's perspective. An in-depth analysis on how the transparent nature of encryption can influence the way users perceive the quality of a VoIP call have been investigated by using the E model. A series of experiments have been conducted using a representative sample of modern codecs currently employed for digitising voice, as well as three of the most commonly used iterative block ciphers for encryption (DES, 3DES, AES). It has been found that the Internet Protocol Security encryption of VoIP strongly relates to the payload sizes and choice of codecs and this relationship has different effects on the overall QoE as measured by the E model, in terms of the way that users perceive the quality of a VoIP call. The main result of this paper is that the default payload shipped with the codecs is not the optimal selection for an increased number of VoIP calls, when encryption is applied and a minimum level of QoE has to be maintained, per call.
2013-04-07
2013-04-07
2012
Article
Epiphaniou, G.; Maple, C.; Sant, P. and Safdar, G.A., (2012) 'Effects of iterative block ciphers on quality of experience for Internet Protocol Security enabled voice over IP calls' 6 (3):141-148 IET Information Security
1751-8709
1751-8717
10.1049/iet-ifs.2011.0213
http://hdl.handle.net/10547/279166
IET Information Security
en
http://digital-library.theiet.org/content/journals/10.1049/iet-ifs.2011.0213
Archived with thanks to IET Information Security
IET
oai:uobrep.openrepository.com:10547/2760192020-04-23T07:29:37Zcom_10547_132192col_10547_132230
Mobile sensor networks for modelling environmental pollutant distribution
Lu, Bowen
Oyekan, John O.
Gu, Dongbing
Hu, Huosheng
Nia, Hossein Farid Ghassem
University of Essex
This article proposes to deploy a group of mobile sensor agents to cover a polluted region so that they are able to retrieve the pollutant distribution. The deployed mobile sensor agents are capable of making point observation in the natural environment. There are two approaches to modelling the pollutant distribution proposed in this article. One is a model-based approach where the sensor agents sample environmental pollutant, build up an environmental pollutant model and move towards the region where high density pollutant exists. The modelling technique used is a distributed support vector regression and the motion control technique used is a distributed locational optimising algorithm (centroidal Voronoi tessellation). The other is a model-free approach where the sensor agents sample environmental pollutant and directly move towards the region where high density pollutant exists without building up a model. The motion control technique used is a bacteria chemotaxis behaviour. By combining this behaviour with a flocking behaviour, it is possible to form a spatial distribution matched to the underlying pollutant distribution. Both approaches are simulated and tested with a group of real robots.
2013-03-26
2013-03-26
2011
Article
Lu, B., Oyekan, J., Gu, D., Hu, H. and Nia, H.F.G.(2011) 'Mobile sensor networks for modelling environmental pollutant distribution' International Journal of Systems Science 42 (9):1491-1505
0020-7721
1464-5319
10.1080/00207721.2011.572198
http://hdl.handle.net/10547/276019
International Journal of Systems Science
en
http://www.tandfonline.com/doi/abs/10.1080/00207721.2011.572198
Taylor and Francis
oai:uobrep.openrepository.com:10547/2760182020-04-23T07:29:37Zcom_10547_132192col_10547_132230
Bio-inspired coverage of invisible hazardous substances in the environment
Oyekan, John O.
Hu, Huosheng
Gu, Dongbing
University of Essex
bacterium inspired algorithm
environmental monitoring
invisible hazardous substances
Inspired by the simplicity of how nature solves its problems, a controller based upon the bacteria chemotaxis behavior and flocking of starlings in nature is developed and presented. It would enable the localization and subsequent mapping of pollutants in the environment. The pollutants could range from chemical leaks to invisible air borne hazardous materials. Simulation is used to explore the feasibility of the proposed controller and then a brief discussion on how to implement it onto a real robotic platform is presented. By using the advantages offered by swarm robotics, it is possible to achieve a collective mapping of an invisible pollutant spread over a large area. The approach presented is very simple, computational efficient, easily tuned and yet highly effective (desirable characteristics of biological systems) in generating a representation of an invisible pollutant.
2013-03-26
2013-03-26
2010
Article
Oyekan, J., Hu, H. and Gu, D. (2010) 'Bio-Inspired Coverage of Invisible Hazardous Substances in the Environment', International Journal of Information Acquisition 07 (03): 193-204
0219-8789
1793-6985
10.1142/S0219878910002154
http://hdl.handle.net/10547/276018
International Journal of Information Acquisition
en
http://www.worldscientific.com/doi/abs/10.1142/S0219878910002154
World Scientific Publishing Company
oai:uobrep.openrepository.com:10547/2760402020-04-23T07:29:36Zcom_10547_132192col_10547_132230
Teaching project management with Second Life
Conrad, Marc
University of Bedfordshire
Second Life
project management
Project Management is a field of intellectual and pragmatic enquiry that is inherently inter-disciplinary. It typically involves the integration of areas such as: project scoping, time, cost, and human resource management, whilst the management of effective inter-team communication, project risk, and procurement aspects are all central to the discipline. To try to cover all of these areas within a single university assignment presents somewhat of a challenge. This chapter demonstrates that the deployment of a Multi User Virtual Environment can indeed encompass these areas in an effective manner, both from learning objectives, realism, and assessment points of view. The chapter has emerged from the experience of three years deployment of Second Life as an integral part of a unit on Project Management, offered as part of both undergraduate and postgraduate courses within the Department of Computer Science and Technology at the University of Bedfordshire. Examples illustrate the work that has been produced by the students of these courses.
2013-03-26
2013-03-26
2011
Book chapter
Conrad, M. (2011) 'Teaching Project Management with Second Life' in 'Multi-User Virtual Environments for the Classroom: Practical Approaches to Teaching in Virtual Worlds', Giovanni Vincenti and James Braman (eds.), IGI Global : 302-315
9781609605452
10.4018/978-1-60960-545-2.ch019
http://hdl.handle.net/10547/276040
en
http://www.igi-global.com/chapter/teaching-project-management-second-life/53505
IGI Global
oai:uobrep.openrepository.com:10547/2791562019-09-23T09:32:02Zcom_10547_132192col_10547_132230
What is my avatar? who is my avatar? the avatar as a device to achieve a goal: perceptions and implications
Conrad, Marc
Charles, Alec
Neale, Jo
2013-04-07
2013-04-07
2011
Book chapter
Conrad, M., Charles, A. and Neale, J. (2011) 'What Is My Avatar? Who Is My Avatar? The Avatar as a Device to Achieve a Goal: Perceptions and Implications' in A. Peachey and M. Childs (eds.), Reinventing Ourselves: Contemporary Concepts of Identity in Virtual Worlds, chapter 13, Springer Series in Immersive Environments
9780857293619
10.1007/978-0-85729-361-9_13
http://hdl.handle.net/10547/279156
en
http://www.springer.com/computer/hci/book/978-0-85729-360-2
Springer
oai:uobrep.openrepository.com:10547/2791532020-04-23T07:29:37Zcom_10547_132192col_10547_132230
Methodologies to develop quantitative risk evaluation metrics
Hamid, Thaier K.A.
Maple, Carsten
Sant, Paul
quantifying security
Cvssv2
The goal of this work is to advance a new methodology to measure a severity cost for each host using the Common Vulnerability Scoring System (CVSS) based on base, temporal and environmental metrics by combining related sub-scores to produce a unique severity cost by modeling the problem's parameters in to a mathematical framework. We build our own CVSS Calculator using our equations to simplify the calculations of the vulnerabilities scores and to benchmark with other models. We design and develop a new approach to represent the cost assigned to each host by dividing the scores of the vulnerabilities to two main levels of privileges, user and root, and we classify these levels into operational levels to identify and calculate the severity cost of multi steps vulnerabilities. Finally we implement our framework on a simple network, using Nessus scanner as tool to discover known vulnerabilities and to implement the results to build and represent our cost centric attack graph.
2013-04-07
2013-04-07
2012
Article
Thaier Hamid, Carsten Maple and Paul Sant, (2012) 'Methodologies to Develop Quantitative Risk Evaluation Metrics' 48 (14):17-24 International Journal of Computer Applications
0975-8887
10.5120/7416-0413
http://hdl.handle.net/10547/279153
International Journal of Computer Applications
en
http://research.ijcaonline.org/volume48/number14/pxc3880413.pdf
Archived with thanks to International Journal of Computer Applications
FCS - Foundation of Computer Science, USA
oai:uobrep.openrepository.com:10547/2791582020-04-23T07:29:34Zcom_10547_132192col_10547_132230
Informativeness of sleep cycle features in Bayesian assessment of newborn electroencephalographic maturation
Schetinin, Vitaly
Jakaite, Livija
Schult, Joachim
brain models
electroencephalography
Bayesian methods
newborn brain maturity
Clinical experts assess the newborn brain development by analyzing and interpreting maturity-related features in sleep EEGs. Typically, these features widely vary during the sleep hours, and their informativeness can be different in different sleep stages. Normally, the level of muscle and electrode artifacts during the active sleep stage is higher than that during the quiet sleep that could reduce the informative-ness of features extracted from the active stage. In this paper, we use the methodology of Bayesian averaging over Decision Trees (DTs) to assess the newborn brain maturity and explore the informativeness of EEG features extracted from different sleep stages. This methodology has been shown providing the most accurate inference and estimates of uncertainty, while the use of DT models enables to find the EEG features most important for the brain maturity assessment.
2013-04-07
2013-04-07
2011
Conference papers, meetings and proceedings
Schetinin, V.; Jakaite, L.; Schult, J., (2011) 'Informativeness of sleep cycle features in Bayesian assessment of newborn electroencephalographic maturation,' Computer-Based Medical Systems (CBMS), 2011 24th International Symposium on: 1-6
9781457711893
10.1109/CBMS.2011.5999111
http://hdl.handle.net/10547/279158
en
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5999111
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
etdms///col_10547_132230/100