Search

We investigate the phenomenology of a dark QCD sector interacting with the Standard Model (SM) via the electroweak (EW) portals. The portal interactions allow SM bosons, such as $Z$ and $h$, or additional bosons that mix with them, to decay into dark quarks, producing dark showers. The light dark mesons are expected to be long-lived particles (LLPs), as their decays back to the SM states through the EW-portal interactions typically have macroscopic decay lengths. We focus on dark shower events initiated by various bosons at the Large Hadron Collider (LHC). The most prominent signal is the displaced decay of GeV-scale dark pions as LLPs. Current limits on dark shower signals at LHC detectors are recast from public data in a model-independent manner. Future limits in the high-luminosity phase and proposed auxiliary detectors are also projected. Additionally, we study the flavor-changing neutral current (FCNC) $B$ decays into dark pions, obtaining both current and projected constraints at the LHC and other facilities. These constraints can be combined for specific models, which are illustrated in two EW-portal benchmarks: one with the heavy doublet fermion mediation and another with the $Z^\prime$ mediator including a mass mixing. The collider reach shows significant potential to probe the parameter space unconstrained by EW precision tests, highlighting the necessity of dedicated LLP search strategies and facilities., Comment: 40 pages, 25 figures

We discuss dark shower signals at the LHC from a dark QCD sector, containing GeV-scale dark pions. The portal with the Standard Model is given by the mixing of the Z boson with a dark Z' coupled to the dark quarks. Both mass and kinetic mixings are included, but the mass mixing is the essential ingredient, as it is the one mediating visible decays of the long-lived dark pions. We focus especially on the possibility that the dark Z' is lighter than the Z. Indirect constraints are dominated by electroweak precision tests, which we thoroughly discuss, showing that both Z-pole and low-energy observables are important. We then recast CMS and LHCb searches for displaced dimuon resonances to dark shower signals initiated by the production of on-shell Z or Z', where the visible signature is left by a dark pion decaying to $\mu^+ \mu^-$. We demonstrate how dark shower topologies have already tested new parameter space in Run 2, reaching better sensitivity on a light dark Z' compared to the flavor-changing decays of B mesons, which can produce a single dark pion at a time, and the electroweak precision tests., Comment: 25 pages + appendices and references, 7 figures; v2: added one sentence and one reference on EWPT, matches published version

As one of the hypothetical principles in the Standard Model (SM), lepton flavor universality (LFU) should be tested with a precision as high as possible such that the physics violating this principle can be fully examined. The run of $Z$ factory at a future $e^+e^-$ collider such as CEPC or FCC-$ee$ provides a great opportunity to perform this task because of the large statistics and high reconstruction efficiencies for $b$-hadrons at $Z$ pole. In this paper, we present a systematic study on the LFU test in the future $Z$ factories. The goal is three-fold. Firstly, we study the sensitivities of measuring the LFU-violating observables of $b\to c \tau \nu$, $i.e.$, $R_{J/\psi}$, $R_{D_s}$, $R_{D_s^\ast}$ and $R_{\Lambda_c}$, where $\tau$ decays muonically. For this purpose, we develop the strategies for event reconstruction, based on the track information significantly. Secondly, we explore the sensitivity robustness against detector performance and its potential improvement with the message of event shape or beyond the $b$-hadron decays. A picture is drawn on the variation of analysis sensitivities with the detector tracking resolution and soft photon detectability, and the impact of Fox-Wolfram moments is studied on the measurement of relevant flavor events. Finally, we interpret the projected sensitivities in the SM effective field theory, by combining the LFU tests of $b\to c \tau \nu$ and the measurements of $b\to s \tau^+\tau^-$ and $b\to s \bar{\nu} \nu$. We show that the limits on the LFU-violating energy scale can be pushed up to $\sim \mathcal{O} (10)$~TeV for $\lesssim \mathcal O(1)$ Wilson coefficients at Tera-$Z$., Comment: 63 pages, 27 figures

In 1969, Graham developed a well-known response time bound for a DAG task using the total workload and the longest path of the DAG, which has been widely applied to solve many scheduling and analysis problems of DAG-based task systems. This paper presents a new response time bound for a DAG task using the total workload and the lengths of multiple long paths of the DAG, instead of the longest path in Graham's bound. Our new bound theoretically dominates and empirically outperforms Graham's bound. We further extend the proposed approach to multi-DAG task systems. Our schedulability test theoretically dominates federated scheduling and outperforms the state-of-the-art by a considerable margin.

