This paper explores the effect of various graphical constructions upon the associated graph C∗-algebras. The graphical constructions in question arise naturally in the study of flow equivalence for topological Markov chains. We prove that outsplittings give rise to isomorphic graph algebras, and in-splittings give rise to strongly Morita equivalent C∗-algebras. We generalise the notion of a del...

The aim of the study is the application and validation of an adjoint based data assimilation method for the determination of timedependent pressure fields from velocity data obtained by particle image velocimetry (PIV). The method is based on the full compressible Navier-Stokes equations. No additional constraints like incompressibility or adiabatic flow conditions are necessary. The technique ...

In this paper, we propose an efficient and easily implemented codec system for encoding watermark numbers as graph structures thought the use of self-inverting permutations. More precisely, based on the fact that a watermark number w can be efficiently encoded as self-inverting permutation π∗, we present an efficient encoding algorithm which encodes a self-inverting permutation π∗ as a reducibl...

The application of graph analytics to various domains has yielded tremendous societal and economical benefits in recent years. However, the increasingly widespread adoption comes with a commensurate increase need protect private information data, especially light many privacy breaches real-world data that were supposed preserve sensitive information. This article provides comprehensive survey r...

Abstract The citation graph is a computational artifact that widely used to represent the domain of published literature. It represents connections between works, such as citations and authorship. Among other things, supports computation bibliometric measures h-indexes impact factors. There now an increasing demand we should treat publication data in same way conventional publications. In parti...

This is a new applied development of trace theory to compilation. Trace theory allows to commute independent program instructions, but overlooks the differences between control and data dependencies. Control(C)-dependences, unlike data-dependences, are determined by the Control Flow Graph, modelled as a local DFA. To ensure semantic equivalence, partial commutation must preserve C-dependences. ...

This artifact is a proof-of-concept implementation of DDPA, an on-demand program analysis for higherorder functional programs. The implementation, written in OCaml, includes a parser, evaluator, and DDPA analysis for the language defined in the companion paper (including the proper record semantics extension). The analysis may be performed using different levels of precision as specified by the...

This paper examines the application of information ow analysis to role-based protection systems. Starting with basic information ow axioms and a security policy, we propose a means of ensuring that a given role-based scheme is consistent with the speciied security policy. The proposed method uses graph theory and, in particular, treats this problem as an instance of subgraph isomorphism to dete...

In this work, we consider the automatic generation of test inputs for Mercury programs. We use an abstract representation of a program that allows to reason about program executions as paths in a control-flow graph. Next, we define how such a path corresponds to a set of constraints whose solution defines input values for the predicate under test such that when the predicate is called with resp...

We propose a detailed CellML model of the human cerebral circulation that runs faster than real time on a desktop computer and is designed for use in clinical settings when the speed of response is important. A lumped parameter mathematical model, which is based on a one-dimensional formulation of the flow of an incompressible fluid in distensible vessels, is constructed using a bond graph form...