A probabilistic switch model of information flow in social networks: Application for virtual circuits to organizational design

Network building and exchange of information by people within networks is crucial to the innovation process. Contrary to older models, in social networks the flow of information is noncontinuous and nonlinear. There are critical barriers to information flow that operate in a problematic manner. New models and new analytic tools are needed for these systems. This paper introduces the concept of virtual circuits and draws on recent concepts of network modelling and design to introduce a probabilistic switch theory that can be described using matrices. It can be used to model multistep information flow between people within organisational networks, to provide formal definitions of efficient and balanced networks and to describe distortion of information as it passes along human communication channels. The concept of multi-dimensional information space arises naturally from the use of matrices. The theory and the use of serial diagonal matrices have applications to organisational design and to the modelling of other systems. It is hypothesised that opinion leaders or creative individuals are more likely to emerge at information-rich nodes in networks. A mathematical definition of such nodes is developed and it does not invariably correspond with centrality as defined by early work on networks.

Stochastic models for regulatory networks of the genetic toggle switch

Bistability arises within a wide range of biological systems from the A phage switch in bacteria to cellular signal transduction pathways in mammalian cells. Changes in regulatory mechanisms may result in genetic switching in a bistable system. Recently, more and more experimental evidence in the form of bimodal population distributions indicates that noise plays a very important role in the switching of bistable systems. Although deterministic models have been used for studying the existence of bistability properties under various system conditions, these models cannot realize cell-to-cell fluctuations in genetic switching. However, there is a lag in the development of stochastic models for studying the impact of noise in bistable systems because of the lack of detailed knowledge of biochemical reactions, kinetic rates, and molecular numbers. in this work, we develop a previously undescribed general technique for developing quantitative stochastic models for large-scale genetic regulatory networks by introducing Poisson random variables into deterministic models described by ordinary differential equations. Two stochastic models have been proposed for the genetic toggle switch interfaced with either the SOS signaling pathway or a quorum-sensing signaling pathway, and we have successfully realized experimental results showing bimodal population distributions. Because the introduced stochastic models are based on widely used ordinary differential equation models, the success of this work suggests that this approach is a very promising one for studying noise in large-scale genetic regulatory networks.

The C-terminus of Raf-1 acts as a 14-3-3-dependent activation switch

The Raf-1 protein kinase is a major activator of the ERK MAPK pathway, which links signaling by a variety of cell surface receptors to the regulation of cell proliferation, survival, differentiation and migration. Signaling by Raf-1 is regulated by a complex and poorly understood interplay between phosphorylation events and protein-protein interactions. One important mode of Raf-1 regulation involves the phosphorylation-dependent binding of 14-3-3 proteins. Here, we have examined the mechanism whereby the C-terminal 14-3-3 binding site of Raf-1, S621, controls the activation of MEK-ERK signaling. We show that phosphorylation of S621 turns over rapidly and is enriched in the activated pool of endogenous Raf-1. The phosphorylation on this site can be mediated by Raf-1 itself but also by other kinase(s). Mutations that prevent the binding of 14-3-3 proteins to S621 render Raf-1 inactive by specifically disrupting its capacity to bind to ATP, and not by gross conformational alteration as indicated by intact MEK binding. Phosphorylation of S621 correlates with the inhibition of Raf-1 catalytic activity in vitro, but 14-3-3 proteins can completely reverse this inhibition. Our findings suggest that 14-3-3 proteins function as critical cofactors in Raf-1 activation, which induce and maintain the protein in a state that is competent for both ATP binding and MEK phosphorylation.

Asymmetrical switch costs in children

Switching between tasks produces decreases in performance as compared to repeating the same task. Asymmetrical switch costs occur when switching between two tasks of unequal difficulty. This asymmetry occurs because the cost is greater when switching to the less difficult task than when switching to the more difficult task. Various theories about the origins of these asymmetrical switch costs have emerged from numerous and detailed experiments with adults. There is no documented evidence of asymmetrical switch costs in children. We conducted a series of studies that examined age-related changes in asymmetrical switch costs, within the same paradigm. Similarities in the patterns of asymmetrical switch costs between children and adults suggested that theoretical explanations of the cognitive mechanisms driving asymmetrical switch costs in adults could be applied to children. Age-related differences indicate that these theoretical explanations need to incorporate the relative contributions and interactions of developmental processes and task mastery. © 2006 Elsevier Inc. All rights reserved.

