Search

For a prime $\ell$, let $h_\ell(K)$ denote the $\ell$-part of the class number of the number field $K$. We investigate upper bounds for $h_\ell(K)$ when $K$ is quadratic or cubic, particularly in the case in which the discriminant of $K$ is smooth. This is achieved using properties of Dirichlet $L$-functions.

Dynamic metasurface antennas (DMAs) beamform through low-powered components that enable reconfiguration of each radiating element. Previous research on a single-user multiple-input-single-output (MISO) system with a dynamic metasurface antenna at the transmitter has focused on maximizing the beamforming gain at a fixed operating frequency. The DMA, however, has a frequency-selective response that leads to magnitude degradation for frequencies away from the resonant frequency of each element. This causes reduction in beamforming gain if the DMA only operates at a fixed frequency. We exploit the frequency reconfigurability of the DMA to dynamically optimize both the operating frequency and the element configuration, maximizing the beamforming gain. We leverage this approach to develop a single-shot beam training procedure using a DMA sub-array architecture that estimates the receiver's angular direction with a single OFDM pilot signal. We evaluate the beamforming gain performance of the DMA array using the receiver's angular direction estimate obtained from beam training. Our results show that it is sufficient to use a limited number of resonant frequency states to do both beam training and beamforming instead of using an infinite resolution DMA beamformer.

Learning-based downlink power control in cell-free massive multiple-input multiple-output (CFmMIMO) systems offers a promising alternative to conventional iterative optimization algorithms, which are computationally intensive due to online iterative steps. Existing learning-based methods, however, often fail to exploit the intrinsic structure of channel data and neglect pilot allocation information, leading to suboptimal performance, especially in large-scale networks with many users. This paper introduces the pilot contamination-aware power control (PAPC) transformer neural network, a novel approach that integrates pilot allocation data into the network, effectively handling pilot contamination scenarios. PAPC employs the attention mechanism with a custom masking technique to utilize structural information and pilot data. The architecture includes tailored preprocessing and post-processing stages for efficient feature extraction and adherence to power constraints. Trained in an unsupervised learning framework, PAPC is evaluated against the accelerated proximal gradient (APG) algorithm, showing comparable spectral efficiency fairness performance while significantly improving computational efficiency. Simulations demonstrate PAPC's superior performance over fully connected networks (FCNs) that lack pilot information, its scalability to large-scale CFmMIMO networks, and its computational efficiency improvement over APG. Additionally, by employing padding techniques, PAPC adapts to the dynamically varying number of users without retraining., Comment: 13 paged (double-column), 10 figures, 3 tables

This paper proposes a nonlinear magnetics model for Permanent Magnet Synchronous Machines (PMSMs) that accurately captures the effects of magnetic saturation in the machine iron and variations in rotor temperature on the permanent magnet excitation. The proposed model considers the permanent magnet as a current source rather than the more commonly used flux-linkage source. A comparison of the two modelling approaches is conducted using Finite Element Analysis (FEA) for different machine designs as well as experimental validation, where it is shown that the proposed model has substantially better accuracy. The proposed model decouples magnetic saturation and rotor temperature effects in the current/flux-linkage relationship, allowing for adaptive estimation of the PM excitation.

Effect modification occurs when a covariate alters the relative effectiveness of treatment compared to control. It is widely understood that, when effect modification is present, treatment recommendations may vary by population and by subgroups within the population. Population-adjustment methods are increasingly used to adjust for differences in effect modifiers between study populations and to produce population-adjusted estimates in a relevant target population for decision-making. It is also widely understood that marginal and conditional estimands for non-collapsible effect measures, such as odds ratios or hazard ratios, do not in general coincide even without effect modification. However, the consequences of both non-collapsibility and effect modification together are little-discussed in the literature. In this paper, we set out the definitions of conditional and marginal estimands, illustrate their properties when effect modification is present, and discuss the implications for decision-making. In particular, we show that effect modification can result in conflicting treatment rankings between conditional and marginal estimates. This is because conditional and marginal estimands correspond to different decision questions that are no longer aligned when effect modification is present. For time-to-event outcomes, the presence of covariates implies that marginal hazard ratios are time-varying, and effect modification can cause marginal hazard curves to cross. We conclude with practical recommendations for decision-making in the presence of effect modification, based on pragmatic comparisons of both conditional and marginal estimates in the decision target population. Currently, multilevel network meta-regression is the only population-adjustment method capable of producing both conditional and marginal estimates, in any decision target population., Comment: 30 pages, 8 figures

