Search NASA⌕ Search

SEARCH · Search NASA

Results for “connected components”

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 73 records · Page 4

The Multi-Component Nature of the Vela Pulsar Nonthermal X-ray Spectrum

We report on our analysis of a 274 ks observation of the Vela pulsar with the Rossi X-Ray Timing Explorer (RXTE). The double-peaked, pulsed emission at 2 - 30 keV, which we had previously detected during a 93 ks observation, is confirmed with much improved statistics. There is now clear evidence, both in the spectrum and the light curve, that the emission in the RXTE band is a blend of two separate non-thermal components. The spectrum of the harder component connects smoothly with the OSSE, COMPTEL and EGRET spectrum and the peaks in the light curve are in phase coincidence with those of the high-energy light curve. The spectrum of the softer component is consistent with an extrapolation to the pulsed optical flux, and the second RXTE pulse is in phase coincidence with the second optical peak. In addition, we see a peak in the 2-8 keV RXTE pulse profile at the radio phase.

Harding, Alice K.↗

GEOS Atmospheric Model: Challenges at Exascale

The Goddard Earth Observing System (GEOS) model at NASA's Global Modeling and Assimilation Office (GMAO) is used to simulate the multi-scale variability of the Earth's weather and climate, and is used primarily to assimilate conventional and satellite-based observations for weather forecasting and reanalysis. In addition, assimilations coupled to an ocean model are used for longer-term forecasting (e.g., El Nino) on seasonal to interannual times-scales. The GMAO's research activities, including system development, focus on numerous time and space scales, as detailed on the GMAO website, where they are tabbed under five major themes: Weather Analysis and Prediction; Seasonal-Decadal Analysis and Prediction; Reanalysis; Global Mesoscale Modeling, and Observing System Science. A brief description of the GEOS systems can also be found at the GMAO website. GEOS executes as a collection of earth system components connected through the Earth System Modeling Framework (ESMF). The ESMF layer is supplemented with the MAPL (Modeling, Analysis, and Prediction Layer) software toolkit developed at the GMAO, which facilitates the organization of the computational components into a hierarchical architecture. GEOS systems run in parallel using a horizontal decomposition of the Earth's sphere into processing elements (PEs). Communication between PEs is primarily through a message passing framework, using the message passing interface (MPI), and through explicit use of node-level shared memory access via the SHMEM (Symmetric Hierarchical Memory access) protocol. Production GEOS weather prediction systems currently run at 12.5-kilometer horizontal resolution with 72 vertical levels decomposed into PEs associated with 5,400 MPI processes. Research GEOS systems run at resolutions as fine as 1.5 kilometers globally using as many as 30,000 MPI processes. Looking forward, these systems can be expected to see a 2 times increase in horizontal resolution every two to three years, as well as less frequent increases in vertical resolution. Coupling these resolution changes with increases in complexity, the computational demands on the GEOS production and research systems should easily increase 100-fold over the next five years. Currently, our 12.5 kilometer weather prediction system narrowly meets the time-to-solution demands of a near-real-time production system. Work is now in progress to take advantage of a hybrid MPI-OpenMP parallelism strategy, in an attempt to achieve a modest two-fold speed-up to accommodate an immediate demand due to increased scientific complexity and an increase in vertical resolution. Pursuing demands that require a 10- to 100-fold increases or more, however, would require a detailed exploration of the computational profile of GEOS, as well as targeted solutions using more advanced high-performance computing technologies. Increased computing demands of 100-fold will be required within five years based on anticipated changes in the GEOS production systems, increases of 1000-fold can be anticipated over the next ten years.

ESMF↗

The γ-ray spectrum of the core of Centaurus A as observed with H.E.S.S. and Fermi-LAT

Centaurus A (Cen A) is the nearest radio galaxy discovered as a very-high-energy (VHE; 100 GeV–100 TeV) γ-ray source by the High Energy Stereoscopic System (H.E.S.S.). It is a faint VHE γ-ray emitter, though its VHE flux exceeds both the extrapolation from early Fermi-LAT observations as well as expectations from a (misaligned) single-zone synchrotron-self Compton (SSC) description. The latter satisfactorily reproduces the emission from Cen A at lower energies up to a few GeV. New observations with H.E.S.S., comparable in exposure time to those previously reported, were performed and eight years of Fermi-LAT data were accumulated to clarify the spectral characteristics of the γ-ray emission from the core of Cen A. The results allow us for the first time to achieve the goal of constructing a representative, contemporaneous γ-ray core spectrum of Cen A over almost five orders of magnitude in energy. Advanced analysis methods, including the template fitting method, allow detection in the VHE range of the core with a statistical significance of 12σ on the basis of 213 hours of total exposure time. The spectrum in the energy range of 250 GeV–6 TeV is compatible with a power-law function with a photon index Γ = 2.52 ± 0.13 stat ± 0.20 sys . An updated Fermi-LAT analysis provides evidence for spectral hardening by ΔΓ ≃ 0.4 ± 0.1 at γ-ray energies above 2.8+1.0-0.6 GeV at a level of 4.0σ. The fact that the spectrum hardens at GeV energies and extends into the VHE regime disfavour a single-zone SSC interpretation for the overall spectral energy distribution (SED) of the core and is suggestive of a new γ-ray emitting component connecting the high-energy emission above the break energy to the one observed at VHE energies. Finally, the absence of significant variability at both GeV and TeV energies does not yet allow disentanglement of the physical nature of this component, though a jet-related origin is possible and a simple two-zone SED model fit is provided to this end.

79 ASTRONOMY AND ASTROPHYSICS↗

Ultra Safe And Secure Blasting System

The Ultra is a blasting system that is designed for special applications where the risk and consequences of unauthorized demolition or blasting are so great that the use of an extraordinarily safe and secure blasting system is justified. Such a blasting system would be connected and logically welded together through digital code-linking as part of the blasting system set-up and initialization process. The Ultra's security is so robust that it will defeat the people who designed and built the components in any attempt at unauthorized detonation. Anyone attempting to gain unauthorized control of the system by substituting components or tapping into communications lines will be thwarted in their inability to provide encrypted authentication. Authentication occurs through the use of codes that are generated by the system during initialization code-linking and the codes remain unknown to anyone, including the authorized operator. Once code-linked, a closed system has been created. The system requires all components connected as they were during initialization as well as a unique code entered by the operator for function and blasting.

42 ENGINEERING↗

D–Q Impedance Based Stability Analysis and Parameter Design of Three-Phase Inverter-Based AC Power Systems

Small-signal stability is an important concern in three-phase inverter-based ac power systems. The impedance-based approach based on the generalized Nyquist stability criterion (GNC) can analyze the stability related with the medium and high-frequency modes of the systems. However,. the GNC involves the right-half-plane (RHP) pole calculation of return-ratio transfer function matrices, which cannot be avoided for stability analysis of complicated ac power systems. Therefore, it necessitates the detailed internal control information of the inverters, which is not normally available for commercial inverters. To address this issue, this paper introduces the component connection method (CCM) in the frequency domain for stability analysis in the synchronous d-q frame, by proposing a method of deriving the impedance matrix of the connection networks of inverter-based ac power systems. Demonstration on a two-area system and a microgrid shows that: The CCM-enabled approach can avoid the RHP pole calculation of return-ratio matrices and enables the stability analysis by using only the impedances of system components, which could be measured without the need for the internal information. A stability analysis method based on d-q impedances, the CCM, and the determinant-based GNC is also proposed to further simplify the analysis process. Inverter controller parameters can be designed as stability regions in parameter spaces, by repetitively applying the proposed stability analysis method. Simulation and experimental results verify the validity of the proposed stability analysis method and the parameter design approach.

42 ENGINEERING↗

Implementing Access to Data Distributed on Many Processors

A reference architecture is defined for an object-oriented implementation of domains, arrays, and distributions written in the programming language Chapel. This technology primarily addresses domains that contain arrays that have regular index sets with the low-level implementation details being beyond the scope of this discussion. What is defined is a complete set of object-oriented operators that allows one to perform data distributions for domain arrays involving regular arithmetic index sets. What is unique is that these operators allow for the arbitrary regions of the arrays to be fragmented and distributed across multiple processors with a single point of access giving the programmer the illusion that all the elements are collocated on a single processor. Today's massively parallel High Productivity Computing Systems (HPCS) are characterized by a modular structure, with a large number of processing and memory units connected by a high-speed network. Locality of access as well as load balancing are primary concerns in these systems that are typically used for high-performance scientific computation. Data distributions address these issues by providing a range of methods for spreading large data sets across the components of a system. Over the past two decades, many languages, systems, tools, and libraries have been developed for the support of distributions. Since the performance of data parallel applications is directly influenced by the distribution strategy, users often resort to low-level programming models that allow fine-tuning of the distribution aspects affecting performance, but, at the same time, are tedious and error-prone. This technology presents a reusable design of a data-distribution framework for data parallel high-performance applications. Distributions are a means to express locality in systems composed of large numbers of processor and memory components connected by a network. Since distributions have a great effect on the performance of applications, it is important that the distribution strategy is flexible, so its behavior can change depending on the needs of the application. At the same time, high productivity concerns require that the user be shielded from error-prone, tedious details such as communication and synchronization.

