The research in this paper relates to the technical field of light load transportation, particular an electric upstairs car, which includes a frame, top frame is fixedly equipped with handle, bottom rotationally group wheels, side wall near carrier plate, support plate arranged between frames, and box on away from A rod rotated opposite box. length larger than diameter wheel. An arc surface set...

Concentrating Solar Power (CSP) plants utilize thermal conversion of direct solar irradiation. A trough or tower configuration focuses solar radiation and heats up oil or molten salt that subsequently in high temperature heat exchangers generate steam for power generation. High temperature molten salt can be stored and the stored heat can thus increase the load factor and the usability for a CS...

Early detection of cardiovascular diseases has been a very active research area in the medical imaging field, Assessment of the local and global mechanical functions is one of the major goals for accurate diagnosis. In this paper, we studied the use of elastography for estimation and imaging of the local cardiac muscle displacement and strain in vivo. In its noninvasive applications, elastograp...

BACKGROUND Most biomedical corpora have not been used outside of the lab that created them, despite the fact that the availability of the gold-standard evaluation data that they provide is one of the rate-limiting factors for the progress of biomedical text mining. Data suggest that one major factor affecting the use of a corpus outside of its home laboratory is the format in which it is distri...

We examine the issues involved in producing a backend for the GNU Compiler Collection (GCC) that targets the .NET Common Language Runtime. We describe a simple back-end that is written in standard GCC style, which interfaces with the register transfer language GCC intermediate representation. We demonstrate that this simple .NET back-end is able to compile an appreciable subset of the C languag...

Graphs of small treewidth resemble a tree in a certain (precise) sense. Many computationally hard graph problems can be solved efficiently on graphs of small treewidth using a “tree decomposition,” which represents the constructive aspect of treewidth. However, computing minimum-width tree decompositions is NP-hard in general, but for fixed treewidth, there exist algorithms with polynomial runn...