Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal Allocation”

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 343 records · Page 19

Use of a New Analytical Model To Match Production Data and Identify Opportunities To Maximize Well Productivity in the Tuscaloosa Marine Shale Reservoir

The low productivity of the oil wells in the Tuscaloosa Marine Shale (TMS) Trend, located in Louisiana and Mississippi, is a mystery. Production data from 55 wells in the TMS Trend were analyzed to identify possible means of enhancing well productivity. The -1/2 slope in a log–log plot for reservoir linear flow (RLF) was observed for some wells, but not all, and the -1 slope for boundary–dominated flow (BDF) has not been seen in the past 5 years of production. The behavior of the TMS wells is attributed to the ultralow permeability of the TMS matrix and the decline of fracture conductivity, both of which delay the BDF. On the basis of the concept of the distance of investigation, derived from the radius–of–investigation concept, the matrix permeability of the seven TMS wells was estimated to be between 34 and 65 nd, with an average of 51 nd. A new mathematical model for production decline of multifractured horizontal wells was developed taking into consideration the time–dependent fracture conductivity during the BDF period. This model fits TMS–well production data, with an average error of 6.12% and an R2 value of 0.96. Assuming constant matrix permeability, fitting the new model to the production data in the BDF period gives a rate of fracture–conductivity decline of between 0.20 and 0.74% per month. The new mathematical model reveals opportunities to optimize well completion to enhance well productivity in the TMS Trend. For a given amount of fracture proppant allocated to a well, the shortest possible fracture spacing should be used to maximize well productivity. If the number of fractures is fixed as a constraint of well completion design, well productivity is inversely proportional to the square root of fracture spacing (i.e., if the fracture spacing is shortened by fourfold, well productivity is expected to double). If the horizontal wellbore length is fixed as a constraint of well completion, well productivity is inversely proportional to fracture spacing (i.e., if the fracture spacing is shortened by 50%, well productivity is expected to double).

Engineering↗

Function of phloem-borne information macromolecules in integrating plant growth & development

Studies on higher plants have revealed the operation of cell-to-cell and long-distance communication networks that mediate the transport of information macromolecules, such as proteins and RNA. Based on the findings from this DOE-funded project and results from other groups, it is now well established that the enucleate sieve tube system of the angiosperms contains a complex set of proteins including RNA binding proteins as well as a unique population of RNA molecules, comprised of both mRNA and small RNA species. Hetero-grafting experiments demonstrated that delivery of such RNA molecules, into the scion, is highly correlated with changes in developmental phenotypes. Furthermore, over the course of this project, our studies showed that plasmodesmata and the phloem are intimately involved in the local and systemic spread of sequence-specific signals that underlie gene silencing in plants. Major advances were also made in elucidating the underlying mechanisms that operate to mediate the selective entry and exit of proteins and RNA into and out of the phloem translocation stream. Our pioneering studies identified the first plant protein with the capacity to both bind specifically to small RNA molecules (si-RNA) and mediate in the cell-to-cell movement of such siRNA. Importantly, studies conducted with support from this DOE program also yielded a detailed characterization of the first phloem-mobile RNP complex isolated from pumpkin, namely the CmRBP50-RNP complex. This RNP complex was shown to bind, in a sequence-specific manner, to a set of transcripts encoding for transcription factors. The remarkable stability of this CmRBP50-RNP complex allows for long-distance delivery of bound transcripts from mature leaves into developing tissues and organs. Knowledge gained from this project can be used to exert control over the long-distance signaling networks used by plants to integrate their physiological and developmental programs at a whole plant level. Eventually, this information will aid in the engineering of elite plant lines with optimal traits for plant growth under non-ideal conditions, enhanced biomass and/or seed yield, and directed carbon allocation for efficient and sustainable biofuels production.

59 BASIC BIOLOGICAL SCIENCES↗

Regulation of Lignin Biosynthesis and Its Role in Growth-Defense Tradeoffs

