This pearl aims to demonstrate the ideas of wholemeal and projective programming using the Towers of Hanoi puzzle as a running example. The puzzle has its own beauty, which we hope to expose along the way.

in this paper the changes in the heat capacity of cooling towers has been investigated as a result of injecting combustion products of boilers. in the tower, the air is re-heated through mixing with hot flue gas after passing through the heat exchangers. as a result of this process, the draft of the cooling tower is increased. the additional produced draft depends on the ambient temperature and...

We prove that any decision procedure for a modest fragment of L. Henkin's theory of pure propositional types 7, 12, 15, 11] requires time exceeding a tower of 2's of height exponential in the length of input. Until now the highest known lower bounds for natural decidable theories were at most linearly high towers of 2's and since mid-seventies it was an open problem whether natural decidable th...

Often amateurs are faced with limitations placed on the space available and the length of wire or number of wires that may be possible in a operational antenna at the shack. There is a particular class of homeowner that does not want to see a web of wires suspended between trees or supporting structures in neighboring property, or an unsightly tower adorned with multiple beam antennas in the ai...

⎯ This paper describes the Software Defined Radio (SDR) platform that is being developed and implemented in the scope of the EU 7PP Framework WHERE Project. The platform is based on one full-length PCI carrier board populated with one DSP module, one dual high-speed ADC/DAC module and one module corresponding to IF/RF front-end. It is equipped with two omnidirectional antennas working at 2.4GHz...

Our theme bases on the classical Hanoi Towers Problem. In this paper we will define a new problem, permitting some positions, that were not legal in the classical problem. Our goal is to find an optimal (shortest possible) sequence of discs' moves. Besides that, we will research all versions of 3-pegs classical problem with some special constraints, when some types of moves are disallowed.

An L(2, 1)-labeling of a graph G is equitable if the number of elements in any two color classes differ by at most one. The equitable L(2, 1)-labeling number λe(G) of G is the smallest integer k such that G has an equitable L(2, 1)-labeling. Sierpiński graphs S(n, k) generalize the Tower of Hanoi graphs—the graph S(n, 3) is isomorphic to the graph of the Tower of Hanoi with n disks. In this pap...

In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2k 1/(k−2) lower bound on the number of steps necessary for transferring n disks from one peg to another. Apart from the value of the constants Ck this bound is tight.