نتایج جستجو برای: guyed tower

تعداد نتایج: 10002  

2009
Ralf Hinze

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.

Journal: :روش های عددی در مهندسی (استقلال) 0
علی نوری a. nouri

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...

Journal: :CoRR 2006
Sergey Benditkis Ilya Safro

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.

Journal: :Australasian J. Combinatorics 2010
Hong-Yong Fu Dezheng Xie

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...

1999
Mario Szegedy

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.

Journal: :Entropy 2015
Alexey B. Nadykto Jason Herb Fangqun Yu Yisheng Xu Ekaterina S. Nazarenko

Amines, organic derivatives of NH3, are important common trace atmospheric species that can enhance new particle formation in the Earth’s atmosphere under favorable conditions. While methylamine (MA), dimethylamine (DMA) and trimethylamine (TMA) all efficiently enhance binary nucleation, MA may represent the lower limit of the enhancing effect of amines on atmospheric nucleation. In the present...

2014
Zili Zhang Søren R. K. Nielsen Frede Blaabjerg Dao Zhou

Lateral tower vibrations of offshore wind turbines are normally lightly damped, and large amplitude vibrations induced by wind and wave loads in this direction may significantly shorten the fatigue life of the tower. This paper proposes the modeling and control of lateral tower vibrations in offshore wind turbines using active generator torque. To implement the active control algorithm, both th...

2001
C. Snyder

is called the 2-class field tower of k. If n is the minimal integer such that kn = kn+1, then n is called the length of the tower. If no such n exists, then the tower is said to be of infinite length. At present there is no known decision procedure to determine whether or not the (2-)class field tower of a given field k is infinite. However, it is known by group theoretic results (see [2]) that...

2012
Jasmin Fisher Nir Piterman Moshe Y. Vardi

We draw an analogy between biology and computer hardware systems and argue for the need of a tower of abstractions to tame complexity of living systems. Much like in hardware design, where engineers use a tower of abstractions to produce the most complex man-made systems, we stress that in reverse engineering of biological systems; only by using a tower of abstractions we would be able to under...

2003
Iwan M. Duursma Bjorn Poonen Michael Zieve

We construct a tower of function fields F0 ⊂ F1 ⊂ . . . over a finite field such that every place of every Fi ramifies in the tower and lim genus(Fi)/[Fi : F0] <∞. We also construct a tower in which every place ramifies and limNFi/[Fi : F0] > 0, where NFi is the number of degree-1 places of Fi. These towers answer questions posed by Stichtenoth at Fq7.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید