BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Source author record

Zheng Wei

Zheng Wei appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record
Cryptography and SecurityMachine LearningArtificial Intelligencemath.DSComputer Visioncond-mat.supr-conDistributed, Parallel, and Cluster Computingeess.SPHuman-Computer InteractionInformation Theorymath.ITmath.NAMethodologyNetworking and Internet ArchitectureNumerical Analysisphysics.acc-phphysics.atom-phphysics.ins-det

Catalog footprint

What is connected

14works
18topics
4close collaborators

Actions

Connect this record

Log in to claim
Open graphBrowse works

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

14 published item(s)

preprint2026arXiv

FinVault: Benchmarking Financial Agent Safety in Execution-Grounded Environments

Financial agents powered by large language models (LLMs) are increasingly deployed for investment analysis, risk assessment, and automated decision-making, where their abilities to plan, invoke tools, and manipulate mutable state introduce new security risks in high-stakes and highly regulated financial environments. However, existing safety evaluations largely focus on language-model-level content compliance or abstract agent settings, failing to capture execution-grounded risks arising from real operational workflows and state-changing actions. To bridge this gap, we propose FinVault, the first execution-grounded security benchmark for financial agents, comprising 31 regulatory case-driven sandbox scenarios with state-writable databases and explicit compliance constraints, together with 107 real-world vulnerabilities and 963 test cases that systematically cover prompt injection, jailbreaking, financially adapted attacks, as well as benign inputs for false-positive evaluation. Experimental results reveal that existing defense mechanisms remain ineffective in realistic financial agent settings, with average attack success rates (ASR) still reaching up to 50.0\% on state-of-the-art models and remaining non-negligible even for the most robust systems (ASR 6.7\%), highlighting the limited transferability of current safety designs and the need for stronger financial-specific defenses. Our code can be found at https://github.com/aifinlab/FinVault.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

FIS-DiT: Breaking the Few-Step Video Inference Barrier via Training-Free Frame Interleaved Sparsity

While the overall inference latency of Video Diffusion Transformers (DiTs) can be substantially reduced through model distillation, per-step inference latency remains a critical bottleneck. Existing acceleration paradigms primarily exploit redundancy across the denoising trajectory; however, we identify a limitation where these step-wise strategies encounter diminishing returns in few-step regimes. In such scenarios, the scarcity of temporal states prevents effective feature reuse or predictive modeling, creating a formidable barrier to further acceleration. To overcome this, we propose Frame Interleaved Sparsity DiT (FIS-DiT), a training-free and operator-agnostic framework that shifts the optimization focus from the temporal trajectory to the latent frame dimension. Our approach is motivated by an intrinsic duality within this dimension: the existence of frame-wise sparsity that permits reduced computation, coupled with a structural consistency where each frame position remains equally vital to the global spatiotemporal context. Leveraging this insight, we implement Frame Interleaved Sparsity (FIS) as an execution strategy that manipulates frame subsets across the model hierarchy, refreshing all latent positions without requiring full-scale block computation. Empirical evaluations on Wan 2.2 and HunyuanVideo 1.5 demonstrate that FIS-DiT consistently achieves 2.11--2.41$\times$ speedup with negligible degradation across VBench-Q and CLIP metrics, providing a scalable and robust pathway toward real-time high-definition video generation.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

KVServe: Service-Aware KV Cache Compression for Communication-Efficient Disaggregated LLM Serving

LLMs are widely adopted in production, pushing inference systems to their limits. Disaggregated LLM serving (e.g., PD separation and KV state disaggregation) improves scalability and cost efficiency, but it also turns KV into an explicit payload crossing network and storage boundaries, making KV a dominant end-to-end bottleneck. Existing KV compression are typically static runtime configurations, despite production service context varies over time in workload mix, bandwidth, and SLO/quality budgets. As a result, a fixed choice can be suboptimal or even increase latency. We present \emph{KVServe}, the first service-aware and adaptive KV communication compression framework for disaggregated LLM serving: KVServe (1) unifies KV compression into a modular strategy space with new components and cross-method recomposition; (2) introduces Bayesian Profiling Engine that efficiently searches this space and distills a 3D Pareto candidate set, reducing $50\times$ offline search overhead; and (3) deploys a Service-Aware Online Controller that combines an analytical latency model with a lightweight bandit to select profiles under constraints and correct offline-to-online mismatch. Integrated into vLLM and evaluated across datasets, models, GPUs and networks, KVServe achieves up to $9.13\times$ JCT speedup in PD-separated serving and up to $32.8\times$ TTFT reduction in KV-disaggregated serving.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Learning Ecological and Epidemic Processes using Neural ODEs, Kolmogorov-Arnold Network ODEs and SINDy

