Trust snapshot

Quick read

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

69 published item(s)

preprint2026arXiv

Ace-Skill: Bootstrapping Multimodal Agents with Prioritized and Clustered Evolution

Self-evolving agents present a promising path toward continual adaptation by distilling task interactions into reusable knowledge artifacts. In practice, this paradigm remains hindered by two coupled bottlenecks: data inefficiency, where costly rollout effort is disproportionately spent on low-value samples rather than informative ones, and knowledge interference, where heterogeneous knowledge stored in shared repositories leads to noisy retrieval and task-misaligned guidance. Together, these issues form a self-reinforcing failure loop in which uninformative rollouts yield noisy knowledge, which in turn degrades subsequent rollouts. In this work, we introduce Ace-Skill, a co-evolutionary framework that jointly optimizes rollout allocation and knowledge organization for self-evolving multimodal agents. Specifically, Ace-Skill combines aprioritized sampler with lazy-decay proficiency tracking to focus rollouts on informative and insufficiently mastered samples, and a clustered organizer that semantically clusters knowledge for cleaner retrieval and more reliable adaptation. By improving sampling and organization together, Ace-Skill turns self-evolution into a virtuous cycle in which more informative rollouts produce higher-quality knowledge that supports stronger subsequent rollouts. Across four multimodal tool-use benchmarks, Ace-Skill delivers strong gains (e.g., +35.46% relative improvement in Avg@4 accuracy), enabling an opensource 35B MoE model to match or surpass proprietary models. The acquired knowledge also transfers effectively in a zero-shot manner to smaller 9B and 4B models, allowing resource-constrained agents to inherit advanced capabilities without additional training. The code has been publicly available at https://github.com/AMAP-ML/Ace-Skill.

preprint2026arXiv

Chameleon: Automated Color Palette Adaptation for Dark Mode Data Visualizations

Dark mode has gained widespread adoption across mobile platforms due to its benefits in reducing eye strain and conserving battery life. However, while the mobile system switches to dark mode, most visualizations remain designed for light mode, causing visual disruptions. Existing methods, such as manual adjustment or color inversion, are either time-consuming or fail to preserve the semantic meaning of colors in visualizations, making them less effective in dark mode. To address this challenge, we propose Chameleon, an algorithm that automatically transforms light mode visualizations into dark mode while maintaining visual clarity and color semantics. By optimizing for luminance contrast, color consistency, and adjacent color differences, Chameleon ensures that the transformed visualizations are legible and visually coherent. Our evaluation includes case study, expert interview, system evaluation, and a user study, and these demonstrate that Chameleon is effective at translating visualizations for dark mode.

preprint2026arXiv

D$^2$Evo: Dual Difficulty-Aware Self-Evolution for Data-Efficient Reinforcement Learning

Reinforcement learning (RL) has demonstrated potential for enhancing reasoning in large language models (LLMs). However, effective RL training, which requires medium-difficulty training samples, faces two fundamental challenges: Effective Data Scarcity and Dynamic Difficulty Shifts, where medium-difficulty samples are scarce and become trivial as models improve. Existing methods mitigate this scarcity to some extent by generating training samples. However, these approaches suffer from anchor-free generation, ignoring co-evolution, and difficulty mismatch. To address these issues, we propose D$^2$Evo, a Dual Difficulty-aware self-Evolution RL framework. In each iteration, our method mines medium-difficulty anchors based on the current Solver's capability, trains the Questioner to generate diverse questions at appropriate difficulty levels, and jointly optimizes both components to enable progressive reasoning gains. Extensive experiments demonstrate that D$^2$Evo outperforms existing methods on mathematical reasoning benchmarks with fewer than 2K real mathematical samples, and exhibits strong generalization on general reasoning benchmarks.

preprint2026arXiv

Decompose to Understand, Fuse to Detect: Frequency-Decoupled Anomaly Detection for Encrypted Network Traffic

Network traffic anomaly detection represents a critical cybersecurity task, yet widespread encryption makes this task increasingly challenging. In response, image-based methods that model traffic as visual patterns have emerged as the dominant approach. However, this work pioneers the identification of a pervasive ``full-frequency'' characteristic and an associated limitation termed ``spectral mismatch'' within this paradigm. Specifically, while encrypted traffic exhibits prominent high-frequency components, mainstream reconstruction methods demonstrate an inherent bias toward learning low-frequency information. This fundamental mismatch results in incomplete representations that consequently degrade anomaly detection performance. To address this challenge, we propose FreeUp, a novel frequency-decoupled framework designed explicitly for encrypted traffic analysis. FreeUp decomposes traffic data into distinct low- and high-frequency bands, processing them through separate, dedicated branches along with a customized training strategy that ensures stable and independent frequency-specific learning. Furthermore, recognizing that simple reconstruction error proves inadequate for evaluating dual-branch architectures, we introduce an uncertainty-inspired fusion scoring mechanism. This mechanism quantifies the reconstruction uncertainty of the frequency-specific branches and dynamically integrates their outputs, yielding a more comprehensive and reliable anomaly score. Extensive experiments across multiple benchmarks demonstrate that FreeUp consistently outperforms state-of-the-art baselines. The code is available at https://github.com/ikun0124/FreeUp.

preprint2026arXiv

Implicit Action Chunking for Smooth Continuous Control

Reinforcement learning often produces high-frequency oscillatory control signals that undermine the safety and stability required for physical deployment. Explicit action chunking addresses this by predicting fixed-horizon trajectories but scales the policy output dimension proportionally with the horizon length, leading to optimization difficulties and incompatibility with standard step-wise interaction. To overcome these challenges, this paper proposes Dual-Window Smoothing (DWS), an implicit action chunking framework for smooth continuous control. Unlike explicit methods, DWS enforces temporal coherence without expanding the action space. It uses a dual-window design: an execution window that ensures physical smoothness through deterministic modulation, and a value window that aligns temporal-difference targets over the horizon to correct critic bias caused by open-loop execution. DWS also includes a lightweight actor-side temporal regularizer based on first-order action differences to promote global continuity. This design effectively bridges the gap between temporal abstraction and reactive step-wise control. Experiments on benchmarks including the DeepMind Control Suite and industrial energy management tasks show that DWS outperforms state-of-the-art (SOTA) baselines. In complex vision-based autonomous driving tasks, DWS achieves smoother control, safer behavior with reduced jitter, and attains a 100% success rate.

preprint2026arXiv

Learning Agentic Policy from Action Guidance

Agentic reinforcement learning (RL) for Large Language Models (LLMs) critically depends on the exploration capability of the base policy, as training signals emerge only within its in-capability region. For tasks where the base policy cannot reach reward states, additional training or external guidance is needed to recover effective learning signals. Rather than relying on costly iterative supervised fine tuning (SFT), we exploit the abundant action data generated in everyday human interactions. We propose \textsc{ActGuide-RL}, which injects action data as plan-style reference guidance, enabling the agentic policy to overcome reachability barriers to reward states. Guided and unguided rollouts are then jointly optimized via mixed-policy training, internalizing the exploration gains back into the unguided policy. Motivated by a theoretical and empirical analysis of the benefit-risk trade-off, we adopt a minimal intervention principle that invokes guidance only as an adaptive fallback, matching task difficulty while minimizing off-policy risk. On search-agent benchmarks, \textsc{ActGuide-RL} substantially improves over zero RL (+10.7 pp on GAIA and +19 pp on XBench with Qwen3-4B), and performs on par with the SFT+RL pipeline without any cold start. This suggests a new paradigm for agentic RL that reduces the reliance on heavy SFT data by using scalable action guidance instead.

preprint2026arXiv

Nip Rumors in the Bud: Retrieval-Guided Topic-Level Adaptation for Test-Time Fake News Video Detection

