arXiv subjects

Jin Xu

Publications and source records attributed to Jin Xu.

At least 127 records · Page 7Linked to original sources

arXiv2024

A Local Counter-Regulatory Motif Modulates the Global Phase of Hormonal Oscillations

Counter-regulatory elements maintain dynamic equilibrium ubiquitously in living systems. The most prominent example, which is critical to mammalian survival, is that of pancreatic α and β cells producing glucagon and insulin for glucose homeostasis. These cells are not found in a single gland but are dispersed in multiple micro-organs known as the islets of Langerhans. Within an islet, these two reciprocal cell types interact with each other and with an additional cell type: the δ cell. By testing all possible motifs governing the interactions of these three cell types, we found that a unique set of positive/negative intra-islet interactions between different islet cell types functions not only to reduce the superficially wasteful zero-sum action of glucagon and insulin but also to enhance/suppress the synchronization of hormone secretions between islets under high/normal glucose conditions. This anti-symmetric interaction motif confers effective controllability for network (de)synchronization.

q-bio.TO↗

arXiv2024

Local complexity predicts global synchronization of hierarchically networked oscillators

We study the global synchronization of hierarchically-organized Stuart-Landau oscillators, where each subsystem consists of three oscillators with activity-dependent couplings. We consider all possible coupling signs between the three oscillators, and find that they can generate different numbers of phase attractors depending on the network motif. Here, the subsystems are coupled through mean activities of total oscillators. Under weak inter-subsystem couplings, we demonstrate that the synchronization between subsystems is highly correlated with the number of attractors in uncoupled subsystems. Among the network motifs, perfect anti-symmetric ones are unique to generate both single and multiple attractors depending on the activities of oscillators. The flexible local complexity can make global synchronization controllable.

nlin.AO↗

arXiv2024

Immunological recognition by artificial neural networks

The binding affinity between the T-cell receptors (TCRs) and antigenic peptides mainly determines immunological recognition. It is not a trivial task that T cells identify the digital sequences of peptide amino acids by simply relying on the integrated binding affinity between TCRs and antigenic peptides. To address this problem, we examine whether the affinity-based discrimination of peptide sequences is learnable and generalizable by artificial neural networks (ANNs) that process the digital experimental amino acid sequence information of receptors and peptides. A pair of TCR and peptide sequences correspond to the input for ANNs, while the success or failure of the immunological recognition correspond to the output. The output is obtained by both theoretical model and experimental data. In either case, we confirmed that ANNs could learn the immunological recognition. We also found that a homogenized encoding of amino acid sequence was more effective for the supervised learning task.

q-bio.CB↗

arXiv2024

A Mathematical Proof of the Four-Color Conjecture (1): Transformation Step

The four-color conjecture has puzzled mathematicians for over 170 years and has yet to be proven by purely mathematical methods. This series of articles provides a purely mathematical proof of the four-color conjecture, consisting of two parts: the transformation step and the decycle step. The transformation step uses two innovative tools, contracting and extending operations and unchanged bichromatic cycles, to transform the proof of the four-color conjecture into the decycle problem of 4-base modules. Moreover, the decycle step solves the decycle problem of 4-base modules using two other innovative tools: the color-connected potential and the pocket operations. This article presents the proof of the transformation step.

math.GM↗

arXiv2024

Semantic Arithmetic Coding using Synonymous Mappings

Recent semantic communication methods explore effective ways to expand the communication paradigm and improve the system performance of the communication systems. Nonetheless, the common problem of these methods is that the essence of semantics is not explicitly pointed out and directly utilized. A new epistemology suggests that synonymy, which is revealed as the fundamental feature of semantics, guides the establishment of the semantic information theory from a novel viewpoint. Building on this theoretical basis, this paper proposes a semantic arithmetic coding (SAC) method for semantic lossless compression using intuitive semantic synonymy. By constructing reasonable synonymous mappings and performing arithmetic coding procedures over synonymous sets, SAC can achieve higher compression efficiency for meaning-contained source sequences at the semantic level and thereby approximate the semantic entropy limits. Experimental results on edge texture map compression show an evident improvement in coding efficiency using SAC without semantic losses, compared to traditional arithmetic coding, which demonstrates its effectiveness.

cs.IT↗

arXiv2024

Semantic Huffman Coding using Synonymous Mapping

