We describe a new implementation of the Edmonds’s algorithm for computing a perfect matching of minimum cost, to which we refer as Blossom V. A key feature of our implementation is a combination of two ideas that were shown to be effective for this problem: the “variable dual updates” approach of Cook and Rohe (INFORMS J Comput 11(2):138–148, 1999) and the use of priority queues. We achieve thi...

conclusions significant improvement was noted at womac scale (pain level; 5 points, stiffness level; 2 points, physical function loss; 15 points, and total womac 22 points). osteoarthritis level of the patient was improved to grade i at radiological evaluation after a year. our case is the report that presents radiological evidence in addition to clinical findings of improvement of osteoarthrit...

Reliability evaluation of a large-scale composite power system faces to numerous events/outage and consequently imposes an extensive burden of calculations. In order to simplify the problem, determination of an equivalent system for large-scale power system is inevitable. This paper proposes a framework as reduction technique to separate a composite power system to three areas: external area, o...

We investigate average efficient adders for grid-based environments related to current Field Programmable Gate Arrays (FPGAs) and VLSI-circuits. Motivated by current trends in FPGA hardware design we introduce a new computational model, called the -wired grid model. The parameter describes the degree of connectivity of the underlying hardware. This model covers among others two-dimensional cell...

there is a need to analyze and map rainfall erosivity to assess soil erosion at the regional scale. the objectives of this study were to develop a regional model to estimate seasonal erosivity from seasonal rainfall data and to study temporal and spatial distribution of rainfall erosivity for the gorganrood drainage basin in the northeast of iran. six gauging stations with a high temporal resol...

The Hausdorff Voronoi diagram of a set of clusters of points in the plane is a generalization of the classic Voronoi diagram, where distance between a point t and a cluster P is measured as the maximum distance, or equivalently the Hausdorff distance between t and P . The size of the diagram for non-crossing clusters is O(n ), where n is the total number of points in all clusters. In this paper...