We carried out a comprehensive crystal structure characterization of Ti-doped lithium ruthenate (Li$_2$Ti$_x$Ru$_{1-x}$O$_3$), to investigate the effect of Ti-doping on the structural phase transition. Experimental tools sensitive to the average structure (X-ray diffraction), as well as those sensitive to local structure (Extended X-ray Absorption Fine Structure, EXAFS; pair distribution function, PDF) are used. We observed non-monotonic dependence of the structural transition temperature on the Ti-doping level. At low doping, the transition temperature slightly increases with doping, while at high doping, the temperature decreases significantly with doping. We note two important observations from our studies. First, Ti K-edge EXAFS data shows persistent Ti-Ru dimerization even with substantial Ti doping. Second, we were able to use the PDF data to estimate the dimer correlation length above the transition temperature, which would correspond to the size of the proposed local `dimer clusters' formed by Ru-Ru and Ti-Ru neighbours. The dimer correlation length is found to be around 10~\AA, which remains robust regardless of doping. Our study therefore suggests that Ti$^{4+}$ with its $d^0$ electronic configuration is a special type of dopant when replacing Ru., Comment: 12 pages, 11 figures

Given a graph $H$, we say a graph $G$ is properly rainbow $H$-saturated if there is a proper edge-coloring of $G$ which contains no rainbow copy of $H$, but adding any edge to $G$ makes such an edge-coloring impossible. The proper rainbow saturation number, denoted $\text{sat}^*(n,H)$, is the minimum number of edges in an $n$-vertex rainbow $H$-saturated graph. We determine the proper rainbow saturation number for paths up to an additive constant and asymptotically determine $\text{sat}^*(n,K_4)$. In addition, we bound $\text{sat}^*(n,H)$ when $H$ is a larger clique, tree of diameter at least 4, or odd cycle.

In 1891, Hurwitz introduced the enumeration of genus $g$, degree $d$, branched covers of the Riemann sphere with simple ramification over prescribed points and no branching elsewhere. He showed that for fixed degree $d$, the enumeration possesses a remarkable structure. More precisely, it can be expressed as a linear combination of exponentials $m^{2g-2+2d}$, where $m$ ranges over the integers from $1$ to $\binom{d}{2}$. In this paper, we generalise this structural result to Hurwitz numbers that enumerate branched covers which also have a prescribed ramification profile over one point. Our proof fundamentally uses the infinite wedge space, in particular the connected correlators of products of $\mathcal{E}$-operators. The recent study of Hurwitz numbers has often focussed on their structure with fixed genus and varying ramification profile. Our main result is orthogonal to this, allowing for the explicit calculation and the asymptotic analysis of Hurwitz numbers in large genus. We pose the broad question of which other enumerative problems exhibit analogous structure. We prove that orbifold Hurwitz numbers can also be expressed as a linear combination of exponentials and conjecture that monotone Hurwitz numbers share a similar structure, but with the inclusion of an additional linear term., Comment: 18 pages

In many industrial settings, users wish to ask questions whose answers may be found in structured data sources such as a spreadsheets, databases, APIs, or combinations thereof. Often, the user doesn't know how to identify or access the right data source. This problem is compounded even further if multiple (and potentially siloed) data sources must be assembled to derive the answer. Recently, various Text-to-SQL applications that leverage Large Language Models (LLMs) have addressed some of these problems by enabling users to ask questions in natural language. However, these applications remain impractical in realistic industrial settings because they fail to cope with the data source heterogeneity that typifies such environments. In this paper, we address heterogeneity by introducing the siwarex platform, which enables seamless natural language access to both databases and APIs. To demonstrate the effectiveness of siwarex, we extend the popular Spider dataset and benchmark by replacing some of its tables by data retrieval APIs. We find that siwarex does a good job of coping with data source heterogeneity. Our modified Spider benchmark will soon be available to the research community

We consider a setting involving $N$ agents, where each agent interacts with an environment modeled as a Markov Decision Process (MDP). The agents' MDPs differ in their reward functions, capturing heterogeneous objectives/tasks. The collective goal of the agents is to communicate intermittently via a central server to find a policy that maximizes the average of long-term cumulative rewards across environments. The limited existing work on this topic either only provide asymptotic rates, or generate biased policies, or fail to establish any benefits of collaboration. In response, we propose Fast-FedPG - a novel federated policy gradient algorithm with a carefully designed bias-correction mechanism. Under a gradient-domination condition, we prove that our algorithm guarantees (i) fast linear convergence with exact gradients, and (ii) sub-linear rates that enjoy a linear speedup w.r.t. the number of agents with noisy, truncated policy gradients. Notably, in each case, the convergence is to a globally optimal policy with no heterogeneity-induced bias. In the absence of gradient-domination, we establish convergence to a first-order stationary point at a rate that continues to benefit from collaboration., Comment: Accepted to the Decision and Control Conference (CDC), 2024

The online ordered Ramsey game is played between two players, Builder and Painter, on an infinite sequence of vertices with ordered graphs $(G_1,G_2)$, which have linear orderings on their vertices. On each turn, Builder first selects an edge before Painter colors it red or blue. Builder's objective is to construct either an ordered red copy of $G_1$ or an ordered blue copy of $G_2$, while Painter's objective is to delay this for as many turns as possible. The online ordered Ramsey number $r_o(G_1,G_2)$ is the number of turns Builder takes to win in the case that both players play optimally. Few lower bounds are known for this quantity. In this paper, we introduce a succinct proof of a new lower bound based on the maximum left- and right-degrees in the ordered graphs. We also upper bound $r_o(G_1,G_2)$ in two cases: when $G_1$ is a cycle and $G_2$ a complete bipartite graph, and when $G_1$ is a tree and $G_2$ a clique., Comment: 8 pages

De novo molecule design has become a highly active research area, advanced significantly through the use of state-of-the-art generative models. Despite these advances, several fundamental questions remain unanswered as the field increasingly focuses on more complex generative models and sophisticated molecular representations as an answer to the challenges of drug design. In this paper, we return to the simplest representation of molecules, and investigate overlooked limitations of classical generative approaches, particularly Variational Autoencoders (VAEs) and auto-regressive models. We propose a hybrid model in the form of a novel regularizer that leverages the strengths of both to improve validity, conditional generation, and style transfer of molecular sequences. Additionally, we provide an in depth discussion of overlooked assumptions of these models' behaviour.

We present the design and observations of low resolution JWST/NIRSpec PRISM spectroscopy from the Ultradeep NIRSpec and NIRCam ObserVations before the Epoch of Reionization (UNCOVER) Cycle 1 JWST Treasury program. Targets are selected using JWST/NIRCam photometry from UNCOVER and other programs, and cover a wide range of categories and redshifts to ensure the legacy value of the survey. These categories include the first galaxies at $z\gtrsim10$, faint galaxies during the Epoch of Reionization ($z\sim6-8$), high redshift AGN ($z\gtrsim6$), Population III star candidates, distant quiescent and dusty galaxies ($1\lesssim z \lesssim 6$), and filler galaxies sampling redshift--color--magnitude space from $z\sim 0.1-13$. Seven NIRSpec MSA masks across the extended Abell 2744 cluster were observed, along with NIRCam parallel imaging in 8 filters (F090W, F115W, F150W, F200W, F277W, F356W, F410M, F444W, F480M) over a total area of ~26 arcmin$^2$, overlapping existing HST coverage from programs including the Hubble Frontier Fields and BUFFALO. We successfully observed 553 objects down to $m_{\mathrm{F444W}}\sim30\mathrm{AB}$, and by leveraging mask overlaps, we reach total on-target exposure times ranging from 2.4-16.7h. We demonstrate the success rate and distribution of confirmed redshifts, and also highlight the rich information revealed by these ultradeep spectra for a subset of our targets. An updated lens model of Abell 2744 is also presented, including 14 additional spectroscopic redshifts and finding a total cluster mass of $M_{\mathrm{SL}}=(2.1\pm0.3)\times10^{15}\,\mathrm{M}_{\odot}$. We publicly release reduced 1D and 2D spectra for all objects observed in Summer 2023 along with a spectroscopic redshift catalog and the updated lens model of the cluster (https://jwst-uncover.github.io/DR4.html)., Comment: 19 pages, 9 figures, 4 tables, submitted to ApJ, comments welcome! Data available at: https://jwst-uncover.github.io/DR4.html (v2: figure format correction)

We study linear scaling relations in electron-phonon superconductors. By combining numerical and analytical techniques, we find linear Homes scaling relations between the zero-temperature superfluid density and the normal-state DC conductivity. This is due to Galilean invariance being broken, either via a large impurity scattering rate or inelastic scattering of electrons and Einstein phonons at large electron-phonon coupling. Our work thus shows that Homes scaling is more universal than either cuprate or BCS-like physics, and is instead a fundamental result in a wide class of superconductors., Comment: Main article: 7 pages, 3 figures. Supplemental material: 32 pages, 14 figures

Using deep imaging from the CANDELS and HFF surveys, we present bulge+disc decompositions with GalfitM for $\sim$17,000 galaxies over $0.2 \leq z\leq 1.5$. We use various model parameters to select reliable samples of discs and bulges, and derive their stellar masses using an empirically calibrated relation between mass-to-light ratio and colour. Across our entire redshift range, we show that discs follow stellar mass-size relations that are consistent with those of star-forming galaxies, suggesting that discs primarily evolve via star formation. In contrast, the stellar mass-size relations of bulges are mass-independent. Our novel dataset further enables us to separate components into star-forming and quiescent based on their specific star formation rates. We find that both star-forming discs and star-forming bulges lie on stellar mass-size relations that are similar to those of star-forming galaxies, while quiescent discs are typically smaller than star-forming discs and lie on steeper relations, implying distinct evolutionary mechanisms. Similar to quiescent galaxies, quiescent bulges show a flattening in the stellar mass-size relation at $\sim$10$^{10}$M$_\odot$, below which they show little mass dependence. However, their best-fitting relations have lower normalisations, indicating that at a given mass, bulges are smaller than quiescent galaxies. Finally, we obtain rest-frame colours for individual components, showing that bulges typically have redder colours than discs, as expected. We visually derive UVJ criteria to separate star-forming and quiescent components and show that this separation agrees well with component colour. HFF bulge+disc decomposition catalogues used for these analyses are publicly released with this paper., Comment: 30 pages, 18 figures, and 6 tables. Resubmitted to MNRAS after addressing a thorough and constructive referee report

We report the first detection of coherent elastic neutrino-nucleus scattering (CEvNS) on germanium, measured at the Spallation Neutron Source at Oak Ridge National Laboratory. The Ge-Mini detector of the COHERENT collaboration employs large-mass, low-noise, high-purity germanium spectrometers, enabling excellent energy resolution, and an analysis threshold of 1.5 keV electron-equivalent ionization energy. We observe a on-beam excess of 20.6$_{+7.1}^{-6.3}$ counts with a total exposure of 10.22 GWhkg and we reject the no-CEvNS hypothesis with 3.9 sigma significance. The result agrees with the predicted standard model of particle physics signal rate within 2 sigma., Comment: 7 pages, 5 figures

Sensor-aided beamforming reduces the overheads associated with beam training in millimeter-wave (mmWave) multi-input-multi-output (MIMO) communication systems. Most prior work, though, neglects the challenges associated with establishing multi-user (MU) communication links in mmWave MIMO systems. In this paper, we propose a new framework for sensor-aided beam training in MU mmWave MIMO system. We leverage the beamspace representation of the channel that contains only the angles-of-departure (AoDs) of the channel's significant multipath components. We show that a deep neural network (DNN)-based multimodal sensor fusion framework can estimate the beamspace representation of the channel using sensor data. To aid the DNN training, we introduce a novel supervised soft-contrastive loss (SSCL) function that leverages the inherent similarity between channels to extract similar features from the sensor data for similar channels. Finally, we design an MU beamforming strategy that uses the estimated beamspaces of the channels to select analog precoders for all users in a way that prevents transmission to multiple users over the same directions. Compared to the baseline, our approach achieves more than 4$\times$ improvement in the median sum-spectral efficiency (SE) at 42 dBm equivalent isotropic radiated power (EIRP) with 4 active users. This demonstrates that sensor data can provide more channel information than previously explored, with significant implications for machine learning (ML)-based communication and sensing systems.

By classical results of Malcev, cancellative monoids need not be group-embeddable. In this paper, we describe and give presentations for and study an infinite family $\mathcal{M}_n$ of cancellative monoids which are not group-embeddable, originating from Malcev's original work. We show that $\mathcal{M}_n$ is right LCM for $n \geq 2$, owing to applications in the study of $\mathrm{C}^*$-algebras by Brix, Bruce and Dor-On. We finish by showing that $\mathcal{M}_1$ is not right LCM, but is $2$-aligned., Comment: 10 pages

In various biomedical studies, the focus of analysis centers on the magnitudes of data, particularly when algebraic signs are irrelevant or lost. To analyze the magnitude outcomes in repeated measures studies, using models with random effects is essential. This is because random effects can account for individual heterogeneity, enhancing parameter estimation precision. However, there are currently no established regression methods that incorporate random effects and are specifically designed for magnitude outcomes. This article bridges this gap by introducing Bayesian regression modeling approaches for analyzing magnitude data, with a key focus on the incorporation of random effects. Additionally, the proposed method is extended to address multiple causes of informative dropout, commonly encountered in repeated measures studies. To tackle the missing data challenge arising from dropout, a joint modeling strategy is developed, building upon the previously introduced regression techniques. Two numerical simulation studies are conducted to assess the validity of our method. The chosen simulation scenarios aim to resemble the conditions of our motivating study. The results demonstrate that the proposed method for magnitude data exhibits good performance in terms of both estimation accuracy and precision, and the joint models effectively mitigate bias due to missing data. Finally, we apply proposed models to analyze the magnitude data from the motivating study, investigating if sex impacts the magnitude change in diaphragm thickness over time for ICU patients.

Given a $k$-uniform hypergraph $G$ and a set of $k$-uniform hypergraphs $\mathcal{H}$, the generalized Ramsey number $f(G,\mathcal{H},q)$ is the minimum number of colors needed to edge-color $G$ so that every copy of every hypergraph $H\in \mathcal{H}$ in $G$ receives at least $q$ different colors. In this note we obtain bounds, some asymptotically sharp, on several generalized Ramsey numbers, when $G=K_n$ or $G=K_{n,n}$ and $\mathcal{H}$ is a set of cycles or paths, and when $G=K_n^k$ and $\mathcal{H}$ contains a clique on $k+2$ vertices or a tight cycle.

The ongoing fifth-generation (5G) standardization is exploring the use of deep learning (DL) methods to enhance the new radio (NR) interface. Both in academia and industry, researchers are investigating the performance and complexity of multiple DL architecture candidates for specific one-sided and two-sided use cases such as channel state estimation (CSI) feedback, CSI prediction, beam management, and positioning. In this paper, we set focus on the CSI prediction task and study the performance and generalization of the two main DL layers that are being extensively benchmarked within the DL community, namely, multi-head self-attention (MSA) and state-space model (SSM). We train and evaluate MSA and SSM layers to predict the next slot for uplink and downlink communication scenarios over urban microcell (UMi) and urban macrocell (UMa) OFDM 5G channel models. Our numerical results demonstrate that SSMs exhibit better prediction and generalization capabilities than MSAs only for SISO cases. For MIMO scenarios, however, the MSA layer outperforms the SSM one. While both layers represent potential DL architectures for future DL-enabled 5G use cases, the overall investigation of this paper favors MSAs over SSMs.

We introduce an interesting class of left adequate monoids which we call pretzel monoids. These, on the one hand, are monoids of birooted graphs with respect to a natural `glue-and-fold' operation, and on the other hand, are shown to be defined in the category of left adequate monoids by a natural class of presentations. They are also shown to be the free idempotent-pure expansions of right cancellative monoids, making them, in some sense, the left adequate analogues of Margolis-Meakin expansions for inverse monoids. The construction recovers the second author's geometric model of free left adequate monoids when the right cancellative monoid is free., Comment: 34 pages, 10 figures