Semantic communication stands out as a highly promising avenue for future developments in communications. Theoretically, source compression coding based on semantics can achieve lower rates than Shannon entropy. This paper introduces a semantic Huffman coding built upon semantic information theory. By incorporating synonymous mapping and synonymous sets, semantic Huffman coding can achieve shorter average code lengths. Furthermore, we demonstrate that semantic Huffman coding theoretically have the capability to approximate semantic entropy. Experimental results indicate that, under the condition of semantic lossless, semantic Huffman coding exhibits clear advantages in compression efficiency over classical Huffman coding.

cs.IT↗

arXiv2023

Qwen-Audio: Advancing Universal Audio Understanding via Unified Large-Scale Audio-Language Models

Recently, instruction-following audio-language models have received broad attention for audio interaction with humans. However, the absence of pre-trained audio models capable of handling diverse audio types and tasks has hindered progress in this field. Consequently, most existing works have only been able to support a limited range of interaction capabilities. In this paper, we develop the Qwen-Audio model and address this limitation by scaling up audio-language pre-training to cover over 30 tasks and various audio types, such as human speech, natural sounds, music, and songs, to facilitate universal audio understanding abilities. However, directly co-training all tasks and datasets can lead to interference issues, as the textual labels associated with different datasets exhibit considerable variations due to differences in task focus, language, granularity of annotation, and text structure. To overcome the one-to-many interference, we carefully design a multi-task training framework by conditioning on a sequence of hierarchical tags to the decoder for encouraging knowledge sharing and avoiding interference through shared and specified tags respectively. Remarkably, Qwen-Audio achieves impressive performance across diverse benchmark tasks without requiring any task-specific fine-tuning, surpassing its counterparts. Building upon the capabilities of Qwen-Audio, we further develop Qwen-Audio-Chat, which allows for input from various audios and text inputs, enabling multi-turn dialogues and supporting various audio-central scenarios.

eess.AS↗

arXiv2023

Parameter dependence of entanglement spectra in quantum field theories

In this paper, we explore the characteristics of reduced density matrix spectra in quantum field theories. Previous studies mainly focus on the function $\mathcal{P}(λ):=\sum_i δ(λ-λ_i)$, where $λ_i$ denote the eigenvalues of the reduced density matirx. We introduce a series of functions designed to capture the parameter dependencies of these spectra. These functions encompass information regarding the derivatives of eigenvalues concerning the parameters, notably including the function $\mathcal{P}_{α_J}(λ):=\sum_i \frac{\partial λ_i }{\partial α_J}δ(λ-λ_i)$, where $α_J$ denotes the specific parameter. Computation of these functions is achievable through the utilization of Rényi entropy. Intriguingly, we uncover compelling relationships among these functions and demonstrate their utility in constructing the eigenvalues of reduced density matrices for select cases. We perform computations of these functions across several illustrative examples. Specially, we conducted a detailed study of the variations of $\mathcal{P}(λ)$ and $\mathcal{P}_{α_J}(λ)$ under general perturbation, elucidating their physical implications. In the context of holographic theory, we ascertain that the zero point of the function $\mathcal{P}_{α_J}(λ)$ possesses universality, determined as $λ_0=e^{-S}$, where $S$ denotes the entanglement entropy of the reduced density matrix. Furthermore, we exhibit potential applications of these functions in analyzing the properties of entanglement entropy.

hep-th↗

arXiv2023

Best Arm Identification in Batched Multi-armed Bandit Problems

Recently multi-armed bandit problem arises in many real-life scenarios where arms must be sampled in batches, due to limited time the agent can wait for the feedback. Such applications include biological experimentation and online marketing. The problem is further complicated when the number of arms is large and the number of batches is small. We consider pure exploration in a batched multi-armed bandit problem. We introduce a general linear programming framework that can incorporate objectives of different theoretical settings in best arm identification. The linear program leads to a two-stage algorithm that can achieve good theoretical properties. We demonstrate by numerical studies that the algorithm also has good performance compared to certain UCB-type or Thompson sampling methods.

stat.ML↗

arXiv2023

Reducibility of 1-D quantum harmonic oscillator with new unbounded oscillatory perturbations

