Shape recognition is a challenging task when images contain overlapping, noisy, occluded, partial shapes. This paper addresses the task of matching input shapes with model shapes described in terms of features such as line segments and angles. The quality of matching is gauged using a measure derived from attributed shape grammars. We apply genetic algorithms to the partial shape-matching task....

We derive a compiler for ML-style pattern matches. It is conceptually simple and produces reasonably good compiled matches. The derivation is inspired by the instrumentation and partial evaluation of na ve string match-ers. Following that paradigm, we rst present a general and na ve ML pattern matcher, instrument it to collect and exploit extra information, and show that partial evaluation of t...

A method is presented to minimize residual vibration of structures or lightly damped servomechanisms. The method, referred to as the proportional plus multiple delay (PPMD) control, involves the use of multiple time delays in conjunction with a proportional part to cancel the dynamics of the system in a robust fashion. An interesting characteristic of the controller involves addition of a basic...

Métodos e técnicas para compressão de dados têm sido utilizados para o reconhecimento de padrões, incluindo a classificação automática de textos. A eficiência do método Prediction by Partial Matching (PPM) como classificador textual já foi comprovada em diversos trabalhos, entre eles a atribuição de autoria para textos em português. As classes utilizadas no processo de classificação não precisa...

Abstract The partial evaluation and assembly framework has recently been applied for processing subgraph matching queries over large-scale knowledge graphs in the distributed environment. is implemented on master-slave architecture, endowed with outstanding scalability. However, there are two drawbacks of evaluation: if volume intermediate results large, a large number repeated matches will be ...

The prediction by partial matching (PPM) algorithm has been well known for its high prediction accuracy. Recent proposals of PPM-like predictors confirm its effectiveness on branch prediction. In this paper, we introduce a new branch prediction algorithm, named Prediction by combining Multiple Partial Matches (PMPM). The PMPM algorithm selectively combines multiple matches instead of using the ...

A supercompiler is a program which can perform a deep transforma tion of programs using a principle which is similar to partial evaluation and can be referred to as metacomputation Supercompilers that have been in existence up to now see were not self applicable this is a more di cult problem than self application of a partial evaluator because of the more intricate logic of supercompilation In...

We present a new limiter for the PPM method of Colella and Woodward [4] that preserves accuracy at smooth extrema. It is based on constraining the interpolated values at extrema (and only at extrema) using nonlinear combinations of various difference approximations of the second derivatives. Otherwise, we use a standard geometric limiter to preserve monotonicity away from extrema. This leads to...