Search PubMed⌕ Search
Home/Archive/PubMed

PubMed · 6548678

An intentional-action guiding algorithm in a user-programmable memory prosthesis.

K M Colby·R C Parkison
View original source ↗Export metadata ↓

Abstract

Patients with memory problems tend to forget what their intentions are in the course of carrying out a series of sequential actions directed towards a desired goal. To aid in this problem, a working memory prosthesis has been designed and implemented on a microcomputer connected to a voice synthesizer. The instrument keeps the patient on the track of his current action plan by uttering pre-stored spoken instructions at periodic intervals. An interface algorithm allows the user to enter the steps of his own routine action-patterns in computer memory along with mnemonics for evoking them. Further potential uses of such a memory prosthesis are described.

Explore related subjects

ComputersCyberneticsHumansMemoryMicrocomputersModels, PsychologicalSoftwareComparative StudyJournal Article

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

K M Colby, R C Parkison. 1984. An intentional-action guiding algorithm in a user-programmable memory prosthesis.. https://doi.org/10.1016/0010-468x(84)90048-5

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

PubMed1996

Sensitivity and selectivity in protein similarity searches: a comparison of Smith-Waterman in hardware to BLAST and FASTA.

To predict the functions of a possible protein product of any new or uncharacterized DNA sequence, it is important first to detect all significant similarities between the encoded amino acid sequence and any accumulated protein sequence data. We have implemented a set of queries and database sequences and proceeded to test and compare various similarity search methods and their parameterizations. We demonstrate here that the Smith-Waterman (S-W) dynamic programming method and the optimized version of FASTA are significantly better able to distinguish true similarities from statistical noise than is the popular database search tool BLAST. Also, a simple "log-length normalization" of S-W scores based on the query and target sequence lengths greatly increased the selectivity of the S-W searches, exceeding the default normalization method of FASTA. An implementation of the modified S-W algorithm in hardware (the Fast Data Finder) is able to match the accuracy of software versions while greatly speeding up its execution. We present here the selectivity and sensitivity data from these tests as well as results for various scoring matrices. We present data that will help users to choose threshold score values for evaluation of database search results. We also illustrate the impact of using simple-sequence masking tools such as SEG or XNU.

Computers↗