Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm selection”

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 667 records · Page 37

ISOLATING CONTENT AND METADATA FROM WEBLOGS USING CLASSIFICATION AND RULE-BASED APPROACHES

The emergence and increasing prevalence of social media, such as internet forums, weblogs (blogs), wikis, etc., has created a new opportunity to measure public opinion, attitude, and social structures. A major challenge in leveraging this information is isolating the content and metadata in weblogs, as there is no standard, universally supported, machine-readable format for presenting this information. We present two algorithms for isolating this information. The first uses web block classification, where each node in the Document Object Model (DOM) for a page is classified according to one of several pre-defined attributes from a common blog schema. The second uses a set of heuristics to select web blocks. These algorithms perform at a level suitable for initial use, validating this approach for isolating content and metadata from blogs. The resultant data serves as a starting point for analytical work on the content and substance of collections of weblog pages.

blog harvesting↗

The Richness Dependence of Galaxy Cluster Correlations: Results From A Redshift Survey Of Rich APM Clusters

We analyze the spatial clustering properties of a new catalog of very rich galaxy clusters selected from the APM Galaxy Survey. These clusters are of comparable richness and space density to Abell Richness Class greater than or equal to 1 clusters, but selected using an objective algorithm from a catalog demonstrably free of artificial inhomogeneities. Evaluation of the two-point correlation function xi(sub cc)(r) for the full sample and for richer subsamples reveals that the correlation amplitude is consistent with that measured for lower richness APM clusters and X-ray selected clusters. We apply a maximum likelihood estimator to find the best fitting slope and amplitude of a power law fit to x(sub cc)(r), and to estimate the correlation length r(sub 0) (the value of r at which xi(sub cc)(r) is equal to unity). For clusters with a mean space density of 1.6 x 10(exp -6) h(exp 3) MpC(exp -3) (equivalent to the space density of Abell Richness greater than or equal to 2 clusters), we find r(sub 0) = 21.3(+11.1/-9.3) h(exp -1) Mpc (95% confidence limits). This is consistent with the weak richness dependence of xi(sub cc)(r) expected in Gaussian models of structure formation. In particular, the amplitude of xi(sub cc)(r) at all richnesses matches that of xi(sub cc)(r) for clusters selected in N-Body simulations of a low density Cold Dark Matter model.

Croft, R. A. C.↗

Autonomous Selective Parts-Based Tracking

Object tracking from videos is still a challenging task due to various changes throughout a video sequence including occlusions, motion blur, scale and other deformation changes. In this paper, we propose a selective parts-based approach, using correlation filters, that makes choices based on a consensus of the parts and global tracking. Moreover, we further enhance our parts-based approach by introducing a segmentation-assisted parts initialization. In addition, we present a genetic algorithm-based method to autonomously select various parameters of the tracking algorithm, as opposed to the common practice of manually tuning those parameters. In contrast to existing part-based methods, the proposed method does not dilute accurate tracking by averaging results over multiple parts at every frame. Instead, we take a selective approach based on the relative weight of the responses across parts. Moreover, we only make location corrections when a part diverges, and rely on these location corrections to maintain an accurate appearance model. In the case of occlusions, which are among the main reasons for using a parts-based approach, our proposed approach consistently achieves the best performance. It is due to the ability to handle occlusion and not dilute decisions with incorrect parts, that our proposed approach enables state-of-the-art performance. The approach we propose was evaluated on videos from three different challenging benchmark datasets. Our approach has resulted in better overall precision and success rates for three different base tracking approaches.

42 ENGINEERING↗

Oak Ridge National Laboratory Pilot Demonstration of an Attestation and Anomaly Detection Framework using Distributed Ledger Technology for Power Grid Infrastructure

