Search results for: FIBONACCI NUMBER
-
New Proofs of Some Fibonacci Identities
PublicationLucas proved in 1876 several identities for Fibonacci numbers. We give elementary and short proofs of them.
-
Calculation Program Supporting Switched Capacitor DC-DC Charge Pump Design (CP Design Calculator) - PartI: Preface
PublicationPrzedmiot badań i motywy podjęcia pracy. Metoda badawcza. Nota historyczna nt. konwertera Fibonacciego (Fibonacci multiplier) i pompy ładunkowej Makowskiego ("Makowski charge pump"). Przewidywane cele pracy. Podziękowania
-
A Canonical Switched Capacitor DC-DC Converter. A look at how the historical SC synthesis problem is getting solved
PublicationWe reconsider a solution to the historical problem in switched capacitor (SC) DC-DC converter synthesis. Specifically, we retackle the problem of constructing an SC twophase network realizing arbitrary voltage conversion ratio within rational bounds defined. Theoretical foundations are available in our earlier research [3] where a nonconstructive proof of existence was given. We briefly review and comment on known circuit solutions...
-
Development and tuning of irregular divide-and-conquer applications in DAMPVM/DAC
PublicationThis work presents implementations and tuning experiences with parallel irregular applications developed using the object oriented framework DAM-PVM/DAC. It is implemented on top of DAMPVM and provides automatic partitioning of irregular divide-and-conquer (DAC) applications at runtime and dynamic mapping to processors taking into account their speeds and even loads by other user processes. New implementations of parallel applications...
-
Parity vertex colouring of graphs
PublicationA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...