Publications

An All–at–Once CP Decomposition Method for Count Tensors

CANDECOMP/PARAFAC (CP) tensor decomposition is a popular method for detecting latent behaviors in real– world data sets. As data sets grow larger and more elaborate, more sophisticated CP decomposition algorithms are required to enable these discoveries. Data sets from many applications can be represented as count tensors. To decompose count

Read More »

Filtered Tensor Construction and Decomposition for Drug Repositioning

Drug repositioning (also called “drug repurposing”) is a drug development strategy that saves time and money by finding new uses for existing drugs. While a variety of computational approaches to drug repositioning exist, recent work has shown that tensor decomposition, an unsupervised learning technique for finding latent structure in multidimensional

Read More »

Knowledge-guided Tensor Decomposition for Baselining and Anomaly Detection

We introduce a flexible knowledge-guided penalty for incorporating known or expected patterns of activity into tensor decomposition. Our modified tensor decomposition both enables efficient identification of semantically-related patterns across data sets and provides a means for identifying anomalous patterns. Specifically, we modify the loss function for a CP tensor decomposition

Read More »

Systems and methods for multiresolution priority queues

A system for storing and extracting elements according to their priority takes into account not only the priorities of the elements but also three additional parameters, namely, a priority resolution pΔ and two priority limits pmin and pmax. By allowing an ordering error if the difference in the priorities of elements are

Read More »

Designing Data Center Networks Using Bottleneck Structures

This paper provides a mathematical model of data center performance based on the recently introduced Quantitative Theory of Bottleneck Structures (QTBS). Using the model, we prove that if the traffic pattern is interference-free, there exists a unique optimal design that both minimizes maximum flow completion time and yields maximal system-wide

Read More »

Simulations of Future Particle Accelerators: Issues and Mitigations

The ever increasing demands placed upon machine performance have resulted in the need for more comprehensive particle accelerator modeling. Computer simulations are key to the success of particle accelerators. Many aspects of particle accelerators rely on computer modeling at some point, sometimes requiring complex simulation tools and massively parallel supercomputing.

Read More »

A Quantitative Theory of Bottleneck Structures for Data Networks

The conventional view of the congestion control problem in data networks is based on the principle that a flow’s performance is uniquely determined by the state of its bottleneck link, regardless of the topological properties of the network. However, recent work has shown that the behavior of congestion-controlled networks is

Read More »