I can still remember that early morning in May. I had picked up Susan Bonner-Weir, who had come to Uppsala to give the Kroc lecture of the year. We went to the neuropsychiatric ward at Ulleråker Hospital, where Claes Hellerstr€ om had spent the last couple of weeks after his devastating stroke four months earlier. I had learnt to interpret his body language in the sense that it was easy to unde...

BACKGROUND Herbal medicine has long been viewed as a valuable asset for potential new drug discovery and herbal ingredients' metabolites, especially the in vivo metabolites were often found to gain better pharmacological, pharmacokinetic and even better safety profiles compared to their parent compounds. However, these herbal metabolite information is still scattered and waiting to be collected...

‎In this paper‎, ‎first we introduce the notion of $frac{1}{2}$-modular metric spaces and weak $(alpha,Theta)$-$omega$-contractions in this spaces and we establish some results of best proximity points‎. ‎Finally‎, ‎as consequences of these theorems‎, ‎we derive best proximity point theorems in modular metric spaces endowed with a graph and in partially ordered metric spaces‎. ‎We present an ex...

This article examines the meanings of past which Aalto wanted to transpose into his architecture – what I term cultural memory. search for their points origin in Aalto’s education and travels, particular impressions Acropolis Athens. For Aalto, a civic centre was “the face city”, should be citizens’ meeting place. Of importance him ritual entry theatre. many centres that designed, few were real...

Hundreds of experiments over the last decade on the retrieval of OCR documents performed by the Information Science Research Institute have shown that OCR errors do not significantly affect retrievability. We extend those results to show that in the case of proximity searching, the removal of running headers and footers from OCR text will not improve retrievability for such searches.

Let X be an arrangement of n algebraic sets Xi in d-space, where the Xi are either parametrized or zero-sets of dimension 0 ≤ mi ≤ d − 1. We study a number of decompositions of d-space into connected regions in which the distance-squared function to X has certain invariances. Each region is contained in a single connected component of the complement of the bifurcation set B of the family of dis...

In order to retrieve best documents for finding answers, we developed a robust proximity search engine. It efficiently finds relevant passages. In addition, our search engine has two disjunction operators: or and or2. The former works just like addition, whereas the latter works just like logical disjunction. The operator or2 is used to introduce synonyms and antonyms of a query term. The searc...

In this paper, we propose a novel ICP variant that uses a histogram in conjunction with multiple closest points to detect the overlap area between range images geing registered. Tentative correspondences sharing similar distances are normally all within, or all outside, the overlap area. Thus, the overlap area can be detected in a bin by bin batch manner using a histogram. Using multiple closes...