Catalog footprint

What is connected

27works
19topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

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

Published work

27 published item(s)

preprint2026arXiv

DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning

General reasoning represents a long-standing and formidable challenge in artificial intelligence. Recent breakthroughs, exemplified by large language models (LLMs) and chain-of-thought prompting, have achieved considerable success on foundational reasoning tasks. However, this success is heavily contingent upon extensive human-annotated demonstrations, and models' capabilities are still insufficient for more complex problems. Here we show that the reasoning abilities of LLMs can be incentivized through pure reinforcement learning (RL), obviating the need for human-labeled reasoning trajectories. The proposed RL framework facilitates the emergent development of advanced reasoning patterns, such as self-reflection, verification, and dynamic strategy adaptation. Consequently, the trained model achieves superior performance on verifiable tasks such as mathematics, coding competitions, and STEM fields, surpassing its counterparts trained via conventional supervised learning on human demonstrations. Moreover, the emergent reasoning patterns exhibited by these large-scale models can be systematically harnessed to guide and enhance the reasoning capabilities of smaller models.

preprint2026arXiv

From Bench to Bedside: A Review of Clinical Trials in Drug Discovery and Development

Clinical trials are an indispensable part of the drug development process, bridging the gap between basic research and clinical application. During the development of new drugs, clinical trials are used not only to evaluate the safety and efficacy of the drug but also to explore its dosage, treatment regimens, and potential side effects. This review discusses the various stages of clinical trials, including Phase I (safety assessment), Phase II (preliminary efficacy evaluation), Phase III (large-scale validation), and Phase IV (post-marketing surveillance), highlighting the characteristics of each phase and their interrelationships. Additionally, the paper addresses the major challenges encountered in clinical trials, such as ethical issues, subject recruitment difficulties, diversity and representativeness concerns, and proposes strategies for overcoming these challenges. With the advancement of technology, innovative technologies such as artificial intelligence, big data, and digitalization are gradually transforming clinical trial design and implementation, improving trial efficiency and data quality. The article also looks forward to the future of clinical trials, particularly the impact of emerging therapies such as gene therapy and immunotherapy on trial design, as well as the importance of regulatory reforms and global collaboration. In conclusion, the core role of clinical trials in drug development will continue to drive the progress of innovative drug development and clinical treatment.

preprint2026arXiv

From In Silico to In Vitro: A Comprehensive Guide to Validating Bioinformatics Findings

The integration of bioinformatics predictions and experimental validation plays a pivotal role in advancing biological research, from understanding molecular mechanisms to developing therapeutic strategies. Bioinformatics tools and methods offer powerful means for predicting gene functions, protein interactions, and regulatory networks, but these predictions must be validated through experimental approaches to ensure their biological relevance. This review explores the various methods and technologies used for experimental validation, including gene expression analysis, protein-protein interaction verification, and pathway validation. We also discuss the challenges involved in translating computational predictions to experimental settings and highlight the importance of collaboration between bioinformatics and experimental research. Finally, emerging technologies, such as CRISPR gene editing, next-generation sequencing, and artificial intelligence, are shaping the future of bioinformatics validation and driving more accurate and efficient biological discoveries.

preprint2026arXiv

SSDA: Bridging Spectral and Structural Gaps via Dual Adaptation for Vision-Based Time Series Forecasting

Large vision models (LVMs) have recently proven to be surprisingly effective time series forecasters, simply by rendering temporal data as images. This success, how ever, rests on a largely unexamined premise: the rendered time series images are sufficiently close to natural images for knowledge in pre-trained models to transfer effectively. We argue that two gaps still remain, i.e., spectral and structural gaps, fundamentally limiting the potential of LVMs for time series forecasting. Spectrally, we systematically reveal that rendered time series images exhibit a markedly shallower power spectrum than the natural images LVMs are pre-trained to recognize. Structurally, reshaping 1D temporal sequences into 2D grids fabricates spurious spatial adjacencies while severing genuine temporal continuities, misleading the spatial inductive biases of pre-trained LVMs. To bridge these gaps, we propose SSDA, a dual-branch network that spectrally and structurally adapts to unlock the full potential of LVMs for time series forecasting. At the data level, a Spectral Magnitude Aligner (SMA) applies 2D FFT to selectively enhance the magnitude spectrum toward natural-image statistics while preserving phase. At the model level, a Structural-Guided Low-Rank Adaptation (SG-LoRA) injects position-aware temporal encodings into patch embeddings and adapts at tention via low-rank updates. The two branches are further adaptively fused to produce the final forecast. Extensive experiments on seven real-world benchmarks demonstrate that SSDA consistently outperforms strong LVM- and LLM-based baselines under both full-shot and few-shot settings. Code is publicly available at https://anonymous.4open.science/r/SSDA-8C5B.

