UNSUPERVISED INDEXING OF MEDLINE ARTICLES THROUGH GRAPH-BASED RANKING

The biomedical literature is extensively catalogued and indexed in MEDLINE. MEDLINE indexing is done by trained human indexers, who identify the most important concepts in each article, and is expensive and inconsistent. Automating the indexing task is difficult: the National Library of Medicine produces the Medical Text Indexer (MTI), which suggests potential indexing terms to the indexers. MTI’s output is not good enough to work unattended. In my thesis, I propose a different way to approach the indexing task called MEDRank. MEDRank creates graphs representing the concepts in biomedical articles and their relationships within the text, and applies graph-based ranking algorithms to identify the most important concepts in each article. I evaluate the performance of several automated indexing solutions, including my own, by comparing their output to the indexing terms selected by the human indexers. MEDRank outperformed all other evaluated indexing solutions, including MTI, in general indexing performance and precision. MEDRank can be used to cluster documents, index any kind of biomedical text with standard vocabularies, or could become part of MTI itself.

Dirichlet-Neumann inverse spectral problem for a star graph of Stieltjes strings

We solve two inverse spectral problems for star graphs of Stieltjes strings with Dirichlet and Neumann boundary conditions, respectively, at a selected vertex called root. The root is either the central vertex or, in the more challenging problem, a pendant vertex of the star graph. At all other pendant vertices Dirichlet conditions are imposed; at the central vertex, at which a mass may be placed, continuity and Kirchhoff conditions are assumed. We derive conditions on two sets of real numbers to be the spectra of the above Dirichlet and Neumann problems. Our solution for the inverse problems is constructive: we establish algorithms to recover the mass distribution on the star graph (i.e. the point masses and lengths of subintervals between them) from these two spectra and from the lengths of the separate strings. If the root is a pendant vertex, the two spectra uniquely determine the parameters on the main string (i.e. the string incident to the root) if the length of the main string is known. The mass distribution on the other edges need not be unique; the reason for this is the non-uniqueness caused by the non-strict interlacing of the given data in the case when the root is the central vertex. Finally, we relate of our results to tree-patterned matrix inverse problems.

Long-term synaptic facilitation of tail sensorimotor connections in {\it Aplysia\/}

Long-term sensitization in Aplysia is a well studied model for the examination of the cellular and molecules mechanisms of long-term memory. Several lines of evidence suggest long-term sensitization is mediated at least partially by long-term synaptic facilitation between the sensory and motor neurons. The sensitization training and one of its analogues, serotonin (5-HT), can induce long-term facilitation. In this study, another analogue to long-term sensitization training has been developed. Stimulation of peripheral nerves of pleural-pedal ganglia preparation induced long-term facilitation at both 24 hr and 48 hr. This is the first report that long-term facilitation in Aplysia persists for more than 24 hr, which is consistent with the observation that long-term sensitization lasts for more than one day. Thus, the data support the hypothesis that long-term facilitation is an important mechanism for long-term sensitization.^ One of the major differences between short-term and long-term facilitation is that long-term facilitation requires protein synthesis. Therefore, the effects of anisomycin, a protein synthesis inhibitor, on long-term facilitation was examined. Long-term facilitation induced by nerve stimulation was inhibited by 2 $\mu$M anisomycin, which inhibits $\sim$90% of protein synthesis. Nevertheless, at higher concentration (20 $\mu$M), anisomycin induced long-term facilitation by itself, which raises an interesting question about the function of anisomycin other than protein synthesis inhibition.^ Since protein synthesis is critical for long-term facilitation, a major goal is to identify and functionally characterize the molecules whose mRNA levels are altered during the formation of long-term facilitation. Behavioral training or its analogues (nerve stimulation and 5-HT) increases the level of mRNA of calmodulin (CaM). Thus, the role of Ca$\sp{2+}$-CaM-dependent protein kinase II (CaMKII), a major substrate of CaM, in long-term facilitation induced by nerve stimulation was examined. KN-62, a specific CaMKII inhibitor, did not block either the induction or the maintenance of long-term facilitation induced by nerve stimulation. These data indicate that CaMKII may not be involved in long-term facilitation. Another protein whose mRNA level of a molecule was increased by the behavioral training and the treatment of 5-HT is Aplysia tolloid/BMP-1-like protein 1 (apTBL-1). Tolloid in Drosophila and BMP-1 in human tissues are believed to be secreted as a metalloprotease to activate TGF-$\beta.$ Thus, the long-term effects of recombinant human TGF-$\beta1$ on synaptic strength were examined. Treatment of ganglia with TGF-$\beta1$ produced long-term facilitation, but not short-term or intermediate-term facilitation ($\le$4 hr). In addition, TGF-$\beta1$ and 5-HT were not additive in producing long-term facilitation, which indicates an interaction between two cascades. Moreover, 5-HT-induced facilitation (at both 24 hr and 48 hr) and nerve stimulation-induced facilitation (at 24 hr) were inhibited by TGF-$\beta$ sRII, a TGF-$\beta$ inhibitor. These results suggest that TGF-$\beta$ is part of the cascade of events underlying long-term sensitization, and also indicate that a signaling molecule used in development may also have functions in adult neuronal plasticity. ^