This report summarizes the design and pilot demonstration of a framework called Grid Guard that was created to provide increased data and device trustworthiness to electric grid devices by leveraging distributed ledger technology (DLT), specifically blockchain. Grid Guard contains a combination of core cryptographic methods such as the secure hash algorithm (SHA), and asymmetric cryptography, private permissioned blockchain, baselining configuration data, consensus algorithm (Raft) and the Hyperledger Fabric (HLF) framework. The system implements a low energy, fast, and robust enhancement to system trustworthiness within and across electric grid systems such as substations, control centers and metering infrastructures. Blockchain is a distributed database structured that provides a practically unalterable (immutable) timeline of stored transactions. By relying on hashing and the Raft consensus algorithm, if an entity tries to illegitimately alter a record at one instance of the database the other ledger nodes are not altered. They work to cross-reference each other and easily locate any incorrectly added data and remove it. The bulk raw data is stored in an off-chain storage (outside of the blockchain ledger) and a hash of this baseline data is stored in the Blockchain ledger via hashing windows of time-series and configuration data, after aggregation and filtering. The bulk off-chain data repository is then considered to be trust-anchored using the hashes stored in the blockchain. To secure the electric grid testbed devices and data, device configuration baselines were compared to those baselines that had been previously stored in the ledger. Statistical baselines for device configurations, network communication patterns, and high-speed sensor data are calculated and then stored off-chain and hashes stored in the ledger. Measurements such as three-phase voltage and current, frequency, breaker status, protection scheme settings, network configuration settings (and other device configuration artifacts) and network traffic features (packet interarrival times) are compared every minute or other selected time windows. During phase 1 of the Grid Guard DLT project different DLT technologies were studies, and an assessment was performed on DLT technology vulnerabilities, uses, and key characteristics. DLT consensus protocols were studies (e.g., RAFT, named after Reliable, Replicated, Redundant, And Fault-Tolerant). Also, cryptography, public, private and permissioned or permissionless systems were assessed. Grid Guard implements a permissioned private DLT. Consensus algorithm selection and choice of DLT implementation depended heavily on the use-case. For this use-case, parameters were selected to measure performance and existing tools for assessment. Benchmarking was performed theoretically and practically. During phase 2 hashed transactions/blocks were inserted into the ledger every second. During phase 2 of the Grid Guard DLT project, a prototype framework was developed and demonstrated for attestation of critical substation devices and data using precision timing systems that use PTP and IRIG-B protocols) on a testbed of operational devices that emulated a distribution substation, control center, and power metering infrastructure using real Operational Technology (OT). The testbed includes OT devices such as protective relays, human machine interfaces (HMI), and power meters. To determine when to collect and compare system and network baselines, an initial examination of an anomaly detection capability to identify malicious manipulation of data streams was conducted. The resulting anomaly detection was demonstrated in a set of experiments and leveraged to trigger device artifact attestation checks. Attestation checks occur against device configuration baselines when compared with the immutable blockchain-stored baselines, which provided a cryptographically supported means by which to store baselines. The electrical substation-grid testbed was created to test the Grid Guard framework. The testbed emulates the operations of a portion of a power grid and SCADA systems as closely as possible. The testbed integrates real protocols, mainly IEC 61850 standard protocols, such as the Sampled Value (SV) and the GOOSE protocols. The testbed also supports DNP3 and other layer 2 and layer 3 protocols such as Telnet, SSH, SFTP/FTP and other proprietary protocols needed to connect to industrial control system equipment. The testbed emulates real power conditions using the OpalRT hardware-in-the-loop (HIL) device which can create fault situations that cannot be easily tested on real systems. The electrical substation-grid testbed was created using real measurement, communication, and protection devices that electrical utilities commonly use.

24 POWER TRANSMISSION AND DISTRIBUTION↗

FORCE Update 2024

