Search

Adiabatic quantum-flux-parametron (AQFP) logic is a proven energy-efficient superconductor technology for various applications. To address the scalability challenges, we investigated AQFP shift registers with the AQFP footprint area reduced by 25% with respect to prior work and with more than 2x denser overall designs obtained by eliminating the previously used free space between the AQFPs. We also investigated AQFP cells with different designs of flux trapping moats in the superconducting ground plane as well as compact AQFP cells that took advantage of the smaller feature sizes available in the new fabrication process, SFQ5ee+, at MIT Lincoln Laboratory. This new process features nine planarized Nb layers with a 0.25 $\mu$m minimum linewidth. The fabricated circuits were tested in a liquid He probe and in a closed-cycle cryocooler using a controlled cooling rate through the superconducting critical temperature. Using multiple thermal cycles, we investigated flux trapping in the dense AQFP shift registers as well as in the registers using the old (sparse) AQFP designs at two levels of the residual magnetic field, about 0.53 $\mu$T and about 1.2 $\mu$T. The sparse designs demonstrated 95% to almost 100% probability of operation after the cooldown and very wide operation margins, although the flux trapping probability was increasing with circuit complexities. The margins were similarly wide in the newer dense designs, but flux trapping probability that rendered the registers nonoperational was significantly, by an order of magnitude, higher in the denser circuits and was also very sensitive to the moats' shape and location. Our findings indicate that AQFP circuits are amendable to increasing the scale of integration and further densification, but a careful moat design and optimization are required to reduce flux trapping effects in the dense AQFP circuits., Comment: 5 pages, 10 figures, 2 tables, 18 references. Presented at Applied Superconductivity Conference, ASC2024, 1-6 September 2024, Salt Lake City, UT, USA

Recent works show that sensitive user data can be reconstructed from gradient updates, breaking the key privacy promise of federated learning. While success was demonstrated primarily on image data, these methods do not directly transfer to other domains, such as spatiotemporal data. To understand privacy risks in spatiotemporal federated learning, we first propose Spatiotemporal Gradient Inversion Attack (ST-GIA), a gradient attack algorithm tailored to spatiotemporal data that successfully reconstructs the original location from gradients. Furthermore, the absence of priors in attacks on spatiotemporal data has hindered the accurate reconstruction of real client data. To address this limitation, we propose ST-GIA+, which utilizes an auxiliary language model to guide the search for potential locations, thereby successfully reconstructing the original data from gradients. In addition, we design an adaptive defense strategy to mitigate gradient inversion attacks in spatiotemporal federated learning. By dynamically adjusting the perturbation levels, we can offer tailored protection for varying rounds of training data, thereby achieving a better trade-off between privacy and utility than current state-of-the-art methods. Through intensive experimental analysis on three real-world datasets, we reveal that the proposed defense strategy can well preserve the utility of spatiotemporal federated learning with effective security protection., Comment: arXiv admin note: substantial text overlap with arXiv:2407.08529

Recent research on explainable recommendation generally frames the task as a standard text generation problem, and evaluates models simply based on the textual similarity between the predicted and ground-truth explanations. However, this approach fails to consider one crucial aspect of the systems: whether their outputs accurately reflect the users' (post-purchase) sentiments, i.e., whether and why they would like and/or dislike the recommended items. To shed light on this issue, we introduce new datasets and evaluation methods that focus on the users' sentiments. Specifically, we construct the datasets by explicitly extracting users' positive and negative opinions from their post-purchase reviews using an LLM, and propose to evaluate systems based on whether the generated explanations 1) align well with the users' sentiments, and 2) accurately identify both positive and negative opinions of users on the target items. We benchmark several recent models on our datasets and demonstrate that achieving strong performance on existing metrics does not ensure that the generated explanations align well with the users' sentiments. Lastly, we find that existing models can provide more sentiment-aware explanations when the users' (predicted) ratings for the target items are directly fed into the models as input. We will release our code and datasets upon acceptance.

