Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
9works
0followers
15topics
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

9 published item(s)

preprint2026arXiv

Unleashing Vision Transformer Potential In Image Quality Assessment via Global-Local Adaptive Interaction

In the field of Blind Image Quality Assessment (BIQA), accurately predicting the perceptual quality of authentically distorted images remains highly challenging due to the diverse and complex distortions present in natural environments. Although existing methods have achieved notable accuracy, their scalability is often constrained by the high cost of subjective annotation and the limited size of available datasets. Recent advances in large-scale pre-trained vision models have introduced powerful semantic and representational capabilities, yet their application to IQA tasks is hindered by substantial computational demands and suboptimal fine-tuning efficiency. To overcome these limitations, we introduce the Global-Local Interaction Adapter (GLIA), a novel framework that effectively harnesses pre-trained Vision Transformers through a dual-stream feature extraction mechanism coupled with interactive global-local fusion. By jointly retaining global semantic information and fine-grained local details, our approach delivers superior prediction accuracy and robustness while requiring significantly fewer trainable parameters. Extensive experiments on multiple benchmarks validate the effectiveness and superiority of our approach.

preprint2022arXiv

Golfer: Trajectory Prediction with Masked Goal Conditioning MnM Network

Transformers have enabled breakthroughs in NLP and computer vision, and have recently began to show promising performance in trajectory prediction for Autonomous Vehicle (AV). How to efficiently model the interactive relationships between the ego agent and other road and dynamic objects remains challenging for the standard attention module. In this work we propose a general Transformer-like architectural module MnM network equipped with novel masked goal conditioning training procedures for AV trajectory prediction. The resulted model, named golfer, achieves state-of-the-art performance, winning the 2nd place in the 2022 Waymo Open Dataset Motion Prediction Challenge and ranked 1st place according to minADE.

preprint2022arXiv

Molecular engineering of metal-free perovskite MDABCO-NH4I3 towards enhanced ferroelectric polarization

Molecular ferroelectrics have attracted increasing interests over the past decade due to mechanical flexibility, chemical diversity, environmental friendliness, easy-processing, and lightness. The performance of molecular ferroelectrics is approaching more and more competitive to their inorganic counterparts. Despite the chemical diversity and tunability of the molecular cations or anions, molecular ferroelectrics are not abundant. In particular, physical directed design principles for new discovery or performance optimization are still lacking. Here, through first-principles calculations, we firstly reveal the importance of the molecular dipole moment of the polar cations in a molecular perovskite ferroelectric, and then propose a molecular dipole guided design rule for high-performance molecular ferroelectrics. Finally, the rule is validated by first-principles calculations. We anticipate that the rule is very useful in the field urging for new and high-performance molecular ferroelectrics.

preprint2021arXiv

Energy stable arbitrary order ETD-MS method for gradient flows with Lipschitz nonlinearity

We present a methodology to construct efficient high-order in time accurate numerical schemes for a class of gradient flows with appropriate Lipschitz continuous nonlinearity. There are several ingredients to the strategy: the exponential time differencing (ETD), the multi-step (MS) methods, the idea of stabilization, and the technique of interpolation. They are synthesized to develop a generic $k^{th}$ order in time efficient linear numerical scheme with the help of an artificial regularization term of the form $Aτ^k\frac{\partial}{\partial t}\mathcal{L}^{p(k)}u$ where $\mathcal{L}$ is the positive definite linear part of the flow, $τ$ is the uniform time step-size. The exponent $p(k)$ is determined explicitly by the strength of the Lipschitz nonlinear term in relation to $\mathcal{L}$ together with the desired temporal order of accuracy $k$. To validate our theoretical analysis, the thin film epitaxial growth without slope selection model is examined with a fourth-order ETD-MS discretization in time and Fourier pseudo-spectral in space discretization. Our numerical results on convergence and energy stability are in accordance with our theoretical results.

preprint2021arXiv

Fragile topology in nodal-line semimetal superconductors

We study the band topology of the superconducting nodal-line semimetal (SC-NLSM) protected by the inversion symmetry with and without the spin-orbital coupling. Without the spin-orbital coupling, both the $s$-wave SC-NLSM and the chiral $p$-wave SC-NLSM are topologically nontrivial and can be described by the nonzero winding number. Based on the Wilson loop method, we verify that they are both the fragile topological superconductors, namely, their nontrivial band topologies can be moved off by coupling to additional topologically trivial bands. The fragile topological phase persists in spinful system with the time-reversal symmetry when a spin-orbital coupling term is added. For the spinful system, both the $p$-wave SC-NLSM and the $s$-wave SC-NLSM are second-order fragile topological superconductors. We propose that the fragile topology in the SC-NLSM system depends strongly on the degeneracy of the Majorana zero modes and the parity of the superconducting gap function. Interestingly, in presence of a vortex line, the spinful $s$-wave SC-NLSM system hosts two pairs of stable Majorana zero modes in the vortex core.