Enlightened by Lemma 1.7 in \cite{LiangLuo2021}, we prove a similar lemma which is based upon oscillatory integrals and Langer's turning point theory. From it we show that the Schr{ö}dinger equation $${\rm i}\partial_t u = -\partial_x^2 u+x^2 u+ε\langle x\rangle^μ\sum_{k\inΛ}\left(a_k(ωt)\sin(k|x|^β)+b_k(ωt) \cos(k|x|^β)\right) u,\quad u=u(t,x),~x\in\mathbb{R},~ β>1,$$ can be reduced in $\mathcal{H}^1(\mathbb{R})$ to an autonomous system for most values of the frequency vector $ω$, where $Λ\subset\mathbb R\setminus\{0\}$, $|Λ|<\infty$ and $\langle x\rangle:=\sqrt{1+x^2}$. The functions $a_k(θ)$ and $b_k(θ)$ are analytic on $\mathbb T^n_σ$ and $μ\geq 0$ will be chosen according to the value of $β$. Comparing with \cite{LiangLuo2021}, the novelty is that the phase functions of oscillatory integral are more degenerate when $β>1$.

math.AP↗

arXiv2023

Effort Discrimination and Curvature of Contest Technology in Conflict Networks

In a model of interconnected conflicts on a network, we compare the equilibrium effort profiles and payoffs under two scenarios: uniform effort (UE) in which each contestant is restricted to exert the same effort across all the battles she participates, and discriminatory effort (DE) in which such a restriction is lifted. When the contest technology in each battle is of Tullock form, a surprising neutrality result holds within the class of semi-symmetric conflict network structures: both the aggregate actions and equilibrium payoffs under two regimes are the same. We also show that, in some sense, the Tullock form is necessary for such a neutrality result. Moving beyond the Tullock family, we further demonstrate how the curvature of contest technology shapes the welfare and effort effects.

econ.TH↗

arXiv2023

AKE-GNN: Effective Graph Learning with Adaptive Knowledge Exchange

Graph Neural Networks (GNNs) have already been widely used in various graph mining tasks. However, recent works reveal that the learned weights (channels) in well-trained GNNs are highly redundant, which inevitably limits the performance of GNNs. Instead of removing these redundant channels for efficiency consideration, we aim to reactivate them to enlarge the representation capacity of GNNs for effective graph learning. In this paper, we propose to substitute these redundant channels with other informative channels to achieve this goal. We introduce a novel GNN learning framework named AKE-GNN, which performs the Adaptive Knowledge Exchange strategy among multiple graph views generated by graph augmentations. AKE-GNN first trains multiple GNNs each corresponding to one graph view to obtain informative channels. Then, AKE-GNN iteratively exchanges redundant channels in the weight parameter matrix of one GNN with informative channels of another GNN in a layer-wise manner. Additionally, existing GNNs can be seamlessly incorporated into our framework. AKE-GNN achieves superior performance compared with various baselines across a suite of experiments on node classification, link prediction, and graph classification. In particular, we conduct a series of experiments on 15 public benchmark datasets, 8 popular GNN models, and 3 graph tasks and show that AKE-GNN consistently outperforms existing popular GNN models and even their ensembles. Extensive ablation studies and analyses on knowledge exchange methods validate the effectiveness of AKE-GNN.

cs.LG↗

arXiv2023

NP$^2$L: Negative Pseudo Partial Labels Extraction for Graph Neural Networks

How to utilize the pseudo labels has always been a research hotspot in machine learning. However, most methods use pseudo labels as supervised training, and lack of valid assessing for their accuracy. Moreover, applications of pseudo labels in graph neural networks (GNNs) oversee the difference between graph learning and other machine learning tasks such as message passing mechanism. Aiming to address the first issue, we found through a large number of experiments that the pseudo labels are more accurate if they are selected by not overlapping partial labels and defined as negative node pairs relations. Therefore, considering the extraction based on pseudo and partial labels, negative edges are constructed between two nodes by the negative pseudo partial labels extraction (NP$^2$E) module. With that, a signed graph are built containing highly accurate pseudo labels information from the original graph, which effectively assists GNN in learning at the message-passing level, provide one solution to the second issue. Empirical results about link prediction and node classification tasks on several benchmark datasets demonstrate the effectiveness of our method. State-of-the-art performance is achieved on the both tasks.

cs.LG↗

arXiv2023

Qwen Technical Report

Large language models (LLMs) have revolutionized the field of artificial intelligence, enabling natural language processing tasks that were previously thought to be exclusive to humans. In this work, we introduce Qwen, the first installment of our large language model series. Qwen is a comprehensive language model series that encompasses distinct models with varying parameter counts. It includes Qwen, the base pretrained language models, and Qwen-Chat, the chat models finetuned with human alignment techniques. The base language models consistently demonstrate superior performance across a multitude of downstream tasks, and the chat models, particularly those trained using Reinforcement Learning from Human Feedback (RLHF), are highly competitive. The chat models possess advanced tool-use and planning capabilities for creating agent applications, showcasing impressive performance even when compared to bigger models on complex tasks like utilizing a code interpreter. Furthermore, we have developed coding-specialized models, Code-Qwen and Code-Qwen-Chat, as well as mathematics-focused models, Math-Qwen-Chat, which are built upon base language models. These models demonstrate significantly improved performance in comparison with open-source models, and slightly fall behind the proprietary models.