Plant growth-defense tradeoffs are fundamental for optimizing plant performance and fitness in a changing biotic/abiotic environment. This process is thought to involve readjusting resource allocation to different pathways. It has been frequently observed that among secondary cell wall components, alteration in lignin biosynthesis results in changes in both growth and defense. How this process is regulated, leading to growth or defense, remains largely elusive. In this article, we review the canonical lignin biosynthesis pathway, the recently discovered tyrosine shortcut pathway, and the biosynthesis of unconventional C-lignin. We summarize the current model of the hierarchical transcriptional regulation of lignin biosynthesis. Moreover, the interface between recently identified transcription factors and the hierarchical model are also discussed. We propose the existence of a transcriptional co-regulation mechanism coordinating energy allowance among growth, defense and lignin biosynthesis.

59 BASIC BIOLOGICAL SCIENCES↗

A Review of Sociotechnical Approaches for Nuclear Power Plant Modernization

The current United States nuclear power plant fleet is in need of transforming the way work is performed to remain competitive with other electricity-generating sources. The use of new digital technologies can be applied to significantly reduce operating and maintenance costs. Recent research by the United States Department of Energy Light Water Reactor Sustainability Program has identified new opportunities to leverage advanced digital technologies to transform the way work is performed at existing plants. However, to ensure that the capabilities of people and advanced digital technologies are jointly optimized, a sociotechnical approach should be considered. This work explores recently introduced sociotechnical approaches to address the function allocation and data visualization considerations in the integration of new digital technologies to ensure safety, reliability, and maximizing the capabilities of proposed technological solutions that ensure the economic viability of the existing United States nuclear power plant fleet.

99 GENERAL AND MISCELLANEOUS↗

Task allocation in geo-distributed cyber-physical systems - 256

This paper studies the task allocation algorithm for a distributed test facility (DTF), which aims to assemble geo-distributed cyber (software) and physical (hardware in the loop) components into a prototype cyber-physical system (CPS). This allows low cost testing on an early conceptual prototype (ECP) of the ultimate CPS (UCPS) to be developed. The DTF provides an instrumentation interface for carrying out reliability experiments remotely such as fault propagation analysis and in-situ testing of hardware and software components in a simulated environment. Unfortunately, the geo-distribution introduces an overhead that is not inherent to the UCPS, i.e. a significant time delay in communication that threatens the stability of the ECP and is not an appropriate representation of the behavior of the UCPS. This can be mitigated by implementing a task allocation algorithm to find a suitable configuration and assign the software components to appropriate computational locations, dynamically. This would allow the ECP to operate more efficiently with less probability of being unstable due to the delays introduced by geo-distribution. The task allocation algorithm proposed in this work uses a Monte Carlo approach along with Dynamic Programming to identify the optimal network configuration to keep the time delays to a minimum. (authors)

97 MATHEMATICS AND COMPUTING↗

Microelectromechanical systems integrating molecular spin crossover actuators

Silicon MEMS cantilevers coated with a 200 nm thin layer of the molecular spin crossover complex [Fe(H{sub 2}B(pz){sub 2}){sub 2}(phen)] (H{sub 2}B(pz){sub 2} = dihydrobis(pyrazolyl)borate and phen = 1,10-phenantroline) were actuated using an external magnetic field and their resonance frequency was tracked by means of integrated piezoresistive detection. The light-induced spin-state switching of the molecules from the ground low spin to the metastable high spin state at 10 K led to a well-reproducible shift of the cantilever's resonance frequency (Δf{sub r} = −0.52 Hz). Control experiments at different temperatures using coated as well as uncoated devices along with simple calculations support the assignment of this effect to the spin transition. This latter translates into changes in mechanical behavior of the cantilever due to the strong spin-state/lattice coupling. A guideline for the optimization of device parameters is proposed so as to efficiently harness molecular scale movements for large-scale mechanical work, thus paving the road for nanoelectromechanical systems (NEMS) actuators based on molecular materials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Novel Secondary Frequency Regulation with Optimal Priority Selection of AGC Contributions

Automatic generation control (AGC) is used to maintain acceptable frequencies during operation owing to fluctuations in load and variable resources. In conventional industry applications, the AGC signal is allocated to each generator according to the predispatched frequency regulation capacity or the order of economic efficiency. However, with the increasing integration of inverter-based resources (IBRs), the retirement of conventional synchronous generators (SGs) has posed new challenges to frequency control schemes because fewer of them are optional for AGC regulation. In this paper, we propose a novel model predictive control (MPC)-based frequency regulation model to reduce control cost and ensure stability, by considering different critical dynamic factors when optimally selecting the AGC units. The proposed control model – developed in a general form – comprehensively embeds characteristics such as generator ramping rates, reserve capacity, and operation cost. The model predictive control–based two-timescale AGC scheme enhances the capability of immunizing the power disturbance from types of resources by coordinating the control signals between faster IBRs and slower SGs. The case study’s proposed model is verified to be effective in synergistically enforcing different dynamic properties of AGC units into the frequency regulation scheme.

