Search NASA⌕ Search

Engineering topics

Rallo Moya, Roberto J.

Publications and source records attributed to Rallo Moya, Roberto J..

Efficient Clustering of Software Vulnerabilities using Self Organizing Map (SOM)

The common vulnerabilities and exposures (CVE) database was created with a mission to ``identify, define, and catalog publicly disclosed cybersecurity vulnerabilities''. This rich body of information can be used to enable rapid and efficient response to secure and defend cyber operations and protect critical cyber infrastructure. The main goal of this paper is to develop a visual analytics tool to enable deep analysis of CVEs using unsupervised clustering techniques. We enhance our analysis by first mapping CVEs to hierarchical-classes in Common Weakness Enumeration (CWE) using information in the National Vulnerability Database (NVD). Both the mapping and the numerical representation of CVEs are enabled by V2W-BERT, which uses natural language processing of the extensive information in NVD to generate a large tabular database of 137,226 CVE entries from 1999 to 2020, where each CVE is represented by a vector of 768 numerical features. The vectorized data is processed by Self-Organizing Maps (SOM), which is an unsupervised machine learning technique for dimensionality reduction, visual representation and clustering. Using a Torus map of 6417 units, we achieve ~10-fold data compression of ~140k CVEs using SOM. The trained map is further clustered using standard K-means clustering into 138 clusters of CVEs. We conducted a brief investigation of the rich mapping of CVEs to best-matching-units to K-means clusters, as well as CVEs to CWEs. For example, this novel mapping provided insight into the role of CWE-59 and CWE-264 in several CVEs that is otherwise hard to explore in the original data. We conclude that our this novel approach will not only enable deep analysis of the complex relationships between CVEs and CWEs, but also a mechanism to quickly respond to and design mitigation actions for rapidly evolving vulnerabilities that have not been mapped to existing CWEs.

Panchal, Khyati↗

Optimizing Rate of Penetration and Tripping Decision-Making using Real-Time Bit Wear Monitoring While Drilling Geothermal Wells

Understanding bit wear while drilling is critical to minimizing non-productive time (NPT) and optimizing rate of penetration (ROP). Lengthening drilling runs with damaged bits does not only lower the ROP, but also elevates the risk of inducing severe bit damage, which could potentially lead to time-consuming fishing operations. When drillers believe the bit has worn off substantially, the bit is tripped out to be replaced. On geothermal wells, tripping can take up to 20% of the overall well construction time, and this is generally acknowledged as an opportunity for improvement. Ideally, a bit run should be terminated before the bit is damaged beyond repair. At the same time, premature bit pulls are to be avoided as well. This study aims to leverage bit and tooth wear metrics that can be obtained in real time to characterize bit condition in order to optimize ROP and determine the optimal time to pull the bit. Two metrics were explored in this study: a bit wear metric that incorporated depth-of-cut, and a tooth wear metric developed by Bourgoyne & Young characterizing the state of bit teeth dull. Both metrics were computed using recorded data from 12¼ inches roller cone insert bit runs in five geothermal wells targeting a granodiorite formation in the western United States. Together with the actual dull grades, determined after the bits were pulled to surface, the metric trends were interpreted to characterize the downhole bit condition and identify the point at which the bit should have optimally been tripped out. The insights from studying the actual dull grades and how they relate to the two metrics were used to establish a reliable bit pull criterion. The bit wear metric trend correctly showed a noticeable departure from baseline for bits experiencing major dulling behavior. Additionally, the tooth wear model predicted the cutter dull within two dull grades for most runs, with better performance in predicting the inner teeth dull. Moreover, the combination of the bit wear and tooth wear metrics was effective in revealing the cause of the bit performance impairment. Proactive tracking of these two metrics in real-time can facilitate geothermal drilling ROP optimization and better-informed tripping decision-making, thereby avoiding wasted time and cost.

Ashari, Rahmat↗

Distributed heterogeneous compute infrastructure for the study of additive manufacturing systems

