The importance of glossaries

Standards cannot be set, specifications cannot be written uniformly and unambiguously, and methods cannot be described succinctly, without an agreed terminology. Producing a glossary is a painstaking process and the fundamental principles involved are described. Some difficulties and misunderstandings are identified.     

Best analytic approximation of rational functions of degree 2: Symmetrization of formulae of N. J. Young

Formulae, explicitly symmetric in the roots of the denominator, are derived for the best approximation to a rational function of degree 2 by an analytic function and by a function with at most one pole.     

Predicting postdischarge opiate abstinence from admission measures of motivation and confidence.

Admission scores from a model comprising 3 motivation factors concerning the cessation of heroin use and a confidence scale concerning postdischarge abstinence were tested for their ability to predict postdischarge outcomes in patients beginning inpatient opiate detoxification. Statistically significant prediction of abstinence from heroin 30 days after discharge and the number of heroin-free days in the 3 months following admission was based on the confidence scale and a factor concerned with externally imposed constraints on continued heroin use. The single-scale confidence measure made the largest contribution to each prediction, indicating that such scales may be potentially useful outcome predictors for postdischarge abstinence. External constraints on heroin use may not provide a basis for success in this treatment modality. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Matching treatment focus to patient social investment and support: 18-month follow-up results.

Patients were randomly assigned to 1 of 3 treatments: brief broad-spectrum (BBS), extended relationship enhancement (ERE), or extended cognitive–behavioral (ECB). A hierarchical latent growth model was used to analyze the data of 188 patients (82%) followed for 18 months. ERE treatment was significantly more effective in increasing abstinence of patients entering treatment with a network unsupportive of abstinence or with a low level of investment in their network, whereas BBS treatment was more effective for patients with either (a) both a social network unsupportive of abstinence and a low level of network investment or (b) high investment in a network supportive of abstinence. ECB outcomes were neither as good as those matched nor as bad as those mismatched to the different exposures of relationship enhancement. This suggests that dose of relationship enhancement should be determined after assessing patient relationships. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Finding approximate matches in large lexicons

Approximate string matching is used for spelling correction and personal name matching. In this paper we show how to use string matching techniques in conjunction with lexicon indexes to find approximate matches in a large lexicon. We test several lexicon indexing techniques, including n-grams and permuted lexicons, and several string matching techniques, including string similarity measures and phonetic coding. We propose methods for combining these techniques, and show experimentally that these combinations yield good retrieval effectiveness while keeping index size and retrieval time low. Our experiments also suggest that, in contrast to previous claims, phonetic codings are markedly inferior to string distance measures, which are demonstrated to be suitable for both spelling correction and personal name matching.     

Empirically supported psychological therapies.

This article introduces the special section of the Journal of Consulting and Clinical Psychology on empirically supported psychological therapies. After a discussion of the rationale for the selection of the specific terms in the label, several justifications are considered for conducting and learning from empirical evaluations of psychological therapies. Finally, the process that guided the special section is described. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Microstructural characterization of rapidly solidified nickel-base superalloys

Several Ni-Al-Mo-based eutectic superalloys were rapidly solidified using a chilled block melt spinning process. The effects of rapid solidification on the microstructure were studied using optical microscopy, transmission electron microscopy (TEM), and scanning transmission electron microscopy (STEM). Results showed, except for the alloy containing chromium, that the microstructure varied as a function of ribbon thickness from segregationless solidification at the wheel side of the ribbon to dendritic solidification at the free side. In addition, alloys with the same solidification rate showed a large variation in microstructure depending upon the solid state cooling rate. The rapidly solidified eutectic Ni-Al-Mo alloy with a small amount of rhenium and vanadium did not show any improvement on delaying or prohibiting the formation of the embrittling-NiMo phase on ageing at 1000 C. This was determined from microstructural as well as chemical analysis using STEM. Differential thermal analysis was used to obtain melting temperature,-Ni₃Al solvus, and heat of formation for the alloys.     

Exploring latent browsing graph for question answering recommendation

In this paper, we develop a framework of Question Answering Pages (referred to as QA pages) recommendation. Our proposed framework consists of the two modules: the off-line module to determine the importance of QA pages and the on-line module for on-line QA page recommendation. In the off-line module, we claim that the importance of QA pages could be discovered from user click streams. If the QA pages are of higher importance, many users will click and spend their time on these QA pages. Moreover, the relevant relationships among QA pages are captured by the browsing behavior on these QA pages. As such, we exploit user click streams to model the browsing behavior among QA pages as QA browsing graph structures. The importance of QA pages is derived from our proposed QA browsing graph structures. However, we observe that the QA browsing graph is sparse and that most of the QA pages do not link to other QA pages. This is referred to as a sparsity problem. To overcome this problem, we utilize the latent browsing relations among QA pages to build a QA Latent Browsing Graph. In light of QA latent browsing graph, the importance score of QA pages (referred to as Latent Browsing Rank) and the relevance score of QA pages (referred to as Latent Browsing Recommendation Rank) are proposed. These scores demonstrate the use of a QA latent browsing graph not only to determine the importance of QA pages but also to recommend QA pages. We conducted extensive empirical experiments on Yahoo! Asia Knowledge Plus to evaluate our proposed framework.     

Faster Approximate String Matching for Short Patterns

We study the classical approximate string matching problem, that is, given strings P and Q and an error threshold k, find all ending positions of substrings of Q whose edit distance to P is at most k. Let P and Q have lengths m and n, respectively. On a standard unit-cost word RAM with word size w≥log n we present an algorithm using time