Partition-based matching

Reduction of search space for matching (early pruning of dissimilar element pairs, partition-based matching)... 

The taxonomy matching system AnchorFlood implements a dynamic partition-based matching that avoids the a-priori partitioning of the ontologies (Hanif and Aono 2009). It also utilizes anchors (similar concept pairs) but takes them as a starting point to incrementally match elements in their structural neighborhood until no further matches are found or all elements are processed. Thus the partitions (called... 

Remark 1 As can be seen in Figure 8.20, the above problem statement corresponds to the simultaneous consideration of the second and third rectangle inside the loop of the HRAT optimization. The key feature is that we do not need to partition the HEN problem into subnetworks based on the location of its pinch point(s). Instead, we postulate all possible matches that may take place and optimize simultaneously for the selection of matches and their heat loads, as well as the minimum investment cost network structure,... 

Statistical mechanical approaches apply mainly to deductions about structure and are the basis of interpretations of the entropy of ions in solution and the solution s heat capacity. The entropy of a system can be calculated if the partition functions of the ions and the water molecules surrounding them are known." The partition functions (translatory, rotational, and vibrational) can be obtained from textbook material by assuming a structure of the ion-solvent complex. By comparing calculations based on various assumptions about stmcture with the values obtained from experiments, certain stmctures can be shown to be more likely (those giving rise to the calculations that match the experiment), others less probable, and some so far from the experimental values that they may be regarded as impossible. 

Intra-matcher parallelization is more versatile and deals with internal parallelization of matchers, typically based on a partitioning of the schemas or ontologies to be matched. Partitioning leads to many smaller match tasks that can be executed in parallel with reduced memory requirements per task. By choosing appropriate partition sizes, the approach becomes very flexible and scalable. Furthermore, intra-matcher parallelism can be applied for sequential as well as independently executable matchers, i.e., it can also be combined with inter-matcher parallelism. 

The purpose of the calibration exercise was to determine appropriate parameters which would result in a best-fit match between model simulations and the soil core field observations. The first step in the procedure was to assign values to field-measured, physically-based, parameters which include all parameters for the water balance and crop development portions of the model. The second step was to calibrate chemically and biologically based parameters which are not easily measured in the field. These include the adsorption partition coefficient, K, and the first-order rate of decay, k, of aldicarb. Using reasonable ranges of and k as defined by the literature, a trial-and-error method was used until model predictions matched field observations. 

Partitioning-Relaxation-Based Substructure Matching Algorithms... 

---