James, Mark↗

Limited-path-length entanglement percolation in quantum complex networks

We study entanglement distribution in quantum complex networks where nodes are connected by bipartite entangled states. These networks are characterized by a complex structure, which dramatically affects how information is transmitted through them. For pure quantum state links, quantum networks exhibit a remarkable feature absent in classical networks: it is possible to effectively rewire the network by performing local operations on the nodes. We propose a family of such quantum operations that decrease the entanglement percolation threshold of the network and increase the size of the giant connected component. We provide analytic results for complex networks with an arbitrary (uncorrelated) degree distribution. These results are in good agreement with numerical simulations, which also show enhancement in correlated and real-world networks. The proposed quantum preprocessing strategies are not robust in the presence of noise. However, even when the links consist of (noisy) mixed-state links, one can send quantum information through a connecting path with a fidelity that decreases with the path length. In this noisy scenario, complex networks offer a clear advantage over regular lattices, namely, the fact that two arbitrary nodes can be connected through a relatively small number of steps, known as the small-world effect. We calculate the probability that two arbitrary nodes in the network can successfully communicate with a fidelity above a given threshold. This amounts to working out the classical problem of percolation with a limited path length. We find that this probability can be significant even for paths limited to few connections and that the results for standard (unlimited) percolation are soon recovered if the path length exceeds by a finite amount the average path length, which in complex networks generally scales logarithmically with the size of the network.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust automatic rigid registration of MRI and X-ray using external fiducial markers for XFM-guided interventional procedures

Purpose: In X-ray fused with MRI, previously gathered roadmap MRI volume images are overlaid on live X-ray fluoroscopy images to help guide the clinician during an interventional procedure. The incorporation of MRI data allows for the visualization of soft tissue that is poorly visualized under X-ray. The widespread clinical use of this technique will require fully automating as many components as possible. While previous use of this method has required time-consuming manual intervention to register the two modalities, in this article, the authors present a fully automatic rigid-body registration method. Methods: External fiducial markers that are visible under these two complimentary imaging modalities were used to register the X-ray images with the roadmap MR images. The method has three components: (a) The identification of the 3D locations of the markers from a full 3D MR volume, (b) the identification of the 3D locations of the markers from a small number of 2D X-ray fluoroscopy images, and (c) finding the rigid-body transformation that registers the two point sets in the two modalities. For part (a), the localization of the markers from MR data, the MR volume image was thresholded, connected voxels were segmented and labeled, and the centroids of the connected components were computed. For part (b), the X-ray projection images, produced by an image intensifier, were first corrected for distortions. Binary mask images of the markers were created from the distortion-corrected X-ray projection images by applying edge detection, pattern recognition, and image morphological operations. The markers were localized in the X-ray frame using an iterative backprojection-based method which segments voxels in the volume of interest, discards false positives based on the previously computed edge-detected projections, and calculates the locations of the true markers as the centroids of the clusters of voxels that remain. For part (c), a variant of the iterative closest point method was used to find correspondences between and register the two sets of points computed from MR and X-ray data. This knowledge of the correspondence between the two point sets was used to refine, first, the X-ray marker localization and then the total rigid-body registration between modalities. The rigid-body registration was used to overlay the roadmap MR image onto the X-ray fluoroscopy projections. Results: In 35 separate experiments, the markers were correctly registered to each other in 100% of the cases. When half the number of X-ray projections was used (10 X-ray projections instead of 20), the markers were correctly registered in all 35 experiments. The method was also successful in all 35 experiments when the number of markers was (retrospectively) halved (from 16 to 8). The target registration error was computed in a phantom experiment to be less than 2.4 mm. In two in vivo experiments, targets (interventional devices with pointlike metallic structures) inside the heart were successfully registered between the two modalities. Conclusions: The method presented can be used to automatically register a roadmap MR image to X-ray fluoroscopy using fiducial markers and as few as ten X-ray projections.

