Language Models for Novelty Detection in Kernel Traces

Autor: Fournier, Quentin, Aloise, Daniel, Costa, Leandro R.

This new open-source dataset of kerneltraces comprises over 2 million web requests with seven distinct behaviorscollected with LTTng on an Apache Web Server. For detailed information about the data, please go to the following GitHub repository:https:

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c7f1045f34c233d186aa967ab2dcfe9

On Improving Deep Learning Trace Analysis with System Call Arguments

Autor: Seyed Vahid Azhari, Quentin Fournier, Francois Tetreault, Daniel Aloise

Publikováno v: MSR

Kernel traces are sequences of low-level events comprising a name and multiple arguments, including a timestamp, a process id, and a return value, depending on the event. Their analysis helps uncover intrusions, identify bugs, and find latency causes

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::361d7c2b652a2724502652efbbee2825

Tasking in Accelerators: Performance Evaluation

Autor: Sandra Catalán, Leonel Toledo, Antonio J. Peña, Pedro Valero-Lara

Publikováno v: PDCAT
2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new c

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::21b4764524a31c05293c162163c2942f
https://doi.org/10.1109/pdcat46702.2019.00034

Packing in generalized kernel systems: a framework that generalizes packing of branchings

Autor: Mario Leston-Rey, Yoshiko Wakabayashi

Publikováno v: Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP

We study a framework, which we call a generalized kernel system, introduced by Frank. We prove some integral and fractional packing theorems in this framework which, in particular, imply an improvement over the best known upper bounds on the size of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68275e61c6263d92e4e2f10616eaee76
https://doi.org/10.1007/s10107-014-0746-4

Objective functions with redundant domains

Autor: Robin W. Whitty, Fatima Affif Chaouche, Carrie Rutherford

Publikováno v: Journal of Combinatorial Optimization. 26:372-384

Let $(E,{ \mathcal{A}})$ be a set system consisting of a finite collection ${ \mathcal{A}}$ of subsets of a ground set E, and suppose that we have a function ? which maps ${ \mathcal{A}}$ into some set S. Now removing a subset K from E gives a restri

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c8e7c52b6c6e936b0efd79cde5664926
https://doi.org/10.1007/s10878-012-9468-9