Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “serialization”

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 361 records · Page 20

Efficient Approximation Algorithms for Weighted $b$-Matching

We describe a half-approximation algorithm, b-Suitor, for computing a b-Matching of maximum weight in a graph with weights on the edges. b-Matching is a generalization of the well-known Matching problem in graphs, where the objective is to choose a subset of M edges in the graph such that at most a speci ed number b(v) of edges in M are incident on each vertex v. Subject to this restriction we maximize the sum of the weights of the edges in M. We prove that the b-Suitor algorithm computes the same b-Matching as the one obtained by the greedy algorithm for the problem. We implement the algorithm on serial and shared-memory parallel processors, and compare its performance against a collection of approximation algorithms that have been proposed earlier. Our results show that the b-Suitor algorithm outperforms the Greedy and Locally Dominant edge algorithms by one to two orders of magnitude on a serial processor. The b-Suitor algorithm has a high degree of concurrency, and it scales well up to 240 threads on a shared memory multiprocessor. The b-Suitor algorithm outperforms the Locally Dominant edge algorithm by a factor of fourteen on 16 cores of an Intel Xeon multiprocessor.

97 MATHEMATICS AND COMPUTING↗

A Framework Including Recombination for Analyzing the Dynamics of Within-Host HIV Genetic Diversity

This paper presents a novel population genetic model and a computationally and statistically tractable framework for analyzing within-host HIV diversity based on serial samples of HIV DNA sequences. This model considers within-host HIV evolution during the chronic phase of infection and assumes that the HIV population is homogeneous at the beginning, corresponding to the time of seroconversion, and evolves according to the Wright-Fisher reproduction model with recombination and variable mutation rate across nucleotide sites. In addition, the population size and generation time vary over time as piecewise constant functions of time. Under this model I approximate the genealogical and mutational processes for serial samples of DNA sequences by a continuous coalescent-recombination process and an inhomogeneous Poisson process, respectively. Based on these derivations, an efficient algorithm is described for generating polymorphisms in serial samples of DNA sequences under the model including various substitution models. Extensions of the algorithm are also described for other demographic scenarios that can be more suitable for analyzing the dynamics of genetic diversity of other pathogens in vitro and in vivo . For the case of the infinite-sites model, I derive analytical formulas for the expected number of polymorphic sites in sample of DNA sequences, and apply the developed simulation and analytical methods to explore the fit of the model to HIV genetic diversity based on serial samples of HIV DNA sequences from 9 HIV-infected individuals. The results particularly show that the estimates of the ratio of recombination rate over mutation rate can vary over time between very high and low values, which can be considered as a consequence of the impact of selection forces.

60 APPLIED LIFE SCIENCES↗

SPi User Manual V0.1

This document describes the Serial Powering Interface (SPi) ASIC. SPi is a general purpose ASIC prototype designed for use in serial powering of silicon detector instrumentation. This description is written as a user manual to aid application, not as a design description. SPi is a generic custom ASIC, manufactured in 0.25 {mu}m CMOS by TSMC, to interface between a constant current source and silicon detector read-out chips. There is no SEU (single event upset) protection, but most (not all) components are radiation tolerant design. An operating voltage of 1.2 to 2.5 volts and other design features make the IC suitable for a variety of serial powering architectures and ROICs. It should be noted that the device is likely to be a prototype for demonstration rather than a product for inclusion in a detector. The next design(s), SPin, are likely to be designed for a specific application (eg SLHC). The component includes: (1) Seven bi-directional LVDS-like buffers for high data rate links to/from the read-out chips. These are AC coupled (series capacitor) off-chip for DC level conversion; (2) A programmable internal programmable shunt regulator to provide a defined voltage to readout chips when linked in a serial powering chain; (3) A programmable internal shunt regulator control circuit for external transistor control; (4) Shunt current measurement (for internal shunt regulator); (5) A programmable internal shunt regulator current alarm; and (6) Two programmable linear regulators.

43 PARTICLE ACCELERATORS↗

Verifying speculative multithreading in an application

Verifying speculative multithreading in an application executing in a computing system, including: executing one or more test instructions serially thereby producing a serial result, including insuring that all data dependencies among the test instructions are satisfied; executing the test instructions speculatively in a plurality of threads thereby producing a speculative result; and determining whether a speculative multithreading error exists including: comparing the serial result to the speculative result and, if the serial result does not match the speculative result, determining that a speculative multithreading error exists.