cs.CL↗

arXiv2023

SBcoyote: An Extensible Python-Based Reaction Editor and Viewer

SBcoyote is an open-source cross-platform biochemical reaction viewer and editor released under the liberal MIT license. It is written in Python and uses wxPython to implement the GUI and the drawing canvas. It supports the visualization and editing of compartments, species, and reactions. It includes many options to stylize each of these components. For instance, species can be in different colors and shapes. Other core features include the ability to create alias nodes, alignment of groups of nodes, network zooming, as well as an interactive bird-eye view of the network to allow easy navigation on large networks. A unique feature of the tool is the extensive Python plugin API, where third-party developers can include new functionality. To assist third-party plugin developers, we provide a variety of sample plugins, including, random network generation, a simple auto layout tool, export to Antimony, export SBML, import SBML, etc. Of particular interest are the export and import SBML plugins since these support the SBML level 3 layout and render standard, which is exchangeable with other software packages. Plugins are stored in a GitHub repository, and an included plugin manager can retrieve and install new plugins from the repository on demand. Plugins have version metadata associated with them to make it install plugin updates. Availability: https://github.com/sys-bio/SBcoyote.

q-bio.QM↗

arXiv2023

The Number of Overlapping Customers in Erlang-A Queues: An Asymptotic Approach

In this paper, we investigate the number of customers that overlap or coincide with a virtual customer in an Erlang-A queue. Our study provides a novel approach that exploits fluid and diffusion limits for the queue to approximate the mean and variance of the number of overlapping customers. We conduct a detailed analysis of the fluid and diffusion limit differential equations to derive these approximations. We also construct new accurate approximations for the mean and variance of the waiting time in the Erlang-A queue by combining fluid limits with the polygamma function. Our findings have important implications for queueing theory and evaluating the overlap risk of more complicated service systems.

math.PR↗

arXiv2023

The Whole Pathological Slide Classification via Weakly Supervised Learning

Due to its superior efficiency in utilizing annotations and addressing gigapixel-sized images, multiple instance learning (MIL) has shown great promise as a framework for whole slide image (WSI) classification in digital pathology diagnosis. However, existing methods tend to focus on advanced aggregators with different structures, often overlooking the intrinsic features of H\&E pathological slides. To address this limitation, we introduced two pathological priors: nuclear heterogeneity of diseased cells and spatial correlation of pathological tiles. Leveraging the former, we proposed a data augmentation method that utilizes stain separation during extractor training via a contrastive learning strategy to obtain instance-level representations. We then described the spatial relationships between the tiles using an adjacency matrix. By integrating these two views, we designed a multi-instance framework for analyzing H\&E-stained tissue images based on pathological inductive bias, encompassing feature extraction, filtering, and aggregation. Extensive experiments on the Camelyon16 breast dataset and TCGA-NSCLC Lung dataset demonstrate that our proposed framework can effectively handle tasks related to cancer detection and differentiation of subtypes, outperforming state-of-the-art medical image classification methods based on MIL. The code will be released later.

q-bio.QM↗

arXiv2023

OTFDM: A Novel 2D Modulation Waveform Modeling Dot-product Doubly-selective Channel

Recently, a two-dimension (2D) modulation waveform of orthogonal time-frequency-space (OTFS) has been a popular 6G candidate to replace existing orthogonal frequency division multiplexing (OFDM). The extensive OTFS researches help to make both the advantages and limitations of OTFS more and more clear. The limitations are not easy to overcome as they come from OTFS on-grid 2D convolution channel model. Instead of solving OTFS inborn challenges, this paper proposes a novel 2D modulation waveform named orthogonal time-frequency division multiplexing (OTFDM). OTFDM uses a 2D dot-product channel model to cope with doubly-selectivity. Compared with OTFS, OTFDM supports grid-free channel delay and Doppler and gains a simple and efficient 2D equalization. The concise dot-division equalization can be easily combined with MIMO. The simulation result shows that OTFDM is able to bear high mobility and greatly outperforms OFDM in doubly-selective channel.

eess.SP↗