At every iteration or timestep of the online phase some reduced-order modelling schemes for non-linear time-dependent systems, large linear systems must be assembled and then projected onto a reduced order basis small dimension. The are cheap to solve, but assembly projection become dominant computational cost. In this paper we introduce new hyper-reduction strategy called (RA) that drastically...

Hyper-heuristics are a class of high-level search methodologies which operate over a search space of heuristics rather than a search space of solutions. Hyper-heuristic research has set out to develop methods which are more general than traditional search and optimisation techniques. In recent years, focus has shifted considerably towards cross-domain heuristic search. The intention is to devel...

Cross-validation is a widespread method for assessing the generalisation ability of a model in order to tune a regularisation parameter or other hyper-parameters of a learning process. The use of cross-validation requires to set yet an additional parameter, the split ratio. Few texts have investigated theoretically the asymptotic setting of this ratio, and no consensus has emerged. In this cont...

Global optical flow estimation methods contain a regularization parameter (or prior and likelihood hyper-parameters if we consider the statistical point of view) which control the tradeoff between the different constraints on the optical flow field. Although experiments (see e.g. Ng et al. [Ng and Solo(1997)]) indicate the importance of the optimal choice of the hyper-parameters, only little at...

Hyperproperties are becoming the, de facto, standard for reasoning about systems executions. They differ from classical trace properties since they are represented by sets of sets of executions instead of sets of executions. In this paper, we extend and lift the hierarchy of semantics developed in 2002 by P. Cousot in order to cope with verification of hyperproperties. In the standard hierarchy...

This paper extends a calculus for rst-order logic that combines the inference mechanism of hyperresolution with the more informative structure of analytic tableaux and that has been introduced as hyper tableaux by Baumgartner et al. (1996). This clausal tableau calculus is proof connuent, but suuers from the need of partial ground instantia-tions. I will develop an improvement of hyper tableaux...

Building on the literature of dynamic capability and organizational learning, we examine strategy execution in hyper-competition as a problem of how organizations can re-configure their learning capability to match with their radically different learning demands. Organizations in hyper-competitive environments face an increasing gap between their learning opportunities and needs, and actual lea...

We address the important step of determining an effective subset of heuristics in selection hyper-heuristics. Little attention has been devoted to this in the literature, and the decision is left at the discretion of the investigator. The performance of a hyper-heuristic depends on the quality and size of the heuristic pool. Using more than one heuristic is generally advantageous, however, an u...

Common trends in model order reduction of large nonlinear finite-element-discretized systems involve the introduction of a linear mapping into a reduced set of unknowns, followed by Galerkin projection of the governing equations onto a constant reduction basis. Though this reduces the number of unknowns in the system, the computational cost for obtaining the solution could still be high due to ...

This paper presents a mechanism for hyper-linking documents by search-terms. Search-terms are selected by the user interactively building a formal concept lattice. In order to explain this interface we give some background to Formal Concept Analysis and an example is developed which illustrates the use of the concept lattice. Selected search-terms are used to create hyper-links, based on term r...