60 APPLIED LIFE SCIENCES↗

I/O load balancing for big data HPC applications

High Performance Computing (HPC) big data problems require efficient distributed storage systems. However, at scale, such storage systems often experience load imbalance and resource contention due to two factors: the bursty nature of scientific application I/O; and the complex I/O path that is without centralized arbitration and control. For example, the extant Lustre parallel file system-that supports many HPC centers-comprises numerous components connected via custom network topologies, and serves varying demands of a large number of users and applications. Consequently, some storage servers can be more loaded than others, which creates bottlenecks and reduces overall application I/O performance. Existing solutions typically focus on per application load balancing, and thus are not as effective given their lack of a global view of the system. In this paper, we propose a data-driven approach to load balance the I/O servers at scale, targeted at Lustre deployments. To this end, we design a global mapper on Lustre Metadata Server, which gathers runtime statistics from key storage components on the I/O path, and applies Markov chain modeling and a minimum-cost maximum-flow algorithm to decide where data should be placed. Evaluation using a realistic system simulator and a real setup shows that our approach yields better load balancing, which in turn can improve end-to-end performance.

Paul, Arnab K.↗

High performance semantic factoring of giga-scale semantic graph databases.

As semantic graph database technology grows to address components ranging from extant large triple stores to SPARQL endpoints over SQL-structured relational databases, it will become increasingly important to be able to bring high performance computational resources to bear on their analysis, interpretation, and visualization, especially with respect to their innate semantic structure. Our research group built a novel high performance hybrid system comprising computational capability for semantic graph database processing utilizing the large multithreaded architecture of the Cray XMT platform, conventional clusters, and large data stores. In this paper we describe that architecture, and present the results of our deploying that for the analysis of the Billion Triple dataset with respect to its semantic factors, including basic properties, connected components, namespace interaction, and typed paths.

99 GENERAL AND MISCELLANEOUS↗

Balancing Impedance and Controllability in Response Reconstruction

One concept in smart dynamic testing is to match the impedance that a component experiences between test and the environment of interest, but this begs the question: how much of an impedance match is needed and could there be too much? In a prior work, the authors performed MIMO testing with a small component connected to various assemblies, each of which had a differing degree of similarity to the actual flight boundary conditions. The results showed that the fidelity of the response at locations away from the control accelerometers was highly sensitive to the impedance. This work presents further case studies to explore these ideas. Subsequent tests are presented for an assembly that presumably matched the impedance even better, and which was also much more flexible, and the results obtained are even worse than when no attention was given to the impedance. Hence, the work presented here suggests that one should seek a balance between 1.) matching the impedance and 2.) improving the controllability of the component of interest. The concepts are explored using both test data of a benchmark component, for which the environment of interest was recorded as the component flew on a sounding rocket.

Shaker Test, Operational Vibration Environment, Su↗

High Performance Descriptive Semantic Analysis of Semantic Graph Databases

As semantic graph database technology grows to address components ranging from extant large triple stores to SPARQL endpoints over SQL-structured relational databases, it will become increasingly important to be able to understand their inherent semantic structure, whether codified in explicit ontologies or not. Our group is researching novel methods for what we call descriptive semantic analysis of RDF triplestores, to serve purposes of analysis, interpretation, visualization, and optimization. But data size and computational complexity makes it increasingly necessary to bring high performance computational resources to bear on this task. Our research group built a novel high performance hybrid system comprising computational capability for semantic graph database processing utilizing the large multi-threaded architecture of the Cray XMT platform, conventional servers, and large data stores. In this paper we describe that architecture and our methods, and present the results of our analyses of basic properties, connected components, namespace interaction, and typed paths such for the Billion Triple Challenge 2010 dataset.

99 GENERAL AND MISCELLANEOUS↗

A Machine Learning Approach to Improve Air Traffic Management Initiatives