Fake News Video Detection (FNVD) is critical for social stability. Existing methods typically assume consistent news topic distribution between training and test phases, failing to detect fake news videos tied to emerging events and unseen topics. To bridge this gap, we introduce RADAR, the first framework that enables test-time adaptation to unseen news videos. RADAR pioneers a new retrieval-guided adaptation paradigm that leverages stable (source-close) videos from the target domain to guide robust adaptation of semantically related but unstable instances. Specifically, we propose an Entropy Selection-Based Retrieval mechanism that provides videos with stable (low-entropy), relevant references for adaptation. We also introduce a Stable Anchor-Guided Alignment module that explicitly aligns unstable instances' representations to the source domain via distribution-level matching with their stable references, mitigating severe domain discrepancies. Finally, our novel Target-Domain Aware Self-Training paradigm can generate informative pseudo-labels augmented by stable references, capturing varying and imbalanced category distributions in the target domain and enabling RADAR to adapt to the fast-changing label distributions. Extensive experiments demonstrate that RADAR achieves superior performance for test-time FNVD, enabling strong on-the-fly adaptation to unseen fake news video topics.

preprint2026arXiv

PixelArena: A benchmark for Pixel-Precision Visual Intelligence

Omni-modal models that have multimodal input and output are emerging. However, benchmarking their multimodal generation, especially in image generation, is challenging due to the subtleties of human preferences and model biases. Many image generation benchmarks focus on aesthetics instead of the fine-grained generation capabilities of these models, failing to evaluate their visual intelligence with objective metrics. In PixelArena, we propose using semantic segmentation tasks to objectively examine their fine-grained generative intelligence with pixel precision. With our benchmark and experiments, we find the latest Gemini 3 Pro Image has emergent image generation capabilities that generate semantic masks with high fidelity under zero-shot settings, showcasing visual intelligence unseen before and true generalization in new image generation tasks. We further investigate its results, compare them qualitatively and quantitatively with those of other models, and present failure cases. The findings not only signal exciting progress in the field but also provide insights into future research related to dataset development, omni-modal model development, and the design of metrics.

preprint2026arXiv

Robust LLM Unlearning Against Relearning Attacks: The Minor Components in Representations Matter

Large language model (LLM) unlearning aims to remove specific data influences from pre-trained model without costly retraining, addressing privacy, copyright, and safety concerns. However, recent studies reveal a critical vulnerability: unlearned models rapidly recover "forgotten" knowledge through relearning attacks. This fragility raises serious security concerns, especially for open-weight models. In this work, we investigate the fundamental mechanism underlying this fragility from a representation geometry perspective. We discover that existing unlearning methods predominantly optimize along dominant components, leaving minor components largely unchanged. Critically, during relearning attacks, the modifications in these dominant components are easily reversed, enabling rapid knowledge recovery, whereas minor components exhibit stronger resistance to such reversal. We further provide a theoretical analysis that explains both observations from the spectral structure of representations. Building on this insight, we propose Minor Component Unlearning (MCU), a novel unlearning approach that explicitly targets minor components in representations. By concentrating unlearning effects in these inherently robust directions, our method achieves substantially improved resistance to relearning attacks. Extensive experiments on three datasets validate our approach, demonstrating significant improvements over state-of-the-art methods including sharpness-aware minimization.

preprint2026arXiv

SaaSBench: Exploring the Boundaries of Coding Agents in Long-Horizon Enterprise SaaS Engineering

