Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
59works
0followers
28topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

59 published item(s)

preprint2026arXiv

ADR: An Agentic Detection System for Enterprise Agentic AI Security

We present the Agentic AI Detection and Response (ADR) system, the first large-scale, production-proven enterprise framework for securing AI agents operating through the Model Context Protocol (MCP). We identify three persistent challenges in this domain: (1) limited observability -- existing Endpoint Detection and Response (EDR) tools see file writes but not the agent reasoning, prompts, or causal chains linking intent to execution; (2) insufficient robustness -- static defenses constrained by pre-defined rules fail to generalize across diverse attack techniques and enterprise contexts; and (3) high detection costs -- LLM-based inference is prohibitively expensive at scale. ADR addresses these challenges via three components: the ADR Sensor for high-fidelity agentic telemetry, the ADR Explorer for systematic pre-deployment red teaming and hard-example generation, and the ADR Detector for scalable, two-tier online detection combining fast triage with context-aware reasoning. Deployed at Uber for over ten months, ADR has sustained reliable detection in production with growing adoption reaching over 7,200 unique hosts and processing over 10,000 agent sessions daily, uncovering hundreds of credential exposures across 26 categories and enabling a shift-left prevention layer (97.2% precision, 206 detected credentials). To validate the approach and enable community adoption, we introduce ADR-Bench (302 tasks, 17 techniques, 133 MCP servers), where ADR achieves zero false positives while detecting 67% of attacks -- outperforming three state-of-the-art baselines (ALRPHFS, GuardAgent, LlamaFirewall) by 2--4x in F1-score. On AgentDojo (public prompt injection benchmark), ADR detects all attacks with only three false alarms out of 93 tasks.

preprint2026arXiv

Beyond Scaling: Measuring and Predicting the Upper Bound of Knowledge Retention in Language Model Pre-Training

The GPT-4 technical report suggests that downstream performance can be predicted from pre-training signals, but offers little methodological detail on how to quantify this. This work address this gap by modeling knowledge retention, the capacity of a pre-trained language model to memorize factual information from its corpus, and introduce a principled method to estimate it prior to training. We propose Size-dependent Mutual Information (SMI), an information-theoretic predictor that integrates knowledge frequency, knowledge specificity, and model size to forecast closed-book question answering (QA) accuracy. SMI is validated through large-scale document retrieval over the disclosed pre-training corpora of 21 public and 3 custom models, combined with a robust multi-template QA evaluation. Experiments show that SMI significantly outperforms repetition-based baselines and achieves $R^2$ > 0.7 in predicting QA accuracy for models above 1B parameters, without additional training. The analysis further reveals diminishing returns from scaling data and model size and provides evidence for an intrinsic upper bound on knowledge retention achievable by pre-training alone, motivating retrieval and other augmentation strategies. The dataset and code are available at https://github.com/yuhui1038/SMI.

preprint2026arXiv

CL-bench Life: Can Language Models Learn from Real-Life Context?

Today's AI assistants such as OpenClaw are designed to handle context effectively, making context learning an increasingly important capability for models. As these systems move beyond professional settings into everyday life, the nature of the contexts they must handle also shifts. Real-life contexts are often messy, fragmented, and deeply tied to personal and social experience, such as multi-party conversations, personal archives, and behavioral traces. Yet it remains unclear whether current frontier language models can reliably learn from such contexts and solve tasks grounded in them. To this end, we introduce CL-bench Life, a fully human-curated benchmark comprising 405 context-task pairs and 5,348 verification rubrics, covering common real-life scenarios. Solving tasks in CL-bench Life requires models to reason over complex, messy real-life contexts, calling for strong real-life context learning abilities that go far beyond those evaluated in existing benchmarks. We evaluate ten frontier LMs and find that real-life context learning remains highly challenging: even the best-performing model achieves only 19.3% task solving rate, while the average performance across models is only 13.8%. Models still struggle to reason over contexts such as messy group chat histories and fragmented behavioral records from everyday life. CL-bench Life provides a crucial testbed for advancing real-life context learning, and progress on it can enable more intelligent and reliable AI assistants in everyday life.

preprint2026arXiv

CMDAR: A Chinese Multi-scene Dynamic Audio Reasoning Benchmark with Diverse Challenges

The ability to reason from audio, including speech, environmental sounds, and music, is essential for AI agents to interact effectively in real-world scenarios. Existing benchmarks mainly focus on static or single-scene settings and English audio data and do not fully capture scenarios where multiple speakers, unfolding events, and heterogeneous audio sources interact. To address these challenges, we introduce CMDAR, a Chinese benchmark for evaluating models on complex, multi-scene, and dynamically evolving audio reasoning tasks. CMDAR comprises 3,000 carefully curated question-answer pairs linked to diverse audio clips, covering five categories of complex reasoning and spanning three question types. We benchmark 26 state-of-the-art audio language models on CMDAR and observe that they exhibit limitations in complex reasoning tasks. In CMDAR-main, Qwen2.5-Omni achieves 76.67% accuracy, whereas GPT-4o Audio reaches 68.47%. However, GPT-4o Audio substantially outperforms Qwen2.5-Omni on the more challenging multiple-choice with multiple audios and open-ended tasks. And we provide detail analysis corresponding suggestions for the future development of large audio language models.

preprint2026arXiv

Generative structure search for efficient and diverse discovery of molecular and crystal structures

Predicting stable and metastable structures is central to molecular and materials discovery, but remains limited by the cost of searching high-dimensional energy landscapes. Deep generative models offer efficient structure sampling, yet their outputs remain shaped by training data and can underexplore minima that are rare but physically relevant. We introduce generative structure search (GSS), a unified framework that formulates diffusion-based generation and random structure search (RSS) as limiting regimes of a common sampling process driven by learned score fields and physical forces. Coupling these drivers lets GSS use data priors to accelerate sampling while retaining energy-guided exploration of local minima. Across molecular and crystalline systems, GSS recovers diverse metastable structures with more than tenfold lower sampling cost than RSS for broad coverage and remains effective for compositions outside the training distribution. The results establish a physically grounded generative search strategy for discovering structures beyond the reach of data-driven sampling alone.

preprint2026arXiv

Impact of Pressure and Apical Oxygen Vacancies on Superconductivity in La$_3$Ni$_2$O$_7$

The bilayer nickelate La$_3$Ni$_2$O$_7$ under pressure has recently emerged as a promising system for high-$T_c$ superconductivity. In this work, we investigate the fate of the superconducting properties in La$_3$Ni$_2$O$_{7}$ under pressure, focusing on the effects of structural deformation and apical oxygen vacancies. Employing a low-energy effective $t$-$J_{\parallel}$-$J_{\perp}$ model for the $3d_{x^2-y^2}$ orbitals within the slave-boson mean-field approach, we demonstrate that the pairing strength is significantly enhanced in the high-pressure tetragonal $I4/mmm$ phase compared to the ambient pressure orthorhombic $Amam$ phase. Furthermore, by simulating random configurations of apical oxygen vacancies, we show that oxygen vacancies suppress both pairing strength and superfluid density. These results underscore the critical role of pressure and oxygen stoichiometry in tuning the SC of La$_3$Ni$_2$O$_7$, providing key insights into optimizing its high-$T_c$ behavior.

preprint2026arXiv

Interests Burn-down Diffusion Process for Personalized Collaborative Filtering

Generative methods have gained widespread attention in Collaborative Filtering (CF) tasks for their ability to produce high-quality personalized samples aligned with users' interests. Among them, diffusion generative models have raised increasing attention in recommendation field. Despite that the pioneering efforts have applied the conventional diffusion process to model diffusive user interests, the incongruity between the Gaussian noise and the subtle nature of user's personalized interaction behavior has led to sub-optimal results. To this end, we introduce a specifically-tailored diffusion scheme for interaction systems, namely the interests burn-down process. The interests burn-down process delineates the decay of user interests towards candidate items, complemented by its reverse burn-up process that yields personalized recommendation for users. The inherent burn-down nature of this process adeptly models the diffusive user interests, aligning seamlessly with the requirements of CF tasks. We present a novel recommendation method StageCF to illustrate the superiority of this newly proposed diffusion process. Experimental results have demonstrated the effectiveness of StageCF against existing generative and diffusion-based baseline methods. Furthermore, comprehensive studies validate the functionality of interests burn-down process, shedding light on its capacity to generate personalized interactions.

preprint2026arXiv

LLMEval-Logic: A Solver-Verified Chinese Benchmark for Logical Reasoning of LLMs with Adversarial Hardening

Evaluating large language models (LLMs) on natural-language logical reasoning is essential because rule-governed tasks require conclusions to follow strictly from stated premises. Many existing logical-reasoning benchmarks are generated by templating natural-language items from sampled formulas, provide only coarse or unaudited formal annotations, and are now quickly saturated by frontier reasoning models. We present LLMEval-Logic, a Chinese logical reasoning benchmark built from realistic situational scenarios. Its pipeline forward-authors and expert-audits natural-language items together with their reference formalizations, verifies annotated answers with Z3, constructs expert rubrics for natural-to-formal grading, and hardens selected items through a closed-loop adversarial workflow. The benchmark is released in two paired subsets: a 246-item Base subset shipped with 1,400 expert-developed rubric atoms, and a 190-item Hard subset with 938 multi-step sub-questions over closed model spaces. Evaluating 14 frontier LLMs on LLMEval-Logic reveals substantial gaps in current models: the best model reaches only 37.5% Hard Item Accuracy, and even with reference symbols the highest joint Z3+Rubric formalization score among evaluated models reaches only 60.16%. Our benchmark is publicly available at https://github.com/llmeval/LLMEval-Logic.

preprint2026arXiv

Muse: Towards Reproducible Long-Form Song Generation with Fine-Grained Style Control

Recent commercial systems such as Suno demonstrate strong capabilities in long-form song generation, while academic research remains largely non-reproducible due to the lack of publicly available training data, hindering fair comparison and progress. To this end, we release a fully open-source system for long-form song generation with fine-grained style conditioning, including a licensed synthetic dataset, training and evaluation pipelines, and Muse, an easy-to-deploy song generation model. The dataset consists of 116k fully licensed synthetic songs with automatically generated lyrics and style descriptions paired with audio synthesized by SunoV5. We train Muse via single-stage supervised finetuning of a Qwen-based language model extended with discrete audio tokens using MuCodec, without task-specific losses, auxiliary objectives, or additional architectural components. Our evaluations find that although Muse is trained with a modest data scale and model size, it achieves competitive performance on phoneme error rate, text--music style similarity, and audio aesthetic quality, while enabling controllable segment-level generation across different musical structures. All data, model weights, and training and evaluation pipelines will be publicly released, paving the way for continued progress in controllable long-form song generation research. The project repository is available at https://github.com/yuhui1038/Muse.

preprint2026arXiv

OpenNovelty: An LLM-powered Agentic System for Verifiable Scholarly Novelty Assessment

Evaluating novelty is critical yet challenging in peer review, as reviewers must assess submissions against a vast, rapidly evolving literature. This report presents OpenNovelty, an LLM-powered agentic system for transparent, evidence-based novelty analysis. The system operates through four phases: (1) extracting the core task and contribution claims to generate retrieval queries; (2) retrieving relevant prior work based on extracted queries via semantic search engine; (3) constructing a hierarchical taxonomy of core-task-related work and performing contribution-level full-text comparisons against each contribution; and (4) synthesizing all analyses into a structured novelty report with explicit citations and evidence snippets. Unlike naive LLM-based approaches, \textsc{OpenNovelty} grounds all assessments in retrieved real papers, ensuring verifiable judgments. We deploy our system on 500+ ICLR 2026 submissions with all reports publicly available on our website, and preliminary analysis suggests it can identify relevant prior work, including closely related papers that authors may overlook. OpenNovelty aims to empower the research community with a scalable tool that promotes fair, consistent, and evidence-backed peer review.

preprint2026arXiv

SciCustom: A Framework for Custom Evaluation of Scientific Capabilities in Large Language Models

Large language models (LLMs) are increasingly applied to scientific research, yet existing evaluations often fail to reflect the fine-grained capabilities required in practice. Most benchmarks are manually curated or domain-generic, limiting scalability and alignment with real scientific use cases. In this paper, we propose a new framework named SciCustom to address the problem. It enables the custom construction of benchmarks from large-scale scientific data to evaluate application-specific scientific capabilities in LLMs. SciCustom first organizes scientific knowledge into ontology-grounded knowledge units with controlled granularity and trains a tagger to map large-scale data instances into this knowledge space. Given a custom requirement, relevant knowledge units are identified via voting-based multi-model consensus. These units enable relevance-aware benchmark retrieval via binary search, followed by proxy subset selection and data-grounded benchmark generation for efficient evaluation. Experiments in chemistry and healthcare demonstrate that SciCustom reveals fine-grained differences in LLM scientific capabilities that standard benchmarks overlook, while requiring neither expert annotation nor synthetic question generation. This work provides a scalable and application-aware foundation for benchmarking scientific capabilities in LLMs. The source code is available at https://github.com/yjwtheonly/SciCustom.

preprint2026arXiv

What Makes a Good Speech Tokenizer for LLM-Centric Speech Generation? A Systematic Study

Speech-language models (SLMs) offer a promising path toward unifying speech and text understanding and generation. However, challenges remain in achieving effective cross-modal alignment and high-quality speech generation. In this work, we systematically investigate the role of speech tokenizer designs in LLM-centric SLMs, augmented by speech heads and speaker modeling. We compare coupled, semi-decoupled, and fully decoupled speech tokenizers under a fair SLM framework and find that decoupled tokenization significantly improves alignment and synthesis quality. To address the information density mismatch between speech and text, we introduce multi-token prediction (MTP) into SLMs, enabling each hidden state to decode multiple speech tokens. This leads to up to 12$\times$ faster decoding and a substantial drop in word error rate (from 6.07 to 3.01). Furthermore, we propose a speaker-aware generation paradigm and introduce RoleTriviaQA, a large-scale role-playing knowledge QA benchmark with diverse speaker identities. Experiments demonstrate that our methods enhance both knowledge understanding and speaker consistency.

preprint2025arXiv

OxygenREC: An Instruction-Following Generative Framework for E-commerce Recommendation

