We show that the gauge hierarchy problem can be solved in the framework of scalar-tensor theories of gravity very much in the same way as it is solved in the Randall-Sundrum scenario. Our solution involves a fine-tuning of the gravitational sector which can, however, be avoided if a supergravity extension of the dilaton sector is considered. However our mechanism does not require the introducti...

During the post-Darwinian history of taxonomy, the Linnaean hierarchy has maintained its role as a means for representing hierarchical taxonomic relationships. During the same period, the principle of descent has taken on an increasingly important role as the basis for reformulated versions of fundamental taxonomic concepts and principles. Early in this history, the principle of descent provide...

During the post-Darwinian history of taxonomy, the Linnaeän hierarchy has maintained its role as a means for representing hierarchical taxononaic relationships. During the same period, the principle of descent has tallen on an increasingly important role as the basis for reformulated versions of fundamental taxonomic concepts and principles. Early in this history, the principle of descent provi...

As the processor-memory performance gap continues to grow, so does the need for effective tools and metrics to guide the design of efficient memory hierarchies to bridge that gap. Aggregate statistics of cache performance can be useful for comparison, but they give us little insight into how to improve the design of a particular component. We propose a different approach to cache analysis — vie...

The aim of this paper is to relate the research on cognitive maps, mental representations of the external world, which are thought to be organized hierarchically, with the simplicity principle, a formal version of Occam’s Razor inductive bias, which states that short hypotheses are to be preferred over longer ones. First, I will describe some important properties of hierarchical structures and ...

We show how to formalize approximate counting via hash functions in subsystems of bounded arithmetic, using variants of the weak pigeonhole principle. We discuss several applications, including a proof of the tournament principle, and an improvement on the known relationship of the collapse of the bounded arithmetic hierarchy to the collapse of the polynomial-time hierarchy.