Understanding the wheel-terrain interaction is of great importance to improve the maneuverability and traversability of the rovers. A well-developed sensing device carried by the rover would greatly facilitate the complex risk-reducing operations on sandy terrains. In this paper, an instrumented wheel-on-limb (WOL) system of planetary rovers for wheel-terrain interaction characterization is presented. Assuming the function of a passive suspension of the wheel, the WOL system allows itself to follow the terrain contour, and keep the wheel remain lowered onto the ground during rover motion including climbing and descending, as well as deploy and place the wheel on the ground before a drive commanding. The system concept, functional requirements, and pre-design work, as well as the system integration are presented., Comment: 2nd International Conference on Robotics and Control Engineering, ACM RobCE 2022, March 25, 2022, Nanjing, China

Making language models bigger does not inherently make them better at following a user's intent. For example, large language models can generate outputs that are untruthful, toxic, or simply not helpful to the user. In other words, these models are not aligned with their users. In this paper, we show an avenue for aligning language models with user intent on a wide range of tasks by fine-tuning with human feedback. Starting with a set of labeler-written prompts and prompts submitted through the OpenAI API, we collect a dataset of labeler demonstrations of the desired model behavior, which we use to fine-tune GPT-3 using supervised learning. We then collect a dataset of rankings of model outputs, which we use to further fine-tune this supervised model using reinforcement learning from human feedback. We call the resulting models InstructGPT. In human evaluations on our prompt distribution, outputs from the 1.3B parameter InstructGPT model are preferred to outputs from the 175B GPT-3, despite having 100x fewer parameters. Moreover, InstructGPT models show improvements in truthfulness and reductions in toxic output generation while having minimal performance regressions on public NLP datasets. Even though InstructGPT still makes simple mistakes, our results show that fine-tuning with human feedback is a promising direction for aligning language models with human intent.

Novelty detection is a task of machine learning that aims at detecting novel events without a prior knowledge. In particular, its techniques can be applied to detect unexpected signals from new phenomena at colliders. In this paper, we develop an analysis scheme that exploits the complementarity, originally studied in Ref.~\cite{Hajer:2018kqm}, between isolation-based and clustering-based novelty evaluators. This approach can significantly improve the performance and overall applicability of novelty detection at colliders, which we demonstrate using a variety of two dimensional Gaussian samples mimicking collider events. As a further proof of principle, we subsequently apply this scheme to the detection of two significantly different signals at the LHC featuring a $t\bar{t}\gamma\gamma$ final state: $t\bar t h$, giving a narrow resonance in the diphoton mass spectrum, and gravity-mediated supersymmetry, which results in broad distributions at high transverse momentum. Compared to existing dedicated searches at the LHC, the sensitivities for both signals are found to be encouraging., Comment: 32 pages, 20 figures

We fine-tune GPT-3 to answer long-form questions using a text-based web-browsing environment, which allows the model to search and navigate the web. By setting up the task so that it can be performed by humans, we are able to train models on the task using imitation learning, and then optimize answer quality with human feedback. To make human evaluation of factual accuracy easier, models must collect references while browsing in support of their answers. We train and evaluate our models on ELI5, a dataset of questions asked by Reddit users. Our best model is obtained by fine-tuning GPT-3 using behavior cloning, and then performing rejection sampling against a reward model trained to predict human preferences. This model's answers are preferred by humans 56% of the time to those of our human demonstrators, and 69% of the time to the highest-voted answer from Reddit., Comment: 32 pages

In this paper, we present a sufficient condition for finite Morse index of complete properly self-shrinkers. We prove that a complete properly embedded self-shrinker in $\mathbb{R}^{n+1}$ with finite asymptotically conical ends or asymptotically cylindrical ends must have finite Morse index. Moreover, as an application of this result, we show that a complete properly embedded self-shrinker in $\mathbb{R}^3$ with finite genus has finite Morse index., Comment: 13 pages

In this paper, we focus on the unsupervised multi-view feature selection which tries to handle high dimensional data in the field of multi-view learning. Although some graph-based methods have achieved satisfactory performance, they ignore the underlying data structure across different views. Besides, their pre-defined laplacian graphs are sensitive to the noises in the original data space, and fail to get the optimal neighbor assignment. To address the above problems, we propose a novel unsupervised multi-view feature selection model based on graph learning, and the contributions are threefold: (1) during the feature selection procedure, the consensus similarity graph shared by different views is learned. Therefore, the proposed model can reveal the data relationship from the feature subset. (2) a reasonable rank constraint is added to optimize the similarity matrix to obtain more accurate information; (3) an auto-weighted framework is presented to assign view weights adaptively, and an effective alternative iterative algorithm is proposed to optimize the problem. Experiments on various datasets demonstrate the superiority of the proposed method compared with the state-of-the-art methods.

