Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mark Robinson

dblp:41/3052 · DBLP profile ↗
← Back
17ranked-venue papers
3as first author
1since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 12 · 2 first-authorSoftware engineering, systems software and programming languages · 4 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

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

Software engineering, system software, and programming languages
2 papers
Requirements engineering and software design · 75% Software maintenance and evolution · 25%
Network and information security
1 paper
Authentication and access control · 77% Systems and software security · 12% Hardware security and side channels · 12%

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

TopicWeightPapersLastEvidence papers
Requirements engineering and software design
requirements validation
0.212016
An automated collaborative requirements engineering tool for better validation of requirements · ASE 2016
Authentication and access control
access control
0.112011
GitBAC: Flexible access control for non-modular concerns · ASE 2011
Authentication and access control › access control
fine-grained access control
0.112011
GitBAC: Flexible access control for non-modular concerns · ASE 2011
Requirements engineering and software design › separation of concerns
crosscutting concerns
0.112011
GitBAC: Flexible access control for non-modular concerns · ASE 2011
Software maintenance and evolution
software modularization
0.112011
GitBAC: Flexible access control for non-modular concerns · ASE 2011
Systems and software security
insider threat
0.012011
GitBAC: Flexible access control for non-modular concerns · ASE 2011
Hardware security and side channels
intellectual property protection
0.012011
GitBAC: Flexible access control for non-modular concerns · ASE 2011

Methods — techniques the papers use, named apart from their topics

