Trace theory (formulated by Mazurkiewicz in 1987) is a principled framework for defining equivalence relations for concurrent program runs based on a commutativity relation over the set of atomic steps taken by individual program threads. Its simplicity, ...

Effect handlers are a modern and increasingly popular approach to structuring computational effects in functional programming languages. However, while their traditional operational semantics is well-suited to implementation tasks, it is less ideal as a ...

This note collects a series of results into a single formulation. Namely, it is proved that, when reduction is performed to a symmetric Lagrangian, the reduced variational equations can be split into two parts, one of them is exactly the Noether ...

In this paper a class of cycle unification problems called type Cpg+r is studied, and an intuitive representation method, calledthe position supergraph, is presented to analyze or reduce the cycle problem. A typical case of Cpg+r problems is ...

In stead of intuitionistic fuzzy covering, a new intuitionistic fuzzy binary relation is proposed using a set in an intuitionistic fuzzy covering, and correspondingly the intuitionistic fuzzy approximation space is obtained. Then a novel ...

Due to the missing of a good orchestration of loop transformations, existing optimizing compilers for deploying neural networks on GPU either parallelize reductions ineffectively or miss the fusion opportunities with other operators. Neural network ...

The original principle of removing elements of a mathematical model based on its parametric identification of neural network is proposed in the paper. The essence of proposed method is to find a functional subset with less variable results and higher ...

OpenMP 5.0 added support for reductions over explicit tasks. This expands the previous reduction support that was limited primarily to worksharing and parallel constructs. While the scope of a reduction operation in a worksharing construct is the ...

Since the seminal works of Strassen and Valiant it has been a central theme in algebraic complexity theory to understand the relative complexity of algebraic problems, that is, to understand which algebraic problems (be it bilinear maps like matrix ...

In CS theory courses, NP reductions are a notorious source of pain for students and instructors alike. Invariably, students use pen and paper to write down reductions that “work” in many but not all cases. When instructors observe that a student’s ...

Several proof assistants, such as Isabelle or Coq, can concurrently check multiple proofs. In contrast, the vast majority of today's small proof checkers either does not support concurrency at all or only limited forms thereof, restricting the ...

This paper presents a text-based syntax completion method using an LR parser. We propose formal definitions of candidate text to be completed based on the sentential forms, and we design algorithms for computing candidates through reductions in the LR ...

An information system (IS) is an important mathematical tool for artificial intelligence. A fuzzy probabilistic information system (FPIS), the combination of some fuzzy relations in the same universe which satisfies the probability distribution, can be ...

 By focusing on various influences arose from environmental change, sustainability has become a major conception among many fields, including utility allocation. On the other hand, game-theoretical methods have always been adopted to analyze the ...

Verifying the correctness of concurrent software with subtle synchronization is notoriously challenging. We present the Anchor verifier, which is based on a new formalism for specifying synchronization disciplines that describes both (1) what memory ...

We study computational aspects of syzygies of graded modules over polynomial rings R[w₁, ..., w_g] when the base R is a discrete valuation ring. In particular, we use the torsion of their syzygies over R to provide a formula which describes the behavior ...

Asynchronous programs are notoriously difficult to reason about because they spawn computation tasks which take effect asynchronously in a nondeterministic way. Devising inductive invariants for such programs requires understanding and stating complex ...

The integrated development environments provide several types of functionalities. Herein, we intend to generate a syntax completion functionality from the grammar of the target language as long as the sentences of the language can be analyzed via LR ...

In this paper, we consider a generalized matching problem, the so-called edge packing problem. Given a graph G such that each vertex v is associated with a positive integer w(v), an edge packing F with respect to these integers (abbreviated as edge ...

Recently, the 3-Otsu (three-dimensional maximum between-class variance algorithm) has drawn great attention in image segmentation. However the time consumption and calculation amount of 3-Otsu is large, so this paper provide a compositing 3-Otsu ...