Combinatorial properties of the multi-peg Tower of Hanoi problem on n discs and p pegs are studied. Top-maps are introduced as maps which reflect topmost discs of regular states. We study these maps from several points of view. We also count the number of edges in graphs of the multi-peg Tower of Hanoi problem and in this way obtain some combinatorial identities.

In recent years the Federal Aviation Administration (FAA) has made reduction of runway incursions a priority for surface operations throughout the national airspace system. In a series of experiments conducted in April 2001, NASA studied alternatives designed to improve the efficient movement of surface traffic and reduce runway incursions at Los Angeles International Airport (LAX). The experim...

Recently, there has been increased interest in moving the RF electronics in basestations from the bottom of the tower to the top, yielding improved power efficiencies and reductions in infrastructural costs. Tower-top systems have faced resistance in the past due to such issues as increased weight, size, and poor potential reliability. However, modern advances in reducing the size and complexit...

he present paper deals with the study of static and dynamic analysis of transmission line tower (X type of bracing system). A typical type of transmission line tower carrying 220KV single circuit conductor is chosen as case study existing in bijapur district. The analysis and modeling of tower is carried out using FE based ANSYS software. The model is created in CATIA and then imported to ANSYS...

In order to locate a 150m wind monitoring tower to measure the wind characteristics, we investigated the site near Paradip, Odisha (India) to locate wind tower and collected some wind data to incorporate into the design of tubular steel tower. This paper seeks to understand the design of tubular steel tower and its performance parameter up to 150m height, also it provides the stability analysis...

Procedurally reeective programming languages enable user programs to semantically extend the language itself, by permitting them to run at the level of the language implementation with access to their context. The reeective tower, rst introduced by Brian Smith 9, 10], is the principal architecture for such languages. It is informally described as an innnitely ascending tower of meta-circular in...

Procedurally re ective programming languages enable user programs to semantically extend the language itself, by permitting them to run at the level of the language implementation with access to their context. The re ective tower, rst introduced by Brian Smith [9, 10], is the principal architecture for such languages. It is informally described as an in nitely ascending tower of meta-circular i...