Results 81 to 90 of about 1,172 (171)
Mori dream bonds and C∗${\mathbb {C}}^*$‐actions
Abstract We construct a correspondence between Mori dream regions arising from small modifications of normal projective varieties and C∗${\mathbb {C}}^*$‐actions on polarized pairs which are bordisms. Moreover, we show that the Mori dream regions constructed in this way admit a chamber decomposition on which the models are the geometric quotients of ...
Lorenzo Barban +3 more
wiley +1 more source
Proving linearizability with temporal logic [PDF]
Linearizability is a correctness criterion for concurrent systems. In this report, we describe how temporal logic can be used to prove linearizability of a concurrent lock-free stack implementation.
Bäumler, Simon +3 more
core
Making linearizability compositional for partially ordered executions [PDF]
In the interleaving model of concurrency, where events are totally ordered, linearizability is compositional: the composition of two linearizable objects is guaranteed to be linearizable. However, linearizability is not compositional when events are only
Dongol, B. +11 more
core +1 more source
State‐dependent dynamic tube MPC: A novel tube MPC method with a fuzzy model of disturbances
Abstract Most real‐world systems are affected by external disturbances, which may be impossible or costly to measure. For instance, when autonomous robots move in dusty environments, the perception of their sensors is disturbed. Moreover, uneven terrains can cause ground robots to deviate from their planned trajectories.
Filip Surma, Anahita Jamshidnejad
wiley +1 more source
ABSTRACT This paper introduces a modified displacement‐driven approach for contact mechanics between rigid and deformable bodies within the finite element framework. This modification enhances efficiency, addressing the limitations of the original formulation, which resulted in an overdetermined system of equations.
Diah Puspita Rahmi +2 more
wiley +1 more source
Local Linearizability for Concurrent Container-Type Data Structures [PDF]
The semantics of concurrent data structures is usually given by a sequential specification and a consistency condition. Linearizability is the most popular consistency condition due to its simplicity and general applicability.
Henzinger, Thomas A. +12 more
core +1 more source
Linear Algebra Based Tracking Control of a Drone
In this paper, linear algebra based control methodology is used for tracking control of drones. It results in a straightforward mathematical procedure with low computational cost implementation, and reaches satifactory tracking and energy saving. ABSTRACT In this paper, linear algebra based (LAB) control methodology is proposed as a feasible technique ...
Pedro Albertos +3 more
wiley +1 more source
An observational approach to defining linearizability on weak memory models [PDF]
In this paper we present a framework for defining linearizability on weak memory models. The purpose of the framework is to be able to define the correctness of concurrent algorithms in a uniform way across a variety of memory models.
Smith, G. +5 more
core +1 more source
Auto‐Bäcklund Transformations for New Matrix First and Second Painlevé Hierarchies
ABSTRACT We define a new doubly extended matrix second Painlevé hierarchy, and in addition a new extended matrix first Painlevé hierarchy. For the former, we present three auto‐Bäcklund transformations (auto‐BTs) that constitute nontrivial extensions to our new hierarchy of previously derived results on the auto‐BTs of a much simpler matrix second ...
Pilar Ruiz Gordoa, Andrew Pickering
wiley +1 more source
Modular Verification of Concurrency-Aware Linearizability
International audienceLinearizability is the de facto correctness condition for concurrent objects. Informally, linearizable objects provide the illusion that each operation takes effect instantaneously at a unique point in time between its invocation ...
Rinetzky, N. +8 more
core +1 more source

