arXiv subjects

Yu Zhang

Publications and source records attributed to Yu Zhang.

At least 793 records · Page 44Linked to original sources

arXiv2024

Additive and subtractive bases of $ \mathbb{Z}_m$ in average

Given a positive integer $m$, let $\mathbb{Z}_m$ be the set of residue classes mod $m$. For $A\subseteq \mathbb{Z}_m$ and $n\in \mathbb{Z}_m$, let $σ_A(n)$ be the number of solutions to the equation $n=x+y$ with $x,y\in A$. Let $\mathcal{H}_m$ be the set of subsets $A\subseteq \mathbb{Z}_m$ such that $σ_A(n)\geq1$ for all $n\in \mathbb{Z}_m$. Let $$ \ell_m=\min\limits_{A\in \mathcal{H}_m}\left\lbrace m^{-1}\sum_{n\in \mathbb{Z}_m}σ_A(n)\right\rbrace. $$ Following a prior result of Ding and Zhao on Ruzsa's number, we know that $$ \limsup_{m\rightarrow\infty}\ell_m\le 192. $$ Ding and Zhao then asked possible improvements on this value. In this paper, we prove $$ \limsup\limits_{m\rightarrow\infty}\ell_m\leq 144. $$ Moreover, parallel results on subtractive bases of $ \mathbb{Z}_m$ were also investigated here.

math.NT↗

arXiv2024

Spin/Phonon Dynamics in Single Molecular Magnets: II. spin/phonon entanglemen

We introduce a new quantum embedding method to explore spin-phonon interactions in molecular magnets. This technique consolidates various spin/phonon couplings into a limited number of collective degrees of freedom, allowing for a fully quantum mechanical treatment. By precisely factorizing the entire system into "system" and "bath" sub-ensembles, our approach simplifies a previously intractable problem, making it solvable on modest-scale computers. We demonstrate the effectiveness of this method by studying the spin relaxation and dephasing times of the single-molecule qubit \ce{VOPc(OH)8}, which features a lone unpaired electron on the central vanadium atom. By using this mode projection method, we are able to perform numerical exact quantum dynamical calculation on this system which allows us to follow the flow of quantum information from the single spin qubit into the projected phonon degrees of freedom. Our results demonstrate both the utility of the method and suggest how one can engineer the environment as to further optimize the quantum properties of a qubit system.

quant-ph↗

arXiv2024

Spin/Phonon Dynamics in Single Molecular Magnets: I. quantum embedding

Single molecular magnets (SMMs) and Metal-Organic Frameworks (MOFs) attract significant interest due to their potential in quantum information processing, scalable quantum computing, and extended lifetimes and coherence times. The limiting factor in these systems is often the spin dephasing caused by interactions and couplings with the vibrational motions of the molecular framework. This work introduces a systematic projection/embedding scheme to analyze spin-phonon dynamics in molecular magnets. This scheme consolidates all spin/phonon couplings into a few collective degrees of freedom. quantum mechanically. Using parameters obtained from ab initio methods for spin/phonon coupling via Zeeman interaction, we apply this approach to compute the electronic spin relaxation times for a single-molecule qubit \ce{VOPc(OH)8}, which features a single unpaired electron localized on the central vanadium atom. However, our general embedding scheme can be applied to any single-molecule magnet or qubit MOF with any coupling/interaction Hamiltonian. This development offers a crucial tool for simulating spin relaxation in complex environments with significantly reduced computational complexity.

quant-ph↗

arXiv2024

Multiple scattering and diffusion of scalar coherent waves in a group of small spheroidal particles with random orientations

In this manuscript we study multiple scattering and diffusion of scalar wave in a group of monodisperse spheroidal particles with random orientations. We begin by fixing a spheroid in a prolate spheroidal coordinate system, and attain the expansion of the scalar Green's function in this space. The expansion is firstly based on spheroidal wave functions, and then we transform it into the expansion of spherical wave functions. Next, we average the Green's function over the orientations of the spheroid to get the averaged transition operator. Finally, we calculate the transport mean free path and anisotropy factor for the spheroidal particles group, based on the irreducible vertex in the Bethe-Salpeter equation. The approaches to get the average transition operator and the mean free paths in this manuscript will be of benefit to the research area of multiple scattering by non-spherical particles.