Schedulability bounds not only serve as efficient tests to decide schedulability of real-time task systems but also reveal insights about the worst-case performance of scheduling algorithms. Different from sequential real-time task systems for which utilization is a suitable metric to develop schedulability bounds, schedulability of parallel real-time tasks depends on not only utilization but also the workload graph structure of tasks, which can be well represented by the tensity metric. In this paper, we develop new analysis techniques for parallel real-time task systems under Global Rate-Monotonic (G-RM) scheduling and obtain new results on schedulability bounds based on these two metrics: utilization and tensity. First, we develop the first utilization-tensity bound for G-RM. Second, we improve the capacity augmentation bound of G-RM from the best known value 3.73 to 3.18. These schedulability bounds not only provide theoretical insights about real-time performance of G-RM, but also serve as highly efficient schedulability tests, which are particularly suitable to design scenarios in which detailed task graph structures are unknown or may change at run-time. Experiments with randomly generated task sets show that our new results consistently outperform the state-of-the-art with a significant margin under different parameter settings., Comment: 11 pages

The Teacher-Student (T-S) framework is widely utilized in the classification tasks, through which the performance of one neural network (the student) can be improved by transferring knowledge from another trained neural network (the teacher). Since the transferring knowledge is related to the network capacities and structures between the teacher and the student, how to define efficient knowledge remains an open question. To address this issue, we design a novel transferring knowledge, the Self-Attention based Inter-Class Correlation (ICC) map in the output layer, and propose our T-S framework, Inter-Class Correlation Transfer (ICCT)., Comment: 10 pages, 5 figures

Real-time scheduling and locking protocols are fundamental facilities to construct time-critical systems. For parallel real-time tasks, predictable locking protocols are required when concurrent sub-jobs mutually exclusive access to shared resources. This paper for the first time studies the distributed synchronization framework of parallel real-time tasks, where both tasks and global resources are partitioned to designated processors, and requests to each global resource are conducted on the processor on which the resource is partitioned. We extend the Distributed Priority Ceiling Protocol (DPCP) for parallel tasks under federated scheduling, with which we proved that a request can be blocked by at most one lower-priority request. We develop task and resource partitioning heuristics and propose analysis techniques to safely bound the task response times. Numerical evaluation (with heavy tasks on 8-, 16-, and 32-core processors) indicates that the proposed methods improve the schedulability significantly compared to the state-of-the-art locking protocols under federated scheduling.

Locking protocol is an essential component in resource management of real-time systems, which coordinates mutually exclusive accesses to shared resources from different tasks. Although the design and analysis of locking protocols have been intensively studied for sequential real-time tasks, there has been little work on this topic for parallel real-time tasks. In this paper, we study the analysis of parallel real-time tasks using spin locks to protect accesses to shared resources in three commonly used request serving orders (unordered, FIFO-order and priority-order). A remarkable feature making our analysis method more accurate is to systematically analyze the blocking time which may delay a task's finishing time, where the impact to the total workload and the longest path length is jointly considered, rather than analyzing them separately and counting all blocking time as the workload that delays a task's finishing time, as commonly assumed in the state-of-the-art.

In this paper, we propose \textit{ReLeTA}: Reinforcement Learning based Task Allocation for temperature minimization. We design a new reward function and use a new state model to facilitate optimization of reinforcement learning algorithm. By means of the new reward function and state model, \releta is able to effectively reduce the system peak temperature without compromising the application performance. We implement and evaluate \releta on a real platform in comparison with the state-of-the-art approaches. Experimental results show \releta can reduce the average peak temperature by 4 $^{\circ}$C and the maximum difference is up to 13 $^{\circ}$C.

We present a quantum algorithm solving the greatest common divisor (GCD) problem. This quantum algorithm possesses similar computational complexity with classical algorithms, such as the well-known Euclidean algorithm for GCD. This algorithm is an application of the quantum algorithms for the hidden subgroup problems, the same as Shor factoring algorithm. Explicit quantum circuits realized by quantum gates for this quantum algorithm are provided. We also give a computer simulation of this quantum algorithm and present the expected outcomes for the corresponding quantum circuit.

Federated scheduling is a promising approach to schedule parallel real-time tasks on multi-cores, where each heavy task exclusively executes on a number of dedicated processors, while light tasks are treated as sequential sporadic tasks and share the remaining processors. However, federated scheduling suffers resource waste since a heavy task with processing capacity requirement $x + \epsilon$ (where $x$ is an integer and $0 < \epsilon < 1$) needs $x + 1$ dedicated processors. In the extreme case, almost half of the processing capacity is wasted. In this paper we propose the semi-federate scheduling approach, which only grants $x$ dedicated processors to a heavy task with processing capacity requirement $x + \epsilon$, and schedules the remaining $\epsilon$ part together with light tasks on shared processors. Experiments with randomly generated task sets show the semi-federated scheduling approach significantly outperforms not only federated scheduling, but also all existing approaches for scheduling parallel real-time tasks on multi-cores.