Scintillator-based X-ray imaging detectors are pivotal in numerous scientific and practical domains, including medical imaging, and security monitoring. Recent advancements have spurred interest in 4D X-ray imaging using synchrotron radiation, necessitating higher temporal resolutions. Consequently, this places stringent demands on X-ray detector technology, especially when X-ray energy exceeds 20 keV. The selection of a suitable scintillator material is crucial for achieving optimal timing resolution, yet it poses a significant challenge in dynamic X-ray imaging. This study delves into the optimization of scintillator properties and their impact on spatial resolution and light output, elucidating the performance of Ce-doped Gd3Ga3Al2O12 (GAGG:Ce) scintillators for X-ray imaging applications. We developed a micro X-ray imaging detector using a 100 $\mu$m-thick GAGG:Ce scintillator plate and conducted X-ray imaging tests at the Aichi SR facility. The results demonstrated that the resolution, quantified as the chart slit width at a contrast transfer function (CTF) value of 10%, reached 2 - 3 $\mu$m with a 4x lens, 0.52 $\mu$m $\pm$ 0.03 $\mu$m with a 20x lens, and 0.42 $\mu$m $\pm$ 0.01 $\mu$m with a 40x lens. Although the results of this study did not achieve a spatial resolution nearing the effective pixel size of the 40x lens, the text also elucidates the underlying reasons for this limitation. Furthermore, we compared the X-ray sensitivity of our GAGG:Ce scintillator plate with that of a commercial LuAG:Ce scintillator, revealing an approximately 1.5-fold increase in light output. As a demonstration, transmission images of dried small fish were captured using the GAGG:Ce scintillator plate and the developed X-ray imaging system. These findings highlight the potential of the X-ray imaging detector devised in this study for future generations of X-ray imaging applications., Comment: 12 pages, 6 figures

The isotopic compositions of samples returned from Cb-type asteroid Ryugu and Ivuna-type (CI) chondrites are distinct from other carbonaceous chondrites, which has led to the suggestion that Ryugu and CI chondrites formed in a different region of the accretion disk, possibly around the orbits of Uranus and Neptune. We show that, like for Fe, Ryugu and CI chondrites also have indistinguishable Ni isotope anomalies, which differ from those of other carbonaceous chondrites. We propose that this unique Fe and Ni isotopic composition reflects different accretion efficiencies of small FeNi metal grains among the carbonaceous chondrite parent bodies. The CI chondrites incorporated these grains more efficiently, possibly because they formed at the end of the disk's lifetime, when planetesimal formation was also triggered by photoevaporation of the disk. Isotopic variations among carbonaceous chondrites may thus reflect fractionation of distinct dust components from a common reservoir, implying CI chondrites and Ryugu may have formed in the same region of the accretion disk as other carbonaceous chondrites., Comment: Published open access in Science Advances

The Vlasov-Maxwell equations provide kinetic simulations of collisionless plasmas, but numerically solving them on classical computers is often impractical. This is due to the computational resource constraints imposed by the time evolution in the 6-dimensional phase space, which requires broad spatial and temporal scales. In this study, we develop a quantum-classical hybrid Vlasov-Maxwell solver. Specifically, the Vlasov solver implements the Hamiltonian simulation based on Quantum Singular Value Transformation (QSVT), coupled with a classical Maxwell solver. We perform numerical simulation of a 1D advection test and a 1D1V two-stream instability test on the Qiskit-Aer-GPU quantum circuit emulator with an A100 GPU. The computational complexity of our quantum algorithm can potentially be reduced from the classical $O(N^6T^2)$ to $O(\text{poly}(\log(N),N,T))$ for the $N$ grid system and simulation time $T$. Furthermore, the numerical analysis reveals that our quantum algorithm is robust under larger time steps compared with classical algorithms with the constraint of Courant-Friedrichs-Lewy (CFL) condition., Comment: 24 pages, 11 figures

In this paper, we introduce the notions of tight closure of ideals on Witt rings and quasi-tightly closedness of system of parameters. By using the notions, we obtain a characterization of quasi-$F$-rationality. Furthermore, we study the relationship between the closure operator and integrally closure., Comment: 15 pages

Objectives: To evaluate the zero-shot performance of Segment Anything Model 2 (SAM 2) in 3D segmentation of abdominal organs in CT scans, and to investigate the effects of prompt settings on segmentation results. Materials and Methods: In this retrospective study, we used a subset of the TotalSegmentator CT dataset from eight institutions to assess SAM 2's ability to segment eight abdominal organs. Segmentation was initiated from three different z-coordinate levels (caudal, mid, and cranial levels) of each organ. Performance was measured using the Dice similarity coefficient (DSC). We also analyzed the impact of "negative prompts," which explicitly exclude certain regions from the segmentation process, on accuracy. Results: 123 patients (mean age, 60.7 \pm 15.5 years; 63 men, 60 women) were evaluated. As a zero-shot approach, larger organs with clear boundaries demonstrated high segmentation performance, with mean DSCs as follows: liver 0.821 \pm 0.192, right kidney 0.862 \pm 0.212, left kidney 0.870 \pm 0.154, and spleen 0.891 \pm 0.131. Smaller organs showed lower performance: gallbladder 0.531 \pm 0.291, pancreas 0.361 \pm 0.197, and adrenal glands, right 0.203 \pm 0.222, left 0.308 \pm 0.234. The initial slice for segmentation and the use of negative prompts significantly influenced the results. By removing negative prompts from the input, the DSCs significantly decreased for six organs. Conclusion: SAM 2 demonstrated promising zero-shot performance in segmenting certain abdominal organs in CT scans, particularly larger organs. Performance was significantly influenced by input negative prompts and initial slice selection, highlighting the importance of optimizing these factors., Comment: 21 pages, 7 figures (including 2 supplemental figure), 4 tables

