Search results for " Match"
showing 10 items of 345 documents
MESH COMPARISON USING ATTRIBUTE DEVIATION METRIC
2004
We propose a mesh comparison method using a new attribute deviation metric. The considered meshes contain geometrical and appearance attributes (material color, texture, temperature, etc.). The proposed deviation metric computes local differences between the attributes of two meshes. A mesh comparison assessment can be done easily and quickly using this metric. The techniques proposed are applicable in a number of ways, e.g. 3D matching and registration, and the example described in the paper is the simplification of a surface by iteratively reducing its complexity according to an error metric. The results are presented showing the success of the algorithm through comparisons with other me…
Robust fault detection design for unknown inputs Takagi-Sugeno models with parametric uncertainties and time-varying delays
2014
This paper deals with the design of robust fault detection system for Takagi-Sugeno (T-S) modes with parametric uncertainties and time-varying delay. An Unknown Input Observer (UIO) is designed such that the unknown inputs are thoroughly decoupled from residual signals while they show the maximum possible sensitivity to the faults and the minimum possible sensitivity to the external disturbances. Since the system under consideration is subjected to parametric uncertainties, the H ∞ model matching approach is used to design an optimal observer. Design procedure is given in terms of Linear Matrix Inequalities (LMIs). Finally, a numerical example is presented to show the effectiveness of the p…
Metodo di Template Matching per l'Analisi di Immagini
2012
La presente invenzione si riferisce ad un metodo di Template Matching per l’analisi di immagini da ImmunoFluorescenza Indiretta (IFI) per la rivelazione e classificazione automatica di pattern autoanticorpali. L’invenzione qui presentata generalizza il metodo del Template Matching operando innovativamente il mapping del contenuto visuale dell’immagine con particolari funzioni discrete qui denominate “mappatori”; inoltre, utilizzando le informazioni provenienti dalla sovrapposizione dei vari mappatori con un metodo di confronto funzionale, realizza una funzione di correlazione originale. La metodologia descritta nel seguito presenta una flessibilità tale da renderla applicabile a qualsiasi p…
Text Compression Using Antidictionaries
1999
International audience; We give a new text compression scheme based on Forbidden Words ("antidictionary"). We prove that our algorithms attain the entropy for balanced binary sources. They run in linear time. Moreover, one of the main advantages of this approach is that it produces very fast decompressors. A second advantage is a synchronization property that is helpful to search compressed data and allows parallel compression. Our algorithms can also be presented as "compilers" that create compressors dedicated to any previously fixed source. The techniques used in this paper are from Information Theory and Finite Automata.
Approximate Matching over Biological RDF Graphs
2012
In the last few years, the amount of biological interaction data discovered and stored in public databases (e.g., KEGG [2]) considerably increased. To this aim, RDF is a powerful representation for interactions (or pathways), since they can be modeled as directed graphs, often referred to as biological networks, where nodes represent cellular components and the (labeled or unlabeled) edges correspond to interactions among components. Often for a given organism some components are known to be linked by well studied interactions. Such groups of components are called modules and they can be represented by sub-graphs in the corresponding biological network model. At today, one of the most impor…
A basic analysis toolkit for biological sequences
2007
This paper presents a software library, nicknamed BATS, for some basic sequence analysis tasks. Namely, local alignments, via approximate string matching, and global alignments, via longest common subsequence and alignments with affine and concave gap cost functions. Moreover, it also supports filtering operations to select strings from a set and establish their statistical significance, via z-score computation. None of the algorithms is new, but although they are generally regarded as fundamental for sequence analysis, they have not been implemented in a single and consistent software package, as we do here. Therefore, our main contribution is to fill this gap between algorithmic theory an…
Are Low Prices Compromises Collusion Guarantees? An Experimental Analysis of Price Matching Policies
2001
In this paper we experimentally test the ability of Price-Matching Guarantees (PMG) to rise prices above the competitive level. We implement three different treatments of symmetric duopolies to check the effect of PMG both as a market institution and as a business strategy. In the absence of any low-price guarantee, prices get close to the Bertrand-Nash equilibrium although in the 50 rounds of the experiment no full convergence is obtained. The existence of PMG as an institution in a market where firms decide only about prices results in a clear collusive outcome as all markets quickly and fully converge to the collusive prediction. If we allow subjects to decide whether they adopt price ma…
Unbeatable Value Low-Price Guarantee: Collusive Mechanism or Advertising Strategy?
2006
This paper investigates the effects of a low-price guarantee (price-beating guarantee) on the patterns of price setting of three supermarkets using micro-level price data. Following recent theoretical developments, the paper analyzes the ability of low-price guarantees to sustain anticompetitive prices. My empirical analysis suggests instead that this low-price guarantee may serve as an advertising device to signal low prices. The supermarket offering the low-price guarantee, aware of its price advantage in a subset of products, uses it to signal low prices to induce consumers to switch supermarkets.
Color memory matching: Time effect and other factors
1998
The methods of simultaneous and successive, or memory, color matching have been compared for 10 color reference samples distributed in two groups each performed by 50 observers (25 men and 25 women). Our results, obtained with a total of two hundred Munsell color chips arrayed on ten gray cardboard panels, indicate that: (a) while by simultaneous matching the mean color differences obtained are, in most cases, lower than 1 CIELAB unit, those obtained by memory are generally higher; (b) the worst remembered colors are yellow, light green, blue, and pink, and the best remembered color is orange; (c) the influence of the delay time (15 s, 15 min, and 24 h) is significant for the remembered mea…
Color memory in protanomals and deuteranomals: Matching time effect
2003
In a companion paper Perez-Carpinell et al., Color Res Appl 2001;26:158–170, for a set of seven color references, we compared the methods of simultaneous and memory color matching by 15 protanomals and 21 deuteranomals, looking for differences between them and a group of 25 normal trichromat observers investigated previously Perez-Carpinell et al., Color Res Appl 1998;23:234–247. In our current article, matching times of the same anomalous trichromat groups, and with the same reference tests, to select from among the comparison chips the one that most resembled one of the seven reference tests, have been measured under simultaneous and successive color matching procedures. From comparison b…