97 MATHEMATICS AND COMPUTING↗

Verifying speculative multithreading in an application

Verifying speculative multithreading in an application executing in a computing system, including: executing one or more test instructions serially thereby producing a serial result, including insuring that all data dependencies among the test instructions are satisfied; executing the test instructions speculatively in a plurality of threads thereby producing a speculative result; and determining whether a speculative multithreading error exists including: comparing the serial result to the speculative result and, if the serial result does not match the speculative result, determining that a speculative multithreading error exists.

97 MATHEMATICS AND COMPUTING↗

Wire like link for cycle reproducible and cycle accurate hardware accelerator

First and second field programmable gate arrays are provided which implement first and second blocks of a circuit design to be simulated. The field programmable gate arrays are operated at a first clock frequency and a wire like link is provided to send a plurality of signals between them. The wire like link includes a serializer, on the first field programmable gate array, to serialize the plurality of signals; a deserializer on the second field programmable gate array, to deserialize the plurality of signals; and a connection between the serializer and the deserializer. The serializer and the deserializer are operated at a second clock frequency, greater than the first clock frequency, and the second clock frequency is selected such that latency of transmission and reception of the plurality of signals is less than the period corresponding to the first clock frequency.

97 MATHEMATICS AND COMPUTING↗

Accelerating functional verification of an integrated circuit

Illustrative embodiments include a method, system, and computer program product for accelerating functional verification in simulation testing of an integrated circuit (IC). Using a processor and a memory, a serial operation is replaced with a direct register access operation, wherein the serial operation is configured to perform bit shifting operation using a register in a simulation of the IC. The serial operation is blocked from manipulating the register in the simulation of the IC. Using the register in the simulation of the IC, the direct register access operation is performed in place of the serial operation.

42 ENGINEERING↗

Cyber security using multi-threaded architecture data diode at the NBSR - 114

Ongoing upgrades for the control room of the National Bureau of Standards Reactor (NBSR) located at the National Institute of Standards and Technology (NIST) require the ability to collect sensor data from the secured reactor network and transfer to the outside network for trend analysis, while maintaining the security of the reactor network. To accomplish this, a data diode was created to provide a physical barrier that prevents any outside data from reaching the secured reactor network. The hardware of the data diode consists of two embedded computers, running Unix based operating systems, connected by three DB-9 serial cables. The serial cables have been modified so that only two wires, a ground and a transmission line, provide connection between the computers. The data diode relies on a multi-threaded architecture to collect and simultaneously transfer data over three serial connections. A software program, implemented in Java, has been written to request data from the digital recorders installed to monitor the NBSR process instrumentation and transfer that data across the serial connections. The data diode can collect over 1200 data points from multiple digital recorders each second. The collected data can then be stored in a relational database for later analysis. The source codes for the software are available open source on GitHub. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

32 Channel × 40 Gb/s WDM optical communication system utilizing different configurations of hybrid fiber amplifier

In this paper, a simulation analysis of 40 Gb/s wavelength division multiplexing system of 32 channels is implemented through RZ modulation format by using a different hybrid fiber amplifier (HFA) configurations, namely, serial HFA, parallel HFA, and combined serial–parallel hybrid fiber amplifier (CSP-HFA). The performance of the proposed amplifiers is compared in terms of average gain level, average noise figure, flat gain bandwidth. In addition, quality factor, bit error rate, and eye diagram for the demonstrated 32 channel × 40 Gb/s wavelength division multiplexing optical communication system utilizing different configurations of the hybrid fiber amplifier is compared. The CSP-HFA shows better performance than serial and parallel hybrid amplifiers in terms of wider flat gain bandwidth, higher quality factor, lower bit error rate, and wider and clearer eye opening. Furthermore, CSP-HFA exhibits a flat gain bandwidth of 65 nm with an acceptable average gain of 16 dB and average noise figure of 7 dB.

42 ENGINEERING↗

The role of growth factors in maintenance of stemness in bone marrow-derived mesenchymal stem cells

