We use the theoretical premises of balance theory to conceptualize stability and explain how stability develops in buyer-service provider-customer service triads. We question the prevalent assumption of balanced to be stable and establish a fine distinction. We also conceptualize three key drivers of stability, namely, trust, dominance and opportunistic collaboration.

We look at the continuum limit of the two universal predictions of the hadronic string theory namely the Lüscher term and the energy difference between successive energy states in three dimensional SU(2) lattice gauge theory using Wilson loops and Polyakov loop correlators. We also compare our simulation data with the theoretical predictions in [10].

Conjugacy separability of any group of the class of one-relator groups given by the presentation a, b; a m , b n 1m, n > 1 is proven. The proof made used of theoretical combinatorial group methods, namely the structure of amalgamated free products and some properties of the subgroups and quotients of any group of the class of one-relator groups given above.

Group theoretical arguments combined with normal mode analysis techniques are applied to a coarse-grained approximation of icosahedral viral capsids which incorporates areas of variable flexibility. This highlights a remarkable structure of the low-frequency spectrum in this approximation, namely the existence of a plateau of 24 near zero-modes with universal group theory content.

This paper clarifies the method described in our previous paper (DOI: 978-3-319-02726-5 21), namely rainbow distinguished point method, and give revised theoretical and experimental results which shows rainbow distinguished point method behaves inferiorly to other time memory tradeoff methods.

This is a framework for resource allocation in a heterogeneous system composed of various access networks, for instance Third Generation wireless networks (3G) and WLAN, in the presence of multimedia traffic, namely voice and data. Our aim is to present a game theoretical modeling of routing and loadbalancing strategies along with admission control and pricing in cooperative and non-cooperative...

In this primarily expository paper, we discuss the connections between two popular and useful tools in theoretical computer science, namely, universal hashing and pairwise independent random variables ; and classical combinatorial stuctures such as error-correcting codes, balanced incomplete block designs, diierence matrices and orthogonal arrays.

We argue that taking surprise into account in the artificial agents’s reasoning may have advantageous implications in various situations. Relying on theoretical and empirical evidence, our arguments are supported by the application of surprise-based agents to three different domains, namely exploration of unknown environments, divergent production and evaluation of creative products, and select...

This chapter focuses on real-world applications of fuzzy techniques for information retrieval and data mining. It gives a presentation of the theoretical background common to all applications, lying on two main elements: the concept of similarity and the fuzzy machine learning framework. It then describes a panel of real-world applications covering several domains namely medical, educational, c...

Dynamic heterogeneity in glass formers has been related to their static structure using the concept of dynamic propensity. We reexamine this relationship by analyzing dynamical fluctuations in two atomistic glass formers and two theoretical models. We introduce quantitative statistical indicators which show that the dynamics of individual particles cannot be predicted on the basis of the propen...