Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “COMPUTING NETWORK”

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 91 records · Page 5

Collaborative Visualization: Definition, Challenges, and Research Agenda

Collaborative visualization has emerged as a new research direction which offers the opportunity to reach new audiences and application areas for visualization tools and techniques. Technology now allows us to easily connect and collaborate with one another - in settings as diverse as over networked computers, across mobile devices, or using shared displays such as interactive walls and tabletop surfaces. Any of these collaborative settings carries a set of challenges and opportunities for visualization research. Digital information is already regularly accessed by multiple people together in order to share information, to view it together, to analyze it, or to form decisions. However, research on how to best support collaboration with and around visualizations is still in its infancy and has so far focused only on a small subset of possible application scenarios. The purpose of this article is (1) to provide a clear scope, definition, and overview of the evolving field of collaborative visualization, (2) to help pinpoint the unique focus of collaborative visualization with its specific aspects, challenges, and requirements within the intersection of general computer-supported collaborative work (CSCW) and visualization research, and (3) to draw attention to important future research questions to be addressed by the community. Thus, the goal of the paper is to discuss a research agenda for future work on collaborative visualization, including our vision for how to meet the grand challenge and to urge for a new generation of visualization tools that were designed with collaboration in mind from their very inception.

99 GENERAL AND MISCELLANEOUS↗

Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023

Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?

97 MATHEMATICS AND COMPUTING↗

Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023

Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?

97 MATHEMATICS AND COMPUTING↗

A Learning System for Discriminating Variants of Malicious Network Traffic

Modern computer network defense systems rely primarily on signature-based intrusion detection tools, which generate alerts when patterns that are pre-determined to be malicious are encountered in network data streams. Signatures are created reactively, and only after in-depth manual analysis of a network intrusion. There is little ability for signature-based detectors to identify intrusions that are new or even variants of an existing attack, and little ability to adapt the detectors to the patterns unique to a network environment. Due to these limitations, the need exists for network intrusion detection techniques that can more comprehensively address both known unknown networkbased attacks and can be optimized for the target environment. This work describes a system that leverages machine learning to provide a network intrusion detection capability that analyzes behaviors in channels of communication between individual computers. Using examples of malicious and non-malicious traffic in the target environment, the system can be trained to discriminate between traffic types. The machine learning provides insight that would be difficult for a human to explicitly code as a signature because it evaluates many interdependent metrics simultaneously. With this approach, zero day detection is possible by focusing on similarity to known traffic types rather than mining for specific bit patterns or conditions. This also reduces the burden on organizations to account for all possible attack variant combinations through signatures. The approach is presented along with results from a third-party evaluation of its performance.

Computer Network Defense↗

Threat emulation framework

A method for emulating threats in virtual network computing environment is provided. The method comprises creating a number of virtual machines in the virtual network computing environment. A number of threat actors are emulated, wherein each threat actor comprises a number of threat artifacts that form a sequence of attack steps against the virtual network computing environment. The threat actors are then deployed against the virtual network computing environment. Behavioral data about actions of the threat actors in the virtual network computing environment is collected, as is performance data about the virtual network computing environment in response to the threat actors. The collected behavioral and performance data is then presented to a user via an interface.

Urias, Vincent↗

Fibre Channel Development Final Report CRADA No. TC-0340-92-D

The Fibre Channel (FC) Development project was designed to enhance U.S. industrial competitiveness by accelerating the standardization and subsequent industrial acceptance of the American National Standards Institute’s (AIW) Fibre Channel Standard (now X3T1 1). It was also intended to give the principal U.S. participants a one- to two-year lead in developing heterogeneous high-speed computer networks, dktibuted computing through clustering, scientific visualization techniques, and high speed channels. The project was proposed to benefit U.S. industry as these high performance computing methods became generally available. In 1992-93, during the initial project phases, Fibre Channel PC) was emerging as a new ANSI standard. It was envisioned as becoming the mechanism for data transfer between the next generation of computers, and between these computers and their peripherals. Using this channel standard, U.S. computer vendors were expecting to be able to provide high-speed interoperability between heterogeneous computers and their storage devices, with data transfer rates greater than a GBit/sec. Our project was composed of key principal players in the FC standardization effort from both U.S. industry and the Department of Energy’s (DOES) Lawrence Liverrnore National Laboratory (LLNL). The industial participants were developing individual FC interfaces to operate with their platform products. LLNL’s role was to be a neutral testing site and a facilitator for helping to resolve conflicting interpretations of the embryonic Fibre Channel specification. LLNL anticipated that conflicts in the interpretation of such a standard would arise and require neutral resolution and that such resolutions would best be achieved in cooperation with the ANSI FC Working Group. Project plans included transferring to U.S. industry any resilient FC testing capabilities at the project conclusion.

