Displaying similar documents to “A scheme of resource allocation and stability for peer-to-peer file-sharing networks”

Local stability conditions for discrete-time cascade locally recurrent neural networks

Krzysztof Patan (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper deals with a specific kind of discrete-time recurrent neural network designed with dynamic neuron models. Dynamics are reproduced within each single neuron, hence the network considered is a locally recurrent globally feedforward. A crucial problem with neural networks of the dynamic type is stability as well as stabilization in learning problems. The paper formulates local stability conditions for the analysed class of neural networks using Lyapunov's first method. Moreover,...

Stability analysis and absolute synchronization of a three-unit delayed neural network

Lin Jun Wang, You Xiang Xie, Zhou Chao Wei, Jian Peng (2015)

Kybernetika

Similarity:

In this paper, we consider a three-unit delayed neural network system, investigate the linear stability, and obtain some sufficient conditions ensuring the absolute synchronization of the system by the Lyapunov function. Numerical simulations show that the theoretically predicted results are in excellent agreement with the numerically observed behavior.

Local analysis of hybrid systems on polyhedral sets with state-dependent switching

John Leth, Rafael Wisniewski (2014)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper deals with stability analysis of hybrid systems. Various stability concepts related to hybrid systems are introduced. The paper advocates a local analysis. It involves the equivalence relation generated by reset maps of a hybrid system. To establish a tangible method for stability analysis, we introduce the notion of a chart, which locally reduces the complexity of the hybrid system. In a chart, a hybrid system is particularly simple and can be analyzed with the use of methods...

Anycasting in connection-oriented computer networks: Models, algorithms and results

Krzysztof Walkowiak (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

Our discussion in this article centers around various issues related to the use of anycasting in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many transmission to deliver a packet to one of many hosts. Anycasting can be applied if the same content is replicated over many locations in the network. Examples of network techniques that apply anycasting are Content Delivery Networks (CDNs), Domain Name Service (DNS), Peer-to-Peer (P2P) systems. The role of...