Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear programming problem”

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 1,027 records · Page 57

Identification of Linear and Nonlinear Aerodynamic Impulse Responses Using Digital Filter Techniques

This paper discusses the mathematical existence and the numerically-correct identification of linear and nonlinear aerodynamic impulse response functions. Differences between continuous-time and discrete-time system theories, which permit the identification and efficient use of these functions, will be detailed. Important input/output definitions and the concept of linear and nonlinear systems with memory will also be discussed. It will be shown that indicial (step or steady) responses (such as Wagner's function), forced harmonic responses (such as Tbeodorsen's function or those from doublet lattice theory), and responses to random inputs (such as gusts) can all be obtained from an aerodynamic impulse response function. This paper establishes the aerodynamic impulse response function as the most fundamental, and, therefore, the most computationally efficient, aerodynamic function that can be extracted from any given discrete-time, aerodynamic system. The results presented in this paper help to unify the understanding of classical two-dimensional continuous-time theories with modem three-dimensional, discrete-time theories. First, the method is applied to the nonlinear viscous Burger's equation as an example. Next the method is applied to a three-dimensional aeroelastic model using the CAP-TSD (Computational Aeroelasticity Program - Transonic Small Disturbance) code and then to a two-dimensional model using the CFL3D Navier-Stokes code. Comparisons of accuracy and computational cost savings are presented. Because of its mathematical generality, an important attribute of this methodology is that it is applicable to a wide range of nonlinear, discrete-time problems.

Silva, Walter A.↗

Identification of Linear and Nonlinear Aerodynamic Impulse Responses Using Digital Filter Techniques

This paper discusses the mathematical existence and the numerically-correct identification of linear and nonlinear aerodynamic impulse response functions. Differences between continuous-time and discrete-time system theories, which permit the identification and efficient use of these functions, will be detailed. Important input/output definitions and the concept of linear and nonlinear systems with memory will also be discussed. It will be shown that indicial (step or steady) responses (such as Wagner's function), forced harmonic responses (such as Theodorsen's function or those from doublet lattice theory), and responses to random inputs (such as gusts) can all be obtained from an aerodynamic impulse response function. This paper establishes the aerodynamic impulse response function as the most fundamental, and, therefore, the most computationally efficient, aerodynamic function that can be extracted from any given discrete-time, aerodynamic system. The results presented in this paper help to unify the understanding of classical two-dimensional continuous-time theories with modern three-dimensional, discrete-time theories. First, the method is applied to the nonlinear viscous Burger's equation as an example. Next the method is applied to a three-dimensional aeroelastic model using the CAP-TSD (Computational Aeroelasticity Program - Transonic Small Disturbance) code and then to a two-dimensional model using the CFL3D Navier-Stokes code. Comparisons of accuracy and computational cost savings are presented. Because of its mathematical generality, an important attribute of this methodology is that it is applicable to a wide range of nonlinear, discrete-time problems.

Silva, Walter A.↗

Comparison of First-Come First-Served and Optimization Based Scheduling Algorithms for Integrated Departure and Arrival Management

Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA) are investigating scheduling algorithms that will be a part of an integrated arrival and departure management system. Inha University, one of the Korean collaborators of KARI, developed an Extended First-Come First-Served (EFCFS) algorithm that is robust and efficient. However, since the EFCFS algorithm sequentially computes the schedule based on priority, the end results may not be optimal for system efficiency. The approach based on Mixed Integer Linear Programming (MILP) originally developed by NASA and modified by KARI is known to produce better schedules at the expense of computational cost. In this paper, the two different scheduling approaches are compared using common traffic scenarios and constraints at Incheon International Airport. Capabilities to apply weight class based wake turbulence runway separation minima and Miles-in-Trail (MIT) restrictions at selected meter fixes are added to the previously developed EFCFS scheduler. Based on historic data, 40 departures and 20 arrivals are chosen in a one-hour period and 100 scenarios were created by randomly assigning gate numbers, gate departure times, and runway landing times. With the current runway separation requirements, MILP resulted in about ten to twenty percent smaller average delays depending on the constraints. With artificially increased separation minima, the difference between MILP and EFCFS became more noticeable. However, the EFCFS was about ten times faster with smaller variations among different scenarios and constraints. The comparison suggests that the MILP-based algorithm has a small advantage at the current traffic level; however, has potential to be more effective in higher demand or severe weather situations. The EFCFS algorithm may be better suited for real-time applications or investigating larger scale scheduling problems.