We consider epidemic and ecological models to investigate their coupled dynamics. Starting with the classical Susceptible-Infected-Recovered (SIR) model for basic epidemic behavior and the predator-prey (Lotka-Volterra, LV) system for ecological interactions, we then combine these frameworks into a coupled Lotka-Volterra-Susceptible-Infected-Susceptible (LVSIS) model. The resulting system consists of four differential equations describing the evolution of susceptible and infected prey and predator populations, incorporating ecological interactions, disease transmission, and spatial dispersal. To learn the underlying dynamics directly from data, we employ several data-driven modeling frameworks: Neural Ordinary Differential Equations (Neural ODEs), Kolmogorov-Arnold Network Ordinary Differential Equations (KANODEs), and Sparse Identification of Nonlinear Dynamics (SINDy). Numerical experiments based on synthetic data are conducted to investigate the learning ability of these models in capturing the epidemic and ecological behavior. We further extend our approach to spatio-temporal models, aiming to uncover hidden local couplings.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Applying Differential Privacy to Tensor Completion

Tensor completion aims at filling the missing or unobserved entries based on partially observed tensors. However, utilization of the observed tensors often raises serious privacy concerns in many practical scenarios. To address this issue, we propose a solid and unified framework that contains several approaches for applying differential privacy to the two most widely used tensor decomposition methods: i) CANDECOMP/PARAFAC~(CP) and ii) Tucker decompositions. For each approach, we establish a rigorous privacy guarantee and meanwhile evaluate the privacy-accuracy trade-off. Experiments on synthetic and real-world datasets demonstrate that our proposal achieves high accuracy for tensor completion while ensuring strong privacy protections.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

From `Wow' to `Why': Guidelines for Creating the Opening of a Data Video with Cinematic Styles

Data videos are an increasingly popular storytelling form. The opening of a data video critically influences its success as the opening either attracts the audience to continue watching or bores them to abandon watching. However, little is known about how to create an attractive opening. We draw inspiration from the openings of famous films to facilitate designing data video openings. First, by analyzing over 200 films from several sources, we derived six primary cinematic opening styles adaptable to data videos. Then, we consulted eight experts from the film industry to formulate 28 guidelines. To validate the usability and effectiveness of the guidelines, we asked participants to create data video openings with and without the guidelines, which were then evaluated by experts and the general public. Results showed that the openings designed with the guidelines were perceived to be more attractive, and the guidelines were praised for clarity and inspiration.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

One-Bit Matrix Completion with Differential Privacy

As a prevailing collaborative filtering method for recommendation systems, one-bit matrix completion requires data collected by users to provide personalized service. Due to insidious attacks and unexpected inference, the release of users' data often raises serious privacy concerns. To address this issue, differential privacy(DP) has been widely used in standard matrix completion models. To date, however, little has been known about how to apply DP to achieve privacy protection in one-bit matrix completion. In this paper, we propose a unified framework for ensuring a strong privacy guarantee of one-bit matrix completion with DP. In our framework, we develop four different private perturbation mechanisms corresponding to different stages of one-bit matrix completion. For each mechanism, we design a privacy-preserving algorithm and provide a theoretical recovery error bound under the proper conditions. Numerical experiments on synthetic and real-world datasets demonstrate the effectiveness of our proposal. Compared to the one-bit matrix completion without privacy protection, our proposed mechanisms can maintain high-level privacy protection with marginal loss of completion accuracy.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Fast Graph Subset Selection Based on G-optimal Design

Graph sampling theory extends the traditional sampling theory to graphs with topological structures. As a key part of the graph sampling theory, subset selection chooses nodes on graphs as samples to reconstruct the original signal. Due to the eigen-decomposition operation for Laplacian matrices of graphs, however, existing subset selection methods usually require high-complexity calculations. In this paper, with an aim of enhancing the computational efficiency of subset selection on graphs, we propose a novel objective function based on the optimal experimental design. Theoretical analysis shows that this function enjoys an $α$-supermodular property with a provable lower bound on $α$. The objective function, together with an approximate of the low-pass filter on graphs, suggests a fast subset selection method that does not require any eigen-decomposition operation. Experimental results show that the proposed method exhibits high computational efficiency, while having competitive results compared to the state-of-the-art ones, especially when the sampling rate is low.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Mo$_6$Ga$_{31}$ endohedral cluster superconductor

Synthesis, crystal and electronic structure, and physical properties of the Mo$_6$Ga$_{31}$ endohedral cluster superconductor are reported. The compound has two crystallographic modifications, monoclinic and triclinic, in which the same {Mo$_{12}$Ga$_{62}$} building units are perpendicular or codirectional to each other, respectively. Monoclinic and triclinic structures of Mo$_6$Ga$_{31}$ possess qualitatively the same electronic density of states showing a high peak at the Fermi level. Both modifications are inherently present in the bulk specimen. Due to the proximity effect, bulk Mo$_6$Ga$_{31}$ exhibits single superconducting transition at the critical temperature of 8.2 K in zero magnetic field. The upper critical field, which is 7.8 T at zero temperature, shows clear enhancement with respect to the Werthamer-Helfand-Honenberg prediction. Accordingly, heat capacity measurements indicate strong electron-phonon coupling in the superconducting state with the large ratio of $2Δ(0)/(k_BT_c)=4.5$, where 2$Δ(0)$ is the full superconducting gap at zero temperature.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Parallel Computing for Copula Parameter Estimation with Big Data: A Simulation Study