In this paper, we describe the "Medium Bands, Mega Science" JWST Cycle 2 survey (JWST-GO-4111) and demonstrate the power of these data to reveal both the spatially-integrated and spatially-resolved properties of galaxies from the local universe to the era of cosmic dawn. Executed in November 2023, MegaScience obtained ~30 arcmin^2 of deep multiband NIRCam imaging centered on the z~0.3 Abell 2744 cluster, including eleven medium-band filters and the two shortest-wavelength broad-band filters, F070W and F090W. Together, MegaScience and the UNCOVER Cycle 1 treasury program provide a complete set of deep (~28-30 mag) images in all NIRCam medium- and broad-band filters. This unique dataset allows us to precisely constrain photometric redshifts, map stellar populations and dust attenuation for large samples of distant galaxies, and examine the connection between galaxy structures and formation histories. MegaScience also includes ~17 arcmin^2 of NIRISS parallel imaging in two broad-band and four medium-band filters from 0.9-4.8um, expanding the footprint where robust spectral energy distribution (SED) fitting is possible. We provide example SEDs and multi-band cutouts at a variety of redshifts, and use a catalog of JWST spectroscopic redshifts to show that MegaScience improves both the scatter and catastrophic outlier rate of photometric redshifts by factors of 2-3. Additionally, we demonstrate the spatially-resolved science enabled by MegaScience by presenting maps of the [OIII] line emission and continuum emission in three spectroscopically-confirmed z>6 galaxies. We show that line emission in reionization-era galaxies can be clumpy, extended, and spatially offset from continuum emission, implying that galaxy assembly histories are complex even at these early epochs. We publicly release fully reduced mosaics and photometric catalogs for both the NIRCam primary and NIRISS parallel fields., Comment: 21 pages, 10 figures. Fully reduced imaging, photometric catalogs, and photometric redshift fits publicly available at https://jwst-uncover.github.io/megascience/