Jiang, Sufan [The University of North Carolina at ↗

Sum Reduction with OpenMP Offload on NVIDIA Grace-Hopper System

We evaluate the performance of the baseline and optimized reductions in OpenMP on an NVIDIA Grace-Hopper system. We explore the impacts of the number of teams, the number of elements to sum per loop iteration, and simultaneous execution on the central-processing unit (CPU) and the GPU in the unified memory (UM) mode upon the reduction performance. The experimental results show that the optimized reductions are 6.120X to 20.906X faster than the baselines on the GPU, and their efficiency ranges from 89% to 95% of the theoretical GPU memory bandwidth. Depending on where an input array is allocated in the program when co-running the reduction on the CPU and GPU in the UM mode, the average speedup over the GPU-only execution is approximately 2.484 or 1.067, and the speedup of the optimized reductions over the baseline reductions ranges from 0.996 to 10.654 or from 0.998 to 6.729.

Jin, Zheming↗

Data for Greenhouse Gas Accounting Procedures in Low Carbon Fuel Policies Overlook the Spatial Variability of Miscanthus-Derived Sustainable Aviation Fuel

Low carbon fuel policies such as the U.S. Renewable Fuel Standard (RFS), Canada Clean Fuel Regulations (CFR), and California Low Carbon Fuel Standard (LCFS) as well as the 45Z tax credit are intended to reduce greenhouse gas (GHG) emissions from transportation. Cellulosic feedstocks, optimized biorefineries, and favorable farming locations can significantly reduce biofuel carbon intensity (CI). Despite advances in field-to-fuel GHG monitoring and flexibility in resource allocation within biorefineries (e.g., governing net electricity production), rigid CI accounting procedures in current policies may limit CI responsiveness across candidate sites and processing facilities. This work examines a hypothetical biomass-to-sustainable aviation fuel (SAF) pathway using miscanthus and alcohol-to-jet (i) to demonstrate how GHG accounting requirements drive estimates of biofuel CIs and (ii) to explore potential CI and financial implications of scenario-specific life cycle assessment (LCA). Results demonstrate that GHG accounting using the CFR/LCFS can reasonably account for distinct levels of net electricity production by a biorefinery, but only the CFR yields similar CI sensitivity to spatially explicit factors (feedstock CI, grid electricity CI) as scenario-specific LCA: most GHG accounting frameworks do not capture CI variation across candidate sites in the United States. Ultimately, this work demonstrates the importance of LCA methodological specifications in low carbon fuel policies and tax credits.

Miscanthus↗

Generating Euler Diagrams Through Combinatorial Optimization

Abstract Can a given set system be drawn as an Euler diagram? We present the first method that correctly decides this question for arbitrary set systems if the Euler diagram is required to represent each set with a single connected region. If the answer is yes, our method constructs an Euler diagram. If the answer is no, our method yields an Euler diagram for a simplified version of the set system, where a minimum number of set elements have been removed. Further, we integrate known wellformedness criteria for Euler diagrams as additional optimization objectives into our method. Our focus lies on the computation of a planar graph that is embedded in the plane to serve as the dual graph of the Euler diagram. Since even a basic version of this problem is known to be NP‐hard, we choose an approach based on integer linear programming (ILP), which allows us to compute optimal solutions with existing mathematical solvers. For this, we draw upon previous research on computing planar supports of hypergraphs and adapt existing ILP building blocks for contiguity‐constrained spatial unit allocation and the maximum planar subgraph problem. To generate Euler diagrams for large set systems, for which the proposed simplification through element removal becomes indispensable, we also present an efficient heuristic. We report on experiments with data from MovieDB and Twitter. Over all examples, including 850 non‐trivial instances, our exact optimization method failed only for one set system to find a solution without removing a set element. However, with the removal of only a few set elements, the Euler diagrams can be substantially improved with respect to our wellformedness criteria.

Computer Science↗

Interval-parameter semi-infinite fuzzy-stochastic mixed-integer programming approach for environmental management under multiple uncertainties

In this study, an interval-parameter semi-infinite fuzzy-chance-constrained mixed-integer linear programming (ISIFCIP) approach is developed for supporting long-term planning of waste-management systems under multiple uncertainties in the City of Regina, Canada. The method improves upon the existing interval-parameter semi-infinite programming (ISIP) and fuzzy-chance-constrained programming (FCCP) by incorporating uncertainties expressed as dual uncertainties of functional intervals and multiple uncertainties of distributions with fuzzy-interval admissible probability of violating constraint within a general optimization framework. The binary-variable solutions represent the decisions of waste-management-facility expansion, and the continuous ones are related to decisions of waste-flow allocation. The interval solutions can help decision-makers to obtain multiple decision alternatives, as well as provide bases for further analyses of tradeoffs between waste-management cost and system-failure risk. In the application to the City of Regina, Canada, two scenarios are considered. In Scenario 1, the City's waste-management practices would be based on the existing policy over the next 25 years. The total diversion rate for the residential waste would be approximately 14%. Scenario 2 is associated with a policy for waste minimization and diversion, where 35% diversion of residential waste should be achieved within 15 years, and 50% diversion over 25 years. In this scenario, not only landfill would be expanded, but also CF and MRF would be expanded. Through the scenario analyses, useful decision support for the City's solid-waste managers and decision-makers has been generated. Three special characteristics of the proposed method make it unique compared with other optimization techniques that deal with uncertainties. Firstly, it is useful for tackling multiple uncertainties expressed as intervals, functional intervals, probability distributions, fuzzy sets, and their combinations; secondly, it has capability in addressing the temporal variations of the functional intervals; thirdly, it can facilitate dynamic analysis for decisions of facility-expansion planning and waste-flow allocation within a multi-facility, multi-period and multi-option context.

54 ENVIRONMENTAL SCIENCES↗

Optimal test selection for prediction uncertainty reduction

Economic factors and experimental limitations often lead to sparse and/or imprecise data used for the calibration and validation of computational models. This paper addresses resource allocation for calibration and validation experiments, in order to maximize their effectiveness within given resource constraints. When observation data are used for model calibration, the quality of the inferred parameter descriptions is directly affected by the quality and quantity of the data. This paper characterizes parameter uncertainty within a probabilistic framework, which enables the uncertainty to be systematically reduced with additional data. The validation assessment is also uncertain in the presence of sparse and imprecise data; therefore, this paper proposes an approach for quantifying the resulting validation uncertainty. Since calibration and validation uncertainty affect the prediction of interest, the proposed framework explores the decision of cost versus importance of data in terms of the impact on the prediction uncertainty. Often, calibration and validation tests may be performed for different input scenarios, and this paper shows how the calibration and validation results from different conditions may be integrated into the prediction. Then, a constrained discrete optimization formulation that selects the number of tests of each type (calibration or validation at given input conditions) is proposed. Furthermore, the proposed test selection methodology is demonstrated on a microelectromechanical system (MEMS) example.

97 MATHEMATICS AND COMPUTING↗

Design of a low-emittance lattice for 3.5 GeV synchrotron light source

We investigate a lattice design for a low-emittance, high-brilliance intermediate energy synchrotron light source that is being intensively performed in the world. We present the design results in detail for a non-achromatic double bend achromat lattice with an emittance of 1.1 nm and 597.6 m circumference. Each superperiod has 4 straight sections, 7 m, 5.4 m, and 2 × 2.8 m in length, giving a total of 60 straight sections in the ring. The lattice is designed to be flexible and also provides an achromatic optics with an emittance of 3.2 nm. The lattice provides high brilliance at a photon energy of a few tens of keV, which meets the requirements of hard X-ray synchrotron radiation users. We investigated the dynamic aperture in the lattice with machine errors using a simulation method that achieves the optimal tune for the ring. The low-emittance lattice provides sufficient dynamic aperture after closed orbit distortion correction. We show an estimate of variations of emittance, energy spread, and dynamic aperture due to a wiggler in the straight sections. We present the design of an injection scheme for full energy injection, the space allocation in injection section, and the particle dynamics of injected beam. Particle tracking after beam injection was performed to examine the validity of the injection scheme. Our design lattice shows good optimization in terms of the emittance, number of straight sections, brilliance, and circumference as a light source for 3.5 GeV beam energy.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Centroidal Voronoi tessellation based methods for optimal rain gauge location prediction

With more satellite and model precipitation data becoming available, new analytical methods are needed that can take advantage of emerging data patterns to make well informed predictions in many hydrological applications. Herein we propose a new strategy where we extract precipitation variability patterns and use correlation map to build the resulting density map that serves as an input to centroidal Voronoi tessellation construction that optimizes placement of precipitation gauges. We provide results of numerical experiments based on the data from the Alto-Adige region in Northern Italy and Oklahoma and compare them against actual gauge locations. This method provides an automated way for choosing new gauge locations and can be generalized to include physical constraints and to tackle other types of resource allocation problems.

54 ENVIRONMENTAL SCIENCES↗

Detection of long-term trends in carbon accumulation by forests in Northeastern U.S. and determination of causal factors (Final Report)

The overall project goal was to quantify the trends and variability for Net ecosystem exchange of CO 2 , H 2 O, and energy by northeastern forests, with particular attention to the role of succession, differences in species composition, legacies of past land use, and disturbances. Measurements included flux measurements and observations of biomass accumulation using ecosystem modeling as a framework for data interpretation. Continuation of the long-term record at the Environmental Measurement Site (EMS) Tower was a priority. The final quality-assured CO 2 -flux data now extend through 2010. Data through 2011 are collected but not yet finalized. Biomass observations on the plot array centered on the tower are extended to 2011. Two additional towers in a hemlock stand (HEM) and a younger deciduous stand (LPH) complement the EMS tower by focusing on stands with different species composition or age distribution and disturbance history, but comparable climate and soil type. Over the period since 1993 the forest has added 24.4 Mg-C ha -1 in the living trees. Annual net carbon uptake had been increasing from about 2 Mg-C ha -1 y -1 in the early 1990s to nearly 6 Mg-C ha -1 y -1 by 2008, but declined in 2009-2010. We attribute the increasing carbon uptake to a combination of warmer temperatures, increased photosynthetic efficiency, and increased influence by subcanopy hemlocks that are active in the early spring and late autumn when temperatures are above freezing but the deciduous canopy is bare. Not all of the increased carbon accumulation was found in woody biomass. Results from a study using data to optimize parameters in an ecosystem process model indicate that significant changes in model parameters for photosynthetic capacity and shifts in allocation to slow cycling soil organic matter are necessary for the model to match the observed trends. The emerging working hypothesis is that the pattern of increasing carbon uptake over the early 2000's represents a transient pulse that will eventually end as decomposition of the accumulated carbon catches up.

54 ENVIRONMENTAL SCIENCES↗

Complexity analysis of pipeline mapping problems in distributed heterogeneous networks

Largescale scientific applications require using various system resources to execute complex computing pipelines in distributed networks to support collaborative research. System resources are typically shared in the Internet or over dedicated connections based on their location, availability, capability, and capacity. Optimizing the network performance of computing pipelines in such distributed environments is critical to the success of these applications. We consider two types of largescale distributed applications: (1) interactive applications where a single dataset is sequentially processed along a pipeline; and (2) streaming applications where a series of datasets continuously flow through a pipeline. The computing pipelines of these applications consist of a number of modules executed in a linear order in network environments with heterogeneous resources under different constraints. Our goal is to find an efficient mapping scheme that allocates the modules of a pipeline to network nodes for minimum endtoend delay or maximum frame rate. We formulate the pipeline mappings in distributed environments as optimization problems and categorize them into six classes with different optimization goals and mapping constraints: (1) Minimum Endtoend Delay with No Node Reuse (MEDNNR), (2) Minimum Endtoend Delay with Contiguous Node Reuse (MEDCNR), (3) Minimum Endtoend Delay with Arbitrary Node Reuse (MEDANR), (4) Maximum Frame Rate with No Node Reuse or Share (MFRNNRS), (5) Maximum Frame Rate with Contiguous Node Reuse and Share (MFRCNRS), and (6) Maximum Frame Rate with Arbitrary Node Reuse and Share (MFRANRS). Here, 'contiguous node reuse' means that multiple contiguous modules along the pipeline may run on the same node and 'arbitrary node reuse' imposes no restriction on node reuse. Note that in interactive applications, a node can be reused but its resource is not shared. We prove that MEDANR is polynomially solvable and the rest are NP-complete. MEDANR, where either contiguous or noncontiguous modules in the pipeline can be mapped onto the same node, is essentially the Maximum n-hop Shortest Path problem, and can be solved using a dynamic programming method. In MEDNNR and MFRNNRS, any network node can be used only once, which requires selecting the same number of nodes for onetoone onto mapping. We show its NP-completeness by reducing from the Hamiltonian Path problem. Node reuse is allowed in MEDCNR, MFRCNRS and MFRANRS, which are similar to the Maximum n-hop Shortest Path problem that considers resource sharing. We prove their NP-completeness by reducing from the Disjoint-Connecting-Path Problem and Widest path with the Linear Capacity Constraints problem, respectively.

99 GENERAL AND MISCELLANEOUS↗

Evaluation of Dynamic Channel and Power Assignment for Cognitive Networks

In this paper, we develop a unifying optimization formulation to describe the Dynamic Channel and Power Assignment (DCPA) problem and evaluation method for comparing DCPA algorithms. DCPA refers to the allocation of transmit power and frequency channels to links in a cognitive network so as to maximize the total number of feasible links while minimizing the aggregate transmit power. We apply our evaluation method to five algorithms representative of DCPA used in literature. This comparison illustrates the tradeoffs between control modes (centralized versus distributed) and channel/power assignment techniques. We estimate the complexity of each algorithm. Through simulations, we evaluate the effectiveness of the algorithms in achieving feasible link allocations in the network, as well as their power efficiency. Our results indicate that, when few channels are available, the effectiveness of all algorithms is comparable and thus the one with smallest complexity should be selected. The Least Interfering Channel and Iterative Power Assignment (LICIPA) algorithm does not require cross-link gain information, has the overall lowest run time, and highest feasibility ratio of all the distributed algorithms; however, this comes at a cost of higher average power per link.

42 ENGINEERING↗

Contingency Contractor Optimization Phase 3 Sustainment Platform Requirements - Contingency Contractor Optimization Tool - Prototype

Sandia National Laboratories (Sandia) is in Phase 3 Sustainment of development of a prototype tool, currently referred to as the Contingency Contractor Optimization Tool - Prototype (CCOTP), under the direction of OSD Program Support. CCOT-P is intended to help provide senior Department of Defense (DoD) leaders with comprehensive insight into the global availability, readiness and capabilities of the Total Force Mix. The CCOT-P will allow senior decision makers to quickly and accurately assess the impacts, risks and mitigating strategies for proposed changes to force/capabilities assignments, apportionments and allocations options, focusing specifically on contingency contractor planning. During Phase 2 of the program, conducted during fiscal year 2012, Sandia developed an electronic storyboard prototype of the Contingency Contractor Optimization Tool that can be used for communication with senior decision makers and other Operational Contract Support (OCS) stakeholders. Phase 3 used feedback from demonstrations of the electronic storyboard prototype to develop an engineering prototype for planners to evaluate. Sandia worked with the DoD and Joint Chiefs of Staff strategic planning community to get feedback and input to ensure that the engineering prototype was developed to closely align with future planning needs. The intended deployment environment was also a key consideration as this prototype was developed. Initial release of the engineering prototype was done on servers at Sandia in the middle of Phase 3. In 2013, the tool was installed on a production pilot server managed by the OUSD(AT&L) eBusiness Center. The purpose of this document is to specify the CCOT-P engineering prototype platform requirements as of May 2016. Sandia developed the CCOT-P engineering prototype using common technologies to minimize the likelihood of deployment issues. CCOT-P engineering prototype was architected and designed to be as independent as possible of the major deployment components such as the server hardware, the server operating system, the database, and the web server. This document describes the platform requirements, the architecture, and the implementation details of the CCOT-P engineering prototype.

42 ENGINEERING↗