physics.optics↗

arXiv2024

Mixture of Cluster-conditional LoRA Experts for Vision-language Instruction Tuning

Instruction tuning of Large Vision-language Models (LVLMs) has revolutionized the development of versatile models with zero-shot generalization across a wide range of downstream vision-language tasks. However, the diversity of training tasks of different sources and formats would lead to inevitable task conflicts, where different tasks conflict for the same set of model parameters, resulting in sub-optimal instruction-following abilities. To address that, we propose the Mixture of Cluster-conditional LoRA Experts (MoCLE), a novel Mixture of Experts (MoE) architecture designed to activate the task-customized model parameters based on the instruction clusters. A separate universal expert is further incorporated to improve generalization capabilities of MoCLE for novel instructions. Extensive experiments on InstructBLIP and LLaVA demonstrate the effectiveness of MoCLE.

cs.CV↗

arXiv2024

Origin of extended Main Sequence Turn Off in open cluster NGC 2355

The presence of extended Main Sequence Turn-Off (eMSTO) in the open clusters has been attributed to various factors, such as spread in rotation rates, binary stars, and dust-like extinction from stellar excretion discs. We present a comprehensive analysis of the eMSTO in the open cluster NGC 2355. Using spectra from the Gaia-ESO archives, we find that the stars in the red part of the eMSTO have a higher mean v sin i value of 135.3$\pm$4.6 km s$^{-1}$ compared to the stars in the blue part that have an average v sin i equal to 81.3$\pm$5.6 km s$^{-1}$. This suggests that the eMSTO in NGC 2355 is possibly caused by the spread in rotation rates of stars. We do not find any substantial evidence of the dust-like extinction from the eMSTO stars using ultraviolet data from the Swift survey. The estimated synchronization time for low mass ratio close binaries in the blue part of the eMSTO suggests that they would be mostly slow-rotating if present. However, the stars in the blue part of the eMSTO are preferentially located in the outer region of the cluster indicating that they may lack low mass ratio close binaries. The spread in rotation rates of eMSTO stars in NGC 2355 is most likely caused by the star-disc interaction mechanism. The stars in the lower main sequence beyond the eMSTO region of NGC 2355 are slow-rotating (mean v sin i = 26.5$\pm$1.3 km s$^{-1}$) possibly due to the magnetic braking of their rotations.

astro-ph.SR↗

arXiv2024

Quantum voting machine encoded with microwave photons

We propose a simple quantum voting machine using microwave photon qubit encoding, based on a setup comprising multiple microwave cavities and a coupled superconducting flux qutrit. This approach primarily relies on a multi-control single-target quantum phase gate. The scheme offers operational simplicity, requiring only a single step, while ensuring verifiability through the measurement of a single qubit phase information to obtain the voting results. And it provides voter anonymity, as the voting outcome is solely tied to the total number of affirmative votes. Our quantum voting machine also has scalability in terms of the number of voters. Additionally, the physical realization of the quantum voting machine is general and not limited to circuit QED. Quantum voting machine can be implemented as long as the multi-control single-phase quantum phase gate is realized in other physical systems. Numerical simulations indicate the feasibility of this quantum voting machine within the current quantum technology.

quant-ph↗

arXiv2024

Learning Retrieval Augmentation for Personalized Dialogue Generation

Personalized dialogue generation, focusing on generating highly tailored responses by leveraging persona profiles and dialogue context, has gained significant attention in conversational AI applications. However, persona profiles, a prevalent setting in current personalized dialogue datasets, typically composed of merely four to five sentences, may not offer comprehensive descriptions of the persona about the agent, posing a challenge to generate truly personalized dialogues. To handle this problem, we propose $\textbf{L}$earning Retrieval $\textbf{A}$ugmentation for $\textbf{P}$ersonalized $\textbf{D}$ial$\textbf{O}$gue $\textbf{G}$eneration ($\textbf{LAPDOG}$), which studies the potential of leveraging external knowledge for persona dialogue generation. Specifically, the proposed LAPDOG model consists of a story retriever and a dialogue generator. The story retriever uses a given persona profile as queries to retrieve relevant information from the story document, which serves as a supplementary context to augment the persona profile. The dialogue generator utilizes both the dialogue history and the augmented persona profile to generate personalized responses. For optimization, we adopt a joint training framework that collaboratively learns the story retriever and dialogue generator, where the story retriever is optimized towards desired ultimate metrics (e.g., BLEU) to retrieve content for the dialogue generator to generate personalized responses. Experiments conducted on the CONVAI2 dataset with ROCStory as a supplementary data source show that the proposed LAPDOG method substantially outperforms the baselines, indicating the effectiveness of the proposed method. The LAPDOG model code is publicly available for further exploration. https://github.com/hqsiswiliam/LAPDOG

