Trust snapshot

Quick read

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

18 published item(s)

preprint2026arXiv

DV-World: Benchmarking Data Visualization Agents in Real-World Scenarios

Real-world data visualization (DV) requires native environmental grounding, cross-platform evolution, and proactive intent alignment. Yet, existing benchmarks often suffer from code-sandbox confinement, single-language creation-only tasks, and assumption of perfect intent. To bridge these gaps, we introduce DV-World, a benchmark of 260 tasks designed to evaluate DV agents across real-world professional lifecycles. DV-World spans three domains: DV-Sheet for native spreadsheet manipulation including chart and dashboard creation as well as diagnostic repair; DV-Evolution for adapting and restructuring reference visual artifacts to fit new data across diverse programming paradigms and DV-Interact for proactive intent alignment with a user simulator that mimics real-world ambiguous requirements. Our hybrid evaluation framework integrates Table-value Alignment for numerical precision and MLLM-as-a-Judge with rubrics for semantic-visual assessment. Experiments reveal that state-of-the-art models achieve less than 50% overall performance, exposing critical deficits in handling the complex challenges of real-world data visualization. DV-World provides a realistic testbed to steer development toward the versatile expertise required in enterprise workflows. Our data and code are available at \href{https://github.com/DA-Open/DV-World}{this project page}.

preprint2026arXiv

Strain Engineering of Intrinsic Anomalous Hall and Nernst Effects in Altermagnetic MnTe at Realistic Doping Levels

Hexagonal MnTe has emerged as a prototypical g-wave altermagnet, hosting time-reversal symmetry breaking in momentum space despite a vanishing net magnetization. While this symmetry breaking theoretically allows for an intrinsic anomalous Hall effect, experimentally observed signals have remained weak. In this work, we investigate the origin of this suppression and demonstrate a strategy to amplify anomalous transport responses within the experimentally accessible doping regime. Using a $\bm{k}\cdot\bm{p}$ effective model, we reveal that near the valence band maximum, which corresponds to the energy window relevant for typical hole doping ($\sim10^{19}cm^{-3}$), the intrinsic Hall effect is suppressed due to a symmetry-enforced cancellation of opposing Berry curvature contributions. We propose that breaking the crystalline symmetry via volume-conserving biaxial strain lifts this cancellation, resulting in a significant enhancement of the anomalous Hall conductivity by orders of magnitude. This strain-induced Fermi surface distortion also amplifies the anomalous Nernst effect. Furthermore, the analysis of the spin texture confirms that these strain-enabled anomalous transport signatures emerge while preserving the zero net magnetization.

preprint2022arXiv

A new class of bilayer kagome lattice compounds with Dirac nodal lines and pressure-induced superconductivity

Kagome lattice composed of transition-metal ions provides a great opportunity to explore the intertwining between geometry, electronic orders and band topology. The discovery of multiple competing orders that connect intimately with the underlying topological band structure in nonmagnetic kagome metals $A$V$_3$Sb$_5$ ($A$ = K, Rb, Cs) further pushes this topic to the quantum frontier. Here we report the discovery and characterization of a new class of vanadium-based compounds with kagome bilayers, namely $A$V$_6$Sb$_6$ ($A$ = K, Rb, Cs) and V$_6$Sb$_4$, which, together with $A$V$_3$Sb$_5$, compose a series of kagome compounds with a generic chemical formula ($A_{m-1}$Sb$_{2m}$)(V$_3$Sb)$_n$ (m = 1, 2; n = 1, 2). Theoretical calculations combined with angle-resolved photoemission measurements reveal that these compounds feature Dirac nodal lines in close vicinity to the Fermi level. Pressure-induced superconductivity in $A$V$_6$Sb$_6$ further suggests promising emergent phenomena in these materials. The establishment of a new family of layered kagome materials paves the way for designer of fascinating kagome systems with diverse topological nontrivialities and collective ground states.

preprint2022arXiv

A proof-of-principle demonstration of quantum microwave photonics

With the rapid development of microwave photonics, which has expanded to numerous applications of commercial importance, eliminating the emerging bottlenecks becomes of vital importance. For example, as the main branch of microwave photonics, radio-over-fiber technology provides high bandwidth, low-loss, and long-distance propagation capability, facilitating wide applications ranging from telecommunication to wireless networks. With ultrashort pulses as the optical carrier, huge capacity is further endowed. However, the wide bandwidth of ultrashort pulses results in the severe vulnerability of high-frequency RF signals to fiber dispersion. With a time-energy entangled biphoton source as the optical carrier and combined with the single-photon detection technique, a quantum microwave photonics method is proposed and demonstrated experimentally. The results show that it not only realizes unprecedented nonlocal RF signal modulation with strong resistance to the dispersion associated with ultrashort pulse carriers but provides an alternative mechanism to effectively distill the RF signal out from the dispersion. Furthermore, the spurious-free dynamic range of both the nonlocally modulated and distilled RF signals has been significantly improved. With the ultra-weak detection and high-speed processing advantages endowed by the low-timing-jitter single-photon detection, the quantum microwave photonics method opens up new possibilities in modern communication and networks.

preprint2022arXiv

An Empirical Investigation of Worker Communities in TopCoder

Software crowdsourcing platforms employ extrinsic rewards such as rating or ranking systems to motivate workers. Such rating systems are noisy and provide limited knowledge about workers' preferences and performance. To develop better understanding of worker reliability and trustworthiness in software crowdsourcing, this paper reports an empirical study conducted on more than one year's real-world data from TopCoder, one of the leading software crowdsourcing platforms. To do so, first, we create a bipartite network of active workers based on common task registrations. Then, we use the Clauset-Newman-Moore graph clustering algorithm to identify worker clusters in the network. Finally, we conduct an empirical evaluation to measure and analyze workers' behavior per identified community in the platform by workers' rating. More specifically, workers' behavior is analyzed based on their performances in terms of reliability, trustworthiness, and success; their preferences in terms of efficiency and elasticity; and strategies in terms of comfort, confidence, and deceitfulness. The main result of this study identified four communities of active workers: mixed-ranked, high-ranked, mid-ranked, and low-ranked. This study shows that the low-ranked community associates with the highest reliable workers with an average reliability of 25%, while the mixed-ranked community contains the most trustworthy workers with average trustworthiness of 16%. Such empirical evidence is beneficial to help exploring resourcing options while understanding the relations among unknown resources to improve task success.

preprint2022arXiv

BugListener: Identifying and Synthesizing Bug Reports from Collaborative Live Chats

In community-based software development, developers frequently rely on live-chatting to discuss emergent bugs/errors they encounter in daily development tasks. However, it remains a challenging task to accurately record such knowledge due to the noisy nature of interleaved dialogs in live chat data. In this paper, we first formulate the task of identifying and synthesizing bug reports from community live chats, and propose a novel approach, named BugListener, to address the challenges. Specifically, BugListener automates three sub-tasks: 1) Disentangle the dialogs from massive chat logs by using a Feed-Forward neural network; 2) Identify the bug-report dialogs from separated dialogs by modeling the original dialog to the graph-structured dialog and leveraging the graph neural network to learn the contextual information; 3) Synthesize the bug reports by utilizing the TextCNN model and Transfer Learning network to classify the sentences into three groups: observed behaviors (OB), expected behaviors (EB), and steps to reproduce the bug (SR). BugListener is evaluated on six open source projects. The results show that: for bug report identification, BugListener achieves the average F1 of 74.21%, improving the best baseline by 10.37%; and for bug report synthesis task, BugListener could classify the OB, EB, and SR sentences with the F1 of 67.37%, 87.14%, and 65.03%, improving the best baselines by 7.21%, 7.38%, 5.30%, respectively. A human evaluation also confirms the effectiveness of BugListener in generating relevant and accurate bug reports. These demonstrate the significant potential of applying BugListener in community-based software development, for promoting bug discovery and quality improvement.

preprint2022arXiv

Enabling Fast and Flexible Distributed Deep Learning with Programmable Switches

Deep learning has been used in a wide range of areas and made a huge breakthrough. With the ever-increasing model size and train-ing data volume, distributed deep learning emerges which utilizes a cluster to train a model in parallel. Unfortunately, the performance is often far from linear speedup due to the communication overhead between cluster nodes. To address this challenge, this paper designs and implements Libra, a network aggregator, that utilizes in-network computation to optimize the communication for distributed DL training in two aspects: 1) reduce active connections and 2) aggregate exchanged network packets. We implemented our Libra on Intel Tofino switches, customized a lightweight host stack and integrated it into an open-source training framework PS-lite. The experimental result shows that our Libra can achieve 1.5~4 times speedup.

preprint2022arXiv

Identifying Emergent Leadership in OSS Projects Based on Communication Styles

In open source software (OSS) communities, existing leadership indicators are dominantly measured by code contribution or community influence. Recent studies on emergent leadership shed light on additional dimensions such as intellectual stimulation in collaborative communications. To that end, this paper proposes an automated approach, named iLead, to mine communication styles and identify emergent leadership behaviors in OSS communities, using issue comments data. We start with the construction of 6 categories of leadership behaviors based on existing leadership studies. Then, we manually label leadership behaviors in 10,000 issue comments from 10 OSS projects, and extract 304 heuristic linguistic patterns which represent different types of emergent leadership behaviors in flexible and concise manners. Next, an automated algorithm is developed to merge and consolidate different pattern sets extracted from multiple projects into a final pattern ranking list, which can be applied for the automatic leadership identification. The evaluation results show that iLead can achieve a median precision of 0.82 and recall of 0.78, outperforming ten machine/deep learning baselines. To demonstrate practical usefulness, we also conduct empirical analysis and human evaluation of the identified leadership behaviors from iLead. We argue that emergent leadership behaviors in issue discussion should be taken into consideration to broaden existing OSS leadership viewpoints. Practical insights on community building and leadership skill development are offered for OSS community and individual developers, respectively.

