We describe three areas of inquiry that we foresee as being important in future studies of collective memory, mind, and media. The first is the power of narratives, usually provided by collectives, which can be explicit and conscious or implicit and unconscious. A second important theme during this period of populism and nationalism is the study of the self-centredness (or egocentricity) of groups, especially nations believing their past is special. Such egocentricity can feed conflict among nations as well as groups within nations. The third important direction for research is future thinking, or studies of how people anticipate events they expect to unroll in their future and whether these events are mostly positive or negative. A puzzle of future thinking relative to collective memory is why people readily argue about and even fight over events from the past, but find it much more difficult to mobilise groups about life-threatening future events such as global warming or nuclear war. We look forward to studies in these crucial topics and others as they appear in Memory, Mind & Media.

One way to model telecommunication networks are static Boolean models. However, dynamics such as node mobility have a significant impact on the performance evaluation of such networks. Consider a Boolean model in $\mathbb {R}^d$ and a random direction movement scheme. Given a fixed time horizon $T>0$, we model these movements via cylinders in $\mathbb {R}^d \times [0,T]$. In this work, we derive central limit theorems for functionals of the union of these cylinders. The volume and the number of isolated cylinders and the Euler characteristic of the random set are considered and give an answer to the achievable throughput, the availability of nodes, and the topological structure of the network.

In this paper, we investigate the pricing of vulnerable European options in a market where the underlying stocks are not perfectly liquid. A liquidity discount factor is used to model the effect of liquidity risk in the market, and the default risk of the option issuer is incorporated into the model using a reduced-form model, where the default intensity process is correlated with the liquidity risk. We obtain a semiclosed-form pricing formula of vulnerable options through the inverse Fourier transform. Finally, we illustrate the effects of default risk and liquidity risk on option prices numerically.

Functional reactive programming (FRP) provides a high-level interface for implementing reactive systems in a declarative manner. However, this high-level interface has to be carefully reigned in to ensure that programs can in fact be executed in practice. Specifically, one must ensure that FRP programs are causal and can be implemented without introducing space leaks. In recent years, modal types have been demonstrated to be an effective tool to ensure these operational properties. In this paper, we present $\mathsf{Rattus}$, a modal FRP language that extends and simplifies previous modal FRP calculi while still maintaining the operational guarantees for productivity, causality, and space leaks. The simplified type system makes $\mathsf{Rattus}$ a practical programming language that can be integrated with existing functional programming languages. To demonstrate this, we have implemented a shallow embedding of $\mathsf{Rattus}$ in Haskell that allows the programmer to write $\mathsf{Rattus}$ code in familiar Haskell syntax and seamlessly integrate it with regular Haskell code. Thus, $\mathsf{Rattus}$ combines the benefits enjoyed by FRP libraries such as Yampa, namely access to a rich library ecosystem (e.g., for graphics programming), with the strong operational guarantees offered by a bespoke type system. To establish the productivity, causality, and memory properties of the language, we prove type soundness using a logical relations argument fully mechanised in the Coq proof assistant.

Satellite imagery can detect temporary cloud trails or ship tracks formed from aerosols emitted from large ships traversing our oceans, a phenomenon that global climate models cannot directly reproduce. Ship tracks are observable examples of marine cloud brightening, a potential solar climate intervention that shows promise in helping combat climate change. In this paper, we demonstrate a simulation-based approach in learning the behavior of ship tracks based upon a novel stochastic emulation mechanism. Our method uses wind fields to determine the movement of aerosol–cloud tracks and uses a stochastic partial differential equation (SPDE) to model their persistence behavior. This SPDE incorporates both a drift and diffusion term which describes the movement of aerosol particles via wind and their diffusivity through the atmosphere, respectively. We first present our proposed approach with examples using simulated wind fields and ship paths. We then successfully demonstrate our tool by applying the approximate Bayesian computation method-sequential Monte Carlo for data assimilation.

