A time aggregation approach to Markov decision processes

We propose a time aggregation approach for the solution of infinite horizon average cost Markov decision processes via policy iteration. In this approach, policy update is only carried out when the process visits a subset of the state space. As in state aggregation, this approach leads to a reduced state space, which may lead to a substantial reduction in computational and storage requirements, especially for problems with certain structural properties. However, in contrast to state aggregation, which generally results in an approximate model due to the loss of Markov property, time aggregation suffers no loss of accuracy, because the Markov property is preserved. Single sample path-based estimation algorithms are developed that allow the time aggregation approach to be implemented on-line for practical systems. Some numerical and simulation examples are presented to illustrate the ideas and potential computational savings.     

Algorithm for finding all k nearest neighbors

A very simple algorithm for computing all k nearest neighbors in 2-D is presented. The method does not rely on complicated forms of tessellation, it only requires simple data binning for fast range searching. Its applications range from scattered data interpolation to reverse engineering.     

Scaffolded writing and rewriting in the discipline: A web-based reciprocal peer review system

This paper describes how SWoRD (scaffolded writing and rewriting in the discipline), a web-based reciprocal peer review system, supports writing practice, particularly for large content courses in which writing is considered critical but not feasibly included. To help students gain content knowledge as well as writing and reviewing skills, SWoRD supports the whole cycle of writing, reviews, back-reviews, and rewriting by scaffolding the journal publication process as its authentic practice model. In addition, SWoRD includes algorithms that compute individual reviewer’s review accuracy, which is in turn used to support the various drawbacks of reciprocal peer reviews (e.g., variation in motivation or ability of reviewers). Finally, this paper describes an empirical evaluation showing that the SWoRD approach is effective in improving writing quality in content classes.     

Identification and analysis of genes from Streptomyces pristinaespiralis encoding enzymes involved in the biosynthesis of the 4-dimethylamino-L-phenylalanine precursor of pristinamycin I

Dextran has been used as a carrier molecule for the synthesis of monofunctional peptide-dextran conjugates. The immunodetection of such carrier immobilized peptides on ELISA plates was compared to that of peptides adsorbed directly to immunoplates. The main features observed with peptide-dextran conjugates were as follows: only small amounts of peptide (1-2 mg) were necessary for coupling via alpha- or epsilon-amino groups to NaIO4-activated dextran (4 mg); the coupling yield was up to 68%; an amino acid analysis of the conjugate enabled the amount of carrier immobilized peptide to be calculated; an estimated 15-17 peptides were bound per dextran molecule (MW 73,500); using a carbohydrate as carrier reduces the possibility of non-specific interactions because no hydrophobic or ionic sites and no protein-like epitopes exist on the carrier apart from the peptide ligand. It can be assumed that some peptide ligands provide the forces for an interaction with the plate surface whereas other remain free for the interaction with the antibody. Thus, the detection with monoclonal anti-peptide antibodies allowed peptide-dextran conjugates to be used at coating concentrations of 1-3 nM peptide, corresponding to 0.6-2.6 ng peptide-dextran per well. In contrast, concentrations of 150-500 nM were required for coating with peptides. The applicability of monofunctional peptide-dextran conjugates was demonstrated by investigating the titer and specificity of a polyclonal anti-peptide serum developed against human gastrointestinal glutathione peroxidase. The introduction of biotin as a second ligand of the dextran conjugate permitted its capture on streptavidin coated plates. This synthesis of bifunctional peptide-biotin-dextran conjugates opens up additional possibilities for applications.     

Sexualities, technologies, and the teaching of writing: A critical overview

In this introduction to a special issue of Computers and Composition, the authors critically review current literature on computer-assisted writing pedagogies that grapple with issues of sexuality. Although this body of work is small, it points to provocative ways to develop our students’ critical and rhetorical sensibilities about the constructions of sexuality in our culture. Further, such work innovatively addresses the place of networked communication technologies in the interrogation of such constructions. The authors conclude with both an introduction of the work in this special issue that addresses the intersection of sexuality studies and computer-assisted writing studies and with a call for additional work in this field.     

A parametric interpolator with confined chord errors, acceleration and deceleration for NC machining

Parametric interpolation has many advantages over linear interpolation in machining curves. Real time parametric interpolation research so far has addressed achieving a uniform feed rate, confined chord errors and jerk limited trajectory planning. However, simultaneous consideration of confined chord errors that respect the acceleration and deceleration capabilities of the machine has not been attempted. In this paper, the offline detection of feed rate sensitive corners is proposed. The velocity profile in these zones is planned so that chord errors are satisfied while simultaneously accommodating the machine's acceleration and deceleration limits. Outside the zone of the feed rate sensitive corners, the feed rate is planned using the Taylor approximation. Simulation results indicate that the offline detection of feed rate sensitive corners improves parametric interpolation. For real time interpolation, the parametric curve information can be augmented with the detected feed rate sensitive corners that are stored in 2×2 matrices.