cs.CL↗

arXiv2024

Selective Prompting Tuning for Personalized Conversations with LLMs

In conversational AI, personalizing dialogues with persona profiles and contextual understanding is essential. Despite large language models' (LLMs) improved response coherence, effective persona integration remains a challenge. In this work, we first study two common approaches for personalizing LLMs: textual prompting and direct fine-tuning. We observed that textual prompting often struggles to yield responses that are similar to the ground truths in datasets, while direct fine-tuning tends to produce repetitive or overly generic replies. To alleviate those issues, we propose \textbf{S}elective \textbf{P}rompt \textbf{T}uning (SPT), which softly prompts LLMs for personalized conversations in a selective way. Concretely, SPT initializes a set of soft prompts and uses a trainable dense retriever to adaptively select suitable soft prompts for LLMs according to different input contexts, where the prompt retriever is dynamically updated through feedback from the LLMs. Additionally, we propose context-prompt contrastive learning and prompt fusion learning to encourage the SPT to enhance the diversity of personalized conversations. Experiments on the CONVAI2 dataset demonstrate that SPT significantly enhances response diversity by up to 90\%, along with improvements in other critical performance indicators. Those results highlight the efficacy of SPT in fostering engaging and personalized dialogue generation. The SPT model code (https://github.com/hqsiswiliam/SPT) is publicly available for further exploration.

cs.CL↗

arXiv2024

An Improved Algorithm to Identify More Arbitrage Opportunities on Decentralized Exchanges

In decentralized exchanges (DEXs), the arbitrage paths exist abundantly in the form of both arbitrage loops (e.g. the arbitrage path starts from token A and back to token A again in the end, A, B,..., A) and non-loops (e.g. the arbitrage path starts from token A and stops at a different token N, A, B,..., N). The Moore-Bellman-Ford algorithm, often coupled with the ``walk to the root" technique, is commonly employed for detecting arbitrage loops in the token graph of decentralized exchanges (DEXs) such as Uniswap. However, a limitation of this algorithm is its ability to recognize only a limited number of arbitrage loops in each run. Additionally, it cannot specify the starting token of the detected arbitrage loops, further constraining its effectiveness in certain scenarios. Another limitation of this algorithm is its incapacity to detect non-loop arbitrage paths between any specified pairs of tokens. In this paper, we develop a new method to solve these problems by combining the line graph and a modified Moore-Bellman-Ford algorithm (MMBF). This method can help to find more arbitrage loops by detecting at least one arbitrage loop starting from any specified tokens in the DEXs and can detect the non-loop arbitrage paths between any pair of tokens. Then, we applied our algorithm to Uniswap V2 and found more arbitrage loops and non-loops indeed compared with applying the Moore-Bellman-Ford (MBF) combined algorithm. The found arbitrage profit by our method in some arbitrage paths can be even as high as one million dollars, far larger than that found by the MBF combined algorithm. Finally, we statistically compare the distribution of arbitrage path lengths and the arbitrage profit detected by both our method and the MBF combined algorithm, and depict how potential arbitrage opportunities change with time by our method.

q-fin.CP↗

arXiv2024

Velocity, Holding Time and Lifespan of Cryptocurrency in Transactions

The measurement of the velocity of money is still a significant topic. In this paper, we proposed a method to calculate the velocity of money by combining the holding-time distribution and lifespan distribution. By derivation, the velocity of money equals the holding-time distribution's value at zero. When we have much holding-time data, this problem can be converted to a regression problem. After a numeric simulation, we find that the calculating accuracy is high even if we used only a small part of the holding time data, which implies a potential application in measuring the velocity of money in reality, such as digital money. We also tested the methods on Cardano and found that the method can also provide a reasonable estimation of velocity in some cases.

