INRIA a CCSD electronic archive server
Not a member yet
122212 research outputs found
Sort by
CasinoLimit: An Offensive Dataset Labeled with MITRE ATT&CK Techniques
No full textInternational audienceCybersecurity exercises are a common way to train and evaluate the skills of cybersecurity professionals. These exercises also provide a unique opportunity to generate datasets with realistic attack traces on non-sensitive systems. Nevertheless, the collected logs are unlabeled, and deciding which logs are related to pentesters is a difficult problem. In this paper, we present a novel methodology to label efficiently both system and network logs using MITRE ATT&CK techniques. To demonstrate the effectiveness of our approach, we introduce CasinoLimit, a dataset generated from a pentest exercise that has been played by 114 participants where we collected 540 GB of attack data. We apply our methodology to accurately label these logs with a semi-automatic approach: labels are inferred from the shell sessions and propagated to the network sessions, and eventually corrected by a junior analyst. An expert analyst has manually reviewed all the labels that have been computed to ensure the quality of the labeling process. The results of the pentest exercise are deeply discussed. We show the variability of players' behaviors and that players can be distinguished by their command line habits. In addition, the high level of granularity of labels coupled with the number of participants enables multiple other applications. With this paper, we release the full dataset and the associated labeling tool, Manatee, which can be used to browse the logs and labels. To support the generalization of our approach, we made it possible to load other datasets with this tool
Evolution at the Core of Digital Twin Engineering
No full textInternational audienceEngineering Digital Twins (EDT) presents a multifaceted challenge that extends beyond managing the lifecycle of a Digital Twin (DT) to include its continuous, dynamic interaction with the lifecycle of the actual object, system, or process it represents, referred to as the Actual Twin (AT). The relationship between the lifecycles of DT and AT necessitates a rethinking of the software development lifecycle of DTs. This vision paper examines the deeply intertwined lifecycles of DT and AT, arguing that effective methods for EDT must embrace the mutual and adaptive evolution of both over time. We propose placing evolution at the core of EDT. We identify key triggers of DT evolution, examine the engineering dimensions involved, and explore how the best practices, technologies, and tools of DevOps can support this evolution. Finally, we discuss current challenges and opportunities in the field. This paper serves as a call to action for the EDT community to adopt evolution as a crucial factor and core principle in EDT
On the formulation and implementation of mixed mode I and mode II extrinsic cohesive zone models with contact and friction
No full textAn extrinsic cohesive zone model for mixed mode I and mode II fracture that encompasses contact and Coulomb friction is developed in the framework of nonsmooth mechanics. The model is extended to include the effects of dynamics with impact and sliding, and is discretised in time so that it can be written as a linear complementarity problem (LCP). The LCP is proved to have a solution, subject to a condition on the size of the time-step. Finally, we study the behaviour of the LCP system numerically, by observing the response of a simple test geometry to rapid loading, and observe the numerical method reproduces analytically predicted and experimentally observed behaviours, without requiring impracticably small time-steps
The tangent cone to the real determinantal variety: various expressions and a proof
No full textThe set of real matrices of upper-bounded rank is a real algebraic variety called the real generic determinantal variety. An explicit description of the tangent cone to that variety is given in Theorem 3.2 of Schneider and Uschmajew [SIAM J. Optim., 25 (2015), pp. 622-646]. The present paper shows that the proof therein is incomplete and provides a proof. It also reviews equivalent descriptions of the tangent cone to that variety. Moreover, it shows that the tangent cone and the algebraic tangent cone to that variety coincide, which is not true for all real algebraic varieties
On the h-majority dynamics with many opinions
No full textInternational audienceWe present the first upper bound on the convergence time to consensus of the well-known -majority dynamics with opinions, in the synchronous setting, for and that are both non-constant values. We suppose that, at the beginning of the process, there is some initial additive bias towards some plurality opinion, that is, there is an opinion that is supported by nodes while any other opinion is supported by strictly fewer nodes. We prove that, with high probability, if the bias is and the initial plurality opinion is supported by at least nodes, then the process converges to plurality consensus in rounds whenever . A main corollary is the following: if and the process starts from an almost-balanced configuration with an initial bias of magnitude towards the initial plurality opinion, then any function suffices to guarantee convergence to consensus in rounds, with high probability. Our upper bound shows that the lower bound of rounds to reach consensus given by Becchetti et al.\ (2017) cannot be pushed further than . Moreover, the bias we require is asymptotically smaller than the bias that guarantees plurality consensus in the -majority dynamics: in our case, the required bias is at most any (arbitrarily small) function in for any value of
Demo: A Visualization Platform for Smart Grid Network
No full textInternational audienceSmart grids are transforming electricity network management through the use of Advanced Metering Infrastructure (AMI). They facilitate the balance between production and consumption of electricity by providing real-time data and consumption control for the Distribution System Operator (DSO). However, the implementation details, which are often proprietary, are not readily available. This demo presents an innovative visualization platform to simulate a Low Voltage (LV) residential network of 48 smart meters. The platform provides a visual understanding of the communication dynamics in an AMI by reproducing message exchanges and simulating link disruptions. This demo presents the state-of-the-art G3-PLC protocol stack currently employed in the French AMI deployment and demonstrates the transmission of routing and application messages generated by LOADng and DLMS/COSEM, respectively
Développement de modèles et d'algorithmes pour la gestion des répétitions dans l'assemblage de novo de transcriptomes
No full textInternational audienceWith the advent of short-read RNA-seq technologies, transcriptome assembly has become both more accessible and more complicated. This problem, known as de novo transcriptome assembly, remains the only option for transcriptomic exploration in most non-model organisms, where no reference genome is available or where existing references are too divergent. Inexact repeats in the transcriptome generate complex regions in the assembly graph that are difficult to resolve. Among the most problematic repeats are transposable elements (TEs)—mobile sequences capable of copying and inserting themselves throughout the genome. Their high copy number and sequence similarity introduce ambiguities in read mapping and transcript structure inference. These issues are especially severe in de novo assemblies where no reference exists to anchor and disambiguate repetitive reads, leading to tangled graph structures and misassemblies. We specifically utilise De Bruijn graphs, an efficient data structure where each transcript corresponds to a path within the graph. Our research focuses on characterising complex regions that contain families of repeats and replacing them with consensus nodes. The objective of this novel method is to operate de novo, without relying on genomic references or repeat consensus sequences. This de novo approach aims to avoid the ambiguous mapping of TEs, utilising widely available short-read sequences and making it applicable to non-model species
Asymmetry of the Relative Entropy in the Regularization of Empirical Risk Minimization
No full textInternational audienceThe effect of relative entropy asymmetry is analyzed in the context of empirical risk minimization (ERM) with relative entropy regularization (ERM-RER). Two regularizations are considered: (a) the relative entropy of the measure to be optimized with respect to a reference measure (Type-I ERM- RER); and (b) the relative entropy of the reference measure with respect to the measure to be optimized (Type-II ERM- RER). The main result is the characterization of the solution to the Type-II ERM-RER problem and its key properties. By comparing the well-understood Type-I ERM-RER with Type-II ERM-RER, the effects of entropy asymmetry are highlighted. The analysis shows that in both cases, regularization by relative entropy forces the support of the solution to collapse into the support of the reference measure, introducing a strong inductive bias that negates the evidence provided by the training data. Finally, it is shown that Type-II regularization is equivalent to Type-I regularization with an appropriate transformation of the empirical risk function
Resource-Efficient Synthesis of Sparse Quantum States
No full textPreparing a quantum circuit that implements a given sparse state is an important building block that is necessary for many different quantum algorithms. In the context of fault-tolerant quantum computing, the so-called non-Clifford gates are much more expensive to perform than the Clifford ones. We hence provide an algorithm for synthesizing sparse quantum states with a special care for quantum resources. The circuit depth, ancilla count, and crucially non-Clifford count of the circuit produced by the algorithm are all linear in the sparsity. We conjecture that the non-Clifford count complexity is tight, and show a weakened version of this claim. The first key component of the algorithm is the synthesis of a generalized W-state. We provide a tree-based circuit construction approach, and the relationship between the tree's structure and the circuit's complexity. The second key component is a classical reversible circuit implementing a permutation that maps the basis states of the W-state to those of the sparse quantum state. We reduce this problem to the diagonalization of a binary matrix, using a specific set of elementary matrix operations corresponding to the classical reversible gates. We then solve this problem using a new version of Gauss-Jordan elimination, that minimizes the circuit complexities including circuit depth using parallel elimination steps
Some topics in random walks
No full textInternational audienceWe collect a few recent results on random walks, which are ubiquitous in probability theory. The topics covered are: persistence problems for stochastic processes, large fluctuations in multi-scale modeling for rest hematopoiesis, and fine properties of the elephant random walk