Differentially private graph analysis is a powerful tool for deriving insights from diverse graph data while protecting individual information. Designing private analytic algorithms for different graph queries often requires starting from scratch. In contrast, differentially private synthetic graph generation offers a general paradigm that supports one-time generation for multiple queries. Although a rich set of differentially private graph generation algorithms has been proposed, comparing them effectively remains challenging due to various factors, including differing privacy definitions, diverse graph datasets, varied privacy requirements, and multiple utility metrics. To this end, we propose PGB (Private Graph Benchmark), a comprehensive benchmark designed to enable researchers to compare differentially private graph generation algorithms fairly. We begin by identifying four essential elements of existing works as a 4-tuple: mechanisms, graph datasets, privacy requirements, and utility metrics. We discuss principles regarding these elements to ensure the comprehensiveness of a benchmark. Next, we present a benchmark instantiation that adheres to all principles, establishing a new method to evaluate existing and newly proposed graph generation algorithms. Through extensive theoretical and empirical analysis, we gain valuable insights into the strengths and weaknesses of prior algorithms. Our results indicate that there is no universal solution for all possible cases. Finally, we provide guidelines to help researchers select appropriate mechanisms for various scenarios.

We prove that $\mathbb Q$-Gorenstein quasi-$F$-regular singularities are klt. To this end, we shall introduce quasi-test ideals., Comment: 117 pages

Achieving both high speed and precision in robot operations is a significant challenge for social implementation. While factory robots excel at predefined tasks, they struggle with environment-specific actions like cleaning and cooking. Deep learning research aims to address this by enabling robots to autonomously execute behaviors through end-to-end learning with sensor data. RT-1 and ACT are notable examples that have expanded robots' capabilities. However, issues with model inference speed and hand position accuracy persist. High-quality training data and fast, stable inference mechanisms are essential to overcome these challenges. This paper proposes a motion generation model for high-speed, high-precision tasks, exemplified by the sports stacking task. By teaching motions slowly and inferring at high speeds, the model achieved a 94% success rate in stacking cups with a real robot., Comment: 2 pages, 2 figures

We present an analysis of a stellar occultation event caused by a near-Earth asteroid (98943) 2001 CC21, an upcoming flyby target in the Hayabusa2 extended mission, on March 5, 2023. To accurately determine the asteroid's shape from diffraction-affected light curves, we developed a novel data reduction technique named the Diffracted Occultation's United Simulator for Highly Informative Transient Explorations (DOUSHITE). Using DOUSHITE-generated synthetic models, we derived constraints on (98943) 2001 CC21's shadow shape from the single-chord occultation data. Our results suggest a significant elongation of the shadow with an axis ratio of $b/a = 0.37\pm0.09$. This shape can be crucial for planning Hayabusa2's high-speed flyby to optimise the limited imaging opportunities., Comment: 10 pages, 9 figures, PASJ accepted

Superconducting circuits, like Adiabatic Quantum-Flux-Parametron (AQFP), offer exceptional energy efficiency but face challenges in physical design due to sophisticated spacing and timing constraints. Current design tools often neglect the importance of constraint adherence throughout the entire design flow. In this paper, we propose SuperFlow, a fully-customized RTL-to-GDS design flow tailored for AQFP devices. SuperFlow leverages a synthesis tool based on CMOS technology to transform any input RTL netlist to an AQFP-based netlist. Subsequently, we devise a novel place-and-route procedure that simultaneously considers wirelength, timing, and routability for AQFP circuits. The process culminates in the generation of the AQFP circuit layout, followed by a Design Rule Check (DRC) to identify and rectify any layout violations. Our experimental results demonstrate that SuperFlow achieves 12.8% wirelength improvement on average and 12.1% better timing quality compared with previous state-of-the-art placers for AQFP circuits., Comment: Accepted by DATE 2024

