Search results for "routing"
showing 10 items of 587 documents
The existence of best proximity points in metric spaces with the property UC
2009
Abstract Eldred and Veeramani in [A.A. Eldred, P. Veeramani, Existence and convergence of best proximity points, J. Math. Anal. Appl., 323 (2006), 1001–1006. MR2260159] proved a theorem which ensures the existence of a best proximity point of cyclic contractions in the framework of uniformly convex Banach spaces. In this paper we introduce a notion of the property UC and extend the Eldred and Veeramani theorem to metric spaces with the property UC.
QUANTITATIVE CONVERGENCE RATES FOR SUBGEOMETRIC MARKOV CHAINS
2015
We provide explicit expressions for the constants involved in the characterisation of ergodicity of subgeometric Markov chains. The constants are determined in terms of those appearing in the assumed drift and one-step minorisation conditions. The results are fundamental for the study of some algorithms where uniform bounds for these constants are needed for a family of Markov kernels. Our results accommodate also some classes of inhomogeneous chains.
The Spanning Tree based Approach for Solving the Shortest Path Problem in Social Graphs
2016
Nowadays there are many social media sites with a very large number of users. Users of social media sites and relationships between them can be modelled as a graph. Such graphs can be analysed using methods from social network analysis (SNA). Many measures used in SNA rely on computation of shortest paths between nodes of a graph. There are many shortest path algorithms, but the majority of them suits only for small graphs, or work only with road network graphs that are fundamentally different from social graphs. This paper describes an efficient shortest path searching algorithm suitable for large social graphs. The described algorithm extends the Atlas algorithm. The proposed algorithm so…
On an iterative method for a class of integral equations of the first kind
1987
In this paper, we investigate an iterative method which has been proposed [1] for the numerical solution of a special class of integral equations of the first kind, where one of the essential assumptions is the positivity of the kernel and the given right-hand side. Integral equations of this special type occur in experimental physics, astronomy, medical tomography and other fields where density functions cannot be measured directly, but are related to observable functions via integral equations. In order to take into account the non-negativity of density functions, the proposed iterative scheme was defined in such a way that only non-negative solutions can be approximated. The first part o…
Approximation of Elliptic Hemivariational Inequalities
1999
From the previous chapter we know that there exist many important problems in mechanics in which constitutive laws are expressed by means of nonmonotone, possibly multivalued relations (nonmonotone multivalued stress-strain or reaction-displacement relations,e.g). The resulting mathematical model leads to an inclusion type problem involving multivalued nonmonotone mappings or to a substationary type problem for a nonsmooth, nonconvex superpotential expressed in terms of calculus of variation. It is the aim of this chapter to give a detailed study of a discretization of such a type of problems including the convergence analysis. Here we follow closely Miettinen and Haslinger, 1995, Miettinen…
ADI schemes for valuing European options under the Bates model
2018
Abstract This paper is concerned with the adaptation of alternating direction implicit (ADI) time discretization schemes for the numerical solution of partial integro-differential equations (PIDEs) with application to the Bates model in finance. Three different adaptations are formulated and their (von Neumann) stability is analyzed. Ample numerical experiments are provided for the Bates PIDE, illustrating the actual stability and convergence behaviour of the three adaptations.
A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector Routing Algorithms
2013
Count-to-infinity problem is characteristic for routing algorithms based on the distributed implementation of the classical Bellman-Ford algorithm. In this paper a probabilistic solution to this problem is proposed. It is argued that by the use of a Bloom Filter added to the routing message the routing loops will with high probability not form. An experimental analysis of this solution for use in Wireless Sensor Networks in practice is also included.
Collaborative Assessment of Information Provider's Reliability and Expertise Using Subjective Logic
2011
QA each user can individually estimate the expertise and the reliability of her peers using her direct interactions with them and our framework. The online SN (OSN), which can be considered as a distributed database, performs continuous data aggregation for users expertise and reliability assessment in order to reach a consensus. We emulate a Q&A SN to examine various performance aspects of our algorithm (e.g., convergence time, responsiveness etc.). Our evaluations indicate that it can accurately assess the reliability and the expertise of a user with a small number of samples and can successfully react to the latter's behavior change, provided that the cognitive traits hold in practice.
On the integration of Riemann-measurable vector-valued functions
2016
We confine our attention to convergence theorems and descriptive relationships within some subclasses of Riemann-measurable vector-valued functions that are based on the various generalizations of the Riemann definition of an integral.
A Novel Energy Model for MANETs based on Graphs with Activation Windows
2005
Energy usage optimization is still an important issue and a critical design factor for mobile ad hoc networks (MANETs). Only recently a few proposals appeared that consider energy-aware optimizations for routing protocols. In this paper we describe an analytical model for MANETs which is based on graphs with activation windows. The activation windows allow to model the on-off status of the network devices. Moreover, we propose an algorithm with pseudo-polynomial complexity, called STP algorithm (STPA), that based on the current position and state of the nodes determines the shortest time path between the source node and the destination node.