The task of painting each cel of an animated sequence has always been a tedious work using traditional methods. In order to simplify and speed up the process, the development of an automatic cel painting system is desired. This paper presents a method for assisting the production of cartoon animation using computers in order to reduce the production expense and to improve the overall quality. I...

In a previous work, we have introduced Neighborhood Behavior (NB) criteria for calculated molecular similarity metrics, based on the analysis of in vitro activity spaces that simultaneously monitor the responses of a compound with respect to an entire panel of biologically relevant receptors and enzymes. Now, these novel NB criteria will be used as a benchmark for the comparison of different in...

A molecular similarity measure has been developed using molecular topological graphs and atomic partial charges. Two kinds of topological graphs were used. One is the ordinary adjacency matrix and the other is a matrix which represents the minimum path length between two atoms of the molecule. The ordinary adjacency matrix is suitable to compare the local structures of molecules such as functio...

Rev. Roum. Chim. (submitted). Abstract Similarity of two sets of cycle-containing molecular graphs: spiro-alkanes and full Hamiltonian detour cubic cages, is discussed in terms of interand intra-molecular similarity. Molecular description is given as sequences of some well known topological sequences: Distance Degree Sequence DDS, Detour Degree Sequence ∆DS, All Path Sequence APS, Shortest Path...

In recent times, the proliferation of spatial data on the Internet is beginning to allow a much larger audience to access and share data currently available in various Geographic Information Systems (GISs). Unfortunately, even if the user can potentially access a huge amount of data, often, she has not enough knowledge about the spatial domain she wants to query, resulting in a reduction of the...

The number of publicly available Web services (WS) is continuously growing. To perform efficient WS discovery, it is desirable to organize the WS space. Works in this direction propose to group WS according to certain shared properties. Such groups commonly called communities are based either on similarity or on interaction between WS. In this paper we focus on the former, and propose a new net...

This paper proposes a novel method to generate robust contour partition points and applies them to produce point context and contour segment features for shape matching. The main idea is to match object shapes by matching contour partition points and contour segments. In contrast to typical shape context method, we do not consider the topological graph structure since our approach is only consi...