Search

In the present paper, we discuss the class of Type III and Type IV codes from the perspectives of neighbors. Our investigation analogously extends the results originally presented by Dougherty [8] concerning the neighbor graph of binary self-dual codes. Moreover, as an application of neighbors in invariant theory, we show that the ring of the weight enumerators of Type II code $d_{n}^{+}$ and its neighbors in arbitrary genus is finitely generated. Finally, we obtain a minimal set of generators of this ring up to the space of degree 24 and genus 3., Comment: 26 pages

The effectiveness of oncolytic virotherapy is significantly affected by several elements of the tumour microenvironment, which reduce the ability of the virus to infect cancer cells. In this work, we focus on the influence of hypoxia on this therapy and develop a novel continuous mathematical model that considers both the spatial and epigenetic heterogeneity of the tumour. We investigate how oxygen gradients within tumours affect the spatial distribution and replication of both the tumour and oncolytic viruses, focusing on regions of severe hypoxia versus normoxic areas. Additionally, we analyse the evolutionary dynamics of tumour cells under hypoxic conditions and their influence on susceptibility to viral infection. Our findings show that the reduced metabolic activity of hypoxic cells may significantly impact the virotherapy effectiveness; the knowledge of the tumour's oxygenation could, therefore, suggest the most suitable type of virus to optimise the outcome. The combination of numerical simulations and theoretical results for the model equilibrium values allows us to elucidate the complex interplay between viruses, tumour evolution and oxygen dynamics, ultimately contributing to developing more effective and personalised cancer treatments., Comment: 31 pages, 9 figures. Supplementary material available at https://drive.google.com/drive/folders/1-Fgx1MfUdU4HRcaa6GSzMRHbpCTd_X_e?usp=drive_link

Low-lying states of $^{94}$Zr were investigated via low-energy multi-step Coulomb excitation. From the measured $\gamma$-ray yields, 13 reduced transition probabilities between low-spin states were determined, together with the spectroscopic quadrupole moments of the $2_{1,2}^+$ states. Based on this information, for the first time in the Zr isotopic chain, the shapes of the $0_{1,2}^+$ states including their deformation softness were inferred in a model-independent way using the quadrupole sum rules approach. The ground state of $^{94}$Zr possesses a rather diffuse shape associated with a spherical configuration, while the $0_2^+$ state is oblate and more strongly deformed. The observed features of shape coexistence in $^{94}$Zr are in agreement with Monte-Carlo shell-model predictions, and the present results are vital to refine the IBM-CM description of the Zr isotopes around $A\approx 100$ in terms of an intertwined quantum phase transition., Comment: 6 pages, 3 figures

Side-channel attacks allow to extract sensitive information from cryptographic primitives by correlating the partially known computed data and the measured side-channel signal. Starting from the raw side-channel trace, the preprocessing of the side-channel trace to pinpoint the time at which each cryptographic primitive is executed, and, then, to re-align all the collected data to this specific time represent a critical step to setup a successful side-channel attack. The use of hiding techniques has been widely adopted as a low-cost solution to hinder the preprocessing of side-channel traces thus limiting side-channel attacks in real scenarios. This work introduces Hound, a novel deep learning-based pipeline to locate the execution of cryptographic primitives within the side-channel trace even in the presence of trace deformations introduced by the use of dynamic frequency scaling actuators. Hound has been validated through successful attacks on various cryptographic primitives executed on an FPGA-based system-on-chip incorporating a RISC-V CPU, while dynamic frequency scaling is active. Experimental results demonstrate the possibility of identifying the cryptographic primitives in DFS-deformed side-channel traces., Comment: Accepted for lecture presentation at 2024 42nd IEEE International Conference on Computer Design (ICCD 2024), Milan, Italy, Nov. 18-20, 2024

Operator Precedence Languages (OPL) have been recently identified as a suitable formalism for model checking recursive procedural programs, thanks to their ability of modeling the program stack. OPL requirements can be expressed in the Precedence Oriented Temporal Logic (POTL), which features modalities to reason on the natural matching between function calls and returns, exceptions, and other advanced programming constructs that previous approaches, such as Visibly Pushdown Languages, cannot model effectively. Existing approaches for model checking of POTL have been designed following the explicit-state, automata-based approach, a feature that severely limits their scalability. In this paper, we give the first symbolic, SMT-based approach for model checking POTL properties. While previous approaches construct the automaton for both the POTL formula and the model of the program, we encode them into a (sequence of) SMT formulas. The search of a trace of the model witnessing a violation of the formula is then carried out by an SMT-solver, in a Bounded Model Checking fashion. We carried out an experimental evaluation, which shows the effectiveness of the proposed solution., Comment: 30 pages, 6 figures

