The Java system dependence graph

The Program Dependence Graph was introduced by Ottenstein and Ottenstein in 1984 [14]. It was suggested to be a suitable internal program representation for monolithic programs, for the purpose of carrying out certain software engineering operations such as slicing and the computation of program metrics. Since then, Horwitz et al. have introduced the multi-procedural equivalent System Dependence Graph [9]. Many authors have proposed object-oriented dependence graph construction approaches [11, 10, 20, 12]. Every approach provides its own benefits, some of which are language specific. This paper is based on Java and combines the most important benefits from a range of approaches. The result is a Java System Dependence Graph, which summarises the key benefits offered by different approaches and adapts them (if necessary) to the Java language

Comprehensive Security Framework for Global Threats Analysis

Cyber criminality activities are changing and becoming more and more professional. With the growth of financial flows through the Internet and the Information System (IS), new kinds of thread arise involving complex scenarios spread within multiple IS components. The IS information modeling and Behavioral Analysis are becoming new solutions to normalize the IS information and counter these new threads. This paper presents a framework which details the principal and necessary steps for monitoring an IS. We present the architecture of the framework, i.e. an ontology of activities carried out within an IS to model security information and User Behavioral analysis. The results of the performed experiments on real data show that the modeling is effective to reduce the amount of events by 91%. The User Behavioral Analysis on uniform modeled data is also effective, detecting more than 80% of legitimate actions of attack scenarios

Dynamics and sparsity in latent threshold factor models: A study in multivariate EEG signal processing

We discuss Bayesian analysis of multivariate time series with dynamic factor models that exploit time-adaptive sparsity in model parametrizations via the latent threshold approach. One central focus is on the transfer responses of multiple interrelated series to underlying, dynamic latent factor processes. Structured priors on model hyper-parameters are key to the efficacy of dynamic latent thresholding, and MCMC-based computation enables model fitting and analysis. A detailed case study of electroencephalographic (EEG) data from experimental psychiatry highlights the use of latent threshold extensions of time-varying vector autoregressive and factor models. This study explores a class of dynamic transfer response factor models, extending prior Bayesian modeling of multiple EEG series and highlighting the practical utility of the latent thresholding concept in multivariate, non-stationary time series analysis.Comment: 27 pages, 13 figures, link to external web site for supplementary animated figure

Discovering the dynamics of smart business networks

Earlier research discussed the necessary evolution from smart business networks, as based on process need satisfaction and governance, into business genetics [1] based on strategic bonds or decay and opportunistic complementarities. This paper will describe an approach and diffusion algorithms whereby to discover the dynamics of emergent smart business network structures and their performance in view of collaboration patterns over time. Some real life early analyses of dynamics are discussed based on cases and date from the high tech sector. Lessons learnt from such cases are also given on overall smart network dynamics with respect to local interaction strategies, as modelled like in business genetics by individual partner profiles, goals and constraints. It shows the weakness of static “business operating systems”, as well as the possibly destabilizing clustering effects amongst nodes linked to filtering, evaluation and own preferences.smart business networks; business genetics; network performance; SBN; dynamics

Discovering the Dynamics of Smart Business Networks

In an earlier paper ,was discussed the necessary evolution from smart business networks, as based on process need satisfaction and governance, into business genetics [1] based on strategic bonds or decay and opportunistic complementarities. This paper will describe an approach and diffusion algorithms whereby to discover the dynamics of emergent smart business network structures and their performance in view of collaboration patterns over time. Some real life early analyses of dynamics are discussed based on cases and date from the high tech sector. Lessons learnt from such cases are also given on overall smart network dynamics with respect to local interaction strategies, as modelled like in business genetics by individual partner profiles, goals and constraints. It shows the weakness of static "business operating systems", as well as the possibly destabilizing clustering effects amongst nodes linked to filtering, evaluation and own preferences.dynamics;network performance;smart business networks;SBN;business genetics

DALiuGE: A Graph Execution Framework for Harnessing the Astronomical Data Deluge

The Data Activated Liu Graph Engine - DALiuGE - is an execution framework for processing large astronomical datasets at a scale required by the Square Kilometre Array Phase 1 (SKA1). It includes an interface for expressing complex data reduction pipelines consisting of both data sets and algorithmic components and an implementation run-time to execute such pipelines on distributed resources. By mapping the logical view of a pipeline to its physical realisation, DALiuGE separates the concerns of multiple stakeholders, allowing them to collectively optimise large-scale data processing solutions in a coherent manner. The execution in DALiuGE is data-activated, where each individual data item autonomously triggers the processing on itself. Such decentralisation also makes the execution framework very scalable and flexible, supporting pipeline sizes ranging from less than ten tasks running on a laptop to tens of millions of concurrent tasks on the second fastest supercomputer in the world. DALiuGE has been used in production for reducing interferometry data sets from the Karl E. Jansky Very Large Array and the Mingantu Ultrawide Spectral Radioheliograph; and is being developed as the execution framework prototype for the Science Data Processor (SDP) consortium of the Square Kilometre Array (SKA) telescope. This paper presents a technical overview of DALiuGE and discusses case studies from the CHILES and MUSER projects that use DALiuGE to execute production pipelines. In a companion paper, we provide in-depth analysis of DALiuGE's scalability to very large numbers of tasks on two supercomputing facilities.Comment: 31 pages, 12 figures, currently under review by Astronomy and Computin