Tape Memory Research Articles

Deque automata, languages, and planar graph representations

A deque automaton is a finite-state machine equipped with a deque memory tape. Such memory being more general than a queue or two stacks, we restrict consideration to quasi-real-time deque machines, for which we present useful normal forms. The closure properties of deque languages qualify them as an abstract family of languages but not a full one. The newly defined characteristic deque language CDL combines Dyck and AntiDyck (or FIFO) languages, and homomorphically characterizes the deque languages. The notion of deque graph from the graph drawing theory, well represents deque computations by means of a planar graph developed on a cylinder surface, with edges visualizing how deque symbols are inserted and removed. The drawing of deque computations on a cylinder is remindful of 3D models used in theoretical (bio)chemistry. We prove that a CDL can be defined in different ways: by a simple deque automaton, by labeled deque graphs, by cancellation rules, and by means of the shuffle and intersection of simpler languages. The labeled deque graph represents the syntax structure of a word.

Определение формальных языков в метаязыке нормальных форм знаний

The expressive means of the metalanguage of normal forms of knowledge in relation to different level formal languages are investigated. The formal descriptions of a multitude of linguistic examples are given. The graphic metadescription equivalent to the given text description of the interpreter of the universal Turing machine is developed. The description provided of the universal Turing machine interpreter can be applied to solving the task of modelling the behavior of any T-machine (which performs the task of data conversion on its memory tape). The formal definition of the translator of the determined Turing machine is given. The ability to describe in the metalanguage of normal forms of knowledge the interpreting-translating and the translating-translating processes of formulating and solving of a given task, for which a solution exists is substantiated and defined. Problems in programming 2017; 4: 037-050

Tape Work and Memory Work in Post-War Germany

ABSTRACTSonic traces of the Third Reich have held significant memorial power in post-war Germany. This article traces three works that sample one of the most well-known recordings from the Nazi period: Joseph Goebbels's declaration of Total War, delivered on 18 February 1943, and broadcast on newsreel and radio the following week. In both message and material, this recording epitomizes Friedrich Kittler's claim that tape is a military technology. The works examined span different memory debates in post-war Germany: Bernd Alois Zimmermann realized Requiem für einen jungen Dichter (1967–9) as West Germans were engaging in the first public discussions of the Holocaust, Georg Katzer's Mein 1989 (1990) is an East German composer's early response to the fall of the Berlin Wall, while Marcel Beyer's novel Flughunde (The Karnau Tapes, 1995) reveals the continued attempt to address the legacy of the Third Reich after German Reunification. Analysed together, these works create new configurations of discourse about wartime memory, moving away from geopolitical contours. Each of these artists transforms tape's wartime uses – namely dissemination and encryption – into forms of memorial labour. Through their physical and conceptual manipulations of tape, these artists create less deterministic readings of the Nazi past.

Operational derivation of Boltzmann distribution with Maxwell's demon model.

The resolution of the Maxwell’s demon paradox linked thermodynamics with information theory through information erasure principle. By considering a demon endowed with a Turing-machine consisting of a memory tape and a processor, we attempt to explore the link towards the foundations of statistical mechanics and to derive results therein in an operational manner. Here, we present a derivation of the Boltzmann distribution in equilibrium as an example, without hypothesizing the principle of maximum entropy. Further, since the model can be applied to non-equilibrium processes, in principle, we demonstrate the dissipation-fluctuation relation to show the possibility in this direction.

Completeness of the Dynamics of the Attributes Values of Data in the Database DIM

This paper is devoted to justifying the possibility of DBMS DIM usage and its interaction mechanism as an algorithmically complete implementation of an objectdynamic model. An extension for a static OD-model by including sets of algorithmic procedures which modify values of object attributes and also create, remove and modify objects themselves is considered. To ensure the possibility of modifying DIM DB data in a way equivalent to OD-model modifications, interaction and history relations between DIM objects are considered. To minimize the dependence from concrete language constructions, which describe OD-model algorithmic procedures, the reduction to the universal form – Turing machine is performed. A way to create a Turing machine equivalent to OD.MT in terms of DIM, where a special set of PL/ODQL procedures is used as a control unit and a functional table is proposed. Later, a mechanism to form a memory tape of such DIM.MT by encoding information about DIM object, and their subsequent decoding back to DIM objects is described. The process of work of such a machine is modelled by using an endless cycle of executing some PL/ODQL procedures of reading and writing objects from / to the memory tape. Basing on the earlier proved theorem about the static completeness of data representation in DIM, at the end of the paper the proof on the completeness of representation of the Objects attributes values dynamics is considered. The article is published in the author’s wording.

The MacWilliams identity for m-spotty Rosenbloom–Tsfasman weight enumerator