Grey matter volumetric changes related to recovery from hand paresis after cortical sensorimotor stroke

Preclinical studies using animal models have shown that grey matter plasticity in both perilesional and distant neural networks contributes to behavioural recovery of sensorimotor functions after ischaemic cortical stroke. Whether such morphological changes can be detected after human cortical stroke is not yet known, but this would be essential to better understand post-stroke brain architecture and its impact on recovery. Using serial behavioural and high-resolution magnetic resonance imaging (MRI) measurements, we tracked recovery of dexterous hand function in 28 patients with ischaemic stroke involving the primary sensorimotor cortices. We were able to classify three recovery subgroups (fast, slow, and poor) using response feature analysis of individual recovery curves. To detect areas with significant longitudinal grey matter volume (GMV) change, we performed tensor-based morphometry of MRI data acquired in the subacute phase, i.e. after the stage compromised by acute oedema and inflammation. We found significant GMV expansion in the perilesional premotor cortex, ipsilesional mediodorsal thalamus, and caudate nucleus, and GMV contraction in the contralesional cerebellum. According to an interaction model, patients with fast recovery had more perilesional than subcortical expansion, whereas the contrary was true for patients with impaired recovery. Also, there were significant voxel-wise correlations between motor performance and ipsilesional GMV contraction in the posterior parietal lobes and expansion in dorsolateral prefrontal cortex. In sum, perilesional GMV expansion is associated with successful recovery after cortical stroke, possibly reflecting the restructuring of local cortical networks. Distant changes within the prefrontal-striato-thalamic network are related to impaired recovery, probably indicating higher demands on cognitive control of motor behaviour.

The Web KnowARR Framework: Orchestrating Computational Intelligence with Graph Databases

This chapter presents fuzzy cognitive maps (FCM) as a vehicle for Web knowledge aggregation, representation, and reasoning. The corresponding Web KnowARR framework incorporates findings from fuzzy logic. To this end, a first emphasis is particularly on the Web KnowARR framework along with a stakeholder management use case to illustrate the framework’s usefulness as a second focal point. This management form is to help projects to acceptance and assertiveness where claims for company decisions are actively involved in the management process. Stakeholder maps visually (re-) present these claims. On one hand, they resort to non-public content and on the other they resort to content that is available to the public (mostly on the Web). The Semantic Web offers opportunities not only to present public content descriptively but also to show relationships. The proposed framework can serve as the basis for the public content of stakeholder maps.

ADDPLOT: Stata module to add twoway plot objects to an existing twoway graph

addplot adds twoway plot objects to an existing twoway graph. This is useful if you want to add additional objects such as titles or extra data points to a twoway graph after it has been created. Most of what addplot can do, can also be done by rerunning the original graph command including additional options or plot statements. addplot, however, might be useful if you have to modify a graph for which you cannot rerun the original command, for example, because you only have the graph file but not the data that were used to create the graph. Furthermore, addplot can do certain things that would be difficult to achieve in a single graph command (e.g. customizing individual subgraphs within a by-graph). addplot also provides a substitute for some of the functionality of the graph editor.