user study · 0.2concern-based access control · 0.2
YearPublicationVenuePosition
2025 3-D Visualization of New Hybrid-Rotational Ground-Penetrating Radar for Subsurface Inspection of Transport Infrastructure
abstract
Ground-penetrating radar (GPR) facilitates the detection and localization of subsurface structural anomalies in critical transport infrastructure (e.g., tunnels), better informing targeted maintenance strategies. However, conventional fixed-directional systems suffer from limited coverage—especially of less-accessible structural aspects (e.g., crowns)—alongside the unclear visual output of anomaly spatial profiles, both for physical and simulated datasets. To tackle these limitations, new hybrid-rotational GPR utilizes novel 360° orientable air-launched antennas to increase subsurface coverage, principally in tunnels. Prototype systems currently lack a versatile workflow to generate practical visual output for surveyors. This study develops a versatile visualization workflow based on entirely open-access tools, returning 3-D spatial profiles of subsurface anomalies in: 1) simulated; 2) fixed-directional; and 3) hybrid-rotational GPR datasets. Work includes the development of two unique hybrid-rotational GPR systems, for laboratory and in-field data collection, respectively. Following initial 3-D grid alignment and smoothing, data undergo 3-D Stolt migration, normalization, and proximal clustering via Hierarchical Density-Based Spatial Clustering of Applications with Noise (HDBSCAN). This returns segmented point subsets associated with suspected structural anomalies. Finally, 3-D convex hulls are recovered using the QuickHull method. Detection and localization performance is first appraised through numerical simulation in open-source software gprMax. Practical laboratory experimentation follows, with both commercial fixed-directional systems and developed hybrid-rotational GPR, before in-field demonstration on a large-scale, tunnel subsurface analog. In each experiment, all targets were successfully identified within returned 3-D visualizations of hybrid-rotational GPR datasets. Moreover, the spatial profiles were consistently observed to be accurately localized within decimeter-length scales of known target locations. Overall, the advances presented in this work both facilitate and demonstrate the significant practical potential of new hybrid-rotational GPR technology as a basis for future subsurface surveying of critical transport infrastructure.
Thomas McDonald, Alain Plattner, Craig Warren, Mark Robinson, Guiyun Tian 0001
IEEE Trans. Geosci. Remote. Sens.4
2016 An automated collaborative requirements engineering tool for better validation of requirements
abstract
This demo introduces an automated collaborative requirements engineering tool, called TestMEReq, which is used to promote effective communication and collaboration between client-stakeholders and requirements engineers for better requirements validation. Our tool is augmented with real time communication and collaboration support to allow multiple stakeholders to collaboratively validate the same set of requirements. We have conducted a user study focusing on validating requirements using TestMEReq with a few groups of requirements engineers and client stakeholders. The study shows that our automated tool support is able to assist requirements engineers to effectively communicate with client-stakeholders to better validate the requirements virtually in real time. (Demo video: https://www.youtube.com/watch?v=7sWLOx-N4Jo).
M. Nor Aiza, Massila Kamalrudin, Safiah Sidek, Mark Robinson, John C. Grundy
ASE4
2014 Automatic Acceptance Test Case Generation From Essential Use Cases
abstract
Requirements validation is a crucial process to determine whether client-stakeholders' needs and expectations of a product are sufficiently correct and complete. Various requirements validation techniques have been used to evaluate the correctness and quality of requirements, but most of these techniques are tedious, expensive and time consuming. Accordingly, most project members are reluctant to invest their time and efforts in the requirements validation process. Moreover, automated tool supports that promote effective collaboration between the client-stakeholders and the engineers are still lacking. In this paper, we describe a novel approach that combines prototyping and test-based requirements techniques to improve the requirements validation process and promote better communication and collaboration between requirements engineers and client-stakeholders. To justify the potential of this prototype tool, we also present three types of evaluation conducted on the prototpye tool, which are the usability survey, 3-tool comparison analysis and expert reviews.
Massila Kamalrudin, M. Nor Aiza, John C. Grundy, John G. Hosking, Mark Robinson
SoMeT5
2012 Using Varying Negative Examples to Improve Computational Predictions of Transcription Factor Binding Sites
Faisal Ibne Rezwan, Yi Sun 0001, Neil Davey, Rod Adams, Alistair G. Rust, Mark Robinson
EANN6
2012 Formal Analysis of Sequence Diagram with Combined Fragments
abstract
The Combined Fragments of UML Sequence Diagram permit various types of control flow among messages (e.g., interleaving and branching) to express an aggregation of multiple traces encompassing complex and concurrent behaviors. However, Combined Fragments increase the difficulty of Sequence Diagram comprehension and analysis. To alleviate this problem, we introduce an approach to formally describe Sequence Diagrams with Combined Fragments in terms of the input language of the model checker NuSMV. This approach permits the verification of desired properties against Sequence Diagrams.
Mark Robinson, Jianwei Niu 0001
ICSOFT2
2011 GitBAC: Flexible access control for non-modular concerns
abstract
Today's techniques for controlling access to software artifacts are limited to restricting access to whole files and directories. But when a company's access control policy does not match a project's existing physical modularization, these techniques require either an all-or-nothing approach or re-modularization of the files and directories. The increased maintenance overhead this brings to project administration can lead to unimplemented or insufficient developer access control and an increased risk of insider security incidents (e.g., theft of intellectual property). We have created a tool (GitBAC) to provide access control of software artifacts using a crosscutting concern instead of artifact modularization. Our method provides fine-grained access control of artifacts and accommodates flexible access control policies.
Mark Robinson, Jianwei Niu 0001, Macneil Shonle
ASE1
2011 Evolving the face of a criminal: how to search a face space more effectively
Charlie D. Frowd, Vicki Bruce, Melanie Pitchford, Carol Gannon, Mark Robinson, Colin Tredoux, Jo Park, Alex H. McIntyre, Peter J. B. Hancock
Soft Comput.5
2010 Using Randomised Vectors in Transcription Factor Binding Site Predictions
abstract
Finding the location of binding sites in DNA is a difficult problem. Although the location of some binding sites have been experimentally identified, other parts of the genome may or may not contain binding sites. This poses problems with negative data in a trainable classifier. Here we show that using randomized negative data gives a large boost in classifier performance when compared to the original labeled data.
Faisal Ibne Rezwan, Yi Sun 0001, Neil Davey, Rod Adams, Alistair G. Rust, Mark Robinson
ICMLA6
2010 Evolving the memory of a criminal's face: methods to search a face space more effectively
Charlie D. Frowd, Vicki Bruce, Melanie Pitchford, Carol Gannon, Mark Robinson, Colin Tredoux, Jo Park, Alex H. McIntyre, Peter J. B. Hancock
Soft Comput.5
2009 Integrating genomic binding site predictions using real-valued meta classifiers
Yi Sun 0001, Mark Robinson, Rod Adams, I. René J. A. te Boekhorst, Alistair G. Rust, Neil Davey
Neural Comput. Appl.2
2009 Using pre & post-processing methods to improve binding site predictions
Yi Sun 0001, Cristina González Castellano, Mark Robinson, Rod Adams, Alistair G. Rust, Neil Davey
Pattern Recognit.3
2008 Prediction of Binding Sites in the Mouse Genome Using Support Vector Machines
Yi Sun 0001, Mark Robinson, Rod Adams, Alistair G. Rust, Neil Davey
ICANN (2)2
2008 Combining experts in order to identify binding sites in yeast and mouse genomic data
Mark Robinson, Cristina González Castellano, Faisal Ibne Rezwan, Rod Adams, Neil Davey, Alistair G. Rust, Yi Sun 0001
Neural Networks1
2007 Identifying Binding Sites in Sequential Genomic Data
Mark Robinson, Cristina González Castellano, Rod Adams, Neil Davey, Yi Sun 0001
ICANN (2)1
2007 Predicting Binding Sites in the Mouse Genome
abstract
The identification of cis-regulatory binding sites in DNA in multicellular eukaryotes is a particularly difficult problem in computational biology. To obtain a full understanding of the complex machinery embodied in genetic regulatory networks it is necessary to know both the identity of the regulatory transcription factors together with the location of their binding sites in the genome. We show that using an SVM together with data sampling, to integrate the results of individual algorithms specialised for the prediction of binding site locations, can produce significant improvements upon the original algorithms applied to the mouse genome. These results make more tractable the expensive experimental procedure of actually verifying the predictions.
Yi Sun 0001, Mark Robinson, Rod Adams, Neil Davey, Alistair G. Rust
ICMLA2
2006 Using sampling methods to improve binding site predictions
Yi Sun 0001, Mark Robinson, Rod Adams, I. René J. A. te Boekhorst, Alistair G. Rust, Neil Davey
ESANN2
2005 Using real-valued meta classifiers to integrate binding site predictions
abstract
Currently the best algorithms for transcription factor binding site prediction are severely limited in accuracy. There is good reason to believe that predictions from these different classes of algorithms could he used in conjunction to improve the quality of predictions. In this paper, we apply single layer networks, rules sets and support vector machines on predictions from 12 key real valued algorithms. Furthermore, we use a window of consecutive results in the input vector in order to contextualise the neighbouring results. We improve the classification result with the aid of under- and over- sampling techniques. We find that support vector machines outperform each of the original individual algorithms and the other classifiers employed in this work. In particular they have a better tradeoff between recall and precision.
Yi Sun 0001, Mark Robinson, Rod Adams, Paul Kaye, Alistair G. Rust, Neil Davey
IJCNN2