The Framework for Optimization of Resources and Economics (FORCE) tool suite is the U.S. Department of Energy’s Nuclear Integrated Energy Systems (IES) Program flagship tool suite for technoeconomic IES analysis of IES. This tool suite is useful for analysis designed to evaluate and improve the technoeconomics of energy production systems, particularly for systems including nuclear technology. In this report, we document the development activity for the FORCE tool suite to extend its capabilities as performed during fiscal year 2024. In addition to reliability and accessibility, capability is one of the three standards guiding the development of the FORCE tool suite and the software codes that are its constituent parts. Extending the capabilities of the FORCE tool suite allows analysis both within the IES program as well as industry, university, and laboratory partners to perform analysis with more accuracy, insight, and impactful narrative. Four areas of capability development were the focus of activity this year: economic parameter uncertainty quantification, multiresolution analysis, components-to-optimization workflow automation, and statespace construction workflows for real-time optimal control. In economic parameter uncertainty quantification, the ability of HERON to capture risk due to scenarios (weather and energy demand uncertainty) was expanded to also include uncertainties in financial parameters such as capital cost or operation and maintenance costs. By including these sources of uncertainty, which are sometimes very large compared with scenario uncertainty, HERON is better able to capture the risk posed by investment in various IES technology. Because of this, analysts can also consider the reduction in risks that can be realized by choice of some technologies. In multiresolution analysis, development activity extended on work completed previously. In fiscal year 2023, methods for decomposing time series signals, such as demand, solar and wind availability, and price profiles, were analyzed and down-selected to those most effective at splitting signals into different resolutions. These resolutions allow considering the influence of different energy demand and supply behaviors across different time scales. For example, energy demand might be divided into seasonal, weekly, and hourly profiles. In fiscal year 2024, this preliminary work was extended and implemented within the Risk Analysis Virtual Environment (RAVEN) risk and uncertainty analysis platform, which is used throughout the FORCE framework. This development of the “multi-resolution time series analysis” (MR-TSA) module in RAVEN allows training synthetic history generators on complex time series. These synthetic history generators can then be used in HERON for generating scenarios that represent possible market and weather scenarios that can be analyzed on different time scales. We envision completing this work in the future, implementing multiresolution dispatch optimization strategies that can make the most beneficial use of these stratified time histories. In components-to-optimization workflow development, workflows for translating user inputs of components into algorithms for algebraic optimization were selected and implemented. Similar algorithms within the Holistic Energy Resource Optimization Network (HERON) were separated from the main code base of HERON and gathered with the components-to-optimization workflows in the new Dispatch Optimization Variable Engine (DOVE) software library. This modularization allows FORCE users to analyze dispatch optimization and energy system duty cycles independently of HERON, which previously was a burdensome task. Additionally, these dispatch optimization algorithms, set up in an independent library, can now be used across all software applications within FORCE, especially including the real-time optimal control software Optimization of Real-time Capacity Allocation (ORCA). Allowing FORCE software to share dispatch optimization algorithms within a single library allows for improved software maintenance and reliability. In statespace characterization workflow development, alternative workflows for optimizing dispatch with additional technical accuracy was the focus, particularly to improve the real-time optimization decision making in ORCA. Using algorithms and workflows initially developed for the Feasible Actuator Range Modifier (FARM), workflows for determining the statespace representation of IES were identified and demonstrated. The resulting dispatch optimization required a more robust optimization algorithm than that originally used in HERON (and moved to DOVE), which required adding an alternate workflow to DOVE that can more accurately match the behavior of physical systems using a partial differential equation representation. In conclusion, capability developments in the FORCE tool suite in fiscal year 2024 have improved the ability of the FORCE tool suite to perform

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Expectation-maximization algorithms for learning a finite mixture of univariate survival time distributions from partially specified class values

Heterogeneity exists on a data set when samples from di erent classes are merged into the data set. Finite mixture models can be used to represent a survival time distribution on heterogeneous patient group by the proportions of each class and by the survival time distribution within each class as well. The heterogeneous data set cannot be explicitly decomposed to homogeneous subgroups unless all the samples are precisely labeled by their origin classes; such impossibility of decomposition is a barrier to overcome for estimating nite mixture models. The expectation-maximization (EM) algorithm has been used to obtain maximum likelihood estimates of nite mixture models by soft-decomposition of heterogeneous samples without labels for a subset or the entire set of data. In medical surveillance databases we can find partially labeled data, that is, while not completely unlabeled there is only imprecise information about class values. In this study we propose new EM algorithms that take advantages of using such partial labels, and thus incorporate more information than traditional EM algorithms. We particularly propose four variants of the EM algorithm named EM-OCML, EM-PCML, EM-HCML and EM-CPCML, each of which assumes a specific mechanism of missing class values. We conducted a simulation study on exponential survival trees with five classes and showed that the advantages of incorporating substantial amount of partially labeled data can be highly signi cant. We also showed model selection based on AIC values fairly works to select the best proposed algorithm on each specific data set. A case study on a real-world data set of gastric cancer provided by Surveillance, Epidemiology and End Results (SEER) program showed a superiority of EM-CPCML to not only the other proposed EM algorithms but also conventional supervised, unsupervised and semi-supervised learning algorithms.