We present the current status of a large-scale computing framework to address the need of the multidisciplinary effort to study chemical dynamics. Specifically, we are enabling scientists to process and store experimental data, run large-scale computationally expensive high-fidelity physical simulation, and analyze these results using the state-of-the-art data analytics tools, machine learning, and uncertainty quantification methods using heterogeneous computing resources, such as CPU and GPU cluster. The framework can integrate or abstract out multiple domains based on roles. In order to develop this framework, we have leveraged an existing framework coupled with in-house heterogeneous computing resources. We present the results of using this framework on a single metadata triggered workflow to accelerate an additive manufacturing use case.

heterogeneous computing, hpc, workflows, reproduci↗

Visualizing biomolecular electrostatics in virtual reality with UnityMol-APBS

The APBS software was developed to solve the equations of continuum electrostatics for large biomolecular assemblages. APBS has enjoyed widespread adoption throughout the biomedical community and is used in numerous applications involving biomolecular structures. However, visualization of complex biomolecular electrostatic properties can be challenging for two-dimensional graphics systems. Therefore, advanced visualization and manipulation capabilities have been incorporated. In particular, APBS tools have been integrated with the UnityMolX virtual reality platform to provide an immersive experience for preparing biomolecular systems for calculations as well as visualizing and comparing calculated results.

electrostatics, molecular visualization, solvation↗

Graph Analytics and Optimization Methods for Insights from the Uber Movement Data

In this work we leverage the Uber movement dataset for the Los Angeles (LA) area where partial TAZ to TAZ (Traffic Analysis Zone) trip time data is available. We first create a TAZ-TAZ network based on nearest neighbors and propose a model that allows us to complete the $(O-D)$ (Origin-Destination) travel time matrix, using optimization methods such as non-negative least squares. We apply these algorithms for several communities in the TAZ-TAZ network and present insights in the form of completed $(O-D)$ matrices and associated temporal trends. We qualify the error performance and scalability of our flows. We conclude by pointing out the directions in our ongoing work to improve the quality and scale of travel time estimation.

Visweswara Sathanur, Arun↗

Fractal Dimension Calculation for Big Data Using Box Locality Index

The box-counting approach for fractal dimension calculation is scaled up for big data using a data structure named box locality index (BLI). The BLI is constructed as key-value pair style with the key (an integer array) indexing the location of a “box” (i.e., a gird cell on the multi-dimensional space embedding a given dataset) and the value counting the number of data points inside the box (called “box occupancy”). Compared with the traditionally used E-dim tree, the BLI avoids complex hierarchical structure and encodes only necessary information required by box-counting approach for fractal dimension calculation. Moreover, the key-value pair nature of BLI, together with the fact that the box occupancy is aggregatable, grants box-counting approach the needed scalability for fractal dimension calculation of big data using distributed computing techniques (e.g., MapReduce and Spark). Taking the advantage of the BLI, MapReduce and Spark methods for fractal dimension calculation of big data are developed, which conduct box-counting for each grid level as a cascade of MapReduce/Spark jobs in a bottom-up fashion. In an empirical validation, the MapReduce and Spark methods demonstrated good effectiveness and efficiency in fractal calculation of a big synthetic dataset. In summary, this work provides an efficient solution for the estimation of intrinsic dimension of big data that is essential for many machine learning methods and data analytics.

Fractal dimension, Intrinsic dimension, Box-counti↗

Trends and Challenges in Smart Healthcare Research: A Journey from Data to Wisdom

Smart Healthcare is a relatively new context-aware healthcare paradigm influenced by several fields of knowledge, namely medical informatics, communications and electronics, bioengineering, ethics and so on. Thus, many challenging problems are related to smart healthcare but in many cases they are explored individually in their respective fields and, as a result, they are not always known by the smart healthcare research community working in more specific domains. The aim of this article is to identify some of the most relevant trends and research lines that are going to affect the smart healthcare field in the years to come. To do so, the article considers a systematic approach that classifies the identified research trends and problems according to their appearance within the data life cycle, this is, from the data gathering in the physical layer (lowest level) until their final use in the application layer (highest level). By identifying and classifying those research trends and challenges, we help to pose questions that the smart healthcare community will need to address. Consequently, we set a common ground to explore important problems in the field, which will have significant impact in the years to come.

behavior analysis↗