A model for a historical database is described which is based upon time-stamped tuples as the unit of storage. The model includes both physical and logical time-stamps. The technical characteristics of write-once laser discs prevent the use of double logical time-stamps. The model distinguishes version from correction-updates. It is shown that if set-valued attributes are involved the use of nu...

The use of computer applications can be a frustrating experience. This study replicates previous studies of the amount of time users – involuntarily – spend trying to diagnose and recover from problems they encounter while using computer applications such as web browsers, email, and text processing. In the present study, 21 users self-reported their frustrating experiences during an average of ...

We present coding methods for protecting against tampering of write-once optical disks, which turns them into a secure digital medium for applications where critical information must be stored in a way that prevents or allows detection of an attempt at falsification. Our method involves adding a small amount of redundancy to a modulated sector of data. This extra redundancy is not used for norm...

The generalized write-once memory introduced by Fiat and Shamir is a q-ary information storage medium. Each storage cell is expected to store one of q symbols, and the legal state transitions are described by an arbitrary directed acyclic graph. This memory model can be understood as a generalization of the binary write-once memory which was introduced by Rivest and Shamir. During the process o...

This study investigated the status of mechanized power and self-propelled rice cultivation machinery in Guilan Province in northern Iran. The raw data was obtained from 2013 statistics of the Agricultural Jihad Organization of Guilan province. Power per unit of area, mechanization level, area per unit of self-propelled machinery, and mechanization requirement were calculated for eastern, wester...

A machine solves a problem using space s(·) if, for every input x, the machine outputs the correct answer and uses only the first s(|x|) cells of the tape. For a standard Turing machine, we can’t do better than linear space since x itself must be on the tape. So we will often consider a machine with multiple tapes: a read-only “input” tape, a read/write “work” or “memory” tape, and possibly a w...