Spatiotemporal federated learning has recently raised intensive studies due to its ability to train valuable models with only shared gradients in various location-based services. On the other hand, recent studies have shown that shared gradients may be subject to gradient inversion attacks (GIA) on images or texts. However, so far there has not been any systematic study of the gradient inversion attacks in spatiotemporal federated learning. In this paper, we explore the gradient attack problem in spatiotemporal federated learning from attack and defense perspectives. To understand privacy risks in spatiotemporal federated learning, we first propose Spatiotemporal Gradient Inversion Attack (ST-GIA), a gradient attack algorithm tailored to spatiotemporal data that successfully reconstructs the original location from gradients. Furthermore, we design an adaptive defense strategy to mitigate gradient inversion attacks in spatiotemporal federated learning. By dynamically adjusting the perturbation levels, we can offer tailored protection for varying rounds of training data, thereby achieving a better trade-off between privacy and utility than current state-of-the-art methods. Through intensive experimental analysis on three real-world datasets, we reveal that the proposed defense strategy can well preserve the utility of spatiotemporal federated learning with effective security protection., Comment: Accepted by DASFAA 2024, 16 pages

Observation datasets acquired by the Hyper Suprime-Cam (HSC) on the Subaru Telescope for NASA's New Horizons mission target search were analyzed through a method devised by JAXA. The method makes use of Field Programmable Gate arrays and was originally used to detect fast-moving objects such as space debris or near-Earth asteroids. Here we present an application of the method to detect slow-moving Kuiper Belt Objects (KBOs) in the New Horizons target search observations. A cadence that takes continuous images of one HSC field of view for half a night fits the method well. The observations for the New Horizons Kuiper Belt Extended Mission (NH/KEM) using HSC began in May 2020, and are ongoing. Here we show our result of the analysis of the dataset acquired from May 2020 through June 2021 that have already passed the proprietary period and are open to the public. We detected 84 KBO candidates in the June 2020 and June 2021 datasets, when the observation field was close to opposition., Comment: 21 pages, 9 figures, 5 tables, accepted for publication on Publications of the Astronomical Society of Japan

Collaborative graph analysis across multiple institutions is becoming increasingly popular. Realistic examples include social network analysis across various social platforms, financial transaction analysis across multiple banks, and analyzing the transmission of infectious diseases across multiple hospitals. We define the federated graph analytics, a new problem for collaborative graph analytics under differential privacy. Although differentially private graph analysis has been widely studied, it fails to achieve a good tradeoff between utility and privacy in federated scenarios, due to the limited view of local clients and overlapping information across multiple subgraphs. Motivated by this, we first propose a federated graph analytic framework, named FEAT, which enables arbitrary downstream common graph statistics while preserving individual privacy. Furthermore, we introduce an optimized framework based on our proposed degree-based partition algorithm, called FEAT+, which improves the overall utility by leveraging the true local subgraphs. Finally, extensive experiments demonstrate that our FEAT and FEAT+ significantly outperform the baseline approach by approximately one and four orders of magnitude, respectively., Comment: 13 pages

Techniques that explain the predictions of black-box machine learning models are crucial to make the models transparent, thereby increasing trust in AI systems. The input features to the models often have a nested structure that consists of high- and low-level features, and each high-level feature is decomposed into multiple low-level features. For such inputs, both high-level feature attributions (HiFAs) and low-level feature attributions (LoFAs) are important for better understanding the model's decision. In this paper, we propose a model-agnostic local explanation method that effectively exploits the nested structure of the input to estimate the two-level feature attributions simultaneously. A key idea of the proposed method is to introduce the consistency property that should exist between the HiFAs and LoFAs, thereby bridging the separate optimization problems for estimating them. Thanks to this consistency property, the proposed method can produce HiFAs and LoFAs that are both faithful to the black-box models and consistent with each other, using a smaller number of queries to the models. In experiments on image classification in multiple instance learning and text classification using language models, we demonstrate that the HiFAs and LoFAs estimated by the proposed method are accurate, faithful to the behaviors of the black-box models, and provide consistent explanations.

Human mobility data offers valuable insights for many applications such as urban planning and pandemic response, but its use also raises privacy concerns. In this paper, we introduce the Hierarchical and Multi-Resolution Network (HRNet), a novel deep generative model specifically designed to synthesize realistic human mobility data while guaranteeing differential privacy. We first identify the key difficulties inherent in learning human mobility data under differential privacy. In response to these challenges, HRNet integrates three components: a hierarchical location encoding mechanism, multi-task learning across multiple resolutions, and private pre-training. These elements collectively enhance the model's ability under the constraints of differential privacy. Through extensive comparative experiments utilizing a real-world dataset, HRNet demonstrates a marked improvement over existing methods in balancing the utility-privacy trade-off.