97 MATHEMATICS AND COMPUTING↗

A slippery slope: systematic uncertainties in the line width baryonic Tully-Fisher relation

The baryonic Tully–Fisher relation (BTFR) is both a valuable observational tool and a critical test of galaxy formation theory. We explore the systematic uncertainty in the slope and the scatter of the observed line-width BTFR utilizing homogeneously measured, unresolved H i observations for 930 isolated galaxies. We measure a fiducial relation of log{sub 10} M{sub baryon}=3.24 log{sub 10} V{sub rot} + 3.21 with observed scatter of 0.25 dex over a baryonic mass range of 10{sup 7.4} to 10{sup 11.3} M{sub ⊙} where V{sub rot} is measured from 20% H i line widths. We then conservatively vary the definitions of M{sub baryon} and V{sub rot}, the sample definition and the linear fitting algorithm. We obtain slopes ranging from 2.64 to 3.53 and scatter measurements ranging from 0.14 to 0.41 dex, indicating a significant systematic uncertainty of 0.25 in the BTFR slope derived from unresolved H i line widths. We next compare our fiducial slope to literature measurements, where reported slopes range from 3.0 to 4.3 and scatter is either unmeasured, immeasurable, or as large as 0.4 dex. Measurements derived from unresolved H i line widths tend to produce slopes of 3.3, while measurements derived strictly from resolved asymptotic rotation velocities tend to produce slopes of 3.9. The single largest factor affecting the BTFR slope is the definition of rotation velocity. The sample definition, the mass range and the linear fitting algorithm also significantly affect the measured BTFR. We find that galaxies in our sample with V{sub rot}<100 km s{sup −1} are consistent with the line-width BTFR of more massive galaxies, but these galaxies drive most of the observed scatter. It is critical when comparing predictions to an observed BTFR that the rotation velocity definition, the sample selection and the fitting algorithm are similarly defined. We recommend direct statistical comparisons between data sets with commensurable properties as opposed to simply comparing BTFR power-law fits.

79 ASTRONOMY AND ASTROPHYSICS↗

A Novel Energy-Aware Distributed Clustering Algorithm for Heterogeneous Wireless Sensor Networks in the Mobile Environment

In order to prolong the network lifetime, energy-efficient protocols adapted to the features of wireless sensor networks should be used. This paper explores in depth the nature of heterogeneous wireless sensor networks, and finally proposes an algorithm to address the problem of finding an effective pathway for heterogeneous clustering energy. The proposed algorithm implements cluster head selection according to the degree of energy attenuation during the network’s running and the degree of candidate nodes’ effective coverage on the whole network, so as to obtain an even energy consumption over the whole network for the situation with high degree of coverage. Simulation results show that the proposed clustering protocol has better adaptability to heterogeneous environments than existing clustering algorithms in prolonging the network lifetime.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

CometBoards Users Manual Release 1.0

