Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to nonfederal websites. Their policies may differ from this site.

ACM luminaries describe how their experiences with DEI issues vary between the different continents where they have lived.Free, publiclyaccessible full text available December 1, 2023

Zaphiris, P. ; Ioannou, A. (Ed.)In Computer Aided Design, Computer Graphics, Robotics, etc., students suffer from inefficient and nonproficient use of the 3D modeling software due to a lack of mathematical knowledge. Deficient knowledge and skills may lead students to use the modeling software through trialanderror without understanding the algorithms and mathematics. Spatial/geometric transformation is recognized as one of the key factors in learning 3D modeling software. This paper presents a newly developed educational Augmented Reality (AR) mobile application to help students intuitively learn the geometric reasoning of transformation matrices and the corresponding trigonometric equations through play. The application, developed in primary and advanced levels, intends to facilitate the understanding of fundamentals of spatial transformations and their mathematical representations in a selflearning approach. The results of a pilot user study conducted on 7 undergraduate students for the primary level reveal that students’ math scores improved after playing with the application.

This paper applies probabilistic amplitude shaping (PAS) to a cyclic redundancy check (CRC) aided trellis coded modulation (TCM) to achieve the shortblocklength random coding union (RCU) bound. In the transmitter, the equally likely message bits are first encoded by distribution matcher to generate amplitude symbols with the desired distribution. The binary representations of the distribution matcher outputs are then encoded by a CRC. Finally, the CRCencoded bits are encoded and modulated by Ungerboeck's TCM scheme, which consists of a k/(k+1) systematic tailbiting convolutional code and a mapping function that maps coded bits to channel signals with capacityachieving distribution. This paper proves that, for the proposed transmitter, the CRC bits have uniform distribution and that the channel signals have symmetric distribution. In the receiver, the serial list Viterbi decoding (SLVD) is used to estimate the information bits. Simulation results show that, for the proposed CRCTCMPAS system with 87 input bits and 6567 8AM coded output symbols, the decoding performance under additive white Gaussian noise channel achieves the RCU bound with properly designed CRC and convolutional codes.

This paper compares the accuracy and complexity of Raghavan and Baum’s Reliability Output Viterbi Algorithm (ROVA), Polyanskiy’s accumulated information density (AID), and Fricke and Hoeher’s lower complexity approximation of ROVA. It turns out that AID is far less accurate than ROVA in practice. This paper proposes codeword information density (CID), which modifies AID to improve its accuracy and leads to a lowercomplexity implementation of ROVA. The paper includes an analytical expression for the random variable describing the correct decoding probability computed by ROVA and uses this expression to characterize how the probabilities of correct decoding, undetected error, and negative acknowledgement behave as a function of the selected threshold for reliable decoding. This paper examines both the complexity and the simulation time of ROVA, CID, AID, and the Fricke and Hoeher approximation to ROVA. This paper also derives an expression for the union bound on the frame error rate for zeroterminated trellis codes with punctured symbols and uses it to optimize the order of symbol transmission in an incremental retransmission scheme. This paper concludes by comparing the performance of an incremental retransmission scheme using ROVA as a stopping condition to one that uses a CRC as a stopping condition.

Chargedensity waves (CDWs) are a ubiquitous form of electron density modulation in cuprate superconductors. Unveiling the nature of quasistatic CDWs and their dynamical excitations is crucial for understanding their origin––similar to the study of antiferromagnetism in cuprates. However, dynamical CDW excitations remain largely unexplored due to the limited availability of suitable experimental probes. Here, using resonant inelastic Xray scattering, we observe dynamical CDW excitations in Bi2Sr2LaCuO6+δ (Bi2201) superconductors through its interference with the lattice. The distinct anomalies of the bondbuckling and the bondstretching phonons allow us to draw a clear picture of funnelshaped dynamical CDW excitations in Bi2201. Our results of the interplay between CDWs and the phonon anomalies shed light on the nature of CDWs in cuprates.

Neural programs are highly accurate and structured policies that perform algorith mic tasks by controlling the behavior of a computation mechanism. Despite the potential to increase the interpretability and the compositionality of the behavior of artificial agents, it remains difficult to learn from demonstrations neural networks that represent computer programs. The main challenges that set algorithmic do mains apart from other imitation learning domains are the need for high accuracy, the involvement of specific structures of data, and the extremely limited observabil ity. To address these challenges, we propose to model programs as Parametrized Hierarchical Procedures (PHPs). A PHP is a sequence of conditional operations, using a program counter along with the observation to select between taking an elementary action, invoking another PHP as a subprocedure, and returning to the caller. We develop an algorithm for training PHPs from a set of supervisor demonstrations, only some of which are annotated with the internal call structure, and apply it to efficient levelwise training of multilevel PHPs. We show in two benchmarks, NanoCraft and longhand addition, that PHPs can learn neural pro grams more accurately from smaller amounts of both annotated and unannotated demonstrations.

Free, publiclyaccessible full text available September 1, 2024

Free, publiclyaccessible full text available September 1, 2024

A bstract The first measurement of the top quark pair ( $$ \textrm{t}\overline{\textrm{t}} $$ t t ¯ ) production cross section in protonproton collisions at $$ \sqrt{s} $$ s = 13 . 6 TeV is presented. Data recorded with the CMS detector at the CERN LHC in Summer 2022, corresponding to an integrated luminosity of 1 . 21 fb − 1 , are analyzed. Events are selected with one or two charged leptons (electrons or muons) and additional jets. A maximum likelihood fit is performed in event categories defined by the number and flavors of the leptons, the number of jets, and the number of jets identified as originating from b quarks. An inclusive $$ \textrm{t}\overline{\textrm{t}} $$ t t ¯ production cross section of 881 ± 23 (stat + syst) ± 20 (lumi) pb is measured, in agreement with the standard model prediction of $$ {924}_{40}^{+32} $$ 924 − 40 + 32 pb.Free, publiclyaccessible full text available September 1, 2024

A bstract A search for physics beyond the standard model (SM) in the final state with a hadronically decaying tau lepton and a neutrino is presented. This analysis is based on data recorded by the CMS experiment from protonproton collisions at a centerofmass energy of 13 TeV at the LHC, corresponding to a total integrated luminosity of 138 fb − 1 . The transverse mass spectrum is analyzed for the presence of new physics. No significant deviation from the SM prediction is observed. Limits are set on the production cross section of a W′ boson decaying into a tau lepton and a neutrino. Lower limits are set on the mass of the sequential SMlike heavy charged vector boson and the mass of a quantum black hole. Upper limits are placed on the couplings of a new boson to the SM fermions. Constraints are put on a nonuniversal gauge interaction model and an effective field theory model. For the first time, upper limits on the cross section of t channel leptoquark (LQ) exchange are presented. These limits are translated into exclusion limits on the LQ mass and on its coupling in the t channel. The sensitivity of this analysis extends intomore »Free, publiclyaccessible full text available September 1, 2024