The identification of nonlinear terms existing in the dynamic model of real-world mechanical systems such as robotic manipulators is a challenging modeling problem. The main aim of this research is not only to identify the unknown parameters of the nonlinear terms but also to verify their existence in the model. Generally, if the structure of the model is provided, the parameters of the nonlinear terms can be identified using different numerical approaches or evolutionary algorithms. However, finding a non-zero coefficient does not guarantee the existence of the nonlinear term or vice versa. Therefore, in this study, a meticulous investigation and statistical verification are carried out to ensure the reliability of the identification process. First, the simulation data are generated using the white-box model of a direct current motor that includes some of the nonlinear terms. Second, the particle swarm optimization (PSO) algorithm is applied to identify the unknown parameters of the model among many possible configurations. Then, to evaluate the results of the algorithm, statistical hypothesis and confidence interval tests are implemented. Finally, the reliability of the PSO algorithm is investigated using experimental data acquired from the UR5 manipulator. To compare the results of the PSO algorithm, the nonlinear least squares errors (NLSE) estimation algorithm is applied to identify the unknown parameters of the nonlinear models. The result shows that the PSO algorithm has higher identification accuracy than the NLSE estimation algorithm, and the model with identified parameters using the PSO algorithm accurately calculates the output torques of the joints of the manipulator.

With the dangerous and troublesome nature of hollow defects inside building structures, hollowness inspection has always been a challenge in the field of construction quality assessment. Several methods have been proposed for inspecting hollowness inside concrete structures. These methods have shown great advantages compared to manual inspection but still lack autonomy and have several limitations. In this paper, we propose a range-point migration-based non-contact hollowness inspection system with sensor fusion of ultra-wide-band radar and laser-based depth camera to extract both outer surface and inner hollowness information accurately and efficiently. The simulation result evaluates the performance of the system based on the original range-point migration algorithm, and our proposed one and the result of our system show great competitiveness. Several simulation experiments of structures that are very common in reality are carried out to draw more convincing conclusions about the system. At the same time, a set of laboratory-made concrete components were used as experimental objects for the robotic system. Although still accompanied by some problems, these experiments demonstrate the availability of an automated hollow-core detection system.

Minimally invasive surgery (MIS) has been an essential tool in the surgical sector for many years due to its crucial advantages compared to open surgery. To overcome remaining limitations, teleoperated MIS experienced a strong emergence. However, the widespread usage of such systems is hindered by the enormous financial hurdle. The use of standard components and conventional tools for teleoperated MIS can facilitate integration into existing hospital workflows and can be a cost-efficient and versatile approach for research purposes. To compensate for the lack of haptic feedback, some teleoperation setups inherit a sensor system allowing them to record interaction forces and display them at the user interface. In research and in commercially available systems, different positions for the sensor can be found. In this paper, mechanical interfaces for the guidance and actuation of non-wristed and wristed standard instruments are presented. Furthermore, a method for the extracorporeal measurement of interaction forces is presented, characterized, and discussed. The overall mean relative error of the magnitude of the interaction force is 9.4%, while the overall mean absolute error of the force vector is 14.4$^{\circ }$, both below the respective human differential perception threshold. The presented measurement method is a simple, yet sufficiently accurate approach to measure interaction forces in surgical telemanipulation.

We systematically study several versions of the disjunction and the existence properties in modal arithmetic. First, we newly introduce three classes $\mathrm {B}$, $\Delta (\mathrm {B})$, and $\Sigma (\mathrm {B})$ of formulas of modal arithmetic and study basic properties of them. Then, we prove several implications between the properties. In particular, among other things, we prove that for any consistent recursively enumerable extension T of $\mathbf {PA}(\mathbf {K})$ with $T \nvdash \Box \bot $, the $\Sigma (\mathrm {B})$-disjunction property, the $\Sigma (\mathrm {B})$-existence property, and the $\mathrm {B}$-existence property are pairwise equivalent. Moreover, we introduce the notion of the $\Sigma (\mathrm {B})$-soundness of theories and prove that for any consistent recursively enumerable extension of $\mathbf {PA}(\mathbf {K4})$, the modal disjunction property is equivalent to the $\Sigma (\mathrm {B})$-soundness.