SNMP Trace Analysis: Results of Extra Traces

The Simple Network Management Protocol (SMMP) was introduced in the late 1980s. Since then, several evolutionary protocol changes have taken place, resulting in the SNMP version 3 framework (SNMPv3). Extensive use of SNMP has led to significant practical experience by both network operators and researchers. Since recently, researchers are in the possession of real world SNMP traces. This allows researchers to analyze the real world application of SNMP. A publication of 2007 made a significant start with this. However, real world trace analysis demands a continual approach, due to changing circumstances (e.g., regarding the network and SNMP engine implementations). Therefore, this paper reports on a lot more traces than in the mentioned paper, which are also more recent

Dynamic delta method for trace gas analysis

Method has been developed in which measurements are made only over viscous flow range, eliminating fractionation before the molecular leak and problems due to surface elution

The relevance of the evolution of experimental studies for the interpretation and evaluation of some trace physical evidence

In order for trace evidence to have a high evidential value, experimental studies which mimic the forensic reality are of fundamental importance. Such primary level experimentation is crucial to establish a coherent body of theory concerning the generation, transfer and persistence of different forms of trace physical evidence. We contend that the forensic context, at whatever scale, will be specific to each individual forensic case and this context in which a crime takes place will influence the properties of trace evidence. it will, therefore, be necessary in many forensic cases to undertake secondary level experimental studies that incorporate specific variables pertinent to a particular case and supplement the established theory presented in the published literature. Such studies enable a better understanding of the specific forensic context and thus allow More accurate collection, analysis and interpretation of the trace physical evidence to be achieved. This paper presents two cases where the findings of secondary level experimental studies undertaken to address specific issues particular to two forensic investigations proved to be important. Specific pre-, syn- and post-forensic event factors were incorporated into the experimental design and proved to be invaluable in the recovery, analysis and in achieving accurate interpretations of both soil evidence from footwear and glass trace evidence from a broken window.These Studies demonstrate that a fuller understanding of the specific context within which trace physical evidence is generated and subsequently collected, as well as an understanding of the behaviour of certain forms of trace physical evidence under specific conditions, can add evidentiary weight to the analysis and interpretation of that evidence and thus help a court with greater certainty where resources (time and cost) permit

Forward Analysis and Model Checking for Trace Bounded WSTS

We investigate a subclass of well-structured transition systems (WSTS), the bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (Logic. Meth. Comput. Sci. 2012). Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, boundedness is decidable. Boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all $\omega$-regular properties on the set of infinite traces of the system

Orientifold daughter of N=4 SYM and double-trace running

We study the orientifold daughter of N=4 super Yang-Mills as a candidate non-supersymmetric large N conformal field theory. In a theory with vanishing single-trace beta functions that contains scalars in the adjoint representation, conformal invariance might still be broken by renormalization of double-trace terms to leading order at large N. In this note we perform a diagrammatic analysis and argue that the orientifold daughter does not suffer from double-trace running. This implies an exact large N equivalence between this theory and a subsector of N=4 SYM.Comment: 12 page

Object identification by using orthonormal circus functions from the trace transform

In this paper we present an efficient way to both compute and extract salient information from trace transform signatures to perform object identification tasks. We also present a feature selection analysis of the classical trace-transform functionals, which reveals that most of them retrieve redundant information causing misleading similarity measurements. In order to overcome this problem, we propose a set of functionals based on Laguerre polynomials that return orthonormal signatures between these functionals. In this way, each signature provides salient and non-correlated information that contributes to the description of an image object. The proposed functionals were tested considering a vehicle identification problem, outperforming the classical trace transform functionals in terms of computational complexity and identification rate

Analysis of memory use for improved design and compile-time allocation of local memory

Trace analysis techniques are used to study memory referencing behavior for the purpose of designing local memories and determining how to allocate them for data and instructions. In an attempt to assess the inherent behavior of the source code, the trace analysis system described here reduced the effects of the compiler and host architecture on the trace by using a technical called flattening. The variables in the trace, their associated single-assignment values, and references are histogrammed on the basis of various parameters describing memory referencing behavior. Bounds are developed specifying the amount of memory space required to store all live values in a particular histogram class. The reduction achieved in main memory traffic by allocating local memory is specified for each class