preprint2024arXiv

DeepSeek LLM: Scaling Open-Source Language Models with Longtermism

The rapid development of open-source large language models (LLMs) has been truly remarkable. However, the scaling law described in previous literature presents varying conclusions, which casts a dark cloud over scaling LLMs. We delve into the study of scaling laws and present our distinctive findings that facilitate scaling of large scale models in two commonly used open-source configurations, 7B and 67B. Guided by the scaling laws, we introduce DeepSeek LLM, a project dedicated to advancing open-source language models with a long-term perspective. To support the pre-training phase, we have developed a dataset that currently consists of 2 trillion tokens and is continuously expanding. We further conduct supervised fine-tuning (SFT) and Direct Preference Optimization (DPO) on DeepSeek LLM Base models, resulting in the creation of DeepSeek Chat models. Our evaluation results demonstrate that DeepSeek LLM 67B surpasses LLaMA-2 70B on various benchmarks, particularly in the domains of code, mathematics, and reasoning. Furthermore, open-ended evaluations reveal that DeepSeek LLM 67B Chat exhibits superior performance compared to GPT-3.5.

preprint2024arXiv

Hilbert Poincaré series and kernels for products of $L$-functions

We study Hilbert Poincaré series associated to general seed functions and construct Cohen's kernels and double Eisenstein series as series of Hilbert Poincaré series. Then we calculate the Rankin-Cohen brackets of Hilbert Poincaré series and Hilbert modular forms and extend Zagier's kernel formula to totally real number fields. Finally, we show that the Rankin-Cohen brackets of two different types of Eisenstein series are special values of double Eisenstein series up to a constant.

preprint2024arXiv

MX: Enhancing RISC-V's Vector ISA for Ultra-Low Overhead, Energy-Efficient Matrix Multiplication

Dense Matrix Multiplication (MatMul) is arguably one of the most ubiquitous compute-intensive kernels, spanning linear algebra, DSP, graphics, and machine learning applications. Thus, MatMul optimization is crucial not only in high-performance processors but also in embedded low-power platforms. Several Instruction Set Architectures (ISAs) have recently included matrix extensions to improve MatMul performance and efficiency at the cost of added matrix register files and units. In this paper, we propose Matrix eXtension (MX), a lightweight approach that builds upon the open-source RISC-V Vector (RVV) ISA to boost MatMul energy efficiency. Instead of adding expensive dedicated hardware, MX uses the pre-existing vector register file and functional units to create a hybrid vector/matrix engine at a negligible area cost (< 3%), which comes from a compact near-FPU tile buffer for higher data reuse, and no clock frequency overhead. We implement MX on a compact and highly energy-optimized RVV processor and evaluate it in both a Dual- and 64-Core cluster in a 12-nm technology node. MX boosts the Dual-Core's energy efficiency by 10% for a double-precision 64x64x64 matrix multiplication with the same FPU utilization (~97%) and by 25% on the 64-Core cluster for the same benchmark on 32-bit data, with a 56% performance gain.

preprint2022arXiv

Soft Tiles: Capturing Physical Implementation Flexibility for Tightly-Coupled Parallel Processing Clusters

Modern high-performance computing architectures (Multicore, GPU, Manycore) are based on tightly-coupled clusters of processing elements, physically implemented as rectangular tiles. Their size and aspect ratio strongly impact the achievable operating frequency and energy efficiency, but they should be as flexible as possible to achieve a high utilization for the top-level die floorplan. In this paper, we explore the flexibility range for a high-performance cluster of RISC-V cores with shared L1 memory used to build scalable accelerators, with the goal of establishing a hierarchical implementation methodology where clusters can be modeled as soft tiles to achieve optimal die utilization.

preprint2021arXiv

Multi-Task Variational Information Bottleneck

Multi-task learning (MTL) is an important subject in machine learning and artificial intelligence. Its applications to computer vision, signal processing, and speech recognition are ubiquitous. Although this subject has attracted considerable attention recently, the performance and robustness of the existing models to different tasks have not been well balanced. This article proposes an MTL model based on the architecture of the variational information bottleneck (VIB), which can provide a more effective latent representation of the input features for the downstream tasks. Extensive observations on three public data sets under adversarial attacks show that the proposed model is competitive to the state-of-the-art algorithms concerning the prediction accuracy. Experimental results suggest that combining the VIB and the task-dependent uncertainties is a very effective way to abstract valid information from the input features for accomplishing multiple tasks.

