Author: "Koh AS" / Publication Year Range: Last 10 years - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Koh AS"' showing total 106,124 results

Start Over Author "Koh AS" Publication Year Range Last 10 years

106,124 results on '"Koh AS"'

1. Analytical Expressions for the Quantum Approximate Optimization Algorithm and its Variants

Author: Ng, Truman Yu, Koh, Jin Ming, and Koh, Dax Enshan
Subjects: Quantum Physics
Abstract: The quantum approximate optimization algorithm (QAOA) is a near-term quantum algorithm aimed at solving combinatorial optimization problems. Since its introduction, various generalizations have emerged, spanning modifications to the initial state, phase unitaries, and mixer unitaries. In this work, we present an analytical study of broad families of QAOA variants. We begin by examining a family of QAOA with product mixers, which includes single-body mixers parametrized by multiple variational angles, and derive exact analytical expressions for the cost expectation on weighted problem graphs in the single-layer ansatz setting. We then analyze a family of QAOA that employs many-body Grover-type mixers, deriving analogous analytical expressions for weighted problem hypergraphs in the setting of arbitrarily many circuit ansatz layers. For both families, we allow individual phase angles for each node and edge (hyperedge) in the problem graph (hypergraph). Our results reveal that, in contrast to product mixers, the Grover mixer is sensitive to contributions from cycles of all lengths in the problem graph, exhibiting a form of non-locality. Our study advances the understanding of QAOA's behavior in general scenarios, providing a foundation for further theoretical exploration., Comment: 43 pages, 3 figures
Published: 2024

2. Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth

Author: Koh, Zhuan Khye, Weinstein, Omri, and Yingchareonthawornchai, Sorrachai
Subjects: Computer Science - Data Structures and Algorithms
Abstract: We present a nearly linear work parallel algorithm for approximating the Held-Karp bound for the Metric TSP problem. Given an edge-weighted undirected graph $G=(V,E)$ on $m$ edges and $\epsilon>0$, it returns a $(1+\epsilon)$-approximation to the Held-Karp bound with high probability, in $\tilde{O}(m/\epsilon^4)$ work and $\tilde{O}(1/\epsilon^4)$ depth. While a nearly linear time sequential algorithm was known for almost a decade (Chekuri and Quanrud'17), it was not known how to simultaneously achieve nearly linear work alongside polylogarithmic depth. Using a reduction by Chalermsook et al.'22, we also give a parallel algorithm for computing a $(1+\epsilon)$-approximate fractional solution to the $k$-edge-connected spanning subgraph (kECSS) problem, with the same complexity. To obtain these results, we introduce a notion of core-sequences for the parallel Multiplicative Weights Update (MWU) framework (Luby-Nisan'93, Young'01). For the Metric TSP and kECSS problems, core-sequences enable us to exploit the structure of approximate minimum cuts to reduce the cost per iteration and/or the number of iterations. The acceleration technique via core-sequences is generic and of independent interest. In particular, it improves the best-known iteration complexity of MWU algorithms for packing/covering LPs from $poly(\log nnz(A))$ to polylogarithmic in the product of cardinalities of the core-sequence sets where $A$ is the constraint matrix of the LP. For certain implicitly defined LPs such as the kECSS LP, this yields an exponential improvement in depth.
Published: 2024

3. OpenScholar: Synthesizing Scientific Literature with Retrieval-augmented LMs

Author: Asai, Akari, He, Jacqueline, Shao, Rulin, Shi, Weijia, Singh, Amanpreet, Chang, Joseph Chee, Lo, Kyle, Soldaini, Luca, Feldman, Sergey, D'arcy, Mike, Wadden, David, Latzke, Matt, Tian, Minyang, Ji, Pan, Liu, Shengyan, Tong, Hao, Wu, Bohao, Xiong, Yanyu, Zettlemoyer, Luke, Neubig, Graham, Weld, Dan, Downey, Doug, Yih, Wen-tau, Koh, Pang Wei, and Hajishirzi, Hannaneh
Subjects: Computer Science - Computation and Language, Computer Science - Artificial Intelligence, Computer Science - Digital Libraries, Computer Science - Information Retrieval, Computer Science - Machine Learning
Abstract: Scientific progress depends on researchers' ability to synthesize the growing body of literature. Can large language models (LMs) assist scientists in this task? We introduce OpenScholar, a specialized retrieval-augmented LM that answers scientific queries by identifying relevant passages from 45 million open-access papers and synthesizing citation-backed responses. To evaluate OpenScholar, we develop ScholarQABench, the first large-scale multi-domain benchmark for literature search, comprising 2,967 expert-written queries and 208 long-form answers across computer science, physics, neuroscience, and biomedicine. On ScholarQABench, OpenScholar-8B outperforms GPT-4o by 5% and PaperQA2 by 7% in correctness, despite being a smaller, open model. While GPT4o hallucinates citations 78 to 90% of the time, OpenScholar achieves citation accuracy on par with human experts. OpenScholar's datastore, retriever, and self-feedback inference loop also improves off-the-shelf LMs: for instance, OpenScholar-GPT4o improves GPT-4o's correctness by 12%. In human evaluations, experts preferred OpenScholar-8B and OpenScholar-GPT4o responses over expert-written ones 51% and 70% of the time, respectively, compared to GPT4o's 32%. We open-source all of our code, models, datastore, data and a public demo.
Published: 2024

4. NPGPT: Natural Product-Like Compound Generation with GPT-based Chemical Language Models

Author: Sakano, Koh, Furui, Kairi, and Ohue, Masahito
Subjects: Quantitative Biology - Biomolecules, Computer Science - Machine Learning, Quantitative Biology - Quantitative Methods, Statistics - Machine Learning
Abstract: Natural products are substances produced by organisms in nature and often possess biological activity and structural diversity. Drug development based on natural products has been common for many years. However, the intricate structures of these compounds present challenges in terms of structure determination and synthesis, particularly compared to the efficiency of high-throughput screening of synthetic compounds. In recent years, deep learning-based methods have been applied to the generation of molecules. In this study, we trained chemical language models on a natural product dataset and generated natural product-like compounds. The results showed that the distribution of the compounds generated was similar to that of natural products. We also evaluated the effectiveness of the generated compounds as drug candidates. Our method can be used to explore the vast chemical space and reduce the time and cost of drug discovery of natural products.
Published: 2024

5. Higher Order Graph Attention Probabilistic Walk Networks

Author: Bailie, Thomas, Koh, Yun Sing, and Mukkavilli, Karthik
Subjects: Computer Science - Machine Learning
Abstract: Graphs inherently capture dependencies between nodes or variables through their topological structure, with paths between any two nodes indicating a sequential dependency on the nodes traversed. Message Passing Neural Networks (MPNNs) leverage these latent relationships embedded in graph structures, and have become widely adopted across diverse applications. However, many existing methods predominantly rely on local information within the $1$-hop neighborhood. This approach has notable limitations; for example, $1$-hop aggregation schemes inherently lose long-distance information, and are limited in expressive power as defined by the $k$-Weisfeiler-Leman ($k$-WL) isomorphism test. To address these issues, we propose the Higher Order Graphical Attention (HoGA) module, which assigns weights to variable-length paths sampled based on feature-vector diversity, effectively reconstructing the $k$-hop neighborhood. HoGA represents higher-order relationships as a robust form of self-attention, applicable to any single-hop attention mechanism. In empirical studies, applying HoGA to existing attention-based models consistently leads to significant accuracy improvements on benchmark node classification datasets. Furthermore, we observe that the performance degradation typically associated with additional message-passing steps may be mitigated.
Published: 2024

6. Informational Puts

Author: Koh, Andrew, Sanguanmoo, Sivakorn, and Uzui, Kei
Subjects: Economics - Theoretical Economics, Computer Science - Multiagent Systems
Abstract: We fully characterize how dynamic information should be provided to uniquely implement the largest equilibrium in dynamic binary-action supermodular games. The designer offers an informational put: she stays silent in good times, but injects asymmetric and inconclusive public information if players lose faith. There is (i) no multiplicity gap: the largest (partially) implementable equilibrium can be implemented uniquely; and (ii) no intertemporal commitment gap: the policy is sequentially optimal. Our results have sharp implications for the design of policy in coordination environments.
Published: 2024

7. PLM-Based Discrete Diffusion Language Models with Entropy-Adaptive Gibbs Sampling

Author: Koh, Hyukhun, Jhang, Minha, Kim, Dohyung, Lee, Sangmook, and Jung, Kyomin
Subjects: Computer Science - Computation and Language, Computer Science - Artificial Intelligence
Abstract: Recently, discrete diffusion language models have demonstrated promising results in NLP. However, there has been limited research on integrating Pretrained Language Models (PLMs) into discrete diffusion models, resulting in underwhelming performance in downstream NLP generation tasks. This integration is particularly challenging because of the discrepancy between step-wise denoising strategy of diffusion models and single-step mask prediction approach of MLM-based PLMs. In this paper, we introduce Diffusion-EAGS, a novel approach that effectively integrates PLMs with the diffusion models. Furthermore, as it is challenging for PLMs to determine where to apply denoising during the diffusion process, we integrate an entropy tracking module to assist them. Finally, we propose entropy-based noise scheduling in the forward process to improve the effectiveness of entropy-adaptive sampling throughout the generation phase. Experimental results show that Diffusion-EAGS outperforms existing diffusion baselines in downstream generation tasks, achieving high text quality and diversity with precise token-level control. We also show that our model is capable of adapting to bilingual and low-resource settings, which are common in real-world applications.
Published: 2024

8. On Erroneous Agreements of CLIP Image Embeddings

Author: Li, Siting, Koh, Pang Wei, and Du, Simon Shaolei
Subjects: Computer Science - Machine Learning, Computer Science - Computation and Language, Computer Science - Computer Vision and Pattern Recognition
Abstract: Recent research suggests that the failures of Vision-Language Models (VLMs) at visual reasoning often stem from erroneous agreements -- when semantically distinct images are ambiguously encoded by the CLIP image encoder into embeddings with high cosine similarity. In this paper, we show that erroneous agreements are not always the main culprit, as Multimodal Large Language Models (MLLMs) can still extract distinct information from them. For instance, when distinguishing objects on the left vs right in the What'sUp benchmark, the CLIP image embeddings of the left/right pairs have an average cosine similarity $>0.99$, and CLIP performs at random chance; but LLaVA-1.5-7B, which uses the same CLIP image encoder, achieves nearly $100\%$ accuracy. We find that the extractable information in CLIP image embeddings is likely obscured by CLIP's inadequate vision-language alignment: Its matching score learned by the contrastive objective might not capture all diverse image-text correspondences. We also study the MMVP benchmark, on which prior work has shown that LLaVA-1.5 cannot distinguish image pairs with high cosine similarity. We observe a performance gain brought by attending more to visual input through an alternative decoding algorithm. Further, the accuracy significantly increases if the model can take both images as input to emphasize their nuanced differences. Both findings indicate that LLaVA-1.5 did not utilize extracted visual information sufficiently. In conclusion, our findings suggest that while improving image encoders could benefit VLMs, there is still room to enhance models with a fixed image encoder by applying better strategies for extracting and utilizing visual information., Comment: 18 pages, 4 figures
Published: 2024

9. Variety of disc wind-driven explosions in massive rotating stars. II. Dependence on the progenitor

Author: Menegazzi, Ludovica Crosato, Fujibayashi, Sho, Shibata, Masaru, Betranhandy, Aurore, and Takahashi, Koh
Subjects: Astrophysics - High Energy Astrophysical Phenomena, High Energy Physics - Theory
Abstract: We assess the variance of supernova(SN)-like explosions associated with the core collapse of rotating massive stars into a black hole-accretion disc system under changes in the progenitor structure. Our model of the central engine evolves the black hole and the disc through the transfer of matter and angular momentum and includes the contribution of the disc wind. We perform two-dimensional, non-relativistic, hydrodynamics simulations using the open-source hydrodynamic code Athena++, for which we develop a method to calculate self-gravity for axially symmetric density distributions. For a fixed model of the wind injection, we explore the explosion characteristics for progenitors with zero-age main-sequence masses from 9 to 40 $M_\odot$ and different degrees of rotation. Our outcomes reveal a wide range of explosion energies with $E_\mathrm{expl}$ spanning from $\sim 0.3\times10^{51}$~erg to $ > 8\times 10^{51}$~erg and ejecta mass $M_\mathrm{ej}$ from $\sim 0.6$ to $> 10 M_\odot$. Our results are in agreement with some range of the observational data of stripped-envelope and high-energy SNe such as broad-lined type Ic SNe, but we measure a stronger correlation between $E_\mathrm{expl}$ and $M_\mathrm{ej}$. We also provide an estimate of the $^{56}$Ni mass produced in our models which goes from $\sim0.04\;M_\odot$ to $\sim 1.3\;M_\odot$. The $^{56}$Ni mass shows a correlation with the mass and the angular velocity of the progenitor: more massive and faster rotating progenitors tend to produce a higher amount of $^{56}$Ni. Finally, we present a criterion that allows the selection of a potential collapsar progenitor from the observed explosion energy., Comment: submitted to MNRAS, 18 pages, 3 Appendixes, 12 figures plus 5 in the Appendixes, 2 tables, comments welcome
Published: 2024

10. Search for a Hidden Sector Scalar from Kaon Decay in the Di-Muon Final State at ICARUS

Author: ICARUS Collaboration, Alrahman, F. Abd, Abratenko, P., Abrego-Martinez, N., Aduszkiewicz, A., Akbar, F., Soplin, L. Aliaga, Garrote, R. Alvarez, Pons, M. Artero, Asaadi, J., Badgett, W. F., Baibussinov, B., Behera, B., Bellini, V., Benocci, R., Berger, J., Berkman, S., Bertolucci, S., Betancourt, M., Bonesini, M., Boone, T., Bottino, B., Braggiotti, A., Brailsford, D., Brice, S. J., Brio, V., Brizzolari, C., Budd, H. S., Campani, A., Campos, A., Carber, D., Carneiro, M., Terrazas, I. Caro, Carranza, H., Fernandez, F. Castillo, Castro, A., Centro, S., Cerati, G., Chatterjee, A., Cherdack, D., Cherubini, S., Chithirasreemadam, N., Cicerchia, M., Coan, T. E., Cocco, A., Convery, M. R., Cooper-Troendle, L., Copello, S., Da Motta, H., Dallolio, M., Dange, A. A., de Roeck, A., Di Domizio, S., Di Noto, L., Di Stefano, C., Di Ferdinando, D., Diwan, M., Dolan, S., Domine, L., Donati, S., Drielsma, F., Dyer, J., Dytman, S., Falcone, A., Farnese, C., Fava, A., Ferrari, A., Gallice, N., Garcia, F. G., Gatto, C., Gibin, D., Gioiosa, A., Gu, W., Guglielmi, A., Gurung, G., Hassinin, K., Hausner, H., Heggestuen, A., Howard, B., Howell, R., Ingratta, I., James, C., Jang, W., Jung, M., Jwa, Y. -J., Kashur, L., Ketchum, W., Kim, J. S., Koh, D. -H., Larkin, J., Li, Y., Mariani, C., Marshall, C. M., Martynenko, S., Mauri, N., McFarland, K. S., Mé9ndez, D. P., Menegolli, A., Meng, G., Miranda, O. G., Mogan, A., Moggi, N., Montagna, E., Montanari, C., Montanari, A., Mooney, M., Moreno-Granados, G., Mueller, J., Murphy, M., Naples, D., Nguyen, V. C. L, Palestini, S., Pallavicini, M., Paolone, V., Papaleo, R., Pasqualini, L., Patrizii, L., Paudel, L., Pelegrina-Gutiérrez, L., Petrillo, G., Petta, C., Pia, V., Pietropaolo, F., Poppi, F., Pozzato, M., Putnam, G., Qian, X., Rappoldi, A., Raselli, G. L., Repetto, S., Resnati, F., Ricci, A. M., Riccobene, G., Richards, E., Rosenberg, M., Rossella, M., Rowe, N., Roy, P., Rubbia, C., Saad, M., Safa, I., Saha, S., Sala, P., Salmoria, G., Samanta, S., Sapienza, P., Scaramelli, A., Scarpelli, A., Schmitz, D., Schukraft, A., Senadheera, D., Seo, S-H., Sergiampietri, F., Sirri, G., Smedley, J. S., Smith, J., Stanco, L., Stewart, J., Tanaka, H. A., Tapia, F., Tenti, M., Terao, K., Terranova, F., Togo, V., Torretta, D., Torti, M., Tortorici, F., Triozzi, R., Tsai, Y. -T., Tufanli, S., Usher, T., Varanini, F., Ventura, S., Vicenzi, M., Vignoli, C., Viren, B., Wieler, F. A., Williams, Z., Wilson, R. J., Wilson, P., Wolfs, J., Wongjirad, T., Wood, A., Worcester, E., Worcester, M., Wospakrik, M., Yadav, S., Yu, H., Yu, J., Zani, A., Zennamo, J., Zettlemoyer, J., Zhang, C., and Zucchelli, S.
Subjects: High Energy Physics - Experiment
Abstract: We present a search for long-lived particles (LLPs) produced from kaon decay that decay to two muons inside the ICARUS neutrino detector. This channel would be a signal of hidden sector models that can address outstanding issues in particle physics such as the strong CP problem and the microphysical origin of dark matter. The search is performed with data collected in the Neutrinos at the Main Injector (NuMI) beam at Fermilab corresponding to $2.41\times 10^{20}$ protons-on-target. No new physics signal is observed, and we set world-leading limits on heavy QCD axions, as well as for the Higgs portal scalar among dedicated searches. Limits are also presented in a model-independent way applicable to any new physics model predicting the process $K\to \pi+S(\to\mu\mu)$, for a long-lived particle S. This result is the first search for new physics performed with the ICARUS detector at Fermilab. It paves the way for the future program of long-lived particle searches at ICARUS.
Published: 2024

11. Standing torsional Alfv\'en waves as the source of the rotational period variation in magnetic early-type stars

Author: Takahashi, Koh and Langer, Norbert
Subjects: Astrophysics - Solar and Stellar Astrophysics, Astrophysics - High Energy Astrophysical Phenomena
Abstract: Context. The influence of magnetic fields on stellar evolution remains unresolved. It has been proposed that if there is a large-scale magnetic field in the stellar interior, torsional waves could arise, efficiently transporting angular momentum. In fact, the observed variations in the rotation periods of some magnetic stars may be attributed to these torsional waves' standing waves. Aims. To demonstrate the existence of torsional waves through modeling of the rotational period variations. Method. We conduct an eigenmode analysis of standing waves based on one-dimensional magnetohydrodynamic equations. The internal magnetic field structures are parametrically represented to treat poloidal fields with different degrees of central/surface concentration. The obtained frequencies are compared with the observed frequencies of the rotational period variations, thereby constraining the internal magnetic field structures. Results. The 67.6 years exhibited by CU Vir is reproduced for surface-concentrated magnetic field structures. The rotational period variations of all ten magnetic stars analyzed in this study are inconsistent with a centrally concentrated magnetic field. Conclusions. Torsional waves can reproduce the observations of rotational period variations. The large-scale magnetic fields within magnetic stars would be concentrated on the surface., Comment: 12 pages, 7 figures, 1 table. submitted to A&A
Published: 2024

12. Replace-then-Perturb: Targeted Adversarial Attacks With Visual Reasoning for Vision-Language Models

Author: Jang, Jonggyu, Lyu, Hyeonsu, Koh, Jungyeon, and Yang, Hyun Jong
Subjects: Computer Science - Computer Vision and Pattern Recognition, Computer Science - Artificial Intelligence, Electrical Engineering and Systems Science - Image and Video Processing
Abstract: The conventional targeted adversarial attacks add a small perturbation to an image to make neural network models estimate the image as a predefined target class, even if it is not the correct target class. Recently, for visual-language models (VLMs), the focus of targeted adversarial attacks is to generate a perturbation that makes VLMs answer intended target text outputs. For example, they aim to make a small perturbation on an image to make VLMs' answers change from "there is an apple" to "there is a baseball." However, answering just intended text outputs is insufficient for tricky questions like "if there is a baseball, tell me what is below it." This is because the target of the adversarial attacks does not consider the overall integrity of the original image, thereby leading to a lack of visual reasoning. In this work, we focus on generating targeted adversarial examples with visual reasoning against VLMs. To this end, we propose 1) a novel adversarial attack procedure -- namely, Replace-then-Perturb and 2) a contrastive learning-based adversarial loss -- namely, Contrastive-Adv. In Replace-then-Perturb, we first leverage a text-guided segmentation model to find the target object in the image. Then, we get rid of the target object and inpaint the empty space with the desired prompt. By doing this, we can generate a target image corresponding to the desired prompt, while maintaining the overall integrity of the original image. Furthermore, in Contrastive-Adv, we design a novel loss function to obtain better adversarial examples. Our extensive benchmark results demonstrate that Replace-then-Perturb and Contrastive-Adv outperform the baseline adversarial attack algorithms. We note that the source code to reproduce the results will be available., Comment: 13 pages, 5 figure
Published: 2024

13. Evaluating the Evolution of YOLO (You Only Look Once) Models: A Comprehensive Benchmark Study of YOLO11 and Its Predecessors

Author: Jegham, Nidhal, Koh, Chan Young, Abdelatti, Marwan, and Hendawi, Abdeltawab
Subjects: Computer Science - Computer Vision and Pattern Recognition
Abstract: This study presents a comprehensive benchmark analysis of various YOLO (You Only Look Once) algorithms, from YOLOv3 to the newest addition. It represents the first research to comprehensively evaluate the performance of YOLO11, the latest addition to the YOLO family. It evaluates their performance on three diverse datasets: Traffic Signs (with varying object sizes), African Wildlife (with diverse aspect ratios and at least one instance of the object per image), and Ships and Vessels (with small-sized objects of a single class), ensuring a comprehensive assessment across datasets with distinct challenges. To ensure a robust evaluation, we employ a comprehensive set of metrics, including Precision, Recall, Mean Average Precision (mAP), Processing Time, GFLOPs count, and Model Size. Our analysis highlights the distinctive strengths and limitations of each YOLO version. For example: YOLOv9 demonstrates substantial accuracy but struggles with detecting small objects and efficiency whereas YOLOv10 exhibits relatively lower accuracy due to architectural choices that affect its performance in overlapping object detection but excels in speed and efficiency. Additionally, the YOLO11 family consistently shows superior performance in terms of accuracy, speed, computational efficiency, and model size. YOLO11m achieved a remarkable balance of accuracy and efficiency, scoring mAP50-95 scores of 0.795, 0.81, and 0.325 on the Traffic Signs, African Wildlife, and Ships datasets, respectively, while maintaining an average inference time of 2.4ms, a model size of 38.8Mb, and around 67.6 GFLOPs on average. These results provide critical insights for both industry and academia, facilitating the selection of the most suitable YOLO algorithm for diverse applications and guiding future enhancements., Comment: 20 pages
Published: 2024

14. EARL-BO: Reinforcement Learning for Multi-Step Lookahead, High-Dimensional Bayesian Optimization

Author: Cheon, Mujin, Lee, Jay H., Koh, Dong-Yeun, and Tsay, Calvin
Subjects: Computer Science - Machine Learning, Mathematics - Optimization and Control
Abstract: Conventional methods for Bayesian optimization (BO) primarily involve one-step optimal decisions (e.g., maximizing expected improvement of the next step). To avoid myopic behavior, multi-step lookahead BO algorithms such as rollout strategies consider the sequential decision-making nature of BO, i.e., as a stochastic dynamic programming (SDP) problem, demonstrating promising results in recent years. However, owing to the curse of dimensionality, most of these methods make significant approximations or suffer scalability issues, e.g., being limited to two-step lookahead. This paper presents a novel reinforcement learning (RL)-based framework for multi-step lookahead BO in high-dimensional black-box optimization problems. The proposed method enhances the scalability and decision-making quality of multi-step lookahead BO by efficiently solving the SDP of the BO process in a near-optimal manner using RL. We first introduce an Attention-DeepSets encoder to represent the state of knowledge to the RL agent and employ off-policy learning to accelerate its initial training. We then propose a multi-task, fine-tuning procedure based on end-to-end (encoder-RL) on-policy learning. We evaluate the proposed method, EARL-BO (Encoder Augmented RL for Bayesian Optimization), on both synthetic benchmark functions and real-world hyperparameter optimization problems, demonstrating significantly improved performance compared to existing multi-step lookahead and high-dimensional BO methods., Comment: 14 pages
Published: 2024

15. Flexible Demand Manipulation

Author: Dai, Yifan and Koh, Andrew
Subjects: Economics - Theoretical Economics, Computer Science - Computer Science and Game Theory
Abstract: We develop a simple framework to analyze how targeted advertising interacts with market power. A designer chooses an advertising plan which allows it to flexibly manipulate the demand curve at some cost. A monopolist prices against this manipulated demand curve. We fully characterize the form and value of producer-optimal and consumer-optimal advertising plans under both ex-ante and ex-post measures of welfare. Flexibility is double-edged: producer-optimal plans substantially reduce consumer surplus vis-a-vis uniform advertising, but consumer-optimal plans can substantially improve consumer surplus. We discuss implications for the regulation of targeted advertising.
Published: 2024

16. An Individual Identity-Driven Framework for Animal Re-Identification

Author: Wu, Yihao, Zhao, Di, Zhang, Jingfeng, and Koh, Yun Sing
Subjects: Computer Science - Computer Vision and Pattern Recognition, Computer Science - Machine Learning, 68T45
Abstract: Reliable re-identification of individuals within large wildlife populations is crucial for biological studies, ecological research, and wildlife conservation. Classic computer vision techniques offer a promising direction for Animal Re-identification (Animal ReID), but their backbones' close-set nature limits their applicability and generalizability. Despite the demonstrated effectiveness of vision-language models like CLIP in re-identifying persons and vehicles, their application to Animal ReID remains limited due to unique challenges, such as the various visual representations of animals, including variations in poses and forms. To address these limitations, we leverage CLIP's cross-modal capabilities to introduce a two-stage framework, the \textbf{Indiv}idual \textbf{A}nimal \textbf{ID}entity-Driven (IndivAID) framework, specifically designed for Animal ReID. In the first stage, IndivAID trains a text description generator by extracting individual semantic information from each image, generating both image-specific and individual-specific textual descriptions that fully capture the diverse visual concepts of each individual across animal images. In the second stage, IndivAID refines its learning of visual concepts by dynamically incorporating individual-specific textual descriptions with an integrated attention module to further highlight discriminative features of individuals for Animal ReID. Evaluation against state-of-the-art methods across eight benchmark datasets and a real-world Stoat dataset demonstrates IndivAID's effectiveness and applicability. Code is available at \url{https://github.com/ywu840/IndivAID}., Comment: 10 pages
Published: 2024

17. Learning Neural Strategy-Proof Matching Mechanism from Examples

Author: Maruo, Ryota, Takeuchi, Koh, and Kashima, Hisashi
Subjects: Computer Science - Artificial Intelligence
Abstract: Designing effective two-sided matching mechanisms is a major problem in mechanism design, and the goodness of matching cannot always be formulated. The existing work addresses this issue by searching over a parameterized family of mechanisms with certain properties by learning to fit a human-crafted dataset containing examples of preference profiles and matching results. However, this approach does not consider a strategy-proof mechanism, implicitly assumes the number of agents to be a constant, and does not consider the public contextual information of the agents. In this paper, we propose a new parametric family of strategy-proof matching mechanisms by extending the serial dictatorship (SD). We develop a novel attention-based neural network called NeuralSD, which can learn a strategy-proof mechanism from a human-crafted dataset containing public contextual information. NeuralSD is constructed by tensor operations that make SD differentiable and learns a parameterized mechanism by estimating an order of SD from the contextual information. We conducted experiments to learn a strategy-proof matching from matching examples with different numbers of agents. We demonstrated that our method shows the superiority of learning with context-awareness over a baseline in terms of regression performance and other metrics.
Published: 2024

18. $C^2$: Scalable Auto-Feedback for LLM-based Chart Generation

Author: Koh, Woosung, Yoon, Jang Han, Lee, MinHyung, Song, Youngjin, Cho, Jaegwan, Kang, Jaehyun, Kim, Taehyeon, Yun, Se-young, Yu, Youngjae, and Lee, Bongshin
Subjects: Computer Science - Machine Learning, Computer Science - Artificial Intelligence, Computer Science - Computation and Language
Abstract: Generating high-quality charts with Large Language Models presents significant challenges due to limited data and the high cost of scaling through human curation. Instruction, data, and code triplets are scarce and expensive to manually curate as their creation demands technical expertise. To address this scalability issue, we introduce a reference-free automatic feedback generator, which eliminates the need for costly human intervention. Our novel framework, $C^2$, consists of (1) an automatic feedback provider (ChartAF) and (2) a diverse, reference-free dataset (ChartUIE-8K). Quantitative results are compelling: in our first experiment, 74% of respondents strongly preferred, and 10% preferred, the results after feedback. The second post-feedback experiment demonstrates that ChartAF outperforms nine baselines. Moreover, ChartUIE-8K significantly improves data diversity by increasing queries, datasets, and chart types by 5982%, 1936%, and 91%, respectively, over benchmarks. Finally, an LLM user study revealed that 94% of participants preferred ChartUIE-8K's queries, with 93% deeming them aligned with real-world use cases. Core contributions are available as open-source at an anonymized project site, with ample qualitative examples., Comment: Preprint
Published: 2024

19. Learning Fair and Preferable Allocations through Neural Network

Author: Maruo, Ryota, Takeuchi, Koh, and Kashima, Hisashi
Subjects: Computer Science - Artificial Intelligence
Abstract: The fair allocation of indivisible resources is a fundamental problem. Existing research has developed various allocation mechanisms or algorithms to satisfy different fairness notions. For example, round robin (RR) was proposed to meet the fairness criterion known as envy-freeness up to one good (EF1). Expert algorithms without mathematical formulations are used in real-world resource allocation problems to find preferable outcomes for users. Therefore, we aim to design mechanisms that strictly satisfy good properties with replicating expert knowledge. However, this problem is challenging because such heuristic rules are often difficult to formalize mathematically, complicating their integration into theoretical frameworks. Additionally, formal algorithms struggle to find preferable outcomes, and directly replicating these implicit rules can result in unfair allocations because human decision-making can introduce biases. In this paper, we aim to learn implicit allocation mechanisms from examples while strictly satisfying fairness constraints, specifically focusing on learning EF1 allocation mechanisms through supervised learning on examples of reported valuations and corresponding allocation outcomes produced by implicit rules. To address this, we developed a neural RR (NRR), a novel neural network that parameterizes RR. NRR is built from a differentiable relaxation of RR and can be trained to learn the agent ordering used for RR. We conducted experiments to learn EF1 allocation mechanisms from examples, demonstrating that our method outperforms baselines in terms of the proximity of predicted allocations and other metrics.
Published: 2024

20. FlickerFusion: Intra-trajectory Domain Generalizing Multi-Agent RL

Author: Koh, Woosung, Oh, Wonbeen, Kim, Siyeol, Shin, Suhin, Kim, Hyeongjin, Jang, Jaein, Lee, Junghyun, and Yun, Se-Young
Subjects: Computer Science - Machine Learning, Computer Science - Artificial Intelligence, Computer Science - Multiagent Systems
Abstract: Multi-agent reinforcement learning has demonstrated significant potential in addressing complex cooperative tasks across various real-world applications. However, existing MARL approaches often rely on the restrictive assumption that the number of entities (e.g., agents, obstacles) remains constant between training and inference. This overlooks scenarios where entities are dynamically removed or added during the inference trajectory -- a common occurrence in real-world environments like search and rescue missions and dynamic combat situations. In this paper, we tackle the challenge of intra-trajectory dynamic entity composition under zero-shot out-of-domain (OOD) generalization, where such dynamic changes cannot be anticipated beforehand. Our empirical studies reveal that existing MARL methods suffer significant performance degradation and increased uncertainty in these scenarios. In response, we propose FlickerFusion, a novel OOD generalization method that acts as a universally applicable augmentation technique for MARL backbone methods. Our results show that FlickerFusion not only achieves superior inference rewards but also uniquely reduces uncertainty vis-\`a-vis the backbone, compared to existing methods. For standardized evaluation, we introduce MPEv2, an enhanced version of Multi Particle Environments (MPE), consisting of 12 benchmarks. Benchmarks, implementations, and trained models are organized and open-sourced at flickerfusion305.github.io, accompanied by ample demo video renderings., Comment: NeurIPS '24 Open-World Agents Workshop
Published: 2024

21. Enabling Asymmetric Knowledge Transfer in Multi-Task Learning with Self-Auxiliaries

Author: Graffeuille, Olivier, Koh, Yun Sing, Wicker, Joerg, and Lehmann, Moritz
Subjects: Computer Science - Machine Learning
Abstract: Knowledge transfer in multi-task learning is typically viewed as a dichotomy; positive transfer, which improves the performance of all tasks, or negative transfer, which hinders the performance of all tasks. In this paper, we investigate the understudied problem of asymmetric task relationships, where knowledge transfer aids the learning of certain tasks while hindering the learning of others. We propose an optimisation strategy that includes additional cloned tasks named self-auxiliaries into the learning process to flexibly transfer knowledge between tasks asymmetrically. Our method can exploit asymmetric task relationships, benefiting from the positive transfer component while avoiding the negative transfer component. We demonstrate that asymmetric knowledge transfer provides substantial improvements in performance compared to existing multi-task optimisation strategies on benchmark computer vision problems.
Published: 2024

22. Budgeted Online Continual Learning by Adaptive Layer Freezing and Frequency-based Sampling

Author: Seo, Minhyuk, Koh, Hyunseo, and Choi, Jonghyun
Subjects: Computer Science - Machine Learning, Computer Science - Artificial Intelligence, Computer Science - Computer Vision and Pattern Recognition
Abstract: The majority of online continual learning (CL) advocates single-epoch training and imposes restrictions on the size of replay memory. However, single-epoch training would incur a different amount of computations per CL algorithm, and the additional storage cost to store logit or model in addition to replay memory is largely ignored in calculating the storage budget. Arguing different computational and storage budgets hinder fair comparison among CL algorithms in practice, we propose to use floating point operations (FLOPs) and total memory size in Byte as a metric for computational and memory budgets, respectively, to compare and develop CL algorithms in the same 'total resource budget.' To improve a CL method in a limited total budget, we propose adaptive layer freezing that does not update the layers for less informative batches to reduce computational costs with a negligible loss of accuracy. In addition, we propose a memory retrieval method that allows the model to learn the same amount of knowledge as using random retrieval in fewer iterations. Empirical validations on the CIFAR-10/100, CLEAR-10/100, and ImageNet-1K datasets demonstrate that the proposed approach outperforms the state-of-the-art methods within the same total budget
Published: 2024

23. Merge to Learn: Efficiently Adding Skills to Language Models with Model Merging

Author: Morrison, Jacob, Smith, Noah A., Hajishirzi, Hannaneh, Koh, Pang Wei, Dodge, Jesse, and Dasigi, Pradeep
Subjects: Computer Science - Computation and Language, Computer Science - Machine Learning
Abstract: Adapting general-purpose language models to new skills is currently an expensive process that must be repeated as new instruction datasets targeting new skills are created, or can cause the models to forget older skills. In this work, we investigate the effectiveness of adding new skills to preexisting models by training on the new skills in isolation and later merging with the general model (e.g. using task vectors). In experiments focusing on scientific literature understanding, safety, and coding, we find that the parallel-train-then-merge procedure, which is significantly cheaper than retraining the models on updated data mixtures, is often comparably effective. Our experiments also show that parallel training is especially well-suited for enabling safety features in LMs relative to continued finetuning and retraining, as it dramatically improves model compliance with safe prompts while preserving its ability to refuse dangerous or harmful prompts., Comment: Findings of EMNLP 2024
Published: 2024

24. AHP-Powered LLM Reasoning for Multi-Criteria Evaluation of Open-Ended Responses

Author: Lu, Xiaotian, Li, Jiyi, Takeuchi, Koh, and Kashima, Hisashi
Subjects: Computer Science - Computation and Language, Computer Science - Artificial Intelligence
Abstract: Question answering (QA) tasks have been extensively studied in the field of natural language processing (NLP). Answers to open-ended questions are highly diverse and difficult to quantify, and cannot be simply evaluated as correct or incorrect, unlike close-ended questions with definitive answers. While large language models (LLMs) have demonstrated strong capabilities across various tasks, they exhibit relatively weaker performance in evaluating answers to open-ended questions. In this study, we propose a method that leverages LLMs and the analytic hierarchy process (AHP) to assess answers to open-ended questions. We utilized LLMs to generate multiple evaluation criteria for a question. Subsequently, answers were subjected to pairwise comparisons under each criterion with LLMs, and scores for each answer were calculated in the AHP. We conducted experiments on four datasets using both ChatGPT-3.5-turbo and GPT-4. Our results indicate that our approach more closely aligns with human judgment compared to the four baselines. Additionally, we explored the impact of the number of criteria, variations in models, and differences in datasets on the results., Comment: Accepted for EMNLP 2024 Findings
Published: 2024

25. Illustrious: an Open Advanced Illustration Model

Author: Park, Sang Hyun, Koh, Jun Young, Lee, Junha, Song, Joy, Kim, Dongha, Moon, Hoyeon, Lee, Hyunju, and Song, Min
Subjects: Computer Science - Computer Vision and Pattern Recognition
Abstract: In this work, we share the insights for achieving state-of-the-art quality in our text-to-image anime image generative model, called Illustrious. To achieve high resolution, dynamic color range images, and high restoration ability, we focus on three critical approaches for model improvement. First, we delve into the significance of the batch size and dropout control, which enables faster learning of controllable token based concept activations. Second, we increase the training resolution of images, affecting the accurate depiction of character anatomy in much higher resolution, extending its generation capability over 20MP with proper methods. Finally, we propose the refined multi-level captions, covering all tags and various natural language captions as a critical factor for model development. Through extensive analysis and experiments, Illustrious demonstrates state-of-the-art performance in terms of animation style, outperforming widely-used models in illustration domains, propelling easier customization and personalization with nature of open source. We plan to publicly release updated Illustrious model series sequentially as well as sustainable plans for improvements.
Published: 2024

26. Smart Contract Vulnerability Detection based on Static Analysis and Multi-Objective Search

Author: Li, Dongcheng, Wong, W. Eric, Wang, Xiaodan, Pan, Sean, and Koh, Liang-Seng
Subjects: Computer Science - Software Engineering
Abstract: This paper introduces a method for detecting vulnerabilities in smart contracts using static analysis and a multi-objective optimization algorithm. We focus on four types of vulnerabilities: reentrancy, call stack overflow, integer overflow, and timestamp dependencies. Initially, smart contracts are compiled into an abstract syntax tree to analyze relationships between contracts and functions, including calls, inheritance, and data flow. These analyses are transformed into static evaluations and intermediate representations that reveal internal relations. Based on these representations, we examine contract's functions, variables, and data dependencies to detect the specified vulnerabilities. To enhance detection accuracy and coverage, we apply a multi-objective optimization algorithm to the static analysis process. This involves assigning initial numeric values to input data and monitoring changes in statement coverage and detection accuracy. Using coverage and accuracy as fitness values, we calculate Pareto front and crowding distance values to select the best individuals for the new parent population, iterating until optimization criteria are met. We validate our approach using an open-source dataset collected from Etherscan, containing 6,693 smart contracts. Experimental results show that our method outperforms state-of-the-art tools in terms of coverage, accuracy, efficiency, and effectiveness in detecting the targeted vulnerabilities.
Published: 2024

27. The hypothetical track-length fitting algorithm for energy measurement in liquid argon TPCs

Author: DUNE Collaboration, Abud, A. Abed, Abi, B., Acciarri, R., Acero, M. A., Adames, M. R., Adamov, G., Adamowski, M., Adams, D., Adinolfi, M., Adriano, C., Aduszkiewicz, A., Aguilar, J., Akbar, F., Alex, N. S., Allison, K., Monsalve, S. Alonso, Alrashed, M., Alton, A., Alvarez, R., Alves, T., Amar, H., Amedo, P., Anderson, J., Andreopoulos, C., Andreotti, M., Andrews, M. P., Andrianala, F., Andringa, S., Anfimov, N., Ankowski, A., Antic, D., Antoniassi, M., Antonova, M., Antoshkin, A., Aranda-Fernandez, A., Arellano, L., Diaz, E. Arrieta, Arroyave, M. A., Asaadi, J., Ashkenazi, A., Asner, D., Asquith, L., Atkin, E., Auguste, D., Aurisano, A., Aushev, V., Autiero, D., Azam, M. B., Azfar, F., Back, A., Back, H., Back, J. J., Bagaturia, I., Bagby, L., Balashov, N., Balasubramanian, S., Baldi, P., Baldini, W., Baldonedo, J., Baller, B., Bambah, B., Banerjee, R., Barao, F., Barbu, D., Barenboim, G., Alzás, P. Barham, Barker, G. J., Barkhouse, W., Barr, G., Monarca, J. Barranco, Barros, A., Barros, N., Barrow, D., Barrow, J. L., Basharina-Freshville, A., Bashyal, A., Basque, V., Batchelor, C., Bathe-Peters, L., Battat, J. B. R., Battisti, F., Bay, F., Bazetto, M. C. Q., Alba, J. L. L. Bazo, Beacom, J. F., Bechetoille, E., Behera, B., Belchior, E., Bell, G., Bellantoni, L., Bellettini, G., Bellini, V., Beltramello, O., Benekos, N., Montiel, C. Benitez, Benjamin, D., Neves, F. Bento, Berger, J., Berkman, S., Bernal, J., Bernardini, P., Bersani, A., Bertolucci, S., Betancourt, M., Rodríguez, A. Betancur, Bevan, A., Bezawada, Y., Bezerra, A. T., Bezerra, T. J., Bhat, A., Bhatnagar, V., Bhatt, J., Bhattacharjee, M., Bhattacharya, M., Bhuller, S., Bhuyan, B., Biagi, S., Bian, J., Biery, K., Bilki, B., Bishai, M., Bitadze, A., Blake, A., Blaszczyk, F. D., Blazey, G. C., Blucher, E., Bodek, A., Bogenschuetz, J., Boissevain, J., Bolognesi, S., Bolton, T., Bomben, L., Bonesini, M., Bonilla-Diaz, C., Bonini, F., Booth, A., Boran, F., Bordoni, S., Merlo, R. Borges, Borkum, A., Bostan, N., Bouet, R., Boza, J., Bracinik, J., Brahma, B., Brailsford, D., Bramati, F., Branca, A., Brandt, A., Bremer, J., Brew, C., Brice, S. J., Brio, V., Brizzolari, C., Bromberg, C., Brooke, J., Bross, A., Brunetti, G., Brunetti, M., Buchanan, N., Budd, H., Buergi, J., Bundock, A., Burgardt, D., Butchart, S., V., G. Caceres, Cagnoli, I., Cai, T., Calabrese, R., Calcutt, J., Calivers, L., Calvo, E., Caminata, A., Camino, A. F., Campanelli, W., Campani, A., Benitez, A. Campos, Canci, N., Capó, J., Caracas, I., Caratelli, D., Carber, D., Carceller, J. M., Carini, G., Carlus, B., Carneiro, M. F., Carniti, P., Terrazas, I. Caro, Carranza, H., Carrara, N., Carroll, L., Carroll, T., Carter, A., Casarejos, E., Casazza, D., Forero, J. F. Castaño, Castaño, F. A., Castillo, A., Castromonte, C., Catano-Mur, E., Cattadori, C., Cavalier, F., Cavanna, F., Centro, S., Cerati, G., Cerna, C., Cervelli, A., Villanueva, A. Cervera, Chakraborty, K., Chalifour, M., Chappell, A., Charitonidis, N., Chatterjee, A., Chen, H., Chen, M., Chen, W. C., Chen, Y., Chen-Wishart, Z., Cherdack, D., Chi, C., Chiapponi, F., Chirco, R., Chitirasreemadam, N., Cho, K., Choate, S., Choi, G., Chokheli, D., Chong, P. S., Chowdhury, B., Christian, D., Chukanov, A., Chung, M., Church, E., Cicala, M. F., Cicerchia, M., Cicero, V., Ciolini, R., Clarke, P., Cline, G., Coan, T. E., Cocco, A. G., Coelho, J. A. B., Cohen, A., Collazo, J., Collot, J., Conley, E., Conrad, J. M., Convery, M., Copello, S., Cova, P., Cox, C., Cremaldi, L., Cremonesi, L., Crespo-Anadón, J. I., Crisler, M., Cristaldo, E., Crnkovic, J., Crone, G., Cross, R., Cudd, A., Cuesta, C., Cui, Y., Curciarello, F., Cussans, D., Dai, J., Dalager, O., Dallavalle, R., Dallaway, W., D'Amico, R., da Motta, H., Dar, Z. A., Darby, R., Peres, L. Da Silva, David, Q., Davies, G. S., Davini, S., Dawson, J., De Aguiar, R., De Almeida, P., Debbins, P., De Bonis, I., Decowski, M. P., de Gouvêa, A., De Holanda, P. C., Astiz, I. L. De Icaza, De Jong, P., Sanchez, P. Del Amo, De la Torre, A., De Lauretis, G., Delbart, A., Delepine, D., Delgado, M., Dell'Acqua, A., Monache, G. Delle, Delmonte, N., De Lurgio, P., Demario, R., De Matteis, G., Neto, J. R. T. de Mello, DeMuth, D. M., Dennis, S., Densham, C., Denton, P., Deptuch, G. W., De Roeck, A., De Romeri, V., Detje, J. P., Devine, J., Dharmapalan, R., Dias, M., Diaz, A., Díaz, J. S., Díaz, F., Di Capua, F., Di Domenico, A., Di Domizio, S., Di Falco, S., Di Giulio, L., Ding, P., Di Noto, L., Diociaiuti, E., Distefano, C., Diurba, R., Diwan, M., Djurcic, Z., Doering, D., Dolan, S., Dolek, F., Dolinski, M. J., Domenici, D., Domine, L., Donati, S., Donon, Y., Doran, S., Douglas, D., Doyle, T. A., Dragone, A., Drielsma, F., Duarte, L., Duchesneau, D., Duffy, K., Dugas, K., Dunne, P., Dutta, B., Duyang, H., Dwyer, D. A., Dyshkant, A. S., Dytman, S., Eads, M., Earle, A., Edayath, S., Edmunds, D., Eisch, J., Englezos, P., Ereditato, A., Erjavec, T., Escobar, C. O., Evans, J. J., Ewart, E., Ezeribe, A. C., Fahey, K., Fajt, L., Falcone, A., Fani', M., Farnese, C., Farrell, S., Farzan, Y., Fedoseev, D., Felix, J., Feng, Y., Fernandez-Martinez, E., Ferry, G., Fialova, E., Fields, L., Filip, P., Filkins, A., Filthaut, F., Fine, R., Fiorillo, G., Fiorini, M., Fogarty, S., Foreman, W., Fowler, J., Franc, J., Francis, K., Franco, D., Franklin, J., Freeman, J., Fried, J., Friedland, A., Fuess, S., Furic, I. K., Furman, K., Furmanski, A. P., Gaba, R., Gabrielli, A., Gago, A. M., Galizzi, F., Gallagher, H., Gallice, N., Galymov, V., Gamberini, E., Gamble, T., Ganacim, F., Gandhi, R., Ganguly, S., Gao, F., Gao, S., Garcia-Gamez, D., García-Peris, M. Á., Gardim, F., Gardiner, S., Gastler, D., Gauch, A., Gauvreau, J., Gauzzi, P., Gazzana, S., Ge, G., Geffroy, N., Gelli, B., Gent, S., Gerlach, L., Ghorbani-Moghaddam, Z., Giammaria, T., Gibin, D., Gil-Botella, I., Gilligan, S., Gioiosa, A., Giovannella, S., Girerd, C., Giri, A. K., Giugliano, C., Giusti, V., Gnani, D., Gogota, O., Gollapinni, S., Gollwitzer, K., Gomes, R. A., Bermeo, L. V. Gomez, Fajardo, L. S. Gomez, Gonnella, F., Gonzalez-Diaz, D., Gonzalez-Lopez, M., Goodman, M. C., Goswami, S., Gotti, C., Goudeau, J., Goudzovski, E., Grace, C., Gramellini, E., Gran, R., Granados, E., Granger, P., Grant, C., Gratieri, D. R., Grauso, G., Green, P., Greenberg, S., Greer, J., Griffith, W. C., Groetschla, F. T., Grzelak, K., Gu, L., Gu, W., Guarino, V., Guarise, M., Guenette, R., Guerzoni, M., Guffanti, D., Guglielmi, A., Guo, B., Guo, F. Y., Gupta, A., Gupta, V., Gurung, G., Gutierrez, D., Guzowski, P., Guzzo, M. M., Gwon, S., Habig, A., Hadavand, H., Haegel, L., Haenni, R., Hagaman, L., Hahn, A., Haiston, J., Hakenmüller, J., Hamernik, T., Hamilton, P., Hancock, J., Happacher, F., Harris, D. A., Hart, A. L., Hartnell, J., Hartnett, T., Harton, J., Hasegawa, T., Hasnip, C. M., Hatcher, R., Hayrapetyan, K., Hays, J., Hazen, E., He, M., Heavey, A., Heeger, K. M., Heise, J., Hellmuth, P., Henry, S., Herner, K., Hewes, V., Higuera, A., Hilgenberg, C., Hillier, S. J., Himmel, A., Hinkle, E., Hirsch, L. R., Ho, J., Hoff, J., Holin, A., Holvey, T., Hoppe, E., Horiuchi, S., Horton-Smith, G. A., Houdy, T., Howard, B., Howell, R., Hristova, I., Hronek, M. S., Huang, J., Huang, R. G., Hulcher, Z., Ibrahim, M., Iles, G., Ilic, N., Iliescu, A. M., Illingworth, R., Ingratta, G., Ioannisian, A., Irwin, B., Isenhower, L., Oliveira, M. Ismerio, Itay, R., Jackson, C. M., Jain, V., James, E., Jang, W., Jargowsky, B., Jena, D., Jentz, I., Ji, X., Jiang, C., Jiang, J., Jiang, L., Jipa, A., Jo, J. H., Joaquim, F. R., Johnson, W., Jollet, C., Jones, B., Jones, R., Jovancevic, N., Judah, M., Jung, C. K., Jung, K. Y., Junk, T., Jwa, Y., Kabirnezhad, M., Kaboth, A. C., Kadenko, I., Kakorin, I., Kalitkina, A., Kalra, D., Kandemir, M., Kaplan, D. M., Karagiorgi, G., Karaman, G., Karcher, A., Karyotakis, Y., Kasai, S., Kasetti, S. P., Kashur, L., Katsioulas, I., Kauther, A., Kazaryan, N., Ke, L., Kearns, E., Keener, P. T., Kelly, K. J., Kemp, E., Kemularia, O., Kermaidic, Y., Ketchum, W., Kettell, S. H., Khabibullin, M., Khan, N., Khvedelidze, A., Kim, D., Kim, J., Kim, M. J., King, B., Kirby, B., Kirby, M., Kish, A., Klein, J., Kleykamp, J., Klustova, A., Kobilarcik, T., Koch, L., Koehler, K., Koerner, L. W., Koh, D. H., Kolupaeva, L., Korablev, D., Kordosky, M., Kosc, T., Kose, U., Kostelecký, V. A., Kothekar, K., Kotler, I., Kovalcuk, M., Kozhukalov, V., Krah, W., Kralik, R., Kramer, M., Kreczko, L., Krennrich, F., Kreslo, I., Kroupova, T., Kubota, S., Kubu, M., Kudenko, Y., Kudryavtsev, V. A., Kufatty, G., Kuhlmann, S., Kulagin, S., Kumar, J., Kumar, P., Kumaran, S., Kunzmann, J., Kuravi, R., Kurita, N., Kuruppu, C., Kus, V., Kutter, T., Kvasnicka, J., Labree, T., Lackey, T., Lalău, I., Lambert, A., Land, B. J., Lane, C. E., Lane, N., Lang, K., Langford, T., Langstaff, M., Lanni, F., Lantwin, O., Larkin, J., Lasorak, P., Last, D., Laudrain, A., Laundrie, A., Laurenti, G., Lavaut, E., Laycock, P., Lazanu, I., LaZur, R., Lazzaroni, M., Le, T., Leardini, S., Learned, J., LeCompte, T., Legin, V., Miotto, G. Lehmann, Lehnert, R., de Oliveira, M. A. Leigui, Leitner, M., Silverio, D. Leon, Lepin, L. M., Li, J. -Y, Li, S. W., Li, Y., Liao, H., Lin, C. S., Lindebaum, D., Linden, S., Lineros, R. A., Lister, A., Littlejohn, B. R., Liu, H., Liu, J., Liu, Y., Lockwitz, S., Lokajicek, M., Lomidze, I., Long, K., Lopes, T. V., Lopez, J., de Rego, I. López, López-March, N., Lord, T., LoSecco, J. M., Louis, W. C., Sanchez, A. Lozano, Lu, X. -G., Luk, K. B., Lunday, B., Luo, X., Luppi, E., MacFarlane, D., Machado, A. A., Machado, P., Macias, C. T., Macier, J. R., MacMahon, M., Maddalena, A., Madera, A., Madigan, P., Magill, S., Magueur, C., Mahn, K., Maio, A., Major, A., Majumdar, K., Mameli, S., Man, M., Mandujano, R. C., Maneira, J., Manly, S., Mann, A., Manolopoulos, K., Plata, M. Manrique, Corchado, S. Manthey, Manyam, V. N., Marchan, M., Marchionni, A., Marciano, W., Marfatia, D., Mariani, C., Maricic, J., Marinho, F., Marino, A. D., Markiewicz, T., Marques, F. Das Chagas, Marquet, C., Marshak, M., Marshall, C. M., Marshall, J., Martina, L., Martín-Albo, J., Martinez, N., Caicedo, D. A. Martinez, López, F. Martínez, Miravé, P. Martínez, Martynenko, S., Mascagna, V., Massari, C., Mastbaum, A., Matichard, F., Matsuno, S., Matteucci, G., Matthews, J., Mauger, C., Mauri, N., Mavrokoridis, K., Mawby, I., Mazza, R., McAskill, T., McConkey, N., McFarland, K. S., McGrew, C., McNab, A., Meazza, L., Meddage, V. C. N., Mefodiev, A., Mehta, B., Mehta, P., Melas, P., Mena, O., Mendez, H., Mendez, P., Méndez, D. P., Menegolli, A., Meng, G., Mercuri, A. C. E. A., Meregaglia, A., Messier, M. D., Metallo, S., Metcalf, W., Mewes, M., Meyer, H., Miao, T., Micallef, J., Miccoli, A., Michna, G., Milincic, R., Miller, F., Miller, G., Miller, W., Mineev, O., Minotti, A., Miralles, L., Mironov, C., Miryala, S., Miscetti, S., Mishra, C. S., Mishra, P., Mishra, S. R., Mislivec, A., Mitchell, M., Mladenov, D., Mocioiu, I., Mogan, A., Moggi, N., Mohanta, R., Mohayai, T. A., Mokhov, N., Molina, J., Bueno, L. Molina, Montagna, E., Montanari, A., Montanari, C., Montanari, D., Montanino, D., Zetina, L. M. Montaño, Mooney, M., Moor, A. F., Moore, Z., Moreno, D., Moreno-Palacios, O., Morescalchi, L., Moretti, D., Moretti, R., Morris, C., Mossey, C., Moura, C. A., Mouster, G., Mu, W., Mualem, L., Mueller, J., Muether, M., Muheim, F., Muir, A., Mukhamejanov, Y., Mulhearn, M., Munford, D., Munteanu, L. J., Muramatsu, H., Muraz, J., Murphy, M., Murphy, T., Muse, J., Mytilinaki, A., Nachtman, J., Nagai, Y., Nagu, S., Nandakumar, R., Naples, D., Narita, S., Navrer-Agasson, A., Nayak, N., Nebot-Guinot, M., Nehm, A., Nelson, J. K., Neogi, O., Nesbit, J., Nessi, M., Newbold, D., Newcomer, M., Nichol, R., Nicolas-Arnaldos, F., Nikolica, A., Nikolov, J., Niner, E., Nishimura, K., Norman, A., Norrick, A., Novella, P., Nowak, A., Nowak, J. A., Oberling, M., Ochoa-Ricoux, J. P., Oh, S., Oh, S. B., Olivier, A., Olshevskiy, A., Olson, T., Onel, Y., Onishchuk, Y., Oranday, A., Osbiston, M., Vélez, J. A. Osorio, O'Sullivan, L., Ormachea, L. Otiniano, Ott, J., Pagani, L., Palacio, G., Palamara, O., Palestini, S., Paley, J. M., Pallavicini, M., Palomares, C., Pan, S., Panda, P., Vazquez, W. Panduro, Pantic, E., Paolone, V., Papaleo, R., Papanestis, A., Papoulias, D., Paramesvaran, S., Paris, A., Parke, S., Parozzi, E., Parsa, S., Parsa, Z., Parveen, S., Parvu, M., Pasciuto, D., Pascoli, S., Pasqualini, L., Pasternak, J., Patrick, C., Patrizii, L., Patterson, R. B., Patzak, T., Paudel, A., Paulucci, L., Pavlovic, Z., Pawloski, G., Payne, D., Pec, V., Pedreschi, E., Peeters, S. J. M., Pellico, W., Perez, A. Pena, Pennacchio, E., Penzo, A., Peres, O. L. G., Gonzalez, Y. F. Perez, Pérez-Molina, L., Pernas, C., Perry, J., Pershey, D., Pessina, G., Petrillo, G., Petta, C., Petti, R., Pfaff, M., Pia, V., Pickering, L., Pietropaolo, F., Pimentel, V. L., Pinaroli, G., Pincha, S., Pinchault, J., Pitts, K., Plows, K., Pollack, C., Pollman, T., Pompa, F., Pons, X., Poonthottathil, N., Popov, V., Poppi, F., Porter, J., Paixão, L. G. Porto, Potekhin, M., Potenza, R., Pozzato, M., Prakash, T., Pratt, C., Prest, M., Psihas, F., Pugnere, D., Qian, X., Queen, J., Raaf, J. L., Radeka, V., Rademacker, J., Radics, B., Raffaelli, F., Rafique, A., Raguzin, E., Rahaman, U., Rai, M., Rajagopalan, S., Rajaoalisoa, M., Rakhno, I., Rakotondravohitra, L., Ralte, L., Delgado, M. A. Ramirez, Ramson, B., Rappoldi, A., Raselli, G., Ratoff, P., Ray, R., Razafinime, H., Razakamiandra, R. F., Rea, E. M., Real, J. S., Rebel, B., Rechenmacher, R., Reichenbacher, J., Reitzner, S. D., Sfar, H. Rejeb, Renner, E., Renshaw, A., Rescia, S., Resnati, F., Restrepo, Diego, Reynolds, C., Ribas, M., Riboldi, S., Riccio, C., Riccobene, G., Ricol, J. S., Rigan, M., Rincón, E. V., Ritchie-Yates, A., Ritter, S., Rivera, D., Rivera, R., Robert, A., Rocha, J. L. Rocabado, Rochester, L., Roda, M., Rodrigues, P., Alonso, M. J. Rodriguez, Rondon, J. Rodriguez, Rosauro-Alcaraz, S., Rosier, P., Ross, D., Rossella, M., Rossi, M., Ross-Lonergan, M., Roy, N., Roy, P., Rubbia, C., Ruggeri, A., Ferreira, G. Ruiz, Russell, B., Ruterbories, D., Rybnikov, A., Sacerdoti, S., Saha, S., Sahoo, S. K., Sahu, N., Sala, P., Samios, N., Samoylov, O., Sanchez, M. C., Bravo, A. Sánchez, Sánchez-Castillo, A., Sanchez-Lucas, P., Sandberg, V., Sanders, D. A., Sanfilippo, S., Sankey, D., Santoro, D., Saoulidou, N., Sapienza, P., Sarasty, C., Sarcevic, I., Sarra, I., Savage, G., Savinov, V., Scanavini, G., Scaramelli, A., Scarff, A., Schefke, T., Schellman, H., Schifano, S., Schlabach, P., Schmitz, D., Schneider, A. W., Scholberg, K., Schukraft, A., Schuld, B., Segade, A., Segreto, E., Selyunin, A., Senadheera, D., Senise, C. R., Sensenig, J., Shaevitz, M. H., Shanahan, P., Sharma, P., Kumar, R., Poudel, S. Sharma, Shaw, K., Shaw, T., Shchablo, K., Shen, J., Shepherd-Themistocleous, C., Sheshukov, A., Shi, J., Shi, W., Shin, S., Shivakoti, S., Shoemaker, I., Shooltz, D., Shrock, R., Siddi, B., Siden, M., Silber, J., Simard, L., Sinclair, J., Sinev, G., Singh, Jaydip, Singh, J., Singh, L., Singh, P., Singh, V., Chauhan, S. Singh, Sipos, R., Sironneau, C., Sirri, G., Siyeon, K., Skarpaas, K., Smedley, J., Smith, E., Smith, J., Smith, P., Smolik, J., Smy, M., Snape, M., Snider, E. L., Snopok, P., Snowden-Ifft, D., Nunes, M. Soares, Sobel, H., Soderberg, M., Sokolov, S., Salinas, C. J. Solano, Söldner-Rembold, S., Solomey, N., Solovov, V., Sondheim, W. E., Sorel, M., Sotnikov, A., Soto-Oton, J., Sousa, A., Soustruznik, K., Spinella, F., Spitz, J., Spooner, N. J. C., Spurgeon, K., Stalder, D., Stancari, M., Stanco, L., Steenis, J., Stein, R., Steiner, H. M., Lisbôa, A. F. Steklain, Stepanova, A., Stewart, J., Stillwell, B., Stock, J., Stocker, F., Stokes, T., Strait, M., Strauss, T., Strigari, L., Stuart, A., Suarez, J. G., Subash, J., Surdo, A., Suter, L., Sutera, C. M., Sutton, K., Suvorov, Y., Svoboda, R., Swain, S. K., Szczerbinska, B., Szelc, A. M., Sztuc, A., Taffara, A., Talukdar, N., Tamara, J., Tanaka, H. A., Tang, S., Taniuchi, N., Casanova, A. M. Tapia, Oregui, B. Tapia, Tapper, A., Tariq, S., Tarpara, E., Tatar, E., Tayloe, R., Tedeschi, D., Teklu, A. M., Vidal, J. Tena, Tennessen, P., Tenti, M., Terao, K., Terranova, F., Testera, G., Thakore, T., Thea, A., Thomas, S., Thompson, A., Thorn, C., Timm, S. C., Tiras, E., Tishchenko, V., Tiwari, S., Todorović, N., Tomassetti, L., Tonazzo, A., Torbunov, D., Torti, M., Tortola, M., Tortorici, F., Tosi, N., Totani, D., Toups, M., Touramanis, C., Tran, D., Travaglini, R., Trevor, J., Triller, E., Trilov, S., Truchon, J., Truncali, D., Trzaska, W. H., Tsai, Y., Tsai, Y. -T., Tsamalaidze, Z., Tsang, K. V., Tsverava, N., Tu, S. Z., Tufanli, S., Tunnell, C., Turnberg, S., Turner, J., Tuzi, M., Tyler, J., Tyley, E., Tzanov, M., Uchida, M. A., González, J. Ureña, Urheim, J., Usher, T., Utaegbulam, H., Uzunyan, S., Vagins, M. R., Vahle, P., Valder, S., Valdiviesso, G. A., Valencia, E., Valentim, R., Vallari, Z., Vallazza, E., Valle, J. W. F., Van Berg, R., Van de Water, R. G., Forero, D. V., Vannozzi, A., Van Nuland-Troost, M., Varanini, F., Oliva, D. Vargas, Vasina, S., Vaughan, N., Vaziri, K., Vázquez-Ramos, A., Vega, J., Ventura, S., Verdugo, A., Vergani, S., Verzocchi, M., Vetter, K., Vicenzi, M., de Souza, H. Vieira, Vignoli, C., Vilela, C., Villa, E., Viola, S., Viren, B., Vizarreta, R., Hernandez, A. P. Vizcaya, Vuong, Q., Waldron, A. V., Wallbank, M., Walsh, J., Walton, T., Wang, H., Wang, J., Wang, L., Wang, M. H. L. S., Wang, X., Wang, Y., Warburton, K., Warner, D., Warsame, L., Wascko, M. O., Waters, D., Watson, A., Wawrowska, K., Weber, A., Weber, C. M., Weber, M., Wei, H., Weinstein, A., Westerdale, S., Wetstein, M., Whalen, K., White, A., Whitehead, L. H., Whittington, D., Wilhlemi, J., Wilking, M. J., Wilkinson, A., Wilkinson, C., Wilson, F., Wilson, R. J., Winter, P., Wisniewski, W., Wolcott, J., Wolfs, J., Wongjirad, T., Wood, A., Wood, K., Worcester, E., Worcester, M., Wospakrik, M., Wresilo, K., Wret, C., Wu, S., Wu, W., Wurm, M., Wyenberg, J., Xiao, Y., Xiotidis, I., Yaeggy, B., Yahlali, N., Yandel, E., Yang, J., Yang, K., Yang, T., Yankelevich, A., Yershov, N., Yonehara, K., Young, T., Yu, B., Yu, H., Yu, J., Yu, Y., Yuan, W., Zaki, R., Zalesak, J., Zambelli, L., Zamorano, B., Zani, A., Zapata, O., Zazueta, L., Zeller, G. P., Zennamo, J., Zeug, K., Zhang, C., Zhang, S., Zhao, M., Zhivun, E., Zimmerman, E. D., Zucchelli, S., Zuklin, J., Zutshi, V., and Zwaska, R.
Subjects: Physics - Instrumentation and Detectors, High Energy Physics - Experiment
Abstract: This paper introduces the hypothetical track-length fitting algorithm, a novel method for measuring the kinetic energies of ionizing particles in liquid argon time projection chambers (LArTPCs). The algorithm finds the most probable offset in track length for a track-like object by comparing the measured ionization density as a function of position with a theoretical prediction of the energy loss as a function of the energy, including models of electron recombination and detector response. The algorithm can be used to measure the energies of particles that interact before they stop, such as charged pions that are absorbed by argon nuclei. The algorithm's energy measurement resolutions and fractional biases are presented as functions of particle kinetic energy and number of track hits using samples of stopping secondary charged pions in data collected by the ProtoDUNE-SP detector, and also in a detailed simulation. Additional studies describe impact of the dE/dx model on energy measurement performance. The method described in this paper to characterize the energy measurement performance can be repeated in any LArTPC experiment using stopping secondary charged pions.
Published: 2024

28. Experimental observation of ballistic to diffusive transition in AlN thin films

Author: Hoque, Md Shafkat Bin, Liao, Michael E., Zare, Saman, Liu, Zeyu, Koh, Yee Rui, Huynh, Kenny, Shi, Jingjing, Graham, Samuel, Luo, Tengfei, Ahmad, Habib, Doolittle, W. Alan, Goorsky, Mark S., and Hopkins, Patrick E.
Subjects: Physics - Applied Physics
Abstract: Bulk AlN possesses high thermal conductivity due to long phonon mean-free-paths, high group velocity, and long lifetimes. However, the thermal transport scenario becomes very different in a thin AlN film due to phonon-defect and phonon-boundary scattering. Herein, we report experimental observation of ballistic to diffusive transition in a series of AlN thin films (1.6 - 2440 nm) grown on sapphire substrates. The ballistic transport is characterized by constant thermal resistance as a function of film thickness due to phonon scattering by defects and boundaries. In this transport regime, phonons possess very small group velocities and lifetimes. The lifetime of the optical phonons increases by more than an order of magnitude in the diffusive regime, however, remains nearly constant afterwards. Our study is important for understanding the details of nano and microscale thermal transport in a highly conductive material.
Published: 2024

29. Inertial Coordination Games

Author: Koh, Andrew, Li, Ricky, and Uzui, Kei
Subjects: Economics - Theoretical Economics, Computer Science - Multiagent Systems
Abstract: We analyze inertial coordination games: dynamic coordination games with an endogenously changing state that depends on (i) a persistent fundamental that players privately learn about; and (ii) past play. We give a tight characterization of how the speed of learning shapes equilibrium dynamics: the risk-dominant action is selected in the limit if and only if learning is slow such that posterior precisions grow sub-quadratically. This generalizes results from static global games and endows them with an alternate learning foundation. Conversely, when learning is fast, equilibrium dynamics exhibit persistence and limit play is shaped by initial play. Whenever the risk dominant equilibrium is selected, the path of play undergoes a sudden transition when signals are precise, and a gradual transition when signals are noisy.
Published: 2024

30. Convergence in the incompressible limit of the corner singularities

Author: Choi, Hyung Jun, Kim, Seonghak, and Koh, Youngwoo
Subjects: Mathematics - Analysis of PDEs, 35A21, 76D03
Abstract: In this paper, we treat the corner singularity expansion and its convergence result regarding the penalized system obtained by eliminating the pressure variable in the Stokes problem of incompressible flow. The penalized problem is a kind of the Lam\'{e} system, so we first discuss the corner singularity theory of the Lam\'{e} system with inhomogeneous Dirichlet boundary condition on a non-convex polygon. Considering the inhomogeneous condition, we show the decomposition of its solution, composed of singular parts and a smoother remainder near a re-entrant corner, and furthermore, we provide the explicit formulae of coefficients in singular parts. In particular, these formulae can be used in the development of highly accurate numerical scheme. In addition, we formulate coefficients in singular parts regarding the Stokes equations with inhomogeneous boundary condition and non-divergence-free property of velocity field, and thus we show the convergence results of coefficients in singular parts and remainder regarding the concerned penalized problem., Comment: 34 pages, 1 figure
Published: 2024

31. Quantum Volunteer's Dilemma

Author: Koh, Dax Enshan, Kumar, Kaavya, and Goh, Siong Thye
Subjects: Quantum Physics, Computer Science - Computer Science and Game Theory, Economics - Theoretical Economics, Mathematics - Optimization and Control
Abstract: The volunteer's dilemma is a well-known game in game theory that models the conflict players face when deciding whether to volunteer for a collective benefit, knowing that volunteering incurs a personal cost. In this work, we introduce a quantum variant of the classical volunteer's dilemma, generalizing it by allowing players to utilize quantum strategies. Employing the Eisert-Wilkens-Lewenstein quantization framework, we analyze a multiplayer quantum volunteer's dilemma scenario with an arbitrary number of players, where the cost of volunteering is shared equally among the volunteers. We derive analytical expressions for the players' expected payoffs and demonstrate the quantum game's advantage over the classical game. In particular, we prove that the quantum volunteer's dilemma possesses symmetric Nash equilibria with larger expected payoffs compared to the unique symmetric Nash equilibrium of the classical game, wherein players use mixed strategies. Furthermore, we show that the quantum Nash equilibria we identify are Pareto optimal. Our findings reveal distinct dynamics in volunteer's dilemma scenarios when players adhere to quantum rules, underscoring a strategic advantage of decision-making in quantum settings., Comment: 28 pages, 5 figures
Published: 2024

32. Adhesion and volume filling in one-dimensional population dynamics under no-flux boundary condition

Author: Choi, Hyung Jun, Kim, Seonghak, and Koh, Youngwoo
Subjects: Mathematics - Analysis of PDEs, 35M13, 35K59, 35D30, 92D25
Abstract: We study the (generalized) one-dimensional population model developed by Anguige \& Schmeiser [1], which reflects cell-cell adhesion and volume filling under no-flux boundary condition. In this generalized model, depending on the adhesion and volume filling parameters $\alpha,\beta\in[0,1],$ the resulting equation is classified into six types. Among these, we focus on the type exhibiting strong effects of both adhesion and volume filling, which results in a class of advection-diffusion equations of the forward-backward-forward type. For five distinct cases of initial maximum, minimum and average population densities, we derive the corresponding patterns for the global behavior of weak solutions to the initial and no-flux boundary value problem. Due to the presence of a negative diffusion regime, we indeed prove that the problem is ill-posed and admits infinitely many global-in-time weak solutions, with the exception of one specific case of the initial datum. This nonuniqueness is inherent in the method of convex integration that we use to solve the Dirichlet problem of a partial differential inclusion arising from the ill-posed problem., Comment: 29 pages, 3 figures. arXiv admin note: substantial text overlap with arXiv:2409.04689
Published: 2024

33. Adhesion and volume filling in one-dimensional population dynamics under Dirichlet boundary condition

Author: Choi, Hyung Jun, Kim, Seonghak, and Koh, Youngwoo
Subjects: Mathematics - Analysis of PDEs, 35M13, 35K59, 35D30, 92D25
Abstract: We generalize the one-dimensional population model of Anguige \& Schmeiser [1] reflecting the cell-to-cell adhesion and volume filling and classify the resulting equation into the six types. Among these types, we fix one that yields a class of advection-diffusion equations of forward-backward-forward type and prove the existence of infinitely many global-in-time weak solutions to the initial-Dirichlet boundary value problem when the maximum value of an initial population density exceeds a certain threshold. Such solutions are extracted from the method of convex integration by M\"uller \& \v Sver\'ak [12]; they exhibit fine-scale density mixtures over a finite time interval, then become smooth and identical, and decay exponentially and uniformly to zero as time approaches infinity., Comment: 40 pages, 4 figures
Published: 2024

34. Large Language Models in Drug Discovery and Development: From Disease Mechanisms to Clinical Trials

Author: Zheng, Yizhen, Koh, Huan Yee, Yang, Maddie, Li, Li, May, Lauren T., Webb, Geoffrey I., Pan, Shirui, and Church, George
Subjects: Quantitative Biology - Quantitative Methods, Computer Science - Artificial Intelligence, Computer Science - Machine Learning
Abstract: The integration of Large Language Models (LLMs) into the drug discovery and development field marks a significant paradigm shift, offering novel methodologies for understanding disease mechanisms, facilitating drug discovery, and optimizing clinical trial processes. This review highlights the expanding role of LLMs in revolutionizing various stages of the drug development pipeline. We investigate how these advanced computational models can uncover target-disease linkage, interpret complex biomedical data, enhance drug molecule design, predict drug efficacy and safety profiles, and facilitate clinical trial processes. Our paper aims to provide a comprehensive overview for researchers and practitioners in computational biology, pharmacology, and AI4Science by offering insights into the potential transformative impact of LLMs on drug discovery and development.
Published: 2024

35. OLMoE: Open Mixture-of-Experts Language Models

Author: Muennighoff, Niklas, Soldaini, Luca, Groeneveld, Dirk, Lo, Kyle, Morrison, Jacob, Min, Sewon, Shi, Weijia, Walsh, Pete, Tafjord, Oyvind, Lambert, Nathan, Gu, Yuling, Arora, Shane, Bhagia, Akshita, Schwenk, Dustin, Wadden, David, Wettig, Alexander, Hui, Binyuan, Dettmers, Tim, Kiela, Douwe, Farhadi, Ali, Smith, Noah A., Koh, Pang Wei, Singh, Amanpreet, and Hajishirzi, Hannaneh
Subjects: Computer Science - Computation and Language, Computer Science - Artificial Intelligence, Computer Science - Machine Learning
Abstract: We introduce OLMoE, a fully open, state-of-the-art language model leveraging sparse Mixture-of-Experts (MoE). OLMoE-1B-7B has 7 billion (B) parameters but uses only 1B per input token. We pretrain it on 5 trillion tokens and further adapt it to create OLMoE-1B-7B-Instruct. Our models outperform all available models with similar active parameters, even surpassing larger ones like Llama2-13B-Chat and DeepSeekMoE-16B. We present various experiments on MoE training, analyze routing in our model showing high specialization, and open-source all aspects of our work: model weights, training data, code, and logs., Comment: 61 pages (24 main), 36 figures, 14 tables
Published: 2024

36. On the Vulnerability of Skip Connections to Model Inversion Attacks

Author: Koh, Jun Hao, Ho, Sy-Tuyen, Nguyen, Ngoc-Bao, and Cheung, Ngai-man
Subjects: Computer Science - Computer Vision and Pattern Recognition
Abstract: Skip connections are fundamental architecture designs for modern deep neural networks (DNNs) such as CNNs and ViTs. While they help improve model performance significantly, we identify a vulnerability associated with skip connections to Model Inversion (MI) attacks, a type of privacy attack that aims to reconstruct private training data through abusive exploitation of a model. In this paper, as a pioneer work to understand how DNN architectures affect MI, we study the impact of skip connections on MI. We make the following discoveries: 1) Skip connections reinforce MI attacks and compromise data privacy. 2) Skip connections in the last stage are the most critical to attack. 3) RepVGG, an approach to remove skip connections in the inference-time architectures, could not mitigate the vulnerability to MI attacks. 4) Based on our findings, we propose MI-resilient architecture designs for the first time. Without bells and whistles, we show in extensive experiments that our MI-resilient architectures can outperform state-of-the-art (SOTA) defense methods in MI robustness. Furthermore, our MI-resilient architectures are complementary to existing MI defense methods. Our project is available at https://Pillowkoh.github.io/projects/RoLSS/, Comment: Accepted by ECCV 2024
Published: 2024

37. Readout Error Mitigation for Mid-Circuit Measurements and Feedforward

Author: Koh, Jin Ming, Koh, Dax Enshan, and Thompson, Jayne
Subjects: Quantum Physics
Abstract: Current-day quantum computing platforms are subject to readout errors, in which faulty measurement outcomes are reported by the device. On circuits with mid-circuit measurements and feedforward, readout noise can cause incorrect conditional quantum operations to be applied on a per-shot basis. Standard readout error mitigation methods for terminal measurements which act in post-processing do not suffice in this context. Here we present a general method for readout error mitigation for expectation values on circuits containing an arbitrary number of layers of mid-circuit measurements and feedforward, at zero circuit depth and two-qubit gate count cost. The protocol uses a form of gate twirling for symmetrization of the error channels and probabilistic bit-flips in feedforward data to average over an ensemble of quantum trajectories. The mitigated estimator is unbiased and has a sampling overhead of ${\sim} 1 / (1 - 2 r)^m$ for $m$ total measurements and characteristic readout error rate $r$ per measurement. We demonstrate the effectiveness of our method, obtaining up to a ${\sim} 60\%$ reduction in error on superconducting quantum processors for several examples of feedforward circuits of practical interest, including dynamic qubit resets, shallow-depth GHZ state preparation, and multi-stage quantum state teleportation., Comment: 15 pages, 6 figures, 1 table in main text; 24 pages, 6 figures, 2 tables in appendices
Published: 2024

38. Quantum-centric supercomputing for materials science: A perspective on challenges and future directions

Author: Alexeev, Yuri, Amsler, Maximilian, Barroca, Marco Antonio, Bassini, Sanzio, Battelle, Torey, Camps, Daan, Casanova, David, Choi, Young Jay, Chong, Frederic T, Chung, Charles, Codella, Christopher, Córcoles, Antonio D, Cruise, James, Di Meglio, Alberto, Duran, Ivan, Eckl, Thomas, Economou, Sophia, Eidenbenz, Stephan, Elmegreen, Bruce, Fare, Clyde, Faro, Ismael, Fernández, Cristina Sanz, Ferreira, Rodrigo Neumann Barros, Fuji, Keisuke, Fuller, Bryce, Gagliardi, Laura, Galli, Giulia, Glick, Jennifer R, Gobbi, Isacco, Gokhale, Pranav, de la Puente Gonzalez, Salvador, Greiner, Johannes, Gropp, Bill, Grossi, Michele, Gull, Emanuel, Healy, Burns, Hermes, Matthew R, Huang, Benchen, Humble, Travis S, Ito, Nobuyasu, Izmaylov, Artur F, Javadi-Abhari, Ali, Jennewein, Douglas, Jha, Shantenu, Jiang, Liang, Jones, Barbara, de Jong, Wibe Albert, Jurcevic, Petar, Kirby, William, Kister, Stefan, Kitagawa, Masahiro, Klassen, Joel, Klymko, Katherine, Koh, Kwangwon, Kondo, Masaaki, Kürkçüog̃lu, Dog̃a Murat, Kurowski, Krzysztof, Laino, Teodoro, Landfield, Ryan, Leininger, Matt, Leyton-Ortega, Vicente, Li, Ang, Lin, Meifeng, Liu, Junyu, Lorente, Nicolas, Luckow, Andre, Martiel, Simon, Martin-Fernandez, Francisco, Martonosi, Margaret, Marvinney, Claire, Medina, Arcesio Castaneda, Merten, Dirk, Mezzacapo, Antonio, Michielsen, Kristel, Mitra, Abhishek, Mittal, Tushar, Moon, Kyungsun, Moore, Joel, Mostame, Sarah, Motta, Mario, Na, Young-Hye, Nam, Yunseong, Narang, Prineha, Ohnishi, Yu-ya, Ottaviani, Daniele, Otten, Matthew, Pakin, Scott, Pascuzzi, Vincent R, Pednault, Edwin, Piontek, Tomasz, Pitera, Jed, Rall, Patrick, Ravi, Gokul Subramanian, Robertson, Niall, Rossi, Matteo AC, Rydlichowski, Piotr, Ryu, Hoon, Samsonidze, Georgy, Sato, Mitsuhisa, and Saurabh, Nishant
Subjects: Data Management and Data Science, Distributed Computing and Systems Software, Information and Computing Sciences, Information Systems, Networking and Information Technology R&D (NITRD), Quantum-centric supercomputing, Quantum computing, Materials science, High-performance computing, Computer Software, Distributed Computing, Data management and data science, Distributed computing and systems software, Information systems
Abstract: Computational models are an essential tool for the design, characterization, and discovery of novel materials. Computationally hard tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their resources for simulation, analysis, and data processing. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. In this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.
Published: 2024

39. Exploring the influence of cell configurations on Cu catalyst reconstruction during CO2 electroreduction.

Author: Choi, Woong, Chae, Younghyun, Liu, Ershuai, Kim, Dongjin, Drisdell, Walter, Oh, Hyung-Suk, Koh, Jai, Lee, Dong, Lee, Ung, and Won, Da
Abstract: Membrane electrode assembly (MEA) cells incorporating Cu catalysts are effective for generating C2+ chemicals via the CO2 reduction reaction (CO2RR). However, the impact of MEA configuration on the inevitable reconstruction of Cu catalysts during CO2RR remains underexplored, despite its considerable potential to affect CO2RR efficacy. Herein, we demonstrate that MEA cells prompt a unique reconstruction of Cu, in contrast to H-type cells, which subsequently influences CO2RR outcomes. Utilizing three Cu-based catalysts, specifically engineered with different nanostructures, we identify contrasting selectivity trends in the production of C2+ chemicals between H-type and MEA cells. Operando X-ray absorption spectroscopy, alongside ex-situ analyses in both cell types, indicates that MEA cells facilitate the reduction of Cu2O, resulting in altered Cu surfaces compared to those in H-type cells. Time-resolved CO2RR studies, supported by Operando analysis, further highlight that significant Cu reconstruction within MEA cells is a primary factor leading to the deactivation of CO2RR into C2+ chemicals.
Published: 2024

40. Multiomic single cell sequencing identifies stemlike nature of mixed phenotype acute leukemia.

Author: Peretz, Cheryl, Kennedy, Vanessa, Walia, Anushka, Delley, Cyrille, Koh, Andrew, Tran, Elaine, Clark, Iain, Hayford, Corey, DAmato, Chris, Xue, Yi, Fontanez, Kristina, May-Zhang, Aaron, Smithers, Trinity, Agam, Yigal, Wang, Qian, Dai, Hai-Ping, Roy, Ritu, Logan, Aaron, Perl, Alexander, Abate, Adam, Olshen, Adam, and Smith, Catherine
Subjects: Humans, Single-Cell Analysis, Male, Female, Leukemia, Biphenotypic, Acute, Adult, Middle Aged, Transcriptome, Prognosis, Aged, Gene Expression Profiling, Neoplastic Stem Cells, Phenotype, Immunophenotyping, Mutation, Sequence Analysis, RNA, Gene Expression Regulation, Leukemic
Abstract: Despite recent work linking mixed phenotype acute leukemia (MPAL) to certain genetic lesions, specific driver mutations remain undefined for a significant proportion of patients and no genetic subtype is predictive of clinical outcomes. Moreover, therapeutic strategy for MPAL remains unclear, and prognosis is overall poor. We performed multiomic single cell profiling of 14 newly diagnosed adult MPAL patients to characterize the inter- and intra-tumoral transcriptional, immunophenotypic, and genetic landscapes of MPAL. We show that neither genetic profile nor transcriptome reliably correlate with specific MPAL immunophenotypes. Despite this, we find that MPAL blasts express a shared stem cell-like transcriptional profile indicative of high differentiation potential. Patients with the highest differentiation potential demonstrate inferior survival in our dataset. A gene set score, MPAL95, derived from genes highly enriched in the most stem-like MPAL cells, is applicable to bulk RNA sequencing data and is predictive of survival in an independent patient cohort, suggesting a potential strategy for clinical risk stratification.
Published: 2024

41. Robust Technology Regulation

Author: Koh, Andrew and Sanguanmoo, Sivakorn
Subjects: Economics - Theoretical Economics
Abstract: We analyze how uncertain technologies should be robustly regulated. An agent develops a new technology and, while privately learning about its harms and benefits, continually chooses whether to continue development. A principal, uncertain about what the agent might learn, chooses among dynamic mechanisms (e.g., paths of taxes or subsidies) to influence the agent's choices in different states. We show that learning robust mechanisms -- those which deliver the highest payoff guarantee across all learning processes -- are simple and resemble `regulatory sandboxes' consisting of zero marginal tax on R&D which keeps the agent maximally sensitive to new information up to a hard quota, upon which the agent turns maximally insensitive. Robustness is important: we characterize the worst-case learning process under non-robust mechanisms and show that they induce growing but weak optimism which can deliver unboundedly poor principal payoffs; hard quotas safeguard against this. If the regulator also learns, adaptive hard quotas are robustly optimal which highlights the importance of expertise in regulation.
Published: 2024

42. DUNE Phase II: Scientific Opportunities, Detector Concepts, Technological Solutions

Author: DUNE Collaboration, Abud, A. Abed, Abi, B., Acciarri, R., Acero, M. A., Adames, M. R., Adamov, G., Adamowski, M., Adams, D., Adinolfi, M., Adriano, C., Aduszkiewicz, A., Aguilar, J., Akbar, F., Allison, K., Monsalve, S. Alonso, Alrashed, M., Alton, A., Alvarez, R., Alves, T., Amar, H., Amedo, P., Anderson, J., Andreopoulos, C., Andreotti, M., Andrews, M. P., Andrianala, F., Andringa, S., Anfimov, N., Ankowski, A., Antic, D., Antoniassi, M., Antonova, M., Antoshkin, A., Aranda-Fernandez, A., Arellano, L., Diaz, E. Arrieta, Arroyave, M. A., Asaadi, J., Ashkenazi, A., Asner, D. M., Asquith, L., Atkin, E., Auguste, D., Aurisano, A., Aushev, V., Autiero, D., Azam, M. B., Azfar, F., Back, A., Back, H., Back, J. J., Bagaturia, I., Bagby, L., Balashov, N., Balasubramanian, S., Baldi, P., Baldini, W., Baldonedo, J., Baller, B., Bambah, B., Banerjee, R., Barao, F., Barbu, D., Barenboim, G., Barham~Alzás, P., Barker, G. J., Barkhouse, W., Barr, G., Monarca, J. Barranco, Barros, A., Barros, N., Barrow, D., Barrow, J. L., Basharina-Freshville, A., Bashyal, A., Basque, V., Batchelor, C., Bathe-Peters, L., Battat, J. B. R., Battisti, F., Bay, F., Bazetto, M. C. Q., Alba, J. L. L. Bazo, Beacom, J. F., Bechetoille, E., Behera, B., Belchior, E., Bell, G., Bellantoni, L., Bellettini, G., Bellini, V., Beltramello, O., Benekos, N., Montiel, C. Benitez, Benjamin, D., Neves, F. Bento, Berger, J., Berkman, S., Bernal, J., Bernardini, P., Bersani, A., Bertolucci, S., Betancourt, M., Rodríguez, A. Betancur, Bevan, A., Bezawada, Y., Bezerra, A. T., Bezerra, T. J., Bhat, A., Bhatnagar, V., Bhatt, J., Bhattacharjee, M., Bhattacharya, M., Bhuller, S., Bhuyan, B., Biagi, S., Bian, J., Biery, K., Bilki, B., Bishai, M., Bitadze, A., Blake, A., Blaszczyk, F. D., Blazey, G. C., Blucher, E., Bodek, A., Bogenschuetz, J., Boissevain, J., Bolognesi, S., Bolton, T., Bomben, L., Bonesini, M., Bonilla-Diaz, C., Bonini, F., Booth, A., Boran, F., Bordoni, S., Merlo, R. Borges, Borkum, A., Bostan, N., Bouet, R., Boza, J., Bracinik, J., Brahma, B., Brailsford, D., Bramati, F., Branca, A., Brandt, A., Bremer, J., Brew, C., Brice, S. J., Brio, V., Brizzolari, C., Bromberg, C., Brooke, J., Bross, A., Brunetti, G., Brunetti, M., Buchanan, N., Budd, H., Buergi, J., Bundock, A., Burgardt, D., Butchart, S., V., G. Caceres, Cagnoli, I., Cai, T., Calabrese, R., Calcutt, J., Calivers, L., Calvo, E., Caminata, A., Camino, A. F., Campanelli, W., Campani, A., Benitez, A. Campos, Canci, N., Capó, J., Caracas, I., Caratelli, D., Carber, D., Carceller, J. M., Carini, G., Carlus, B., Carneiro, M. F., Carniti, P., Terrazas, I. Caro, Carranza, H., Carrara, N., Carroll, L., Carroll, T., Carter, A., Casarejos, E., Casazza, D., Forero, J. F. Castaño, Castaño, F. A., Castillo, A., Castromonte, C., Catano-Mur, E., Cattadori, C., Cavalier, F., Cavanna, F., Centro, S., Cerati, G., Cerna, C., Cervelli, A., Villanueva, A. Cervera, Chakraborty, K., Chakraborty, S., Chalifour, M., Chappell, A., Charitonidis, N., Chatterjee, A., Chen, H., Chen, M., Chen, W. C., Chen, Y., Chen-Wishart, Z., Cherdack, D., Chi, C., Chiapponi, F., Chirco, R., Chitirasreemadam, N., Cho, K., Choate, S., Chokheli, D., Chong, P. S., Chowdhury, B., Christian, D., Chukanov, A., Chung, M., Church, E., Cicala, M. F., Cicerchia, M., Cicero, V., Ciolini, R., Clarke, P., Cline, G., Coan, T. E., Cocco, A. G., Coelho, J. A. B., Cohen, A., Collazo, J., Collot, J., Conley, E., Conrad, J. M., Convery, M., Copello, S., Cortez, A. F. V., Cova, P., Cox, C., Cremaldi, L., Cremonesi, L., Crespo-Anadón, J. I., Crisler, M., Cristaldo, E., Crnkovic, J., Crone, G., Cross, R., Cudd, A., Cuesta, C., Cui, Y., Curciarello, F., Cussans, D., Dai, J., Dalager, O., Dallavalle, R., Dallaway, W., D'Amico, R., da Motta, H., Dar, Z. A., Darby, R., Peres, L. Da Silva, David, Q., Davies, G. S., Davini, S., Dawson, J., De Aguiar, R., De Almeida, P., Debbins, P., De Bonis, I., Decowski, M. P., de Gouvêa, A., De Holanda, P. C., Astiz, I. L. De Icaza, De Jong, P., Sanchez, P. Del Amo, De la Torre, A., De Lauretis, G., Delbart, A., Delepine, D., Delgado, M., Dell'Acqua, A., Monache, G. Delle, Delmonte, N., De Lurgio, P., Demario, R., De Matteis, G., Neto, J. R. T. de Mello, DeMuth, D. M., Dennis, S., Densham, C., Denton, P., Deptuch, G. W., De Roeck, A., De Romeri, V., Detje, J. P., Devine, J., Dharmapalan, R., Dias, M., Diaz, A., Díaz, J. S., Díaz, F., Di Capua, F., Di Domenico, A., Di Domizio, S., Di Falco, S., Di Giulio, L., Ding, P., Di Noto, L., Diociaiuti, E., Distefano, C., Diurba, R., Diwan, M., Djurcic, Z., Doering, D., Dolan, S., Dolek, F., Dolinski, M. J., Domenici, D., Domine, L., Donati, S., Donon, Y., Doran, S., Douglas, D., Doyle, T. A., Dragone, A., Drielsma, F., Duarte, L., Duchesneau, D., Duffy, K., Dugas, K., Dunne, P., Dutta, B., Duyang, H., Dwyer, D. A., Dyshkant, A. S., Dytman, S., Eads, M., Earle, A., Edayath, S., Edmunds, D., Eisch, J., Englezos, P., Ereditato, A., Erjavec, T., Escobar, C. O., Evans, J. J., Ewart, E., Ezeribe, A. C., Fahey, K., Fajt, L., Falcone, A., Fani', M., Farnese, C., Farrell, S., Farzan, Y., Fedoseev, D., Felix, J., Feng, Y., Fernandez-Martinez, E., Fernández-Posada, D., Ferry, G., Fialova, E., Fields, L., Filip, P., Filkins, A., Filthaut, F., Fine, R., Fiorillo, G., Fiorini, M., Fogarty, S., Foreman, W., Fowler, J., Franc, J., Francis, K., Franco, D., Franklin, J., Freeman, J., Fried, J., Friedland, A., Fuess, S., Furic, I. K., Furman, K., Furmanski, A. P., Gaba, R., Gabrielli, A., M~Gago, A., Galizzi, F., Gallagher, H., Gallice, N., Galymov, V., Gamberini, E., Gamble, T., Ganacim, F., Gandhi, R., Ganguly, S., Gao, F., Gao, S., Garcia-Gamez, D., García-Peris, M. Á., Gardim, F., Gardiner, S., Gastler, D., Gauch, A., Gauvreau, J., Gauzzi, P., Gazzana, S., Ge, G., Geffroy, N., Gelli, B., Gent, S., Gerlach, L., Ghorbani-Moghaddam, Z., Giammaria, T., Gibin, D., Gil-Botella, I., Gilligan, S., Gioiosa, A., Giovannella, S., Girerd, C., Giri, A. K., Giugliano, C., Giusti, V., Gnani, D., Gogota, O., Gollapinni, S., Gollwitzer, K., Gomes, R. A., Bermeo, L. V. Gomez, Fajardo, L. S. Gomez, Gonnella, F., Gonzalez-Diaz, D., Gonzalez-Lopez, M., Goodman, M. C., Goswami, S., Gotti, C., Goudeau, J., Goudzovski, E., Grace, C., Gramellini, E., Gran, R., Granados, E., Granger, P., Grant, C., Gratieri, D. R., Grauso, G., Green, P., Greenberg, S., Greer, J., Griffith, W. C., Groetschla, F. T., Grzelak, K., Gu, L., Gu, W., Guarino, V., Guarise, M., Guenette, R., Guerzoni, M., Guffanti, D., Guglielmi, A., Guo, B., Guo, F. Y., Gupta, A., Gupta, V., Gurung, G., Gutierrez, D., Guzowski, P., Guzzo, M. M., Gwon, S., Habig, A., Hadavand, H., Haegel, L., Haenni, R., Hagaman, L., Hahn, A., Haiston, J., Hakenmüller, J., Hamernik, T., Hamilton, P., Hancock, J., Happacher, F., Harris, D. A., Hart, A., Hartnell, J., Hartnett, T., Harton, J., Hasegawa, T., Hasnip, C. M., Hatcher, R., Hayrapetyan, K., Hays, J., Hazen, E., He, M., Heavey, A., Heeger, K. M., Heise, J., Hellmuth, P., Henry, S., Hernández-García, J., Herner, K., Hewes, V., Higuera, A., Hilgenberg, C., Hillier, S. J., Himmel, A., Hinkle, E., Hirsch, L. R., Ho, J., Hoff, J., Holin, A., Holvey, T., Hoppe, E., Horiuchi, S., Horton-Smith, G. A., Houdy, T., Howard, B., Howell, R., Hristova, I., Hronek, M. S., Huang, J., Huang, R. G., Hulcher, Z., Ibrahim, M., Iles, G., Ilic, N., Iliescu, A. M., Illingworth, R., Ingratta, G., Ioannisian, A., Irwin, B., Isenhower, L., Oliveira, M. Ismerio, Itay, R., Jackson, C. M., Jain, V., James, E., Jang, W., Jargowsky, B., Jena, D., Jentz, I., Ji, X., Jiang, C., Jiang, J., Jiang, L., Jipa, A., Jo, J. H., Joaquim, F. R., Johnson, W., Jollet, C., Jones, B., Jones, R., Jovancevic, N., Judah, M., Jung, C. K., Junk, T., Jwa, Y., Kabirnezhad, M., Kaboth, A. C., Kadenko, I., Kakorin, I., Kalitkina, A., Kalra, D., Kandemir, M., Kaplan, D. M., Karagiorgi, G., Karaman, G., Karcher, A., Karyotakis, Y., Kasai, S., Kasetti, S. P., Kashur, L., Katsioulas, I., Kauther, A., Kazaryan, N., Ke, L., Kearns, E., Keener, P. T., Kelly, K. J., Kemp, E., Kemularia, O., Kermaidic, Y., Ketchum, W., Kettell, S. H., Khabibullin, M., Khan, N., Khvedelidze, A., Kim, D., Kim, J., Kim, M. J., King, B., Kirby, B., Kirby, M., Kish, A., Klein, J., Kleykamp, J., Klustova, A., Kobilarcik, T., Koch, L., Koehler, K., Koerner, L. W., Koh, D. H., Kolupaeva, L., Korablev, D., Kordosky, M., Kosc, T., Kose, U., Kostelecký, V. A., Kothekar, K., Kotler, I., Kovalcuk, M., Kozhukalov, V., Krah, W., Kralik, R., Kramer, M., Kreczko, L., Krennrich, F., Kreslo, I., Kroupova, T., Kubota, S., Kubu, M., Kudenko, Y., Kudryavtsev, V. A., Kufatty, G., Kuhlmann, S., Kulagin, S., Kumar, J., Kumar, P., Kumaran, S., Kunzmann, J., Kuravi, R., Kurita, N., Kuruppu, C., Kus, V., Kutter, T., Kuźniak, M., Kvasnicka, J., Labree, T., Lackey, T., Lalău, I., Lambert, A., Land, B. J., Lane, C. E., Lane, N., Lang, K., Langford, T., Langstaff, M., Lanni, F., Lantwin, O., Larkin, J., Lasorak, P., Last, D., Laudrain, A., Laundrie, A., Laurenti, G., Lavaut, E., Laycock, P., Lazanu, I., LaZur, R., Lazzaroni, M., Le, T., Leardini, S., Learned, J., LeCompte, T., Legin, V., Miotto, G. Lehmann, Lehnert, R., de Oliveira, M. A. Leigui, Leitner, M., Silverio, D. Leon, Lepin, L. M., -Y~Li, J., Li, S. W., Li, Y., Liao, H., Lin, C. S., Lindebaum, D., Linden, S., Lineros, R. A., Lister, A., Littlejohn, B. R., Liu, H., Liu, J., Liu, Y., Lockwitz, S., Lokajicek, M., Lomidze, I., Long, K., Lopes, T. V., Lopez, J., de Rego, I. López, López-March, N., Lord, T., LoSecco, J. M., Louis, W. C., Sanchez, A. Lozano, Lu, X. -G., Luk, K. B., Lunday, B., Luo, X., Luppi, E., MacFarlane, D., Machado, A. A., Machado, P., Macias, C. T., Macier, J. R., MacMahon, M., Maddalena, A., Madera, A., Madigan, P., Magill, S., Magueur, C., Mahn, K., Maio, A., Major, A., Majumdar, K., Mameli, S., Man, M., Mandujano, R. C., Maneira, J., Manly, S., Mann, A., Manolopoulos, K., Plata, M. Manrique, Corchado, S. Manthey, Manyam, V. N., Marchan, M., Marchionni, A., Marciano, W., Marfatia, D., Mariani, C., Maricic, J., Marinho, F., Marino, A. D., Markiewicz, T., Marques, F. Das Chagas, Marquet, C., Marshak, M., Marshall, C. M., Marshall, J., Martina, L., Martín-Albo, J., Martinez, N., Caicedo, D. A. Martinez, López, F. Martínez, Miravé, P. Martínez, Martynenko, S., Mascagna, V., Massari, C., Mastbaum, A., Matichard, F., Matsuno, S., Matteucci, G., Matthews, J., Mauger, C., Mauri, N., Mavrokoridis, K., Mawby, I., Mazza, R., McAskill, T., McConkey, N., McFarland, K. S., McGrew, C., McNab, A., Meazza, L., Meddage, V. C. N., Mefodiev, A., Mehta, B., Mehta, P., Melas, P., Mena, O., Mendez, H., Mendez, P., Méndez, D. P., Menegolli, A., Meng, G., Mercuri, A. C. E. A., Meregaglia, A., Messier, M. D., Metallo, S., Metcalf, W., Mewes, M., Meyer, H., Miao, T., Micallef, J., Miccoli, A., Michna, G., Milincic, R., Miller, F., Miller, G., Miller, W., Mineev, O., Minotti, A., Miralles, L., Miranda, O. G., Mironov, C., Miryala, S., Miscetti, S., Mishra, C. S., Mishra, P., Mishra, S. R., Mislivec, A., Mitchell, M., Mladenov, D., Mocioiu, I., Mogan, A., Moggi, N., Mohanta, R., Mohayai, T. A., Mokhov, N., Molina, J., Bueno, L. Molina, Montagna, E., Montanari, A., Montanari, C., Montanari, D., Montanino, D., Zetina, L. M. Montaño, Mooney, M., Moor, A. F., Moore, Z., Moreno, D., Moreno-Palacios, O., Morescalchi, L., Moretti, D., Moretti, R., Morris, C., Mossey, C., Moura, C. A., Mouster, G., Mu, W., Mualem, L., Mueller, J., Muether, M., Muheim, F., Muir, A., Mulhearn, M., Munford, D., Munteanu, L. J., Muramatsu, H., Muraz, J., Murphy, M., Murphy, T., Muse, J., Mytilinaki, A., Nachtman, J., Nagai, Y., Nagu, S., Nandakumar, R., Naples, D., Narita, S., Navrer-Agasson, A., Nayak, N., Nebot-Guinot, M., Nehm, A., Nelson, J. K., Neogi, O., Nesbit, J., Nessi, M., Newbold, D., Newcomer, M., Nichol, R., Nicolas-Arnaldos, F., Nikolica, A., Nikolov, J., Niner, E., Nishimura, K., Norman, A., Norrick, A., Novella, P., Nowak, A., Nowak, J. A., Oberling, M., Ochoa-Ricoux, J. P., Oh, S., Oh, S. B., Olivier, A., Olshevskiy, A., Olson, T., Onel, Y., Onishchuk, Y., Oranday, A., Gann, G. D. Orebi, Osbiston, M., Vélez, J. A. Osorio, O'Sullivan, L., Ormachea, L. Otiniano, Ott, J., Pagani, L., Palacio, G., Palamara, O., Palestini, S., Paley, J. M., Pallavicini, M., Palomares, C., Pan, S., Panda, P., Vazquez, W. Panduro, Pantic, E., Paolone, V., Papaleo, R., Papanestis, A., Papoulias, D., Paramesvaran, S., Paris, A., Parke, S., Parozzi, E., Parsa, S., Parsa, Z., Parveen, S., Parvu, M., Pasciuto, D., Pascoli, S., Pasqualini, L., Pasternak, J., Patrick, C., Patrizii, L., Patterson, R. B., Patzak, T., Paudel, A., Paulucci, L., Pavlovic, Z., Pawloski, G., Payne, D., Pec, V., Pedreschi, E., Peeters, S. J. M., Pellico, W., Perez, A. Pena, Pennacchio, E., Penzo, A., Peres, O. L. G., Gonzalez, Y. F. Perez, Pérez-Molina, L., Pernas, C., Perry, J., Pershey, D., Pessina, G., Petrillo, G., Petta, C., Petti, R., Pfaff, M., Pia, V., Pickering, L., Pietropaolo, F., Pimentel, V. L., Pinaroli, G., Pincha, S., Pinchault, J., Pitts, K., Plows, K., Pollack, C., Pollman, T., Pompa, F., Pons, X., Poonthottathil, N., Popov, V., Poppi, F., Porter, J., Paix{ã}o, L. G. Porto, Potekhin, M., Potenza, R., Pozimski, J., Pozzato, M., Prakash, T., Pratt, C., Prest, M., Psihas, F., Pugnere, D., Qian, X., Queen, J., Raaf, J. L., Radeka, V., Rademacker, J., Radics, B., Raffaelli, F., Rafique, A., Raguzin, E., Rai, M., Rajagopalan, S., Rajaoalisoa, M., Rakhno, I., Rakotondravohitra, L., Ralte, L., Delgado, M. A. Ramirez, Ramson, B., Rappoldi, A., Raselli, G., Ratoff, P., Ray, R., Razafinime, H., Rea, E. M., Real, J. S., Rebel, B., Rechenmacher, R., Reichenbacher, J., Reitzner, S. D., Sfar, H. Rejeb, Renner, E., Renshaw, A., Rescia, S., Resnati, F., Diego~Restrepo, Reynolds, C., Ribas, M., Riboldi, S., Riccio, C., Riccobene, G., Ricol, J. S., Rigan, M., Rincón, E. V., Ritchie-Yates, A., Ritter, S., Rivera, D., Rivera, R., Robert, A., Rocha, J. L. Rocabado, Rochester, L., Roda, M., Rodrigues, P., Alonso, M. J. Rodriguez, Rondon, J. Rodriguez, Rosauro-Alcaraz, S., Rosier, P., Ross, D., Rossella, M., Rossi, M., Ross-Lonergan, M., Roy, N., Roy, P., Rubbia, C., Ruggeri, A., Ruiz, G., Russell, B., Ruterbories, D., Rybnikov, A., Sacerdoti, S., Saha, S., Sahoo, S. K., Sahu, N., Sala, P., Samios, N., Samoylov, O., Sanchez, M. C., Bravo, A. Sánchez, Sánchez-Castillo, A., Sanchez-Lucas, P., Sandberg, V., Sanders, D. A., Sanfilippo, S., Sankey, D., Santoro, D., Saoulidou, N., Sapienza, P., Sarasty, C., Sarcevic, I., Sarra, I., Savage, G., Savinov, V., Scanavini, G., Scaramelli, A., Scarff, A., Schefke, T., Schellman, H., Schifano, S., Schlabach, P., Schmitz, D., Schneider, A. W., Scholberg, K., Schukraft, A., Schuld, B., Segade, A., Segreto, E., Selyunin, A., Senadheera, D., Senise, C. R., Sensenig, J., Seo, S. H., Shaevitz, M. H., Shanahan, P., Sharma, P., Kumar, R., Poudel, S. Sharma, Shaw, K., Shaw, T., Shchablo, K., Shen, J., Shepherd-Themistocleous, C., Sheshukov, A., Shi, J., Shi, W., Shin, S., Shivakoti, S., Shoemaker, I., Shooltz, D., Shrock, R., Siddi, B., Siden, M., Silber, J., Simard, L., Sinclair, J., Sinev, G., Singh, J., Singh, L., Singh, P., Singh, V., Chauhan, S. Singh, Sipos, R., Sironneau, C., Sirri, G., Siyeon, K., Skarpaas, K., Smedley, J., Smith, E., Smith, J., Smith, P., Smolik, J., Smy, M., Snape, M., Snider, E. L., Snopok, P., Snowden-Ifft, D., Nunes, M. Soares, Sobel, H., Soderberg, M., Sokolov, S., Salinas, C. J. Solano, Söldner-Rembold, S., Solomey, N., Solovov, V., Sondheim, W. E., Sorel, M., Sotnikov, A., Soto-Oton, J., Sousa, A., Soustruznik, K., Spinella, F., Spitz, J., Spooner, N. J. C., Spurgeon, K., Stalder, D., Stancari, M., Stanco, L., Steenis, J., Stein, R., Steiner, H. M., Lisbôa, A. F. Steklain, Stepanova, A., Stewart, J., Stillwell, B., Stock, J., Stocker, F., Stokes, T., Strait, M., Strauss, T., Strigari, L., Stuart, A., Suarez, J. G., Subash, J., Surdo, A., Suter, L., Sutera, C. M., Sutton, K., Suvorov, Y., Svoboda, R., Swain, S. K., Szczerbinska, B., Szelc, A. M., Sztuc, A., Taffara, A., Talukdar, N., Tamara, J., Tanaka, H. A., Tang, S., Taniuchi, N., Casanova, A. M. Tapia, Oregui, B. Tapia, Tapper, A., Tariq, S., Tarpara, E., Tatar, E., Tayloe, R., Tedeschi, D., Teklu, A. M., Vidal, J. Tena, Tennessen, P., Tenti, M., Terao, K., Terranova, F., Testera, G., Thakore, T., Thea, A., Thomas, S., Thompson, A., Thorn, C., Timm, S. C., Tiras, E., Tishchenko, V., Todorović, N., Tomassetti, L., Tonazzo, A., Torbunov, D., Torti, M., Tortola, M., Tortorici, F., Tosi, N., Totani, D., Toups, M., Touramanis, C., Tran, D., Travaglini, R., Trevor, J., Triller, E., Trilov, S., Truchon, J., Truncali, D., Trzaska, W. H., Tsai, Y., Tsai, Y. -T., Tsamalaidze, Z., Tsang, K. V., Tsverava, N., Tu, S. Z., Tufanli, S., Tunnell, C., Turnberg, S., Turner, J., Tuzi, M., Tyler, J., Tyley, E., Tzanov, M., Uchida, M. A., González, J. Ureña, Urheim, J., Usher, T., Utaegbulam, H., Uzunyan, S., Vagins, M. R., Vahle, P., Valder, S., Valdiviesso, G. A., Valencia, E., Valentim, R., Vallari, Z., Vallazza, E., Valle, J. W. F., Van Berg, R., Van de Water, R. G., Forero, D. V., Vannozzi, A., Van Nuland-Troost, M., Varanini, F., Oliva, D. Vargas, Vasina, S., Vaughan, N., Vaziri, K., Vázquez-Ramos, A., Vega, J., Ventura, S., Verdugo, A., Vergani, S., Verzocchi, M., Vetter, K., Vicenzi, M., de Souza, H. Vieira, Vignoli, C., Vilela, C., Villa, E., Viola, S., Viren, B., Hernandez, A. P. Vizcaya, Vuong, Q., Waldron, A. V., Wallbank, M., Walsh, J., Walton, T., Wang, H., Wang, J., Wang, L., Wang, M. H. L. S., Wang, X., Wang, Y., Warburton, K., Warner, D., Warsame, L., Wascko, M. O., Waters, D., Watson, A., Wawrowska, K., Weber, A., Weber, C. M., Weber, M., Wei, H., Weinstein, A., Westerdale, S., Wetstein, M., Whalen, K., White, A., Whitehead, L. H., Whittington, D., Wilhlemi, J., Wilking, M. J., Wilkinson, A., Wilkinson, C., Wilson, F., Wilson, R. J., Winter, P., Wisniewski, W., Wolcott, J., Wolfs, J., Wongjirad, T., Wood, A., Wood, K., Worcester, E., Worcester, M., Wospakrik, M., Wresilo, K., Wret, C., Wu, S., Wu, W., Wurm, M., Wyenberg, J., Xiao, Y., Xiotidis, I., Yaeggy, B., Yahlali, N., Yandel, E., Yang, J., Yang, K., Yang, T., Yankelevich, A., Yershov, N., Yonehara, K., Young, T., Yu, B., Yu, H., Yu, J., Yu, Y., Yuan, W., Zaki, R., Zalesak, J., Zambelli, L., Zamorano, B., Zani, A., Zapata, O., Zazueta, L., Zeller, G. P., Zennamo, J., Zeug, K., Zhang, C., Zhang, S., Zhao, M., Zhivun, E., Zimmerman, E. D., Zucchelli, S., Zuklin, J., Zutshi, V., and Zwaska, R.
Subjects: Physics - Instrumentation and Detectors, High Energy Physics - Experiment
Abstract: The international collaboration designing and constructing the Deep Underground Neutrino Experiment (DUNE) at the Long-Baseline Neutrino Facility (LBNF) has developed a two-phase strategy toward the implementation of this leading-edge, large-scale science project. The 2023 report of the US Particle Physics Project Prioritization Panel (P5) reaffirmed this vision and strongly endorsed DUNE Phase I and Phase II, as did the European Strategy for Particle Physics. While the construction of the DUNE Phase I is well underway, this White Paper focuses on DUNE Phase II planning. DUNE Phase-II consists of a third and fourth far detector (FD) module, an upgraded near detector complex, and an enhanced 2.1 MW beam. The fourth FD module is conceived as a "Module of Opportunity", aimed at expanding the physics opportunities, in addition to supporting the core DUNE science program, with more advanced technologies. This document highlights the increased science opportunities offered by the DUNE Phase II near and far detectors, including long-baseline neutrino oscillation physics, neutrino astrophysics, and physics beyond the standard model. It describes the DUNE Phase II near and far detector technologies and detector design concepts that are currently under consideration. A summary of key R&D goals and prototyping phases needed to realize the Phase II detector technical designs is also provided. DUNE's Phase II detectors, along with the increased beam power, will complete the full scope of DUNE, enabling a multi-decadal program of groundbreaking science with neutrinos.
Published: 2024

43. $K$-isomeric states in the isotopic and isotonic chains of $^{178}$Hf

Author: Minkov, N., Bonneau, L., Quentin, P., Bartel, J., Molique, H., and Koh, Meng-Hock
Subjects: Nuclear Theory
Abstract: We study the evolution of $K^{\pi}=6^{+}$ and $8^{-}$ two-quasiparticle (q.p.) configurations in the isotopic and isotonic chains of even-even deformed nuclei around $^{178}$Hf and their ability to describe series of observed $K$-isomer excitations within the framework of a Skyrme Hartree--Fock--BCS (SHFBCS) approach using SIII interaction and seniority pairing strengths with self-consistent blocking. We apply the approach along the prescription in [Phys. Rev. C {\bf 105}, 044329 (2022)] used to describe $K$-isomers in the actinide and transfermium mass regions. The calculations allow us to identify the regions where proton or neutron configurations or their mixture may be responsible for the $K$-isomer formation. The obtained results provide a detailed test for the Skyrme SIII interaction used and outline the limits of applicability of the overall SHFBCS approach in the regions of well deformed nuclei. The study suggests that similar systematic analysis can be implemented in the heavier mass regions whenever enough data are available., Comment: 10 pages, 4 figures, 2 tables
Published: 2024
Full Text: View/download PDF

44. Superconductivity and spin canting in spin-orbit proximitized rhombohedral trilayer graphene

Author: Patterson, Caitlin L., Sheekey, Owen I., Arp, Trevor B., Holleis, Ludwig F. W., Koh, Jin Ming, Choi, Youngjoon, Xie, Tian, Xu, Siyuan, Redekop, Evgeny, Babikyan, Grigory, Zhou, Haoxin, Cheng, Xiang, Taniguchi, Takashi, Watanabe, Kenji, Jin, Chenhao, Lantagne-Hurtubise, Etienne, Alicea, Jason, and Young, Andrea F.
Subjects: Condensed Matter - Mesoscale and Nanoscale Physics
Abstract: Graphene and transition metal dichalcogenide flat-band systems show similar phase diagrams, replete with magnetic and superconducting phases. An abiding question has been whether magnetic ordering competes with superconductivity or facilitates pairing. The advent of crystalline graphene superconductors enables a new generation of controlled experiments to probe the microscopic origin of superconductivity. For example, recent studies of Bernal bilayer graphene show a dramatic increase in the observed domain and critical temperature $T_c$ of superconducting states in the presence of enhanced spin-orbit coupling; the mechanism for this enhancement, however, remains unclear. Here, we show that introducing spin-orbit coupling in rhombohedral trilayer graphene (RTG) via substrate proximity effect generates new superconducting pockets for both electron and hole doping, with maximal $T_c\approx$ 300mK three times larger than in RTG encapsulated by hexagonal boron nitride alone. Using local magnetometry and thermodynamic compressibility measurements, we show that superconductivity straddles an apparently continuous transition between a spin-canted state with a finite in-plane magnetic moment and a state with complete spin-valley locking. This transition is reproduced in our Hartree-Fock calculations, where it is driven by the competition between spin-orbit coupling and the carrier-density-tuned Hund's interaction. Our experiment suggests that the enhancement of superconductivity by spin-orbit coupling is driven not by a change in the ground state symmetry or degeneracy but rather by a quantitative change in the canting angle. These results align with a recently proposed mechanism for the enhancement of superconductivity in spin-orbit coupled rhombohedral multilayers, in which fluctuations in the spin-canting order contribute to the pairing interaction.
Published: 2024

45. A Probabilistic Framework for Adapting to Changing and Recurring Concepts in Data Streams

Author: Halstead, Ben, Koh, Yun Sing, Riddle, Patricia, Pechenizkiy, Mykola, and Bifet, Albert
Subjects: Computer Science - Machine Learning
Abstract: The distribution of streaming data often changes over time as conditions change, a phenomenon known as concept drift. Only a subset of previous experience, collected in similar conditions, is relevant to learning an accurate classifier for current data. Learning from irrelevant experience describing a different concept can degrade performance. A system learning from streaming data must identify which recent experience is irrelevant when conditions change and which past experience is relevant when concepts reoccur, \textit{e.g.,} when weather events or financial patterns repeat. Existing streaming approaches either do not consider experience to change in relevance over time and thus cannot handle concept drift, or only consider the recency of experience and thus cannot handle recurring concepts, or only sparsely evaluate relevance and thus fail when concept drift is missed. To enable learning in changing conditions, we propose SELeCT, a probabilistic method for continuously evaluating the relevance of past experience. SELeCT maintains a distinct internal state for each concept, representing relevant experience with a unique classifier. We propose a Bayesian algorithm for estimating state relevance, combining the likelihood of drawing recent observations from a given state with a transition pattern prior based on the system's current state.
Published: 2024
Full Text: View/download PDF

46. JPEG-LM: LLMs as Image Generators with Canonical Codec Representations

Author: Han, Xiaochuang, Ghazvininejad, Marjan, Koh, Pang Wei, and Tsvetkov, Yulia
Subjects: Computer Science - Computation and Language, Computer Science - Computer Vision and Pattern Recognition, Computer Science - Machine Learning
Abstract: Recent work in image and video generation has been adopting the autoregressive LLM architecture due to its generality and potentially easy integration into multi-modal systems. The crux of applying autoregressive training in language generation to visual generation is discretization -- representing continuous data like images and videos as discrete tokens. Common methods of discretizing images and videos include modeling raw pixel values, which are prohibitively lengthy, or vector quantization, which requires convoluted pre-hoc training. In this work, we propose to directly model images and videos as compressed files saved on computers via canonical codecs (e.g., JPEG, AVC/H.264). Using the default Llama architecture without any vision-specific modifications, we pretrain JPEG-LM from scratch to generate images (and AVC-LM to generate videos as a proof of concept), by directly outputting compressed file bytes in JPEG and AVC formats. Evaluation of image generation shows that this simple and straightforward approach is more effective than pixel-based modeling and sophisticated vector quantization baselines (on which our method yields a 31% reduction in FID). Our analysis shows that JPEG-LM has an especial advantage over vector quantization models in generating long-tail visual elements. Overall, we show that using canonical codec representations can help lower the barriers between language generation and visual generation, facilitating future research on multi-modal language/image/video LLMs.
Published: 2024

47. Attainability of quantum state discrimination bounds with collective measurements on finite copies

Author: Conlon, Lorcan, Koh, Jin Ming, Shajilal, Biveen, Sidhu, Jasminder, Lam, Ping Koy, and Assad, Syed M.
Subjects: Quantum Physics
Abstract: One of the fundamental tenets of quantum mechanics is that non-orthogonal states cannot be distinguished perfectly. When distinguishing multiple copies of a mixed quantum state, a collective measurement, which generates entanglement between the different copies of the unknown state, can achieve a lower error probability than non-entangling measurements. The error probability that can be attained using a collective measurement on a finite number of copies of the unknown state is given by the Helstrom bound. In the limit where we can perform a collective measurement on asymptotically many copies of the quantum state, the quantum Chernoff bound gives the attainable error probability. It is natural to ask at what rate does the error tend to this asymptotic limit, and whether the asymptotic limit can be attained for any finite number of copies. In this paper we address these questions. We find analytic expressions for the Helstrom bound for arbitrarily many copies of the unknown state in several simple qubit examples. Using these analytic expressions, we investigate how the attainable error rate changes as we allow collective measurements on finite numbers of copies of the quantum state. We also investigate the necessary conditions to saturate the M-copy Helstrom bound. It is known that a collective measurement on all M-copies of the unknown state is always sufficient to saturate the M-copy Helstrom bound. However, general conditions for when such a measurement is necessary to saturate the Helstrom bound remain unknown. We investigate specific measurement strategies which involve entangling operations on fewer than all M-copies of the unknown state. For many regimes we find that a collective measurement on all M-copies of the unknown state is necessary to saturate the M-copy Helstrom bound., Comment: Comments very welcome
Published: 2024

48. WalledEval: A Comprehensive Safety Evaluation Toolkit for Large Language Models

Author: Gupta, Prannaya, Yau, Le Qi, Low, Hao Han, Lee, I-Shiang, Lim, Hugo Maximus, Teoh, Yu Xin, Koh, Jia Hng, Liew, Dar Win, Bhardwaj, Rishabh, Bhardwaj, Rajat, and Poria, Soujanya
Subjects: Computer Science - Computation and Language, Computer Science - Artificial Intelligence
Abstract: WalledEval is a comprehensive AI safety testing toolkit designed to evaluate large language models (LLMs). It accommodates a diverse range of models, including both open-weight and API-based ones, and features over 35 safety benchmarks covering areas such as multilingual safety, exaggerated safety, and prompt injections. The framework supports both LLM and judge benchmarking and incorporates custom mutators to test safety against various text-style mutations, such as future tense and paraphrasing. Additionally, WalledEval introduces WalledGuard, a new, small, and performant content moderation tool, and two datasets: SGXSTest and HIXSTest, which serve as benchmarks for assessing the exaggerated safety of LLMs and judges in cultural contexts. We make WalledEval publicly available at https://github.com/walledai/walledeval., Comment: Under review
Published: 2024

49. First Measurement of the Total Inelastic Cross-Section of Positively-Charged Kaons on Argon at Energies Between 5.0 and 7.5 GeV

Author: DUNE Collaboration, Abud, A. Abed, Abi, B., Acciarri, R., Acero, M. A., Adames, M. R., Adamov, G., Adamowski, M., Adams, D., Adinolfi, M., Adriano, C., Aduszkiewicz, A., Aguilar, J., Akbar, F., Allison, K., Monsalve, S. Alonso, Alrashed, M., Alton, A., Alvarez, R., Alves, T., Amar, H., Amedo, P., Anderson, J., Andreopoulos, C., Andreotti, M., Andrews, M. P., Andrianala, F., Andringa, S., Anfimov, N., Ankowski, A., Antic, D., Antoniassi, M., Antonova, M., Antoshkin, A., Aranda-Fernandez, A., Arellano, L., Diaz, E. Arrieta, Arroyave, M. A., Asaadi, J., Ashkenazi, A., Asner, D., Asquith, L., Atkin, E., Auguste, D., Aurisano, A., Aushev, V., Autiero, D., Azam, M. B., Azfar, F., Back, A., Back, H., Back, J. J., Bagaturia, I., Bagby, L., Balashov, N., Balasubramanian, S., Baldi, P., Baldini, W., Baldonedo, J., Baller, B., Bambah, B., Banerjee, R., Barao, F., Barbu, D., Barenboim, G., Barham~Alzás, P., Barker, G. J., Barkhouse, W., Barr, G., Monarca, J. Barranco, Barros, A., Barros, N., Barrow, D., Barrow, J. L., Basharina-Freshville, A., Bashyal, A., Basque, V., Batchelor, C., Bathe-Peters, L., Battat, J. B. R., Battisti, F., Bay, F., Bazetto, M. C. Q., Alba, J. L. L. Bazo, Beacom, J. F., Bechetoille, E., Behera, B., Belchior, E., Bell, G., Bellantoni, L., Bellettini, G., Bellini, V., Beltramello, O., Benekos, N., Montiel, C. Benitez, Benjamin, D., Neves, F. Bento, Berger, J., Berkman, S., Bernal, J., Bernardini, P., Bersani, A., Bertolucci, S., Betancourt, M., Rodríguez, A. Betancur, Bevan, A., Bezawada, Y., Bezerra, A. T., Bezerra, T. J., Bhat, A., Bhatnagar, V., Bhatt, J., Bhattacharjee, M., Bhattacharya, M., Bhuller, S., Bhuyan, B., Biagi, S., Bian, J., Biery, K., Bilki, B., Bishai, M., Bitadze, A., Blake, A., Blaszczyk, F. D., Blazey, G. C., Blucher, E., Bodek, A., Bogenschuetz, J., Boissevain, J., Bolognesi, S., Bolton, T., Bomben, L., Bonesini, M., Bonilla-Diaz, C., Bonini, F., Booth, A., Boran, F., Bordoni, S., Merlo, R. Borges, Borkum, A., Bostan, N., Bouet, R., Boza, J., Bracinik, J., Brahma, B., Brailsford, D., Bramati, F., Branca, A., Brandt, A., Bremer, J., Brew, C., Brice, S. J., Brio, V., Brizzolari, C., Bromberg, C., Brooke, J., Bross, A., Brunetti, G., Brunetti, M., Buchanan, N., Budd, H., Buergi, J., Bundock, A., Burgardt, D., Butchart, S., V., G. Caceres, Cagnoli, I., Cai, T., Calabrese, R., Calcutt, J., Calivers, L., Calvo, E., Caminata, A., Camino, A. F., Campanelli, W., Campani, A., Benitez, A. Campos, Canci, N., Capó, J., Caracas, I., Caratelli, D., Carber, D., Carceller, J. M., Carini, G., Carlus, B., Carneiro, M. F., Carniti, P., Terrazas, I. Caro, Carranza, H., Carrara, N., Carroll, L., Carroll, T., Carter, A., Casarejos, E., Casazza, D., Forero, J. F. Castaño, Castaño, F. A., Castillo, A., Castromonte, C., Catano-Mur, E., Cattadori, C., Cavalier, F., Cavanna, F., Centro, S., Cerati, G., Cerna, C., Cervelli, A., Villanueva, A. Cervera, Chakraborty, K., Chakraborty, S., Chalifour, M., Chappell, A., Charitonidis, N., Chatterjee, A., Chen, H., Chen, M., Chen, W. C., Chen, Y., Chen-Wishart, Z., Cherdack, D., Chi, C., Chiapponi, F., Chirco, R., Chitirasreemadam, N., Cho, K., Choate, S., Chokheli, D., Chong, P. S., Chowdhury, B., Christian, D., Chukanov, A., Chung, M., Church, E., Cicala, M. F., Cicerchia, M., Cicero, V., Ciolini, R., Clarke, P., Cline, G., Coan, T. E., Cocco, A. G., Coelho, J. A. B., Cohen, A., Collazo, J., Collot, J., Conley, E., Conrad, J. M., Convery, M., Copello, S., Cova, P., Cox, C., Cremaldi, L., Cremonesi, L., Crespo-Anadón, J. I., Crisler, M., Cristaldo, E., Crnkovic, J., Crone, G., Cross, R., Cudd, A., Cuesta, C., Cui, Y., Curciarello, F., Cussans, D., Dai, J., Dalager, O., Dallavalle, R., Dallaway, W., D'Amico, R., da Motta, H., Dar, Z. A., Darby, R., Peres, L. Da Silva, David, Q., Davies, G. S., Davini, S., Dawson, J., De Aguiar, R., De Almeida, P., Debbins, P., De Bonis, I., Decowski, M. P., de Gouvêa, A., De Holanda, P. C., Astiz, I. L. De Icaza, De Jong, P., Sanchez, P. Del Amo, De la Torre, A., De Lauretis, G., Delbart, A., Delepine, D., Delgado, M., Dell'Acqua, A., Monache, G. Delle, Delmonte, N., De Lurgio, P., Demario, R., De Matteis, G., Neto, J. R. T. de Mello, DeMuth, D. M., Dennis, S., Densham, C., Denton, P., Deptuch, G. W., De Roeck, A., De Romeri, V., Detje, J. P., Devine, J., Dharmapalan, R., Dias, M., Diaz, A., Díaz, J. S., Díaz, F., Di Capua, F., Di Domenico, A., Di Domizio, S., Di Falco, S., Di Giulio, L., Ding, P., Di Noto, L., Diociaiuti, E., Distefano, C., Diurba, R., Diwan, M., Djurcic, Z., Doering, D., Dolan, S., Dolek, F., Dolinski, M. J., Domenici, D., Domine, L., Donati, S., Donon, Y., Doran, S., Douglas, D., Doyle, T. A., Dragone, A., Drielsma, F., Duarte, L., Duchesneau, D., Duffy, K., Dugas, K., Dunne, P., Dutta, B., Duyang, H., Dwyer, D. A., Dyshkant, A. S., Dytman, S., Eads, M., Earle, A., Edayath, S., Edmunds, D., Eisch, J., Englezos, P., Ereditato, A., Erjavec, T., Escobar, C. O., Evans, J. J., Ewart, E., Ezeribe, A. C., Fahey, K., Fajt, L., Falcone, A., Fani', M., Farnese, C., Farrell, S., Farzan, Y., Fedoseev, D., Felix, J., Feng, Y., Fernandez-Martinez, E., Ferry, G., Fialova, E., Fields, L., Filip, P., Filkins, A., Filthaut, F., Fine, R., Fiorillo, G., Fiorini, M., Fogarty, S., Foreman, W., Fowler, J., Franc, J., Francis, K., Franco, D., Franklin, J., Freeman, J., Fried, J., Friedland, A., Fuess, S., Furic, I. K., Furman, K., Furmanski, A. P., Gaba, R., Gabrielli, A., M~Gago, A., Galizzi, F., Gallagher, H., Gallice, N., Galymov, V., Gamberini, E., Gamble, T., Ganacim, F., Gandhi, R., Ganguly, S., Gao, F., Gao, S., Garcia-Gamez, D., García-Peris, M. Á., Gardim, F., Gardiner, S., Gastler, D., Gauch, A., Gauvreau, J., Gauzzi, P., Gazzana, S., Ge, G., Geffroy, N., Gelli, B., Gent, S., Gerlach, L., Ghorbani-Moghaddam, Z., Giammaria, T., Gibin, D., Gil-Botella, I., Gilligan, S., Gioiosa, A., Giovannella, S., Girerd, C., Giri, A. K., Giugliano, C., Giusti, V., Gnani, D., Gogota, O., Gollapinni, S., Gollwitzer, K., Gomes, R. A., Bermeo, L. V. Gomez, Fajardo, L. S. Gomez, Gonnella, F., Gonzalez-Diaz, D., Gonzalez-Lopez, M., Goodman, M. C., Goswami, S., Gotti, C., Goudeau, J., Goudzovski, E., Grace, C., Gramellini, E., Gran, R., Granados, E., Granger, P., Grant, C., Gratieri, D. R., Grauso, G., Green, P., Greenberg, S., Greer, J., Griffith, W. C., Groetschla, F. T., Grzelak, K., Gu, L., Gu, W., Guarino, V., Guarise, M., Guenette, R., Guerzoni, M., Guffanti, D., Guglielmi, A., Guo, B., Guo, F. Y., Gupta, A., Gupta, V., Gurung, G., Gutierrez, D., Guzowski, P., Guzzo, M. M., Gwon, S., Habig, A., Hadavand, H., Haegel, L., Haenni, R., Hagaman, L., Hahn, A., Haiston, J., Hakenmüller, J., Hamernik, T., Hamilton, P., Hancock, J., Happacher, F., Harris, D. A., Hartnell, J., Hartnett, T., Harton, J., Hasegawa, T., Hasnip, C. M., Hatcher, R., Hayrapetyan, K., Hays, J., Hazen, E., He, M., Heavey, A., Heeger, K. M., Heise, J., Hellmuth, P., Henry, S., Herner, K., Hewes, V., Higuera, A., Hilgenberg, C., Hillier, S. J., Himmel, A., Hinkle, E., Hirsch, L. R., Ho, J., Hoff, J., Holin, A., Holvey, T., Hoppe, E., Horiuchi, S., Horton-Smith, G. A., Houdy, T., Howard, B., Howell, R., Hristova, I., Hronek, M. S., Huang, J., Huang, R. G., Hulcher, Z., Ibrahim, M., Iles, G., Ilic, N., Iliescu, A. M., Illingworth, R., Ingratta, G., Ioannisian, A., Irwin, B., Isenhower, L., Oliveira, M. Ismerio, Itay, R., Jackson, C. M., Jain, V., James, E., Jang, W., Jargowsky, B., Jena, D., Jentz, I., Ji, X., Jiang, C., Jiang, J., Jiang, L., Jipa, A., Jo, J. H., Joaquim, F. R., Johnson, W., Jollet, C., Jones, B., Jones, R., Jovancevic, N., Judah, M., Jung, C. K., Junk, T., Jwa, Y., Kabirnezhad, M., Kaboth, A. C., Kadenko, I., Kakorin, I., Kalitkina, A., Kalra, D., Kandemir, M., Kaplan, D. M., Karagiorgi, G., Karaman, G., Karcher, A., Karyotakis, Y., Kasai, S., Kasetti, S. P., Kashur, L., Katsioulas, I., Kauther, A., Kazaryan, N., Ke, L., Kearns, E., Keener, P. T., Kelly, K. J., Kemp, E., Kemularia, O., Kermaidic, Y., Ketchum, W., Kettell, S. H., Khabibullin, M., Khan, N., Khvedelidze, A., Kim, D., Kim, J., Kim, M. J., King, B., Kirby, B., Kirby, M., Kish, A., Klein, J., Kleykamp, J., Klustova, A., Kobilarcik, T., Koch, L., Koehler, K., Koerner, L. W., Koh, D. H., Kolupaeva, L., Korablev, D., Kordosky, M., Kosc, T., Kose, U., Kostelecký, V. A., Kothekar, K., Kotler, I., Kovalcuk, M., Kozhukalov, V., Krah, W., Kralik, R., Kramer, M., Kreczko, L., Krennrich, F., Kreslo, I., Kroupova, T., Kubota, S., Kubu, M., Kudenko, Y., Kudryavtsev, V. A., Kufatty, G., Kuhlmann, S., Kulagin, S., Kumar, J., Kumar, P., Kumaran, S., Kunzmann, J., Kuravi, R., Kurita, N., Kuruppu, C., Kus, V., Kutter, T., Kvasnicka, J., Labree, T., Lackey, T., Lal{ă}u, I., Lambert, A., Land, B. J., Lane, C. E., Lane, N., Lang, K., Langford, T., Langstaff, M., Lanni, F., Lantwin, O., Larkin, J., Lasorak, P., Last, D., Laudrain, A., Laundrie, A., Laurenti, G., Lavaut, E., Laycock, P., Lazanu, I., LaZur, R., Lazzaroni, M., Le, T., Leardini, S., Learned, J., LeCompte, T., Legin, V., Miotto, G. Lehmann, Lehnert, R., de Oliveira, M. A. Leigui, Leitner, M., Silverio, D. Leon, Lepin, L. M., -Y~Li, J., Li, S. W., Li, Y., Liao, H., Lin, C. S., Lindebaum, D., Linden, S., Lineros, R. A., Lister, A., Littlejohn, B. R., Liu, H., Liu, J., Liu, Y., Lockwitz, S., Lokajicek, M., Lomidze, I., Long, K., Lopes, T. V., Lopez, J., de Rego, I. López, López-March, N., Lord, T., LoSecco, J. M., Louis, W. C., Sanchez, A. Lozano, Lu, X. -G., Luk, K. B., Lunday, B., Luo, X., Luppi, E., MacFarlane, D., Machado, A. A., Machado, P., Macias, C. T., Macier, J. R., MacMahon, M., Maddalena, A., Madera, A., Madigan, P., Magill, S., Magueur, C., Mahn, K., Maio, A., Major, A., Majumdar, K., Mameli, S., Man, M., Mandujano, R. C., Maneira, J., Manly, S., Mann, A., Manolopoulos, K., Plata, M. Manrique, Corchado, S. Manthey, Manyam, V. N., Marchan, M., Marchionni, A., Marciano, W., Marfatia, D., Mariani, C., Maricic, J., Marinho, F., Marino, A. D., Markiewicz, T., Marques, F. Das Chagas, Marquet, C., Marshak, M., Marshall, C. M., Marshall, J., Martina, L., Martín-Albo, J., Martinez, N., Caicedo, D. A. Martinez, López, F. Martínez, Miravé, P. Martínez, Martynenko, S., Mascagna, V., Massari, C., Mastbaum, A., Matichard, F., Matsuno, S., Matteucci, G., Matthews, J., Mauger, C., Mauri, N., Mavrokoridis, K., Mawby, I., Mazza, R., McAskill, T., McConkey, N., McFarland, K. S., McGrew, C., McNab, A., Meazza, L., Meddage, V. C. N., Mefodiev, A., Mehta, B., Mehta, P., Melas, P., Mena, O., Mendez, H., Mendez, P., Méndez, D. P., Menegolli, A., Meng, G., Mercuri, A. C. E. A., Meregaglia, A., Messier, M. D., Metallo, S., Metcalf, W., Mewes, M., Meyer, H., Miao, T., Micallef, J., Miccoli, A., Michna, G., Milincic, R., Miller, F., Miller, G., Miller, W., Mineev, O., Minotti, A., Miralles, L., Miranda, O. G., Mironov, C., Miryala, S., Miscetti, S., Mishra, C. S., Mishra, P., Mishra, S. R., Mislivec, A., Mitchell, M., Mladenov, D., Mocioiu, I., Mogan, A., Moggi, N., Mohanta, R., Mohayai, T. A., Mokhov, N., Molina, J., Bueno, L. Molina, Montagna, E., Montanari, A., Montanari, C., Montanari, D., Montanino, D., Zetina, L. M. Montaño, Mooney, M., Moor, A. F., Moore, Z., Moreno, D., Moreno-Palacios, O., Morescalchi, L., Moretti, D., Moretti, R., Morris, C., Mossey, C., Moura, C. A., Mouster, G., Mu, W., Mualem, L., Mueller, J., Muether, M., Muheim, F., Muir, A., Mulhearn, M., Munford, D., Munteanu, L. J., Muramatsu, H., Muraz, J., Murphy, M., Murphy, T., Muse, J., Mytilinaki, A., Nachtman, J., Nagai, Y., Nagu, S., Nandakumar, R., Naples, D., Narita, S., Navrer-Agasson, A., Nayak, N., Nebot-Guinot, M., Nehm, A., Nelson, J. K., Neogi, O., Nesbit, J., Nessi, M., Newbold, D., Newcomer, M., Nichol, R., Nicolas-Arnaldos, F., Nikolica, A., Nikolov, J., Niner, E., Nishimura, K., Norman, A., Norrick, A., Novella, P., Nowak, A., Nowak, J. A., Oberling, M., Ochoa-Ricoux, J. P., Oh, S., Oh, S. B., Olivier, A., Olshevskiy, A., Olson, T., Onel, Y., Onishchuk, Y., Oranday, A., Osbiston, M., Vélez, J. A. Osorio, O'Sullivan, L., Ormachea, L. Otiniano, Ott, J., Pagani, L., Palacio, G., Palamara, O., Palestini, S., Paley, J. M., Pallavicini, M., Palomares, C., Pan, S., Panda, P., Vazquez, W. Panduro, Pantic, E., Paolone, V., Papaleo, R., Papanestis, A., Papoulias, D., Paramesvaran, S., Paris, A., Parke, S., Parozzi, E., Parsa, S., Parsa, Z., Parveen, S., Parvu, M., Pasciuto, D., Pascoli, S., Pasqualini, L., Pasternak, J., Patrick, C., Patrizii, L., Patterson, R. B., Patzak, T., Paudel, A., Paulucci, L., Pavlovic, Z., Pawloski, G., Payne, D., Pec, V., Pedreschi, E., Peeters, S. J. M., Pellico, W., Perez, A. Pena, Pennacchio, E., Penzo, A., Peres, O. L. G., Gonzalez, Y. F. Perez, Pérez-Molina, L., Pernas, C., Perry, J., Pershey, D., Pessina, G., Petrillo, G., Petta, C., Petti, R., Pfaff, M., Pia, V., Pickering, L., Pietropaolo, F., Pimentel, V. L., Pinaroli, G., Pincha, S., Pinchault, J., Pitts, K., Plows, K., Pollack, C., Pollman, T., Pompa, F., Pons, X., Poonthottathil, N., Popov, V., Poppi, F., Porter, J., Paix{ã}o, L. G. Porto, Potekhin, M., Potenza, R., Pozimski, J., Pozzato, M., Prakash, T., Pratt, C., Prest, M., Psihas, F., Pugnere, D., Qian, X., Queen, J., Raaf, J. L., Radeka, V., Rademacker, J., Radics, B., Raffaelli, F., Rafique, A., Raguzin, E., Rai, M., Rajagopalan, S., Rajaoalisoa, M., Rakhno, I., Rakotondravohitra, L., Ralte, L., Delgado, M. A. Ramirez, Ramson, B., Rappoldi, A., Raselli, G., Ratoff, P., Ray, R., Razafinime, H., Rea, E. M., Real, J. S., Rebel, B., Rechenmacher, R., Reichenbacher, J., Reitzner, S. D., Sfar, H. Rejeb, Renner, E., Renshaw, A., Rescia, S., Resnati, F., Diego~Restrepo, Reynolds, C., Ribas, M., Riboldi, S., Riccio, C., Riccobene, G., Ricol, J. S., Rigan, M., Rincón, E. V., Ritchie-Yates, A., Ritter, S., Rivera, D., Rivera, R., Robert, A., Rocha, J. L. Rocabado, Rochester, L., Roda, M., Rodrigues, P., Alonso, M. J. Rodriguez, Rondon, J. Rodriguez, Rosauro-Alcaraz, S., Rosier, P., Ross, D., Rossella, M., Rossi, M., Ross-Lonergan, M., Roy, N., Roy, P., Rubbia, C., Ruggeri, A., Ferreira, G. Ruiz, Russell, B., Ruterbories, D., Rybnikov, A., Sacerdoti, S., Saha, S., Sahoo, S. K., Sahu, N., Sala, P., Samios, N., Samoylov, O., Sanchez, M. C., Bravo, A. Sánchez, Sánchez-Castillo, A., Sanchez-Lucas, P., Sandberg, V., Sanders, D. A., Sanfilippo, S., Sankey, D., Santoro, D., Saoulidou, N., Sapienza, P., Sarasty, C., Sarcevic, I., Sarra, I., Savage, G., Savinov, V., Scanavini, G., Scaramelli, A., Scarff, A., Schefke, T., Schellman, H., Schifano, S., Schlabach, P., Schmitz, D., Schneider, A. W., Scholberg, K., Schukraft, A., Schuld, B., Segade, A., Segreto, E., Selyunin, A., Senadheera, D., Senise, C. R., Sensenig, J., Shaevitz, M. H., Shanahan, P., Sharma, P., Kumar, R., Poudel, S. Sharma, Shaw, K., Shaw, T., Shchablo, K., Shen, J., Shepherd-Themistocleous, C., Sheshukov, A., Shi, J., Shi, W., Shin, S., Shivakoti, S., Shoemaker, I., Shooltz, D., Shrock, R., Siddi, B., Siden, M., Silber, J., Simard, L., Sinclair, J., Sinev, G., Singh, Jaydip, Singh, J., Singh, L., Singh, P., Singh, V., Chauhan, S. Singh, Sipos, R., Sironneau, C., Sirri, G., Siyeon, K., Skarpaas, K., Smedley, J., Smith, E., Smith, J., Smith, P., Smolik, J., Smy, M., Snape, M., Snider, E. L., Snopok, P., Snowden-Ifft, D., Nunes, M. Soares, Sobel, H., Soderberg, M., Sokolov, S., Salinas, C. J. Solano, Söldner-Rembold, S., Solomey, N., Solovov, V., Sondheim, W. E., Sorel, M., Sotnikov, A., Soto-Oton, J., Sousa, A., Soustruznik, K., Spinella, F., Spitz, J., Spooner, N. J. C., Spurgeon, K., Stalder, D., Stancari, M., Stanco, L., Steenis, J., Stein, R., Steiner, H. M., Lisbôa, A. F. Steklain, Stepanova, A., Stewart, J., Stillwell, B., Stock, J., Stocker, F., Stokes, T., Strait, M., Strauss, T., Strigari, L., Stuart, A., Suarez, J. G., Subash, J., Surdo, A., Suter, L., Sutera, C. M., Sutton, K., Suvorov, Y., Svoboda, R., Swain, S. K., Szczerbinska, B., Szelc, A. M., Sztuc, A., Taffara, A., Talukdar, N., Tamara, J., Tanaka, H. A., Tang, S., Taniuchi, N., Casanova, A. M. Tapia, Oregui, B. Tapia, Tapper, A., Tariq, S., Tarpara, E., Tatar, E., Tayloe, R., Tedeschi, D., Teklu, A. M., Vidal, J. Tena, Tennessen, P., Tenti, M., Terao, K., Terranova, F., Testera, G., Thakore, T., Thea, A., Thomas, S., Thompson, A., Thorn, C., Timm, S. C., Tiras, E., Tishchenko, V., Todorović, N., Tomassetti, L., Tonazzo, A., Torbunov, D., Torti, M., Tortola, M., Tortorici, F., Tosi, N., Totani, D., Toups, M., Touramanis, C., Tran, D., Travaglini, R., Trevor, J., Triller, E., Trilov, S., Truchon, J., Truncali, D., Trzaska, W. H., Tsai, Y., Tsai, Y. -T., Tsamalaidze, Z., Tsang, K. V., Tsverava, N., Tu, S. Z., Tufanli, S., Tunnell, C., Turnberg, S., Turner, J., Tuzi, M., Tyler, J., Tyley, E., Tzanov, M., Uchida, M. A., González, J. Ureña, Urheim, J., Usher, T., Utaegbulam, H., Uzunyan, S., Vagins, M. R., Vahle, P., Valder, S., Valdiviesso, G. A., Valencia, E., Valentim, R., Vallari, Z., Vallazza, E., Valle, J. W. F., Van Berg, R., Van de Water, R. G., Forero, D. V., Vannozzi, A., Van Nuland-Troost, M., Varanini, F., Oliva, D. Vargas, Vasina, S., Vaughan, N., Vaziri, K., Vázquez-Ramos, A., Vega, J., Ventura, S., Verdugo, A., Vergani, S., Verzocchi, M., Vetter, K., Vicenzi, M., de Souza, H. Vieira, Vignoli, C., Vilela, C., Villa, E., Viola, S., Viren, B., Hernandez, A. P. Vizcaya, Vuong, Q., Waldron, A. V., Wallbank, M., Walsh, J., Walton, T., Wang, H., Wang, J., Wang, L., Wang, M. H. L. S., Wang, X., Wang, Y., Warburton, K., Warner, D., Warsame, L., Wascko, M. O., Waters, D., Watson, A., Wawrowska, K., Weber, A., Weber, C. M., Weber, M., Wei, H., Weinstein, A., Westerdale, S., Wetstein, M., Whalen, K., White, A., Whitehead, L. H., Whittington, D., Wilhlemi, J., Wilking, M. J., Wilkinson, A., Wilkinson, C., Wilson, F., Wilson, R. J., Winter, P., Wisniewski, W., Wolcott, J., Wolfs, J., Wongjirad, T., Wood, A., Wood, K., Worcester, E., Worcester, M., Wospakrik, M., Wresilo, K., Wret, C., Wu, S., Wu, W., Wurm, M., Wyenberg, J., Xiao, Y., Xiotidis, I., Yaeggy, B., Yahlali, N., Yandel, E., Yang, J., Yang, K., Yang, T., Yankelevich, A., Yershov, N., Yonehara, K., Young, T., Yu, B., Yu, H., Yu, J., Yu, Y., Yuan, W., Zaki, R., Zalesak, J., Zambelli, L., Zamorano, B., Zani, A., Zapata, O., Zazueta, L., Zeller, G. P., Zennamo, J., Zeug, K., Zhang, C., Zhang, S., Zhao, M., Zhivun, E., Zimmerman, E. D., Zucchelli, S., Zuklin, J., Zutshi, V., and Zwaska, R.
Subjects: High Energy Physics - Experiment, Physics - Instrumentation and Detectors
Abstract: ProtoDUNE Single-Phase (ProtoDUNE-SP) is a 770-ton liquid argon time projection chamber that operated in a hadron test beam at the CERN Neutrino Platform in 2018. We present a measurement of the total inelastic cross section of charged kaons on argon as a function of kaon energy using 6 and 7 GeV/$c$ beam momentum settings. The flux-weighted average of the extracted inelastic cross section at each beam momentum setting was measured to be 380$\pm$26 mbarns for the 6 GeV/$c$ setting and 379$\pm$35 mbarns for the 7 GeV/$c$ setting.
Published: 2024
Full Text: View/download PDF

50. First Direct Search for Light Dark Matter Using the NEON Experiment at a Nuclear Reactor

Author: Choi, J. J., Ha, C., Jeon, E. J., Kim, J. Y., Kim, K. W., Kim, S. H., Kim, S. K., Kim, Y. D., Ko, Y. J., Koh, B. C., Lee, S. H., Lee, I. S., Lee, H., Lee, H. S., Lee, J. S., Oh, Y. M., and Park, B. J.
Subjects: High Energy Physics - Experiment
Abstract: We report new results from the Neutrino Elastic Scattering Observation with NaI (NEON) experiment in the search for light dark matter (LDM) using 2,636 kg$\cdot$days of NaI(Tl) exposure. The experiment employs an array of NaI(Tl) crystals with a total mass of 16.7 kg, located 23.7 meters away from a 2.8 GW thermal power nuclear reactor. We investigated LDM produced by the $\textit{invisible decay}$ of dark photons generated by high-flux photons during reactor operation. The energy spectra collected during reactor-on and reactor-off periods were compared within the LDM signal region of $1-10$ keV. No signal consistent with LDM interaction with electrons was observed, allowing us to set 90% confidence level exclusion limits for the dark matter-electron scattering cross-section ($\sigma_e$) across dark matter masses ranging from 1 keV/c$^2$ to 1 MeV/c$^2$. Our results set a 90% confidence level upper limit of $\sigma_e = 3.17\times10^{-35}~\mathrm{cm^2}$ for a dark matter mass of 100 keV/c$^2$, marking the best laboratory result in this mass range. Additionally, our search extends the coverage of LDM below 100 keV/c$^2$ first time.
Published: 2024

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

Select search scope, currently: Articles Catalog books, media & more in Jio Institute collections Articles journal articles & other e-resources

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Publication Type

Journal

Region

Database

Publisher

106,124 results on '"Koh AS"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources