Elena Smirnova

A model for expert finding in social networks

Expert finding is a task of finding knowledgeable people on a given topic. State-of-the-art expertise retrieval algorithms identify matching experts based on analysis of textual content of documents experts are associated with. While powerful, these models ignore social structure that might be available. In this paper, we develop a Bayesian hierarchical model for expert finding that accounts for both social relationships and content. The model assumes that social links are determined by expertise similarity between candidates. We demonstrate the improved retrieval performance of our model over the baseline on a realistic data set.

Communicating Mathematics via Pen-Based Interfaces

We address the question of how to organize pen-based interfaces for mathematical software systems, both for computational mathematics packages and document processing software. Our architecture includes components for ink collection, mathematically-oriented recognizers, portability support and interfaces to applications. We summarize aspects of mathematical handwriting recognition and discuss the methods we have used for individual character recognition and overall expression analysis. We present our pen-based computing environment, Mathink, and give an overview of facilities for training, ink annotation, and testing.

Aspects of Mathematical Expression Analysis in Arabic Handwriting

We address the question of recognizing handwritten mathematics in Arabic and related languages. After presenting an overview of the major styles used to express mathematics in these settings we outline potential problems specific to the representations. Finally, we discuss how some existing strategies for on-line analysis of handwritten mathematics can be adapted for this context.

An Architecture for Distributed Mathematical Web Services

This paper describes technologies to create and maintain a problem solving environment based on a framework for distributed mathematical web services. Our approach allows clients to access mathematical computational facilities through a uniform set of network protocols, independent of the software packages that provide the end functionality. The author of a mathematical web service need know only the specifics of the system in which the mathematical computations are performed, e.g. Maple, Mathematica or Fortran with NAG library. Whatever additional network service code that is necessary (e.g. Java, wsdl, etc), is generated and configured automatically. This paper presents a brief architectural overview of the entire framework, and then gives a detailed description of the design and implementation of the tools for mathematical servers for this environment. A set of mathematical web services currently deployed are described as examples.

Using Symbolic Computation in an Automated Sequent Derivation System for Multi-valued Logic

This paper presents a way in which symbolic computation can be used in automated theorem provers and specially in a system for automated sequent derivation in multi-valued logic. As an example of multi-valued logic, an extension of Posts Logic with linear order is considered. The basic ideas and main algorithms used in this system are presented. One of the important parts of the derivation algorithm is a method designed to recognize axioms of a given logic. This algorithm uses a symbolic computation method for establishing the solvability of systems of linear inequalities of special type. It will be shown that the algorithm has polynomial cost.