Several nonlinear mathematical programming algorithms for structural design applications are available at present. These include the sequence of unconstrained minimizations technique, the method of feasible directions, and the sequential quadratic programming technique. The optimality criteria technique and the fully utilized design concept are two other structural design methods. A project was undertaken to bring all these design methods under a common computer environment so that a designer can select any one of these tools that may be suitable for his/her application. To facilitate selection of a design algorithm, to validate and check out the computer code, and to ascertain the relative merits of the design tools, modest finite element structural analysis programs based on the concept of stiffness and integrated force methods have been coupled to each design method. The code that contains both these design and analysis tools, by reading input information from analysis and design data files, can cast the design of a structure as a minimum-weight optimization problem. The code can then solve it with a user-specified optimization technique and a user-specified analysis method. This design code is called CometBoards, which is an acronym for Comparative Evaluation Test Bed of Optimization and Analysis Routines for the Design of Structures. This manual describes for the user a step-by-step procedure for setting up the input data files and executing CometBoards to solve a structural design problem. The manual includes the organization of CometBoards; instructions for preparing input data files; the procedure for submitting a problem; illustrative examples; and several demonstration problems. A set of 29 structural design problems have been solved by using all the optimization methods available in CometBoards. A summary of the optimum results obtained for these problems is appended to this users manual. CometBoards, at present, is available for Posix-based Cray and Convex computers, Iris and Sun workstations, and the VM/CMS system.

Guptill, James D.↗

Polynomial Scaling Localized Active Space Unitary Selective Coupled Cluster Singles and Doubles

We present a polynomial-scaling algorithm for the localized active space unitary selective coupled cluster singles and doubles (LAS-USCCSD) method. In this approach, cluster excitations are selected based on a threshold ϵ determined by the absolute gradients of the LAS-UCCSD energy with respect to cluster amplitudes. Using the generalized Wick’s theorem for multireference wave functions, we derive the gradient expression as a polynomial function of one-, two-, and three-body reduced density matrices and 1- and 2-electron integrals, valid for any multireference wave function. The resulting gradient implementation exhibits a memory scaling of 𝒪(N 6 ), with N spin orbitals in the combined active space of all fragments. The variational quantum eigensolver is used to optimize the selected cluster excitations on a quantum simulator. Furthermore, by plotting the energy error, defined as the difference between the LAS-USCCSD and corresponding CASCI energies, against the inverse cluster amplitude selection threshold (ϵ –1 ) for polyene chains containing 2 to 5 π-bond units, we establish a relationship between the energy error and the threshold. To further validate the accuracy of LAS-USCCSD, we computed the cis–trans isomerization energy of stilbene (a 20-qubit system) and the magnetic coupling constant of the tris-hydroxo-bridged chromium dimer [Cr 2 (OH) 3 (NH 3 ) 6 ] 3+ (evaluated as both 12- and 20-qubit systems) using the Qiskit-Qulacs simulator. Assessing such examples is important to determine the practical feasibility of quantum simulations for chemically realistic systems. Toward this goal, with the LAS-USCCSD algorithm we estimated the quantum resources required for simulating an active space of (30e,22o) in [Cr 2 (OH) 3 (NH 3 ) 6 ] 3+ , a size that remains beyond the reach of current quantum simulators for accurate treatment.

Algorithms↗

Signature extension through the application of cluster matching algorithms to determine appropriate signature transformations

Signature extension is intended to increase the space-time range over which a set of training statistics can be used to classify data without significant loss of recognition accuracy. A first cluster matching algorithm MASC (Multiplicative and Additive Signature Correction) was developed at the Environmental Research Institute of Michigan to test the concept of using associations between training and recognition area cluster statistics to define an average signature transformation. A more recent signature extension module CROP-A (Cluster Regression Ordered on Principal Axis) has shown evidence of making significant associations between training and recognition area cluster statistics, with the clusters to be matched being selected automatically by the algorithm.

Lambeck, P. F.↗

Prediction of Dielectric Constant in Series of Polymers by Quantitative Structure-Property Relationship (QSPR)

