Relationship between Age and Value of Information for a Noisy Ornstein–Uhlenbeck Process

The age of information (AoI) has been widely used to quantify the information freshness in real-time status update systems. As the AoI is independent of the inherent property of the source data and the context, we introduce a mutual information-based value of information (VoI) framework for hidden Markov models. In this paper, we investigate the VoI and its relationship to the AoI for a noisy Ornstein–Uhlenbeck (OU) process. We explore the effects of correlation and noise on their relationship, and find logarithmic, exponential and linear dependencies between the two in three different regimes. This gives the formal justification for the selection of non-linear AoI functions previously reported in other works. Moreover, we study the statistical properties of the VoI in the example of a queue model, deriving its distribution functions and moments. The lower and upper bounds of the average VoI are also analysed, which can be used for the design and optimisation of freshness-aware networks. Numerical results are presented and further show that, compared with the traditional linear age and some basic non-linear age functions, the proposed VoI framework is more general and suitable for various contexts.     

Comparison between the Test and Simulation Results for PLA Structures 3D Printed,Bending Stressed

The additive manufacturing process is one of the technical domains that has had a sustained development in recent decades. The designers’ attention to equipment and materials for 3D printing has been focused on this type of process. The paper presents a comparison between the results of the bending tests and those of the simulation of the same type of stress applied on 3D-printed PLA and PLA–glass structures. The comparison of the results shows that they are close, and the simulation process can be applied with confidence for the streamline of filament consumption, with direct consequences on the volume and weight of additive manufactured structures. The paper determines whether the theories and concepts valid in the strength of materials can be applied to the additive manufacturing pieces. Thus, the study shows that the geometry of the cross-section, by its shape (circular or elliptical) and type (solid or ring shaped), influences the strength properties of 3D-printed structures. The use of simulation will allow a significant shortening of the design time of the new structures. Moreover, the simulation process was applied with good results on 3D-printed structures in which two types of filaments were used for a single piece (structure).     

Kolmogorov Basic Graphs and Their Application in Network Complexity Analysis

Throughout the years, measuring the complexity of networks and graphs has been of great interest to scientists. The Kolmogorov complexity is known as one of the most important tools to measure the complexity of an object. We formalized a method to calculate an upper bound for the Kolmogorov complexity of graphs and networks. Firstly, the most simple graphs possible, those with O(1) Kolmogorov complexity, were identified. These graphs were then used to develop a method to estimate the complexity of a given graph. The proposed method utilizes the simple structures within a graph to capture its non-randomness. This method is able to capture features that make a network closer to the more non-random end of the spectrum. The resulting algorithm takes a graph as an input and outputs an upper bound to its Kolmogorov complexity. This could be applicable in, for example evaluating the performances of graph compression methods.