Colin Michael Van Oort

Colin Michael Van Oort

Auto-generated profile, based on publicly available information

Colin Michael Van Oort

University of Vermont

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 October 2021 in Digital Threats: Research and Practice
Verified
Journal Article
Open access
JRJohn H. Ring
John H. Ring
COColin M. Van Oort
Colin M. Van Oort
SDSamson Durst
Samson Durst
VWVanessa White
Vanessa White
JNJoseph P. Near
Joseph P. Near
CSChristian Skalka
Christian Skalka
Host-based Intrusion Detection Systems (HIDS) automatically detect events that indicate compromise by adversarial applications. HIDS are generally formulated as analyses of sequences of system events such as bash commands or system calls. Anomaly-based approaches to HIDS leverage models of normal (a.k.a. baseline) system behavior to detect and report abnormal events and have the advantage of being able to detect novel attacks. In this article, we develop a new method for anomaly-based HIDS using deep learning predictions of sequence-to-sequence behavior in system calls. Our proposed method, called the ALAD algorithm, aggregates predictions at the application level to detect anomalies. We investigate the use of several deep learning architectures, including WaveNet and several recurrent networks. We show that ALAD empowered with deep learning significantly outperforms previous approaches. We train and evaluate our models using an existing dataset, ADFA-LD, and a new dataset of our own construction, PLAID. As deep learning models are black box in nature, we use an alternate approach, allotaxonographs, to characterize and understand differences in baseline vs. attack sequences in HIDS datasets such as PLAID.

29 July 2019 in The Astrophysical Journal
Verified
Journal Article
Closed access
COColin M. Van Oort
Colin M. Van Oort
DXDuo Xu
Duo Xu
SOStella S. R. Offner
Stella S. R. Offner
RGRobert A. Gutermuth
Robert A. Gutermuth

27 May 2022 in Remote Sensing
Verified
Journal Article
Open access
PDF file
DWDaniel Wilson
Daniel Wilson
TAThayer Alshaabi
Thayer Alshaabi
COColin Van Oort
Colin Van Oort
XZXiaohan Zhang
Xiaohan Zhang
JNJonathan Nelson
Jonathan Nelson
SWSafwan Wshah
Safwan Wshah
Object geo-localization from images is crucial to many applications such as land surveying, self-driving, and asset management. Current visual object geo-localization algorithms suffer from hardware limitations and impractical assumptions limiting their usability in real-world applications. Most of the current methods assume object sparsity, the presence of objects in at least two frames, and most importantly they only support a single class of objects. In this paper, we present a novel two-stage technique that detects and geo-localizes dense, multi-class objects such as traffic signs from street videos. Our algorithm is able to handle low frame rate inputs in which objects might be missing in one or more frames. We propose a detector that is not only able to detect objects in images, but also predicts a positional offset for each object relative to the camera GPS location. We also propose a novel tracker algorithm that is able to track a large number of multi-class objects. Many current geo-localization datasets require specialized hardware, suffer from idealized assumptions not representative of reality, and are often not publicly available. In this paper, we propose a public dataset called ARTSv2, which is an extension of ARTS dataset that covers a diverse set of roads in widely varying environments to ensure it is representative of real-world scenarios. Our dataset will both support future research and provide a crucial benchmark for the field.

2 October 2020 in bioRxiv
Verified
Preprint
Open access
PDF file
JFJonathon B. Ferrell
Jonathon B. Ferrell
JRJacob M. Remington
Jacob M. Remington
COColin M. Van Oort
Colin M. Van Oort
MSMona Sharafi
Mona Sharafi
RAReem Aboushousha
Reem Aboushousha
JLJianing Li
Jianing Li
As the emergence of bacterial resistance is outpacing the development of new antibiotics, we must find cost-effective and innovative approaches to discover new antibacterial therapeutics. Antimicrobial peptides (AMPs) represent one promising solution to fill this void, since they generally undergo faster development, display rapid onsets of killing, and most importantly, show lower risks of induced resistance. Despite prior success in AMP design with physics- and/or knowledge-based approaches, an efficient approach to precisely design peptides with high activity and selectivity is still lacking. Toward this goal, we have invented a novel approach which utilizes a generative model to predict AMP-like sequences, followed by molecular modeling to rank the candidates. Thus, we can identify peptides with desirable sequences, structures, and potential specific interactions with bacterial membranes. For the proof of concept, we curated a dataset that comprises 500,000 non-AMP peptide sequences and nearly 8,000 labeled AMP sequences to train the generative model. For 12 generated peptides that are cationic and likely helical, we assessed the membrane binding propensity via extensive all-atom molecular simulations. The top six peptides were promoted for synthesis, chemical characterizations, and antibacterial assays, showing various inhibition to bacterial growth. Three peptides were validated with broad-spectrum antibacterial activity. In aggregate, the combination of AMP generator and sophisticated molecular modeling affords enhanced speed and accuracy in AMP design. Our approach and results demonstrate the viability of a generative approach to develop novel AMPs and to help contain the rise of antibiotic resistant microbes.

1 May 2017 in Physical Review E
Verified
Journal Article
Closed access
PDF file
PDPeter Sheridan Dodds
Peter Sheridan Dodds
DDDavid Rushing Dewhurst
David Rushing Dewhurst
FHFletcher F. Hazlehurst
Fletcher F. Hazlehurst
COColin M. Van Oort
Colin M. Van Oort
LMLewis Mitchell
Lewis Mitchell
CDChristopher M. Danforth
Christopher M. Danforth
Herbert Simon's classic rich-get-richer model is one of the simplest empirically supported mechanisms capable of generating heavy-tail size distributions for complex systems. Simon argued analytically that a population of flavored elements growing by either adding a novel element or randomly replicating an existing one would afford a distribution of group sizes with a power-law tail. Here, we show that, in fact, Simon's model does not produce a simple power-law size distribution as the initial element has a dominant first-mover advantage, and will be overrepresented by a factor proportional to the inverse of the innovation probability. The first group's size discrepancy cannot be explained away as a transient of the model, and may therefore be many orders of magnitude greater than expected. We demonstrate how Simon's analysis was correct but incomplete, and expand our alternate analysis to quantify the variability of long term rankings for all groups. We find that the expected time for a first replication is infinite, and show how an incipient group must break the mechanism to improve their odds of success. We present an example of citation counts for a specific field that demonstrates a first-mover advantage consistent with our revised view of the rich-get-richer mechanism. Our findings call for a reexamination of preceding work invoking Simon's model and provide an expanded understanding going forward.

22 January 2020 in PLOS ONE
Verified
Journal Article
Open access
PDF file
DDDavid Rushing Dewhurst
David Rushing Dewhurst
COColin M. Van Oort
Colin M. Van Oort
JRJohn H. Ring
John H. Ring
TGTyler J. Gray
Tyler J. Gray
BTBrian Tivnan
Brian Tivnan
CDChris Danforth
Chris Danforth
Using the most comprehensive source of commercially available data on the US National Market System, we analyze all quotes and trades associated with Dow 30 stocks in calendar year 2016 from the vantage point of a single and fixed frame of reference. We find that inefficiencies created in part by the fragmentation of the equity marketplace are relatively common and persist for longer than what physical constraints may suggest. Information feeds reported different prices for the same equity more than 120 million times, with almost 64 million dislocation segments featuring meaningfully longer duration and higher magnitude. During this period, roughly 22% of all trades occurred while the SIP and aggregated direct feeds were dislocated. The current market configuration resulted in a realized opportunity cost totaling over $160 million, a conservative estimate that does not take into account intra-day offsetting events.