in the paper a model to predict the concentrations of particulate matter pm10, pm2.5, so2, no, co and o3 for a chosen number of hours forward is proposed. the method requires historical data for a large number of points in time, particularly weather forecast data, actual weather data and pollution data. the idea is that by matching forecast data with similar forecast data in the historical data...

Matching preclusion is a measure of robustness in the event of edge failure in interconnection networks. The matching preclusion number of a graph G is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching or an almost perfect matching, and the conditional matching preclusion number of G is the minimum number of edges whose deletion leaves the resultin...

The matching energy of a graph is defined as the sum of the absolute values of the zeros of its matching polynomial. Let Gn,m be the set of connected graphs of order n and with m edges. In this note we determined the extremal graphs from Gn,m with n ≤ m ≤ 2n−4 minimizing the matching energy. Also we determined the minimal matching energy of graphs from Gn,m where m = n−1+t and 1 ≤ t ≤ β−1 and w...

the most important factor in donor-recipient matching for hematopoietic stem cell transplantation is their hla typing. for many patients, we can not find a full-matched donor. in high risk patients, one locus  mismatched related donors are suitable alternatives. (1, 2) since the matching of patients and their siblings usually is based on low resolution hla typing, the matching of one locus mism...

In this papel; morphological elastic graph matching is applied to frontal face authentication on databases collected either under optimal conditions or during real-world tests (i.e., access-control to buildings or tele-services via INTERNET in a typical office environment etc.). It is demonstrated that the morphological elastic graph matching achieves a very low equal error rate on databases co...

The regularity of an edge ideal of a finite simple graph G is at least the induced matching number of G and is at most the minimum matching number of G. If G possesses a dominating induced matching, i.e., an induced matching which forms a maximal matching, then the induced matching number of G is equal to the minimum matching number of G. In the present paper, from viewpoints of both combinator...