A semaphore is a data structure designed to track how many units of some resource are available. It also provides operations to increase or decrease the number, representing the creation or the consumption of that resource, respectively. A process that wishes to consume one unit of the resource, when none are available, will be blocked until one new unit of the resource is created. Semaphores a...

We introdu e a new on urrent lambda al ulus with futures, (fut), to model the operational semanti s of onurrent extensions of ML. (fut) an safely express a variety of high-level on urren y onstru ts, in luding hannels, semaphores, or ports. Safe implementations of these onstru ts in (fut) annot be orrupted in any well-typed ontext. We prove safety on basis of a linear type system.

SR is a language for concurrent programming. This paper describes the SR language, presents some examples of SR programs in the context of an undergraduate operating systems course, and provides some programming assignments that can be used in an open laboratory. The SR language can be used by instructors of operating systems courses to give students experience in writing concurrent programs th...

In the last several years, remote sensing technology has opened up the possibility of performing large scale building detection from satellite imagery. Our work is some of the first to create population density maps from building detection on a large scale. The scale of our work on population density estimation via high resolution satellite images raises many issues, that we will address in thi...

We show how to build an inductorless version of the classic Chua’s circuit. The goal is to build Chua’s circuit quickly and easily. To this end, only off-the-shelf components are used. A suitable inductor for Chua’s circuit is often hard to procure. Here, the inductor is replaced by a single op-amp synthetic inductor circuit. The synthetic inductor is novel in the sense that it is not a gyrator...

Speculative computing is a technique to improve the execution time of certain applications by starting some computations before it is known that the computations are required. A speculative computation will eventually become mandatory (i.e. required) or irrelevant (i.e. not required). In the absence of side e ects irrelevant computations may be aborted. However, with side e ects a computation w...

Background The main treatment of polymyalgia rheumatica (PMR) are glucocorticoids (GC) with a 6-month decrease target, but 45% patients have an unfavourable evolution relapses or dependence. Poor prognostic factors in PMR understudied and controversial. Objectives aim this work was to identify predictive favourable GC-dependent optimize its management. Methods This used data from the phase III ...

Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...

A wide class of single-product, dynamic inventory problems with convex cost functions and a finite horizon is investigated as a stochastic programming problem. When demands have finite discrete distribution functions, we show that the problem can be substantially reduced in size to a linear program with upper-bounded variables. Moreover,, we show that the reduced problem has a network represent...