Memory Efficiency

DMSO (Fig. 25) [81,127,128]. The memory of the macromolecular helicity was not transient but lasted for an extremely long time (over two years). The memory efficiency was influenced by small structural changes in the achiral amines. 

Janis, I. L., 6c Astrachan, M. (1951). The effect of electroconvulsive treatments on memory efficiency. Journal of Abnormal Psychology, 46, 501—511. 

A 45-year-old woman with multiple sclerosis had smoked cannabis since 1990 to control pain and muscle spasms (current use marijuana cigarettes containing 3.5% THC 10/day). She had impairment of concentration, learning, and memory efficiency. Her ability to acquire new verbal information was also impaired. 

Eddy, S. R. (2002) A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure. BMC Bioinformatics 3, 18. 

Morrow LA, Robin N, Hodgson MJ, et al Assessment of attention and memory efficiency in persons with solvent neurotoxicity. Neuropsychology 30 911-922, 1992a... 

Courcoubetis, C., Vardi, M., Wolper, P. Yannakakis, M. (1992), Memory-Efficient Algorithms for the Verification of Temporal Properties , Formal Methods in System Design 1, 275-288. 

For computational efficiency, the logarithms of the ratios are often added, rather than multiplying the ratios themselves. For memory efficiency, features with log-ratios equal to or very close to 0 can be omitted from the model especially when sparse fingerprints such as ECFP 4 are used, most features wiU be found with approximately equal probability in both active and inactive compounds [5]. The sum of the log-ratios of features present in test compounds serves as a score to rank them according to their likelihood to be active ... 

Langmead B, Trapnell C, Pop M, Salzberg SL (2009) Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol 10(3) R25. doi 10.1186/gb-2009-10-3-r25... 

The GeoDict software" makes available the fast and memory-efficient solutions for Eqs 9.11 and 9.12." The similarity of Eqs 9.11 and 9.12 leads... 

Apart from PDG-based slicing, slicing based on data flow equations have been proposed by Weiser [24,25], Lyle [17], and Lisper [15]. Even though some of these approaches can handle unstructured control flow and low-level code, our approach is more time and memory efficient for computing single slices of source codes that does not contain arbitrary jumps. There have been several empirical studies and survey papers [5,6,23,26] that compare different slicing techniques. 

Following the ideas set forth by Day and Minster (1984), in which a set of internal memory variables are used to represent the relaxation process, others have formulated memory-efficient approaches to anelastic wave propagation simulation using FD and FE approaches (e.g., Day and Bradley 2001 Ma and Liu 2006). 

More generally, a matrix is said to be sparse if most of its elements are zero. A sparse matrix can be stored in memory efficiently by recording only the positions and values of its nonzero elements. Let us say that we have an N x N matrix A with at most only three non-zero elements per row. While the total number of elements is N, at most only 3N are non-zero, and the matrix is sparse for large N. If Anz is the number of nonzero elements in A, or at least an upper bound to the number of nonzero elements, we can store all the information that we need about in two integer vectors of length Anz (for the row and column positions of the nonzero elements) and a single real vector of length A z for their valnes. For example, the matrix... 

BFGS can be applied to large problems when the Hessian is sparse if the update formula (5.38) is provided with the sparsity pattern so that only the nonzero positions are stored and updated. Alternatively, only die most recent gradient vectors may be retained and used in (5.38). Both approaches allow the construction of approximate Hessians with limited memory usage. For a more detailed discussion of memory-efficient BFGS methods, consult Nocedal Wright (1999). 

---