The communication systems and disk or tape memory can sometimes cause clusters of errors, namely burst errors. There have been many designs in order to detect and even correct such errors. Recently, a new class of codes called m-spotty byte error correcting codes has found applications in high speed memory systems that employ random access memory chips wide Input/Output data, especially at 8, 16, or 32bits. The MacWilliams identity provides the relationship between the weight distribution of a code and that of its dual code. Also, an interesting new metric called Rosenbloom–Tsfasman metric has been studied as an alternative metric for linear codes recently. In this paper, we combine these two interesting topics and introduce the m-spotty Rosenbloom–Tsfasman weights and the m-spotty Rosenbloom–Tsfasman weight enumerator of a binary code. Moreover, we prove a MacWilliams identity for the m-spotty Rosenbloom–Tsfasman weight enumerators.

Construction of a universal quantum computer

We construct a universal quantum computer following Deutsch's original proposal of a universal quantum Turing machine (UQTM). Like Deutsch's UQTM, our machine can emulate any classical Turing machine and can execute any algorithm that can be implemented in the quantum gate array framework but under the control of a quantum program, and hence is universal. We present the architecture of the machine, which consists of a memory tape and a processor and describe the observables that comprise the registers of the processor and the instruction set, which includes a set of operations that can approximate any unitary operation to any desired accuracy and hence is quantum computationally universal. We present the unitary evolution operators that act on the machine to achieve universal computation and discuss each of them in detail and specify and discuss explicit program halting and concatenation schemes. We define and describe a set of primitive programs in order to demonstrate the universal nature of the machine. These primitive programs facilitate the implementation of more complex algorithms and we demonstrate their use by presenting a program that computes the NAND function, thereby also showing that the machine can compute any classically computable function.

Reversal complexity revisited

We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r ( n ) , there are several further tapes on which head reversals remain unrestricted, but size is bounded by s ( n ) (where n denotes the input length). Recently [M. Grohe, C. Koch, N. Schweikardt, Tight lower bounds for query processing on streaming and external memory data, Theoretical Computer Science 380 (1–2) (2007) 199–217; M. Grohe, N. Schweikardt, Lower bounds for sorting with few random accesses to external memory, in: Proc. PODS’05, ACM Press, 2005, pp. 238–249], such machines were introduced as a formalization of a computation model that restricts random access to external memory and internal memory space. Here, each of the tapes with a restriction on the head reversals corresponds to an external memory device, and the tapes of restricted size model internal memory. We use ST ( r ( n ) , s ( n ) , O ( 1 ) ) to denote the class of all problems that can be solved by deterministic Turing machines that comply to the above resource bounds. Similarly, NST ( ⋯ ) and RST ( ⋯ ) , respectively, are used for the corresponding nondeterministic and randomized classes. While previous papers focused on lower bounds for particular problems, including sorting, the set equality problem, and several query evaluation problems, the present paper addresses the relations between the (R,N) ST ( ⋯ ) -classes and classical complexity classes and investigates the structural complexity of the (R,N) ST ( ⋯ ) -classes. Our main results are (1) a trade-off between internal memory space and external memory head reversals, (2) correspondences between the (R,N) ST ( ⋯ ) classes and “classical” time-bounded, space-bounded, reversal-bounded, and circuit complexity classes, and (3) hierarchies of (R) ST ( ⋯ ) -classes in terms of increasing numbers of head reversals on external memory tapes.

Study on Foil Bearing (An Application to Tape Memory Devices)

The air film thickness between a foil and a drum is studied experimentally using a measuring system under conditions where the Air film thickness is effected by the bending stiffness of the foil. For comparatively flexible foil cases, the experimental results coincide fairly well with theoretical ones obtained by applying the separation boundary condition. For cases with stiffer foil conditions, the tendency of the experimental results may also be explained well by the theoretical analysis, by introducing the concept of the tangency point condition as well as the infinity point condition for the film pressure generation point The theoretical tool of Finite Element Method is used to analyze film thickness and pressure distribution in a foil bearing for various values of foil stiffness, The calculated results agree with the experimental data, and it is concluded that the shallow shells model is useful and accurate.

Spaced Retrieval vs. Memory Tape Therapy in Memory Rehabilitation for Dementia of the Alzheimer's Type

This study compared two memory rehabilitation techniques, specifically memory tape training and spaced retrieval. Subjects (n = 6) with mild-moderate dementia were assigned to two treatment groups with half receiving memory tape therapy and half the spaced retrieval method. Results of the study indicated that both treatment techniques were effective forms of memory rehabilitation.

Memory improvement tapes: How effective for elderly adults?