Highlights: • Expression of FGF-2, FGF-4, EGF, and HGF decreased during long-term culture of BMSCs. • Loss of growth factors induced autophagy, senescence and decrease of stemness. • FGF-2 increased proliferation potential via AKT and ERK activation in BMSCs. • FGF-2 suppressed LC3-II expression and down-regulated senescence of BMSCs. • HGF was important in maintenance of the differentiation potential of BMSCs. - Abstract: Mesenchymal stem cells (MSCs) are an active topic of research in regenerative medicine due to their ability to secrete a variety of growth factors and cytokines that promote healing of damaged tissues and organs. In addition, these secreted growth factors and cytokines have been shown to exert an autocrine effect by regulating MSC proliferation and differentiation. We found that expression of EGF, FGF-4 and HGF were down-regulated during serial passage of bone marrow-derived mesenchymal stem cells (BMSCs). Proliferation and differentiation potentials of BMSCs treated with these growth factors for 2 months were evaluated and compared to BMSCs treated with FGF-2, which increased proliferation of BMSCs. FGF-2 and -4 increased proliferation potentials at high levels, about 76- and 26-fold, respectively, for 2 months, while EGF and HGF increased proliferation of BMSCs by less than 2.8-fold. Interestingly, differentiation potential, especially adipogenesis, was maintained only by HGF treatment. Treatment with FGF-2 rapidly induced activation of AKT and later induced ERK activation. The basal level of phosphorylated ERK increased during serial passage of BMSCs treated with FGF-2. The expression of LC3-II, an autophagy marker, was gradually increased and the population of senescent cells was increased dramatically at passage 7 in non-treated controls. But FGF-2 and FGF-4 suppressed LC3-II expression and down-regulated senescent cells during long-term (i.e. 2 month) cultures. Taken together, depletion of growth factors during serial passage could induce autophagy, senescence and down-regulation of stemness (proliferation via FGF-2/-4 and differentiation via HGF) through suppression of AKT and ERK signaling.

60 APPLIED LIFE SCIENCES↗

TOUGH3: A new efficient version of the TOUGH suite of multiphase flow and transport simulators

The TOUGH suite of nonisothermal multiphase flow and transport simulators has been updated by various developers over many years to address a vast range of challenging subsurface problems. The increasing complexity of the simulated processes as well as the growing size of model domains that need to be handled call for an improvement in the simulator's computational robustness and efficiency. Moreover, modifications have been frequently introduced independently, resulting in multiple versions of TOUGH that (1) led to inconsistencies in feature implementation and usage, (2) made code maintenance and development inefficient, and (3) caused confusion to users and developers. TOUGH3—a new base version of TOUGH—addresses these issues. It consolidates both the serial (TOUGH2 V2.1) and parallel (TOUGH2-MP V2.0) implementations, enabling simulations to be performed on desktop computers and supercomputers using a single code. New PETSc parallel linear solvers are added to the existing serial solvers of TOUGH2 and the Aztec solver used in TOUGH2-MP. The PETSc solvers generally perform better than the Aztec solvers in parallel and the internal TOUGH3 linear solver in serial. TOUGH3 also incorporates many new features, addresses bugs, and improves the flexibility of data handling. So due to the improved capabilities and usability, TOUGH3 is more robust and efficient for solving tough and computationally demanding problems in diverse scientific and practical applications related to subsurface flow modeling.

97 MATHEMATICS AND COMPUTING↗

Multichannel Analysis of Surface Waves Accelerated (MASWAccelerated): Software for efficient surface wave inversion using MPI and GPUs

Multichannel Analysis of Surface Waves (MASW) is a technique frequently used in geotechnical engineering and engineering geophysics to infer 1D layered models of seismic shear wave velocities in the top tens to hundreds of meters of the subsurface. We aim to accelerate MASW calculations by capitalizing on modern computer hardware available in the workstations of most engineers: multiple cores and graphics processing units (GPUs). We propose new parallel and GPU accelerated algorithms for computing 1D MASW inversion, and provide software implementations in C using Message Passing Interface (MPI) and CUDA. These algorithms take advantage of sparsity that arises in the problem, and the work balance between processes considers typical data trends. We compare our methods to an existing open source Matlab MASW tool. Our serial C implementation achieves a 2x speedup over the Matlab software, and we continue to see improvements by parallelizing the problem with MPI. Here we see nearly perfect strong and weak scaling for uniform data, and improve strong scaling for realistic data by repartitioning the problem to process mapping. By utilizing GPUs available on most modern workstations, we observe an additional 1.3x speedup over the serial C implementation on the first use of the method. We typically repeatedly evaluate theoretical dispersion curves as part of an optimization procedure, and on the GPU the kernel can be cached for faster reuse on later runs. We observe a 3.2x speedup on the cached GPU runs compared to the serial C runs. This work is the first open-source parallel or GPU-accelerated software tool for MASW imaging, and should enable geotechnical engineers to fully utilize all computer hardware at their disposal.