A note on adding objects to an existing twoway graph

In Stata, graphs are usually generated by one call to the graph command. Sometimes, however, it would be convenient to be able to add objects to a graph after the graph has been created. In this article, I provide a command called addplot that offers such functionality for twoway graphs, capitalizing on an undocumented feature of Stata's graphics system.

MASCG: Multi-Atlas Segmentation Constrained Graph method for accurate segmentation of hip CT images

This paper addresses the issue of fully automatic segmentation of a hip CT image with the goal to preserve the joint structure for clinical applications in hip disease diagnosis and treatment. For this purpose, we propose a Multi-Atlas Segmentation Constrained Graph (MASCG) method. The MASCG method uses multi-atlas based mesh fusion results to initialize a bone sheetness based multi-label graph cut for an accurate hip CT segmentation which has the inherent advantage of automatic separation of the pelvic region from the bilateral proximal femoral regions. We then introduce a graph cut constrained graph search algorithm to further improve the segmentation accuracy around the bilateral hip joint regions. Taking manual segmentation as the ground truth, we evaluated the present approach on 30 hip CT images (60 hips) with a 15-fold cross validation. When the present approach was compared to manual segmentation, an average surface distance error of 0.30 mm, 0.29 mm, and 0.30 mm was found for the pelvis, the left proximal femur, and the right proximal femur, respectively. A further look at the bilateral hip joint regions demonstrated an average surface distance error of 0.16 mm, 0.21 mm and 0.20 mm for the acetabulum, the left femoral head, and the right femoral head, respectively.

PSHARE: Stata module to compute and graph percentile shares

-pshare- computes and graphs percentile shares from individual level data. Percentile shares are often used in inequality research to study the distribution of income or wealth. They are defined as differences between Lorenz ordinates of the outcome variable. Technically, the observations are sorted in increasing order of the outcome variable and the specified percentiles are computed from the running sum of the outcomes. Percentile shares are then computed as differences between percentiles, divided by total outcome. pshare requires moremata to be installed on the system; see ssc describe moremata.

Building the View Graph of a Category by Exploiting Image Realism

We propose a weakly supervised method to arrange images of a given category based on the relative pose between the camera and the object in the scene. Relative poses are points on a sphere centered at the object in a given canonical pose, which we call object viewpoints. Our method builds a graph on this sphere by assigning images with similar viewpoint to the same node and by connecting nodes if they are related by a small rotation. The key idea is to exploit a large unlabeled dataset to validate the likelihood of dominant 3D planes of the object geometry. A number of 3D plane hypotheses are evaluated by applying small 3D rotations to each hypothesis and by measuring how well the deformed images match other images in the dataset. Correct hypotheses will result in deformed images that correspond to plausible views of the object, and thus will likely match well other images in the same category. The identified 3D planes are then used to compute affinities between images related by a change of viewpoint. We then use the affinities to build a view graph via a greedy method and the maximum spanning tree.

An investigation of the performance of a new Mechanical thrombectomy device using Bond Graph modelling: application to the extraction of blood clots in the middle cerebral artery

A number of thrombectomy devices using a variety of methods have now been developed to facilitate clot removal. We present research involving one such experimental device recently developed in the UK, called a ‘GP’ Thrombus Aspiration Device (GPTAD). This device has the potential to bring about the extraction of a thrombus. Although the device is at a relatively early stage of development, the results look encouraging. In this work, we present an analysis and modeling of the GPTAD by means of the bond graph technique; it seems to be a highly effective method of simulating the device under a variety of conditions. Such modeling is useful in optimizing the GPTAD and predicting the result of clot extraction. The aim of this simulation model is to obtain the minimum pressure necessary to extract the clot and to verify that both the pressure and the time required to complete the clot extraction are realistic for use in clinical situations, and are consistent with any experimentally obtained data. We therefore consider aspects of rheology and mechanics in our modeling.