econ.GN↗

arXiv2024

Profit Maximization In Arbitrage Loops

Cyclic arbitrage chances exist abundantly among decentralized exchanges (DEXs), like Uniswap V2. For an arbitrage cycle (loop), researchers or practitioners usually choose a specific token, such as Ether as input, and optimize their input amount to get the net maximal amount of the specific token as arbitrage profit. By considering the tokens' prices from CEXs in this paper, the new arbitrage profit, called monetized arbitrage profit, will be quantified as the product of the net number of a specific token we got from the arbitrage loop and its corresponding price in CEXs. Based on this concept, we put forward three different strategies to maximize the monetized arbitrage profit for each arbitrage loop. The first strategy is called the MaxPrice strategy. Under this strategy, arbitrageurs start arbitrage only from the token with the highest CEX price. The second strategy is called the MaxMax strategy. Under this strategy, we calculate the monetized arbitrage profit for each token as input in turn in the arbitrage loop. Then, we pick up the most maximal monetized arbitrage profit among them as the monetized arbitrage profit of the MaxMax strategy. The third one is called the Convex Optimization strategy. By mapping the MaxMax strategy to a convex optimization problem, we proved that the Convex Optimization strategy could get more profit in theory than the MaxMax strategy, which is proved again in a given example. We also proved that if no arbitrage profit exists according to the MaxMax strategy, then the Convex Optimization strategy can not detect any arbitrage profit, either. However, the empirical data analysis denotes that the profitability of the Convex Optimization strategy is almost equal to that of the MaxMax strategy, and the MaxPrice strategy is not reliable in getting the maximal monetized arbitrage profit compared to the MaxMax strategy.

q-fin.CP↗

arXiv2024

Direct Production of Light Scalar in the Type-I Two-Higgs-Doublet Model at the Lifetime Frontier of LHC

A light pseudoscalar $A$ in the sufficient large $\tanβ$ region of type-I two-Higgs-doublet model (2HDM) can be naturally a long-lived particle (LLP). We focus on $H^{\pm}A$, $HA$ and $AA$ pair productions via the electroweak processes mediated by the bosons at the LHC, including $pp \rightarrow W^\pm/Z \rightarrow H^{\pm}/H A$ and $pp \rightarrow h \rightarrow AA$ at the 14 TeV LHC. The possibility of probing $A$ as a LLP at the FASER-2, FACET, MoEDAL-MAPP-2, MATHUSLA is discussed. We find that FASER-2 fails to probe any parameter space within 0.2 GeV $< m_A <$ 10 GeV for all the considered processes. For 130 $< m_{H\pm} = m_H <$ 400 GeV, FACET, MoEDAL-MAPP-2 and MATHUSLA can probe $\tan β\lesssim 10^{4-6}$ for $m_A \lesssim 3$ GeV, and $\tan β\lesssim 10^{6-8}$ for 3 GeV $\lesssim m_A <$ 10 GeV from $pp \rightarrow W^\pm/Z \rightarrow H^{\pm}/Z A$ processes. And $pp \rightarrow h \rightarrow AA$ process covers similar parameter space. All processes can surpass the current limits.

hep-ph↗

arXiv2024

Ultrafast carrier dynamics throughout the three-dimensional Brillouin zone of the Weyl semimetal PtBi$_2$

Using time- and angle-resolved photoemission spectroscopy, we examine the unoccupied electronic structure and electron dynamics of the type-I Weyl semimetal PtBi$_2$. Using the ability to change the probe photon energy over a wide range, we identify the predicted Weyl points in the unoccupied three-dimensional band structure and we discuss the effect of $k_\perp$ broadening in the normally unoccupied states. We characterise the electron dynamics close to the Weyl point and in other parts of three-dimensional Brillouin zone using $k$-means, an unsupervised machine learning technique. This reveals distinct differences -- in particular, dynamics that are faster in the parts of the Brillouin zone that host most of the bulk Fermi surface than in parts close to the Weyl points.

cond-mat.str-el↗

arXiv2024

Poetry2Image: An Iterative Correction Framework for Images Generated from Chinese Classical Poetry