preprint2020arXiv

Simultaneous nonvanishing of the Products of L-functions associated to elliptic cusp forms

A generalized Riemann hypothesis states that all zeros of the completed Hecke $L$-function $L^*(f,s)$ of a normalized Hecke eigenform $f$ on the full modular group should lie on the vertical line $Re(s)=\frac{k}{2}.$ It was shown by Kohnen that there exists a Hecke eigenform $f$ of weight $k$ such that $L^*(f,s) \neq 0$ for sufficiently large $k$ and any point on the line segments $Im(s)=t_0, \frac{k-1}{2} < Re(s) < \frac{k}{2}-ε, \frac{k }{2}+ε< Re(s) < \frac{k+1}{2},$ for any given real number $t_0$ and a positive real number $ε.$ This paper concerns the non-vanishing of the product $L^*(f,s)L^*(f,w)$ $(s,w\in \mathbb{C})$ on average.

preprint2015arXiv

Cohomology of $SL_2$ and related structures

Let $SL_2$ be the rank one simple algebraic group defined over an algebraically closed field $k$ of characteristic $p>0$. The paper presents a new method for computing the dimension of the cohomology spaces $\text{H}^n(SL_2,V(m))$ for Weyl $SL_2$-modules $V(m)$. We provide a closed formula for $\text{dim}\text{H}^n(SL_2,V(m))$ when $n\le 2p-3$ and show that this dimension is bounded by the $(n+1)$-th Fibonacci number. This formula is then used to compute $\text{dim}\text{H}^n(SL_2, V(m))$ for $n=1, 2,$ or $3$. For $n>2p-3$, an exponential bound, only depending on $n$, is obtained for $\text{dim}\text{H}^n(SL_2,V(m))$. Analogous results are also established for the extension spaces $\text{Ext}^n_{SL_2}(V(m_2),V(m_1))$ between Weyl modules $V(m_1)$ and $V(m_2)$. In particular, we determine the degree three extensions for all Weyl modules of $SL_2$. As a byproduct, our results and techniques give explicit upper bounds for the dimensions of the cohomology of the Specht modules of symmetric groups, the cohomology of simple modules of $SL_2$, and the finite group of Lie type $SL_2(p^s)$.

preprint2015arXiv

Divisibility properties for weakly holomorphic modular forms with sign vectors

In this paper, we prove some divisibility results for the Fourier coefficients of reduced modular forms of sign vectors. More precisely, we generalize a divisibility result of Siegel on constant terms when the weight is non-positive, which is related to the weight of Borcherds lifts when the weight is zero. By considering Hecke operators for the spaces of weakly holomorphic modular forms with sign vectors, and obtain divisibility results in an "orthogonal" direction on reduced modular forms.

preprint2014arXiv

An Isomorphism between Scalar-Valued Modular Forms and Modular Forms for Weil Representations

In this note, we consider discriminant forms that are given by the norm form of real quadratic fields and their induced Weil representations. We prove that there exists an isomorphism between the space of vector-valued modular forms for the Weil representations that are invariant under the action of the automorphism group and the space of scalar-valued modular forms that satisfy some epsilon-condition, with which we translate Borcherds's theorem of obstructions to scalar-valued modular forms. In the end, we consider an example in the case of level 12.

preprint2014arXiv

Emergence of Cooperation in Non-scale-free Networks

Evolutionary game theory is one of the key paradigms behind many scientific disciplines from science to engineering. Previous studies proposed a strategy updating mechanism, which successfully demonstrated that the scale-free network can provide a framework for the emergence of cooperation. Instead, individuals in random graphs and small-world networks do not favor cooperation under this updating rule. However, a recent empirical result shows the heterogeneous networks do not promote cooperation when humans play a Prisoner's Dilemma. In this paper, we propose a strategy updating rule with payoff memory. We observe that the random graphs and small-world networks can provide even better frameworks for cooperation than the scale-free networks in this scenario. Our observations suggest that the degree heterogeneity may be neither a sufficient condition nor a necessary condition for the widespread cooperation in complex networks. Also, the topological structures are not sufficed to determine the level of cooperation in complex networks.

preprint2014arXiv

