Measuring the Gap: Algorithmic Approximation Bounds for the Space Complexity of Stream Specifications

10.29007/t3jg ◽  
2018 ◽  
Author(s):  
David Cerna ◽  
Wolfgang Schreiner

In previous work we presented an algorithmic procedure for analysing the space complexity of monitor specifications written in a fragment of predicate logic. These monitor specifications were developed for runtime monitoring of event streams. Our procedure provides accurate results for a large fragment of the possible specifications, but overestimates the space complexity of precisely those specifications which are more likely to be found in real world applications. Experiments hinted at a relationship between the extent our procedure over-approximates the space requirements of a specification and the quantifier structure of the specification. In this paper we provide a formalization of this relationship as approximation ratios, and are able to pinpoint ``good'' constructions, that is specifications using less memory. These results are first steps towards categorizing specifications based on memory efficiency.

10.29007/jnj2 ◽  
2018 ◽  
Author(s):  
David Cerna ◽  
Wolfgang Schreiner ◽  
Temur Kutsia

We analyze the space complexity of monitoring streams of messages whose expected behavior is specified in a fragment of predicate logic; this fragment is the core of the LogicGuard specification language that has been developed in industrial context for the runtime monitoring of network traffic. The execution of the monitors is defined by an operational semantics for the step-wise evaluation of formulas, of which require the preservation of instances of the formulas in memory until their truth value can be determined. In the presented work, we analyze the number of instances that have to be preserved over time for a significant fragment of the core language that involves only “future looking quantifiers” which lays the foundations for the space analysis of the entire core language.


Crystals ◽  
2021 ◽  
Vol 11 (3) ◽  
pp. 256
Author(s):  
Christian Rodenbücher ◽  
Kristof Szot

Transition metal oxides with ABO3 or BO2 structures have become one of the major research fields in solid state science, as they exhibit an impressive variety of unusual and exotic phenomena with potential for their exploitation in real-world applications [...]


Entropy ◽  
2021 ◽  
Vol 23 (1) ◽  
pp. 110
Author(s):  
Wei Ding ◽  
Sansit Patnaik ◽  
Sai Sidhardh ◽  
Fabio Semperlotti

Distributed-order fractional calculus (DOFC) is a rapidly emerging branch of the broader area of fractional calculus that has important and far-reaching applications for the modeling of complex systems. DOFC generalizes the intrinsic multiscale nature of constant and variable-order fractional operators opening significant opportunities to model systems whose behavior stems from the complex interplay and superposition of nonlocal and memory effects occurring over a multitude of scales. In recent years, a significant amount of studies focusing on mathematical aspects and real-world applications of DOFC have been produced. However, a systematic review of the available literature and of the state-of-the-art of DOFC as it pertains, specifically, to real-world applications is still lacking. This review article is intended to provide the reader a road map to understand the early development of DOFC and the progressive evolution and application to the modeling of complex real-world problems. The review starts by offering a brief introduction to the mathematics of DOFC, including analytical and numerical methods, and it continues providing an extensive overview of the applications of DOFC to fields like viscoelasticity, transport processes, and control theory that have seen most of the research activity to date.


Author(s):  
Maximo A. Roa ◽  
Mehmet R. Dogar ◽  
Jordi Pages ◽  
Carlos Vivas ◽  
Antonio Morales ◽  
...  

Author(s):  
Anup Gangwar ◽  
Nitin Kumar Agarwal ◽  
Ravishankar Sreedharan ◽  
Ambica Prasad ◽  
Sri Harsha Gade ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document