air traffic optimization↗

MO-F-CAMPUS-T-04: Implementation of a Standardized Monthly Quality Check for Linac Output Management in a Large Multi-Site Clinic

Purpose: This work is to investigate the feasibility of a standardized monthly quality check (QC) of LINAC output determination in a multi-site, multi-LINAC institution. The QC was developed to determine individual LINAC output using the same optimized measurement setup and a constant calibration factor for all machines across the institution. Methods: The QA data over 4 years of 7 Varian machines over four sites, were analyzed. The monthly output constancy checks were performed using a fixed source-to-chamber-distance (SCD), with no couch position adjustment throughout the measurement cycle for all the photon energies: 6 and 18MV, and electron energies: 6, 9, 12, 16 and 20 MeV. The constant monthly output calibration factor (Nconst) was determined by averaging the machines’ output data, acquired with the same monthly ion chamber. If a different monthly ion chamber was used, Nconst was then re-normalized to consider its different NDW,Co-60. Here, the possible changes of Nconst over 4 years have been tracked, and the precision of output results based on this standardized monthly QA program relative to the TG-51 calibration for each machine was calculated. Any outlier of the group was investigated. Results: The possible changes of Nconst varied between 0–0.9% over 4 years. The normalization of absorbed-dose-to-water calibration factors corrects for up to 3.3% variations of different monthly QA chambers. The LINAC output precision based on this standardized monthly QC relative to the TG-51 output calibration is within 1% for 6MV photon energy and 2% for 18MV and all the electron energies. A human error in one TG-51 report was found through a close scrutiny of outlier data. Conclusion: This standardized QC allows for a reasonably simplified, precise and robust monthly LINAC output constancy check, with the increased sensitivity needed to detect possible human errors and machine problems.

60 APPLIED LIFE SCIENCES↗

Probabilistic system identification in the time domain

The objective of system identification is to determine reliable dynamical models of a structure by systematically using its measured excitation and response. It brings together in an integrated fashion, experimental, analytical, and computational techniques in structural dynamics. Areas of application for system identification include the following: (1) Model Evaluation--assessing assumptions (linearity and equivalent viscous damping) and techniques (finite-element modeling) used to construct theoretical models of a structure; (2) Model Improvement--updating of a theoretical model to enable more accurate response predictions for possible future loads on the structure, or for control of the structure; (3) Empirical Modelling--developing empirical relationships (nonlinear models) or empirical parameter values (modal damping) because the present state of the art does not provide theoretical results; and (4) Damage Detection and Assessment--continual or episodic updating of a structural model through vibration monitoring to detect and locate any structural damage. It can be argued that since the construction or modification of models using test data is subject to inherent uncertainties, the above problems should be properly treated within a Bayesian probabilistic framework. Such a methodology is presented which allows the precision of the estimates of the model parameters to be computed. It also leads to a guiding principle in applications. Namely, when selecting a single model from a given class of models, one should take the most probable model in the class based on the experimental data. Practical applications of this principle are given which are based on the utilization of measured seismic motions in large civil structures. Examples include the application of a computer program MODE-ID to identify modal properties directly from seismic excitation and response time histories from a nine-story steel-frame building at JPL and from a freeway overpass bridge.

Beck, James L.↗

Multiresolution and Explicit Methods for Vector Field Analysis and Visualization

