We propose a method to optimally select mix network parameters for given deployment context and adversarial model. Our considers both worstcase average-case anonymity selects configurations that meet worst-case constraints while maximizing average anonymity. apply our methods mixnet size optimization determine the number width of layers, provide results various scenarios. For cases where sudden...

Representation of the optimization process to automate development mortar mixes for robotic 3D printing with aim reduce required workload while generating mixture compositions improved properties by following an optimum trend.

In this paper, we introduce the HashRF(p, q) algorithm for computing RF matrices of large binary, evolutionary tree collections. The novelty of our algorithm is that it can be used to compute arbitrarilysized (p × q) RF matrices without running into physical memory limitations. In this paper, we explore the performance of our HashRF(p, q) approach on 20,000 and 33,306 biological trees of 150 ta...

in this paper, we have outlined the surrogate management framework for optimization of expensive functions. an initial simple iterative method which we call the “strawman” method illustrates how surrogates can be incorporated into optimization to stand in for the most expensive function. these ideas are made rigorous by incorporating them into the framework of pattern search methods. the smf al...

Perfect phylogeny is one of the fundamental models for studying evolution. We investigate the following variant of the problem: The input is an n ×m species-characters matrix. The characters are binary and directed, i.e., a species can only gain characters. The difference from standard perfect phylogeny is that for some species the state of some characters is unknown. The question is whether on...