Let G be a locally compact group, and let WAP(G) denote the space of weakly almost periodic functions on G. We show that, if G is a [SIN]-group, but not compact, then the dual Banach algebra WAP(G)∗ does not have a normal, virtual diagonal. Consequently, whenever G is an amenable, non-compact [SIN]-group, WAP(G)∗ is an example of a Connes-amenable, dual Banach algebra without a normal, virtual ...

Let {T (t)} t≥0 be a C-semigroup on a Banach space X with generator A. We will investigate the asymptotic almost periodicity of {T (t)} via the Hille-Yosida space of its generator.

In this note, we establish the existence of asymptotically almost periodic and almost periodic solutions for a class of partial integrodifferential equations.

Imagine a simulated world where the characters you interact with are almost human – they converse with you in English, they understand the world they are in, can reason about what to do, and they exhibit emotions. Some of these characters may be your friends, while others will oppose you. Unlike current video games, being successful in this world won’t just be a matter of who is quickest on the...

A novel multiple scales method is formulated that can be applied to problems which have an almost periodic microstructure not in Cartesian coordinates but in a general curvilinear coordinate system. The method is applied to a model of the electrical activity of cardiac myocytes and used to derive a version of the bidomain equations describing the macroscopic electrical activity of cardiac tissu...

By means of the Cauchy matrix we give sufficient conditions for the existence and exponential stability of almost periodic solutions for the delay impulsive Lasota–Wazewska model. The impulses are realized at fixed moments of time.

Static variables and methods are part of almost every modern object-oriented programming language. Static elements are for instance indispensable for certain kinds of design patterns applied during programming. Object-oriented specification formalisms on the other hand lack such concepts. This can prevent writing formal specifications close to the actual implementation, and can thus hamper a re...

Java programs often use pointer structures for normal computations. A verification system for Java should have good proof support for reasoning about those structures. However, the literature for pointer verification almost always uses specifications and definitions that are tailored to the problem under consideration. We propose a generic specification for Java pointer structures that allows t...