Search By Subject

Serverless computing offers an affordable and easy way to code lightweight functions that can be invoked based on some events to perform simple tasks. For more complicated processing, multiple serverless functions can be orchestrated as a directed ...

With the ever-increasing volume of data and the demand to analyze and comprehend it, graph processing has become an essential approach for solving complex problems in various domains, like social networks, bioinformatics, and finance. Despite the ...

Cloud-native systems are dynamic in nature as they always have to react to changes in the environment, e.g., how users utilize the system. Self-adaptive cloud-native systems manage those changes by predicting how future environmental changes will impact ...

Cyber-Physical Systems (CPS) rely on sensing to control and optimize their operation. Nevertheless, sensing itself is prone to errors that can originate at several stages, from sampling to communication. In this context, several systems adopt ...

Change point detection has recently gained popularity as a method of detecting performance changes in software due to its ability to cope with noisy data. In this paper we present Hunter, an open source tool that automatically detects performance ...

Fine grain image is an important research field of image recognition, which can classify objects in more detail. Image feature extraction is usually implemented by bilinear network, which can meet the desired effect of feature extraction, but also ...

From prehistoric times to the present, the creation of poetry has long been considered the exclusive domain of humans. With the development of deep learning, many researchers have begun to address the challenge of how to generate poetry using ...

In the implementation of deep reinforcement learning (DRL), action persistence strategies are often adopted so that agents maintain their actions for a fixed or variable number of steps. The choice of the persistent duration for agent actions usually has ...

We study the expressivity and complexity of two modal logics interpreted on finite forests and equipped with standard modalities to reason on submodels. The logic \(\mathsf {ML} ({\color{black}{{\vert\!\!\vert\!\vert}}})\) extends the modal logic K with ...

Let V be a set of number-theoretical functions. We define a notion of V-realizability for predicate formulas in such a way that the indices of functions in V are used for interpreting the implication and the universal quantifier. In this article, we prove ...

In this paper we enhance the EasyCrypt proof assistant to reason about computational complexity of adversaries. The key technical tool is a Hoare logic for reasoning about computational complexity (execution time and oracle calls) of adversarial ...

Agriculture-based Internet of Things (Ag-IoT) can generate near-real-time quantitative data to analyze crop growth. Unmanned Aerial Vehicle (UAV) based mobile edge computing systems is widely used in Ag-IoT due to the low cost, fast movement and ease of ...

We consider the early work maximization scheduling problem on two identical parallel machines under a grade of service (GoS) provision. In this problem, we are given a set of jobs, two machines and a common due date, where each job and machine are ...

Aiming at the problem about the low recommendation performance, low training efficiency and too much parameter adjustment processes in the current recommendation models for multi-label long-tail distribution data, this paper proposed a recommendation ...

It is well known that, for the majority of large-scale LP problems, only a relatively small percentage of constraints are binding at the optimal solution. Redundancy may occur in the formulation phase of the LP problems and even if it does not alter ...

In this article, we present a CUDA library with a C API for solving block cyclic tridiagonal and banded systems on one GPU. The library can process block tridiagonal systems with block sizes from 1 × 1 (scalar) to 4 × 4 and banded systems with up to four ...

This work studies three multigrid variants for matrix-free finite-element computations on locally refined meshes: geometric local smoothing, geometric global coarsening (both h-multigrid), and polynomial global coarsening (a variant of p-multigrid). We ...

Krylov methods are a key way of solving large sparse linear systems of equations but suffer from poor strong scalability on distributed memory machines. This is due to high synchronization costs from large numbers of collective communication calls ...

We introduce Reflective Hamiltonian Monte Carlo (ReHMC), an HMC-based algorithm to sample from a log-concave distribution restricted to a convex body. The random walk is based on incorporating reflections to the Hamiltonian dynamics such that the support ...

CG:SHOP is an annual geometric optimization challenge and the 2022 edition proposed the problem of coloring a certain geometric graph defined by line segments. Surprisingly, the top three teams used the same technique, called conflict optimization. This ...