The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
adj.mat → n.mat. The first argument of
interest is n.mat, not necessarily a symmetric adjacency matrix of
numeric, but a symmetric matrix of numeric corresponding to the
symmetric matrix of associations (e.g., of zero-order polychoric
correlation coefficients) computed from the set of items comprised in
the original version of the said psychometric instrument.method → algorithm. The third argument of
interest is algorithm (rather than method), a character matching either
“brute.force” or “simulated.annealing” corresponding to the
combinatorial search algorithm.absolute now always TRUE.max.iter now always
base::ceiling(base::log(stop.temp / start.temp) / base::log(cool.fact)).optimal.S → solution.character.optimal.function.S →
solution.numeric.base::set.seed() no longer permanently alters the
global RNG state. .Random.seed is now saved and restored
via base::on.exit().base::on.exit(),
ensuring cleanup even on early exit or error.NA/NaN values in the input matrix now
trigger a warning with a count of affected entries before being replaced
with zeros.Inf values, non-numeric
entries, non-square matrices, and matrices smaller than 2 × 2.NA status consistently across all parameters.algorithm now uses base::match.arg()
instead of manual %in% checking, supporting partial
matching.start.temp,
cool.fact, stop.temp, n.runs,
seed) are now validated only when
algorithm = "simulated.annealing".call. = FALSE for cleaner
console output.k = 0 and k = n are now rejected during
validation rather than handled as special cases inside the
algorithm.seed now explicitly accepts NULL to skip
setting the RNG state.utils::combn(). This
reduces memory from O(C(n,k) × k) to O(n) and avoids recomputing the
full objective at each step.k > n / 2, enumeration is performed over the
smaller complement, reducing the number of combinations to
evaluate..Machine$integer.max) and exits with a recommendation to
use simulated annealing, rather than attempting to allocate the full
combination matrix.link
vector, replacing the previous full matrix subsetting at each step.base::setdiff()
calls.These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.