48,004 research outputs found

    Detection of advanced persistent threat using machine-learning correlation analysis

    Get PDF
    As one of the most serious types of cyber attack, Advanced Persistent Threats (APT) have caused major concerns on a global scale. APT refers to a persistent, multi-stage attack with the intention to compromise the system and gain information from the targeted system, which has the potential to cause significant damage and substantial financial loss. The accurate detection and prediction of APT is an ongoing challenge. This work proposes a novel machine learning-based system entitled MLAPT, which can accurately and rapidly detect and predict APT attacks in a systematic way. The MLAPT runs through three main phases: (1) Threat detection, in which eight methods have been developed to detect different techniques used during the various APT steps. The implementation and validation of these methods with real traffic is a significant contribution to the current body of research; (2) Alert correlation, in which a correlation framework is designed to link the outputs of the detection methods, aims to identify alerts that could be related and belong to a single APT scenario; and (3) Attack prediction, in which a machine learning-based prediction module is proposed based on the correlation framework output, to be used by the network security team to determine the probability of the early alerts to develop a complete APT attack. MLAPT is experimentally evaluated and the presented sy

    Observation of the Kohn anomaly near the K point of bilayer graphene

    Full text link
    The dispersion of electrons and phonons near the K point of bilayer graphene was investigated in a resonant Raman study using different laser excitation energies in the near infrared and visible range. The electronic structure was analyzed within the tight-binding approximation, and the Slonczewski-Weiss-McClure (SWM) parameters were obtained from the analysis of the dispersive behavior of the Raman features. A softening of the phonon branches was observed near the K point, and results evidence the Kohn anomaly and the importance of considering electron-phonon and electron-electron interactions to correctly describe the phonon dispersion in graphene systems.Comment: 4 pages, 4 figure

    Dataplane Specialization for High-performance OpenFlow Software Switching

    Get PDF
    OpenFlow is an amazingly expressive dataplane program- ming language, but this expressiveness comes at a severe performance price as switches must do excessive packet clas- sification in the fast path. The prevalent OpenFlow software switch architecture is therefore built on flow caching, but this imposes intricate limitations on the workloads that can be supported efficiently and may even open the door to mali- cious cache overflow attacks. In this paper we argue that in- stead of enforcing the same universal flow cache semantics to all OpenFlow applications and optimize for the common case, a switch should rather automatically specialize its dat- aplane piecemeal with respect to the configured workload. We introduce ES WITCH , a novel switch architecture that uses on-the-fly template-based code generation to compile any OpenFlow pipeline into efficient machine code, which can then be readily used as fast path. We present a proof- of-concept prototype and we demonstrate on illustrative use cases that ES WITCH yields a simpler architecture, superior packet processing speed, improved latency and CPU scala- bility, and predictable performance. Our prototype can eas- ily scale beyond 100 Gbps on a single Intel blade even with complex OpenFlow pipelines

    Relaxing the Irrevocability Requirement for Online Graph Algorithms

    Get PDF
    Online graph problems are considered in models where the irrevocability requirement is relaxed. Motivated by practical examples where, for example, there is a cost associated with building a facility and no extra cost associated with doing it later, we consider the Late Accept model, where a request can be accepted at a later point, but any acceptance is irrevocable. Similarly, we also consider a Late Reject model, where an accepted request can later be rejected, but any rejection is irrevocable (this is sometimes called preemption). Finally, we consider the Late Accept/Reject model, where late accepts and rejects are both allowed, but any late reject is irrevocable. For Independent Set, the Late Accept/Reject model is necessary to obtain a constant competitive ratio, but for Vertex Cover the Late Accept model is sufficient and for Minimum Spanning Forest the Late Reject model is sufficient. The Matching problem has a competitive ratio of 2, but in the Late Accept/Reject model, its competitive ratio is 3/2

    Commuting Simplicity and Closure Constraints for 4D Spin Foam Models

    Full text link
    Spin Foam Models are supposed to be discretised path integrals for quantum gravity constructed from the Plebanski-Holst action. The reason for there being several models currently under consideration is that no consensus has been reached for how to implement the simplicity constraints. Indeed, none of these models strictly follows from the original path integral with commuting B fields, rather, by some non standard manipulations one always ends up with non commuting B fields and the simplicity constraints become in fact anomalous which is the source for there being several inequivalent strategies to circumvent the associated problems. In this article, we construct a new Euclidian Spin Foam Model which is constructed by standard methods from the Plebanski-Holst path integral with commuting B fields discretised on a 4D simplicial complex. The resulting model differs from the current ones in several aspects, one of them being that the closure constraint needs special care. Only when dropping the closure constraint by hand and only in the large spin limit can the vertex amplitudes of this model be related to those of the FK Model but even then the face and edge amplitude differ. Curiously, an ad hoc non-commutative deformation of the BIJB^{IJ} variables leads from our new model to the Barrett-Crane Model in the case of Barbero-Immirzi parameter goes to infinity.Comment: 41 pages, 4 figure

    A Path-integral for the Master Constraint of Loop Quantum Gravity

    Full text link
    In the present paper, we start from the canonical theory of loop quantum gravity and the master constraint programme. The physical inner product is expressed by using the group averaging technique for a single self-adjoint master constraint operator. By the standard technique of skeletonization and the coherent state path-integral, we derive a path-integral formula from the group averaging for the master constraint operator. Our derivation in the present paper suggests there exists a direct link connecting the canonical Loop quantum gravity with a path-integral quantization or a spin-foam model of General Relativity.Comment: 19 page
    • …
    corecore