it is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (castelnuovo-mumford) regularity. as a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph g are equal provided g is well-covered bipa...

An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allen's method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested...

To evaluate the performance of fingerprint-image matching algorithms on large datasets, a receiver operating characteristic (ROC) curve is applied. From the operational perspective, the true accept rate (TAR) of the genuine scores at a specified false accept rate (FAR) of the impostor scores is usually employed. And the equal error rate (EER) can also be used. The accuracies of the measurement ...

This paper addresses the problem of detecting the presence of data hidden in digital media by the Least Significant Bit (LSB) matching scheme. In a theoretical context of known digital medium parameters, two important results are presented. First, the use of hypothesis testing theory allows the design of the Most Powerful (MP) test. Second, a study of the MP test provides the opportunity to ana...

image denoising by block matching and threedimensionaltransform filtering (bm3d) is a two steps state-ofthe-art algorithm that uses the redundancy of similar blocks innoisy image for removing noise. similar blocks which can havesome overlap are found by a block matching method and groupedto make 3-d blocks for 3-d transform filtering. in this paper wepropose a new block grouping algorithm in th...

Discrete moments of the Riemann zeta function were studied by Gonek and Hejhal in the 1980’s. They independently formulated a conjecture concerning the size of these moments. In 1999, Hughes, Keating, and O’Connell, by employing a random matrix model, made this conjecture more precise. Subject to the Riemann hypothesis, we establish upper and lower bounds of the correct order of magnitude in th...

An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allens method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested ...

Mirror neurons and canonical neurons are two classes of visuomotor neurons that are activated by different visual stimuli (Rizzolatti and Kalaska, 2012). Mirror neurons respond to a biological effector interacting with an object (Gallese et al., 1996), suggesting their role in action recognition, while canonical neurons respond to the presentation of a graspable object (Murata et al., 1997), an...