preprint2021arXiv

Quantum microwave photonics

By harnessing quantum superposition and entanglement, remarkable progress has sprouted over the past three decades from different areas of research in communication computation and simulation. To further improve the processing ability of microwave pho-tonics, here, we have demonstrated a quantum microwave photonic processing system using a low jitter superconducting nanowire single photon detector (SNSPD) and a time-correlated single-photon counting (TCSPC) module. This method uniquely combines extreme optical sensitivity, down to a single-photon level (below -100 dBm), and wide processing bandwidth, twice higher than the transmission bandwidth of the cable. Moreover, benefitted from the trigger, the system can selectively process the desired RF signal and attenuates the other in-tense noise and undesired RF components even the power is 15dB greater than the desired signal power. Using this method we show microwave phase shifting and frequency filtering for the desired RF signal on the single-photon level. Besides its applications in space and under-water communications and testing and qualification of pre-packaged photonic modulators and detectors. This RF signal processing capability at the single-photon level can lead to significant development in the high-speed quantum processing method.

preprint2020arXiv

A Trustworthy Recruitment Process for Spatial Mobile Crowdsourcing in Large-scale Social IoT

Spatial Mobile Crowdsourcing (SMCS) can be leveraged by exploiting the capabilities of the Social Internet-of-Things (SIoT) to execute spatial tasks. Typically, in SMCS, a task requester aims to recruit a subset of IoT devices and commission them to travel to the task location. However, because of the exponential increase of IoT networks and their diversified devices (e.g., multiple brands, different communication channels, etc.), recruiting the appropriate devices/workers is becoming a challenging task. To this end, in this paper, we develop a recruitment process for SMCS platforms using automated SIoT service discovery to select trustworthy workers satisfying the requester requirements. The method we purpose includes mainly two stages: 1) a worker filtering stage, aiming at reducing the workers' search space to a subset of potential trustworthy candidates using the Louvain community detection algorithm (CD) applied to SIoT relation graphs. Next, 2) a selection process stage that uses an Integer Linear Program (ILP) to determine the final set of selected devices/workers. The ILP maximizes a worker efficiency metric incorporating the skills/specs level, recruitment cost, and trustworthiness level of the recruited IoT devices. Selected experiments analyze the performance of the proposed CD-ILP algorithm using a real-world dataset and show its superiority in providing an effective recruitment strategy compared to an existing stochastic algorithm.