We first report on our current progress in the area of explicit methods for tangent curve computation. The basic idea of this method is to decompose the domain into a collection of triangles (or tetrahedra) and assume linear variation of the vector field over each cell. With this assumption, the equations which define a tangent curve become a system of linear, constant coefficient ODE's which can be solved explicitly. There are five different representation of the solution depending on the eigenvalues of the Jacobian. The analysis of these five cases is somewhat similar to the phase plane analysis often associate with critical point classification within the context of topological methods, but it is not exactly the same. There are some critical differences. Moving from one cell to the next as a tangent curve is tracked, requires the computation of the exit point which is an intersection of the solution of the constant coefficient ODE and the edge of a triangle. There are two possible approaches to this root computation problem. We can express the tangent curve into parametric form and substitute into an implicit form for the edge or we can express the edge in parametric form and substitute in an implicit form of the tangent curve. Normally the solution of a system of ODE's is given in parametric form and so the first approach is the most accessible and straightforward. The second approach requires the 'implicitization' of these parametric curves. The implicitization of parametric curves can often be rather difficult, but in this case we have been successful and have been able to develop algorithms and subsequent computer programs for both approaches. We will give these details along with some comparisons in a forthcoming research paper on this topic.

Source record↗

The Electronic Documentation Project in the NASA mission control center environment

NASA's space programs like many other technical programs of its magnitude is supported by a large volume of technical documents. These documents are not only diverse but also abundant. Management, maintenance, and retrieval of these documents is a challenging problem by itself; but, relating and cross-referencing this wealth of information when it is all on a medium of paper is an even greater challenge. The Electronic Documentation Project (EDP) is to provide an electronic system capable of developing, distributing and controlling changes for crew/ground controller procedures and related documents. There are two primary motives for the solution. The first motive is to reduce the cost of maintaining the current paper based method of operations by replacing paper documents with electronic information storage and retrieval. And, the other is to improve the efficiency and provide enhanced flexibility in document usage. Initially, the current paper based system will be faithfully reproduced in an electronic format to be used in the document viewing system. In addition, this metaphor will have hypertext extensions. Hypertext features support basic functions such as full text searches, key word searches, data retrieval, and traversal between nodes of information as well as speeding up the data access rate. They enable related but separate documents to have relationships, and allow the user to explore information naturally through non-linear link traversals. The basic operational requirements of the document viewing system are to: provide an electronic corollary to the current method of paper based document usage; supplement and ultimately replace paper-based documents; maintain focused toward control center operations such as Flight Data File, Flight Rules and Console Handbook viewing; and be available NASA wide.

Wang, Lui↗

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parametric Thermal Soak Model for Earth Entry Vehicles

The analysis and design of an Earth Entry Vehicle (EEV) is multidisciplinary in nature, requiring the application many disciplines. An integrated tool called Multi Mission System Analysis for Planetary Entry Descent and Landing or M-SAPE is being developed as part of Entry Vehicle Technology project under In-Space Technology program. Integration of a multidisciplinary problem is a challenging task. Automation of the execution process and data transfer among disciplines can be accomplished to provide significant benefits. Thermal soak analysis and temperature predictions of various interior components of entry vehicle, including the impact foam and payload container are part of the solution that M-SAPE will offer to spacecraft designers. The present paper focuses on the thermal soak analysis of an entry vehicle design based on the Mars Sample Return entry vehicle geometry and discusses a technical approach to develop parametric models for thermal soak analysis that will be integrated into M-SAPE. One of the main objectives is to be able to identify the important parameters and to develop correlation coefficients so that, for a given trajectory, can estimate the peak payload temperature based on relevant trajectory parameters and vehicle geometry. The models are being developed for two primary thermal protection (TPS) materials: 1) carbon phenolic that was used for Galileo and Pioneer Venus probes and, 2) Phenolic Impregnated Carbon Ablator (PICA), TPS material for Mars Science Lab mission. Several representative trajectories were selected from a very large trade space to include in the thermal analysis in order to develop an effective parametric thermal soak model. The selected trajectories covered a wide range of heatload and heatflux combinations. Non-linear, fully transient, thermal finite element simulations were performed for the selected trajectories to generate the temperature histories at the interior of the vehicle. Figure 1 shows the finite element model that was used for the simulations. The results indicate that it takes several hours for the thermal energy to soak into the interior of the vehicle and achieve maximum payload temperatures. In addition, a strong correlation between the heatload and peak payload container temperature is observed that will help establishing the parametric thermal soak model.