Fence-sitters Protect Cooperation in Complex Networks

Evolutionary game theory is one of the key paradigms behind many scientific disciplines from science to engineering. In complex networks, because of the difficulty of formulating the replicator dynamics, most of previous studies are confined to a numerical level. In this paper, we introduce a vectorial formulation to derive three classes of individuals' payoff analytically. The three classes are pure cooperators, pure defectors, and fence-sitters. Here, fence-sitters are the individuals who change their strategies at least once in the strategy evolutionary process. As a general approach, our vectorial formalization can be applied to all the two-strategies games. To clarify the function of the fence-sitters, we define a parameter, payoff memory, as the number of rounds that the individuals' payoffs are aggregated. We observe that the payoff memory can control the fence-sitters' effects and the level of cooperation efficiently. Our results indicate that the fence-sitters' role is nontrivial in the complex topologies, which protects cooperation in an indirect way. Our results may provide a better understanding of the composition of cooperators in a circumstance where the temptation to defect is larger.

preprint2014arXiv

Zagier duality and integrality for Fourier coefficients for weakly holomorphic modular forms

In this note, we generalize the isomorphisms to the case when the discriminant form is not necessarily induced from real quadratic fields. In particular, this general setting includes all the subspaces with epsilon-conditions, only two spacial cases of which were treated before. With this established, we shall prove the Zagier duality for canonical bases. Finally, we raise a question on the integrality of the Fourier coefficients of these bases elements, or equivalently we concern the existence of a Miller-like basis for vector valued modular forms.

preprint2013arXiv

Fulde-Ferrell-Larkin-Ovchinnikov Phases in Two-dimensional Spin-Orbit Coupled Degenerate Fermi Gases

The Fulde-Ferrell-Larkin-Ovchinnikov (FFLO) phase, a superconducting state with non-zero total momentum Cooper pairs in a strong magnetic field, was predicted more than 50 years ago and now becomes an important concept in many branches of physics. However, no unambiguous experimental evidences for the existence of FFLO phases have been observed yet. Recently, spin-imbalanced ultracold degenerate Fermi gases have emerged as a new powerful platform for the observation of FFLO phases due to their high experimental controllability and the lack of disorder. However, in three dimensional degenerate Fermi gases where the FFLO phases can be described within the simple mean field theory, the parameter region for the FFLO phases is too small to be observed in experiments. Recently, we showed that the Rashba type spin-orbit coupling and in-plane Zeeman field in three dimensional degenerate Fermi gases provide a more efficient way to create the FFLO phase because (1) the parameter region for the FFLO phase is greatly enlarged in the phase diagram and (2) the FFLO phase is stabilized due to the enhanced energy difference between FFLO phase and conventional Bardeen-Cooper-Schrieffer (BCS) phase. In this work we investigate the FFLO phase in two dimensional spin-orbit coupled degenerate Fermi gases using the mean field theory, with special concerns on the physical origin of the FFLO state. The basic properties of the FFLO phase are discussed and the phase diagram is obtained at zero temperature. The symmetry of different quantum phases is examined, which provide important basis for the experimental observation of FFLO phases using the time-of-flight imaging.

preprint2013arXiv

Rumor Evolution in Social Networks

Social network is a main tunnel of rumor spreading. Previous studies are concentrated on a static rumor spreading. The content of the rumor is invariable during the whole spreading process. Indeed, the rumor evolves constantly in its spreading process, which grows shorter, more concise, more easily grasped and told. In an early psychological experiment, researchers found about 70% of details in a rumor were lost in the first 6 mouth-to-mouth transmissions \cite{TPR}. Based on the facts, we investigate rumor spreading on social networks, where the content of the rumor is modified by the individuals with a certain probability. In the scenario, they have two choices, to forward or to modify. As a forwarder, an individual disseminates the rumor directly to its neighbors. As a modifier, conversely, an individual revises the rumor before spreading it out. When the rumor spreads on the social networks, for instance, scale-free networks and small-world networks, the majority of individuals actually are infected by the multi-revised version of the rumor, if the modifiers dominate the networks. Our observation indicates that the original rumor may lose its influence in the spreading process. Similarly, a true information may turn to be a rumor as well. Our result suggests the rumor evolution should not be a negligible question, which may provide a better understanding of the generation and destruction of a rumor.

preprint2013arXiv

Weakly holomorphic modular forms and rank two hyperbolic Kac-Moody algebras