preprint2020arXiv

Automated Service Discovery for Social Internet-of-Things Systems

In this paper, we propose to design an automated service discovery process to allow mobile crowdsourcing task requesters select a small set of devices out of a large-scale Internet-of-things (IoT) network to execute their tasks. To this end, we proceed by dividing the large-scale IoT network into several virtual communities whose members share strong social IoT relations. Two community detection algorithms, namely Louvain and order statistics local method (OSLOM) algorithms, are investigated and applied to a real-world IoT dataset to form non-overlapping and overlapping IoT devices groups. Afterwards, a natural language process (NLP)-based approach is executed to handle crowdsourcing textual requests and accordingly find the list of IoT devices capable of effectively accomplishing the tasks. This is performed by matching the NLP outputs, e.g., type of application, location, required trustworthiness level, with the different detected communities. The proposed approach effectively helps in automating and reducing the service discovery procedure and recruitment process for mobile crowdsourcing applications.

preprint2020arXiv

Computational Resource Allocation for Edge Computing in Social Internet-of-Things

The heterogeneity of the Internet-of-things (IoT) network can be exploited as a dynamic computational resource environment for many devices lacking computational capabilities. A smart mechanism for allocating edge and mobile computers to match the need of devices requesting external computational resources is developed. In this paper, we employ the concept of Social IoT and machine learning to downgrade the complexity of allocating appropriate edge computers. We propose a framework that detects different communities of devices in SIoT enclosing trustworthy peers having strong social relations. Afterwards, we train a machine learning algorithm, considering multiple computational and non-computational features of the requester as well as the edge computers, to predict the total time needed to process the required task by the potential candidates belonging to the same community of the requester. By applying it to a real-world data set, we observe that the proposed framework provides encouraging results for mobile computer allocation.

preprint2020arXiv

Graph Neural Networks-based Clustering for Social Internet of Things

In this paper, we propose a machine learning process for clustering large-scale social Internet-of-things (SIoT) devices into several groups of related devices sharing strong relations. To this end, we generate undirected weighted graphs based on the historical dataset of IoT devices and their social relations. Using the adjacency matrices of these graphs and the IoT devices' features, we embed the graphs' nodes using a Graph Neural Network (GNN) to obtain numerical vector representations of the IoT devices. The vector representation does not only reflect the characteristics of the device but also its relations with its peers. The obtained node embeddings are then fed to a conventional unsupervised learning algorithm to determine the clusters accordingly. We showcase the obtained IoT groups using two well-known clustering algorithms, specifically the K-means and the density-based algorithm for discovering clusters (DBSCAN). Finally, we compare the performances of the proposed GNN-based clustering approach in terms of coverage and modularity to those of the deterministic Louvain community detection algorithm applied solely on the graphs created from the different relations. It is shown that the framework achieves promising preliminary results in clustering large-scale IoT systems.

preprint2020arXiv

Isotropic or anisotropic screening in black phosphorous: can doping tip the balance?

Black phosphorus (BP), a layered van der Waals (vdW) crystal, has unique in-plane band anisotropy and many resulting anisotropy properties such as the effective mass, electron mobility, optical absorption, thermal conductivity and plasmonic dispersion. However, whether anisotropic or isotropic charge screening exist in BP remains a controversial issue. Based on first-principles calculations, we study the screening properties in both of single-layer and bulk BP, especially concerning the role of doping. Without charge doping, the single-layer and bulk-phase BP show slight anisotropic screening. Electron and hole doping can increase the charge screening of BP and significantly change the relative static dielectric tensor elements along two different in-plane directions. We further study the charge density change induced by potassium (K) adatom near the BP surface, under different levels of charge doping. The calculated two-dimensional (2D) charge redistribution patterns also confirm that doping can greatly affect the screening feature and tip the balance between isotropic and anisotropic screening. We corroborate that screening in BP exhibit slight intrinsic anisotropy and doping has significant influence on its screening property.

