488
328.56
0.67
554

Publication History View all

  • [Show abstract] [Hide abstract]
    ABSTRACT: We identify four roles that social networking plays in the 'attribution problem', which obscures whether or not cyber-attacks were state-sponsored. First, social networks motivate individuals to participate in Distributed Denial of Service attacks by providing malware and identifying potential targets. Second, attackers use an individual's social network to focus attacks, through spear phishing. Recipients are more likely to open infected attachments when they come from a trusted source. Third, social networking infrastructures create disposable architectures to coordinate attacks through command and control servers. The ubiquitous nature of these architectures makes it difficult to determine who owns and operates the servers. Finally, governments recruit anti-social criminal networks to launch attacks on third-party infrastructures using botnets. The closing sections identify a roadmap to increase resilience against the 'dark side' of social networking. Practitioner Summary: This paper provides readers with an overview of state-sponsored cyber-attacks. I show how many of these threats have exploited social networks and social media. The aim was to alert practitioners to the dark side of computing, where attackers learn to exploit new interaction techniques and new forms of working.
    Ergonomics 07/2013;
  • [Show abstract] [Hide abstract]
    ABSTRACT: We present formal specification and verification of a robot moving in a complex network, using temporal sequence learning to avoid obstacles. Our aim is to demonstrate the benefit of using a formal approach to analyze such a system as a complementary approach to simulation. We first describe a classical closed-loop simulation of the system and compare this approach to one in which the system is analyzed using formal verification. We show that the formal verification has some advantages over classical simulation and finds deficiencies our classical simulation did not identify. Specifically we present a formal specification of the system, defined in the Promela modeling language and show how the associated model is verified using the Spin model checker. We then introduce an abstract model that is suitable for verifying the same properties for any environment with obstacles under a given set of assumptions. We outline how we can prove that our abstraction is sound: any property that holds for the abstracted model will hold in the original (unabstracted) model.
    Neural Computation 06/2013;
  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider the Bayesian analysis of mechanistic models describing the dynamic behavior of ligand-gated ion channels. The opening of the transmembrane pore in an ion channel is brought about by conformational changes in the protein, which results in a flow of ions through the pore. Remarkably, given the diameter of the pore, the flow of ions from a small number of channels or indeed from a single ion channel molecule can be recorded experimentally. This produces a large time-series of high-resolution experimental data, which can be used to investigate the gating process of these channels. We give a brief overview of the achievements and limitations of alternative maximum-likelihood approaches to this type of modeling, before investigating the statistical issues associated with analyzing stochastic model reaction mechanisms from a Bayesian perspective. Finally, we compare a number of Markov chain Monte Carlo algorithms that may be used to tackle this challenging inference problem.
    Methods in molecular biology (Clifton, N.J.) 01/2013; 1021:247-272.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The biochemical paradigm is well-suited for modelling autonomous systems and new programming languages are emerging from this approach. However, in order to validate such programs, we need to define precisely their semantics and to provide verification techniques. In this paper, we consider a higher-order biochemical calculus that models the structure of system states and its dynamics thanks to rewriting abstractions, namely rules and strategies. We extend this calculus with a runtime verification technique in order to perform automatic discovery of property satisfaction failure. The property specification language is a subclass of LTL safety and liveness properties.
    Electronic Notes in Theoretical Computer Science 01/2013; 297:27–46.
  • [Show abstract] [Hide abstract]
    ABSTRACT: We address two distinct problems with de facto mobile device authentication, as provided by a password or sketch. Firstly, device activity is permitted on an all-or-nothing basis, depending on whether the user successfully authenticates at the beginning of a session. This ignores the fact that tasks performed on a mobile device have a range of sensitivities, depending on the nature of the data and services accessed. Secondly, users are forced to re-authenticate frequently due to the bursty nature that characterizes mobile device use. Owners react to this by disabling the mechanism, or by choosing a weak “secret”. To address both issues, we propose an extensible Transparent Authentication Framework that integrates multiple behavioral biometrics with conventional authentication to implement an effortless and continuous authentication mechanism. Our security and usability evaluation of the proposed framework showed that a legitimate device owner can perform all device tasks, while being asked to authenticate explicitly 67% less often than without a transparent authentication method. Furthermore, our evaluation showed that attackers are soon denied access to on-device tasks as their behavioral biometrics are collected. Our results support the creation of a working prototype of our framework, and provide support for further research into transparent authentication on mobile devices.
    Computers & Security 01/2013; 39:127–136.
  • [Show abstract] [Hide abstract]
    ABSTRACT: The primary users of assisted living technology are older people who are likely to have one or more sensory impairments. Multimodal technology allows users to interact via non-impaired senses and provides alternative ways to interact if primary interaction methods fail. An empirical user study was carried out with older participants which evaluated the performance, disruptiveness and subjective workload of visual, audio, tactile and olfactory notifications then compared the results with earlier findings in younger participants. It was found that disruption and subjective workload were not affected by modality, although some modalities were more effective at delivering information accurately. It is concluded that although further studies need to be carried out in a real-world settings, the findings support the argument for multiple modalities in assisted living technology.
    Health Informatics Journal 09/2012; 18(3):181-90.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Without Abstract
    04/2012; 4(2):71-72.
  • 02/2012;
  • [Show abstract] [Hide abstract]
    ABSTRACT: As real-time embedded systems become more complex, resource partitioning is increasingly used to guarantee real-time performance. Recently, several compositional frameworks of resource partitioning have been proposed using real-time scheduling theory ...
    Theor. Comput. Sci. 01/2012; 413:1.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. Previous work has considered the problem of finding a matching that is "as stable as possible", i.e., admits the fewest number of blocking pairs. It is known that this problem is NP-hard and not approximable within n 1 2 −ε , for any ε > 0, unless P=NP, where n is the number of agents in a given sr instance. In this paper we extend the study to the Stable Roommates problem with Incomplete lists. In particular, we consider the case that the lengths of the lists are bounded by some integer d. We show that, even if d = 3, there is some c > 1 such that the problem of finding a matching with the minimum number of blocking pairs is not approximable within c unless P=NP. On the other hand we show that the problem is solvable in polynomial time for d ≤ 2, and we give a (2d − 3)-approximation algorithm for fixed d ≥ 3. If the given lists satisfy an additional condition (namely the absence of a so-called elitist odd party – a structure that is unlikely to exist in general), the performance guarantee improves to 2d − 4.
    Theoretical Computer Science. 01/2012; 432.
Information provided on this web page is aggregated encyclopedic and bibliographical information relating to the named institution. Information provided is not approved by the institution itself. The institution’s logo (and/or other graphical identification, such as a coat of arms) is used only to identify the institution in a nominal way. Under certain jurisdictions it may be property of the institution.