10 Result(s)
within
English
Algorithm Analysis and Problem Complexity
Software Engineering/Programming and Operating Systems
Yi**ang Chen
Chapter
-
Chapter and Conference Paper
AutoQ: An Automata-Based Quantum Circuit Verifier
We present a specification language and a fully automated tool named AutoQ for verifying quantum circuits symbolically. The tool implements the automata-based algorithm from [14] and extends it with the capabilit...
-
Chapter and Conference Paper
A Fast and Better Hybrid Recommender System Based on Spark
With the rapid development of information technology, recommender systems have become critical components to solve information overload. As an important branch, weighted hybrid recommender systems are widely u...
-
Chapter and Conference Paper
UKCF: A New Graphics Driver Cross-Platform Translation Framework for Virtual Machines
Virtual machine with dynamic binary translation system is the key technology to solve software compatibility problem. But traditional user space binary translation systems can’t translate hardware drivers such...
-
Chapter and Conference Paper
Reorder the Write Sequence by Virtual Write Buffer to Extend SSD’s Lifespan
The limited lifespan is the Achilles’s heel of Solid State Drive (SSD) based on NAND flash memory. NAND flash has two drawbacks that degrade SSD’s lifespan. One is the out-of-place update. Another is the seque...
-
Chapter and Conference Paper
Efficient Pipelining Parallel Methods for Image Compositing in Sort-Last Rendering
It is well known that image compositing is the bottleneck in Sort-Last rendering. Many methods have been developed to reduce the compositing time. In this paper, we present a series of pipeline methods for ima...
-
Chapter and Conference Paper
Study on Parallel Computing
In this talk, we present a general survey on parallel computing. The main contents include parallel computer system which is the hardware platform of parallel computing, parallel algorithm which is the theoret...
-
Chapter and Conference Paper
Learning Minimal Separating DFA’s for Compositional Verification
Algorithms for learning a minimal separating DFA of two disjoint regular languages have been proposed and adapted for different applications. One of the most important applications is learning minimal contextu...
-
Chapter and Conference Paper
GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic
This paper reports extensions to the GOAL tool that enable it to become a research tool for omega automata and temporal logic. The extensions include an expanded collection of translation, simplification, and ...
-
Chapter and Conference Paper
Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
Recent studies have suggested the applicability of learning to automated compositional verification. However, current learning algorithms fall short when it comes to learning liveness properties. We extend the au...
-
Chapter and Conference Paper
GOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae
In this paper, we present a tool named GOAL (an acronym derived from “Graphical Tool for Omega-Automata and Logics”) whose main functions include (1) drawing and testing Büchi automata, (2) checking the language ...