In this paper, we compute basis elements of certain spaces of weight 0 weakly holomorphic modular forms and consider the integrality of Fourier coefficients of the modular forms. We use the results to construct automorphic correction of the rank 2 hyperbolic Kac-Moody algebras H(a), a=4,5,6, through Hilbert modular forms explicitly given by Borcherds lifts of the weakly holomorphic modular forms. We also compute asymptotic of the Fourier coefficients as they are related to root multiplicities of the rank 2 hyperbolic Kac-Moody algebras. This work is a continuation of the previous paper, where automorphic correction was constructed for H(a), a=3, 11, 66.

preprint2013arXiv

Weyl Group Multiple Dirichlet Series for Symmetrizable Kac-Moody Root Systems

Weyl group multiple Dirichlet series, introduced by Brubaker, Bump, Chinta, Friedberg and Hoffstein, are expected to be Whittaker coefficients of Eisenstein series on metaplectic groups. Chinta and Gunnells constructed these multiple Dirichlet series for all the finite root systems using the method of averaging a Weyl group action on the field of rational functions. In this paper, we generalize Chinta and Gunnells' work and construct Weyl group multiple Dirichlet series for the root systems associated with symmetrizable Kac-Moody algebras, and establish their functional equations and meromorphic continuation.

preprint2011arXiv

Diffusion-annihilation proecesses in weighted scale-free networks with identical degree sequence

The studies based on $A+A \rightarrow \emptyset$ and $A+B\rightarrow \emptyset$ diffusion-annihilation processes have so far been studied on weighted uncorrelated scale-free networks and fractal scale-free networks. In the previous reports, it is widely accepted that the segregation of particles in the processes is introduced by the fractal structure. In this paper, we study these processes on a family of weighted scale-free networks with identical degree sequence. We find that the depletion zone and segregation are essentially caused by the disassortative mixing, namely, high-degree nodes tend to connect with low-degree nodes. Their influence on the processes is governed by the correlation between the weight and degree. Our finding suggests both the weight and degree distribution don't suffice to characterize the diffusion-annihilation processes on weighted scale-free networks.

preprint2011arXiv

Traffic Fluctuations on Weighted Networks

Traffic fluctuation has so far been studied on unweighted networks. However many real traffic systems are better represented as weighted networks, where nodes and links are assigned a weight value representing their physical properties such as capacity and delay. Here we introduce a general random diffusion (GRD) model to investigate the traffic fluctuation in weighted networks, where a random walk's choice of route is affected not only by the number of links a node has, but also by the weight of individual links. We obtain analytical solutions that characterise the relation between the average traffic and the fluctuation through nodes and links. Our analysis is supported by the results of numerical simulations. We observe that the value ranges of the average traffic and the fluctuation, through nodes or links, increase dramatically with the level of heterogeneity in link weight. This highlights the key role that link weight plays in traffic fluctuation and the necessity to study traffic fluctuation on weighted networks.

preprint2010arXiv

Deterministic weighted scale-free small-world networks

We propose a deterministic weighted scale-free small-world model for considering pseudofractal web with the coevolution of topology and weight. In the model, we have the degree distribution exponent $γ$ restricted to a range between 2 and 3, simultaneously tunable with two parameters. At the same time, we provide a relatively complete view of topological structure and weight dynamics characteristics of the networks: weight and strength distribution; degree correlations; average clustering coefficient and degree-cluster correlations; as well as the diameter. We show that our model is particularly effective at mimicing weighted scale-free small-world networks with a high and relatively stable clustering coefficient, which rapidly decline with the network size in most previous models.

preprint2009arXiv

Analytic Solution to Clustering Coefficients on Weighted Networks

Clustering coefficient is an important topological feature of complex networks. It is, however, an open question to give out its analytic expression on weighted networks yet. Here we applied an extended mean-field approach to investigate clustering coefficients in the typical weighted networks proposed by Barrat, Barthélemy and Vespignani (BBV networks). We provide analytical solutions of this model and find that the local clustering in BBV networks depends on the node degree and strength. Our analysis is well in agreement with results of numerical simulations.

preprint2007arXiv

Recursive weighted treelike networks

We propose a geometric growth model for weighted scale-free networks, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks, which are partially determined by the parameters. Analytical results indicate that the resulting networks have power-law distributions of degree, strength, weight and betweenness, a scale-free behavior for degree correlations, logarithmic small average path length and diameter with network size. The obtained properties are in agreement with empirical data observed in many real-life networks, which shows that the presented model may provide valuable insight into the real systems.