58 GEOSCIENCES↗

Extraction of Hydrological Proximity Measures from DEMs using Parallel Processing

Land surface topography is one of the most important terrain properties which impact hydrological, geomorphological, and ecological processes active on a landscape. In our previous efforts to develop a soil depth model based upon topographic and land cover variables, we extracted a set of hydrological proximity measures (HPMs) from a Digital Elevation Model (DEM) as potential explanatory variables for soil depth. These HPMs may also have other, more general modeling applicability in hydrology, geomorphology and ecology, and so are described here from a general perspective. The HPMs we derived are variations of the distance up to ridge points (cells with no incoming flow) and variations of the distance down to stream points (cells with a contributing area greater than a threshold), following the flow path. These HPMs were computed using the D-infinity flow model that apportions flow between adjacent neighbors based on the direction of steepest downward slope on the eight triangular facets constructed in a 3 x 3 grid cell window using the center cell and each pair of adjacent neighboring grid cells in turn. The D-infinity model typically results in multiple flow paths between 2 points on the topography, with the result that distances may be computed as the minimum, maximum or average of the individual flow paths. In addition, each of the HPMs, are calculated vertically, horizontally, and along the land surface. Previously, these HPMs were calculated using recursive serial algorithms which suffered from stack overflow problems when used to process large datasets, limiting the size of DEMs that could be analyzed using that method to approximately 7000 x 7000 cells. To overcome this limitation, we developed a message passing interface (MPI) parallel approach for calculating these HPMs. The parallel algorithms of the HPMs spatially partition the input grid into stripes which are each assigned to separate processes for computation. Each of those processes then uses a queue data structure to order the processing of cells so that each cell is visited only once and the cross-process communications that are a standard part of MPI are handled in an efficient manner. This parallel approach allows analysis of much larger DEMs as compared to the serial recursive algorithms. In this paper, we present the definitions of the HPMs, the serial and parallel algorithms used in their extraction and their potential applications in hydrology, geomorphology and ecology.

54 ENVIRONMENTAL SCIENCES↗

Interfraction and Respiratory Organ Motion During Conformal Radiotherapy in Gastric Cancer

Purpose: To quantify the interfraction and breathing organ motion during adjuvant radiotherapy for gastric cancer and assess organ stability in different breathing states. Methods and Materials: A planning computed tomography (CT) scan and serial study CT scans in free breathing, voluntary inhale and exhale were performed in weeks 1, 3, and 5 of radiotherapy for 22 resected gastric patients. All data sets were fused to register the vertebral bodies. The regions of interest (kidneys, stomach, liver, pancreas, celiac axis, and porta hepatis) or points of interest (POIs; left dome of diaphragm, splenic hilum) were identified. For each region of interest, a POI was automatically placed at the center of mass. The interfraction displacement and breathing amplitude were assessed in the craniocaudal (CC), anteroposterior (AP), and right-left (RL) directions. Results: Comparison of the serial free-breathing CT scans with the planning CT scan showed a median displacement of all POIs of 5.6, 2.2, and 1.8 mm in the CC, AP, and RL directions, respectively. Comparison of the serial inhale scans with the first inhale scan showed a displacement of 4.9, 2.6, and 1.8 mm in the CC, AP, and RL directions, respectively. The comparable values for the exhale scans were 5.1, 2.0, and 1.8 mm. The displacements of the organs were similar in the free breathing, inhale, and exhale states. The median respiratory amplitude in the CC, AP, and RL direction was 14, 4.8, and 1.7 mm, respectively. Conclusion: The median interfraction displacement of the POIs relative to the vertebral bodies was about 6 mm in the CC direction and 2 mm in the other directions. The planning target volume margins need to account for these shifts. Individual assessment of respiratory motion is recommended to identify patients with unusually large respiratory amplitude.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Fixman compensating potential for general branched molecules