Agrawal, Parul↗

Generalized Reference Targeting for Spaceflight

For spaceflight programs to achieve some of the aggressive exploration initiatives such as visiting and landing on other celestial bodies, rendezvousing with other orbiting vehicles, and ultimately returning crew safely to Earth, an assortment of targeting algorithms to compute the necessary burns to strategically maneuver a spacecraft to a variety of destinations are required. Numerous examples exist, but rather than creating and implementing multiple targeting solutions, is it possible to have a general targeting model that can accommodate a variety of applications? Originally motivated for mission design and analysis purposes, this paper outlines a generalized reference targeting algorithm for spaceflight that may also have applications in on-orbit flight software. It accommodates arbitrary flight dynamics and both impulsive and finite burns for either absolute or relative targeting applications. It also allows for an arbitrary number of targeting design parameters such as multiple discrete correction burns or finite thrust parameters to satisfy numerous combinations of targeting constraints that can have fixed or variable time epochs. Given a reference trajectory, this targeting technique provides a general framework to quickly solve an assortment of targeting problems that may be well-defined, over-determined, or under-determined while naturally producing metrics providing insight into the controllability for a given problem formulation. Due to the derivation, speed, and accuracy of the algorithm, it lends to supporting rapid linear covariance analysis and robust trajectory design applications for a variety of flight phases such as rendezvous and docking, cislunar transfer, interplanetary flight, orbit maintenance, de-orbit, and powered descent and landing.

Targeting↗

Optimization of Energy Storage System Economics and Controls by Incorporating Battery Degradation Costs in REopt

The use of stationary electrochemical energy storage systems utilizing lithium-ion batteries has increased rapidly as the production scale and price for lithium-ion batteries has decreased. These energy storage systems are crucial for maintaining grid resiliency, especially for grids operating with high penetration of renewable energy generation assets or for with a variety of distributed energy generation and storage systems. One challenging factor for the development of battery energy storage systems is estimating the proper sizing, in terms of both power and energy, that minimizes total costs over the lifetime of the systems; this calculation is difficult in simple cases, where a battery is costed independently, but is extremely challenging when building loads and electrical generation by photovoltaic resources are also considered. REopt is a techoeconomic optimization tool developed by NREL to address these challenges. Previously, battery degradation has been priced by simply assuming a 10-year replacement schedule for battery systems. However, this does not account for varying degradation trends observed across real-world batteries, or allow for batteries to be operated in a degradation-aware manner that optimizes battery dispatch based on operating costs. This work incorporates a battery life model into REopt. This battery life model is simple, so that it may be solvable within the constrains of a mixed-integer linear optimization problem, but is fit to accelerated aging data recorded in the lab. To achieve the best possible accuracy for lifetime estimates given these constraints, parameters for the battery life model in REopt are estimated by fitting 20-year simulations of battery life after identifying state-space battery degradation model from accelerated aging data. Comparisons of battery life predicted in REopt and from the state-space battery degradation model to ensure validity of lifetime estimates made by REopt. Battery life and cost is optimized by controlling three decision to minimize system life cost: battery sizing, daily state-of-charge, and daily energy-throughput. The cost of battery degradation as a function of these control variables is then estimated assuming two possible maintenance strategies: replacement, where the entire battery system is replaced if cell reach an end-of-life capacity threshold; and augmentation, which establishes a fund to pay for continual purchase of new batteries to maintain the initial energy capacity of the system. These two strategies offer conservative (for replacement) and optimistic (for augmentation) bounds for total system cost. The degradation cost incurred by these strategies is then used to control battery dispatch decisions, operating the battery in a degradation-aware manner that maximizes battery lifetime while also providing energy when favorable. Because the mixed-integer linear program has perfect foresight of future energy needs, batteries with degradation costs are always operated using 'just-in-time' charging, which is unrealistic, as no energy is left in the storage system to perform other energy services or to serve as emergency back-up power. To combat this, an inequality constraint on the average annual state-of-charge is imposed, and the sensitivity of system cost to average stored energy, e.g., the cost of system resiliency, can be quantified. Analysis of results has several conclusions, for instance, oversizing of battery storage systems is not a cost burden when battery storage is an optimal solution, as any additional battery capacity can simply be utilized to avoid costs of purchasing energy from a utility.

