Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational and information science”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

Scientific Computational Imaging Code (SCICO)

Scientific Computational Imaging Code (SCICO) is a Python package for solving the inverse problems that arise in scientific imaging applications. Its primary focus is providing methods for solving ill-posed inverse problems by using an appropriate prior model of the reconstruction space. SCICO includes a growing suite of operators, cost functionals, regularizers, and optimization routines that may be combined to solve a wide range of problems, and is designed so that it is easy to add new building blocks. SCICO is built on top of JAX rather than NumPy, enabling GPU/TPU acceleration, just-in-time compilation, and automatic gradient functionality, which is used to automatically compute the adjoints of linear operators. An example of how to solve a multi-channel tomography problem with SCICO is shown in Figure 1. The SCICO source code is available from GitHub, and pre-built packages are available from PyPI. It has extensive online documentation, including API documentation and usage examples, which can be run online at Google Colab and binder.

97 MATHEMATICS AND COMPUTING↗

Understanding Structures of Cyber Competition in an Era of Major Power Rivalry

Over the past two decades, the cyber domain has emerged and evolved into a key strategic domain for nations across the globe. Security strategies are espoused by heads of state that focus on how to manage the increasingly enormous, crosscutting impact that the cyber domain has on national security across economic, military, intelligence, intellectual property, and countless other facets. These strategies frequently evolve, and even change entirely, as leaders adapt to new technologies and administrations change. Even if these strategies did not change at all, they would take inordinate amounts of time to effectively implement within the organizational structures of government. The time required to go from setting department and agency-level goals, to the time small teams have well-oiled processes and expertise to accomplish tactical objectives that meet the strategic vision is lengthy. With near certainty, by the time objectives and vision are implemented, the landscape, strategy, or both has changed entirely. While this churn will likely never cease due to the rapidly changing nature of the cyber domain, this problem raises an important question: can governmental structures be organized to rapidly adapt to changing cyber strategies? As offices responsible for particular missions in cyberspace shuffle about within the bureaucracy, are technical capabilities enabled or enhanced? No matter how advanced a particular technical capability is or how adept the staff is at solving problems, they will be ineffective if placed haphazardly within the organization: the right authorities may not exist for their office, the correct lines of interpersonal communication may not be established properly, or insufficient resources have not been allocated to effectively deploy a brilliant technical solution. This concept of organizational agility in the context of national cyber capabilities is important when taking into account the National Defense Strategy’s emphasis on cyber capability and the ability of the United States to compete and rapidly adapt to new challenges posed by rivals. As a nation, we are at a point where technology evolves rapidly enough to warrant thoughtful and nimble changes to the bureaucratic structures that support how cyber operations are carried out. Taking these questions and cross-comparing them to the organizational structures across China, Russia, and the United States provides for an interesting thought experiment. As non-democratic regimes, China and Russia have differing priorities and internal power dynamics than the United States and thus organize their governments differently. By combining known and broadcasted strategies of these nations with the observed technical capabilities demonstrated in the public domain, we can begin to see how organizational structures map to strategic goals and directly enable technical capabilities. Insight can be gained by introducing organizational structures into traditional analysis focusing solely around strategies and capabilities; additionally, otherwise unknown capabilities or intents might be discovered or inferred by analyzing organizational structures alone. Analyzing cyber operations from this oft-overlooked perspective could potentially provide useful insight and more concrete actions that can be undertaken to realize the National Defense Strategy’s goals.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Message-Based SPDK Transport Utility (TED Report) [Slides]

The driving goal is to investigate the feasibility of a message-based data transport for SPDK. All of SPDK’s existing data transport protocols are “connection-based”, requiring a target to hold state for each connected client / initiator. At extreme scale, juggling these connections from a large number of initiators creates a performance bottleneck. Under a message-based paradigm, we can bypass this behavior, as all initiators share a global communication channel, held open for the entire run. In theory, this approach should minimize connection management overhead at extreme scale.

97 MATHEMATICS AND COMPUTING↗

Evolution of Robustness in Growing Random Networks

Networks are widely used to model the interaction between individual dynamic systems. In many instances, the total number of units and interaction coupling are not fixed in time, and instead constantly evolve. In networks, this means that the number of nodes and edges both change over time. Various properties of coupled dynamic systems, such as their robustness against noise, essentially depend on the structure of the interaction network. Therefore, it is of considerable interest to predict how these properties are affected when the network grows as well as their relationship to the growth mechanism. Here, we focus on the time evolution of a network’s Kirchhoff index. We derive closed-form expressions for its variation in various scenarios, including the addition of both edges and nodes. For the latter case, we investigate the evolution where single nodes with one or two edges connecting to existing nodes are added recursively to a network. In both cases, we derive the relations between the properties of the nodes to which the new node connects along with the global evolution of network robustness. In particular, we show how different scalings of the Kirchhoff index can be obtained as a function of the number of nodes. We illustrate and confirm this theory via numerical simulations of randomly growing networks.

97 MATHEMATICS AND COMPUTING↗