996 resultados para memory marker
Resumo:
"Da-Huang" (Radix et Rhizoma Rhei, medicinal rhubarb), a famous and important Traditional Chinese Medicine, has often been confused with the adulterant species in the same genus, Rheum. Through sequencing the trnL (UAA)/trnF (GAA) regions of chloroplast DNA of thirteen species of Rheum (three medicinal rhubarb species and ten adulterant ones), a molecular marker of the medicinal species was found. A pair of PCR primers based on the sequences, was thus designed, which amplified a highly specific DNA fragment in medicinal rhubarb exclusively, and absent in the adulterants at all under an optimized PCR condition.
Resumo:
阐述内建自检测(BIST)技术的特点、结构和原理,并介绍其在Memory单元电路中的实现过程。
Resumo:
A Persistent Node is a redundant distributed mechanism for storing a key/value pair reliably in a geographically local network. In this paper, I develop a method of establishing Persistent Nodes in an amorphous matrix. I address issues of construction, usage, atomicity guarantees and reliability in the face of stopping failures. Applications include routing, congestion control, and data storage in gigascale networks.
Resumo:
This thesis describes the design and implementation of an integrated circuit and associated packaging to be used as the building block for the data routing network of a large scale shared memory multiprocessor system. A general purpose multiprocessor depends on high-bandwidth, low-latency communications between computing elements. This thesis describes the design and construction of RN1, a novel self-routing, enhanced crossbar switch as a CMOS VLSI chip. This chip provides the basic building block for a scalable pipelined routing network with byte-wide data channels. A series of RN1 chips can be cascaded with no additional internal network components to form a multistage fault-tolerant routing switch. The chip is designed to operate at clock frequencies up to 100Mhz using Hewlett-Packard's HP34 $1.2\\mu$ process. This aggressive performance goal demands that special attention be paid to optimization of the logic architecture and circuit design.
Resumo:
Neal, M., Meta-stable memory in an artificial immune network, Proceedings of the 2nd International Conference on Artificial Immune Systems {ICARIS}, Springer, 168-180, 2003,LNCS 2787/2003
Resumo:
Edkins, Jenny, Trauma and the Memory of Politics (Cambridge: Cambridge University Press, 2003), pp.xvii+265 RAE2008
Resumo:
Byers, D., Peel, D., Thomas, D. (2007). Habit, aggregation and long memory: Evidence from television audience data. Applied Economics, 39 (3), 321-327. RAE2008
Resumo:
Woods, T. (2007). African Pasts: Memory and History in African Literatures. Manchetser: Manchester University Press. RAE2008
Resumo:
Pearson, Mike, In Comes I: Performance, Memory and Landscape (Exeter: University of Exeter Press, 2007) RAE2008
Resumo:
Borsay, Peter, 'New Approaches to Social History. Myth, Memory and Place: Monmouth and Bath 1750-1900', Journal of Social History (2006) 39(3) pp.867-889 RAE2008
Resumo:
Memorial Sermon preached in memory of the Rev. Walter Gardner Webster
Resumo:
Tribute to the Memory of President Fisk.
Resumo:
The proliferation of inexpensive workstations and networks has prompted several researchers to use such distributed systems for parallel computing. Attempts have been made to offer a shared-memory programming model on such distributed memory computers. Most systems provide a shared-memory that is coherent in that all processes that use it agree on the order of all memory events. This dissertation explores the possibility of a significant improvement in the performance of some applications when they use non-coherent memory. First, a new formal model to describe existing non-coherent memories is developed. I use this model to prove that certain problems can be solved using asynchronous iterative algorithms on shared-memory in which the coherence constraints are substantially relaxed. In the course of the development of the model I discovered a new type of non-coherent behavior called Local Consistency. Second, a programming model, Mermera, is proposed. It provides programmers with a choice of hierarchically related non-coherent behaviors along with one coherent behavior. Thus, one can trade-off the ease of programming with coherent memory for improved performance with non-coherent memory. As an example, I present a program to solve a linear system of equations using an asynchronous iterative algorithm. This program uses all the behaviors offered by Mermera. Third, I describe the implementation of Mermera on a BBN Butterfly TC2000 and on a network of workstations. The performance of a version of the equation solving program that uses all the behaviors of Mermera is compared with that of a version that uses coherent behavior only. For a system of 1000 equations the former exhibits at least a 5-fold improvement in convergence time over the latter. The version using coherent behavior only does not benefit from employing more than one workstation to solve the problem while the program using non-coherent behavior continues to achieve improved performance as the number of workstations is increased from 1 to 6. This measurement corroborates our belief that non-coherent shared memory can be a performance boon for some applications.