battery↗

Status of LDEF ionizing radiation measurements and analysis

At this symposium significant new data and analyses were reported in cosmic ray research, radiation dosimetry, induced radioactivity, and radiation environment modeling. Measurements of induced radioactivity and absorbed dose are nearly complete, but much analysis and modeling remains. Measurements and analyses of passive nuclear track detectors (PNTD), used to derive the cosmic ray composition and spectra, and linear energy transfer (LET) spectra, are only a few percent complete, but important results have already emerged. As one might expect at this stage of the research, some of the new information has produced questions rather than answers. Low-energy heavy nuclei detected by two experiments are not compatible with known solar or cosmic components. Various data sets on absorbed dose are not consistent, and a new trapped proton environment model does not match the absorbed dose data. A search for cosmogenic nuclei other than Be-7 on Long Duration Exposure Facility (LDEF) surfaces has produced an unexpected result, and some activation data relating to neutrons is not yet understood. Most of these issues will be resolved by the analysis of further experiment data, calibrations, or the application of the large LDEF data set that offers alternate data or analysis techniques bearing on the same problem. The scope of the papers at this symposium defy a compact technical summary. I have attempted to group the new information that I noted into the following groups: induced radioactivity; absorbed dose measurements; LET spectra and heavy ion dosimetry; environment modeling and three dimensional shielding effects; cosmogenic nuclei; and cosmic rays and other heavy ions. The papers generally are expository and have excellent illustrations, and I refer to their figures rather than reproduce them here. The general program and objectives of ionizing radiation measurements and analyses on LDEF has been described previously.

Parnell, Thomas A.↗

Approximating a linear multiplicative objective in watershed management optimization

Implementing management practices in a cost-efficient manner is critical for regional efforts to reduce the amount of pollutants entering the Chesapeake Bay. We study the problem of selecting a subset of practices that minimizes pollutant load—subject to budgetary and environmental constraints—as simulated in a widely used regulatory watershed model. Mimicking the computation of pollutant load in the regulatory model, we formulate this problem as a continuous optimization model with a linear multiplicative objective function and linear constraints. To lay the groundwork for incorporating additional stakeholder requirements in the future, especially those that would require integer variables, we present and study a continuous linear optimization model that approximates the nonlinear model. The linear model, which requires an exponential number of variables, arises naturally as an alternative model for the same underlying physical process. We examine the theoretical behavior of these optimization models and investigate restrictions of the linear model to handle its large number of variables. Through extensive computational tests on real and randomly generated instances, we demonstrate that the linear model and its restrictions provide optimal solutions close to those of the nonlinear model in practice, despite poor approximation properties in the worst case. We conclude that the linear model—together with our approach to handling its large number of variables—provides a viable framework from which to extend the optimization model to better meet the needs of the Chesapeake Bay watershed management stakeholders.

54 ENVIRONMENTAL SCIENCES↗

WE-D-BRA-01: FEATURED PRESENTATION and BEST IN PHYSICS (THERAPY): Predicting Potentially Problematic VMAT Treatment Plans Before Patient Specific QA Measurements

