Burning mouth syndrome: an update on recent findings

Burning mouth syndrome (BMS) is characterized by a burning sensation of the oral mucosa in the absence of mucosal abnormality Various local, systemic and psychological factors are associated with BMS, but its aetiology is not fully understood. Recently, significant inroads have been made, producing a better understanding of this complex condition. The aim of the current paper is to explore the condition of BMS in an educational context with the specific outcome of increasing awareness of the condition.

Thorium-230 coral chronology of a late prehistoric Hawaiian chiefdom

Documenting the history of settlement in Hawaii during the last few Centuries before European contact, is crucial to charting the evolution of the most complex chiefdom in Polynesia. It is precisely this period that Hawaii. and many Polynesian Societies, Underwent their most rapid changes in political, economic and social organisation. The last similar to 500 to 300 years in the C-14 calibration curve is problematic with wide fluctuations Often rendering large age spans that do not precisely date single events, especially troubling with a culture-historical record of similar to 1000 years duration. Here we present in extremely high precision Th-230 chronology for archaeologically constrained coral samples from a range of occupancy sites. Our high precision dates allow the time of site use to be clearly demonstrated. They also provide the first dates for habitation sites in Hawaii that clearly show contemporaneous occupation-the major problem in settlement pattern archaeology. We demonstrate that two sites were occupied within the same year. Our refined chronology, provides new and exciting oppurtunities for tracking sociopolitical and economic developments during the last few centuries-the crucial period in the evolution and transformation of Polynesian societies. (c) 2005 Elsevier Ltd. All rights reserved.

Disease prevalence among dogs and cats in the United States and Australia and proportions of dogs and cats that receive therapeutic diets or dietary supplements

Objective-To estimate disease prevalence among dogs and cats in the United States and Australia and proportions of dogs and cats that receive therapeutic diets or dietary supplements. Design-Telephone survey. Sample Population-Dog and cat owners located in 5 geographic areas. Procedures-A telephone survey was administered to dog and cat owners. Results-Of 18,194 telephone calls that were made, 1,104 (6%) were to individuals who owned at least I dog or cat and agreed to participate. Information was collected for 635 dogs and 469 cats. Only 14 (1%) respondents indicated that their pet was unhealthy, but 176 (16%) indicated that their pets had 1 or more diseases. The most common diseases were musculoskeletal, dental, and gastrointestinal tract or hepatic disease. Many owners (n = 356) reported their pets were overweight or obese, but only 3 reported obesity as a health problem in their pets. Owners of 28 (2.5%) animals reported that they were feeding a therapeutic diet, with the most common being diets for animals with renal disease (n = 5), reduced-calorie diets (5), and reduced-fat diets (4). Owners of 107 of 1,076 (9.9%) animals reported administering dietary supplements to their pets. Multivitamins (n = 53 animals), chondroprotective agents (22), and fatty acids (13) were the most common dietary supplements used. Conclusions and Clinical Relevance-Results suggest that most dogs and cats reported by their owners to have a health problem were not being fed a therapeutic diet. In addition, the rate of dietary supplement use was lower than that reported for people.

Expression of human DEC-205 (CD205) multilectin receptor on leukocytes

DEC-205 (CD205) belongs to the macrophage mannose receptor family of C-type lectin endocytic receptors and behaves as an antigen uptake/processing receptor for dendritic cells (DC). To investigate DEC-205 tissue distribution in human leukocytes, we generated a series of anti-human DEC-205 monoclonal antibodies (MMRI-5, 6 and 7), which recognized epitopes within the C-type lectin-like domains 1 and 2, and the MMRI-7 immunoprecipitated a single similar to 200 kDa band, identified as DEC-205 by mass spectrometry. MMRI-7 and another DEC-205 mAb (MG38), which recognized the epitope within the DEC-205 cysteine-rich and fibronectin type II domain, were used to examine DEC-205 expression by human leukocytes. Unlike mouse DEC-205, which is reported to have predominant expression on DC, human DEC-205 was detected by flow cytometry at relatively high levels on myeloid blood DC and monocytes, at moderate levels on B lymphocytes and at low levels on NK cells, plasmacytoid blood DC and T lymphocytes. MMRI-7 F(ab')(2) also labeled monocytes, B lymphocytes and NK cells similarly excluding reactivity due to non-specific binding of the mAb to Fc gamma R. Tonsil mononuclear cells showed a similar distribution of DEC-205 staining on the leukocytes. DEC-205-specific semiquantitative immunoprecipitation/western blot and quantitative reverse transcriptase-PCR analysis established that these leukocyte populations expressed DEC-205 protein and the cognate mRNA. Thus, human DEC-205 is expressed on more leukocyte populations than that were previously assumed based on mouse DEC-205 tissue localization studies. The broader DEC-205 tissue expression in man is relevant to clinical DC targeting strategies and DEC-205 functional studies.

Expansion-based algorithms for finding single pair shortest path on surface

Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path planning system, and surface nearest neighbor query in spatial database, etc. Currently, to solve the problem, existing algorithms must traverse the entire polyhedral surface. With the rapid advance in areas like Global Positioning System (CPS), Computer Aided Design (CAD) systems and laser range scanner, surface models axe becoming more and more complex. It is not uncommon that a surface model contains millions of polygons. The single pair shortest path problem is getting harder and harder to solve. Based on the observation that the single pair shortest path is in the locality, we propose in this paper efficient methods by excluding part of the surface model without considering them in the search process. Three novel expansion-based algorithms are proposed, namely, Naive algorithm, Rectangle-based Algorithm and Ellipse-based Algorithm. Each algorithm uses a two-step approach to find the shortest path. (1) compute an initial local path. (2) use the value of this initial path to select a search region, in which the global shortest path exists. The search process terminates once the global optimum criteria are satisfied. By reducing the searching region, the performance is improved dramatically in most cases.

Surface k-NN query processing

A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to efficient k-NN query processing is to fetch and check the distances of a minimum number of points from the database. For many applications, such as vehicle movement along road networks or rover and animal movement along terrain surfaces, the distance is only meaningful when it is along a valid movement path. For this type of k-NN queries, the focus of efficient query processing is to minimize the cost of computing distances using the environment data (such as the road network data and the terrain data), which can be several orders of magnitude larger than that of the point data. Efficient processing of k-NN queries based on the Euclidian distance or the road network distance has been investigated extensively in the past. In this paper, we investigate the problem of surface k-NN query processing, where the distance is calculated from the shortest path along a terrain surface. This problem is very challenging, as the terrain data can be very large and the computational cost of finding shortest paths is very high. We propose an efficient solution based on multiresolution terrain models. Our approach eliminates the need of costly process of finding shortest paths by ranking objects using estimated lower and upper bounds of distance on multiresolution terrain models.