Dynamic programming implementation on array processor architectures

Dynamic Programming (DP) applies to many signal and image processing applications including boundary following, the Viterbi algorithm, dynamic time warping, etc. This paper presents an array processor implementation of generic dynamic programming. Our architecture is a SIMD array attached to a host computer. The processing element of the architecture is based on an ASIC design opting for maximum speed-up. By adopting a torus interconnection network, a dual buffer structure, and a multilevel pipeline, the performance of the DP chip is expected to reach the order of several GOPS. The paper discusses both the dedicated hardware design and the data flow control of the DP chip and the total array.This work was supported in part by the NATO, Scientific and Environmental Affairs Division, Collaborative Research Grant SA.5-2-05(CRG.960201)424/96/JARC-501.     

Large signal analysis of the LCC-type parallel resonant converterusing discrete time domain modeling

A discrete time domain model for the LCC-type parallel resonant power converter has been derived. This model has been used to predict the large signal behavior of the power converter. The peak component stresses and the dynamic response of the key state variables, as obtained from the large signal analysis, using PRO-MATLAB software are plotted. SPICE results are included to verify the analytical results. Experimental results are also presented to verify the theory     

Effect of repositioning of rhodium direct-charge detectors in a RBMK-1000 reactor on fuel and emitter-material burnup coefficients

Scientific-Technical Center “Atomtekhénergo.” Leningrad Nuclear Power Plant. N. V. Sultanov Institute of Nuclear Reactors, Russian Scientific Center “Kurchatovskii institut.” Translated from Atomnaya énergiya, Vol. 76, No. 6, pp. 470–473, June, 1994.     

Hereditary neuralgic amyotrophy and hereditary neuropathy with liability to pressure palsies: two distinct clinical, electrophysiologic, and genetic entities

Fistulas secondary to Crohn's disease occur in about 33% of patients. A colobronchial fistula complicating Crohn's disease is very rare, having been reported only twice previously. We present an unusual fistula secondary to Crohn's colitis that originated from the splenic flexure and crossed the diaphragm to involve the bronchial tree.     

8-OH-DPAT induces a selective increase in protein intake in ageing overweight animals

We have examined the effects of a 5-HT1A receptor agonist (8-hydroxy-2-(di-n-propylamino)tetralin, 8-OH-DPAT) on food preference in ageing rats that had been given a 'palatable' meal 15 min before administration of the drug. Ageing rats consumed a greater amount of the 'palatable' pre-meal than the young rats. In young rats lipids were the predominant source of calories, but in old animals lipid and protein consumption was similar. Administration of 8-OH-DPAT resulted in an increase in total caloric intake in both groups. Concomitant with this there was a significant increase in protein intake in both groups, which was most important in ageing rats, where proteins became the predominant source of calories.     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.