Text-to-image generation models often struggle with key element loss or semantic confusion in tasks involving Chinese classical poetry.Addressing this issue through fine-tuning models needs considerable training costs. Additionally, manual prompts for re-diffusion adjustments need professional knowledge. To solve this problem, we propose Poetry2Image, an iterative correction framework for images generated from Chinese classical poetry. Utilizing an external poetry dataset, Poetry2Image establishes an automated feedback and correction loop, which enhances the alignment between poetry and image through image generation models and subsequent re-diffusion modifications suggested by large language models (LLM). Using a test set of 200 sentences of Chinese classical poetry, the proposed method--when integrated with five popular image generation models--achieves an average element completeness of 70.63%, representing an improvement of 25.56% over direct image generation. In tests of semantic correctness, our method attains an average semantic consistency of 80.09%. The study not only promotes the dissemination of ancient poetry culture but also offers a reference for similar non-fine-tuning methods to enhance LLM generation.

cs.CV↗

arXiv2024

Three-dimensional quantum Griffiths singularity in bulk iron-pnictide superconductors

The quantum Griffiths singularity (QGS) is a phenomenon driven by quenched disorders that break conventional scaling invariance and result in a divergent dynamical critical exponent during quantum phase transitions (QPT). While this phenomenon has been well-documented in low-dimensional conventional superconductors and in three-dimensional (3D) magnetic metal systems, its presence in 3D superconducting systems and in unconventional high-temperature superconductors (high-Tc SCs) remains unclear. In this study, we report the observation of robust QGS in the superconductor-metal transition (SMT) of both quasi-2D and 3D anisotropic unconventional high-Tc superconductor CaFe1-xNixAsF (x < 5%) bulk single crystals, where the QGS states persist to up to 5.3 K. A comprehensive quantum phase diagram is established that delineates the 3D anisotropic QGS of SMT induced by perpendicular and parallel magnetic field. Our findings reveal the universality of QGS in 3D superconducting systems and unconventional high-Tc SCs, thereby substantially expanding the range of applicability of QGS.

cond-mat.str-el↗

arXiv2024

Multi-reference Quantum Davidson Algorithm for Quantum Dynamics

Simulating quantum systems is one of the most promising tasks where quantum computing can potentially outperform classical computing. However, the robustness needed for reliable simulations of medium to large systems is beyond the reach of existing quantum devices. To address this, Quantum Krylov Subspace (QKS) methods have been developed, enhancing the ability to perform accelerated simulations on noisy intermediate-scale quantum computers. In this study, we introduce and evaluate two QKS methods derived from the QDavidson algorithm, a novel approach for determining the ground and excited states of many-body systems. Unlike other QKS methods that pre-generate the Krylov subspace through real- or imaginary-time evolution, QDavidson iteratively adds basis vectors into the Krylov subspace. This iterative process enables faster convergence with fewer iterations and necessitates shallower circuit depths, marking a significant advancement in the field of quantum simulation.

quant-ph↗

arXiv2024

On Security Weaknesses and Vulnerabilities in Deep Learning Systems

The security guarantee of AI-enabled software systems (particularly using deep learning techniques as a functional core) is pivotal against the adversarial attacks exploiting software vulnerabilities. However, little attention has been paid to a systematic investigation of vulnerabilities in such systems. A common situation learned from the open source software community is that deep learning engineers frequently integrate off-the-shelf or open-source learning frameworks into their ecosystems. In this work, we specifically look into deep learning (DL) framework and perform the first systematic study of vulnerabilities in DL systems through a comprehensive analysis of identified vulnerabilities from Common Vulnerabilities and Exposures (CVE) and open-source DL tools, including TensorFlow, Caffe, OpenCV, Keras, and PyTorch. We propose a two-stream data analysis framework to explore vulnerability patterns from various databases. We investigate the unique DL frameworks and libraries development ecosystems that appear to be decentralized and fragmented. By revisiting the Common Weakness Enumeration (CWE) List, which provides the traditional software vulnerability related practices, we observed that it is more challenging to detect and fix the vulnerabilities throughout the DL systems lifecycle. Moreover, we conducted a large-scale empirical study of 3,049 DL vulnerabilities to better understand the patterns of vulnerability and the challenges in fixing them. We have released the full replication package at https://github.com/codelzz/Vulnerabilities4DLSystem. We anticipate that our study can advance the development of secure DL systems.

cs.SE↗