This work is devoted to the investigation of dielectric permittivity which is influenced by electronic, ionic, and dipolar polarization mechanisms, contributing to the material’s capacity to store electrical energy. In this study, an extended dataset of 86 polymers was analyzed, and two quantitative structure–property relationship (QSPR) models were developed to predict dielectric permittivity. From an initial set of 1273 descriptors, the most relevant ones were selected using a genetic algorithm, and machine learning models were built using the Gradient Boosting Regressor (GBR). In contrast to Multiple Linear Regression (MLR)- and Partial Least Squares (PLS)-based models, the gradient boosting models excel in handling nonlinear relationships and multicollinearity, iteratively optimizing decision trees to improve accuracy without overfitting. The developed GBR models showed high R2 coefficients of 0.938 and 0.822, for the training and test sets, respectively. An Accumulated Local Effect (ALE) technique was applied to assess the relationship between the selected descriptors—eight for the GB_A model and six for the GB_B model, and their impact on target property. ALE analysis revealed that descriptors such as TDB09m had a strong positive effect on permittivity, while MLOGP2 showed a negative effect. These results highlight the effectiveness of the GBR approach in predicting the dielectric properties of polymers, offering improved accuracy and interpretability.

Ascencio-Medina, Estefania↗

Five Decades Observing Earth's Atmospheric Trace Gases Using Ultraviolet and Visible Backscatter Solar Radiation from Space

Over the last five decades, Earth’s atmosphere has been extensively monitored from space using different spectral ranges. Early efforts were directed at improving weather forecasts with the first meteorological satellites launched in the 1960s. Soon thereafter, the intersection between weather, climate and atmospheric chemistry led to the observation of atmospheric composition from space. During the 1970s the Nimbus satellite program started regular monitoring of ozone integrated columns and water vapor profiles using the Backscatter Ultraviolet Spectrometer, the Infrared Interferometer Spectrometer and the Satellite Infrared Spectrometer instruments. Five decades after these pioneer efforts, continuous progress in instrument design, and retrieval techniques allow researchers to monitor tropospheric concentrations of a wide range of species with implications for air quality, climate and weather. The time line of historic, present and future space-borne instruments measuring ultraviolet and visible backscattered solar radiation designed to quantify atmospheric trace gases is presented. We describe the instruments technological evolution and the basic concepts of retrieval theory. We include a review of algorithms developed for ozone, nitrogen dioxide, sulfur dioxide, formaldehyde, bromine monoxide, water vapor and glyoxal, a selection of studies using these algorithms, the challenges they face and how these challenges can be addressed. The paper ends by providing insights on the opportunities that new instruments will bring to the atmospheric chemistry, weather and air quality communities and how to address the pressing need for long-term, inter-calibrated data records necessary to monitor the response of the atmosphere to rapidly changing ecosystems.

Infrared Interferometer Spectrometer↗

Application-Specific Graph Sampling for Frequent Subgraph Mining and Community Detection

Graph mining is an important data analysis methodology, but struggles as the input graph size increases. The scalability and usability challenges posed by such large graphs make it imperative to sample the input graph and reduce its size. The critical challenge in sampling is to identify the appropriate algorithm to insure the resulting analysis does not suffer heavily from the data reduction. Predicting the expected performance degradation for a given graph and sampling algorithm is also useful. In this paper, we present different sampling approaches for graph mining applications such as Frequent Subgrpah Mining (FSM), and Community Detection (CD). We explore graph metrics such as PageRank, Triangles, and Diversity to sample a graph and conclude that for heterogeneous graphs Triangles and Diversity perform better than degree based metrics. We also present two new sampling variations for targeted graph mining applications. We present empirical results to show that knowledge of the target application, along with input graph properties can be used to select the best sampling algorithm. We also conclude that performance degradation is an abrupt, rather than gradual phenomena, as the sample size decreases. We present the empirical results to show that the performance degradation follows a logistic function.

Purohit, Sumit↗

Adaptive Data-Driven Deep-Learning Surrogate Model for Frontal Polymerization in Dicyclopentadiene