The effectiveness of two commercially available audiocassette memory improvement programs was evaluated in a sample of 32 healthy, community-living elderly adults. Participants were given a set of either Syber Vision's Neuropsychology of Memory Power tapes (Bornstein, 1989) or Nightingale-Conant's Mega Memory tapes (Trudeau, 1992), and a portable cassette player, and instructed to complete the programs within 10 weeks. All participants received a comprehensive battery of memory tests prior to and immediately following the memory improvement programs. Participants completing the memory improvement programs showed no greater gains in memory test performance than no-treatment control participants, but did report greater confidence in their memory abilities. Participants completing the Mega Memory program thought they were less likely to develop Alzheimer's disease after having completed it compared with participants in the other two conditions. Participants reported finding both tape programs acceptable and potentially useful for improving memory; those who completed the Memory Power program reported somewhat greater satisfaction than those completing the Mega Memory program. the claims about rapid, dramatic memory improvement with use of these products were not substantiated in this group of elderly adults and appear to be grossly exaggerated.

Volunteers in partnership: An Alzheimer's rehabilitation program delivered by students

This article describes a “partnered volunteering,” student-delivered language, and memory stimulation program for Alzheimer patients that is easy to replicate and administer low in cost, and beneficial to the patients, students, family members, and participating community agencies involved. The program took place during two consecutive semesters at the University of Arizona. Positive pre- to post-test patient language changes and improvements on memory test performance are reported. Twelve early stage Alzheimer patients-six each semester-were matched with 12 undergraduate speech and hearing and psychology students. The pairs were each assigned to 10 one-hour weekly sessions of volunteer service or other community activity meaningful to the patient. During each session, students engaged partners in 30 to 40 minutes of structured conversation-stimulating activities. During the second semester, four patients also worked with biographical memory tapes and quizzes produced and administered by their student partners.1-2 Parallel discourse samples were taken of subjects before and after participation. Small to massive gains in number of substantive on-topic statements produced were achieved by seven out of 11 subjects who completed the program: 9 percent, 14 percent, 48 percent, 58 percent, 93 percent, 161 percent, and 238 percent over baseline, respectively. Eight subjects improved on picture description and eight on proverb interpretation tasks. Three of the four patients who worked with biographical memory tapes substantially improved performance from pre- to post-training. All participants-patients, students, and caregivers-benefited effectively and socially.

What You Expect Is What You Believe (But Not Necessarily What You Get): A Test of the Effectiveness of Subliminal Self-Help Audiotapes

Seventy-eight subjects, ranging in age from 18 to 60 years, participated in an experiment on the effectiveness of commercially produced subliminal self-help audiotapes. Upon completing pretest memory and self-esteem tests, subjects randomly received either a subliminal self-help tape designed to improve memory or increase self-esteem and were told that they had received either a memory or a self-esteem tape. After listening to the tape for 5 weeks in a home environment, subjects returned to the laboratory for memory and self-esteem tests. The results showed that the subliminal self-help tapes did not affect any of the performance measures in a manner consistent with manufacturer claims. However, subjects' perceptions of personal improvement were consistent with their expectations. Specifically, subjects who thought they had listened to a self-esteem tape were more likely to indicate that their self-esteem had improved and subjects who thought they had listened to a memory tape were more likely to indicate...

A Field Test of Subliminal Self-Help Audiotapes: The Power of Expectancies

In the face of evidence to the contrary, consumers continue to believe in the efficacy of subliminal message self-help (SMSH) audiotapes. The authors contend that the value consumers attribute to these tapes stems from the illusion of efficacy, the result of an expectancy effect. Two double-blind studies tested subliminal message self-help audiotapes claimed to improve memory, increase self-esteem, or induce weight loss. Actual content and labeled content were independently varied; some subjects believed they were using memory tapes but were actually using weight loss or self-esteem tapes, and so on. After a month of use (per manufacturers’ recommendations) by volunteer subjects, there were no effects of subliminal content in the claimed direction on any of the three dimensions. In contrast, there were changes or the perception of changes corresponding to the tape labels. These placebolike effects are hypothesized to result from consumer expectancies. If consumers who forsake more conventional treatments for SMSH audiotapes are misled, they suffer both the loss of the price of the tapes and, more importantly, opportunity costs. Thus, the potentially damaging consequences are a major concern from a public policy perspective.

Double-Blind Tests of Subliminal Self-Help Audiotapes

Three replications of a double-blind experiment tested subliminal audiotape products that were claimed to improve memory or to increase self-esteem. Conditions of use adhered to manufacturers' recommendations, and subjects (N = 237) were limited to persons who desired the effects offered by the tapes. Actual content and labeled content of tapes were independently varied, so that some subjects who believed they were using memory tapes were actually using self-esteem tapes, and vice versa. After a month of use, neither the memory nor the self-esteem tapes produced their claimed effects. Nevertheless, a general improvement for all subjects in both memory and self-esteem (a nonspecific placebo effect) was observed, and more than a third of the subjects had the illusion of improvement specific to the domain named on the tape's label.

Audio Analysis II: Read-Only Optical Disks