Codebook-based beam selection is one approach for configuring millimeter wave communication links. The overhead required to reconfigure the transmit and receive beam pair, though, increases in highly dynamic vehicular communication systems. Location information coupled with machine learning (ML) beam recommendation is one way to reduce the overhead of beam pair selection. In this paper, we develop ML-based location-aided approaches to decouple the beam selection between the user equipment (UE) and the base station (BS). We quantify the performance gaps due to decoupling beam selection and also disaggregating the UE's location information from the BS. Our simulation results show that decoupling beam selection with available location information at the BS performs comparable to joint beam pair selection at the BS. Moreover, decoupled beam selection without location closely approaches the performance of beam pair selection at the BS when sufficient beam pairs are swept., Comment: Submitted to IEEE BlackSeaCom 2024, 6 pages, 5 figures

Additive manufacturing is an expanding multidisciplinary field encompassing applications including medical devices, aerospace components, microfabrication strategies, and artificial organs. Among additive manufacturing approaches, light-based printing technologies, including two-photon polymerization, projection micro stereolithography, and volumetric printing, have garnered significant attention due to their speed, resolution and/or potential applications for biofabrication. In this study, we introduce dynamic interface printing (DIP), a new 3D printing approach that leverages an acoustically modulated, constrained air-liquid boundary to rapidly generate cm-scale three-dimensional structures within tens of seconds. Distinct from volumetric approaches, this process eliminates the need for intricate feedback systems, specialized chemistry, or complex optics while maintaining rapid printing speeds. We demonstrate the versatility of this technique across a broad array of materials and intricate geometries, including those that would be impossible to print via conventional layer-by-layer methods. In doing so, we demonstrate the rapid fabrication of complex structures in-situ, overprinting, structural parallelisation, and biofabrication utility. Moreover, we showcase that the formation of surface waves at this boundary enables enhanced mass transport, material flexibility, and permits three-dimensional particle patterning. We therefore anticipate that this approach will be invaluable for applications where high resolution, scalable throughput, and biocompatible printing is required., Comment: 63 Pages, 4 Figures, 18 Supplementary Figures