Aims. We explore the dynamical friction on a test mass in gravitational systems in the Quasi linear formulation of Modified Newtonian Dynamics (QuMOND). Methods. Exploiting the quasi linearity of QuMOND we derive a simple expression for the dynamical friction in akin to its Newtonian counterpart in the standard Chandrasekhar derivation. Moreover, adopting a mean field approach based on the Liouville equation we obtain a more rigorous (though in integral form) dynamical friction formula that can be evaluated numerically for a given choice of the QuMOND interpolation function. Results. Consistently with previous work, we observe that dynamical friction is stronger in MOND with respect to a baryon only Newtonian system with the same mass distribution. This amounts to a correction of the Coulomb logarithmic factor via extra terms proportional to the MOND radius of the system. Moreover, with the aid of simple numerical experiments we confirm our theoretical predictions and those of previous work on MOND., Comment: 12 pages, 3 Figures. Version accepted for publication in A&A

Tumor cell migration within the microenvironment is a crucial aspect for cancer progression and, in this context, hypoxia has a significant role. An inadequate oxygen supply acts as an environmental stressor inducing migratory bias and phenotypic changes. In this paper, we propose a novel multi-scale mathematical model to analyze the pivotal role of Snail protein expression in the cellular responses to hypoxia. Starting from the description of single-cell dynamics driven by the Snail protein, we construct the corresponding kinetic transport equation that describes the evolution of the cell distribution. Subsequently, we employ proper scaling arguments to formally derive the equations for the statistical moments of the cell distribution, which govern the macroscopic tumor dynamics. Numerical simulations of the model are performed in various scenarios with biological relevance to provide insights into the role of the multiple tactic terms, the impact of Snail expression on cell proliferation, and the emergence of hypoxia-induced migration patterns. Moreover, quantitative comparison with experimental data shows the model's reliability in measuring the impact of Snail transcription on cell migratory potential. Through our findings, we shed light on the potential of our mathematical framework in advancing the understanding of the biological mechanisms driving tumor progression., Comment: 30 pages, 8 figures

We address the problem of model checking temporal logic specifications for discrete probabilistic programs with recursive procedures, nested queries, and hard conditioning expressed with observe statements. We give them an operational semantics in terms of \emph{probabilistic Operator Precedence Automata} (pOPA), a novel class of probabilistic pushdown automata suitable to model constructs and behaviors of probabilistic programs. We develop a model checking algorithm that can verify requirements expressed in a fragment of Precedence Oriented Temporal Logic (POTLf$\chi$) on a pOPA in single \textsc{exptime}. POTLf$\chi$ is a temporal logic based on Operator Precedence Languages, which features modalities that interact with the context-free structure of program traces, matching procedure calls with returns or observe statements. We provide the \emph{first} probabilistic model checking implementation of context-free language properties for probabilistic pushdown systems., Comment: 43 pages, 16 figures

Side-channel attacks allow extracting secret information from the execution of cryptographic primitives by correlating the partially known computed data and the measured side-channel signal. However, to set up a successful side-channel attack, the attacker has to perform i) the challenging task of locating the time instant in which the target cryptographic primitive is executed inside a side-channel trace and then ii)the time-alignment of the measured data on that time instant. This paper presents a novel deep-learning technique to locate the time instant in which the target computed cryptographic operations are executed in the side-channel trace. In contrast to state-of-the-art solutions, the proposed methodology works even in the presence of trace deformations obtained through random delay insertion techniques. We validated our proposal through a successful attack against a variety of unprotected and protected cryptographic primitives that have been executed on an FPGA-implemented system-on-chip featuring a RISC-V CPU., Comment: 6 pages, 3 figures. Presented at DATE24

Operator precedence languages (OPL) enjoy the local parsability property, which essentially means that a code fragment enclosed within a pair of markers -- playing the role of parentheses -- can be compiled with no knowledge of its external context. Such a property has been exploited to build parallel compilers for languages formalized as OPLs. It has been observed, however, that when the syntax trees of the sentences have a linear substructure, its parsing must necessarily proceed sequentially making it impossible to split such a subtree into chunks to be processed in parallel. Such an inconvenience is due to the fact that so far much literature on OPLs has assumed the hypothesis that equality precedence relation cannot be cyclic. This hypothesis was motivated by the need to keep the mathematical notation as simple as possible. We present an enriched version of operator precedence grammars, called cyclic, that allows to use a simplified version of regular expressions in the right hand sides of grammar's rules; for this class of operator precedence grammars the acyclicity hypothesis of the equality precedence relation is no more needed to guarantee the algebraic properties of the generated languages. The expressive power of the cyclic grammars is now fully equivalent to that of other formalisms defining OPLs such as operator precedence automata, monadic second order logic and operator precedence expressions. As a result cyclic operator precedence grammars now produce also unranked syntax trees and sentences with flat unbounded substructures that can be naturally partitioned into chunks suitable for parallel parsing., Comment: 23 pages, 8 figures. arXiv admin note: text overlap with arXiv:2006.01236

