The starting point of this paper is the asynchronous box calculus with multiway communication (MBC), a formalism suitable for modelling compositionally distributed systems using both synchronous and asynchronous communication and a number of control flow operators. MBC is composed of two semantically consistent models: an algebra of lowlevel Petri nets and an associate algebra of process terms ...

The main security mechanism for enforcing memory isolation in operating systems is provided by page tables. The hardware-implemented Translation Lookaside Buffer (TLB) caches these, and therefore the TLB and its consistency with memory are security critical for OS kernels, including formally verified kernels such as seL4. If performance is paramount, this consistency can be subtle to achieve; y...

This article throws new light on the possible role of synapses in information transmission through theoretical analysis and computer simulations. We show that the internal dynamic state of a synapse may serve as a transient memory buffer that stores information about the most recent segment of the spike train that was previously sent to this synapse. This information is transmitted to the posts...

Over the years, many storm water best management practices (BMPs) have been developed to reduce the runoff volume and pollutant concentrations. In general, the concept of BMP takes the four following steps to dispose on-site storm water (USWDCM 2001): (1) to reduce runoff peaks and volumes by minimizing directly connected impervious areas (MDCIA), (2) to provide water quality capture volume (WQ...

Stream and terrestrial ecosystems are intimately connected by riparian zones that support high biodiversity but also vulnerable to human impacts. Landscape disturbances, overgrazing, diffuse pollution of agrochemicals threaten the delivery ecosystem services in agricultural landscapes. We assessed how invertebrate communities respond changes vegetation Romanian catchments, with a focus on role ...

The desCribed architecture is based on a fusion of scan-line rendering and the conventional z-buffer algorithm. The frame buffers of several z-buffer engines are modified to scan out z-values as well as color values. Multiplexing devices combine the z/color streams from each pair of frame-buffers. These z/color streams are then combined by further multiplexers, creating a binary tree that funne...

We consider the online scheduling problem for sorting buffers on a line metric. This problem is motivated by an application to disc scheduling. The input to this problem is a sequence of requests. Each request is a block of data to be written on a specified track of the disc. The disc is modeled as a number of tracks arranged on a line. To write a block on a particular track, the scheduler has ...

All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algorithm. In particular, the goal is to make sure that when a link is congested, it is busy 100% of the time; which is equivalent to making sure its buffer never goes empty. A widely used rule-of-thumb states that each link ne...