Multipliers can be used to guarantee both the Lyapunov stability and input-output stability of Lurye systems with time-invariant memoryless slope-restricted nonlinearities. If a dynamic multiplier is used there is no guarantee the closed-loop system has finite incremental gain. It has been suggested in the literature that without this guarantee such a system may be critically sensitive to time-varying exogenous signals including noise. We show that multipliers guarantee the power gain of the system to be bounded and quantifiable. Furthermore power may be measured about an appropriate steady state bias term, provided the multiplier does not require the nonlinearity to be odd. Hence dynamic multipliers can be used to guarantee Lurye systems have low sensitivity to noise, provided other exogenous systems have constant steady state. We illustrate the analysis with an example where the exogenous signal is a power signal with non-zero mean.

Obtaining accurate and timely channel state information (CSI) is a fundamental challenge for large antenna systems. Mobile systems like 5G use a beam management framework that joins the initial access, beamforming, CSI acquisition, and data transmission. The design of codebooks for these stages, however, is challenging due to their interrelationships, varying array sizes, and site-specific channel and user distributions. Furthermore, beam management is often focused on single-sector operations while ignoring the overarching network- and system-level optimization. In this paper, we proposed an end-to-end learned codebook design algorithm, network beamspace learning (NBL), that captures and optimizes codebooks to mitigate interference while maximizing the achievable performance with extremely large hybrid arrays. The proposed algorithm requires limited shared information yet designs codebooks that outperform traditional codebooks by over 10dB in beam alignment and achieve more than 25% improvements in network spectral efficiency., Comment: To be submitted to IEEE Transactions on Wireless Communications

The use of one-bit analog-to-digital converter (ADC) has been considered as a viable alternative to high resolution counterparts in realizing and commercializing massive multiple-input multiple-output (MIMO) systems. However, the issue of discarding the amplitude information by one-bit quantizers has to be compensated. Thus, carefully tailored methods need to be developed for one-bit channel estimation and data detection as the conventional ones cannot be used. To address these issues, the problems of one-bit channel estimation and data detection for MIMO orthogonal frequency division multiplexing (OFDM) system that operates over uncorrelated frequency selective channels are investigated here. We first develop channel estimators that exploit Gaussian discriminant analysis (GDA) classifier and approximated versions of it as the so-called weak classifiers in an adaptive boosting (AdaBoost) approach. Particularly, the combination of the approximated GDA classifiers with AdaBoost offers the benefit of scalability with the linear order of computations, which is critical in massive MIMO-OFDM systems. We then take advantage of the same idea for proposing the data detectors. Numerical results validate the efficiency of the proposed channel estimators and data detectors compared to other methods. They show comparable/better performance to that of the state-of-the-art methods, but require dramatically lower computational complexities and run times.