Traditional recommendation systems suffer from inconsistency in multi-stage optimization objectives. Generative Recommendation (GR) mitigates them through an end-to-end framework; however, existing methods still rely on matching mechanisms based on inductive patterns. Although responsive, they lack the ability to uncover complex user intents that require deductive reasoning based on world knowledge. Meanwhile, LLMs show strong deep reasoning capabilities, but their latency and computational costs remain challenging for industrial applications. More critically, there are performance bottlenecks in multi-scenario scalability: as shown in Figure 1, existing solutions require independent training and deployment for each scenario, leading to low resource utilization and high maintenance costs-a challenge unaddressed in GR literature. To address these, we present OxygenREC, an industrial recommendation system that leverages Fast-Slow Thinking to deliver deep reasoning with strict latency and multi-scenario requirements of real-world environments. First, we adopt a Fast-Slow Thinking architecture. Slow thinking uses a near-line LLM pipeline to synthesize Contextual Reasoning Instructions, while fast thinking employs a high-efficiency encoder-decoder backbone for real-time generation. Second, to ensure reasoning instructions effectively enhance recommendation generation, we introduce a semantic alignment mechanism with Instruction-Guided Retrieval (IGR) to filter intent-relevant historical behaviors and use a Query-to-Item (Q2I) loss for instruction-item consistency. Finally, to resolve multi-scenario scalability, we transform scenario information into controllable instructions, using unified reward mapping and Soft Adaptive Group Clip Policy Optimization (SA-GCPO) to align policies with diverse business objectives, realizing a train-once-deploy-everywhere paradigm.

preprint2024arXiv

RJUA-QA: A Comprehensive QA Dataset for Urology

