This is because the instances are acyclic chemical compounds: 1-augmented trees become less able to satisfy the feature vector constraint as K increases and only multi-trees can satisfy the feature vector constraint.
Although Harn-Hsu's work fails to satisfy the feature of asynchronous secret reconstruction, this new feature is still reasonable and practical.
In the second phase, we assign multiplicities of edges for each of the simple trees to satisfy the feature vector constraint and the valence constraint.
Furthermore, we propose two enhancement techniques for existing MOEAs, namely the feedback-directed mechanism to fast find the correct solutions (e.g., solutions that satisfy the feature model constraints) and the preprocessing method to reduce the search space.
Our proposed scheme satisfies the feature of asynchronous secret reconstruction.
In this paper, we prove the incorrectness of Harn-Hsu's scheme and propose a new (t,n) multi-secret sharing scheme which is extended from Harn-Hsu's scheme; our proposed scheme satisfies the feature introduced by Harn and Hsu.
Results in Table 2 showed that all the active compounds were able to satisfy the pharmacophoric features of the generated model with RMSD values ranging from 0.3907 to 0.6571 Å along with their most suitable alignment of each compound over query.
However, their scheme does not satisfy the new feature.
Next, we introduce a new (t,n) multi-secret sharing scheme that can satisfy the new feature.
It is because of its failure to satisfy the first feature that Bentham (2014) rejected the prevailing criminalization of consensual sexual acts, and developed the first systematic defence of sexual liberty in the English language.
In this paper, we propose a wise attack from inside attackers and prove Harn-Hsu's scheme does not satisfy the new feature, and analysis why their parameters are unreasonable.