We report the spectroscopic confirmation of a massive ($\log(M_\star/M_\odot)=10.34 \pm_{0.07}^{0.06}$), HST-dark ($m_\mathrm{F150W} - m_\mathrm{F444W} = 3.6$) quiescent galaxy at $z_{spec}=3.97$ in the UNCOVER survey. NIRSpec/PRISM spectroscopy and a non-detection in deep ALMA imaging surprisingly reveals that the galaxy is consistent with a low ($<$10 $M_\odot \ \mathrm{yr^{-1}}$) star formation rate despite evidence for moderate dust attenuation. The F444W image is well modeled with a two component \sersic fit that favors a compact, $r_e\sim200$ pc, $n\sim2.9$ component and a more extended, $r_e\sim1.6$ kpc, $n\sim1.7$ component. The galaxy exhibits strong color gradients: the inner regions are significantly redder than the outskirts. Spectral energy distribution models that reproduce both the red colors and low star formation rate in the center of UNCOVER 18407 require both significant ($A_v\sim1.4$ mag) dust attenuation and a stellar mass-weighted age of 900 Myr, implying 50\% of the stars in the core already formed by $z=7.5$. Using spatially resolved annular mass-to-light measurements enabled by the galaxy's moderate magnification ($\mu=2.12\pm_{0.01}^{0.05}$) to reconstruct a radial mass profile from the best-fitting two-component \sersic model, we infer a total mass-weighted $r_\mathrm{eff} = 0.72 \pm_{0.11}^{0.15}$ kpc and log$(\Sigma_\mathrm{1 kpc} \ [\mathrm{M_\odot/kpc^2}]) = 9.61 \pm_{0.10}^{0.08}$. The early formation of a dense, low star formation rate, and dusty core embedded in a less attenuated stellar envelope suggests an evolutionary link between the earliest-forming massive galaxies and their elliptical descendants. Furthermore, the disparity between the global, integrated dust properties and the spatially resolved gradients highlights the importance of accounting for radially varying stellar populations when characterizing the early growth of galaxy structure., Comment: 17 pages, 9 figures, 2 tables. Resubmitted to ApJ after response to referee and update to include new medium band imaging from the JWST MEGASCIENCE program. Comments welcome!

Fluid antenna systems (FASs) can reconfigure their locations freely within a spatially continuous space. To keep favorable antenna positions, the channel state information (CSI) acquisition for FASs is essential. While some techniques have been proposed, most existing FAS channel estimators require several channel assumptions, such as slow variation and angular-domain sparsity. When these assumptions are not reasonable, the model mismatch may lead to unpredictable performance loss. In this paper, we propose the successive Bayesian reconstructor (S-BAR) as a general solution to estimate FAS channels. Unlike model-based estimators, the proposed S-BAR is prior-aided, which builds the experiential kernel for CSI acquisition. Inspired by Bayesian regression, the key idea of S-BAR is to model the FAS channels as a stochastic process, whose uncertainty can be successively eliminated by kernel-based sampling and regression. In this way, the predictive mean of the regressed stochastic process can be viewed as the maximum a posterior (MAP) estimator of FAS channels. Simulation results verify that, in both model-mismatched and model-matched cases, the proposed S-BAR can achieve higher estimation accuracy than the existing schemes., Comment: Accepted by IEEE WCNC 2024. This paper proposes S-BAR as a general solution to estimate FAS channels. More insights can be found in the journal version of this paper: arXiv:2312.06551. arXiv admin note: substantial text overlap with arXiv:2312.06551

The paper focuses on real-time facial expression recognition (FER) systems as an important component in various real-world applications such as social robotics. We investigate two hardware options for the deployment of FER machine learning (ML) models at the edge: neuromorphic hardware versus edge AI accelerators. Our study includes exhaustive experiments providing comparative analyses between the Intel Loihi neuromorphic processor and four distinct edge platforms: Raspberry Pi-4, Intel Neural Compute Stick (NSC), Jetson Nano, and Coral TPU. The results obtained show that Loihi can achieve approximately two orders of magnitude reduction in power dissipation and one order of magnitude energy savings compared to Coral TPU which happens to be the least power-intensive and energy-consuming edge AI accelerator. These reductions in power and energy are achieved while the neuromorphic solution maintains a comparable level of accuracy with the edge accelerators, all within the real-time latency requirements.

Background. The Expected Value of Sample Information (EVSI) measures the expected benefits that could be obtained by collecting additional data. Estimating EVSI using the traditional nested Monte Carlo method is computationally expensive but the recently developed Gaussian approximation (GA) approach can efficiently estimate EVSI across different sample sizes. However, the conventional GA may result in biased EVSI estimates if the decision models are highly nonlinear. This bias may lead to suboptimal study designs when GA is used to optimize the value of different studies. Therefore, we extend the conventional GA approach to improve its performance for nonlinear decision models. Methods. Our method provides accurate EVSI estimates by approximating the conditional benefit based on two steps. First, a Taylor series approximation is applied to estimate the conditional benefit as a function of the conditional moments of the parameters of interest using a spline, which is fitted to the samples of the parameters and the corresponding benefits. Next, the conditional moments of parameters are approximated by the conventional GA and Fisher information. The proposed approach is applied to several data collection exercises involving non-Gaussian parameters and nonlinear decision models. Its performance is compared with the nested Monte Carlo method, the conventional GA approach, and the nonparametric regression-based method for EVSI calculation. Results. The proposed approach provides accurate EVSI estimates across different sample sizes when the parameters of interest are non-Gaussian and the decision models are nonlinear. The computational cost of the proposed method is similar to other novel methods. Conclusions. The proposed approach can estimate EVSI across sample sizes accurately and efficiently, which may support researchers in determining an economically optimal study design using EVSI., Comment: 11 pages, 2 figures, presented at 44th Medical Decision Making Annual North American Meeting

Configuring the hybrid precoders and combiners in a millimeter wave (mmWave) multiuser (MU) multiple-input multiple-output (MIMO) system is challenging in frequency selective channels. In this paper, we develop a system that uses compressive estimation on the uplink to configure precoders and combiners for the downlink (DL). In the first step, the base station (BS) simultaneously estimates the channels from all the mobile stations (MSs) on each subcarrier. To reduce the number of measurements required, compressed sensing techniques are developed that exploit common support on the different subcarriers. In the second step, exploiting reciprocity and the channel estimates, the base station designs hybrid precoders and combiners. Two algorithms are developed for this purpose, with different performance and complexity tradeoffs: 1) a factorization of the purely digital solution, and 2) an iterative hybrid design. Extensive numerical experiments evaluate the proposed solutions comparing to state-of-the-art strategies, and illustrating design tradeoffs in overhead, complexity, and performance.

