Search results for "kl"

On Weakly Locally Uniformly Rotund Banach Spaces

1999

Abstract We show that every normed space E with a weakly locally uniformly rotund norm has an equivalent locally uniformly rotund norm. After obtaining a σ -discrete network of the unit sphere S E for the weak topology we deduce that the space E must have a countable cover by sets of small local diameter, which in turn implies the renorming conclusion. This solves a question posed by Deville, Godefroy, Haydon, and Zizler. For a weakly uniformly rotund norm we prove that the unit sphere is always metrizable for the weak topology despite the fact that it may not have the Kadec property. Moreover, Banach spaces having a countable cover by sets of small local diameter coincide with the descript…

Common Fixed Point Theorems for Weakly Compatible Maps Satisfying a General Contractive Condition

2008

We introduce a new generalized contractive condition for four mappings in the framework of metric space. We give some common fixed point results for these mappings and we deduce a fixed point result for weakly compatible mappings satisfying a contractive condition of integral type.

On Branciari’s theorem for weakly compatible mappings

2010

AbstractIn a recent paper B. Samet and H. Yazidi [B. Samet, H. Yazidi, An extension of Banach fixed point theorem for mappings satisfying a contractive condition of integral type, Ital. J. Pure Appl. Math. (in press)] have obtained an interesting theorem for mappings satisfying a contractive condition of integral type. The aim of this note is to present a generalization of their main result.

Fixed points of weakly compatible mappings satisfying generalized $\varphi$-weak contractions

2014

In this paper, utilizing the notion of the common limit range property, we prove some new integral type common fixed point theorems for weakly compatible mappings satisfying a \(\varphi \)-weak contractive condition in metric spaces. Moreover, we extend our results to four finite families of self mappings, and furnish an illustrative example and an application to support our main theorem. Our results improve, extend, and generalize well-known results on the topic in the literature.

Common fixed point theorems for families of occasionally weakly compatible mappings

2011

We prove some common fixed point theorems in probabilistic semi-metric spaces for families of occasionally weakly compatible mappings. We also give a common fixed point theorem for mappings satisfying an integral-type implicit relation.

Coincidence and fixed points for contractions and cyclical contractions in partial metric spaces

2012

Abstract We prove some coincidence and common fixed point results for three mappings satisfying a generalized weak contractive condition in ordered partial metric spaces. As application of the presented results, we give a unique fixed point result for a mapping satisfying a weak cyclical contractive condition. We also provide some illustrative examples. MSC:47H10, 54H25.

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…

Discrete variables structural design of frames safe against buckling

2014

Potential implementation of reservoir computing models based on magnetic skyrmions

2018

Reservoir Computing is a type of recursive neural network commonly used for recognizing and predicting spatio-temporal events relying on a complex hierarchy of nested feedback loops to generate a memory functionality. The Reservoir Computing paradigm does not require any knowledge of the reservoir topology or node weights for training purposes and can therefore utilize naturally existing networks formed by a wide variety of physical processes. Most efforts prior to this have focused on utilizing memristor techniques to implement recursive neural networks. This paper examines the potential of skyrmion fabrics formed in magnets with broken inversion symmetry that may provide an attractive phy…

Risinājuma izveide tīkla iestatījumu konfigurēšanai Docker virtualizācijas platformā reāllaika komunikāciju programmatūras testēšanai

2020

Bakalaura darbā “Risinājuma izveide tīkla iestatījumu konfigurēšanai Docker virtualizācijas platformā reāllaika komunikāciju programmatūras testēšanai” darba autors veiksmīgi izveidojis risinājumu reāllaika komunikāciju programmatūras testēšanai degradētos tīkla apstākļos Docker konteinerī. Darbs sadalīts 5 nodaļās. Pirmajā nodaļā aprakstīta virtualizācijas darbība un aplūkota Docker virtualizācijas platformas arhitektūra. Otrajā nodaļā izpētītas tīkla kvalitāti raksturojošas metrikas, kas ir nozīmīgas reāllaika komunikācijas programmatūrai, kā arī aplūkotas Traffic Control un iptables utilītprogrammas tīkla iestatījumu konfigurēšanai Linux operētājsistēmā. Trešajā nodaļā aplūkoti reāllaika…