Search results for "routing"
showing 10 items of 587 documents
Reaction-diffusion on dynamic inhibition areas: A bio-inspired link scheduling algorithm
2014
We present the Dynamic Inhibition Areas Reaction-Diffusion (DIA-RD) algorithm, a distributed medium access control protocol that globally maximizes the spatial reusability (number of simultaneous transmissions per unit area) of wireless sensor networks. This algorithm is able, in consequence, to minimize the number of time slots needed to schedule the set of demanded links, making it very efficient to solve the Shortest Link Schedule problem. DIA-RD combines accurate interference management, provided by the use of dynamic inhibition areas based on the physical interference model; and global intelligent behavior, provided by the bio-inspired technique known as Reaction-Diffusion. This techni…
Postprocessing of a Finite Element Scheme with Linear Elements
1987
In this contribution we first give a brief survey of postprocessing techniques for accelerating the convergence of finite element schemes for elliptic problems. We also generalize a local superconvergence technique recently analyzed by Křižek and Neittaanmaki ([20]) to a global technique. Finally, we show that it is possible to obtain O(h4) accuracy for the gradient in some cases when only linear elements are used. Numerical tests are presented.
The PCHIP subdivision scheme
2016
In this paper we propose and analyze a nonlinear subdivision scheme based on the monotononicity-preserving third order Hermite-type interpolatory technique implemented in the PCHIP package in Matlab. We prove the convergence and the stability of the PCHIP nonlinear subdivision process by employing a novel technique based on the study of the generalized Jacobian of the first difference scheme. MTM2011-22741
Dynamic routing-and-inventory problems: a review
1998
The paper presents a review of the available literature on a class of problems denoted as dynamic routing-and-inventory (DRAI) problems. They are characterized by the simultaneous relevance of routing and of inventory issues in a dynamic environment, within the framework of distribution logistics. A classification scheme is first proposed for these problems. Then the results obtained in this area are summarized. Finally, the papers available in the literature are clustered and discussed according to the proposed scheme.
A Learning Automata Local Contribution Sampling Applied to Hydropower Production Optimisation
2017
Learning Automata (LA) is a powerful approach for solving complex, non-linear and stochastic optimisation problems. However, existing solutions struggle with high-dimensional problems due to slow convergence, arguably caused by the global nature of feedback. In this paper we introduce a novel Learning Automata (LA) scheme to attack this challenge. The scheme is based on a parallel form of Local Contribution Sampling (LCS), which means that the LA receive individually directed feedback, designed to speed up convergence. Furthermore, our scheme is highly decentralized, allowing parallel execution on GPU architectures. To demonstrate the power of our scheme, the LA LCS is applied to hydropower…
A Cognitive-based scheme for user reliability and expertise assessment in Q&A social networks
2011
Q&A social media has gained a great deal of attention during recent years. People rely on these sites to obtain information due to the number of advantages they offer as compared to conventional sources of knowledge (e.g., asynchronous and convenient access). However, for the same question one may find highly contradictory answers, causing ambiguity with respect to the correct information. This can be attributed to the presence of unreliable and/or non-expert users. In this work, we propose a novel approach for estimating the reliability and expertise of a user based on human cognitive traits. Every user can individually estimate these values based on local pairwise interactions. We examine…
Moment Generating Functions and Central Moments
2018
This section deals with the moment generating functions (m.g.f.) up to sixth order of some discretely defined operators. We mention the m.g.f. and express them in expanded form to obtain moments, which are important in the theory of approximation relevant to problems of convergence.
Timbre Similarity: Convergence of Neural, Behavioral, and Computational Approaches
1998
The present study compared the degree of similarity of timbre representations as observed with brain recordings, behavioral studies, and computer simulations. To this end, the electrical brain activity of subjects was recorded while they were repetitively presented with five sounds differing in timbre. Subjects read simultaneously so that their attention was not focused on the sounds. The brain activity was quantified in terms of a change-specific mismatch negativity component. Thereafter, the subjects were asked to judge the similarity of all pairs along a five-step scale. A computer simulation was made by first training a Kohonen self-organizing map with a large set of instrumental sounds…
A class of quasi-Newton generalized Steffensen methods on Banach spaces
2002
AbstractWe consider a class of generalized Steffensen iterations procedure for solving nonlinear equations on Banach spaces without any derivative. We establish the convergence under the Kantarovich–Ostrowski's conditions. The majorizing sequence will be a Newton's type sequence, thus the convergence can have better properties. Finally, a numerical comparation with the classical methods is presented.
On Γ-convergence of pairs of dual functionals
2011
Abstract The paper considers a slightly modified notion of the Γ-convergence of convex functionals in uniformly convex Banach spaces and establishes that under standard coercitivity and growth conditions the Γ-convergence of a sequence of functionals { F j } to F ˜ implies that the corresponding sequence of dual functionals { F j ⁎ } converges in an analogous sense to the dual to F ˜ functional F ˜ ⁎ .