The effective sample size (ESS) measures the informational value of a probability distribution in terms of an equivalent number of study participants. The ESS plays a crucial role in estimating the Expected Value of Sample Information (EVSI) through the Gaussian approximation approach. Despite the significance of ESS, existing ESS estimation methods within the Gaussian approximation framework are either computationally expensive or potentially inaccurate. To address these limitations, we propose a novel approach that estimates the ESS using the summary statistics of generated datasets and nonparametric regression methods. The simulation results suggest that the proposed method provides accurate ESS estimates at a low computational cost, making it an efficient and practical way to quantify the information contained in the probability distribution of a parameter. Overall, determining the ESS can help analysts understand the uncertainty levels in complex prior distributions in the probability analyses of decision models and perform efficient EVSI calculations., Comment: 5 pages

We introduce a new tool useful for greedy coloring, which we call the forb-flex method, and apply it to odd coloring and proper conflict-free coloring of planar graphs. The odd chromatic number, denoted $\chi_{\mathsf{o}}(G)$, is the smallest number of colors needed to properly color $G$ such that every non-isolated vertex of $G$ has a color appearing an odd number of times in its neighborhood. The proper conflict-free chromatic number, denoted $\chi_{\mathsf{PCF}}(G)$, is the smallest number of colors needed to properly color $G$ such that every non-isolated vertex of $G$ has a color appearing uniquely in its neighborhood. Our new tool works by carefully counting the structures in the neighborhood of a vertex and determining if a neighbor of a vertex can be recolored at the end of a greedy coloring process to avoid conflicts. Combining this with the discharging method allows us to prove $\chi_{\mathsf{PCF}}(G) \leq 4$ for planar graphs of girth at least 11, and $\chi_{\mathsf{o}}(G) \leq 4$ for planar graphs of girth at least 10. These results improve upon the recent works of Cho, Choi, Kwon, and Park., Comment: 32 pages, 11 figures

In this paper, we investigate finite solvable tidy groups. We classify the tidy $\{ p, q \}$-groups. Combining this with a previous result, we are able to characterize the finite tidy solvable groups. Using this characterization, we bound the Fitting height of finite tidy solvable groups and we prove that the quotients of finite tidy solvable groups are tidy.

The increasing demand for wireless data transfer has been the driving force behind the widespread adoption of Massive MIMO (multiple-input multiple-output) technology in 5G. The next-generation MIMO technology is now being developed to cater to the new data traffic and performance expectations generated by new user devices and services in the next decade. The evolution towards "ultra-massive MIMO (UM-MIMO)" is not only about adding more antennas but will also uncover new propagation and hardware phenomena that can only be treated by jointly utilizing insights from the communication, electromagnetic (EM), and circuit theory areas. This article offers a comprehensive overview of the key benefits of the UM-MIMO technology and the associated challenges. It explores massive multiplexing facilitated by radiative near-field effects, characterizes the spatial degrees-of-freedom, and practical channel estimation schemes tailored for massive arrays. Moreover, we provide a tutorial on EM theory and circuit theory, and how it is used to obtain physically consistent antenna and channel models. Subsequently, the article describes different ways to implement massive and dense antenna arrays, and how to co-design antennas with signal processing. The main open research challenges are identified at the end., Comment: Submitted to Proceedings of the IEEE, 36 pages, 23 figures

