Viral particles are required for infection in neurodegenerative Creutzfeldt-Jakob disease.

Several models have been proposed for the infectious agents that cause human Creutzfeldt-Jakob disease (CJD) and sheep scrapie. Purified proteins and extracted nucleic acids are not infectious. To further identify the critical molecular components of the CJD agent, 120S infectious material with reduced prion protein (PrP) was treated with guanidine hydrochloride or SDS. Particulate and soluble components were then separated by centrifugation and molecularly characterized. Conditions that optimally solubilized residual PrP and/or nucleic acid-protein complexes were used to produce subfractions that were assayed for infectivity. All controls retained > 90% of the 120S titer (approximately 15% of that in total brain) but lost > 99.5% of their infectivity after heat-SDS treatment (unlike scrapie fractions enriched for PrP). Exposure to 1% SDS at 22 degrees C produced particulate nucleic acid-protein complexes that were almost devoid of host PrP. These sedimenting complexes were as infectious as the controls. In contrast, when such complexes were solubilized with 2.5 M guanidine hydrochloride, the infectious titer was reduced by > 99.5%. Sedimenting PrP aggregates with little nucleic acid and no detectable nucleic acid-binding proteins had negligible infectivity, as did soluble but multimeric forms of PrP. These data strongly implicate a classical viral structure, possibly with no intrinsic PrP, as the CJD infectious agent. CJD-specific protective nucleic acid-binding protein(s) have already been identified in 120S preparations, and preliminary subtraction studies have revealed several CJD-specific nucleic acids. Such viral candidates deserve more attention, as they may be of use in preventing iatrogenic CJD and in solving a fundamental mystery.

A proposal of algorithm for solving definite descriptions through dialogue structure

En este trabajo proponemos un algoritmo para la resolución de las descripciones definidas en español a través de la estructura del diálogo, mediante la definición de un espacio de accesibilidad anafórico. Este algoritmo está basado en la hipótesis de que la resolución de la anáfora está relacionada con la estructura del diálogo. Así, la resolución de la anáfora mejora si se especifica un espacio de accesibilidad para cada tipo descripción definida según la estructura del diálogo. La utilización de este espacio de accesibilidad anafóico reduce tanto el tiempo de procesamiento como la posibilidad de obtener un antecedente erróneo. Además, la definición de este espacio de accesibilidad depende únicamente de la propia estructura textual del diálogo.

An hybrid parallel algorithm for solving tridiagonal linear systems versus the Wang’s method in a Cray T3D BSP computer

In this paper we describe an hybrid algorithm for an even number of processors based on an algorithm for two processors and the Overlapping Partition Method for tridiagonal systems. Moreover, we compare this hybrid method with the Partition Wang’s method in a BSP computer. Finally, we compare the theoretical computation cost of both methods for a Cray T3D computer, using the cost model that BSP model provides.

Primary school teacher’s noticing of students’ mathematical thinking in problem solving

Professional noticing of students’ mathematical thinking in problem solving involves the identification of noteworthy mathematical ideas of students’ mathematical thinking and its interpretation to make decisions in the teaching of mathematics. The goal of this study is to begin to characterize pre-service primary school teachers’ noticing of students’ mathematical thinking when students solve tasks that involve proportional and non-proportional reasoning. From the analysis of how pre-service primary school teachers notice students’ mathematical thinking, we have identified an initial framework with four levels of development. This framework indicates a possible trajectory in the development of primary teachers’ professional noticing.

Logic-Based Outer-Approximation Algorithm for Solving Discrete-Continuous Dynamic Optimization Problems

We present an extension of the logic outer-approximation algorithm for dealing with disjunctive discrete-continuous optimal control problems whose dynamic behavior is modeled in terms of differential-algebraic equations. Although the proposed algorithm can be applied to a wide variety of discrete-continuous optimal control problems, we are mainly interested in problems where disjunctions are also present. Disjunctions are included to take into account only certain parts of the underlying model which become relevant under some processing conditions. By doing so the numerical robustness of the optimization algorithm improves since those parts of the model that are not active are discarded leading to a reduced size problem and avoiding potential model singularities. We test the proposed algorithm using three examples of different complex dynamic behavior. In all the case studies the number of iterations and the computational effort required to obtain the optimal solutions is modest and the solutions are relatively easy to find.

Efficient algorithms for solving systems of ordinary differential equations for ecosystems modeling /

Mode of access: Internet.

Using analysis for problem solving : a guidebook for law enforcement /

"Created date: September 14, 2001"--P. [4] of cover.

A computer research program for solving the reaction rate equations in the E ionospheric region /

Ionospheric Physics Laboratory Project 8653.

Solving public passenger transportation problems: a need for policy reorientation. Final report. Volume II.

Transportation Department, Office of University Research, Washington, D.C.

An algorithm for solving linear recurrence systems on parallel and pipelined machines /

"UILU-ENG 78 1745."

Iterative and direct methods for solving Poisson's equation and their adaptability to ILLIAC IV,

Includes bibliography.

Solving triangular systems on a parallel computer /

Includes bibliographical references.

A user's view of solving stiff ordinary differential equations /

"COO-2383-0036."

Krylov subspace methods for solving large unsymmetric linear systems /

"COO-2383-0077"--P. 1 of cover.

An iterative method for solving nonsymmetric linear systems with dynamic estimation of parameters /

Vita.