Feature-based offline algorithm selection has shown its effectiveness in a wide range of optimization problems, including the black-box optimization problem. An algorithm selection system selects the most promising optimizer from an algorithm portfolio, which is a set of pre-defined optimizers. Thus, algorithm selection requires a well-constructed algorithm portfolio consisting of efficient optimizers complementary to each other. Although construction methods for the fixed-target setting have been well studied, those for the fixed-budget setting have received less attention. Here, the fixed-budget setting is generally used for computationally expensive optimization, where a budget of function evaluations is small. In this context, first, this paper points out some undesirable properties of experimental setups in previous studies. Then, this paper argues the importance of considering the number of function evaluations used in the sampling phase when constructing algorithm portfolios, whereas the previous studies ignored that. The results show that algorithm portfolios constructed by our approach perform significantly better than those by the previous approach., Comment: Accepted for GECCO 2024 Workshop Industrial Applications of Metaheuristics

Continuous-variable (CV) quantum information processing is a promising candidate for large-scale fault-tolerant quantum computation. However, analysis of CV quantum process relies mostly on direct computation of the evolution of operators in the Heisenberg picture, and the features of CV space has yet to be thoroughly investigated in an intuitive manner. One key ingredient for further exploration of CV quantum computing is the construction of a computational model that brings visual intuition and new tools for analysis. In this paper, we delve into a graphical computational model, inspired by a similar model for qubit-based systems called the ZX calculus, that enables the representation of arbitrary CV quantum process as a simple directed graph. We demonstrate the utility of our model as a graphical tool to comprehend CV processes intuitively by showing how equivalences between two distinct quantum processes can be proven as a sequence of diagrammatic transformations in certain cases. We also examine possible applications of our model, such as measurement-based quantum computing, characterization of Gaussian and non-Gaussian processes, and circuit optimization., Comment: 34 pages, 3 figures

Measurements of circular polarization of $\gamma$-ray emitted from neutron capture reactions provide valuable information for nuclear physics studies. The spin and parity of excited states can be determined by measuring the circular polarization from polarized neutron capture reactions. Furthermore, the $\gamma$-ray circular polarization in a neutron capture resonance is crucial for studying the enhancement effect of parity nonconservation in compound nuclei. The $\gamma$-ray circular polarization can be measured using a polarimeter based on magnetic Compton scattering. A polarimeter was constructed, and its performance indicators were evaluated using a circularly polarized $\gamma$-ray beam. Furthermore, as a demonstration, the $\gamma$-ray circular polarization was measured in $^{32}$S($\vec{\textrm{n}}$,$\gamma$)$^{33}$S reactions with polarized neutrons., Comment: 10pages, 13 figures

We report the H, C, and N isotopic compositions of microscale (0.2 to 2$\mu$m) organic matter in samples of asteroid Ryugu and the Orgueil CI carbonaceous chondrite. Three regolith particles of asteroid Ryugu, returned by the Hayabusa2 spacecraft, and several fragments of Orgueil were analyzed by NanoSIMS isotopic imaging. The isotopic distributions of the Ryugu samples from two different collection spots are closely similar to each other and to the Orgueil samples, strengthening the proposed Ryugu-CI chondrite connection. Most individual sub-$\mu$m organic grains have isotopic compositions within error of bulk values, but 2-8% of them are outliers exhibiting large isotopic enrichments or depletions in D, $^{15}$N, and/or $^{13}$C. The H, C and N isotopic compositions of the outliers are not correlated with each other: while some C-rich grains are both D- and $^{15}$N-enriched, many are enriched or depleted in one or the other system. This most likely points to a diversity in isotopic fractionation pathways and thus diversity in the local formation environments for the individual outlier grains. The observation of a relatively small population of isotopic outlier grains can be explained either by escape from nebular and/or parent body homogenization of carbonaceous precursor material or addition of later isotopic outlier grains. The strong chemical similarity of isotopically typical and isotopically outlying grains, as reflected by synchrotron x-ray absorption spectra, suggests a genetic connection and thus favors the former, homogenization scenario. However, the fact that even the least altered meteorites show the same pattern of a small population of outliers on top of a larger population of homogenized grains indicates that some or most of the homogenization occurred prior to accretion of the macromolecular organic grains into asteroidal parent bodies., Comment: Accepted for publication in Earth and Planetary Science Letters. 8 figures (plus 3 supplementary figs), two tables