Search arXiv⌕ Search

arXiv subjects

Yong Wang

Publications and source records attributed to Yong Wang.

At least 415 records · Page 23Linked to original sources
arXiv2022

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.

cs.HC↗
arXiv2022

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.

math.DG↗
arXiv2022

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.

cs.HC↗
arXiv2021

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.

cs.HC↗
arXiv2021

KG4Vis: A Knowledge Graph-Based Approach for Visualization Recommendation

Visualization recommendation or automatic visualization generation can significantly lower the barriers for general users to rapidly create effective data visualizations, especially for those users without a background in data visualizations. However, existing rule-based approaches require tedious manual specifications of visualization rules by visualization experts. Other machine learning-based approaches often work like black-box and are difficult to understand why a specific visualization is recommended, limiting the wider adoption of these approaches. This paper fills the gap by presenting KG4Vis, a knowledge graph (KG)-based approach for visualization recommendation. It does not require manual specifications of visualization rules and can also guarantee good explainability. Specifically, we propose a framework for building knowledge graphs, consisting of three types of entities (i.e., data features, data columns and visualization design choices) and the relations between them, to model the mapping rules between data and effective visualizations. A TransE-based embedding technique is employed to learn the embeddings of both entities and relations of the knowledge graph from existing dataset-visualization pairs. Such embeddings intrinsically model the desirable visualization rules. Then, given a new dataset, effective visualizations can be inferred from the knowledge graph with semantically meaningful rules. We conducted extensive evaluations to assess the proposed approach, including quantitative comparisons, case studies and expert interviews. The results demonstrate the effectiveness of our approach.

cs.HC↗
arXiv2021

A Survey on ML4VIS: Applying Machine Learning Advances to Data Visualization

Inspired by the great success of machine learning (ML), researchers have applied ML techniques to visualizations to achieve a better design, development, and evaluation of visualizations. This branch of studies, known as ML4VIS, is gaining increasing research attention in recent years. To successfully adapt ML techniques for visualizations, a structured understanding of the integration of ML4VISis needed. In this paper, we systematically survey 88 ML4VIS studies, aiming to answer two motivating questions: "what visualization processes can be assisted by ML?" and "how ML techniques can be used to solve visualization problems?" This survey reveals seven main processes where the employment of ML techniques can benefit visualizations:Data Processing4VIS, Data-VIS Mapping, InsightCommunication, Style Imitation, VIS Interaction, VIS Reading, and User Profiling. The seven processes are related to existing visualization theoretical models in an ML4VIS pipeline, aiming to illuminate the role of ML-assisted visualization in general visualizations.Meanwhile, the seven processes are mapped into main learning tasks in ML to align the capabilities of ML with the needs in visualization. Current practices and future opportunities of ML4VIS are discussed in the context of the ML4VIS pipeline and the ML-VIS mapping. While more studies are still needed in the area of ML4VIS, we hope this paper can provide a stepping-stone for future exploration. A web-based interactive browser of this survey is available at https://ml4vis.github.io

cs.HC↗
arXiv2021

Super warped products with a semi-symmetric metric connection

In this paper, we define the semi-symmetric metric connection on super Riemannian manifolds. We compute the semi-symmetric metric connection and its curvature tensor and its Ricci tensor on super warped product spaces. We introduce two kind of super warped product spaces with the semi-symmetric metric connection and give the conditions under which these two super warped product spaces with the semi-symmetric metric connection are the Einstein super spaces with the semi-symmetric metric connection.

math.DG↗
arXiv2021

The operator $\sqrt{-1}\widehat{c}(V)(d+δ)$ and the Kastler-Kalau-Walze type theorems

In this paper, we obtain two Lichnerowicz type formulas for the operators $\sqrt{-1}\widehat{c}(V)(d+δ)$ and $-\sqrt{-1}(d+δ)\widehat{c}(V)$. And we give the proof of Kastler-Kalau-Walze type theorems for the operators $\sqrt{-1}\widehat{c}(V)(d+δ)$ and $-\sqrt{-1}(d+δ)\widehat{c}(V)$ on 3,4-dimensional oriented compact manifolds with (resp.without) boundary.

math.DG↗
arXiv2021

Optimized Deployment of Unmanned Aerial Vehicles for Wildfire Detection and Monitoring

In recent years, increased wildfires have caused irreversible damage to forest resources worldwide, threatening wildlives and human living conditions. The lack of accurate frontline information in real-time can pose great risks to firefighters. Though a plethora of machine learning algorithms have been developed to detect wildfires using aerial images and videos captured by drones, there is a lack of methods corresponding to drone deployment. We propose a wildfire rapid response system that optimizes the number and relative positions of drones to achieve full coverage of the whole wildfire area. Trained on the data from historical wildfire events, our model evaluates the possibility of wildfires at different scales and accordingly allocates the resources. It adopts plane geometry to deploy drones while balancing the capability and safety with inequality constrained nonlinear programming. The method can flexibly adapt to different terrains and the dynamic extension of the wildfire area. Lastly, the operation cost under extreme wildfire circumstances can be assessed upon the completion of the deployment. We applied our model to the wildfire data collected from eastern Victoria, Australia, and demonstrated its great potential in the real world.