We present a measurement of the low-mass quiescent size-mass relation at Cosmic Noon (1

We improve the standard Weyl estimate for quartic exponential sums in which the argument is a quadratic irrational. Specifically we show that \[\sum_{n\le N} e(\alpha n^4)\ll_{\ep,\alpha}N^{5/6+\ep}\] for any $\ep>0$ and any quadratic irrational $\alpha\in\R-\Q$. Classically one would have had the exponent $7/8+\ep$ for such $\alpha$. In contrast to the author's earlier work \cite{cubweyl} on cubic Weyl sums (which was conditional on the $abc$-conjecture), we show that the van der Corput $AB$-steps are sufficient for the quartic case, rather than the $BAAB$-process needed for the cubic sum., Comment: New version with mention of work of Xi and Wu

The entanglement level statistics of a quantum state have recently been proposed to be a signature of universality in the underlying quantum circuit. This is a consequence of level repulsion in the entanglement spectra being tied to the integrability of entanglement generated. However, such studies of the level-spacing statistics in the entanglement spectrum have thus far been limited to the output states of Clifford and Haar random circuits on product state inputs. In this work, we provide the first example of a circuit which is composed of a simulable gate set, yet has a Wigner-Dyson distributed entanglement level spectrum without any perturbing universal element. We first show that, for matchgate circuits acting on random product states, Wigner-Dyson statistics emerge by virtue of a single SWAP gate, in direct analog to previous studies on Clifford circuits. We then examine the entanglement spectrum of matchgate circuits with varied input states, and find a sharp jump in the complexity of entanglement as we go from two- to three-qubit entangled inputs. Studying Clifford and matchgate hybrid circuits, we find examples of classically simulable circuits whose output states exhibit Wigner-Dyson entanglement level statistics in the absence of universal quantum gate elements. Our study thus provides strong evidence that entanglement spectrum is not strongly connected to notions of simulability in any given quantum circuit., Comment: 19 pages, 15 figures

Fluid antenna systems (FASs) can reconfigure their antenna locations freely within a spatially continuous space. To keep favorable antenna positions, the channel state information (CSI) acquisition for FASs is essential. While some techniques have been proposed, most existing FAS channel estimators require several channel assumptions, such as slow variation and angular-domain sparsity. When these assumptions are not reasonable, the model mismatch may lead to unpredictable performance losses. In this paper, we propose the successive Bayesian reconstructor (S-BAR) as a general solution to estimate FAS channels. Unlike model-based estimators, the proposed S-BAR is prior-aided, which builds the experiential kernel for CSI acquisition. Inspired by Bayesian regression, the key idea of S-BAR is to model the FAS channels as a stochastic process, whose uncertainty can be successively eliminated by kernel-based sampling and regression. In this way, the predictive mean of the regressed stochastic process can be viewed as a Bayesian channel estimator. Simulation results verify that, in both model-mismatched and model-matched cases, the proposed S-BAR can achieve higher estimation accuracy than the existing schemes., Comment: Accepted by IEEE TWC. This paper proposes S-BAR as a general solution to estimate FAS channels. Unlike model-based estimators, the proposed S-BAR is prior-aided, which builds the experiential kernel for CSI acquisition. Simulation codes will be provided at: http://oa.ee.tsinghua.edu.cn/dailinglong/publications/publications.html

Beam management is a strategy to unify beamforming and channel state information (CSI) acquisition with large antenna arrays in 5G. Codebooks serve multiple uses in beam management including beamforming reference signals, CSI reporting, and analog beam training. In this paper, we propose and evaluate a machine learning-refined codebook design process for extremely large multiple-input multiple-output (X-MIMO) systems. We propose a neural network and beam selection strategy to design the initial access and refinement codebooks using end-to-end learning from beamspace representations. The algorithm, called Extreme-Beam Management (X-BM), can significantly improve the performance of extremely large arrays as envisioned for 6G and capture realistic wireless and physical layer aspects. Our results show an 8dB improvement in initial access and overall effective spectral efficiency improvements compared to traditional codebook methods., Comment: To be submitted to IEEE TMLCN

We consider the potential for a 10-kg undoped cryogenic CsI detector operating at the Spallation Neutron Source to measure coherent elastic neutrino-nucleus scattering and its sensitivity to discover new physics beyond the standard model. Through a combination of increased event rate, lower threshold, and good timing resolution, such a detector would significantly improve on past measurements. We considered tests of several beyond-the-standard-model scenarios such as neutrino non-standard interactions and accelerator-produced dark matter. This detector's performance was also studied for relevant questions in nuclear physics and neutrino astronomy, namely the weak charge distribution of CsI nuclei and detection of neutrinos from a core-collapse supernova.

Antenna behaviors such as mutual coupling, near-field propagation, and polarization cannot be neglected in signal and channel models for wireless communication. We present an electromagnetic-based array manifold that accounts for several complicated behaviors and can model arbitrary antenna configurations. We quantize antennas into a large number of Hertzian dipoles to develop a model for the radiated array field. The resulting abstraction provides a means to predict the electric field for general non-homogeneous array geometries through a linear model that depends on the point source location, the position of each Hertzian dipole, and a set of coefficients obtained from electromagnetic simulation. We then leverage this model to formulate a beamforming gain optimization that can be adapted to account for polarization of the receive field as well as constraints on the radiated power density. Numerical results demonstrate that the proposed method achieves accuracy that is close to that of electromagnetic simulations. By leveraging the developed array manifold for beamforming, systems can achieve higher beamforming gains compared to beamforming with less accurate models.

In this note, we investigate for various pairs of graphs $(H,G)$ the question of how many random edges must be added to a dense graph to guarantee that any red-blue coloring of the edges contains a red copy of $H$ or a blue copy of $G$. We determine this perturbed Ramsey threshold for many new pairs of graphs and various ranges of densities, obtaining several generalizations of results obtained by Das and Treglown. In particular, we resolve the remaining cases toward determining the perturbed Ramsey threshold for pairs $(K_t,K_s)$ where $t\geq s\geq 5$.

Let $k$ be a field of odd characteristic $p$. Fix an even number $d

Impedance-matching networks affect power transfer from the radio frequency (RF) chains to the antennas. Their design impacts the signal to noise ratio (SNR) and the achievable rate. In this paper, we maximize the information-theoretic achievable rate of a multiple-input-single-output (MISO) system with wideband matching constraints. Using a multiport circuit theory approach with frequency-selective scattering parameters, we propose a general framework for optimizing the MISO achievable rate that incorporates Bode-Fano wideband matching theory. We express the solution to the achievable rate optimization problem in terms of the optimized transmission coefficient and the Lagrangian parameters corresponding to the Bode-Fano inequality constraints. We apply this framework to a single electric Chu's antenna and an array of two electric Chu's antennas. We compare the optimized achievable rate obtained numerically with other benchmarks like the ideal achievable rate computed by disregarding matching constraints and the achievable rate obtained by using sub-optimal matching strategies like conjugate matching and frequency-flat transmission. We also propose a practical methodology to approximate the achievable rate bound by using the optimal transmission coefficient to derive a physically realizable matching network through the ADS software.

With increasing frequencies, bandwidths, and array apertures, the phenomenon of beam squint arises as a serious impairment to beamforming. Fully digital arrays with true time delay per antenna element are a potential solution, but they require downconversion at each element. This paper shows that hybrid arrays can perform essentially as well as digital arrays once the number of radio-frequency chains exceeds a certain threshold that is far below the number of elements. The result is robust, holding also for suboptimum but highly appealing beamspace architectures.