In this work we present a combined approach to contingency tables analysis using correspondence analysis and log-linear models. Several investigators have recognized relations between the aforementioned methodologies, in the past. By their combination we may obtain a better understanding of the structure of the data and a more favorable interpretation of the results. As an application we applie...

A method to correspond linear structures in mammographic images is presented. Our approach is based on automatically establishing correspondence between linear structures which appear in images using robust features such as orientation, width and curvature extracted from those structures. The resulting correspondence is used to track linear structures and regions in mammographic images taken at...

GivenS|R a finite Galois extension of finite chain rings andB anS-linear code we define twoGalois operators, the closure operator and the interior operator. We proof that a linear code is Galois invariant if and only if the row standard form of its generator matrix has all entries in the fixed ring by the Galois group and show a Galois correspondence in the class of S-linear codes. As applicati...

A major challenge in feature matching is the lack of objective criteria to determine corresponding points. Recent methods find match candidates first by exploring the proximity in descriptor space, and then rely on a ratio-test strategy to determine final correspondences. However, these measurements are heuristic and subjectively excludes massive true positive correspondences that should be mat...

− By a reduction to Post’s Correspondence Problem we provide a direct proof of the known fact that the inclusion problem for unambiguous context-free grammars is undecidable. The argument or some straightforward modification also applies to some other subclasses of context-free languages such as linear languages, sequential languages, and DSClanguages (i.e., languages generated by context-free ...

In this correspondence we determine the linear complexity of all Legendre sequences and the (monic) feedback polynomial of the shortest linear feedback shift register that generates such a Legendre sequence. The result of this correspondence shows that Legendre sequences are quite good from the linear complexity viewpoint.

background and objective: one way to promote education quality is to evaluate faculty activities by students, departmental heads, and the dean. the degree of correspondence between students' and departmental heads' evaluation shows how honest they are in their assessment. the current paper intends to find the truth.     materials and methods : questionnaires were used to conduct the s...