cs.RO↗
arXiv2021

Structured Parallel Programming

Based on our previous work on algebraic laws for true concurrency, we design a structured parallel programming language for true concurrency called PPL. Different to most programming languages, PPL has an explicit parallel operator as an essential operator, including its operational, denotational and axiomatic semantics. PPL can structure a truly concurrent graph to a normal form which means that it is possible to implement a compiler for PPL.

cs.LO↗
arXiv2021

Actors -- A Process Algebra Based Approach

We model actors based on truly concurrent process algebra, and capture the actor model in the following characteristics: (1) Concurrency: all actors execute concurrently; (2) Asynchrony: an actor receives and sends messages asynchronously; (3) Uniqueness: an actor has a unique name and the associate unique mail box name; (4) Concentration: an actor focuses on the processing messages, including some local computations, creations of some new actors, and sending some messages to other actors; (5) Communication Dependency: the only way of affecting an actor is sending a message to it; (6) Abstraction: except for the receiving and sending message, and creating new actors, the local computations are abstracted; (7) Persistence: an actor does not disappear after processing a message. Truly concurrent process algebra has rich expressive ability to model the above characteristics of actors, and more importantly, they are models for true concurrency, Comparing with other models of actors, the truly concurrent process algebra based model has the following advantages: (1) The truly concurrent process algebra has rich expressive abilities to describe almost all characteristics of actors, especially for asynchronous communication, actor creation, recursion, abstraction, etc; (2) The truly concurrent process algebra and actors are all models for true concurrency, and have inborn intimacy; (3) The truly concurrent process algebra has a firm semantics foundation and a powerful proof theory, the correctness of an actor system can be proven easily.

cs.LO↗
arXiv2021

Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing

Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, $π_{tc}$ to $π$ calculus, APPTC to probabilistic process algebra. Now, it is the time to utilize truly concurrent process algebras APTC and APPTC to model quantum computing and unify quantum and classical computing. In this book, we introduce the preliminaries, the utilization of APTC to unify quantum and classical computing and its usage in verification of quantum communication protocols, the utilization of APPTC to unifying quantum and classical computing and its usage in verification of quantum communication protocols.

cs.LO↗
arXiv2021

Verification of Patterns

The software patterns provide building blocks to the design and implementation of a software system, and try to make the software engineering to progress from experience to science. The software patterns were made famous because of the introduction as the design patterns. After that, patterns have been researched and developed widely and rapidly. The series of books of pattern-oriented software architecture should be marked in the development of software patterns. As mentioned in these books, formalization of patterns and an intermediate pattern language are needed and should be developed in the future of patterns. So, in this book, we formalize software patterns according to the categories of the series of books of pattern-oriented software architecture, and verify the correctness of patterns based on truly concurrent process algebra. In one aspect, patterns are formalized and verified; in the other aspect, truly concurrent process algebra can play a role of an intermediate pattern language for its rigorous theory.

cs.LO↗
arXiv2021

Secure Process Algebra

Based on our previous work on truly concurrent process algebras APTC, we use it to verify the security protocols. This work (called Secure APTC, abbreviated SAPTC) have the following advantages in verifying security protocols: (1) It has a firmly theoretic foundations, including equational logics, structured operational semantics, and axiomatizations between them; (2) It has rich expressive powers to describe security protocols. Cryptographic operations are modeled as atomic actions and can be extended, explicit parallelism and communication mechanism to modeling communication operations and principals, rich computational properties to describing computational logics in the security protocols, including conditional guards, alternative composition, sequential composition, parallelism and communication, encapsulation and deadlock, recursion, abstraction. (3) Especially by abstraction, it is convenient and obvious to observe the relations between the inputs and outputs of a security protocols, including the relations without any attack, the relations under each known attack, and the relations under unknown attacks if the unknown attacks can be described.

cs.LO↗
arXiv2021

Verification of Distributed Quantum Protocols

Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, $π_{tc}$ to $π$ calculus, APPTC to probabilistic process algebra, APTC with localities to process algebra with localities. In quantum process algebras, there are several well-known work, and we ever did some work to unify quantum and classical computing under the framework of ACP \cite{ACP} and probabilistic process algebra. Now, it is the time to utilize truly concurrent process algebras with localities to model quantum computing and unify quantum and classical computing in this book. Since this work is with localities, it is suitable to verify the distribution of quantum communication protocols.

cs.LO↗
arXiv2021

Driven-dissipative Quantum Dynamics in Cavity Magnon-Polariton System

The dynamics of arbitrary-order quantum correlations in a cavity magnon-polariton system are investigated based on the quantum master equation in the coherent state representation. The phenomena of Rabi-like oscillation and level repulsion of the average cavity-photon number agree remarkably well with existing experimental observations. The competing nature of coherent and incoherent components in these two cases is further revealed by the second-order quantum coherence of the cavity photons and magnons, which can be systematically tuned by the driving microwave and thermal bath. Our results demonstrate the rich higher-order quantum dynamics induced by magnetic light-matter interaction, and serve as an indispensable step toward exploring nonclassical states for cavity photons and magnons in quantum cavity magnonics.

quant-ph↗