We present Linkage Query Writer (LinQuer), a system for generating SQL queries for semantic link discovery over relational data. The LinQuer framework consists of (a) LinQL, a language for specification of linkage requirements; (b) a web interface and an API for translating LinQL queries to standard SQL queries; (c) an interface that assists users in writing LinQL queries. We discuss the challe...

In this paper we consider single writer multiple reader concurrency—any number of transactions can atomically access shared data structures, but only one thread can atomically update the data. Limiting ourselves to a single writer allows us to achieve strong properties, some of which are not achievable with multiple writers. In particular, we guarantee strict serializability, no aborts, wait-fr...

Given the interdisciplinary nature of complex network studies, there is a practical need for dialogue between theorists proposing graph measurements and those seeking to apply them into a domain. We consider this in the domain of software complexity by highlighting the distinctive nature of networks representing software's internal structure and also by describing the application of one such pr...

Social network users may wish to preserve their anonymity online by masking their identity and not using language associated with any particular demographics or personality. However, they have no control over the language in incoming communications. We show that linguistic cues in public comments directed at a user are sufficient for an accurate inference of that user’s gender, age, religion, d...

In the last several years, we developed new and very effective techniques for automatic writer identification that use probability distribution functions extracted the handwriting images to characterize writer individuality. The demonstration will present a html-based visualization tool that we recently built in order to be able to directly see and assess the results generated by our writer ide...

Although the performance of current automatic recognition algorithms of on-line handwriting has much improved in recent years, there are still many problems with the actual application of these systems. It appears that the step from academical experiments to real-life use of such algorithms, in, e.g., portable pen computers, is still difficult. What is particularly intriguing is the fact that r...

Using handwritten characters we address two questions (i) what is the group identification performance of different alphabets (upper and lower case) and (ii) what are the best characters for the verification task (same writer/different writer discrimination) knowing demographic information about the writer such as age,sex or country of birth. The Bhattacharya distance is used to rank different ...

Writer identification and verification has been studied over the past decade due to the high demand of such implementations in a wide variety of offline handwritten data applications. Among the applications are verification of the identity of a person whom he or she claimed to be and forensic and historic document analysis in identifying the identity of the writer of the documents. This paper p...