preprint2020arXiv

Learned Enrichment of Top-View Grid Maps Improves Object Detection

We propose an object detector for top-view grid maps which is additionally trained to generate an enriched version of its input. Our goal in the joint model is to improve generalization by regularizing towards structural knowledge in form of a map fused from multiple adjacent range sensor measurements. This training data can be generated in an automatic fashion, thus does not require manual annotations. We present an evidential framework to generate training data, investigate different model architectures and show that predicting enriched inputs as an additional task can improve object detection performance.

preprint2020arXiv

Quantized Auger Recombination of Polaronic Self-trapped Excitons in Bulk Iron Oxide

The Auger recombination in bulk semiconductors can depopulate the charge carriers in a non-radiative way, which, fortunately, only has detrimental impact on optoelectronic device performance under the condition of high carrier density because the restriction arising from concurrent momentum and energy conservation limits the Auger rate. Here, we surprisingly found that the Auger recombination in bulk Fe2O3 films was more efficient than narrow-bandgap high-mobility semiconductors that were supposed to have much higher Auger rate constants than metal oxides. The Auger process in Fe2O3 was ascribed to the Coulombically coupled self-trapped excitons (STEs), which was enhanced by the relaxation of momentum conservation because of the strong spatial localization of these STEs. Furthermore, due to this localization effect the kinetic traces of the STE annihilation for different STE densities exhibited characteristics of quantized Auger recombination, and we demonstrated that these traces could be simultaneously modeled by taking into account the quantized Auger rates.

preprint2020arXiv

Study on Patterns and Effect of Task Diversity in Software Crowdsourcing

Context: The success of software crowdsourcing depends on steady tasks supply and active worker pool. Existing analysis reveals an average task failure ratio of 15.7% in software crowdsourcing market. Goal: The objective of this study is to empirically investigate patterns and effect of task diversity in software crowdsourcing platform in order to improve the success and efficiency of software crowdsourcing. Method: We propose a conceptual task diversity model, and develop an approach to measuring and analyzing task diversity.More specifically, this includes grouping similar tasks, ranking them based on their competition level and identifying the dominant attributes that distinguish among these levels, and then studying the impact of task diversity on task success and worker performance in crowdsourcing platform. The empirical study is conducted on more than one year's real-world data from TopCoder, the leading software crowdsourcing platform. Results: We identified that monetary prize and task complexity are the dominant attributes that differentiate among different competition levels. Based on these dominant attributes, we found three task diversity patterns (configurations) from workers behavior perspective: responsive to prize, responsive to prize and complexity and over responsive to prize. This study supports that1) responsive to prize configuration provides highest level of task density and workers' reliability in a platform; 2) responsive to prize and complexity configuration leads to attracting high level of trustworthy workers; 3) over responsive to prize configuration results in highest task stability and the lowest failure ratio in the platform for not high similar tasks.

preprint2018arXiv

Crowdtesting : When is The Party Over?

Trade-offs such as "how much testing is enough" are critical yet challenging project decisions in software engineering. Most existing approaches adopt risk-driven or value-based analysis to prioritize test cases and minimize test runs. However, none of these is applicable to the emerging crowd testing paradigm where task requesters typically have no control over online crowdworkers's dynamic behavior and uncertain performance. In current practice, deciding when to close a crowdtesting task is largely done by guesswork due to lack of decision support. This paper intends to fill this gap by introducing automated decision support for monitoring and determining appropriate time to close the crowdtesting tasks. First, this paper investigates the necessity and feasibility of close prediction of crowdtesting tasks based on industrial dataset. Then,it designs 8 methods for close prediction, based on various models including the bug trend, bug arrival model, capture-recapture model.Finally, the evaluation is conducted on 218 crowdtesting tasks from one of the largest crowdtesting platforms in China, and the results show that a median of 91% bugs can be detected with 49% saved cost.