Zobrazeno 1 - 10
of 232
pro vyhledávání: '"Kay, Bill"'
Autor:
Kay, Bill, Myers, Audun, Boydston, Thad, Ellwein, Emily, Mackenzie, Cameron, Alvarez, Iliana, Lentz, Erik
Shannon Entropy is the preeminent tool for measuring the level of uncertainty (and conversely, information content) in a random variable. In the field of communications, entropy can be used to express the information content of given signals (represe
Externí odkaz:
http://arxiv.org/abs/2312.00964
Autor:
Kay, Bill, Aksoy, Sinan G., Baird, Molly, Best, Daniel M., Jenne, Helen, Joslyn, Cliff, Potvin, Christopher, Henselman-Petrusek, Gregory, Seppala, Garret, Young, Stephen J., Purvine, Emilie
In this position paper, we argue that when hypergraphs are used to capture multi-way local relations of data, their resulting topological features describe global behaviour. Consequently, these features capture complex correlations that can then serv
Externí odkaz:
http://arxiv.org/abs/2312.00023
Autor:
Myers, Audun, Bittner, Alyson, Aksoy, Sinan, Best, Daniel M., Henselman-Petrusek, Gregory, Jenne, Helen, Joslyn, Cliff, Kay, Bill, Seppala, Garret, Young, Stephen J., Purvine, Emilie
In this study we synthesize zigzag persistence from topological data analysis with autoencoder-based approaches to detect malicious cyber activity and derive analytic insights. Cybersecurity aims to safeguard computers, networks, and servers from var
Externí odkaz:
http://arxiv.org/abs/2309.08010
Autor:
Kritschgau, Jurgen, Kaiser, Daniel, Rodriguez, Oliver Alvarado, Amburg, Ilya, Bolkema, Jessalyn, Grubb, Thomas, Lan, Fangfei, Maleki, Sepideh, Chodrow, Phil, Kay, Bill
The hypergraph community detection problem seeks to identify groups of related nodes in hypergraph data. We propose an information-theoretic hypergraph community detection algorithm which compresses the observed data in terms of community labels and
Externí odkaz:
http://arxiv.org/abs/2308.04537
Autor:
Aksoy, Sinan G., Bennink, Ryan, Chen, Yuzhou, Frías, José, Gel, Yulia R., Kay, Bill, Naumann, Uwe, Marrero, Carlos Ortiz, Petyuk, Anthony V., Roy, Sandip, Segovia-Dominguez, Ignacio, Veldt, Nate, Young, Stephen J.
We present and discuss seven different open problems in applied combinatorics. The application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods, hypergraph cut alg
Externí odkaz:
http://arxiv.org/abs/2303.11464
In this work we study the topological properties of temporal hypergraphs. Hypergraphs provide a higher dimensional generalization of a graph that is capable of capturing multi-way connections. As such, they have become an integral part of network sci
Externí odkaz:
http://arxiv.org/abs/2302.02857
Neuromorphic computing is a non-von Neumann computing paradigm that performs computation by emulating the human brain. Neuromorphic systems are extremely energy-efficient and known to consume thousands of times less power than CPUs and GPUs. They hav
Externí odkaz:
http://arxiv.org/abs/2104.13983
Autor:
Verma, Miki E., Bridges, Robert A., Iannacone, Michael D., Hollifield, Samuel C., Moriano, Pablo, Hespeler, Steven C., Kay, Bill, Combs, Frank L.
Publikováno v:
PLoS one 19, no. 1 (2024): e0296879
Although ubiquitous in modern vehicles, Controller Area Networks (CANs) lack basic security properties and are easily exploitable. A rapidly growing field of CAN security research has emerged that seeks to detect intrusions on CANs. Producing vehicul
Externí odkaz:
http://arxiv.org/abs/2012.14600
Autor:
Parsa, Maryam, Schuman, Catherine D., Date, Prasanna, Rose, Derek C., Kay, Bill, Mitchell, J. Parker, Young, Steven R., Dellana, Ryan, Severa, William, Potok, Thomas E., Roy, Kaushik
Training neural networks for neuromorphic deployment is non-trivial. There have been a variety of approaches proposed to adapt back-propagation or back-propagation-like algorithms appropriate for training. Considering that these networks often have v
Externí odkaz:
http://arxiv.org/abs/2005.04171
Graph burning studies how fast a contagion, modeled as a set of fires, spreads in a graph. The burning process takes place in synchronous, discrete rounds. In each round, a fire breaks out at a vertex, and the fire spreads to all vertices that are ad
Externí odkaz:
http://arxiv.org/abs/1911.01342