Secondary structure effects on DNA hybridization kinetics: a solution versus surface comparison

The hybridization kinetics for a series of designed 25mer probe�target pairs having varying degrees of secondary structure have been measured by UV absorbance and surface plasmon resonance (SPR) spectroscopy in solution and on the surface, respectively. Kinetic rate constants derived from the resultant data decrease with increasing probe and target secondary structure similarly in both solution and surface environments. Specifically, addition of three intramolecular base pairs in the probe and target structure slow hybridization by a factor of two. For individual strands containing four or more intramolecular base pairs, hybridization cannot be described by a traditional two-state model in solution-phase nor on the surface. Surface hybridization rates are also 20- to 40-fold slower than solution-phase rates for identical sequences and conditions. These quantitative findings may have implications for the design of better biosensors, particularly those using probes with deliberate secondary structure.

Late onset of huntington's disease

Twenty-five patients with late-onset Huntington's disease were studied; motor impairment appeared at age 50 years or later. The average age at onset of chorea was 57.5 years, with an average age at diagnosis of 63.1 years. Approximately 25% of persons affected by Huntington's disease exhibit late onset. A preponderance of maternal transmission was noted in late-onset Huntington's disease. The clinical features resembled those of mid-life onset Huntington's disease but progressed more slowly. Neuropathological evaluation of two cases reveal less severe neuronal atrophy than for mid-life onset disease.

Adaptive Routing of QoS-constrained Media Streams over Scalable Overlay Topologies

Current research on Internet-based distributed systems emphasizes the scalability of overlay topologies for efficient search and retrieval of data items, as well as routing amongst peers. However, most existing approaches fail to address the transport of data across these logical networks in accordance with quality of service (QoS) constraints. Consequently, this paper investigates the use of scalable overlay topologies for routing real-time media streams between publishers and potentially many thousands of subscribers. Specifically, we analyze the costs of using k-ary n-cubes for QoS-constrained routing. Given a number of nodes in a distributed system, we calculate the optimal k-ary n-cube structure for minimizing the average distance between any pair of nodes. Using this structure, we describe a greedy algorithm that selects paths between nodes in accordance with the real-time delays along physical links. We show this method improves the routing latencies by as much as 67%, compared to approaches that do not consider physical link costs. We are in the process of developing a method for adaptive node placement in the overlay topology, based upon the locations of publishers, subscribers, physical link costs and per-subscriber QoS constraints. One such method for repositioning nodes in logical space is discussed, to improve the likelihood of meeting service requirements on data routed between publishers and subscribers. Future work will evaluate the benefits of such techniques more thoroughly.

An Admission Control Paradigm for Real-time Databases

We propose and evaluate an admission control paradigm for RTDBS, in which a transaction is submitted to the system as a pair of processes: a primary task, and a recovery block. The execution requirements of the primary task are not known a priori, whereas those of the recovery block are known a priori. Upon the submission of a transaction, an Admission Control Mechanism is employed to decide whether to admit or reject that transaction. Once admitted, a transaction is guaranteed to finish executing before its deadline. A transaction is considered to have finished executing if exactly one of two things occur: Either its primary task is completed (successful commitment), or its recovery block is completed (safe termination). Committed transactions bring a profit to the system, whereas a terminated transaction brings no profit. The goal of the admission control and scheduling protocols (e.g., concurrency control, I/O scheduling, memory management) employed in the system is to maximize system profit. We describe a number of admission control strategies and contrast (through simulations) their relative performance.