Purpose: Several promising IMRT QA tools have been developed in recent years to combat problems found in the lack of sensitivity in planar dose measurements analyzed using consensus gamma analysis criteria. The increased complexity and added information with such devices adds not only increased time, but new challenges in determining endpoints for pass/fail criteria. Using a large cohort of previously measured planar IMRT QA data, it may be possible to correlate potentially problematic plans with calculated plan metrics that can be done a priori, such that these tools can be used only in clinically relevant situations. Methods: 90 previously measured, clinically delivered VMAT plans were exported in DICOM RT format. Using a Matlab program, plan metrics were computed based on a previously developed set of equations (Du et al. 2014). These metrics included MU-weighted beam irregularity, which quantifies an MLC shape’s deviation from that of a circle. Machine delivery parameters such as MU delivered per degree and leaf movement in millimeters per MU were also calculated. Based on a previous analysis of 394 IMRT QA measurements, a “failing” plan was defined as one with less than 85% gamma pass rate when computed at 1% dose difference and 2 mm distance to agreement; 16 of the 90 plans were identified as failing Results: A ROC curve was generated with an AUC of 0.9409. All 16 outliers were detected with a specificity of 85.1% when using a threshold value based on a linear combination of the MU-weighted plan irregularity and the leaf speed in mm/degree (average MU delivered per degree multiplied by average leaf movement in mm per MU). Conclusion: This data supports that potentially problematic VMAT plans can possibly be predicted before measurement by assessing the MU-weighted irregularity of the MLC shapes combined with the averaged leaf speed of the MLC.

60 APPLIED LIFE SCIENCES↗

Generative Representations for Automated Design of Robots

A method of automated design of complex, modular robots involves an evolutionary process in which generative representations of designs are used. The term generative representations as used here signifies, loosely, representations that consist of or include algorithms, computer programs, and the like, wherein encoded designs can reuse elements of their encoding and thereby evolve toward greater complexity. Automated design of robots through synthetic evolutionary processes has already been demonstrated, but it is not clear whether genetically inspired search algorithms can yield designs that are sufficiently complex for practical engineering. The ultimate success of such algorithms as tools for automation of design depends on the scaling properties of representations of designs. A nongenerative representation (one in which each element of the encoded design is used at most once in translating to the design) scales linearly with the number of elements. Search algorithms that use nongenerative representations quickly become intractable (search times vary approximately exponentially with numbers of design elements), and thus are not amenable to scaling to complex designs. Generative representations are compact representations and were devised as means to circumvent the above-mentioned fundamental restriction on scalability. In the present method, a robot is defined by a compact programmatic form (its generative representation) and the evolutionary variation takes place on this form. The evolutionary process is an iterative one, wherein each cycle consists of the following steps: 1. Generative representations are generated in an evolutionary subprocess. 2. Each generative representation is a program that, when compiled, produces an assembly procedure. 3. In a computational simulation, a constructor executes an assembly procedure to generate a robot. 4. A physical-simulation program tests the performance of a simulated constructed robot, evaluating the performance according to a fitness criterion to yield a figure of merit that is fed back into the evolutionary subprocess of the next iteration. In comparison with prior approaches to automated evolutionary design of robots, the use of generative representations offers two advantages: First, a generative representation enables the reuse of components in regular and hierarchical ways and thereby serves a systematic means of creating more complex modules out of simpler ones. Second, the evolved generative representation may capture intrinsic properties of the design problem, so that variations in the representations move through the design space more effectively than do equivalent variations in a nongenerative representation. This method has been demonstrated by using it to design some robots that move, variously, by walking, rolling, or sliding. Some of the robots were built (see figure). Although these robots are very simple, in comparison with robots designed by humans, their structures are more regular, modular, hierarchical, and complex than are those of evolved designs of comparable functionality synthesized by use of nongenerative representations.

Homby, Gregory S.↗

2012 Joint Research Target (JRT) Final Report

