Search
Search Results
-
Team Automata@Work: On Safe Communication
We study requirements for safe communication in systems of reactive components in which components communicate via synchronised execution of common...
-
Research on fault diagnosis technology of simulated altitude test facility based on multi-optimization strategy, real-time data transfer, and the M-H attention-RF algorithm
The simulated altitude test facility, as an important means to verify the performance, characteristics, and evaluation result criteria of...
-
An Autoregressive Dragonfly Optimization-Based Assignment Planning Procedures for Refining Enactment and Data Security in Mobile Cloud Computing
Customers pay a nominal monthly charge to use the Mobile Cloud Computing's (MCC) shared pool of virtualized cloud resources, which includes storage,...
-
Compositionality of Safe Communication in Systems of Team Automata
We study guarantees for safe communication in systems of systems composed of reactive components that communicate through synchronised execution of...
-
Temporal automata for robotic scenario modeling with CIT framework
Many approaches for designing robotic applications have been proposed in recent years. If they are relevant to the problem they solve, most of them...
-
The Box Algebra 2/2: Iteration and Data
In a programming language, recursion and iteration are the main techniques for creating repetitive (and potentially infinite) behaviours. In Chapter...
-
Multi-View Euclidean Reconstruction
Given the pixel coordinates of the projections of 3D points in multiple images, we can find the 3D points and the camera matrices that satisfy the...
-
-
On the Interplay of Interpersonal Synchrony, Short-Term Affiliation and Long-Term Bonding: A Second-Order Multi-adaptive Neural Agent Model
When people interact, their behaviour tends to become synchronised, a mutual coordination process that fosters short-term adaptations, like increased...
-
A new distributed graph coloring algorithm for large graphs
The vertex graph coloring problem (VGCP) is one of the most well-known problems in graph theory. It is used for solving several real-world problems...
-
Image-Based Rendering
This chapter presents techniques for image-based rendering, which is the process of synthesising an image from the geometric transformation of one or...
-
The Box Algebra 1/2: Refinement and Recursion
In the early days of parallel computing theory, Petri nets have been competing with process algebras for the attention of computer science theorists....
-
A Fully Verified Persistency Library
Non-volatile memory (NVM) technologies offer DRAM-like speeds with the added benefit of failure resilience. However, develo** concurrent programs...
-
Quality is in the eye of the stakeholders: what do professional subtitlers and viewers think about subtitling?
Quality is a rather slippery concept, and its assessment in subtitling can be a challenging task, as its appreciation can easily vary depending on...
-
TTWiFi: Time-Triggered WiFi for Mobile Robotics in Human Environments
WiFi is a ubiquitous protocol, but exhibits flaws that become particularly critical for teams of robots in human environments. We demonstrate that...
-
3D Registration
Registration or alignment of partial 3D models is the process of bringing them all into the same reference frame by means of a suitable...
-
From Stories to Concurrency: How Children Can Play with Formal Methods
This position paper presents an unplugged, problem-solving-based approach for teaching computer science to children. Our approach is based on story...
-
GNSS Signal Monitoring and Security of Supply of GNSS-Based Services
The global GNSS markets are expected to grow considerably in future, thus the number of threats against GNSS services will also increase....
-
Enforced Dependencies for Active Objects
We present an active object-based language that records required and provided method completions ahead of method invocations. With this language, a...
-
Concurrent Programming
We now consider a subject that is substantially different from those seen in the previous chapters. Up to now, we have considered sequential...