preprint2020arXiv

Insight into bias in time-stratified case-crossover studies

The use of case-crossover designs has become widespread in epidemiological and medical investigations of transient associations. However, the most popular reference-select strategy, the time-stratified schema, is not a suitable solution for controlling bias in case-crossover studies. To prove this, we conducted a time series decomposition for daily ozone (O3) records; scrutinized the ability of the time-stratified schema on controlling the yearly, monthly and weekly time trends; and found it failed on controlling the weekly time trend. Based on this finding, we proposed a new logistic regression approach in which we did adjustment for the weekly time trend. A comparison between the traditional model and the proposed method was done by simulation. An empirical study was conducted to explore potential associations between air pollutants and AMI hospitalizations. In summary, time-stratified schema provide effective control on yearly and monthly time trends but not on weekly time trend. Therefore, the estimation from the traditional logistical regression basically reveals the effect of weekly time trend, instead of the transient effect. In contrast, the proposed logistic regression with adjustment for weekly time trend can effectively eliminate system bias in case-crossover studies.

preprint2020arXiv

Security Improvements of Several Basic Quantum Private Query Protocols with O(log N) Communication Complexity

New quantum private database (with N elements) query protocols are presented and analyzed. Protocols preserve O(logN) communication complexity of known protocols for the same task, but achieve several significant improvements in security, especially concerning user privacy. For example, the randomized form of our protocol has a cheat-sensitive property - it allows the user to detect a dishonest database with a nonzero probability, while the phase-encoded private query protocols for the same task do not have such a property. Moreover, when the database performs the computational basis measurement, a particular projective measurement which can cause a significant loss of user privacy in the previous private query protocols with O(logN) communication complexity, at most half of the user privacy could leak to such a database in our protocol, while in the QPQ protocol, the entire user privacy could leak out. In addition, it is proved here that for large N, the user could detect a cheating via the computational basis measurement, with a probability close to 1/2 using O(\sqrt{N}) special queries. Finally, it is shown here, for both forms of our protocol, basic and randomized, how a dishonest database has to act in case it could not learn user's queries.

preprint2020arXiv

Smart, Adaptive Energy Optimization for Mobile Web Interactions

Web technology underpins many interactive mobile applications. However, energy-efficient mobile web interactions is an outstanding challenge. Given the increasing diversity and complexity of mobile hardware, any practical optimization scheme must work for a wide range of users, mobile platforms and web workloads. This paper presents CAMEL , a novel energy optimization system for mobile web interactions. CAMEL leverages machine learning techniques to develop a smart, adaptive scheme to judiciously trade performance for reduced power consumption. Unlike prior work, C AMEL directly models how a given web content affects the user expectation and uses this to guide energy optimization. It goes further by employing transfer learning and conformal predictions to tune a previously learned model in the end-user environment and improve it over time. We apply CAMEL to Chromium and evaluate it on four distinct mobile systems involving 1,000 testing webpages and 30 users. Compared to four state-of-the-art web-event optimizers, CAMEL delivers 22% more energy savings, but with 49% fewer violations on the quality of user experience, and exhibits orders of magnitudes less overhead when targeting a new computing environment.

preprint2019arXiv

An ensemble of random graphs with identical degree distribution

Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast, in this paper, we report a fact that two arbitrarily chosen networks with identical degree distribution can have completely different other topological structure, such as diameter, spanning trees number, pearson correlation coefficient, and so forth. Besides that, for a given degree distribution (as power-law distribution with exponent $γ=3$ discussed here), it is reasonable to ask how many network models with such a constraint we can have. To this end, we generate an ensemble of this kind of random graphs with $P(k)\sim k^{-γ}$ ($γ=3$), denoted as graph space $\mathcal{N}(p,q,t)$ where probability parameters $p$ and $q$ hold on $p+q=1$, and indirectly show the cardinality of $\mathcal{N}(p,q,t)$ seems to be large enough in the thermodynamics limit, i.e., $N\rightarrow\infty$, by varying values of $p$ and $q$. From the theoretical point of view, given an ultrasmall constant $p_{c}$, perhaps only graph model $N(1,0,t)$ is small-world and other are not in terms of diameter. And then, we study spanning trees number on two deterministic graph models and obtain both upper bound and lower bound for other members. Meanwhile, for arbitrary $p(\neq1)$, we prove that graph model $N(p,q,t)$ does go through two phase transitions over time, i.e., starting by non-assortative pattern and then suddenly going into disassortative region, and gradually converging to initial place (non-assortative point). Among of them, one "null" graph model is built.