To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
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.