Copula-based modeling has seen rapid advances in recent years. However, in big data applications, the lengthy computation time for estimating copula parameters is a major difficulty. Here, we develop a novel method to speed computation time in estimating copula parameters, using communication-free parallel computing. Our procedure partitions full data sets into disjoint independent subsets, performs copula parameter estimation on the subsets, and combines the results to produce an approximation to the full data copula parameter. We show in simulation studies that the computation time is greatly reduced through our method, using three well-known one-parameter bivariate copulas within the elliptical and Archimedean families: Gaussian, Frank and Gumbel. In addition, our simulation studies find small values for estimated bias, estimated mean squared error, and estimated relative L1 and L2 errors for our method, when compared to the full data parameter estimates.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

Simulation of proton radiography terminal at IMP

Proton radiography is used for advanced hydrotesting as a new type radiography technology due to its powerful penetration capability and high detection efficiency. A new proton radiography terminal will be developed to radiograph static samples at Institute of Modern Physics of Chinese Academy of Science (IMP-CAS). The proton beam with the maximum energy of 2.6 GeV will be produced by Heavy Ion Research Facility in Lanzhou-Cooling Storage Ring (HIRFL-CSR). The proton radiography terminal consists of the matching magnetic lens and the Zumbro lens system. In this paper, the design scheme and all optic parameters of this beam terminal for 2.6GeV proton energy are presented by simulating the beam optics using WINAGILE code. My-BOC code is used to test the particle tracking of proton radiography beam line. Geant4 code and G4beamline code are used for simulating the proton radiography system. The results show that the transmission efficiency of proton without target is 100%, and the effect of secondary particles can be neglected. In order to test this proton radiography system, the proton images for an aluminum plate sample with two rectangular orifices and a step brass plate sample are respectively simulated using Geant4 code. The results show that the best spatial resolution is about 36μm, and the differences of the thickness is not greater than 10%.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

Study on the unfolding algorithm for D-T neutron energy spectra measurement using recoil proton method

A proton recoil method for measuring D-T neutron energy spectra using polyethylene film and Si (Au) surface barrier detector was presented. An iteration algorithm for unfolding the recoil proton energy spectrum to the neutron energy spectrum was investigated. The response matrixes R of polyethylene film at 0 degree and 45 degree were obtained by simulating the recoil proton energy spectra from the mono-energetic neutron using MCNP code. Under an assumed D-T neutron spectrum, the recoil proton spectra from polyethylene film at 0 degree and 45 degree were also simulated using MCNP code. Based on the response matrixes R and the simulated recoil proton spectra at 0 degree and 45 degree, the unfolded neutron spectra were respectively obtained using the iteration algorithm, and compared with the assumed neutron spectrum. The results show that the iteration algorithm method can be applied to unfold the recoil proton energy spectrum to the neutron energy spectrum for D-T neutron energy spectra measurement using recoil proton method.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Co-compact entropy and its variational principle for non-compact spaces

The purpose of this paper is to generalize the variational principle, which states that the topological entropy is equal to the supremum of the measure theoretical entropies and also the minimum of the metric theoretical entropies, to non-compact dynamical systems by utilizing the co-compact entropy. The equivalence between positive co-compact entropy and the existence of p-horseshoes over the real line is also proved. This implies a system over real line with positive co-compact entropy contains a compact invariant subset.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

The entropy of co-compact open covers

Co-compact entropy is introduced as an invariant of topological conjugation for perfect mappings defined on any Hausdorff space(compactness and metrizability not necessarily required). This is achieved through the consideration of co-compact covers of the space. The advantages of co-compact entropy include: 1) it does not require the space to be compact, and thus generalizes Adler, Konheim and McAndrew's topological entropy of continuous mappings on compact dynamical systems, and 2) it is an invariant of topological conjugation, compared to Bowen's entropy that is metric-dependent. Other properties of co-compact entropy are investigated, e.g., the co-compact entropy of a subsystem does not exceed that of the whole system. For the linear system (R, f) defined by f(x) = 2x, the co-compact entropy is zero, while Bowen's entropy for this system is at least log 2. More general, it is found that co-compact entropy is a lower bound of Bowen's entropies, and the proof of this result generates the Lebesgue Covering Theorem to co-compact open covers of non-compact metric spaces, too.

0 citations0 reviewsNo code linkedOpen access