In the study of therapeutic strategies for the treatment of cancer, eco-evolutionary dynamics are of particular interest, since characteristics of the tumour population, interaction with the environment and effects of the treatment, influence the geometric and epigenetic characterization of the tumour with direct consequences on the efficacy of the therapy and possible relapses. In particular, when considering radiotherapy, oxygen concentration plays a central role both in determining the effectiveness of the treatment and the selective pressure due to hypoxia. We propose a mathematical model, settled in the framework of epigenetically-structured population dynamics and formulated in terms of systems of coupled non-linear integro-differential equations, that aims to catch these phenomena and to provide a predictive tool for the tumour mass evolution and therapeutic effects. The outcomes of the simulations show how the model is able to explain the impact of environmental selection and therapies on the evolution of the mass, motivating observed dynamics such as relapses and therapeutic failures. Furthermore it offers a first hint for the development of therapies which can be adapted to overcome problems of resistance and relapses.

In the study of cancer evolution and therapeutic strategies, scientific evidence shows that a key dynamics lies in the tumor-environment interaction. In particular, oxygen concentration plays a central role in the determination of the phenotypic heterogeneity of cancer cell populations, whose qualitative and geometric characteristics are predominant factors in the occurrence of relapses and failure of eradication. We propose a mathematical model able to describe the eco-evolutionary spatial dynamics of tumour cells in their adaptation to hypoxic microenvironments. As a main novelty with respect to the existing literature, we combine a phenotypic indicator reflecting the experimentally-observed metabolic trade-off between the hypoxia-resistance ability and the proliferative potential with a 2d geometric domain, without the constraint of radial symmetry. The model is settled in the mathematical framework of phenotype-structured population dynamics and it is formulated in terms of systems of coupled non-linear integro-differential equations. The computational outcomes demonstrate that hypoxia-induced selection results in a geometric characterization of phenotypic-defined tumour niches that impact on tumour aggressiveness and invasive ability. Furthermore, results show how the knowledge of environmental characteristics provides a predictive advantage on tumour mass development in terms of size, shape, and composition.

In automated planning, recognising the goal of an agent from a trace of observations is an important task with many applications. The state-of-the-art approaches to goal recognition rely on the application of planning techniques, which requires a model of the domain actions and of the initial domain state (written, e.g., in PDDL). We study an alternative approach where goal recognition is formulated as a classification task addressed by machine learning. Our approach, called GRNet, is primarily aimed at making goal recognition more accurate as well as faster by learning how to solve it in a given domain. Given a planning domain specified by a set of propositions and a set of action names, the goal classification instances in the domain are solved by a Recurrent Neural Network (RNN). A run of the RNN processes a trace of observed actions to compute how likely it is that each domain proposition is part of the agent's goal, for the problem instance under considerations. These predictions are then aggregated to choose one of the candidate goals. The only information required as input of the trained RNN is a trace of action labels, each one indicating just the name of an observed action. An experimental analysis confirms that \our achieves good performance in terms of both goal classification accuracy and runtime, obtaining better performance w.r.t. a state-of-the-art goal recognition system over the considered benchmarks.

We extend the classical formulation of the dynamical friction effect on a test star by Chandrasekhar to the case of relativistic velocities and velocity distributions also accounting for post-Newtonian corrections to the gravitational force. The original kinetic framework is revised and used to construct a special-relativistic dynamical friction formula where the relative velocities changes in subsequent encounters are added up with Lorentz transformation and the velocity distribution of the field stars accounts for relativistic velocities. Furthermore, a simple expression is obtained for systems where the post-Newtonian correction on the gravitational forces become relevant even at non-relativistic particle velocities. Finally, using a linearized Lagrangian we derive another expression for the dynamical friction expression in a more compact form than that of Lee (1969). Comparing our formulation with the classical one, we observe that a given test particle suffers a slightly stronger drag when moving through a distribution of field stars with relativistic velocity distribution. Vice versa, a purely classical treatment of a system where post-Newtonian (PN) corrections should be included, over estimates the effect of dynamical friction at low test particle velocity, regardless of the form of velocity distribution. Finally, a first order PN dynamical friction covariant formulation is less strong than its classical counterpart at small velocities but much higher for large velocities over a broad range of mass ratios, Comment: 15 pages, 3 figures. Version accepted in A&A

The increasing use of Infrastructure as Code (IaC) in DevOps leads to benefits in speed and reliability of deployment operation, but extends to infrastructure challenges typical of software systems. IaC scripts can contain defects that result in security and reliability issues in the deployed infrastructure: techniques for detecting and preventing them are needed. We analyze and survey the current state of research in this respect by conducting a literature review on static analysis techniques for IaC. We describe analysis techniques, defect categories and platforms targeted by tools in the literature., Comment: 8 pages