We introduce RJUA-QA, a novel medical dataset for question answering (QA) and reasoning with clinical evidence, contributing to bridge the gap between general large language models (LLMs) and medical-specific LLM applications. RJUA-QA is derived from realistic clinical scenarios and aims to facilitate LLMs in generating reliable diagnostic and advice. The dataset contains 2,132 curated Question-Context-Answer pairs, corresponding about 25,000 diagnostic records and clinical cases. The dataset covers 67 common urological disease categories, where the disease coverage exceeds 97.6\% of the population seeking medical services in urology. Each data instance in RJUA-QA comprises: (1) a question mirroring real patient to inquiry about clinical symptoms and medical conditions, (2) a context including comprehensive expert knowledge, serving as a reference for medical examination and diagnosis, (3) a doctor response offering the diagnostic conclusion and suggested examination guidance, (4) a diagnosed clinical disease as the recommended diagnostic outcome, and (5) clinical advice providing recommendations for medical examination. RJUA-QA is the first medical QA dataset for clinical reasoning over the patient inquiries, where expert-level knowledge and experience are required for yielding diagnostic conclusions and medical examination advice. A comprehensive evaluation is conducted to evaluate the performance of both medical-specific and general LLMs on the RJUA-QA dataset. Our data is are publicly available at \url{https://github.com/alipay/RJU_Ant_QA}.

preprint2024arXiv

TBDD: A New Trust-based, DRL-driven Framework for Blockchain Sharding in IoT

Integrating sharded blockchain with IoT presents a solution for trust issues and optimized data flow. Sharding boosts blockchain scalability by dividing its nodes into parallel shards, yet it's vulnerable to the $1\%$ attacks where dishonest nodes target a shard to corrupt the entire blockchain. Balancing security with scalability is pivotal for such systems. Deep Reinforcement Learning (DRL) adeptly handles dynamic, complex systems and multi-dimensional optimization. This paper introduces a Trust-based and DRL-driven (\textsc{TbDd}) framework, crafted to counter shard collusion risks and dynamically adjust node allocation, enhancing throughput while maintaining network security. With a comprehensive trust evaluation mechanism, \textsc{TbDd} discerns node types and performs targeted resharding against potential threats. The model maximizes tolerance for dishonest nodes, optimizes node movement frequency, ensures even node distribution in shards, and balances sharding risks. Rigorous evaluations prove \textsc{TbDd}'s superiority over conventional random-, community-, and trust-based sharding methods in shard risk equilibrium and reducing cross-shard transactions.

preprint2023arXiv

Analytical approximate solutions for scalarized AdS black holes

The spontaneous scalarization of Schwarzscild-AdS is investigated in the Einstein-scalar-Gauss--Bonnet (ESGB) theory. Firstly, we construct scalarized AdS black holes numerically. Secondly, making use of the homotopy analysis method (HAM), we obtain analytical approximate solutions for scalarized AdS black holes in the ESGB theory. It is found that scalarized AdS black holes constructed numerically are consistent with analytical approximate solutions in the whole space.

preprint2023arXiv

Channel Measurement for Holographic MIMO: Benefits and Challenges of Spatial Oversampling

In this paper, the channel of an indoor holographic multiple-input multiple-output (MIMO) system is measured. It is demonstrated through experiments for the first time that the spatial oversampling of holographic MIMO systems is able to increase the capacity of a wireless communication system significantly. However, the antenna efficiency is the most crucial challenge preventing us from getting the capacity improvement. An extended EM-compliant channel model is also proposed for holographic MIMO systems, which is able to take the non-isotropic characteristics of the propagation environment, the antenna pattern distortion, the antenna efficiency, and the polarization characteristics into consideration.

preprint2023arXiv

Ultrafast X-ray Diffraction Probe of Coherent Spin-state Dynamics in Molecules

We propose an approach to probe coherent spin-state dynamics of molecules using circularly polarized hard x-ray pulses. For the dynamically aligned nitric oxide molecules in a coherent superposition spin-orbit coupled electronic state that can be prepared through stimulated Raman scattering, we demonstrate the capability of ultrafast x-ray diffraction to not only reveal the quantum beating of the coherent spin-state wave packet, but also image the spatial spin density of the molecule. With circularly polarized ultrafast x-ray diffraction signal, we show that the electronic density matrix can be retrieved. The spatio-temporal resolving power of ultrafast x-ray diffraction paves the way for tracking transient spatial wave function in molecular dynamics involving spin degree of freedom.

preprint2022arXiv

A Probabilistic Model-Based Robust Waveform Design for MIMO Radar Detection

This paper addresses robust waveform design for multiple-input-multiple-output (MIMO) radar detection. A probabilistic model is proposed to describe the target uncertainty. Considering that waveform design based on maximizing the probability of detection is intractable, the relative entropy between the distributions of the observations under two hypotheses (viz., the target is present/absent) is employed as the design metric. To tackle the resulting non-convex optimization problem, an efficient algorithm based on minorization-maximization (MM) is derived. Numerical results demonstrate that the waveform synthesized by the proposed algorithm is more robust to model mismatches.

preprint2022arXiv

Chiral SO(4) spin-valley density wave and degenerate topological superconductivity in magic-angle-twisted bilayer-graphene

Starting from a realistic extended Hubbard model for a $p_{x,y}$-orbital tight-binding model on the Honeycomb lattice, we perform a thorough investigation on the possible electron instabilities in the MA-TBG near the van Hove (VH) dopings. Here we focus on the interplay between the approximate SU(2)$\times$SU(2) symmetry and the $D_3$ symmetry, which leads to intriguing quantum states relevant to recent experiments, as revealed by our systematic RPA based calculations followed by a succeeding mean-field energy minimization for the ground state energy. At the SU(2)$\times$SU(2) symmetric point, the degenerate inter-valley SDW and VDW are mixed into a new state of matter dubbed as the chiral SO(4) spin-valley DW. This state simultaneously hosts three 4-component vectorial spin-valley DW orders with each adopting one wave vector, and the polarization directions of the three DW orders are mutually perpendicular to one another. %in the $\mathbb{R}^4$ space. In the presence of a tiny inter-valley exchange interaction with coefficient $J_H\to 0^{-}$ which breaks the SU(2)$\times$SU(2) symmetry, a pure chiral SDW state is obtained. In the case of $J_H\to 0^{+}$, a nematic VDW+SDW state emerges which possesses a stripy distribution of the charge density, consistent with the recent STM observations. On the aspect of SC, while the triplet $p+ip$ and singlet $d+id$ topological SCs are degenerate at $J_H=0$ near the VH dopings, the former (latter) is favored for $J_H\to 0^{-}$ ($J_H\to 0^{+}$). In addition, the two asymmetric doping-dependent behaviors of the obtained pairing phase diagram are well consistent with experiments.

preprint2022arXiv

Ekar: An Explainable Method for Knowledge Aware Recommendation

This paper studies recommender systems with knowledge graphs, which can effectively address the problems of data sparsity and cold start. Recently, a variety of methods have been developed for this problem, which generally try to learn effective representations of users and items and then match items to users according to their representations. Though these methods have been shown quite effective, they lack good explanations, which are critical to recommender systems. In this paper, we take a different route and propose generating recommendations by finding meaningful paths from users to items. Specifically, we formulate the problem as a sequential decision process, where the target user is defined as the initial state, and the edges on the graphs are defined as actions. We shape the rewards according to existing state-of-the-art methods and then train a policy function with policy gradient methods. Experimental results on three real-world datasets show that our proposed method not only provides effective recommendations but also offers good explanations.

preprint2022arXiv

Generalized Covariant Entropy Bound in Lanczos-Lovelock Gravity

In this paper, we investigate the generalized covariant entropy bound in the theory where the Einstein gravity is perturbed by the higher-order Lovelock terms. After replacing the Bekenstein-Hawking entropy with the Jacobson-Myers entropy and introducing two reasonable physical assumptions, we showed that the corresponding generalized covariant entropy bound is satisfied under a higher-order approximation of the perturbation from the higher-order Lovelock terms. Our result implies that the Jacobson-Myers entropy strictly obeys the entropy bound under the perturbation level, and the generalized second law of Lanczos-Lovelock gravity is also satisfied when the Einstein gravity is perturbed by the higher-order Lovelock terms.

preprint2022arXiv

Higher dimensional Reissner-Nordström black holes supporting static scalar shells

We analytically study scalarization of higher-dimensional charged Reissner-Nordström (RN) black hole. It is shown that static massive scalar field which is non-minimally coupled to Gauss-Bonnet invariant can be supported by higher-dimensional black hole in super-critical charge regime $Q/M\ge \bar{C}_d$ with $Q, M$ charge and mass of the black hole and $\bar{C}_d$ some unitless spacetime dimension-dependent quantity. Moreover, we show that the static massive scalar shell can be quite thin in the large mass regime $μM^{\frac{1}{d-3}}\gg 1$ with $μ$ mass of the scalar field.

preprint2022arXiv

Joule-Thomson Expansion of Born-Infeld AdS Black Holes in 4D Einstein-Gauss-Bonnet gravity

In this paper, the Joule{Thomson expansion of Born{Infeld AdS black holes in the consistent Aoki{Gorji{Mukohyama theory of 4D Einstein-Gauss-Bonnet gravity is studied in the extended phase space. We further analyze the effect of parameters αand βon the inversion curves and plot the inversion and isenthalpic curves in the T-P plane, which can determine the cooling-heating regions.

preprint2022arXiv

KGNN: Harnessing Kernel-based Networks for Semi-supervised Graph Classification

This paper studies semi-supervised graph classification, which is an important problem with various applications in social network analysis and bioinformatics. This problem is typically solved by using graph neural networks (GNNs), which yet rely on a large number of labeled graphs for training and are unable to leverage unlabeled graphs. We address the limitations by proposing the Kernel-based Graph Neural Network (KGNN). A KGNN consists of a GNN-based network as well as a kernel-based network parameterized by a memory network. The GNN-based network performs classification through learning graph representations to implicitly capture the similarity between query graphs and labeled graphs, while the kernel-based network uses graph kernels to explicitly compare each query graph with all the labeled graphs stored in a memory for prediction. The two networks are motivated from complementary perspectives, and thus combing them allows KGNN to use labeled graphs more effectively. We jointly train the two networks by maximizing their agreement on unlabeled graphs via posterior regularization, so that the unlabeled graphs serve as a bridge to let both networks mutually enhance each other. Experiments on a range of well-known benchmark datasets demonstrate that KGNN achieves impressive performance over competitive baselines.

preprint2022arXiv

Lifshitz transition enhanced triplet $p_z$-wave superconductivity in hydrogen doped KCr$_3$As$_3$

The recently synthesized air-insensitive hydrogen doped KCr$_3$As$_3$ superconductor has aroused great research interests. This material has, for the first time in the research area of the quasi-one-dimensional Cr-based superconductivity (SC), realized a tunability through charge doping, which will potentially significantly push the development of this area. Here based on the band structure from first-principle calculations, we construct a six-band tight-binding (TB) model equipped with multi-orbital Hubbard interactions, and adopt the random-phase-approximation approach to study the hydrogen-doping dependence of the pairing symmetry and superconducting $T_c$. Under the rigid-band approximation, our pairing phase diagram is occupied by the triplet $p_z$-wave pairing through out the hydrogen-doping regime $x\in (0.4,1)$ in which SC has been experimentally detected. Remarkably, the $x$-dependence of $T_c$ shows a peak at the 3D-quasi-1D Lifshitz transition point, although the total density of state exhibit a dip there. A thorough investigation of the band structure reveals type-II van-Hove singularities (VHSs) in the $γ$ band, which favor the formation of the triplet SC. It turns out that the $γ$- Fermi surface (FS) comprises two flat quasi-1D FS sheets almost parallel to the $k_z=0$ plane and six almost perpendicular tube-like FS sheets, and the type-II VHS just lies in the boundary between these two FS parts. Furthermore, the $\left|k_z\right|$ of the VH planes reaches the maximum near the Lifshitz-transition point, which pushes the $T_c$ of the $p_z$-wave SC to the maximum. Our results appeal more experimental access into this intriguing superconductor.

preprint2022arXiv

Neutrino Rocket Jet Model: An Explanation of High-velocity Pulsars and their Spin-down Evolution

The fact that the spatial velocity of pulsars is generally higher than that of their progenitor stars has bothered astronomers for nearly 50 years. It has been extensively argued that the high pulsar velocity should be acquired during a natal kick process on a timescale of 100ms - 10s in the supernova explosion, in which some asymmetrical dynamical mechanism plays a key role. However, a satisfactory picture generally is still lacking. In this study, it is argued that the neutrino rocket model can well account for the high speed as well as the long-term evolution behaviors of pulsars. The neutrinos are emitted from superfluid vortex neutrons through the neutrino cyclotron radiation mechanism. The unique characters of left-handed neutrinos and right-handed antineutrinos resulting from the nonconservation of parity in weak interactions play a major role in the spatial asymmetry. The continuous acceleration of pulsars can be naturally explained by this model, which yields a maximum velocity surpassing 1000 km s$^{-1}$. The alignment between the spinning axis and the direction of motion observed for the Crab pulsar (PSR 0531) and the Vela pulsar (PSR 0833) can be well accounted for. The observed correlation between the spin-down rate and the period of long-period pulsars with $P \gtrsim 0.5$s can also be satisfactorily explained.

preprint2022arXiv

Perspective: Ultrafast Imaging of Molecular Dynamics Using Ultrafast Low-Frequency Lasers, X-ray Free Electron Laser and Electron Pulses

The requirement of high space-time resolution and brightness is a great challenge for imaging atomic motion and making molecular movies. Important breakthroughs in ultrabright tabletop laser, x-ray and electron sources have enabled the direct imaging of evolving molecular structures in chemical processes. And recent experimental advances in preparing ultrafast laser and electron pulses equipped molecular imaging with femtosecond time resolution. This Perspectives present an overview of versatile imaging methods of molecular dynamics. High-order harmonic generation imaging and photoelectron diffraction imaging are based on laser-induced ionization and rescattering processes. Coulomb explosion imaging retrieves molecular structural information by detecting the momentum vectors of fragmented ions. Diffraction imaging encodes molecular structural and electronic information in reciprocal space. We also present various applications of these ultrafast imaging methods in resolving laser-induced nuclear and electronic dynamics.

preprint2022arXiv

Sequence-to-Sequence Voice Reconstruction for Silent Speech in a Tonal Language

Silent Speech Decoding (SSD), based on articulatory neuromuscular activities, has become a prevalent task of Brain-Computer Interface (BCI) in recent years. Many works have been devoted to decoding surface electromyography (sEMG) from articulatory neuromuscular activities. However, restoring silent speech in tonal languages such as Mandarin Chinese is still difficult. This paper proposes an optimized Sequence-to-Sequence (Seq2Seq) approach to synthesize voice from the sEMG-based silent speech. We extract duration information to regulate the sEMG-based silent speech using the audio length. Then, we provide a deep-learning model with an encoder-decoder structure and a state-of-art vocoder to generate the audio waveform. Experiments based on six Mandarin Chinese speakers demonstrate that the proposed model can successfully decode silent speech in Mandarin Chinese and achieve a character error rate (CER) of 6.41% on average with human evaluation.

preprint2022arXiv

Silicon photonic devices for scalable quantum information applications

With high integration density and excellent optical properties, silicon photonics is becoming a promising platform for complete integration and large-scale optical quantum information processing. Scalable quantum information applications need photon generation and detection to be integrated on the same chip, and we have seen that various devices on the silicon photonic chip have been developed for this goal. This paper reviews the relevant research results and state-of-the-art technologies on the silicon photonic chip for scalable quantum applications. Despite the shortcomings, properties of some components have already met the requirements for further expansion. Furthermore, we point out the challenges ahead and further research directions for on-chip scalable quantum information applications.

preprint2022arXiv

Taxonomy and evolution predicting using deep learning in images

Molecular and morphological characters, as important parts of biological taxonomy, are contradictory but need to be integrated. Organism's image recognition and bioinformatics are emerging and hot problems nowadays but with a gap between them. In this work, a multi-branching recognition framework mediated by genetic information bridges this barrier, which establishes the link between macro-morphology and micro-molecular information of mushrooms. The novel multi-perspective structure is proposed to fuse the feature images from three branching models, which significantly improves the accuracy of recognition by about 10% and up to more than 90%. Further, genetic information is implemented to the mushroom image recognition task by using genetic distance embeddings as the representation space for predicting image distance and species identification. Semantic overfitting of traditional classification tasks and the granularity of fine-grained image recognition are also discussed in depth for the first time. The generalizability of the model was investigated in fine-grained scenarios using zero-shot learning tasks, which could predict the taxonomic and evolutionary information of unseen samples. We presented the first method to map images to DNA, namely used an encoder mapping image to genetic distances, and then decoded DNA through a pre-trained decoder, where the total test accuracy on 37 species for DNA prediction is 87.45%. This study creates a novel recognition framework by systematically studying the mushroom image recognition problem, bridging the gap between macroscopic biological information and microscopic molecular information, which will provide a new reference for intelligent biometrics in the future.

preprint2022arXiv

Transferable Cross-Tokamak Disruption Prediction with Deep Hybrid Neural Network Feature Extractor

Predicting disruptions across different tokamaks is a great obstacle to overcome. Future tokamaks can hardly tolerate disruptions at high performance discharge. Few disruption discharges at high performance can hardly compose an abundant training set, which makes it difficult for current data-driven methods to obtain an acceptable result. A machine learning method capable of transferring a disruption prediction model trained on one tokamak to another is required to solve the problem. The key is a disruption prediction model containing a feature extractor that is able to extract common disruption precursor traces in tokamak diagnostic data, and a transferable disruption classifier. Based on the concerns above, the paper first presents a deep fusion feature extractor designed specifically for extracting disruption precursor features from common diagnostics on tokamaks according to currently known precursors of disruption, providing a promising foundation for transferable models. The fusion feature extractor is proved by comparing with manual feature extraction on J-TEXT. Based on the feature extractor trained on J-TEXT, the disruption prediction model was transferred to EAST data with mere 20 discharges from EAST experiment. The performance is comparable with a model trained with 1896 discharges from EAST. From the comparison among other model training scenarios, transfer learning showed its potential in predicting disruptions across different tokamaks.

preprint2021arXiv

Null hypersurface caustics and super-entropic black holes

We obtain a charged, rotating and accelerating black hole solution in the $f(R)$ gravity and calculate thermodynamic quantities of the black hole in the slow acceleration regime. We then find that the black hole can be super-entropic in a certain condition. After investigating the null hypersurface of the black hole, we show that there exist super-entropic black holes whose null hypersurface caustics only form inside the Cauchy horizon.

preprint2021arXiv

Partial FC: Training 10 Million Identities on a Single Machine

Face recognition has been an active and vital topic among computer vision community for a long time. Previous researches mainly focus on loss functions used for facial feature extraction network, among which the improvements of softmax-based loss functions greatly promote the performance of face recognition. However, the contradiction between the drastically increasing number of face identities and the shortage of GPU memories is gradually becoming irreconcilable. In this paper, we thoroughly analyze the optimization goal of softmax-based loss functions and the difficulty of training massive identities. We find that the importance of negative classes in softmax function in face representation learning is not as high as we previously thought. The experiment demonstrates no loss of accuracy when training with only 10\% randomly sampled classes for the softmax-based loss functions, compared with training with full classes using state-of-the-art models on mainstream benchmarks. We also implement a very efficient distributed sampling algorithm, taking into account model accuracy and training efficiency, which uses only eight NVIDIA RTX2080Ti to complete classification tasks with tens of millions of identities. The code of this paper has been made available https://github.com/deepinsight/insightface/tree/master/recognition/partial_fc.

preprint2021arXiv

QoS-Driven Video Uplinking in NOMA-Based IoT

In recent years, with the explosive growth of visual sensors and a large number of related video applications in Internet of Things (IoT), massive video data is generated by IoT devices. Since the volume of video data is far greater than traditional data in IoT, it is challenging to ensure high Quality of Service (QoS) for video uplinking in IoT. To address this challenge, we integrate non-orthogonal multiple access (NOMA) and scalable video coding (SVC) in IoT. To improve the video quality, we formulate a power allocation problem to maximize the average QoS in the proposed integrated system. Due to that the problem is non-convex, we transform it into a monotonic problem based on its hidden monotonicity. Then a power allocation algorithm based on polyblock outer approximation is proposed to solve the problem effectively. Finally, simulation results demonstrate that the proposed algorithm outperforms existing OMA and NOMA based schemes for video uplinking in IoT in terms of QoS and energy efficiency.

preprint2021arXiv

Time-dependent Clearance of Cyclosporine in Adult Renal Transplant Recipients: A Population Pharmacokinetic Perspective

Aim The pharmacokinetic (PK) properties of cyclosporine (CsA) in renal transplant recipients are patient- and time-dependent. Knowledge of this time-related variability is necessary to maintain or achieve CsA target exposure. Here, we aimed to identify factors explaining variabilities in CsA PK properties and characterise time-dependent clearance (CL/F) by performing a comprehensive analysis of CsA PK factors using population PK (popPK) modelling of long-term follow-up data from our institution. Methods In total, 3,674 whole-blood CsA concentrations from 183 patients who underwent initial renal transplantation were analysed using nonlinear mixed-effects modelling. The effects of potential covariates were selected according to a previous report and well-accepted theoretical mechanisms. Model-informed individualised therapeutic regimens were also conducted. Results A two-compartment model adequately described the data and the estimated mean CsA CL/F was 32.6 L h-1 (5%). Allometrically scaled body size, haematocrit (HCT) level, CGC haplotype carrier status, and postoperative time may contribute to CsA PK variability. The CsA bioavailability in patients receiving a prednisolone dose (PD) of 80 mg was 20.6% lower than that in patients receiving 20 mg. A significant decrease (52.6%) in CL/F was observed as the HCT increased from 10.5% to 60.5%. The CL/F of the non-CGC haplotype carrier was 14.4% lower than that of the CGC haplotype carrier at 3 months post operation. CsA dose adjustments should be considered in different postoperative periods. Conclusions By monitoring body size, HCT, PD, and CGC haplotype, changes in CsA CL/F over time could be predicted. Such information could be used to optimise CsA therapy.

preprint2021arXiv

Transverse mode-encoded quantum gate on a silicon photonic chip

As an important degree of freedom (DoF) in integrated photonic circuits, the orthogonal transverse mode provides a promising and flexible way to increasing communication capability, for both classical and quantum information processing. To construct large-scale on-chip multimode multi-DoF quantum systems, a transverse mode-encoded controlled-NOT (CNOT) gate is necessary. Here, through design and integrate transverse mode-dependent directional coupler and attenuators on a silicon photonic chip, we demonstrate the first multimode implementation of a two-qubit quantum gate. With the aid of state preparation and analysis parts, we show the ability of the gate to entangle two separated transverse mode qubits with an average fidelity of $0.89\pm0.02$ and the achievement of 10 standard deviations of violations in the quantum nonlocality verification. In addition, a fidelity of $0.82\pm0.01$ was obtained from quantum process tomography used to completely characterize the CNOT gate. Our work paves the way for universal transverse mode-encoded quantum operations and large-scale multimode multi-DoF quantum systems.

preprint2020arXiv

A Lightweight and Accurate Localization Algorithm Using Multiple Inertial Measurement Units

This paper proposes a novel inertial-aided localization approach by fusing information from multiple inertial measurement units (IMUs) and exteroceptive sensors. IMU is a low-cost motion sensor which provides measurements on angular velocity and gravity compensated linear acceleration of a moving platform, and widely used in modern localization systems. To date, most existing inertial-aided localization methods exploit only one single IMU. While the single-IMU localization yields acceptable accuracy and robustness for different use cases, the overall performance can be further improved by using multiple IMUs. To this end, we propose a lightweight and accurate algorithm for fusing measurements from multiple IMUs and exteroceptive sensors, which is able to obtain noticeable performance gain without incurring additional computational cost. To achieve this, we first probabilistically map measurements from all IMUs onto a virtual IMU. This step is performed by stochastic estimation with least-square estimators and probabilistic marginalization of inter-IMU rotational accelerations. Subsequently, the propagation model for both state and error state of the virtual IMU is also derived, which enables the use of the classical filter-based or optimization-based sensor fusion algorithms for localization. Finally, results from both simulation and real-world tests are provided, which demonstrate that the proposed algorithm outperforms competing algorithms by noticeable margins.

preprint2020arXiv

Association and Caching in Relay-Assisted mmWave Networks: From A Stochastic Geometry Perspective

Limited backhaul bandwidth and blockage effects are two main factors limiting the practical deployment of millimeter wave (mmWave) networks. To tackle these issues, we study the feasibility of relaying as well as caching in mmWave networks. A user association and relaying (UAR) criterion dependent on both caching status and maximum biased received power is proposed by considering the spatial correlation caused by the coexistence of base stations (BSs) and relay nodes (RNs). A joint UAR and caching placement problem is then formulated to maximize the backhaul offloading traffic. Using stochastic geometry tools, we decouple the joint UAR and caching placement problem by analyzing the relationship between UAR probabilities and caching placement probabilities. We then optimize the transformed caching placement problem based on polyblock outer approximation by exploiting the monotonic property in the general case and utilizing convex optimization in the noise-limited case. Accordingly, we propose a BS and RN selection algorithm where caching status at BSs and maximum biased received power are jointly considered. Experimental results demonstrate a significant enhancement of backhaul offloading using the proposed algorithms, and show that deploying more RNs and increasing cache size in mmWave networks is a more cost-effective alternative than increasing BS density to achieve similar backhaul offloading performance.

preprint2020arXiv

Augmented Bi-path Network for Few-shot Learning

Few-shot Learning (FSL) which aims to learn from few labeled training data is becoming a popular research topic, due to the expensive labeling cost in many real-world applications. One kind of successful FSL method learns to compare the testing (query) image and training (support) image by simply concatenating the features of two images and feeding it into the neural network. However, with few labeled data in each class, the neural network has difficulty in learning or comparing the local features of two images. Such simple image-level comparison may cause serious mis-classification. To solve this problem, we propose Augmented Bi-path Network (ABNet) for learning to compare both global and local features on multi-scales. Specifically, the salient patches are extracted and embedded as the local features for every image. Then, the model learns to augment the features for better robustness. Finally, the model learns to compare global and local features separately, i.e., in two paths, before merging the similarities. Extensive experiments show that the proposed ABNet outperforms the state-of-the-art methods. Both quantitative and visual ablation studies are provided to verify that the proposed modules lead to more precise comparison results.

preprint2020arXiv

EasyQuant: Post-training Quantization via Scale Optimization

The 8 bits quantization has been widely applied to accelerate network inference in various deep learning applications. There are two kinds of quantization methods, training-based quantization and post-training quantization. Training-based approach suffers from a cumbersome training process, while post-training quantization may lead to unacceptable accuracy drop. In this paper, we present an efficient and simple post-training method via scale optimization, named EasyQuant (EQ),that could obtain comparable accuracy with the training-based method.Specifically, we first alternately optimize scales of weights and activations for all layers target at convolutional outputs to further obtain the high quantization precision. Then, we lower down bit width to INT7 both for weights and activations, and adopt INT16 intermediate storage and integer Winograd convolution implementation to accelerate inference.Experimental results on various computer vision tasks show that EQ outperforms the TensorRT method and can achieve near INT8 accuracy in 7 bits width post-training.

preprint2020arXiv

Entropy increases at linear order in scalar-hairy Lovelock gravity

In this paper, we investigate the second law of the black holes in Lovelock gravity sourced by a conformally coupled scalar field under the first-order approximation when the perturbation matter fields satisfy the null energy condition. First of all, we show that the Wald entropy of this theory does not obey the linearized second law for the scalar-hairy Lovelock gravity which contains the higher curvature terms even if we replace the gravitational part of Wald entropy with Jacobson-Myers (JM) entropy. This implies that we cannot naively add the scalar field term of the Wald entropy to the JM entropy of the purely Lovelock gravity to get a valid linearized second law. By rescaling the metric, the action of the scalar field can be written as a purely Lovelock action with another metric. Using this property, by analogy with the JM entropy of the purely Lovelock gravity, we introduce a new formula of the entropy in the scalar-hairy Lovelock gravity. Then, we show that this new JM entropy increases along the event horizon for Vaidya-like black hole solutions and therefore it obeys a linearized second law. Moreover, we show that different from the entropy in $F($Riemann$)$ gravity, the difference between the JM entropy and Wald entropy also contains some additional corrections from the scalar field.

preprint2020arXiv

Escape probability of particle from Kerr-Sen black hole

Assuming that a particle source is at rest in a locally non-rotating frame on the equatorial plane of the Kerr-Sen black hole, we investigate the escape of the massless particle and massive particle from the black hole to spatial infinity. We calculate the escape probabilities of the emitted particles. We find that the angular momentum of the Kerr-Sen black hole boosts the escape probabilities near the horizon of the extreme Kerr-Sen black hole; however the angular momentum of the Kerr-Sen black hole suppresses the escape probabilities near the horizon of the non-extreme Kerr-Sen black hole. We also discover that the horizon limit of the Kerr-Sen black hole is not the most difficult position to escape for a particle in certain conditions.

preprint2020arXiv

GraphAF: a Flow-based Autoregressive Model for Molecular Graph Generation

Molecular graph generation is a fundamental problem for drug discovery and has been attracting growing attention. The problem is challenging since it requires not only generating chemically valid molecular structures but also optimizing their chemical properties in the meantime. Inspired by the recent progress in deep generative models, in this paper we propose a flow-based autoregressive model for graph generation called GraphAF. GraphAF combines the advantages of both autoregressive and flow-based approaches and enjoys: (1) high model flexibility for data density estimation; (2) efficient parallel computation for training; (3) an iterative sampling process, which allows leveraging chemical domain knowledge for valency checking. Experimental results show that GraphAF is able to generate 68% chemically valid molecules even without chemical knowledge rules and 100% valid molecules with chemical rules. The training process of GraphAF is two times faster than the existing state-of-the-art approach GCPN. After fine-tuning the model for goal-directed property optimization with reinforcement learning, GraphAF achieves state-of-the-art performance on both chemical property optimization and constrained property optimization.

preprint2020arXiv

Learning to Customize Model Structures for Few-shot Dialogue Generation Tasks

Training the generative models with minimal corpus is one of the critical challenges for building open-domain dialogue systems. Existing methods tend to use the meta-learning framework which pre-trains the parameters on all non-target tasks then fine-tunes on the target task. However, fine-tuning distinguishes tasks from the parameter perspective but ignores the model-structure perspective, resulting in similar dialogue models for different tasks. In this paper, we propose an algorithm that can customize a unique dialogue model for each task in the few-shot setting. In our approach, each dialogue model consists of a shared module, a gating module, and a private module. The first two modules are shared among all the tasks, while the third one will differentiate into different network structures to better capture the characteristics of the corresponding task. The extensive experiments on two datasets show that our method outperforms all the baselines in terms of task consistency, response quality, and diversity.

preprint2020arXiv

Multi-task Learning via Adaptation to Similar Tasks for Mortality Prediction of Diverse Rare Diseases

Mortality prediction of diverse rare diseases using electronic health record (EHR) data is a crucial task for intelligent healthcare. However, data insufficiency and the clinical diversity of rare diseases make it hard for directly training deep learning models on individual disease data or all the data from different diseases. Mortality prediction for these patients with different diseases can be viewed as a multi-task learning problem with insufficient data and large task number. But the tasks with little training data also make it hard to train task-specific modules in multi-task learning models. To address the challenges of data insufficiency and task diversity, we propose an initialization-sharing multi-task learning method (Ada-Sit) which learns the parameter initialization for fast adaptation to dynamically measured similar tasks. We use Ada-Sit to train long short-term memory networks (LSTM) based prediction models on longitudinal EHR data. And experimental results demonstrate that the proposed model is effective for mortality prediction of diverse rare diseases.

preprint2020arXiv

New gedanken experiment on higher-dimensional asymptotically AdS Reissner-Nordström black hole

Viewing the negative cosmological constant as a dynamical quantity derived from the matter field, we study the weak cosmic censorship conjecture for the higher-dimensional asymptotically AdS Reissner-Nordström black hole. To this end, using stability assumption of matter field perturbation and null energy condition of the matter field, we first derive the first-order and second-order perturbation inequalities containing the variable cosmological constant and its conjugated quantity for the black hole . We prove that the higher-dimensional RN-AdS black hole cannot be destroyed under a second-order approximation of the matter field perturbation process.

preprint2020arXiv

New version of the gedanken experiments to test the weak cosmic censorship in charged dilaton-Lifshitz black holes

In this paper, based on the new version of the gedanken experiments proposed by Sorce and Wald, we examine the weak cosmic censorship in the perturbation process of accreting matter fields for the charged dilaton-Lifshitz black holes. In the investigation, we assume that the black hole is perturbed by some extra matter source satisfied the null energy condition and ultimately settle down to a static charged dilaton-Lifshitz black hole in the asymptotic future. Then, after applying the Noether charge method, we derive the first-order and second-order perturbation inequalities of the perturbation matter fields. As a result, we find that the nearly extremal charged dilaton-Lifshitz black hole cannot be destroyed under the second-order approximation of perturbation. This result implies that the weak cosmic censorship conjecture might be a general feature of the Einstein gravity, and it is independent of the asymptotic behaviors of the black holes.

preprint2020arXiv

Relaxation rate of RNdS black hole

We investigate the relaxation rate of the RNdS black hole perturbed by neutral massless scalar field in the eikonal limit. We find that the fastest relaxation rate of the composed system increases with the cosmological constant for all spacetime dimensions. We also find that, when the cosmological constant decreases from maximum value to zero, the corresponding critical charge of the four-dimensional RNdS black hole maximizing the relaxation rate of the composed system gradually decreases monotonically to $\bar{Q}=0.726$. However, for the higher dimensional systems, this is not the case and the critical charges decrease from maximum to zero.

preprint2020arXiv

Revisiting collisional Penrose processes in term of escape probabilities for spinning particles

We first study the escape probability of the spinning particle emitted from the Kerr black hole and find that the escape probability increases with the spin of the particle around the extreme Kerr black hole; in contrast, the escape probability decreases at the position near the horizon but increases at the position far away from the horizon with the increasing spin of the particle. We then probe the relation between the escape probabilities and the energy extraction efficiencies of collisional Penrose processes for the particles with varying spin. For the extreme Kerr black hole, the efficiency increases with the escape probability; for the non-extreme Kerr black hole, the near-horizon-efficiency decreases with the escape probability whilst the efficiency may increase with the escape probability in the ergosphere. In the event horizon limit, we also find that the average escape probability of the spinning particle produced in the collisional Penrose process decreases with the rotation parameter of the Kerr black hole.

preprint2020arXiv

Shadows of the accelerating black holes

Due to the acceleration of the black hole, the circular orbits of the photons will deviate from the equatorial plane and the property of the black hole shadow will change. We find that the latitude of the circular orbit increases with the increasing acceleration and then show that the observer's inclination angles which make the shadow radius and the shadow distortion maximum increase with the increasing acceleration for the accelerating Kerr black hole.

preprint2020arXiv

Snowmass 2021 LoI: Determination of cosmic ray properties in the local interstellar medium with all-sky anisotropy observations

Propagation of Galactic cosmic rays (CR) in the interstellar medium (ISM) is among the unsolved problems in particle astrophysics. Interpretation of CR spectrum and composition measurements and their possible link to dark matter crucially relies on our understanding of CR propagation in the Galaxy. Several air shower experiments have measured a significant anisotropy of CRs in the TeV to PeV energy range. These observations hint to a complicated overlap of more than one cause: from the distribution of the CR sources in the Milky Way to the nature of such sources, from the turbulence properties of interstellar plasmas to the inhomogeneous nature of the interstellar medium. Coherent magnetic structures such as the heliosphere greatly influence the CR arrival direction distribution. It is necessary to account for and remove the heliosphere's distortion effects if we want to determine the pristine CR arrival direction distribution in the local interstellar medium (LISM), the environment surrounding the solar system up to the distance of particle mean free path. The recent availability of accurate all-sky maps of CR arrival direction distribution and the latest advancements in heliospheric modeling, make it possible to infer the CR pitch angle distribution in the LISM using a Liouville mapping technique. With the interstellar CR distribution, we can study the global characteristics of CR diffusion, tap into the properties of interstellar plasma turbulence, test the recent and local CR source hypothesis, and whether clumps of dark matter have a role in the observed CR observations. The study can lead to developments aiming to a better understanding of the heliosphere, particularly the boundary region with the ISM, and additional constraints on the LISM properties.

preprint2020arXiv

Stable circular orbits of spinning test particles around accelerating Kerr black hole

We investigate the stable circular orbits of the spinning test particles around the accelerating Kerr black hole on the equatorial plane. To this end, we first calculate the equations of motion and analyze the parameter space for the particles. We study the effect of the particle's spin and the black hole's acceleration on the conserved angular momentum, conserved energy and radius of the spinning test particle on the innermost stable circular orbit. We find that the effect of the particle's spin on the orbit parameters is almost linear, the effect of the black hole's acceleration on those parameters is nonlinear. We also explore the effects of the particle's spin and the black hole's acceleration on the periastron shift for the spinning particle in the nearly stable circular orbit.

preprint2019arXiv

Charged black holes in the Einstein-Maxwell-Weyl gravity

We construct charged asymptotically flat black hole solutions in Einstein-Maxwell-Weyl(EMW) gravity. These solutions can be interpreted as generalizations of two different groups: Schwarzschild black hole (SBH) and non-Schwarzschild black hole (NSBH) solutions. In addition, we discuss the thermodynamic properties of two groups of numerical solutions in detail, and show that they obey the first law of thermodynamics.

preprint2019arXiv

Effect of protein binding on exposure of unbound and total mycophenolic acid: a population pharmacokinetic analysis in Chinese adult kidney transplant recipients

AIMS A population pharmacokinetic (PK) analysis was performed to: (1) characterise the PK of unbound and total mycophenolic acid (MPA) and its 7-O-mycophenolic acid glucuronide (MPAG) metabolite, and (2) identify the clinically significant covariates that cause variability in the dose-exposure relationship to facilitate dose optimisation. METHODS A total of 740 unbound MPA (uMPA), 741 total MPA (tMPA) and 734 total MPAG (tMPAG) concentration-time data from 58 Chinese kidney transplant patients were analysed using a nonlinear mixed-effect model. The influence of covariates was tested using a stepwise procedure. RESULTS The PK of unbound MPA and MPAG were characterised by a two- and one-compartment model with first-order elimination, respectively. Apparent clearance of uMPA (CLuMPA/F) was estimated to be 852 L/h with a relative standard error (RSE) of 7.1%. The tMPA and uMPA were connected using a linear protein binding model, in which the protein binding rate constant (kB) increased non-linearly with the serum albumin (ALB) concentration. The estimated kB was 53.4 /h (RSE, 2.3%) for patients with ALB of 40 g/L. In addition, model-based simulation showed that changes in ALB substantially affected tMPA but not uMPA exposure. CONCLUSIONS The established model adequately described the population PK characteristics of the uMPA, tMPA, and MPAG. The estimated CLuMPA/F and unbound fraction of MPA (FUMPA) in Chinese kidney transplant recipients were comparable to those published previously in Caucasians. We recommend monitoring uMPA instead of tMPA to optimise mycophenolate mofetil (MMF) dosing for patients with lower ALB levels.

preprint2019arXiv

Holographic complexity of the electromagnetic black hole

In this paper, we use the "complexity equals action" (CA) conjecture to evaluate the holographic complexity in some multiple-horzion black holes for F(Riemann) gravity coupled to a first-order source-free electrodynamics. Motivated by the vanishing result of the purely magnetic black hole founded by Goto $et.\, al$, we investigate the complexity in a static charged black hole with source-free electrodynamics and find that this vanishing feature of the late-time rate is universal for a purely static magnetic black hole. However, this result shows some unexpected features of the late-time growth rate. We show how the inclusion of a boundary term for the first-order electromagnetic field to the total action can make the holographic complexity be well-defined and obtain a general expression of the late-time complexity growth rate with these boundary terms. We apply our late-time result to some explicit cases and show how to choose the proportional constant of these additional boundary terms to make the complexity be well-defined in the zero-charge limit. For the static magnetic black hole in Einstein gravity coupled to a first-order electrodynamics, we find that there is a general relationship between the proper proportional constant and the Lagrangian function $h(\math{F})$ of the electromagnetic field: if $h(\math{F})$ is a convergent function, the choice of the proportional constant is independent on explicit expressions of $h(\math{F})$ and it should be chosen as $4/3$; if $h(\math{F})$ is a divergent function, the proportional constant is dependent on the asymptotic index of the Lagrangian function.

preprint2017arXiv

Towards Automated ICD Coding Using Deep Learning

International Classification of Diseases(ICD) is an authoritative health care classification system of different diseases and conditions for clinical and management purposes. Considering the complicated and dedicated process to assign correct codes to each patient admission based on overall diagnosis, we propose a hierarchical deep learning model with attention mechanism which can automatically assign ICD diagnostic codes given written diagnosis. We utilize character-aware neural language models to generate hidden representations of written diagnosis descriptions and ICD codes, and design an attention mechanism to address the mismatch between the numbers of descriptions and corresponding codes. Our experimental results show the strong potential of automated ICD coding from diagnosis descriptions. Our best model achieves 0.53 and 0.90 of F1 score and area under curve of receiver operating characteristic respectively. The result outperforms those achieved using character-unaware encoding method or without attention mechanism. It indicates that our proposed deep learning model can code automatically in a reasonable way and provide a framework for computer-auxiliary ICD coding.