Felix Wang

Felix Wang

Auto-generated profile, based on publicly available information

Felix Wang

Sandia National Laboratories, Albuquerque, NM, USA

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
5 April 2018 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
FWFelix Wang
Felix Wang
TQTu-Thach Quach
Tu-Thach Quach
JWJason Wheeler
Jason Wheeler
JAJames B. Aimone
James B. Aimone
CJConrad D. James
Conrad D. James
File fragment classification is an important step in the task of file carving in digital forensics. In file carving, files must be reconstructed based on their content as a result of their fragmented storage on disk or in memory. Existing methods for classification of file fragments typically use hand-engineered features, such as byte histograms or entropy measures. In this paper, we propose an approach using sparse coding that enables automated feature extraction. Sparse coding, or sparse dictionary learning, is an unsupervised learning algorithm, and is capable of extracting features based simply on how well those features can be used to reconstruct the original data. With respect to file fragments, we learn sparse dictionaries for n-grams, continuous sequences of bytes, of different sizes. These dictionaries may then be used to estimate n-gram frequencies for a given file fragment, but for significantly larger n-gram sizes than are typically found in existing methods which suffer from combinatorial explosion. To demonstrate the capability of our sparse coding approach, we used the resulting features to train standard classifiers, such as support vector machines over multiple file types. Experimentally, we achieved significantly better classification results with respect to existing methods, especially when the features were used in supplement to existing hand-engineered features.

8 April 2024 in Neuromorphic Computing and Engineering
Verified
Journal Article
Open access
PDF file
FWFelix Wang
Felix Wang
SKShruti Kulkarni
Shruti Kulkarni
BTBradley Theilman
Bradley Theilman
FRFredrick Rothganger
Fredrick Rothganger
CSCatherine Schuman
Catherine Schuman
JAJames B Aimone
James B Aimone
As modern neuroscience tools acquire more details about the brain, the need to move towards biological-scale neural simulations continues to grow. However, effective simulations at scale remain a challenge. Beyond just the tooling required to enable parallel execution, there is also the unique structure of the synaptic interconnectivity, which is globally sparse but has relatively high connection density and non-local interactions per neuron. There are also various practicalities to consider in high performance computing applications, such as the need for serializing neural networks to support potentially long-running simulations that require checkpoint-restart. Although acceleration on neuromorphic hardware is also a possibility, development in this space can be difficult as hardware support tends to vary between platforms and software support for larger scale models also tends to be limited. In this paper, we focus our attention on Simulation Tool for Asynchronous Cortical Streams (STACS), a spiking neural network simulator that leverages the Charm++ parallel programming framework, with the goal of supporting biological-scale simulations as well as interoperability between platforms. Central to these goals is the implementation of scalable data structures suitable for efficiently distributing a network across parallel partitions. Here, we discuss a straightforward extension of a parallel data format with a history of use in graph partitioners, which also serves as a portable intermediate representation for different neuromorphic backends. We perform scaling studies on the Summit supercomputer, examining the capabilities of STACS in terms of network build and storage, partitioning, and execution. We highlight how a suitably partitioned, spatially dependent synaptic structure introduces a communication workload well-suited to the multicast communication supported by Charm++. We evaluate the strong and weak scaling behavior for networks on the order of millions of neurons and billions of synapses, and show that STACS achieves competitive levels of parallel efficiency.

16 February 2024 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
KMKristen A. Michaelson
Kristen A. Michaelson
FWFelix Wang
Felix Wang
RZRenato Zanetti
Renato Zanetti
Terrain-relative navigation (TRN) encompasses a wide variety of algorithms that perform localization with respect to the terrain below a flying vehicle. In traditional approaches, measurements of the terrain are matched to a map carried onboard. This work presents a terrain-relative navigation filter with a position measurement inspired by neural activity associated with positioning in nature. The filter is shown to produce accurate position measurements that outperform popular optimization and template matching methods given poor prior knowledge of the position. The proposed method is also better-suited to distributed implementation than optimization-based methods.

29 June 2025
Verified
Conference Paper
Open access
WSWilliam Severa
William Severa
FWFelix Wang
Felix Wang
YHYang Ho
Yang Ho
FRFred Rothganger
Fred Rothganger
ADAnurag Daram
Anurag Daram
EGEfrain Gonzalez
Efrain Gonzalez

19 December 2024 in Nature Computational Science
Verified
Journal Article
Closed access
PDF file
FWFelix Wang
Felix Wang
JAJames B. Aimone
James B. Aimone

1 July 2024
Verified
Report
Open access
PDF file
A(Albuquerque Sandia National Laboratories (Snl-Nm)
Albuquerque Sandia National Laboratories (Snl-Nm)
FWFelix Wang
Felix Wang
ACAdvanced Simulation And Computing
Advanced Simulation And Computing
U(Usdoe National Nuclear Security Administration (Nnsa)
Usdoe National Nuclear Security Administration (Nnsa)
WSWilliam Mark Severa
William Mark Severa