Results 1  10
of
3,098
Rapid Convergence to Feature Layer Correspondences
"... We describe a neural network able to rapidly establish correspondence between neural feature layers. Each of the network’s two layers consists of interconnected cortical columns and each column consists of inhibitorily coupled subpopulations of excitatory neurons. The dynamics of the system builds ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We describe a neural network able to rapidly establish correspondence between neural feature layers. Each of the network’s two layers consists of interconnected cortical columns and each column consists of inhibitorily coupled subpopulations of excitatory neurons. The dynamics of the system
RAPIDLY CONVERGING EXPANSIONS WITH FIBONACCI COEFFICIENTS
, 1984
"... Properties of Fibonacci numbers have been known for a very long time. Their origin dates back to the year 1202 with the publication of the Liber Abaci by the Italian mathematician Leonardo of Pisa, better known to us by the nickname "Fibonacci, " a short form of Filius Bonacci, meaning &qu ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Properties of Fibonacci numbers have been known for a very long time. Their origin dates back to the year 1202 with the publication of the Liber Abaci by the Italian mathematician Leonardo of Pisa, better known to us by the nickname "Fibonacci, " a short form of Filius Bonacci, meaning "Son of Bonacci." Fibonacci seems to have had a sense of humor apart from his mathematical talents: Liber was a Latin God, son of Ceres and brother of Proserpina. The Romans assimilated this God to Bacchus or Dyonisus, the Greek god of wine. Festivals, known as "Liberalia, " were celebrated every year honoring Liber Bacus. Since Liber Abaci means Book of the Abacus * Fibonacci may have amused himself by naming his book, at a time of strong domination by the Roman Catholic Church, in a way reminiscent of a pagan god of wine and fertility. We know Fibonacci was fond of play on words. For instance, he signed some of his work "Leonardo Bigollo. " Bigollo is a work meaning both "traveler, " which Fibonacci certainly was, and "blockhead. " It has been said that Fibonacci had in mind the latter meaning to tease his contemporaries who had ridiculed him for his interest in HinduArabic numerals and methods. Fibonacci had become a very successful mathematician whith these methods. Fibonacci did not discover any of the properties of the sequence which bears his name. He simply proposed, and solved, in the Liber Abaci * the problem of how many rabbits would be born in one year starting from a given pair. With some natural assumptions about the breeding habits of rabbits, the population of rabbit pairs per month correspond to the elements of the Fibonacci sequence— 1, 1, 2, 3, 4, 8, 13, etc.—where, beginning with zero and one, each term of the sequence is the sum of the two preceding ones. With the passage of time, this sequence would appear in so many areas with no possible connection to the breeding of rabbits that, in 1877, Edward Lucas proposed naming it Fibonacci Sequence and its terms Fibonacci Numbers. The fertility of this sequence seems to be inexhaustible, and every year new and curious properties of it are discovered. Fn has become the standard symbol for Fibonacci numbers, and their defining relation is F = F n + F o9 Fn = 0, F1 = 1. n n \ n2 s
RAPIDLY CONVERGING APPROXIMATIONS AND REGULARITY THEORY
, 906
"... Abstract. We consider distributions on a closed compact manifold M as maps on smoothing operators. Thus spaces of maps between Ψ − ∞ (M) → C ∞ (M) are considered as generalized functions. For any collection of regularizing processes we produce an algebra of generalized functions and a diffeomorphis ..."
Abstract
 Add to MetaCart
Abstract. We consider distributions on a closed compact manifold M as maps on smoothing operators. Thus spaces of maps between Ψ − ∞ (M) → C ∞ (M) are considered as generalized functions. For any collection of regularizing processes we produce an algebra of generalized functions and a diffeomorphism equivariant embedding of distributions into this algebra. We provide examples invariant under certain group actions. The regularity for such generalized functions is provided in terms of a certain tameness of maps between graded Frechét spaces. This notion of regularity implies the regularity in Colombeau algebras in the G ∞ sense. 1.
Rapidly convergent spectral representations for periodic Green functions
"... Spectral representations for the Green function for 2D and 3D configurations with 1D periodicities are introduced. The representations rely on the expansion of the Green function in terms of the continuous longitudinal spectrum. These representations allow obtaining the Green functions in terms of a ..."
Abstract
 Add to MetaCart
of a small number of direct source contributions, a small number of pole (Floquet mode) contributions, and a rapidly convergent integral that can be evaluated using quadrature rules with a small number of nodes. The presented schemes work seamlessly even for small/vanishing sourceobserver separations
On A Rapidly Converging Series For The Riemann Zeta Function
"... To evaluate Riemann’s zeta function is important for many investigations related to the area of number theory, and to have quickly converging series at hand in particular. We investigate a class of summation formulae and find, as a special case, a new proof of a rapidly converging series for the Rie ..."
Abstract
 Add to MetaCart
To evaluate Riemann’s zeta function is important for many investigations related to the area of number theory, and to have quickly converging series at hand in particular. We investigate a class of summation formulae and find, as a special case, a new proof of a rapidly converging series
The Ant System: Optimization by a colony of cooperating agents
 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICSPART B
, 1996
"... An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call Ant System. We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation ..."
Abstract

Cited by 1300 (46 self)
 Add to MetaCart
computation, and the use of a constructive greedy heuristic. Positive feedback accounts for rapid discovery of good solutions, distributed computation avoids premature convergence, and the greedy heuristic helps find acceptable solutions in the early stages of the search process. We apply the proposed
RAPIDLYCONVERGING METHODS FOR SOLVING MULTILEVEL TRANSFER PROBLEMS
"... It is well known that lambda iterations can be used to solve multilevel nonLTE transfer equations in a reasonable number of iterations when the lambda operator is preconditioned, e.g., when the diagonal part of the operator is combined with other terms analytically. This approach is currently used ..."
Abstract
 Add to MetaCart
in this way. Here we show that 1) a hybrid approach involving such a direct solution for a few of the strongest transitions, and lambda iterations for the rest, gives rapid convergence, often with oscillations that need to be damped, and 2) this approach should include preconditioning of the lambda operator
Energy Conserving Routing in Wireless Adhoc Networks
, 2000
"... An adhoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
An adhoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
to converge if none of the beliefs in successive iterations changed by more than a small threshold (104). All messages were initialized to a vector of ones; random initializa tion yielded similar results, since the initial conditions rapidly get "washed out" . For comparison, we also implemented
A VERY RAPIDLY CONVERGENT PRODUCT EXPANSION FOR pi
, 1983
"... There has recently been considerable interest in an essentially quadratic method for computing n. The algorithm, first suggested by Salamin [6], is based upon an identity known to Gauss [3, p. 377], [4]. This iteration has been used by two Japanese researchers, Y. Tamura and Y. Kanada, to compute 2 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
VERY RAPIDLY CONVERGENT PRODUCT EXPANSION FOR 7 ~ 539 We observe that xn in (1) is actually Legendre's form of the AGM iteration for the ratio of the arithmetic to the geometric mean [4], while (2) represents a shifted "derivative " mean. Thus we see that the number of correct digits
Results 1  10
of
3,098