Freehand sketching is a natural and crucial part of everyday human interaction, yet is almost totally unsupported by current user interfaces. With the increasing availability of tablet notebooks and pen based PDAs, sketch based interaction has gained attention as a natural interaction modality. We are working to combine the flexibility and ease of use of paper and pencil with the processing pow...

The focus of this paper is on similarity modeling. In the first part we revisit underlying concepts of similarity modeling and sketch the currently most used VIR similarity model (Linear Weighted Merging, LWM). Motivated by its drawbacks we introduce a new general similarity model called Logical Retrieval (LR) that offers more flexibility than LWM. In the second part we integrate the Feature Co...

We address the problem of computing the expected reversal distance of a genome with n genes obtained by applying t random reversals to the identity. A good approximation is the expected transposition distance of a product of t random transpositions in Sn. Computing the latter turns out to be equivalent to computing the coefficients of the length function (i.e. the class function returning the n...

Computer aided design is vitally important for the modern industry, particularly for the creative industry. Fashion industry faced intensive challenges to shorten the product development process. In this paper, a methodology is proposed for sketch design based on interactive genetic algorithms. The sketch design system consists of a sketch design model, a database and a multi-stage sketch desig...

This paper deals with detection of SYN flooding attacks which are the most common type of attacks in a Mobile Agent World. We propose a new framework for the detection of flooding attacks by integrating Divergence measures over Sketch data structure. We compare three divergence measures (Hellinger Distance, Chi-square and Power divergence) to analyze their detection accuracy. The performance of...

In the present note it is shown that a very useful generalized distance function may be defined in certain of these spaces. Clearly, any such distance function must be an asymmetric one. W. A. Wilson considered the definition of asymmetric distances in certain spaces which satisfy stronger separation axioms than K. I t is shown here that a slight modification of one of the axioms in [W] allows ...

Motivated by vision tasks such as robust face and object recognition, we consider the following general problem: given a collection of low-dimensional linear subspaces in a high-dimensional ambient (image) space and a query point (image), efficiently determine the nearest subspace to the query in ` distance. We show in theory that Cauchy random embedding of the objects into significantlylower-d...

We encounter partial differential equations routinely in transport phenomena. Some examples are unsteady flow in a channel, steady heat transfer to a fluid flowing through a pipe, and mass transport to a falling liquid film. Here, we shall learn a method for solving partial differential equations that complements the technique of separation of variables. We shall also learn when the method can ...

We present an anytime algorithm that generates a collision-free configuration-space path that closely follows a desired path in task space, according to the discrete Fréchet distance. By leveraging tools from computational geometry, we approximate the search space using a cross-product graph. We use a variant of Dijkstra’s graph-search algorithm to efficiently search for and iteratively improve...

A binary linear code is called LCD if it intersects its dual trivially. We show that the coefficients of the joint weight enumerator of such a code with its dual satisfy linear constraints, leading to a new linear programming bound on the size of an LCD code of given length and minimum distance. In addition, we show that this polynomial is, in general, an invariant of a matrix group of dimensio...