The effects of glycol methacrylate as a dehydrating agent on the dimensional changes of liver tissue

The dimensional changes of liver sections during the course of processing with glycol methacrylate (GMA) or with ethanol are described. Tissue processing with ethanol served as a control. During prolonged processing steps (24 h each), linear shrinkage of tissue specimens dehydrated with GMA at room temperature was 13.2%. Subsequent infiltration with GMA resulted in trivial swelling, and polymerization in slight shrinkage (2.3%). In comparison, processing with cold GMA resulted in shrinkage during dehydration (about 10.8%), a slight swelling in pure GMA, followed by shrinkage during polymerization (2.2%). Short routine processing schedules resulted in similar shrinkage/swelling patterns, although precise values differed slightly. In all experiments, ethanolic dehydration resulted in smaller dimensional tissue changes than did GMA dehydration. The dimensional changes of tissue sections during stretching on water, mounting and drying compensated for the major part of the shrinkage manifested during processing.     

New Tractable Classes From Old

The constraint satisfaction problem is known to be NP-hard in general, but a number of restrictions of the problem have been identified over the years which ensure tractability. This paper introduces two simple methods of combining two or more tractable classes over disjoint domains, in order to synthesise larger, more expressive tractable classes. We demonstrate that the classes so obtained are genuinely novel, and have not been previously identified. In addition, we use algebraic techniques to extend the tractable classes which we identify, and to show that the algorithms for solving these extended classes can be less than obvious.     

The warehouse scheduling problem: formulation and algorithms

The Warehouse Scheduling Problem is a deterministic multi-item inventory problem with a restriction on warehouse floor space available. We formulate a mixed integer nonlinear programming problem for the objective of minimizing long run inventory holding and order costs per unit of time. We integrate algorithms for staggering orders, described in companion papers, with a heuristic to choose the order sequences. The result is called Sequenced Staggering. We describe a new algorithm to generate order frequencies, called the powers-of-two-factor-of-three technique, as a generalization of Roundy's roundoff technique for powers-of-two policies. We report on a computational study of four hybrid algorithms for solving the warehouse scheduling problem, including the competing algorithm of Gallego, Queyranne, and Simchi-Levi. Based on these results, we recommend the combination of powers-of-two frequencies with Sequenced Staggering.     

Categorical scaling of time: Implications for clock-counter models.

Pigeons partitioned time into three intervals. Responses to one key could be reinforced after a short time, to a second key after an intermediate time, and to a third key after a long time. The values of the short, intermediate, and long times and the proportion of trials ending with reinforcement were varied. Absolute and relative response rates on each key were an orderly function of time and showed approximately proportional changes with changes in the interval values, consistent with Weber's law, Gibbon's (1977) scalar expectancy theory, and Killeen and Fetterman's (1988) behavioral theory of timing (BeT). Standard deviations of the times at which subjects switched between successive keys increased more slowly within a condition than across conditions, as predicted by BeT. Increases and decreases in reinforcement probability produced both transient and longer lasting changes in timing behavior, once again, in accord with predictions of BeT. (PsycINFO Database Record (c) 2010 APA, all rights reserved)