Measuring the quality of metadata is only possible by assessing the quality of the underlying schema and the metadata instance. We propose some factors that are measurable automatically for metadata according to the CMD framework, taking into account the variability of schemas that can be defined in this framework. The factors include among others the number of elements, the (re-)use of reusabl...

Despite significant successes in structure-based computational protein design in recent years, protein design algorithms must be improved to increase the biological accuracy of new designs. Protein design algorithms search through an exponential number of protein conformations, protein ensembles, and amino acid sequences in an attempt to find globally optimal structures with a desired biologica...

A wealth of studies has revealed a cross-cultural difference in the user preference on webpage designs. Users from other cultures often criticize a widely accepted webpage design in one culture. Designs for diverse cultures are thus expected to be specific to address diverse user preferences. This study investigated the preferences of Chinese users on four essential design elements related to t...

We propose a complete methodology to develop custom monofocal Intraocular Lens (IOL) designs and evaluate their performance on-axis based on an analytical formulation. The analytical formulation was based on Gaussian and primary aberration theory applied to custom (individual biometric data) and realistic (multilayer cornea and thick IOL) pseudoaphakic eye models. Gradient-based optimization al...

In this paper we consider D-optimal and highly D-efficient chemical balance weighing designs. The errors are assumed to be equally non-negatively correlated and to have equal variances. Some necessary and sufficient conditions under which a design is D*-optimal design (regular D-optimal design) are proved. It is also shown that in many cases D*-optimal design does not exist. In many of those ca...

The ability to distract opponents is a key mechanic in many stealth games. Existing search-based approaches to stealth analysis, however, focus entirely on solving the non-detection problem, for which they rely on static, ahead-of-time models of guard movements that do not depend on player interaction. In this work we extend and optimize an approach based on heuristic search of stealth games to...

Automated search of a space of candidate designs seems an attractive way to improve the traditional engineering design process. To make this approach work, however, the automated design system must include both knowledge of the modeling limitations of the method used to evaluate candidate designs and also an eeective way to use this knowledge to innuence the search process. We suggest that a pr...

Local search is often able to solve larger problems than systematic backtracking. To apply it to a constraint satisfaction problem, the problem is often treated as an optimization problem in which the search space is the total assignments, and the number of constraint violations is to be minimized to zero. Though often successful, this approach is sometimes unsuitable for structured problems wi...

A 4-(12, 6, 4) design that is not also a 5-(12, 6, 1) design must have at least one pair of blocks with five points in common. It is shown that there are just nine non-isomorphic such designs; so, including the 5-(12, 6, 1) design, there are ten 4-(12, 6, 4) designs. These designs are characterised by the orders of their automorphism groups and they all contain a 4-(11, 5, 1) design.

The design of efficient monitoring networks is very important to obtain a better understanding of environmental, ecological and epidemiological processes. In this paper we develop for the optimal design of monitoring networks a new hybrid genetic algorithm (HGA) which combines the standard genetic algorithm (GA) with a local search operator. We compare the performance of our HGA with two other ...