The report summarizes: [1] Diagnostic upgrades and analysis improvements that support the JRT; [2] Descriptions of new experiments and a brief summary of findings; [3] New analysis of previous experiments; [4] Plans for further data analysis and recommendations for further work; [5] Scientific publications that are derived from or contributed directly to the JRT. The report is organized as follows: Section 1: Describes inter-machine comparisons that were facilitated by the JRT focus. Similarities and differences found on the different facilities are outlined, and plans for additional analysis of data and supporting simulations are described.Section 2: Reviews diagnostic development, experiments and results from C-Mod. C-Mod dedicated 13.1 run days to the JRT divided among 10 experimental proposals. These were organized into three general thrust areas that represent distinct experimental approaches to realizing the regimes called for in the JRT description. Initial comparisons with linear and nonlinear simulation have been carried out for these experiments, and plans for an extensive campaign of analysis have been outlined. Section 3: Reviews results from DIII-D including new experiments, detailed comparisons of simulations to previously collected data and connections between the new work and past research. Four experimental days were dedicated to the JRT in 2012. These included studies of L-modes, H-modes and QH-modes. Section 4: Summarizes new analysis of data collected before the NSTX shutdown. The work focuses on the roles of low and high-k turbulence; collisionality scans and impurity particle transport.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

LOGISTIC FUNCTION PROFILE FIT: A least-squares program for fitting interface profiles to an extended logistic function

The extended logistic function provides a physically reasonable description of interfaces such as depth profiles or line scans of surface topological or compositional features. It describes these interfaces with the minimum number of parameters, namely, position, width, and asymmetry. Logistic Function Profile Fit (LFPF) is a robust, least-squares fitting program in which the nonlinear extended logistic function is linearized by a Taylor series expansion (equivalent to a Newton-Raphson approach) with no apparent introduction of bias in the analysis. The program provides reliable confidence limits for the parameters when systematic errors are minimal and provides a display of the residuals from the fit for the detection of systematic errors. The program will aid researchers in applying ASTM E1636-10, 'Standard practice for analytically describing sputter-depth-profile and linescan-profile data by an extended logistic function,' and may also prove useful in applying ISO 18516: 2006, 'Surface chemical analysis-Auger electron spectroscopy and x-ray photoelectron spectroscopy-determination of lateral resolution.' Examples are given of LFPF fits to a secondary ion mass spectrometry depth profile, an Auger surface line scan, and synthetic data generated to exhibit known systematic errors for examining the significance of such errors to the extrapolation of partial profiles.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SEGUID v2: Extending SEGUID checksums for circular, linear, single- and double-stranded biological sequences

Background Synthetic biology involves combining different DNA fragments, each containing functional biological parts, to address specific problems. Fundamental gene-function research often requires cloning and propagating DNA fragments, such as those from the iGEM Parts Registry or Addgene, typically distributed as circular plasmids. Addgene’s repository alone offers around 150,000 plasmids. To ensure data integrity, cryptographic checksums can be calculated for the sequences. Each sequence has a unique checksum, making checksums useful for validation and quick lookups of associated annotations. For example, the SEGUID checksum uniquely identifies protein sequences with a 27-character string. Objectives The original SEGUID, while effective for protein sequences and single-stranded DNA (ssDNA), is not suitable for circular DNA since there is no natural starting position nor for double-stranded DNA (dsDNA) since two separate sequences are present. Challenges include how to uniquely represent linear dsDNA, circular ssDNA, and circular dsDNA. To meet these needs, we propose SEGUID v2, which extends the original SEGUID to handle additional types of sequences. Conclusions SEGUID v2 produces orientation and rotation invariant checksums for single-stranded, double-stranded, possibly staggered, linear, and circular DNA and RNA sequences. Customizable alphabets allow for other types of sequences. In contrast to the original SEGUID, which uses Base64, SEGUID v2 uses Base64url to encode the SHA-1 hash. This ensures SEGUID v2 checksums can be used as-is in filenames, regardless of platform, and in URLs, with minimal friction. Availability SEGUID v2 is readily available for major programming languages, distributed under the MIT license. JavaScript package seguid is available on npm, Python package seguid on PyPi, R package seguid on CRAN, and a Tcl script on GitHub. These tools, along with documentation, examples, and an online SEGUID Calculator , can be found at https://www.seguid.org .

Pereira, Humberto↗