As autonomous coding agents become capable of handling increasingly long-horizon tasks, they have gradually demonstrated the potential to complete end-to-end software development. Although existing benchmarks have recently evolved from localized code editing to from-scratch project generation, they remain confined to structurally simplified, single-stack applications. Consequently, they fail to capture the heterogeneous environments, full-stack orchestration, and system-level complexity of real enterprise Software as a Service (SaaS) systems, leaving a critical gap in assessing agents under realistic engineering constraints. To fill this gap, we introduce SaaSBench, the first benchmark designed to explore the boundaries of AI agents in enterprise SaaS engineering. Spanning 30 complex tasks across 6 SaaS domains with 5,370 validation nodes, it incorporates 8 programming languages, 6 databases, and 13 frameworks to meticulously mirror real-world software heterogeneity. Furthermore, we design a dependency-aware hybrid evaluation paradigm tailored for complex systems with long horizons and multi-component coupling, enabling fine-grained, reproducible assessment. Crucially, our extensive experiments reveal a striking insight: the primary bottleneck for state-of-the-art agents is not generating isolated code logic, but successfully configuring and integrating a multi-component system. Over 95\% of task failures occur before agents even reach deep business logic, with models often falling victim to overconfidence and prematurely halting during foundational system setup, or getting trapped in ineffective debugging loops. We hope SaaSBench serves as a practical and challenging testbed to drive the evolution of reliable, system-level coding agents. The code is available at \url{https://github.com/ShadeCloak/SaaSbench}.

preprint2026arXiv

The two-variable elliptic genus in odd dimensions

A kind of two-variable elliptic genus for almost-complex manifolds was introduced by Ping Li and its various properties were established by him. In this paper, we define a two-variable elliptic genus for odd dimensional spin manifolds which is the index for some Toeplitz operator and a holomorphic $SL(2,Z)$-Jacobi form. We also define some two-variable elliptic genera for almost-complex manifolds and odd dimensional spin manifolds which are holomorphic $Γ_0(2)$, $Γ^0(2)$, $Γ_θ$-Jacobi forms. By these Jacobi forms, we can get some $SL(2,{\bf Z})$ and $Γ^0(2)$ modular forms. By these $SL(2,{\bf Z})$ and $Γ^0(2)$ modular forms, we get some interesting anomaly cancellation formulas for almost complex manifolds and odd spin manifolds. As corollaries, we get some divisibility results of the holomorphic Euler characteristic number and the index of Toeplitz operators. In addition, we also define some another two-variable elliptic genera for even (rep. odd ) dimensional manifolds which are meromorphic $Γ_0(2)$, $Γ^0(2)$, $Γ_θ$-Jacobi forms.

preprint2026arXiv

Thinking with Map: Reinforced Parallel Map-Augmented Agent for Geolocalization

The image geolocalization task aims to predict the location where an image was taken anywhere on Earth using visual clues. Existing large vision-language model (LVLM) approaches leverage world knowledge, chain-of-thought reasoning, and agentic capabilities, but overlook a common strategy used by humans -- using maps. In this work, we first equip the model \textit{Thinking with Map} ability and formulate it as an agent-in-the-map loop. We develop a two-stage optimization scheme for it, including agentic reinforcement learning (RL) followed by parallel test-time scaling (TTS). The RL strengthens the agentic capability of model to improve sampling efficiency, and the parallel TTS enables the model to explore multiple candidate paths before making the final prediction, which is crucial for geolocalization. To evaluate our method on up-to-date and in-the-wild images, we further present MAPBench, a comprehensive geolocalization training and evaluation benchmark composed entirely of real-world images. Experimental results show that our method outperforms existing open- and closed-source models on most metrics, specifically improving Acc@500m from 8.0\% to 22.1\% compared to \textit{Gemini-3-Pro} with Google Search/Map grounded mode.

preprint2025arXiv

Conch: Competitive Debate Analysis via Visualizing Clash Points and Hierarchical Strategies

In-depth analysis of competitive debates is essential for participants to develop argumentative skills and refine strategies, and further improve their debating performance. However, manual analysis of unstructured and unlabeled textual records of debating is time-consuming and ineffective, as it is challenging to reconstruct contextual semantics and track logical connections from raw data. To address this, we propose Conch, an interactive visualization system that systematically analyzes both what is debated and how it is debated. In particular, we propose a novel parallel spiral visualization that compactly traces the multidimensional evolution of clash points and participant interactions throughout debate process. In addition, we leverage large language models with well-designed prompts to automatically identify critical debate elements such as clash points, disagreements, viewpoints, and strategies, enabling participants to understand the debate context comprehensively. Finally, through two case studies on real-world debates and a carefully-designed user study, we demonstrate Conch's effectiveness and usability for competitive debate analysis.

preprint2023arXiv

Improving photon number resolvability of a superconducting nanowire detector array using a level comparator circuit

Photon number resolving (PNR) capability is very important in many optical applications, including quantum information processing, fluorescence detection, and few-photon-level ranging and imaging. Superconducting nanowire single-photon detectors (SNSPDs) with a multipixel interleaved architecture give the array an excellent spatial PNR capability. However, the signal-to-noise ratio (SNR) of the photon number resolution (SNRPNR) of the array will be degraded with increasing the element number due to the electronic noise in the readout circuit, which limits the PNR resolution as well as the maximum PNR number. In this study, a 16-element interleaved SNSPD array was fabricated, and the PNR capability of the array was investigated and analyzed. By introducing a level comparator circuit (LCC), the SNRPNR of the detector array was improved over a factor of four. In addition, we performed a statistical analysis of the photon number on this SNSPD array with LCC, showing that the LCC method effectively enhances the PNR resolution. Besides, the system timing jitter of the detector was reduced from 90 ps to 72 ps due to the improved electrical SNR.

preprint2022arXiv

Affine connections on singular multiply warped products and singular twisted products

In this paper, we generalize the results in [Y. Wang: Affine connections on singular warped products. Int. J. Geom. Methods Mod. Phys. 18(5), 2150076, (2021).] to singular multiply warped products and singular twisted products. We study singular multiply warped products and singular twisted products and their curvature with the semi-symmetric metric connection and the semi-symmetric non-metric connection. We also discuss Koszul forms associated with the almost product structure and their curvature of singular multiply warped products and singular twisted products. Finally, several examples are presented to demonstrate the theoretical results.

preprint2022arXiv

ComputableViz: Mathematical Operators as a Formalism for Visualization Processing and Analysis

Data visualizations are created and shared on the web at an unprecedented speed, raising new needs and questions for processing and analyzing visualizations after they have been generated and digitized. However, existing formalisms focus on operating on a single visualization instead of multiple visualizations, making it challenging to perform analysis tasks such as sorting and clustering visualizations. Through a systematic analysis of previous work, we abstract visualization-related tasks into mathematical operators such as union and propose a design space of visualization operations. We realize the design by developing ComputableViz, a library that supports operations on multiple visualization specifications. To demonstrate its usefulness and extensibility, we present multiple usage scenarios concerning processing and analyzing visualization, such as generating visualization embeddings and automatically making visualizations accessible. We conclude by discussing research opportunities and challenges for managing and exploiting the massive visualizations on the web.

preprint2022arXiv

DRL-M4MR: An Intelligent Multicast Routing Approach Based on DQN Deep Reinforcement Learning in SDN

Traditional multicast routing methods have some problems in constructing a multicast tree, such as limited access to network state information, poor adaptability to dynamic and complex changes in the network, and inflexible data forwarding. To address these defects, the optimal multicast routing problem in software-defined networking (SDN) is tailored as a multi-objective optimization problem, and an intelligent multicast routing algorithm DRL-M4MR based on the deep Q network (DQN) deep reinforcement learning (DRL) method is designed to construct a multicast tree in SDN. First, the multicast tree state matrix, link bandwidth matrix, link delay matrix, and link packet loss rate matrix are designed as the state space of the DRL agent by combining the global view and control of the SDN. Second, the action space of the agent is all the links in the network, and the action selection strategy is designed to add the links to the current multicast tree under four cases. Third, single-step and final reward function forms are designed to guide the intelligence to make decisions to construct the optimal multicast tree. The experimental results show that, compared with existing algorithms, the multicast tree construct by DRL-M4MR can obtain better bandwidth, delay, and packet loss rate performance after training, and it can make more intelligent multicast routing decisions in a dynamic network environment.

preprint2022arXiv

Exceptional spin wave dynamics in an antiferromagnetic honeycomb lattice

We theoretically investigate possible effects of electric current on the spin wave dynamics for the Néel-type antiferromagnetic order in a honeycomb lattice. Based on a general vector decomposition of the spin polarization of conduction electrons, we find that there can exist reciprocal and nonreciprocal terms in the current-induced torque acting on the local spins in the system. Furthermore, we show that the reciprocal terms will cause the spin wave Doppler effect, while the nonreciprocal terms can induce rich non-Hermitian topological phenomena in the spin wave dynamics, including exceptional points, bulk Fermi arc, non-Hermitian skin effect, etc. Our results indicate the capability to manipulate non-Hermitian magnons in magnetic materials by electric current, which could be important for both fundamental physics and technology applications.

preprint2022arXiv

GestureLens: Visual Analysis of Gestures in Presentation Videos

Appropriate gestures can enhance message delivery and audience engagement in both daily communication and public presentations. In this paper, we contribute a visual analytic approach that assists professional public speaking coaches in improving their practice of gesture training through analyzing presentation videos. Manually checking and exploring gesture usage in the presentation videos is often tedious and time-consuming. There lacks an efficient method to help users conduct gesture exploration, which is challenging due to the intrinsically temporal evolution of gestures and their complex correlation to speech content. In this paper, we propose GestureLens, a visual analytics system to facilitate gesture-based and content-based exploration of gesture usage in presentation videos. Specifically, the exploration view enables users to obtain a quick overview of the spatial and temporal distributions of gestures. The dynamic hand movements are firstly aggregated through a heatmap in the gesture space for uncovering spatial patterns, and then decomposed into two mutually perpendicular timelines for revealing temporal patterns. The relation view allows users to explicitly explore the correlation between speech content and gestures by enabling linked analysis and intuitive glyph designs. The video view and dynamic view show the context and overall dynamic movement of the selected gestures, respectively. Two usage scenarios and expert interviews with professional presentation coaches demonstrate the effectiveness and usefulness of GestureLens in facilitating gesture exploration and analysis of presentation videos.

preprint2022arXiv

Global Solutions of the Compressible Euler Equations with Large Initial Data of Spherical Symmetry and Positive Far-Field Density

We are concerned with the global existence theory for spherically symmetric solutions of the multidimensional compressible Euler equations with large initial data of positive far-field density. The central feature of the solutions is the strengthening of waves as they move radially inward toward the origin. Various examples have shown that the spherically symmetric solutions of the Euler equations blow up near the origin at certain time. A fundamental unsolved problem is whether the density of the global solution would form concentration to become a measure near the origin for the case when the total initial-energy is unbounded and the wave propagation is not at a finite speed starting initially. In this paper, we establish a global existence theory for spherically symmetric solutions of the compressible Euler equations with large initial data of positive far-field density and relative finite-energy. This is achieved by developing a new approach via adapting a class of degenerate density-dependent viscosity terms, so that a rigorous proof of the vanishing viscosity limit of global weak solutions of the Navier-Stokes equations with the density-dependent viscosity terms to the corresponding global solution of the Euler equations with large initial data of spherical symmetry and positive far-field density can be obtained. One of our main observations is that the adapted class of degenerate density-dependent viscosity terms not only includes the viscosity terms for the Navier-Stokes equations for shallow water (Saint Venant) flows but also, more importantly, is suitable to achieve our key objective of this paper. These results indicate that concentration is not formed in the vanishing viscosity limit for the Navier-Stokes approximations constructed in this paper even when the total initial-energy is unbounded.

preprint2022arXiv

GNNLens: A Visual Analytics Approach for Prediction Error Diagnosis of Graph Neural Networks

Graph Neural Networks (GNNs) aim to extend deep learning techniques to graph data and have achieved significant progress in graph analysis tasks (e.g., node classification) in recent years. However, similar to other deep neural networks like Convolutional Neural Networks (CNNs) and Recurrent Neural Networks (RNNs), GNNs behave like a black box with their details hidden from model developers and users. It is therefore difficult to diagnose possible errors of GNNs. Despite many visual analytics studies being done on CNNs and RNNs, little research has addressed the challenges for GNNs. This paper fills the research gap with an interactive visual analysis tool, GNNLens, to assist model developers and users in understanding and analyzing GNNs. Specifically, Parallel Sets View and Projection View enable users to quickly identify and validate error patterns in the set of wrong predictions; Graph View and Feature Matrix View offer a detailed analysis of individual nodes to assist users in forming hypotheses about the error patterns. Since GNNs jointly model the graph structure and the node features, we reveal the relative influences of the two types of information by comparing the predictions of three models: GNN, Multi-Layer Perceptron (MLP), and GNN Without Using Features (GNNWUF). Two case studies and interviews with domain experts demonstrate the effectiveness of GNNLens in facilitating the understanding of GNN models and their errors.

preprint2022arXiv

Graph-based Approximate NN Search: A Revisit

Nearest neighbor search plays a fundamental role in many disciplines such as multimedia information retrieval, data-mining, and machine learning. The graph-based search approaches show superior performance over other types of approaches in recent studies. In this paper, the graph-based NN search is revisited. We optimize two key components in the approach, namely the search procedure and the graph that supports the search. For the graph construction, a two-stage graph diversification scheme is proposed, which makes a good trade-off between the efficiency and reachability for the search procedure that builds upon it. Moreover, the proposed diversification scheme allows the search procedure to decide dynamically how many nodes should be visited in one node's neighborhood. By this way, the computing power of the devices is fully utilized when the search is carried out under different circumstances. Furthermore, two NN search procedures are designed respectively for small and large batch queries on the GPU. The optimized NN search, when being supported by the two-stage diversified graph, outperforms all the state-of-the-art approaches on both the CPU and the GPU across all the considered large-scale datasets.

preprint2022arXiv

Investigation of nonlinear squeeze-film damping involving rarefied gas effect in micro-electro-mechanical-systems

In this paper, the nonlinear squeeze-film damping (SFD) involving rarefied gas effect in the micro-electro-mechanical-systems (MEMS) is investigated. Considering the motion of structures (beam, cantilever, and membrane) in MEMS, the dynamic response of structure will be influenced largely by the squeeze-film damping. In the traditional model, a viscous damping assumption that damping force is linear with moving velocity is used. As the nonlinear damping phenomenon is observed for a micro-structure oscillating with a high-velocity, this assumption is invalid and will generates error result for predicting the response of micro-structure. In addition, due to the small size of device and the low pressure of encapsulation, the gas in MEMS usually is rarefied gas. Therefore, to correctly predict the damping force, the rarefied gas effect must be considered. To study the nonlinear SFD phenomenon involving the rarefied gas effect, a kinetic method, namely discrete unified gas kinetic scheme (DUGKS), is introduced. And based on DUGKS, two solving methods, a traditional decoupled method (Eulerian scheme) and a coupled framework (arbitrary Lagrangian-Eulerian scheme), are adopted. With these two methods, two basic motion forms, linear (perpendicular) and tilting motions of a rigid micro-beam, are studied with forced and free oscillations.

preprint2022arXiv

Non-neglectable entropy effect on sintering of supported nanoparticles

Sintering refers to particle coalescence by heat, which has been known as a thermal phenomenon involving all aspects of natural science for centuries. It is particularly important in heterogeneous catalysis because normally sintering results in deactivation of the catalysts. In previous studies, the enthalpy contribution was considered to be dominant in sintering and the entropy effect is generally considered neglectable. However, we unambiguously demonstrate in this work that entropy could prevail over the enthalpy contribution to dominate the sintering behavior of supported nanoparticles (NPs) by designed experiments and improved theoretical framework. Using in situ Cs-corrected environmental scanning transmission electron microscopy and synchrotron-based ambient pressure X-ray photoelectron spectroscopy, we observe the unprecedent entropy-driven phenomenon that supported NPs reversibly redisperse upon heating and sinter upon cooling in three systems (Pd-CeO2, Cu-TiO2, Ag-TiO2). We quantitatively show that the configurational entropy of highly dispersed ad-atoms is large enough to reverse their sintering tendency at the elevated temperature. This work reshapes the basic understanding of sintering at the nanoscale and opens the door for various de-novo designs of thermodynamically stable nanocatalysts.

preprint2022arXiv

RumorLens: Interactive Analysis and Validation of Suspected Rumors on Social Media

With the development of social media, various rumors can be easily spread on the Internet and such rumors can have serious negative effects on society. Thus, it has become a critical task for social media platforms to deal with suspected rumors. However, due to the lack of effective tools, it is often difficult for platform administrators to analyze and validate rumors from a large volume of information on a social media platform efficiently. We have worked closely with social media platform administrators for four months to summarize their requirements of identifying and analyzing rumors, and further proposed an interactive visual analytics system, RumorLens, to help them deal with the rumor efficiently and gain an in-depth understanding of the patterns of rumor spreading. RumorLens integrates natural language processing (NLP) and other data processing techniques with visualization techniques to facilitate interactive analysis and validation of suspected rumors. We propose well-coordinated visualizations to provide users with three levels of details of suspected rumors: an overview displays both spatial distribution and temporal evolution of suspected rumors; a projection view leverages a metaphor-based glyph to represent each suspected rumor and further enable users to gain a quick understanding of their overall characteristics and similarity with each other; a propagation view visualizes the dynamic spreading details of a suspected rumor with a novel circular visualization design, and facilitates interactive analysis and validation of rumors in a compact manner. By using a real-world dataset collected from Sina Weibo, one case study with a domain expert is conducted to evaluate

preprint2022arXiv

Structure-aware Visualization Retrieval

With the wide usage of data visualizations, a huge number of Scalable Vector Graphic (SVG)-based visualizations have been created and shared online. Accordingly, there has been an increasing interest in exploring how to retrieve perceptually similar visualizations from a large corpus, since it can benefit various downstream applications such as visualization recommendation. Existing methods mainly focus on the visual appearance of visualizations by regarding them as bitmap images. However, the structural information intrinsically existing in SVG-based visualizations is ignored. Such structural information can delineate the spatial and hierarchical relationship among visual elements, and characterize visualizations thoroughly from a new perspective. This paper presents a structure-aware method to advance the performance of visualization retrieval by collectively considering both the visual and structural information. We extensively evaluated our approach through quantitative comparisons, a user study and case studies. The results demonstrate the effectiveness of our approach and its advantages over existing methods.

preprint2022arXiv

StyleSwin: Transformer-based GAN for High-resolution Image Generation

Despite the tantalizing success in a broad of vision tasks, transformers have not yet demonstrated on-par ability as ConvNets in high-resolution image generative modeling. In this paper, we seek to explore using pure transformers to build a generative adversarial network for high-resolution image synthesis. To this end, we believe that local attention is crucial to strike the balance between computational efficiency and modeling capacity. Hence, the proposed generator adopts Swin transformer in a style-based architecture. To achieve a larger receptive field, we propose double attention which simultaneously leverages the context of the local and the shifted windows, leading to improved generation quality. Moreover, we show that offering the knowledge of the absolute position that has been lost in window-based transformers greatly benefits the generation quality. The proposed StyleSwin is scalable to high resolutions, with both the coarse geometry and fine structures benefit from the strong expressivity of transformers. However, blocking artifacts occur during high-resolution synthesis because performing the local attention in a block-wise manner may break the spatial coherency. To solve this, we empirically investigate various solutions, among which we find that employing a wavelet discriminator to examine the spectral discrepancy effectively suppresses the artifacts. Extensive experiments show the superiority over prior transformer-based GANs, especially on high resolutions, e.g., 1024x1024. The StyleSwin, without complex training strategies, excels over StyleGAN on CelebA-HQ 1024, and achieves on-par performance on FFHQ-1024, proving the promise of using transformers for high-resolution image generation. The code and models will be available at https://github.com/microsoft/StyleSwin.

preprint2022arXiv

Super warped products with a semi-symmetric non-metric connection

In this paper, we define a semi-symmetric non-metric connection on super Riemannian manifolds. And we compute the curvature tensor and the Ricci tensor of a semi-symmetric non-metric connection on super warped product spaces. Next, we introduce two kinds of super warped product spaces with a semi-symmetric non-metric connection and give the conditions that two super warped product spaces with a semi-symmetric non-metric connection are the Einstein super spaces with a semi-symmetric non-metric connection.

preprint2022arXiv

The perturbation of the de Rham Hodge Operator and the Kastler-Kalau-Walze type theorem for manifolds with boundary

In this paper, we give Lichnerowicz type formulas for the perturbation of the de Rham Hodge operator. We prove the Kastler-Kalau-Walze type theorems for the perturbation of the de Rham Hodge operator on 4-dimensional and 6-dimensional compact manifolds with (resp.without) boundary. Some concrete examples of the perturbation of the de Rham Hodge operator are provided for our main theorems.

preprint2022arXiv

VACSEN: A Visualization Approach for Noise Awareness in Quantum Computing

Quantum computing has attracted considerable public attention due to its exponential speedup over classical computing. Despite its advantages, today's quantum computers intrinsically suffer from noise and are error-prone. To guarantee the high fidelity of the execution result of a quantum algorithm, it is crucial to inform users of the noises of the used quantum computer and the compiled physical circuits. However, an intuitive and systematic way to make users aware of the quantum computing noise is still missing. In this paper, we fill the gap by proposing a novel visualization approach to achieve noise-aware quantum computing. It provides a holistic picture of the noise of quantum computing through multiple interactively coordinated views: a Computer Evolution View with a circuit-like design overviews the temporal evolution of the noises of different quantum computers, a Circuit Filtering View facilitates quick filtering of multiple compiled physical circuits for the same quantum algorithm, and a Circuit Comparison View with a coupled bar chart enables detailed comparison of the filtered compiled circuits. We extensively evaluate the performance of VACSEN through two case studies on quantum algorithms of different scales and an in-depth interviews with 12 quantum computing users. The results demonstrate the effectiveness and usability of VACSEN in achieving noise-aware quantum computing.

preprint2022arXiv

Visilence: An Interactive Visualization Tool for Error Resilience Analysis

Soft errors have become one of the major concerns for HPC applications, as those errors can result in seriously corrupted outcomes, such as silent data corruptions (SDCs). Prior studies on error resilience have studied the robustness of HPC applications. However, it is still difficult for program developers to identify potential vulnerability to soft errors. In this paper, we present Visilence, a novel visualization tool to visually analyze error vulnerability based on the control-flow graph generated from HPC applications. Visilence efficiently visualizes the affected program states under injected errors and presents the visual analysis of the most vulnerable parts of an application. We demonstrate the effectiveness of Visilence through a case study.

preprint2022arXiv

Who Will Support My Project? Interactive Search of Potential Crowdfunding Investors Through InSearch

Crowdfunding provides project founders with a convenient way to reach online investors. However, it is challenging for founders to find the most potential investors and successfully raise money for their projects on crowdfunding platforms. A few machine learning based methods have been proposed to recommend investors' interest in a specific crowdfunding project, but they fail to provide project founders with explanations in detail for these recommendations, thereby leading to an erosion of trust in predicted investors. To help crowdfunding founders find truly interested investors, we conducted semi-structured interviews with four crowdfunding experts and presents inSearch, a visual analytic system. inSearch allows founders to search for investors interactively on crowdfunding platforms. It supports an effective overview of potential investors by leveraging a Graph Neural Network to model investor preferences. Besides, it enables interactive exploration and comparison of the temporal evolution of different investors' investment details.

preprint2021arXiv

A Visual Analytics Approach to Facilitate the Proctoring of Online Exams

Online exams have become widely used to evaluate students' performance in mastering knowledge in recent years, especially during the pandemic of COVID-19. However, it is challenging to conduct proctoring for online exams due to the lack of face-to-face interaction. Also, prior research has shown that online exams are more vulnerable to various cheating behaviors, which can damage their credibility. This paper presents a novel visual analytics approach to facilitate the proctoring of online exams by analyzing the exam video records and mouse movement data of each student. Specifically, we detect and visualize suspected head and mouse movements of students in three levels of detail, which provides course instructors and teachers with convenient, efficient and reliable proctoring for online exams. Our extensive evaluations, including usage scenarios, a carefully-designed user study and expert interviews, demonstrate the effectiveness and usability of our approach.

preprint2021arXiv

Affine connections and Gauss-Bonnet theorems in the Heisenberg group

In this paper, we compute sub-Riemannian limits of Gaussian curvature associated to two kinds of Schouten-Van Kampen affine connections and the adapted connection for a Euclidean $C^2$-smooth surface in the Heisenberg group away from characteristic points and signed geodesic curvature associated to two kinds of Schouten-Van Kampen affine connections and the adapted connection for Euclidean $C^2$-smooth curves on surfaces. We get Gauss-Bonnet theorems associated to two kinds of Schouten-Van Kampen affine connections in the Heisenberg group.

preprint2021arXiv

BatchLens: A Visualization Approach for Analyzing Batch Jobs in Cloud Systems

Cloud systems are becoming increasingly powerful and complex. It is highly challenging to identify anomalous execution behaviors and pinpoint problems by examining the overwhelming intermediate results/states in complex application workflows. Domain scientists urgently need a friendly and functional interface to understand the quality of the computing services and the performance of their applications in real time. To meet these needs, we explore data generated by job schedulers and investigate general performance metrics (e.g., utilization of CPU, memory and disk I/O). Specifically, we propose an interactive visual analytics approach, BatchLens, to provide both providers and users of cloud service with an intuitive and effective way to explore the status of system batch jobs and help them conduct root-cause analysis of anomalous behaviors in batch jobs. We demonstrate the effectiveness of BatchLens through a case study on the public Alibaba bench workload trace datasets.

preprint2021arXiv

Explore missing flow dynamics by physics-informed deep learning: the parameterised governing systems

Gaining and understanding the flow dynamics have much importance in a wide range of disciplines, e.g. astrophysics, geophysics, biology, mechanical engineering and biomedical engineering. As a reliable way in practice, especially for turbulent flows, regional flow information such as velocity and its statistics, can be measured experimentally. Due to the poor fidelity or other technical limitations, some information may not be resolved in a region of interest. On the other hand, detailed flow features are described by the governing equations, e.g. the Navier-Stokes equations for viscous fluid, and can be resolved numerically, which is heavily dependent on the capability of either computing resources or modelling. Alternatively, we address this problem by employing the physics-informed deep learning, and treat the governing equations as a parameterised constraint to recover the missing flow dynamics. We demonstrate that with limited data, no matter from experiment or others, the flow dynamics in the region where the required data is missing or not measured, can be reconstructed with the parameterised governing equations. Meanwhile, a richer dataset, with spatial distribution of the control parameter (e.g. eddy viscosity of turbulence modellings), can be obtained. The method provided in this paper may shed light on data-driven scale-adaptive turbulent structure recovering and understanding of complex fluid physics, and can be extended to other parameterised governing systems beyond fluid mechanics.

preprint2021arXiv

Fast Evaporation Enabled Ultrathin Polymeric Coatings on Nanoporous Substrates for Highly Permeable Membranes

Membranes derived from ultrathin polymeric films are promising to meet fast separations, but currently available approaches to produce polymer films with greatly reduced thicknesses on porous supports still faces challenges. Here, defect-free ultrathin polymer covering films (UPCFs) are realized by a facile general approach of rapid solvent evaporation. By fast evaporating dilute polymer solutions, we realize ultrathin coating (~30 nm) of porous substrates exclusively on the top surface, forming UPCFs with a block copolymer of polystyrene-block-poly(2-vinyl pyridine) at room temperature or a homopolymer of poly(vinyl alcohol) (PVA) at elevated temperatures. With subsequent selective swelling to the block copolymer and crosslinking to PVA, the resulting bi-layered composite structures serve as highly permeable membranes delivering ~2-10 times higher permeability in ultrafiltration and pervaporation applications than state-of-the-art separation membranes with similar rejections and selectivities. This work opens up a new, facile avenue for the controllable fabrication of ultrathin coatings on porous substrates, which shows great potentials in membrane-based separations and other areas.

preprint2021arXiv

From Chaos to Pseudo-Randomness: A Case Study on the 2D Coupled Map Lattice

Applying chaos theory for secure digital communications is promising and it is well acknowledged that in such applications the underlying chaotic systems should be carefully chosen. However, the requirements imposed on the chaotic systems are usually heuristic, without theoretic guarantee for the resultant communication scheme. Among all the primitives for secure communications, it is well-accepted that (pseudo) random numbers are most essential. Taking the well-studied two-dimensional coupled map lattice (2D CML) as an example, this paper performs a theoretical study towards pseudo-random number generation with the 2D CML. In so doing, an analytical expression of the Lyapunov exponent (LE) spectrum of the 2D CML is first derived. Using the LEs, one can configure system parameters to ensure the 2D CML only exhibits complex dynamic behavior, and then collect pseudo-random numbers from the system orbits. Moreover, based on the observation that least significant bit distributes more evenly in the (pseudo) random distribution, an extraction algorithm E is developed with the property that, when applied to the orbits of the 2D CML, it can squeeze uniform bits. In implementation, if fixed-point arithmetic is used in binary format with a precision of $z$ bits after the radix point, E can ensure that the deviation of the squeezed bits is bounded by $2^{-z}$ . Further simulation results demonstrate that the new method not only guide the 2D CML model to exhibit complex dynamic behavior, but also generate uniformly distributed independent bits. In particular, the squeezed pseudo random bits can pass both NIST 800-22 and TestU01 test suites in various settings. This study thereby provides a theoretical basis for effectively applying the 2D CML to secure communications.

preprint2021arXiv

Prototypical Pseudo Label Denoising and Target Structure Learning for Domain Adaptive Semantic Segmentation

Self-training is a competitive approach in domain adaptive segmentation, which trains the network with the pseudo labels on the target domain. However inevitably, the pseudo labels are noisy and the target features are dispersed due to the discrepancy between source and target domains. In this paper, we rely on representative prototypes, the feature centroids of classes, to address the two issues for unsupervised domain adaptation. In particular, we take one step further and exploit the feature distances from prototypes that provide richer information than mere prototypes. Specifically, we use it to estimate the likelihood of pseudo labels to facilitate online correction in the course of training. Meanwhile, we align the prototypical assignments based on relative feature distances for two different views of the same target, producing a more compact target feature space. Moreover, we find that distilling the already learned knowledge to a self-supervised pretrained model further boosts the performance. Our method shows tremendous performance advantage over state-of-the-art methods. We will make the code publicly available.

preprint2020arXiv

A Calculus for True Concurrency

We design a calculus for true concurrency called CTC, including its syntax and operational semantics. CTC has good properties modulo several kinds of strongly truly concurrent bisimulations and weakly truly concurrent bisimulations, such as monoid laws, static laws, new expansion law for strongly truly concurrent bisimulations, $τ$ laws for weakly truly concurrent bisimulations, and full congruences for strongly and weakly truly concurrent bisimulations, and also unique solution for recursion.

preprint2020arXiv

A Review on Computational Intelligence Techniques in Cloud and Edge Computing

Cloud computing (CC) is a centralized computing paradigm that accumulates resources centrally and provides these resources to users through Internet. Although CC holds a large number of resources, it may not be acceptable by real-time mobile applications, as it is usually far away from users geographically. On the other hand, edge computing (EC), which distributes resources to the network edge, enjoys increasing popularity in the applications with low-latency and high-reliability requirements. EC provides resources in a decentralized manner, which can respond to users' requirements faster than the normal CC, but with limited computing capacities. As both CC and EC are resource-sensitive, several big issues arise, such as how to conduct job scheduling, resource allocation, and task offloading, which significantly influence the performance of the whole system. To tackle these issues, many optimization problems have been formulated. These optimization problems usually have complex properties, such as non-convexity and NP-hardness, which may not be addressed by the traditional convex optimization-based solutions. Computational intelligence (CI), consisting of a set of nature-inspired computational approaches, recently exhibits great potential in addressing these optimization problems in CC and EC. This paper provides an overview of research problems in CC and EC and recent progresses in addressing them with the help of CI techniques. Informative discussions and future research trends are also presented, with the aim of offering insights to the readers and motivating new research directions.

preprint2020arXiv

An end-to-end CNN framework for polarimetric vision tasks based on polarization-parameter-constructing network

Pixel-wise operations between polarimetric images are important for processing polarization information. For the lack of such operations, the polarization information cannot be fully utilized in convolutional neural network(CNN). In this paper, a novel end-to-end CNN framework for polarization vision tasks is proposed, which enables the networks to take full advantage of polarimetric images. The framework consists of two sub-networks: a polarization-parameter-constructing network (PPCN) and a task network. PPCN implements pixel-wise operations between images in the CNN form with 1x1 convolution kernels. It takes raw polarimetric images as input, and outputs polarization-parametric images to task network so as to complete a vison task. By training together, the PPCN can learn to provide the most suitable polarization-parametric images for the task network and the dataset. Taking faster R-CNN as task network, the experimental results show that compared with existing methods, the proposed framework achieves much higher mean-average-precision (mAP) in object detection task

preprint2020arXiv

Bidirectional Mapping Generative Adversarial Networks for Brain MR to PET Synthesis

Fusing multi-modality medical images, such as MR and PET, can provide various anatomical or functional information about human body. But PET data is always unavailable due to different reasons such as cost, radiation, or other limitations. In this paper, we propose a 3D end-to-end synthesis network, called Bidirectional Mapping Generative Adversarial Networks (BMGAN), where image contexts and latent vector are effectively used and jointly optimized for brain MR-to-PET synthesis. Concretely, a bidirectional mapping mechanism is designed to embed the semantic information of PET images into the high dimensional latent space. And the 3D DenseU-Net generator architecture and the extensive objective functions are further utilized to improve the visual quality of synthetic results. The most appealing part is that the proposed method can synthesize the perceptually realistic PET images while preserving the diverse brain structures of different subjects. Experimental results demonstrate that the performance of the proposed method outperforms other competitive cross-modality synthesis methods in terms of quantitative measures, qualitative displays, and classification evaluation.

preprint2020arXiv

Boundary layer solution of the Boltzmann equation for specular boundary condition

In the paper, we establish the existence of steady boundary layer solution of Boltzmann equation with specular boundary condition in $L^2_{x,v}\cap L^\infty_{x,v}$ in half-space. The uniqueness, continuity and exponential decay of the solution are obtained, and such estimates are important to prove the Hilbert expansion of Boltzmann equation for half-space problem with specular boundary condition.

preprint2020arXiv

Canonical connections and algebraic Ricci solitons of three-dimensional Lorentzian Lie groups

In this paper, we compute canonical connections and Kobayashi-Nomizu connections and their curvature on three-dimensional Lorentzian Lie groups with some product structure. We define algebraic Ricci solitons associated to canonical connections and Kobayashi-Nomizu connections. We classify algebraic Ricci solitons associated to canonical connections and Kobayashi-Nomizu connections on three-dimensional Lorentzian Lie groups with some product structure.

preprint2020arXiv

DFSeer: A Visual Analytics Approach to Facilitate Model Selection for Demand Forecasting

Selecting an appropriate model to forecast product demand is critical to the manufacturing industry. However, due to the data complexity, market uncertainty and users' demanding requirements for the model, it is challenging for demand analysts to select a proper model. Although existing model selection methods can reduce the manual burden to some extent, they often fail to present model performance details on individual products and reveal the potential risk of the selected model. This paper presents DFSeer, an interactive visualization system to conduct reliable model selection for demand forecasting based on the products with similar historical demand. It supports model comparison and selection with different levels of details. Besides, it shows the difference in model performance on similar products to reveal the risk of model selection and increase users' confidence in choosing a forecasting model. Two case studies and interviews with domain experts demonstrate the effectiveness and usability of DFSeer.

preprint2020arXiv

Gauss-Bonnet theorems in the affine group and the group of rigid motions of the Minkowski plane

In this paper, we compute sub-Riemannian limits of Gaussian curvature for a Euclidean $C^2$-smooth surface in the affine group and the group of rigid motions of the Minkowski plane away from characteristic points and signed geodesic curvature for Euclidean $C^2$-smooth curves on surfaces. We get Gauss-Bonnet theorems in the affine group and the group of rigid motions of the Minkowski plane.

preprint2020arXiv

On the Leibniz rule and Laplace transform for fractional derivatives

Taylor series is a useful mathematical tool when describing and constructing a function. With the series representation, some properties of fractional calculus can be revealed clearly. This paper investigates two typical applications: Lebiniz rule and Laplace transform. It is analytically shown that the commonly used Leibniz rule cannot be applied for Caputo derivative. Similarly, the well-known Laplace transform of Riemann-Liouville derivative is doubtful for n-th continuously differentiable function. By the aid of this series representation, the exact formula of Caputo Leibniz rule and the explanation of Riemann-Liouville Laplace transform are presented. Finally, three illustrative examples are revisited to confirm the obtained results.

preprint2020arXiv

Peer-inspired Student Performance Prediction in Interactive Online Question Pools with Graph Neural Network

Student performance prediction is critical to online education. It can benefit many downstream tasks on online learning platforms, such as estimating dropout rates, facilitating strategic intervention, and enabling adaptive online learning. Interactive online question pools provide students with interesting interactive questions to practice their knowledge in online education. However, little research has been done on student performance prediction in interactive online question pools. Existing work on student performance prediction targets at online learning platforms with predefined course curriculum and accurate knowledge labels like MOOC platforms, but they are not able to fully model knowledge evolution of students in interactive online question pools. In this paper, we propose a novel approach using Graph Neural Networks (GNNs) to achieve better student performance prediction in interactive online question pools. Specifically, we model the relationship between students and questions using student interactions to construct the student-interaction-question network and further present a new GNN model, called R^2GCN, which intrinsically works for the heterogeneous networks, to achieve generalizable student performance prediction in interactive online question pools. We evaluate the effectiveness of our approach on a real-world dataset consisting of 104,113 mouse trajectories generated in the problem-solving process of over 4000 students on 1631 questions. The experiment results show that our approach can achieve a much higher accuracy of student performance prediction than both traditional machine learning approaches and GNN models.

preprint2020arXiv

Population Distribution in the Wake of a Sphere

The fluid physics of the heat and mass transfer from an object in its wake has much importance for natural phenomena as well as for many engineering applications. Here, we report numerical results on the population density of the spatial distribution of fluid velocity, pressure, scalar concentration and scalar fluxes of a wake flow past a sphere in the steady wake regime (Reynolds number 25 to 285). We find the population density to be well described by a Lorentzian distribution. We observe this apparently universal form both in the symmetric wake regime and in the more complex three dimensional wake structure of the steady oblique regime with Reynolds number larger than 225. The population density distribution identifies the increase in dimensionless kinetic energy and scalar fluxes with the increase in Reynolds number, whereas the dimensionless scalar population density shows negligible variation with the Reynolds number.

preprint2020arXiv

Predicting Student Performance in Interactive Online Question Pools Using Mouse Interaction Features

Modeling student learning and further predicting the performance is a well-established task in online learning and is crucial to personalized education by recommending different learning resources to different students based on their needs. Interactive online question pools (e.g., educational game platforms), an important component of online education, have become increasingly popular in recent years. However, most existing work on student performance prediction targets at online learning platforms with a well-structured curriculum, predefined question order and accurate knowledge tags provided by domain experts. It remains unclear how to conduct student performance prediction in interactive online question pools without such well-organized question orders or knowledge tags by experts. In this paper, we propose a novel approach to boost student performance prediction in interactive online question pools by further considering student interaction features and the similarity between questions. Specifically, we introduce new features (e.g., think time, first attempt, and first drag-and-drop) based on student mouse movement trajectories to delineate students' problem-solving details. In addition, heterogeneous information network is applied to integrating students' historical problem-solving information on similar questions, enhancing student performance predictions on a new question. We evaluate the proposed approach on the dataset from a real-world interactive question pool using four typical machine learning models.

preprint2020arXiv

RankBooster: Visual Analysis of Ranking Predictions

Ranking is a natural and ubiquitous way to facilitate decision-making in various applications. However, different rankings are often used for the same set of entities, with each ranking method placing emphasis on different factors. These factors can also be multi-dimensional in nature, compounding the problem. This complexity can make it challenging for an entity which is being ranked to understand what they can do to improve their rankings, and to analyze the effect of changes in various factors to their overall rank. In this paper, we present RankBooster, a novel visual analytics system to help users conveniently investigate ranking predictions. We take university rankings as an example and focus on helping universities to better explore their rankings, where they can compare themselves to their rivals in key areas as well as overall. Novel visualizations are proposed to enable efficient analysis of rankings, including a Scenario Analysis View to show a high-level summary of different ranking scenarios, a Relationship View to visualize the influence of each attribute on different indicators and a Rival View to compare the ranking of a university and those of its rivals. A case study demonstrates the usefulness and effectiveness of RankBooster in facilitating the visual analysis of ranking predictions and helping users better understand their current situation.

preprint2020arXiv

Skyrmion-based Magnetic Traps for Ultracold Atoms

We show that the stray field generated by isolated magnetic skyrmions can be used to trap ultracold atoms. Specially, ring-shaped and double-well trapping potentials for ultracold atoms can be created by combining the field from two isolated skyrmions. The geometry size, potential barrier, trapping frequency and Majorana loss rate of these magnetic traps can be tuned by the external magnetic field or device configuration. The results here could be useful to develop atomtronics devices by manipulating the magnetic skyrmions with modern spintronics techniques.

preprint2020arXiv

Sufficient and necessary conditions for stabilizing singular fractional order systems with partially measurable state

This paper is concerned with the stabilization problem of singular fractional order systems with order $α\in(0,2)$. In addition to the sufficient and necessary condition for observer based control, a sufficient and necessary condition for output feedback control is proposed by adopting matrix variable decoupling technique. The developed results are more general and efficient than the existing works, especially for the output feedback case. Finally, two illustrative examples are given to verify the effectiveness and potential of the proposed approaches.

preprint2020arXiv

Surface Superconductivity in the type II Weyl Semimetal TaIrTe4

The search for unconventional superconductivity in Weyl semimetal materials is currently an exciting pursuit, since such superconducting phases could potentially be topologically nontrivial and host exotic Majorana modes. The layered material TaIrTe4 is a newly predicted time-reversal invariant type II Weyl semimetal with minimum number of Weyl points. Here, we report the discovery of surface superconductivity in Weyl semimetal TaIrTe4. Our scanning tunneling microscopy/spectroscopy (STM/S) visualizes Fermi arc surface states of TaIrTe4 that are consistent with the previous angle-resolved photoemission spectroscopy (ARPES) results. By a systematic study based on STS at ultralow temperature, we observe uniform superconducting gaps on the sample surface. The superconductivity is further confirmed by electrical transport measurements at ultralow temperature, with an onset transition temperature (Tc) up to 1.54 K being observed. The normalized upper critical field h*(T/Tc) behavior and the stability of the superconductivity against the ferromagnet indicate that the discovered superconductivity is unconventional with the p-wave pairing. The systematic STS, thickness and angular dependent transport measurements reveal that the detected superconductivity is quasi-one-dimensional (quasi-1D) and occurs in the surface states. The discovery of the surface superconductivity in TaIrTe4 provides a new novel platform to explore topological superconductivity and Majorana modes.

preprint2020arXiv

T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming

The T-product for third-order tensors has been used extensively in the literature. In this paper, we first introduce the first-order and second-order T-derivatives for the multi-vector real-valued function with the tensor T-product; and inspired by an equivalent characterization of a twice continuously T-differentiable multi-vector real-valued function being convex, we present a definition of the T-positive semidefiniteness of third-order symmetric tensors. After that, we extend many properties of positive semidefinite matrices to the case of third-order symmetric tensors. In particular, analogue to the widely used semidefinite programming (SDP for short), we introduce the semidefinite programming over the third-order symmetric tensor space (T-semidefinite programming or TSDP for short), and provide a way to solve the TSDP problem by converting it into an SDP problem in the complex domain. Furthermore, we give several examples which can be formulated (or relaxed) as TSDP problems, and report preliminary numerical results for two unconstrained polynomial optimization problems. Experiments show that finding the global minimums of polynomials via the TSDP relaxation outperforms the traditional SDP relaxation for the test examples.

preprint2020arXiv

TaxThemis: Interactive Mining and Exploration of Suspicious Tax Evasion Group

Tax evasion is a serious economic problem for many countries, as it can undermine the government' s tax system and lead to an unfair business competition environment. Recent research has applied data analytics techniques to analyze and detect tax evasion behaviors of individual taxpayers. However, they failed to support the analysis and exploration of the uprising related party transaction tax evasion (RPTTE) behaviors (e.g., transfer pricing), where a group of taxpayers is involved. In this paper, we present TaxThemis, an interactive visual analytics system to help tax officers mine and explore suspicious tax evasion groups through analyzing heterogeneous tax-related data. A taxpayer network is constructed and fused with the trade network to detect suspicious RPTTE groups. Rich visualizations are designed to facilitate the exploration and investigation of suspicious transactions between related taxpayers with profit and topological data analysis. Specifically, we propose a calendar heatmap with a carefully-designed encoding scheme to intuitively show the evidence of transferring revenue through related party transactions. We demonstrate the usefulness and effectiveness of TaxThemis through two case studies on real-world tax-related data, and interviews with domain experts.

preprint2020arXiv

TradAO: A Visual Analytics System for Trading Algorithm Optimization

With the wide applications of algorithmic trading, it has become critical for traders to build a winning trading algorithm to beat the market. However, due to the lack of efficient tools, traders mainly rely on their memory to manually compare the algorithm instances of a trading algorithm and further select the best trading algorithm instance for the real trading deployment. We work closely with industry practitioners to discover and consolidate user requirements and develop an interactive visual analytics system for trading algorithm optimization. Structured expert interviews are conducted to evaluateTradAOand a representative case study is documented for illustrating the system effectiveness. To the best of our knowledge, previous financial data visual analyses have mainly aimed to assist investment managers in investment portfolio analysis but have neglected the need of traders in developing trading algorithms for portfolio execution.TradAOis the first visual analytics system that assists users in comprehensively exploring the performances of a trading algorithm with different parameter settings.

preprint2020arXiv

Unsupervised Learning of Depth, Optical Flow and Pose with Occlusion from 3D Geometry

In autonomous driving, monocular sequences contain lots of information. Monocular depth estimation, camera ego-motion estimation and optical flow estimation in consecutive frames are high-profile concerns recently. By analyzing tasks above, pixels in the middle frame are modeled into three parts: the rigid region, the non-rigid region, and the occluded region. In joint unsupervised training of depth and pose, we can segment the occluded region explicitly. The occlusion information is used in unsupervised learning of depth, pose and optical flow, as the image reconstructed by depth-pose and optical flow will be invalid in occluded regions. A less-than-mean mask is designed to further exclude the mismatched pixels interfered with by motion or illumination change in the training of depth and pose networks. This method is also used to exclude some trivial mismatched pixels in the training of the optical flow network. Maximum normalization is proposed for depth smoothness term to restrain depth degradation in textureless regions. In the occluded region, as depth and camera motion can provide more reliable motion estimation, they can be used to instruct unsupervised learning of optical flow. Our experiments in KITTI dataset demonstrate that the model based on three regions, full and explicit segmentation of the occlusion region, the rigid region, and the non-rigid region with corresponding unsupervised losses can improve performance on three tasks significantly. The source code is available at: https://github.com/guangmingw/DOPlearning.

preprint2019arXiv

Convolutional neural networks with fractional order gradient method

This paper proposes a fractional order gradient method for the backward propagation of convolutional neural networks. To overcome the problem that fractional order gradient method cannot converge to real extreme point, a simplified fractional order gradient method is designed based on Caputo's definition. The parameters within layers are updated by the designed gradient method, but the propagations between layers still use integer order gradients, and thus the complicated derivatives of composite functions are avoided and the chain rule will be kept. By connecting every layers in series and adding loss functions, the proposed convolutional neural networks can be trained smoothly according to various tasks. Some practical experiments are carried out in order to demonstrate fast convergence, high accuracy and ability to escape local optimal point at last.

preprint2018arXiv

Continuous Nucleation Dynamics of Magnetic Skyrmions in T-shaped Helimagnetic Nanojunction

Magnetic skyrmions are topologically-protected spin textures existing in helimagentic materials, which can be utilized as information carriers for non-volatile memories and logic circuits in spintronics. Searching simple and controllable way to create isolated magnetic skyrmions is desirable for further technology developments and industrial designs. Based on micromagnetic simulations, we show that the temporal dissipative structure can be developed in the T-shaped helimagnetic nanojunction when it is driven to the far-from-equilibrium regime by a constant spin-polarized current. Then the magnetic skyrmions can be continuously nucleated during the periodic magnetization dynamics of the nanojunction. We have systematically investigated the effects of current density, Dzyaloshinskii-Moriya interaction, external magnetic field, and thermal fluctuation on the nucleation dynamics of the magnetic skyrmions. Our results here suggest a novel and promising mechanism to continuously create magnetic skyrmions for the development of skyrmion-based spintronics devices.