Computer musicians as well as survivors of our information age need gigabytes of cheap memory accessible in less than a second. Imagine a huge library of digital sounds available this quickly. Semiconductor memory technology is advancing rapidly but remains costly. The cost per bit of magnetic memory (tape, floppy disks, Winchester disks) is decreasing, yet it is likely to reach a plateau by 1990 (Rodriguez 1983). Optical technology (based on light) has already proven successful in communications via fiber optics, and will some year probably be successful in the computational domain-an optical central processing unit. But this year the action is in mass storage. The size per bit is smaller (and therefore cheaper) in optical memory than in magnetic memory, so optical memory appears to be the medium of choice in mass storage from the standpoint of capacity. This article discusses read-only disks; a second article will discuss write-once and erasable (read/write) optical media.

Space Shuttle primary onboard software - STS-1 to operational use

The Shuttle primary onboard software and associated computer hardware comprise a data processing complex responsible for virtually all inters}stem data flow and vehicle external interfaces. Onboard functions related to guidance, navigation, flight control, systems monitoring, and management, as well as vehicle/crew/ ground interfaces, are handled by this primary system. The organization that prepared the software for the Shuttle orbital flight tests emphasized a disciplined design and development phase coupled with a thorough independent verification activity. Current focus is centered on tailoring the software organization, test philosophy, and maintenance and test facilities to the high flight frequencies and diverse missions expected during the Shuttle operational era. Shuttle Software Overview T HE successful completion of the first orbital flight of the Shuttle (STS-1) in April of 1981 marked the culmination of one of the most complex software development and integration activities ever undertaken. The evolution of the Shuttle's data processing system (DPS) has spanned more than eight years. Along with the orbital flight tests, the development program also included the approach and landing test (ALT) project during which a Shuttle vehicle was launched from a Boeing 747 aircraft and performed the terminal approach and landing portions of the Shuttle mission. Five such ALT flights were performed during August through October of 1977 providing an early test bed for both the DPS hardware and basic software architecture that would eventually be used for the orbital test missions. With respect to size and complexity, the software for the first orbital flight test of the Shuttle involved eight separately executable programs or memory configurations sharing a common operating system (see Fig. 1). These programs were stored on a mass memory tape device and were loaded into the onboard computers on crew request. One of the eight performed all functions necessary to the launch, ascent, and orbit insertion phases of the mission. Two others provided software to be used during on-orbit operations and included both navigation and control functions as well as system monitoring and management functions. Another memory configuration performed all functions necessary to the de-orbit, entry, and landing mission phases. The remaining four were designed to perform critical prelaunch and on-orbit vehicle checkout procedures. In all, these eight programs, including the software operating system, comprised approximately one-half million 32-bit words of data and executable instructions. All Shuttle applications software modules and a large part of the operating system included in these memory configurations were implemented in the HAL/S high-order language. The language and associated compiler, specifically developed for aerospace applications, are scientifically oriented and especially suited to real-time systems. The criticality of the software to the Shuttle is emphasized by its numerous interfaces with other vehicle subsystems. There are few functions integral to the Shuttle operation for

Data reduction of sampled speech signals: method and results

A method for data reduction in the transmission of speech signals is described, which is based on a new procedure for the extrapolation of short-time stationary signals. An example of the reconstruction network has been simulated on a minicomputer provided with an additional tape memory. Digital speech signals, stored in the tape memory, have been processed in the simulated system and restored and listened to in real time. This reconstructed sound is of very good quality compared with the original signal. In comparison with the Vocoder systems, very little hardware is required. Close similarity between the original and reconstructed speech signal has also been shown to exist in short-time analysis of the signals in both the time and frequency domains.

A Study on Foil Bearings : An Application to Tape Memory Devices

Film thickness and pressure distributions in foil bearings are analysed in connection with magnetic tape memory devices. The finite element technique is used. As examples, analyses are done in cases of a circular head and a double apex head. The results are given in graphs. The region of constant film thickness and the pressure spike in the exit region, both of which are typical features of elasto-hydrodynamic lubrication, are clearly seen in them. Experiments are also carried out in case of a circular head. Close agreements between calculated and experimental results are obtained.

OPTICAL MASS MEMORIES

Optical and magnetic variants in the design of trillion-bit read/write memories are compared and tabulated. Components and materials suitable for a random access read/write nonmoving memory system are examined, with preference given to holography and photoplastic materials. Advantages and deficiencies of photoplastics are reviewed. Holographic page composer design, essential features of an optical memory with no moving parts, fiche-oriented random access memory design, and materials suitable for an efficient photoplastic fiche are considered. The optical variants offer advantages in lower volume and weight at data transfer rates near 1 Mbit/sec, but power drain is of the same order as for the magnetic variants (tape memory, disk memory). The mechanical properties of photoplastic film materials still leave much to be desired.