Optical grooming switch with regenerative functionality for transparent interconnection of networks

We demonstrate a regenerative optical grooming switch for buffer-less interconnection of metro/access and metro/core ring networks with switching functionality in time, space and wavelength domain. Key functionalities of the router are the traffic aggregation with time-slot interchanging (TSI) functionality, the WDM-to-ODTM multiplexing and the OTDM-to-WDM demultiplexing of high-speed channel into lower bit-rate tributaries as well as multi-wavelength all-optical 2R regeneration of several higher-speed signals. BER and Q-factor measurements of different switching scenarios show excellent performance with no error floor and Q-factors above 21 dB.

An all-optical grooming switch for interconnecting access and metro ring networks

A regenerative all-optical grooming switch for interconnecting 130 Gbit/s on-off keying (OOK) metro/core ring and 43 Gbit/s-OOK metro/access ring networks with switching functionality in time, space, and wavelength domains is demonstrated. Key functionalities of the switch are traffic aggregation with time-slot interchanging functionality, optical time division multiplexing (OTDM) to wavelength division multiplexing (WDM) demultiplexing, and multi-wavelength 2R regeneration. Laboratory and field demonstrations show the excellent performance of the new concept with error-free signal transmission and Q-factors above 20 dB.

Field experiments with a grooming switch for OTDM meshed networking

Field experiments of 42.7/128.1 Gb/s wavelength-division multiplexed, optical time-division multiplexed (WDM-OTDM) transmultiplexing and all-optical dual-wavelength regeneration at the OTDM rate are presented in this paper. By using the asynchronous retiming scheme, we achieve error-free bufferless data grooming with time-slot interchange capability for OTDM meshed networking. We demonstrate excellent performance from the system, discuss scalability, applicability, and the potential reach of the asynchronous retiming scheme for transparent OTDM-domain interconnection.

Evolutionary market agents and heterogeneous service providers:achieving desired resource allocations

In future massively distributed service-based computational systems, resources will span many locations, organisations and platforms. In such systems, the ability to allocate resources in a desired configuration, in a scalable and robust manner, will be essential.We build upon a previous evolutionary market-based approach to achieving resource allocation in decentralised systems, by considering heterogeneous providers. In such scenarios, providers may be said to value their resources differently. We demonstrate how, given such valuations, the outcome allocation may be predicted. Furthermore, we describe how the approach may be used to achieve a stable, uneven load-balance of our choosing. We analyse the system's expected behaviour, and validate our predictions in simulation. Our approach is fully decentralised; no part of the system is weaker than any other. No cooperation between nodes is assumed; only self-interest is relied upon. A particular desired allocation is achieved transparently to users, as no modification to the buyers is required.

On the Optimal Allocations in Economy with Fixed Total Resources

Здравко Д. Славов - В тази статия се разглежда математически модел на икономика с фиксирани общи ресурси, както и краен брой агенти и блага. Обсъжда се ролята на някои предположения за отношенията на предпочитание на икономическите агенти, които влияят на характеристиките на оптимално разпределените дялове. Доказва се, че множеството на оптимално разпределените дялове е свиваемо и притежава свойството на неподвижната точка.

Lexicographic allocations and extreme core payoffs: the case of assignment games

We consider various lexicographic allocation procedures for coalitional games with transferable utility where the payoffs are computed in an externally given order of the players. The common feature of the methods is that if the allocation is in the core, it is an extreme point of the core. We first investigate the general relationship between these allocations and obtain two hierarchies on the class of balanced games. Secondly, we focus on assignment games and sharpen some of these general relationship. Our main result is the coincidence of the sets of lemarals (vectors of lexicographic maxima over the set of dual coalitionally rational payoff vectors), lemacols (vectors of lexicographic maxima over the core) and extreme core points. As byproducts, we show that, similarly to the core and the coalitionally rational payoff set, also the dual coalitionally rational payoff set of an assignment game is determined by the individual and mixed-pair coalitions, and present an efficient and elementary way to compute these basic dual coalitional values. This provides a way to compute the Alexia value (the average of all lemacols) with no need to obtain the whole coalitional function of the dual assignment game.