In this chapter, we extend a set of algebraic tools for microprocessors (Harman and Tucker [1996], Harman and Tucker [1997] and Fox and Harman [1996a]) to model superscalar microprocessor implementations, and apply them to a case study. In superscalar microprocessors, the timing of events in an implementation can be substantially different from that of the architecture that they implement. We d...

Abigail Tucker is a professor at King's College London, UK and her lab works on various aspects of craniofacial development - from basic, evolutionary and clinical biology perspectives. This year, Abigail will be awarded the first Cheryll Tickle Medal by the British Society for Developmental Biology (BSDB). We chatted with Abigail about her research, her commitment to public engagement and the ...

A very general optimization problem with a variational inequality constraint, inequality constraints, and an abstract constraint are studied. Fritz John type and Kuhn–Tucker type necessary optimality conditions involving Mordukhovich coderivatives are derived. Several constraint qualifications for the Kuhn–Tucker type necessary optimality conditions involving Mordukhovich coderivatives are intr...

In this paper, we integrate goal programming (GP), Taylor Series, Kuhn-Tucker conditions and Penalty Function approaches to solve linear fractional bi-level programming (LFBLP)problems. As we know, the Taylor Series is having the property of transforming fractional functions to a polynomial. In the present article by Taylor Series we obtain polynomial objective functions which are equivalent...

This work is concerned with approximating a trivariate function defined on tensor-product domain via evaluations. Combining tensorized Chebyshev interpolation Tucker decomposition of low multilinear rank yields approximations that can be computed and stored very efficiently. The existing Chebfun3 algorithm [Hashemi Trefethen, SIAM J. Sci. Comput., 39 (2017)]uses similar format but the construct...

This article is concerned with a general scheme on how to obtain constructive proofs for combinatorial theorems that have topological proofs so far. To this end the combinatorial concept of Tucker-property of a finite group G is introduced and its relation to the topological Borsuk-Ulam-property is discussed. Applications of the Tucker-property in combinatorics are demonstrated.