Collaborating closely with commercial air carriers and related organizations, the Federal Aviation Administration(FAA) regulates air traffic and ensures the safety and efficiency of air operations. Air traffic controllers make strategic decisions, such as delaying, rerouting, or canceling flights, partly based on guidance provided by the FAA’s Air TrafficControl System Command Center (ATCSCC). The guidance includes, among other things, control measures known asTraffic Management Initiatives (TMIs) designed to enhance safety and improve operational efficiency. TMIs play a crucial role in managing the demand and capacity within the U.S. National Airspace System (NAS). Two major TMIs that are routinely used (primarily to mitigate the adverse effects of bad weather) are Ground Delay Programs (GDPs) andGround Stops (GSs). In a GDP, flights destined for airports facing thunderstorm activity experience delays at their origin airports. This proactive approach minimizes the risk of routing aircraft through hazardous weather conditions and also replaces (fuel burning) airborne delays with ground delays. In a GS, a temporary restriction is imposed on the departure or arrival of aircraft at a specific airport or within a designated airspace. Although other TMIs (e.g., miles-in-trail) are also implemented as part of (air) traffic flow management in the NAS, the focus of this work is on GDPs and GSs. Since TMIs, by design, lead to flight delays or cancellations, it is crucial to put in place the right set of parameters(e.g., scope and duration of the GDP). For example, when the end time of a GDP extends beyond what is necessary, it imposes unnecessary delays on departing flights. This situation could occur as a result of inaccurate prediction of the(required) duration of the GDP based on the weather forecast. On the other hand, if a GDP ends prematurely before the underlying capacity constraints are resolved at the destination airport, it may result in airborne holding. The delicate balance lies in matching the termination of the GDP precisely with the resolution of capacity constraints, avoiding both the imposition of unnecessary ground delays and the need for airborne holding due to premature program termination.Failing to specify the right parameters for TMIs also leads to flight delays, creating a significant obstacle in managing the increasing traffic volumes causing increased work load for the controllers. To address this issue, we propose the integration of Machine Learning (ML) models in the traffic flow management(TFM) pipeline. In current operations, decisions are made by human experts based on extensive training, historical patterns, available traffic and weather data. Since we have an abundance of data from past events that tell us the likely impact of various TMIs, by ingesting historical data, properly trained ML models can offer valuable insights and aid human decision-making. With the FAA increasingly exploring advanced analytics, ML emerges as a focal point for enhancing TFM within the National Airspace System (NAS). As a first step, this study aims to provide traffic controllers with decision-making support for the issuance and adjustment of TMIs. Data analytics and machine learning have been previously employed to address some of the challenges associated with TMIs. Numerous studies have concentrated on various facets of TMI issuance, exploring factors influencing TMI parameters, including arrival rate, airport capacity, and delay prediction. For example, using weather forecasts, several statistical methods were used to produce probabilistic capacity profiles which in conjunction with deterministic models provided insights into the GDP planning process [1–4]. The downside of using deterministic models is that they rely on fixed inputs and predetermined rules, which lack the ability to account for the inherent uncertainty and variability present in real-world scenarios. In a separate series of studies, researchers aimed to predict the occurrences of GDPs and GSs. The majority of these studies utilized various supervised learning methods, including Decision Trees, Naive Bayes, Support VectorMachines, and Random Forests to analyze the influence of weather conditions and arrival demand on TMI incidents[5–8]. However, these studies primarily focused on predicting the incidence of TMIs without explicitly addressing the scope of TMIs, including their duration and their geographical coverage. Furthermore, the emphasis of these studies was largely on GDPs, given their higher frequency and longer duration when compared to GSs. A limited number of studies focused on predicting the parameters of TMIs, specifically addressing their duration and extent. In one such study focusing on optimizing the TMI parameters at San Francisco International Airport (SFO),the authors utilized a probabilistic forecast of fog [9]. They simulated various capacity scenarios based on the (fog)burn-off forecasts, selecting GDP parameters that minimized airborne and overall ground delays. However, this approach exclusively emphasizes stratus (fog) burn-off as the primary determinant of GDP and GS, neglecting other influential factors like severe weather events, runway closures, lower capacity than traffic demand, and other important variables. Given the complexity of predicting the TMI and determining its scope, we seek a more holistic approach. We aim to consider all significant factors that could impact TMIs and their parameters. What sets this research apart is the fusion of all data sources relevant to the issuance and adjustment of TMIs and it represents the first comprehensive attempt to optimize TMIs in this manner. Since this comprehensive solution involves various aspects, we break down the problem into smaller components and input all parameters into a unified model called the “TMI Adjuster”. Figure 1 shows the overall framework and the list of datasets used in each model. The objective of the TMI Adjuster module is to deliver reliable, consistent and expedited recommendations for the progression, adjustment, and termination of TMIs. The ML solution entails developing a pipeline capable of predicting the necessity of a TMI (e.g., GS or GDP) along with its various parameters. For example, in the case of a GS, this includes the scope of the GS either in terms of distance from the destination airport or based on pre-defined airspace sectors. Here, scope refers to those regions and departing airports that are subject to the GS. In this paper, we concentrate on the issuance of GSs in the three major airports in the New York area — LaGuardia(LGA), John F. Kennedy International (JFK), and Newark Liberty International (EWR). We fuse traffic, weather and other relevant aviation data from years 2017 to 2019 to train and validate the ML models. In particular, we use the following datasets: •Terminal Aerodrome Forecast (TAF): meteorological forecasts specific to each airport, issued four times a day, covering predefined time periods. •TMI data: includes all GSs and GDPs along with their respective parameters. •Aviation System Performance Metrics (ASPM): includes traffic related data such as aircraft delays, arrival, and departure rates. •Notices to Airmen (NOTAMs): utilized to extract runway closure data and manage interdependencies between terminals in close proximity. •Flight cancellation data •Airspace Flow Programs (AFP): includes information on flight airborne holdings caused by TMIs. The data preprocessing entails transforming ASPM, TMI, AFP, NOTAMs, and weather data into an hourly format and consolidating all datasets by merging them based on date and time as the primary key. The TMI Adjuster framework comprises two parallel models: one dedicated to GS and a second model focused on GDP. As previously mentioned, our specific focus is on the GS model as a multi-classification problem. In this framework, each data point of the GS model input summarizes ten hours of data. Specifically, the data loader for the GS model generates the input and output of the model as follows: at a given time step, the input includes the actual traffic, weather, and TMI data from the two-hour window before the time step, alongside the weather forecast and scheduled traffic for the next 8 hours starting from the time step. Based on this information, the output of the GS model for each time interval consists of three dimensions. The first dimension represents a binary decision on whether there should be a GS in place for the next hour or not. The second dimension is related to the scope of the GS in the United States, and the third dimension is related to the scope of the GS in Canada (i.e., to determine if the GS impacts airports in Canada).One of the challenges with TMI modeling is the sparsity of TMI events, particularly regarding its scope. To address this challenge in the scope of the GS model output, we implement grouping. The GS scope for the US region is defined based on a list of centers that should be included when the GS is in place. With 20 centers in the US, we utilized historical data to group them into 4 categories. In particular, we summarized our historical data in a graph format where nodes represent centers, and link weights are defined based on the co-occurrence of centers in the scope parameter ofTMIs. By identified strongly connected components in this graph, we were able to partition the centers into four groups. We consider two model structures for the GS Model. Firstly, a hierarchical classification model [10], where the human decision-making for a GS is of hierarchical nature. The decision-maker first decides whether there is a need fora GS, and if the answer is yes, determines the scope. A hierarchical classification model organizes the problem into a class hierarchy, typically a tree or a Directed Acyclic Graph (DAG) structure, and considers the dependency of the decision in the previous step to the next component [10]. Here, we employ the local classifier per level approach, which involves training one multi-class classifier for each level of the class hierarchy. The second structure is the independent structure. In this setting, as the name suggests, we do not consider the dependency of the decisions in the different dimensions of the output of the model. Instead, for each dimension, we train a multi-class classifier independently. Table 1 summarizes GS model statistics for training, validation and testing. The table documents the effect of limiting data to the time steps when there was actually a TMI in place or when a TMI had just terminated. This resulted in a more balanced distribution of the GS class(GS positive class)versus “No GS”(GS negative class), which might help the training process. While JFK and LGA follow very similar distributions, with 40% and 42% GS positive class respectively, EWR has proportionally fewer GS incidents at 28%. Our subsequent phase involves evaluating the performance of both hierarchical structure and independent structure using different state-of-the-art multi-class classifier models such as Random Forest, Decision Trees, K-nearest Neighbors, and Logistic Regression and forecast the duration and scope of the GSs.

