The inverse problem of Q-analysis of complex systems structure in cyber security

It is considered the inverse problem of Q-analysis. In the course of the research, an algorithm for the recovery of simplicial complexes from elementary simplex using local maps and a structural tree was developed. This algorithm will reduce the amount of data stored and improve the management process if the simplicial complex describes a real big complex system wich it can imagine cyber security system

Computation and Logic in the Real World

The proceedings contain 78 papers. The topics discussed include: shifting and lifting of cellular automata; learning as data compression; a classification of viruses through recursion theorems; characterizing programming systems allowing program self-reference; thin maximal antichains in the turing degrees; effective computation for nonlinear systems; time-complexity semantics for feasible affine recursions; feasible depth; a continuous derivative for real-valued functions; refocusing generalised normalisation; parameterized complexity and logic; index sets of computable structures with decidable theories; operational semantics for positive relevant logics without distribution; unique existence and computability in constructive reverse mathematics; circuit complexity of regular language; definability in the homomorphic quasiorder of finite labeled forests; and membrane systems and their application to systems biology