Frontal polymerization (FP) is a self-sustaining curing process that enables rapid and energy-efficient manufacturing of thermoset polymers and composites. Computational methods conventionally used to simulate the FP process are time-consuming, and repeating simulations are required for sensitivity analysis, uncertainty quantification, or optimization of the manufacturing process. Here, in this work, we develop an adaptive surrogate deep-learning model for FP of dicyclopentadiene (DCPD), which predicts the evolution of temperature and degree of cure orders of magnitude faster than the finite-element method (FEM). The adaptive algorithm provides a strategy to select training samples efficiently and save computational costs by reducing the redundancy of FEM-based training samples. The adaptive algorithm calculates the residual error of the FP governing equations using automatic differentiation of the deep neural network. A probability density function expressed in terms of the residual error is used to select training samples from the Sobol sequence space. The temperature and degree of cure evolution of each training sample are obtained by a 2D FEM simulation. The adaptive method is more efficient and has a better prediction accuracy than the random sampling method. With the well-trained surrogate neural network, the FP characteristics (front speed, shape, and temperature) can be extracted quickly from the predicted temperature and degree-of-cure fields.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Algorithm for Screening Phasor Measurement Unit Data for Power System Events and Categories and Common Characteristics for Events Seen in Phasor Measurement Unit Relative Phase-Angle Differences and Frequency Signals

A network of multiple phasor measurement units (PMU) was created, set up, and maintained at the University of Texas at Austin to obtain actual power system measurements for power system analysis. Power system analysis in this report covers a variety of time ranges, such as short- term analysis for power system disturbances and their effects on power system behavior and long- term power system behavior using modal analysis. The first objective of this report is to screen the PMU data for events. The second objective of the report is to identify and describe common characteristics extracted from power system events as measured by PMUs. The numerical characteristics for each category and how these characteristics are used to create selection rules for the algorithm are also described. Trends in PMU data related to different levels and fluctuations in wind power output are also examined.

17 WIND ENERGY↗

NASA team algorithm for sea ice concentration retrieval from Defense Meteorological Satellite Program special sensor microwave imager - Comparison with Landsat satellite imagery

The present study describes the validation of the the NASA team algorithm for the determination of sea ice concentrations from the Defense Meteorological Satellite Program special sensor microwave imager (SSM/I). A total of 28 cloud-free Landsat scenes were selected to permit validation of the passive microwave ice concentration algorithm for a range of ice concentrations and ice types. The sensitivity of the NASA team algorithm to the selection of locally and seasonally adjusted algorithm parameters is discussed. Mean absolute differences between SSM/I and Landsat ice concentrations are within 1 percent during fall using local and global tie points (standard deviations of the difference are +/-3.1 and +/-6.2 percent, respectively). In areas with greater amounts of nilas and young ice, the NASA team algorithm was found to underestimate ice concentrations by as much as 9 percent. It is inferred that the standard deviation between SSM/I and Landsat ice concentrations decreases from +/-7 to +/-5 percent with local tie points compared to the global ones for spring and fall.

Steffen, Konrad↗

ICARUS at the Short-Baseline Neutrino program: first results

The ICARUS collaboration employed the 760-ton T600 detector in a successful three-year physics run at the underground LNGS laboratory, performing a sensitive search for LSND-like anomalous $\nu_e$ appearance in the CERN Neutrino to Gran Sasso beam, which contributed to the constraints on the allowed neutrino oscillation parameters to a narrow region around 1 $eV^2$. After a significant overhaul at CERN, the T600 detector has been installed at Fermilab. In 2020 the cryogenic commissioning began with detector cool down, liquid argon filling and recirculation. ICARUS then started its operation collecting the first neutrino events from the Booster Neutrino Beam (BNB) and the Neutrinos at the Main Injector (NuMI) beam off-axis, which were used to test the ICARUS event selection, reconstruction and analysis algorithms. ICARUS successfully completed its commissioning phase in June 2022, moving then to data taking for neutrino oscillation physics, aiming at first to either confirm or refute the claim by Neutrino-4 short-baseline reactor experiment. ICARUS will also perform measurement of neutrino cross sections in LAr with the NuMI beam and several Beyond Standard Model studies. After the first year of operations, ICARUS will search for evidence of sterile neutrinos jointly with the Short-Baseline Near Detector, within the Short-Baseline Neutrino program. In this presentation, preliminary results from the ICARUS data with the BNB and NuMI beams are presented both in terms of performance of all ICARUS subsystems and of capability to select and reconstruct neutrino events.

Artero Pons, Maria↗