Farzan Masrour Shalmani↗

Low-dimensional de Sitter quantum gravity

We study aspects of Jackiw-Teitelboim (JT) quantum gravity in two-dimensional nearly de Sitter (dS) spacetime, as well as pure de Sitter quantum gravity in three dimensions. These are each theories of boundary modes, which include a reparameterization field on each connected component of the boundary as well as topological degrees of freedom. In two dimensions, the boundary theory is closely related to the Schwarzian path integral, and in three dimensions to the quantization of coadjoint orbits of the Virasoro group. Using these boundary theories we compute loop corrections to the wavefunction of the universe, and investigate gravitational contributions to scattering. Along the way, we show that JT gravity in dS2 is an analytic continuation of JT gravity in Euclidean AdS2, and that pure gravity in dS3 is a continuation of pure gravity in Euclidean AdS3. We define a genus expansion for de Sitter JT gravity by summing over higher genus generalizations of surfaces used in the Hartle-Hawking construction. Assuming a conjecture regarding the volumes of moduli spaces of such surfaces, we find that the de Sitter genus expansion is the continuation of the recently discovered AdS genus expansion. Then both may be understood as coming from the genus expansion of the same double-scaled matrix model, which would provide a non-perturbative completion of de Sitter JT gravity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

(2, 2) Scattering and the celestial torus

