How much information can be obtained from tracking the position of the leading edge in a scratch assay?

Moving cell fronts are an essential feature of wound healing, development and disease. The rate at which a cell front moves is driven, in part, by the cell motility, quantified in terms of the cell diffusivity $D$, and the cell proliferation rate �$\lambda$. Scratch assays are a commonly-reported procedure used to investigate the motion of cell fronts where an initial cell monolayer is scratched and the motion of the front is monitored over a short period of time, often less than 24 hours. The simplest way of quantifying a scratch assay is to monitor the progression of the leading edge. Leading edge data is very convenient since, unlike other methods, it is nondestructive and does not require labeling, tracking or counting individual cells amongst the population. In this work we study short time leading edge data in a scratch assay using a discrete mathematical model and automated image analysis with the aim of investigating whether such data allows us to reliably identify $D$ and $\lambda$�. Using a naıve calibration approach where we simply scan the relevant region of the ($D$;$\lambda$�) parameter space, we show that there are many choices of $D$ and $\lambda$� for which our model produces indistinguishable short time leading edge data. Therefore, without due care, it is impossible to estimate $D$ and $\lambda$� from this kind of data. To address this, we present a modified approach accounting for the fact that cell motility occurs over a much shorter time scale than proliferation. Using this information we divide the duration of the experiment into two periods, and we estimate $D$ using data from the first period, while we estimate �$\lambda$ using data from the second period. We confirm the accuracy of our approach using in silico data and a new set of in vitro data, which shows that our method recovers estimates of $D$ and $\lamdba$� that are consistent with previously-reported values except that that our approach is fast, inexpensive, nondestructive and avoids the need for cell labeling and cell counting.

Simplified computation and generalization of the refined process structure tree

A business process is often modeled using some kind of a directed flow graph, which we call a workflow graph. The Refined Process Structure Tree (RPST) is a technique for workflow graph parsing, i.e., for discovering the structure of a workflow graph, which has various applications. In this paper, we provide two improvements to the RPST. First, we propose an alternative way to compute the RPST that is simpler than the one developed originally. In particular, the computation reduces to constructing the tree of the triconnected components of a workflow graph in the special case when every node has at most one incoming or at most one outgoing edge. Such graphs occur frequently in applications. Secondly, we extend the applicability of the RPST. Originally, the RPST was applicable only to graphs with a single source and single sink such that the completed version of the graph is biconnected. We lift both restrictions. Therefore, the RPST is then applicable to arbitrary directed graphs such that every node is on a path from some source to some sink. This includes graphs with multiple sources and/or sinks and disconnected graphs.

Hypergraph-based modeling of ad-hoc business processes

Process models are usually depicted as directed graphs, with nodes representing activities and directed edges control flow. While structured processes with pre-defined control flow have been studied in detail, flexible processes including ad-hoc activities need further investigation. This paper presents flexible process graph, a novel approach to model processes in the context of dynamic environment and adaptive process participants’ behavior. The approach allows defining execution constraints, which are more restrictive than traditional ad-hoc processes and less restrictive than traditional control flow, thereby balancing structured control flow with unstructured ad-hoc activities. Flexible process graph focuses on what can be done to perform a process. Process participants’ routing decisions are based on the current process state. As a formal grounding, the approach uses hypergraphs, where each edge can associate any number of nodes. Hypergraphs are used to define execution semantics of processes formally. We provide a process scenario to motivate and illustrate the approach.

Flexible process graph : a prologue

Businesses document their operational processes as process models. The common practice is to represent process models as directed graphs. The nodes of a process graph represent activities and directed edges constitute activity ordering constraints. A flexible process graph modeling approach proposes to generalize process graph structure to a hypergraph. Obtained process structure aims at formalization of ad-hoc process control flow. In this paper we discuss aspects relevant to concurrent execution of process activities in a collaborative manner organized as a flexible process graph. We provide a real world flexible process scenario to illustrate the approach.

Plasma enables edge-to-center-oriented graphene nanoarrays on Si nanograss

The formation of clearly separated vertical graphenenanosheets on silicon nanograss support is demonstrated. The plasma-enabled, two-stage mask-free process produced self-organized vertical graphenes of a few carbon layers (as confirmed by advanced microanalysis), prominently oriented in the substrate center–substrate edge direction. It is shown that the width of the alignment zone depends on the substrate conductivity, and thus the electric field in the vicinity of the growth surface is responsible for the graphene alignment. This finding is confirmed by the Monte Carlo simulations of the ion flux distribution in the silicon nanograss pattern.

Plasma-aided nanofabrication: where is the cutting edge?

Plasma-aided nanofabrication is a rapidly expanding area of research spanning disciplines ranging from physics and chemistry of plasmas and gas discharges to solid state physics, materials science, surface science, nanoscience and nanotechnology and related engineering subjects. The current status of the research field is discussed and examples of superior performance and competitive advantage of plasma processes and techniques are given. These examples are selected to represent a range of applications of two major types of plasmas suitable for nanoscale synthesis and processing, namely thermally non-equilibrium and thermal plasmas. Major concepts and terminology used in the field are introduced. The paper also pinpoints the major challenges facing plasma-aided nanofabrication and identifies some emerging topics for future research. © 2007 IOP Publishing Ltd.

Graph theory based representation of building information models for access control applications

Building information models are increasingly being utilised for facility management of large facilities such as critical infrastructures. In such environments, it is valuable to utilise the vast amount of data contained within the building information models to improve access control administration. The use of building information models in access control scenarios can provide 3D visualisation of buildings as well as many other advantages such as automation of essential tasks including path finding, consistency detection, and accessibility verification. However, there is no mathematical model for building information models that can be used to describe and compute these functions. In this paper, we show how graph theory can be utilised as a representation language of building information models and the proposed security related functions. This graph-theoretic representation allows for mathematically representing building information models and performing computations using these functions.