The technique of constraining high frequency modes of molecular motion is an effective way to increase simulation time scale and improve conformational sampling in molecular dynamics simulations. However, it has been shown that constraints on higher frequency modes such as bond lengths and bond angles stiffen the molecular model, thereby introducing systematic biases in the statistical behavior of the simulations. Fixman proposed a compensating potential to remove such biases in the thermodynamic and kinetic properties calculated from dynamics simulations. Previous implementations of the Fixman potential have been limited to only short serial chain systems. In this paper, we present a spatial operator algebra based algorithm to calculate the Fixman potential and its gradient within constrained dynamics simulations for branched topology molecules of any size. Our numerical studies on molecules of increasing complexity validate our algorithm by demonstrating recovery of the dihedral angle probability distribution function for systems that range in complexity from serial chains to protein molecules. We observe that the Fixman compensating potential recovers the free energy surface of a serial chain polymer, thus annulling the biases caused by constraining the bond lengths and bond angles. The inclusion of Fixman potential entails only a modest increase in the computational cost in these simulations. We believe that this work represents the first instance where the Fixman potential has been used for general branched systems, and establishes the viability for its use in constrained dynamics simulations of proteins and other macromolecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Advanced manufacturing provides tailor-made solutions for crystallography with x-ray free-electron lasers

Serial crystallography at large facilities, such as x-ray free-electron lasers and synchrotrons, evolved as a powerful method for the high-resolution structural investigation of proteins that are critical for human health, thus advancing drug discovery and novel therapies. However, a critical barrier to successful serial crystallography experiments lies in the efficient handling of the protein microcrystals and solutions at microscales. Microfluidics are the obvious approach for any high-throughput, nano-to-microliter sample handling, that also requires design flexibility and rapid prototyping to deal with the variable shapes, sizes, and density of crystals. Here, we discuss recent advances in polymer 3D printing for microfluidics-based serial crystallography research and present a demonstration of emerging, large-scale, nano-3D printing approaches leading into the future of 3D sample environment and delivery device fabrication from liquid jet gas-dynamic virtual nozzles devices to fixed-target sample environment technology.

36 MATERIALS SCIENCE↗

Concurrent implicit spectral deferred correction scheme for low-Mach number combustion with detailed chemistry

We present a parallel multi-implicit time integration scheme for the advection-diffusion-reaction systems arising from the equations governing low-Mach number combustion with complex chemistry. Here, our strategy employs parallelisation across the method to accelerate the serial Multi-Implicit Spectral Deferred Correction (MISDC) scheme used to couple the advection, diffusion, and reaction processes. In our approach, the diffusion solves and the reaction solves are performed concurrently by different processors. Our analysis shows that the proposed parallel scheme is stable for stiff problems and that the sweeps converge to the fixed-point solution at a faster rate than with serial MISDC. We present numerical examples to demonstrate that the new algorithm is high-order accurate in time, and achieves a parallel speedup compared to serial MISDC.

97 MATHEMATICS AND COMPUTING↗

Multithreaded Algorithms for Maximum Matching in Bipartite Graphs

Abstract—We design, implement, and evaluate algorithms for computing a matching of maximum cardinality in a bipartite graph on multi-core and massively multithreaded computers. As computers with larger number of slower cores dominate the commodity processor market, the design of multithreaded algorithms to solve large matching problems becomes a necessity. Recent work on serial algorithms based on searching for augmenting paths for this problem have shown that their performance is sensitive to the order in which the vertices are processed for matching. In a multithreaded environment, imposing a serial order in which vertices are considered for matching would lead to loss of concurrency and performance. But this raises the question: Would parallel matching algorithms on multithreaded machines improve performance over a serial algorithm? We answer this question in the affirmative. We report efficient multithreaded implementations of two key algorithms (Hopcroft- Karp based on breadth-first-search, and Pothen-Fan based on depth-first-search) and their variants, combined with the Karp- Sipser initialization algorithm. We report extensive results and insights using three shared-memory platforms (a 48-core AMD Opteron, a 32-core Intel Nehalem, and a 128-processor Cray XMT) on a representative set of real-world and synthetic graphs. To the best of our knowledge, this is the first extensive study of augmentation-based parallel algorithms for bipartite cardinality matching.

Azad, Md Ariful↗