Matching search in fractal video compression and its parallel implementation in distributed computing environments

Fractal video compression is a relatively new video compression method. Its attraction is due to the high compression ratio and the simple decompression algorithm. But its computational complexity is high and as a result parallel algorithms on high performance machines become one way out. In this study we partition the matching search, which occupies the majority of the work in a fractal video compression process, into small tasks and implement them in two distributed computing environments, one using DCOM and the other using .NET Remoting technology, based on a local area network consists of loosely coupled PCs. Experimental results show that the parallel algorithm is able to achieve a high speedup in these distributed environments.

Matching case history patterns in case-based reasoning

This paper introduces a mechanism for representing and recognizing case history patterns with rich internal temporal aspects. A case history is characterized as a collection of elemental cases as in conventional case-based reasoning systems, together with the corresponding temporal constraints that can be relative and/or with absolute values. A graphical representation for case histories is proposed as a directed, partially weighted and labeled simple graph. In terms of such a graphical representation, an eigen-decomposition graph matching algorithm is proposed for recognizing case history patterns.

A critical examination of node-similarity based graph matching algorithms

In this paper, we shall critically examine a special class of graph matching algorithms that follow the approach of node-similarity measurement. A high-level algorithm framework, namely node-similarity graph matching framework (NSGM framework), is proposed, from which, many existing graph matching algorithms can be subsumed, including the eigen-decomposition method of Umeyama, the polynomial-transformation method of Almohamad, the hubs and authorities method of Kleinberg, and the kronecker product successive projection methods of Wyk, etc. In addition, improved algorithms can be developed from the NSGM framework with respects to the corresponding results in graph theory. As the observation, it is pointed out that, in general, any algorithm which can be subsumed from NSGM framework fails to work well for graphs with non-trivial auto-isomorphism structure.

Measuring similarity of software designs using graph matching for CBR

This paper examines different ways of measuring similarity between software design models for Case Based Reasoning (CBR) to facilitate reuse of software design and code. The paper considers structural and behavioural aspects of similarity between software design models. Similarity metrics for comparing static class structures are defined and discussed. A Graph representation of UML class diagrams and corresponding similarity measures for UML class diagrams are defined. A full search graph matching algorithm for measuring structural similarity diagrams based on the identification of the Maximum Common Sub-graph (MCS) is presented. Finally, a simple evaluation of the approach is presented and discussed.

A robust approach to subsequence matching

In terms of a general time theory which addresses time-elements as typed point-based intervals, a formal characterization of time-series and state-sequences is introduced. Based on this framework, the subsequence matching problem is specially tackled by means of being transferred into bipartite graph matching problem. Then a hybrid similarity model with high tolerance of inversion, crossover and noise is proposed for matching the corresponding bipartite graphs involving both temporal and non-temporal measurements. Experimental results on reconstructed time-series data from UCI KDD Archive demonstrate that such an approach is more effective comparing with the traditional similarity model based algorithms, promising robust techniques for lager time-series databases and real-life applications such as Content-based Video Retrieval (CBVR), etc.

An integrated study (geochemistry, stable oxygen and carbon isotopes, nannofossils, planktonic foraminifera, inoceramid bivalves, ammonites and crinoids) of the Waxahachie Dam Spillway section, north Texas: a possible boundary stratotype for the base of the Campanian Stage

The spillway of Lake Waxahachie, Ellis County (Texas), exposes a > 17 m section of the Hutchins Member of the Austin Chalk Group, un-conformably overlain by Taylor Clay. The Austin sequence was regarded as a potential Global Stratotype Section for the base of the Campanian Stage at the 1995 Brussels meeting on Cretaceous Stage boundaries, with the last occurrence of the crinoid Marsupites testudinarius (von Schlotheim, 1820) as the potential boundary marker. An integrated study of the geochemistry, stable carbon and oxgen isotopes, nannofossils, planktonic foraminifera, inoceramid bivalves, ammonites and crinoids of this section place the last occurrence of M. testudinarius in a matrix of eighteen ancillary biostratigraphic markers, while the boundary can also be recognised on the basis of a delta C-13 excursion that can, in principle, be detected globally in marine sediments. A new forma of the crinoid Marsupites testudinarius is introduced. The Waxahachie section fulfils sufficient geological criteria as to be an excellent candidate GSSP for the base of the Campanian Stage, if problems of ownership and access to the section can be resolved.