42 ENGINEERING↗

Fibre Channel Development Final Report CRADA No. TC-0340-92-C

The Fibre Channel (FC) Development project was designed to enhance U.S. industrial competitiveness by accelerating the standardization and subsequent industrial acceptance of the American National Standards Institute’s (ANSI) Fibre Channel Standard (now X3T1 1). It was also intended to give the principal U.S. participants a one-to two-year lead in developing heterogeneous high-speed computer networks, distributed computing through clustering, scientific visualization techniques, and high speed channels. The project was proposed to benefit U.S. industry as these high performance computing methods became generally available. In 1992-93, during the initial project phases, Fibre Channel (FC) was emerging as a new ANSI standard. It was envisioned as becoming the mechanism for data transfer between the next generation of computers, and between these computers and their peripherals. Using this channel standard, U.S. computer vendors were expecting to be able to provide high-speed interoperatillity between heterogeneous computers and their storage devices, with data transfer rates greater than a GBit/sec. Our project was composed of key principal players in the FC standardization effort from both U.S. industry and the Department of Energy’s@OEs) Lawrence Liverrnore National Laboratory (LLNL). The industrial participants were developing individual FC interfaces to operate with their platform products. LLNL’s.role was to be a neutral testing site and a facilitator for helping to resolve conflicting interpretations of the embryonic Fibre Channel specification. LLNL anticipated that conflicts in the interpretation of such a standard would arise and require neutral resolution and that such resolutions would best be achieved in cooperation with the ANSI FC Working Group. Project plans included transferring to U.S. industry any resilient FC testing capabilities at the project conclusion.

42 ENGINEERING↗

On the application of betweenness centrality in chemical network analysis: Computational diagnostics and model reduction

Here, the concept of shortest path and betweenness centrality (BC) is introduced in combustion systems, with its application demonstrated in chemical network analysis and skeletal mechanism generation. After establishing the graphical representation of a chemical network for given pressure, temperature, and species concentrations, a metric BC is defined to rank the shortest paths passed by other nodes between the pair of source and target node, and as such captures the dominant indirect kinetic pathways between any pair of nodes in the network for computational diagnostics. As a result, the controlling pathways are retained by collecting the species with larger BC values. Such a notion then indicates that the index of importance of species could then be assigned based on their BC values to further guide skeletal mechanism generation. Unlike existing methods, the betweenness centrality approach takes into account of both the fluxes between species and their relative positioning within the chemical network. To demonstrate its potential utility to combustion studies, the approach was applied to the GRI-3.0, LLNL and USC-Mech II mechanisms to identify the important pathways in the chemical network at each local reaction state, and develop skeletal mechanisms from all reaction state samples in auto-ignition and perfectly stirred reactor (PSR) simulations. The performance of the BC ranking is compared to the methods of directed relation graph (DRG), DRG with error propagations (DRGEP) and sensitivity analysis (SA), and is shown to possess sufficient utility in producing skeletal mechanisms with good accuracy and flexibility for the cases studied.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Class network routing

Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as the latency to do a broadcast. Class network routing is also applied to dense matrix inversion algorithms on distributed memory parallel supercomputers with hardware class function (multicast) capability. This is achieved by exploiting the fact that the communication patterns of dense matrix inversion can be served by hardware class functions, which results in faster execution times.

97 MATHEMATICS AND COMPUTING↗

A parallel multigrid preconditioner for the simulation of large fracture networks

Computational modeling of a fracture in disordered materials using discrete lattice models requires the solution of a linear system of equations every time a new lattice bond is broken. Solving these linear systems of equations successively is the most expensive part of fracture simulations using large three-dimensional networks. In this paper, we present a parallel multigrid preconditioned conjugate gradient algorithm to solve these linear systems. Numerical experiments demonstrate that this algorithm performs significantly better than the algorithms previously used to solve this problem.

99 GENERAL AND MISCELLANEOUS↗

Position Papers for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking

We invite community input in the form of two-page position papers that identify and discuss key challenges and opportunities in quantum computing and networking. In addition to providing an avenue for identifying workshop participants, these position papers will be used to shape the workshop agenda, identify panelists, and contribute to the workshop report. Position papers should not describe the authors’ current or planned research, contain material that should not be disclosed to the public, nor should they recommend specific solutions or discuss narrowly focused research topics. Rather, they should aim to improve the community’s shared understanding of the problem space, identify challenging research directions, and help to stimulate discussion.

97 MATHEMATICS AND COMPUTING↗

Design-to-Deployment Continuum Platform for Microscopes and Computing Ecosystems

Science ecosystems with networked computing systems and physical instruments are increasingly being deployed with a goal to achieve the productivity promised by AI-supported remote automation. In support of these efforts, the virtual infrastructure twins (VITs) have been successfully utilized to develop the orchestration codes for these ecosystems without requiring physical access to expensive instruments, such as electron microscopes. Currently, the utility of such a VIT is severely limited by the computing capacity and capability of the computing system used as its host. Furthermore, codes developed on the VIT typically need to be transferred and refactored for production use, particularly, on high-performance systems with accelerators. In response, we develop a design-to-deployment continuum platform wherein a VIT runs natively on the ecosystem's own computing system, and thereby facilitates the continual in-situ testing and transition of codes for production use. Here, we describe the development and testing of software for remote microscope steering and GPU-based image reconstruction using this platform on a multi-GPU computing system networked to Nion microscopes. We demonstrate a continual transition of steering and reconstruction codes developed under VIT platform to production ecosystem deployment.

Al-Najjar, Anees [Oak Ridge National Laboratory (O↗

A game theoretic investigation of deception in network security

We perform a game theoretic investigation of the effects of deception on the interactions between an attacker and a defender of a computer network. The defender can employ camouflage by either disguising a normal system as a honeypot or by disguising a honeypot as a normal system. We model the interactions between defender and attacker using a signaling game, a non-cooperative two player dynamic game of incomplete information. For this model, we determine which strategies admit perfect Bayesian equilibria. These equilibria are refined Nash equilibria in which neither the defender nor the attacker will unilaterally choose to deviate from their strategies. Finally, we discuss the benefits of employing deceptive equilibrium strategies in the defense of a computer network.

99 GENERAL AND MISCELLANEOUS↗

Method for securing a network using cyber economic network transaction security (CENTS)

A method and system for administering an interactive computer network and more particularly to performing security in a network of interactive electronic components, such as a computer network using a currency-based transactional economy model where scarcity serves as a limiting factor to accessing and engaging in various activities within the system.

97 MATHEMATICS AND COMPUTING↗

Theory VI. Computational Materials Sciences Network (CMSN)

The Computational Materials Sciences Network (CMSN) is a virtual center consisting of scientists interested in working together, across organizational and disciplinary boundaries, to formulate and pursue projects that reflect challenging and relevant computational research in the materials sciences. The projects appropriate for this center involve those problems best pursued through broad cooperative efforts, rather than those key problems best tackled by single investigator groups. CMSN operates similarly to the DOE Center of Excellence for the Synthesis and Processing of Advanced Materials, coordinated by George Samara at Sandia. As in the Synthesis and Processing Center, the intent of the modest funding for CMSN is to foster partnering and collective activities. All CMSN proposals undergo external peer review and are judged foremost on the quality and timeliness of the science and also on criteria relevant to the objective of the center, especially concerning a strategy for partnering. More details about CMSN can be found on the CMSN webpages at: http://cmpweb.ameslab.gov/ccms/CMSN-homepage.html.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Adaptive time scaling for accelerating explicit finite element analysis

A method for accelerating an explicit finite element analysis (FEA) simulation of a modeled system or process includes performing an initial iteration of the FEA simulation according to a baseline time interval via an FEA computing network, and calculating a criteria ratio of a predetermined set of scaling criteria for the modeled system or process. The method includes determining a time-scaling factor using the criteria ratio via the FEA computing network as a function of the criteria ratio, and then applying the time-scaling factor to the baseline time interval to generate a scaled time interval. The scaled time interval accelerates simulation time of the FEA simulation. The method includes performing a subsequent iteration of the explicit FEA simulation at the scaled time interval using the FEA computing network. The process continues for subsequent iterations, with the time-scaling factor adapting with each iteration.

Chen, Jian↗