Analytic continuation from Minkowski space to (2, 2) split signature spacetime has proven to be a powerful tool for the study of scattering amplitudes. Here we show that, under this continuation, null infinity becomes the product of a null interval with a celestial torus (replacing the celestial sphere) and has only one connected component. Spacelike and timelike infinity are time-periodic quotients of AdS 3 . These three components of infinity combine to an S 3 represented as a toric fibration over the interval. Privileged scattering states of scalars organize into SL(2, $\mathbb{R}$) L ×SL(2, $\mathbb{R}$) R conformal primary wave functions and their descendants with real integral or half-integral conformal weights, giving the normally continuous scattering problem a discrete character.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Charge completeness and the massless charge lattice in F-theory models of supergravity

We prove that, for every 6D supergravity theory that has an F-theory description, the property of charge completeness for the connected component of the gauge group (meaning that all charges in the corresponding charge lattice are realized by massive or massless states in the theory) is equivalent to a standard assumption made in F-theory for how geometry encodes the global gauge theory by means of the Mordell-Weil group of the elliptic fibration. This result also holds in 4D F-theory constructions for the parts of the gauge group that come from sections and from 7-branes. We find that in many 6D F-theory models the full charge lattice of the theory is generated by massless charged states; this occurs for each gauge factor where the associated anomaly coefficient satisfies a simple positivity condition. We describe many of the cases where this massless charge sufficiency condition holds, as well as exceptions where the positivity condition fails, and analyze the related global structure of the gauge group and associated Mordell-Weil torsion in explicit F-theory models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Orthogonality Graphs of Matrices Over Skew Fields

The paper is devoted to studying the orthogonality graph of the matrix ring over a skew field. It is shown that for n ≥ 3 and an arbitrary skew field 𝔻, the orthogonality graph of the ring M{sub n}(𝔻) of n × n matrices over a skew field 𝔻 is connected and has diameter 4. If n = 2, then the graph of the ring M{sub n}(𝔻) is a disjoint union of connected components of diameters 1 and 2. As a corollary, the corresponding results on the orthogonality graphs of simple Artinian rings are obtained.

97 MATHEMATICS AND COMPUTING↗

Influence of grid resolution, parcel size and drag models on bubbling fluidized bed simulation

Here in this paper, a bubbling fluidized bed is simulated with different numerical parameters, such as grid resolution and parcel size. We examined also the effect of using two homogeneous drag correlations and a heterogeneous drag based on the energy minimization method. A fast and reliable bubble detection algorithm was developed based on the connected component labeling. The radial and axial solids volume fraction profiles are compared with experiment data and previous simulation results. These results show a significant influence of drag models on bubble size and voidage distributions and a much less dependence on numerical parameters. With a heterogeneous drag model that accounts for sub-scale structures, the void fraction in the bubbling fluidized bed can be well captured with coarse grid and large computation parcels. Refining the CFD grid and reducing the parcel size can improve the simulation results but with a large increase in computation cost.

97 MATHEMATICS AND COMPUTING↗