922 research outputs found

    Effectiveness of oral health prevention programs in school age children

    Full text link
    (Thesis: M.A.)In 2000, US Surgeon General David Satcher released a report on the severity of oral health disease in the high risk demographic. His grave report ushered in an era of oral health prevention programs utilizing a combination of education, mouth rinses, fluoride varnishes, dental sealants, and more invasive procedures. Given this wide range of acceptable treatment interventions available, the aim of this paper is to evaluate the effectiveness of certain treatments both by themselves and in tandem with one another on target high risk school age children. The first program we analyzed was a fluoride mouth rinse program based in North Carolina. While we found that although this program may have positive impacts on school age children in the future, it did not currently provide statistically significant benefits to these children. Access to Baby and Child Dentistry, a program in Washington State that used a multi-pronged prevention program involving education, fluoride varnishes, and glass ionomer sealants provided a much clearer benefit to reducing the overall dental caries experience in target school age children. Lastly, the ForsythKids Program, based in Massachusetts which utilized a comprehensive care model of caries prevention was shown to be effective in reducing the number of new caries in school age children. Their comprehensive care model consisted of providing the children with fluoride toothpaste, applying fluoride varnish, fitting glass ionomer sealants and temporary restorations. Armed with this information and based on a model involving four steps and two factors crucial in the successful implementation of an oral health prevention program, we hope to offer a foundation for future forays into both installing and maintaining an oral health prevention program

    GPSP: Graph Partition and Space Projection based Approach for Heterogeneous Network Embedding

    Full text link
    In this paper, we propose GPSP, a novel Graph Partition and Space Projection based approach, to learn the representation of a heterogeneous network that consists of multiple types of nodes and links. Concretely, we first partition the heterogeneous network into homogeneous and bipartite subnetworks. Then, the projective relations hidden in bipartite subnetworks are extracted by learning the projective embedding vectors. Finally, we concatenate the projective vectors from bipartite subnetworks with the ones learned from homogeneous subnetworks to form the final representation of the heterogeneous network. Extensive experiments are conducted on a real-life dataset. The results demonstrate that GPSP outperforms the state-of-the-art baselines in two key network mining tasks: node classification and clustering.Comment: WWW 2018 Poste

    An parallel information retrieval method for e-commerce

    Full text link
    An online transaction always retrieves a large amount of information before making decisions. Currently, the parallel methods for retrieving such information can only provide a similar performance to serial methods. In this paper we first perform an analysis to determine the factors that affect the performance of exiting methods, i.e., HQR and EHQR, and show that the several of these factors are not considered by these methods. Motivated by this, we propose a new dispatch scheme called AEHQR, which takes into account the features of parallel dispatching. In addition, we provide cost models that determine the optimal performance achievable by any parallel dispatching method. Using experimental comparison, we illustrate that the AEHQR is significantly outperforms the HQR and EHQR under all conditions.<br /

    An update on practice management instruction in U.S. Dental Schools

    Get PDF
    Over the last twenty-seven years, the evaluation of practice man- agement in dental schools has been documented by three studies. In twenty-seven years the teaching of practice management has been influenced by changes in the definition of practice manage- ment, resources available to dental schools, technology, changes in accreditation standards and, more recently, the influence of corpora- tions marketing to dental students. In an effort to determine what resources dental schools are utilizing to teach practice management, fifty-seven schools were contacted, and fifty faculty members with teaching responsibilities were identi- fied. An on-line email survey was administered and results reported at the 2011 meeting of the American Dental Education Association Section on Practice Management. At the section meeting breakout groups discussed two questions. First, identify innovative tools, methods and ideas in the area of practice management. Second, what changes may be necessary to meet recently updated accredi- tation standards 2-17 through 2-19. The recommendations of the breakout groups are presented in detail

    Efficient subspace skyline query based on user preference using MapReduce

    Get PDF
    Subspace skyline, as an important variant of skyline, has been widely applied for multiple-criteria decisions, business planning. With the development of mobile internet, subspace skyline query in mobile distributed environments has recently attracted considerable attention. However, efficiently obtaining the meaningful subset of skyline points in any subspace remains a challenging task in the current mobile internet. For more and more mobile applications, subspace skyline query on mobile units is usually limited by big data and wireless bandwidth. To address this issue, in this paper, we propose a system model that can support subspace skyline query in mobile distributed environment. An efficient algorithm for processing the Subspace Skyline Query using MapReduce (SSQ) is also presented which can obtain the meaningful subset of points from the full set of skyline points in any subspace. The SSQ algorithm divides a subspace skyline query into two processing phases: the preprocess phase and the query phase. The preprocess phase includes the pruning process and constructing index process which is designed to reduce network delay and response time. Additionally, the query phase provides two filtering methods, SQM-filtering and ε-filtering, to filter the skyline points according to user preference and reduce network cost. Extensive experiments on real and synthetic data are conducted and the experimental results indicate that our algorithm is much efficient, meanwhile, the pruning strategy can further improve the efficiency of the algorithm

    Efficient k-means++ approximation with MapReduce

    Get PDF
    PublishedJournal Articlek-means is undoubtedly one of the most popular clustering algorithms owing to its simplicity and efficiency. However, this algorithm is highly sensitive to the chosen initial centers and thus a proper initialization is crucial for obtaining an ideal solution. To address this problem, k-means++ is proposed to sequentially choose the centers so as to achieve a solution that is provably close to the optimal one. However, due to its weak scalability, k-means++ becomes inefficient as the size of data increases. To improve its scalability and efficiency, this paper presents MapReduce k-means++ method which can drastically reduce the number of MapReduce jobs by using only one MapReduce job to obtain k centers. The k-means++ initialization algorithm is executed in the Mapper phase and the weighted k-means++ initialization algorithm is run in the Reducer phase. As this new MapReduce k-means++ method replaces the iterations among multiple machines with a single machine, it can reduce the communication and I/O costs significantly. We also prove that the proposed MapReduce k-means++ method obtains O(α2) approximation to the optimal solution of k-means. To reduce the expensive distance computation of the proposed method, we further propose a pruning strategy that can greatly avoid a large number of redundant distance computations. Extensive experiments on real and synthetic data are conducted and the performance results indicate that the proposed MapReduce k-means++ method is much more efficient and can achieve a good approximation.This work was supported by the National Science Foundation for Distinguished Young Scholars of China under Grant No. of 61225010, National Nature Science Foundation of China (Nos. 61173162, 61173165, 61370199, 61300187, 61300189, and 61370198), New Century Excellent Talents (No. NCET-10-0095), the Fundamental Research Funds for the Central Universities (Nos. 2013QN044 and 2012TD008)

    Dynamically Selecting Distribution Strategies for Web Documents According to Access Pattern

    Get PDF
    Abstract. Web caching and replication are efficient techniques for reducing web traffic, user access latency, and server load. In this paper we present a group-based method for dynamically selecting distribution strategies for web documents according to access patterns. The documents are divided into groups according to access patterns and the documents in each group are assigned to the same distribution strategy. Our group-based model combines performance metrics with the different weights assigned to each of them. We use both trace data and statistical data to simulate our methods. The experimental results show that our group-based method for document distribution strategy selection can improve several performance metrics, while keeping others almost the same

    Fault slip of the 2022 Mw6.7 Menyuan, China earthquake observed by InSAR, and its tectonic implications

    Get PDF
    In this article the ascending and descending Sentinel-1A satellite data are used to investigate the coseismic slip model of the 2022 Mw6.7 Menyuan earthquake in Qinghai, China. The optimal slip model indicates that this event ruptured two fault segments. The main rupture concentrated on the western Lenglongling fault (LLLF) with a purely left-lateral striking-slip motion. A small part of the eastern Tuolaishan fault (TLSF) section was also ruptured, and the motion on it is mainly oblique slip at depth, with an obvious thrust component. Combined with the rupture characteristics of historical events, GPS velocity map, and slip rate studies, we suggest that the TLSF–LLLF junction is a demarcation point where the deformation partitioning pattern has changed. Along the whole LLLF segment, the oblique convergence has completely partitioned into slip on the purely strike-slipping LLLF and thrusting faults in the north. The TLSF segment accommodates a fraction of compressional shortening, which compensates for the discrepancy in the left-lateral slip rate between the LLLF and TLSF. Such transformation in the strain partitioning pattern is likely to be determined by the geometric relationship between the fault strike and the direction of regional block movement

    A Fine Velocity and Strain Rate Field of Present-Day Crustal Motion of the Northeastern Tibetan Plateau Inverted Jointly by InSAR and GPS

    Get PDF
    Interferometric synthetic aperture radar (InSAR) data from 6 Envisat ASAR descending tracks; spanning the 2003&#8315;2010 period; was used to measure interseismic strain accumulation across the Northeastern Tibetan Plateau. Mean line-of-sight (LOS) ratemaps are computed by stacking atmospheric-corrected and orbital-corrected interferograms. The ratemaps from one track with different atmospheric-corrected results or two parallel; partially overlapping tracks; show a consistent pattern of left-lateral motion across the fault; which demonstrates the MERIS and ECMWF atmospheric correction works satisfactorily for small stain measurement of this region; even with a limited number of interferograms. By combining the measurements of InSAR and GPS; a fine crustal deformation velocity and strain rate field was estimated on discrete points with irregular density depending on the fault location; which revealed that the present-day slip rate on the Haiyuan fault system varies little from west to east. A change (2&#8315;3 mm/year) in line-of-sight (LOS) deformation rate across the fault is observed from the Jinqianghe segment to its eastern end. Inversion from the cross-fault InSAR profiles gave a shallow locking depth of 3&#8315;6 km on the main rupture of the 1920 earthquake. We therefore infer that the middle-lower part of the seismogenic layer on the 1920 rupture is not yet fully locked since the 1920 large earthquake. Benefit from high spatial resolution InSAR data; a low strain accumulation zone with high strain rates on its two ends was detected; which corresponds to the creeping segment; i.e., the Laohushan fault segment. Contrary to the previous knowledge of squeezing structure; an abnormal tension zone is disclosed from the direction map of principal stress; which is consistent with the recent geological study. The distribution of principal stress also showed that the expanding frontier of the northeastern plateau has crossed the Liupan Shan fault zone; even arrived at the northeast area of the Xiaoguan Shan. This result agrees with the deep seismic reflection profile

    Ostertagia ostertagi macrophage migration inhibitory factor is present in all developmental stages and may cross-regulate host functions through interaction with the host receptor

    Get PDF
    Macrophage migration inhibitory factor (MIF) of Ostertagia ostertagi, an abomasal parasite of cattle, was characterised in the present study. Phylogenetic analysis identified at least three O. ostertagi MIFs (Oos- MIFs), each encoded by a distinct transcript: Oos-MIF-1.1, Oos-MIF-1.2 and Oos-MIF-2. Oos-MIF-2 is only distantly related to Oos-MIF-1s, but has higher sequence similarity with the Caenorhabditis elegans MIF2. Oos-MIF-1.1 and Oos-MIF-1.2 are similar (93%) and thus collectively referred to as Oos-MIF-1 when characterised with immunoassays. Recombinant Oos-MIF-1.1 (rOos-MIF-1.1) is catalytically active as a tautomerase. A mutation (rOos-MIF-1.1P1G) or duplication of Pro1 residue (rOos-MIF-1.1P1+P) resulted in reduced oligomerisation and loss of tautomerase activity. The tautomerase activity of rOos-MIF-1.1 was only partially inhibited by ISO-1 but was abrogated by a rOos-MIF-1.1-specific antibody. Oos-MIF- 1 was detected in all developmental stages of O. ostertagi, with higher levels in the adult stage; it was also detected in adult worm excretory/secretory product. Oos-MIF-1 was localised to the hypodermis/muscle, reproductive tract and intestine, but not to the cuticle. rOos-MIF-1.1, but not rOos-MIF-1.1P1G, was able to specifically bind to human CD74, a MIF cell surface receptor, with an affinity comparable with human MIF. Immunostaining indicated that macrophages were able to internalise rOos-MIF-1.1, further supporting receptor-mediated transportation. Herein we also show that rOos-MIF-1.1 inhibited migration of bovine macrophages and restored glucocorticoid-suppressed, lipopolysaccharide-induced TNF-a and IL-8 in human and/or bovine macrophages. Given its dual role in self-regulation and molecular mimicry, this secreted parasite protein warrants investigation as a vaccine candidate against O. ostertagi infections in cattle
    • …
    corecore