The proposed scheme satisfies the requirements of law 2 of Microsoft's own laws of identity to a greater degree than the currently deployed CardSpace identity metasystem, where this law states that only the minimum amount of identifying information must be revealed.
The matching process included a 'blocking' step which limited comparisons to those records which share a minimum level of identifying information.
The hunting seasons identified, deducted from the minimum number of identified moments, are similar for levels 25 (Upper Magdalenian) and 27 (Middle Magdalenian), providing evidence of reindeer hunting throughout the year, during all four seasons.
However, as shown in Table 1, the minimum density of identified complexes in each output set is small, which means that unlike other methods based on dense subgraphs, such as CMC and MCSE, can also identify protein complexes with small density.
A minimum number of identified peptides per protein can be used as a criterion for reducing false-positive identifications (Carr et al. 2004), but this approach does not apply to small or low abundance proteins, which usually have less identifiable peptides.
A balance must be found between assessment frequency, SDI results and other clinical and sociodemographic considerations to keep patient and staff burden to a minimum without losing sensitivity of identifying patients who are struggling.
Following further calls for harmonisation across the European Union, 2 3 4 member states have been engaged in a process of identifying minimum standards for driving, and these are now in the process of being implemented in the United Kingdom and other European Union states.
With the aim of identifying a minimum set of markers able to separate cells that have the capacity to form spheres from those incapable of forming spheres, a PCA (principal component analysis) of the multidimensional dataset was performed.
The problem of identifying the minimum number of probes to detect and distinguish a set of targets is an instance of the classical set cover problem, a well studied computational problem which is known to be NP Complete.
The problem of identifying the minimum number of reticulations in a graph is NP-hard [ 117], such that most recent developments in this field have been to develop good algorithms to approximate the optimal solution [ 118, 119].