Urban Form at the Edge : Proceedings from ISUF 2013 [Volume 1]

Urban morphology as a field of study has developed primarily in Europe and North America, and more recently emerging as a recurrent topic in China and South America. As a counterpoint to this centric view, the ISUF 2013 conference explored aspects of ‘urban form at the edge’. In particular the conference examined ‘off centre areas’ such as India, Africa, Middle East, Central Asia and Australasia which require innovative approaches to the study of traditional, as well as post-colonial and contemporary, morphologies. Broader interpretations of urban form at the edge focus on minor centres and suburbia, with their developing and transilient character; edge cities and regional centres; and new technologies and approaches that are developing alongside established methods, tools and theories of urban morphology...

A subexponential construction of graph coloring for multiparty computation

We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal (secure against an adversary who possesses any tgraphs. More specifically, following the result of Desmedt et al. (2012) that the problem of MPC over non-Abelian groups can be reduced to finding a t-reliable n-coloring of planar graphs, we show the construction of such a graph which allows a path from the input nodes to the output nodes when any t-party subset is in the possession of the adversary. Unlike the deterministic constructions from Desmedt et al. (2012) our construction has subexponential complexity and is optimal at the same time, i.e., it is secure for any t

The edge of glory: the relationship between metacritic scores and player experience

This study sought to examine how measures of player experience used in videogame research relate to Metacritic Professional and User scores. In total, 573 participants completed an online survey, where they responded the Player Experience of Need Satisfaction (PENS) and the Game Experience Questionnaire (GEQ) in relation to their current favourite videogame. Correlations among the data indicate an overlap between the player experience constructs and the factors informing Metacritic scores. Additionally, differences emerged in the ways professionals and users appear to allocate game ratings. However, the data also provide clear evidence that Metacritic scores do not reflect the full complexity of player experience and may be misleading in some cases.

Working on the edge : Exploring the creative tensions experienced by practitioners facilitating participatory media projects with refugees and asylum seekers in Australia

This paper aims to provide a contextualised and embedded exploration of how the notions of "practice" and "participation", key concepts in the study of culture and media, are manifest in an example of a complex creative project. This project aimed to engage with refugees and asylum seekers through the co-creation of cultural material and is an outcome of an? ethnographic action research (Tacchi et al. 2003) partnership involving a community development worker in a settlement support agency and a storytelling/community media researcher (the author), along with other project collaborators. The discussion of this project focuses on the role of the facilitator and illustrates the processes of orchestrating a complex project involving a series of linked stages with cumulative effect. As practitioners at this site we are working in the space where personal narratives, participatory arts and media, and the staging of intercultural, civic dialogue events, intersect. Co-creative media facilitation in these contexts involves both managing hybrid communicative spaces and (re)combining the "integrative practices" (Schatzki 1996) of a range of professional approaches and creative roles. This is liminal work, located on the boundaries of several disciplines and practices. Drawing on reflections gathered from collaborative ethnographic descriptions (Bhattacharya 2008), this paper traces moments of practitioner uncertainty that can be linked to the way "practice" and “participation” is problematised within the community cultural development field in a way that is at times an uneasy fit with conventional ways of operating in social service roles. These moments of tension also indicate where this project pushed practitioners into spaces of improvisation and new learning. Keywords: Youth, refugees, community cultural development, co-creative media facilitation, ethnographic action research, intercultural dialogue.

Test-retest reliability of graph theory measures of structural brain connectivity

The human connectome has recently become a popular research topic in neuroscience, and many new algorithms have been applied to analyze brain networks. In particular, network topology measures from graph theory have been adapted to analyze network efficiency and 'small-world' properties. While there has been a surge in the number of papers examining connectivity through graph theory, questions remain about its test-retest reliability (TRT). In particular, the reproducibility of structural connectivity measures has not been assessed. We examined the TRT of global connectivity measures generated from graph theory analyses of 17 young adults who underwent two high-angular resolution diffusion (HARDI) scans approximately 3 months apart. Of the measures assessed, modularity had the highest TRT, and it was stable across a range of sparsities (a thresholding parameter used to define which network edges are retained). These reliability measures underline the need to develop network descriptors that are robust to acquisition parameters.

New graph-based algorithms to efficiently solve large scale open pit mining optimisation problems

In the mining optimisation literature, most researchers focused on two strategic-level and tactical-level open-pit mine optimisation problems, which are respectively termed ultimate pit limit (UPIT) or constrained pit limit (CPIT). However, many researchers indicate that the substantial numbers of variables and constraints in real-world instances (e.g., with 50-1000 thousand blocks) make the CPIT’s mixed integer programming (MIP) model intractable for use. Thus, it becomes a considerable challenge to solve the large scale CPIT instances without relying on exact MIP optimiser as well as the complicated MIP relaxation/decomposition methods. To take this challenge, two new graph-based algorithms based on network flow graph and conjunctive graph theory are developed by taking advantage of problem properties. The performance of our proposed algorithms is validated by testing recent large scale benchmark UPIT and CPIT instances’ datasets of MineLib in 2013. In comparison to best known results from MineLib, it is shown that the proposed algorithms outperform other CPIT solution approaches existing in the literature. The proposed graph-based algorithms leads to a more competent mine scheduling optimisation expert system because the third-party MIP optimiser is no longer indispensable and random neighbourhood search is not necessary.