Synthesis and characterization of star polymers and cross-linked star polymer model networks containing a novel, silicon-based, hydrolyzable cross-linker

An acid-labile dimethacrylate cross-linker, dimethyldi(methacryloyloxy-l-ethoxy)silane (DMDMAES), was synthesized by the reaction of 2-hydroxyethyl methacrylate (HEMA) and dichlorodimethylsilane in the presence of triethylamine. Group transfer polymerization (GTP) was employed to use this cross-linker in the preparation of six hydrolyzable polymer structures: one neat cross-linker network, one randomly cross-linked network of methyl methacrylate (MMA), two star-shaped polymers of MMA, and two cross-linked star polymer model networks (CSPMNs) of MMA. A nonhydrolyzable CSPMN of MMA, based on a stable cross-linker, was also synthesized. Gel permeation chromatography (GPC) in tetrahydrofuran (THF) confirmed the narrow molecular weight distributions (MWDs) of the linear polymer precursors and demonstrated the increase in molecular weight (MW) upon each successive addition of cross-linker or monomer. Characterization by static light scattering (SLS) and GPC showed that star polymers with DMDMAES cores bear a relatively small number of arms, around 7. All star polymers and polymer networks were hydrolyzed using hydrochloric acid in THF. While the MWs of the products from the hydrolysis of the star polymers, the neat cross-linker network, and the randomly cross-linked network were as expected, those from the CSPMNs were of a much higher than expected MW, indicating extensive star-star coupling.

Edge-preserving self-healing: Keeping network backbones densely connected

Healing algorithms play a crucial part in distributed peer-to-peer networks where failures occur continuously and frequently. Whereas there are approaches for robustness that rely largely on built-in redundancy, we adopt a responsive approach that is more akin to that of biological networks e.g. the brain. The general goal of self-healing distributed graphs is to maintain certain network properties while recovering from failure quickly and making bounded alterations locally. Several self-healing algorithms have been suggested in the recent literature [IPDPS'08, PODC'08, PODC'09, PODC'11]; they heal various network properties while fulfilling competing requirements such as having low degree increase while maintaining connectivity, expansion and low stretch of the network. In this work, we augment the previous algorithms by adding the notion of edge-preserving self-healing which requires the healing algorithm to not delete any edges originally present or adversarialy inserted. This reflects the cost of adding additional edges but more importantly it immediately follows that edge preservation helps maintain any subgraph induced property that is monotonic, in particular important properties such as graph and subgraph densities. Density is an important network property and in certain distributed networks, maintaining it preserves high connectivity among certain subgraphs and backbones. We introduce a general model of self-healing, and introduce xheal+, an edge-preserving version of xheal[PODC'11]. © 2012 IEEE.

Partial least squares model for dynamic rating of overhead line in wind intensive areas based on field measurements

This paper presents a statistical model for the thermal behaviour of the line model based on lab tests and field measurements. This model is based on Partial Least Squares (PLS) multi regression and is used for the Dynamic Line Rating (DLR) in a wind intensive area. DLR provides extra capacity to the line, over the traditional seasonal static rating, which makes it possible to defer the need for reinforcement the existing network or building new lines. The proposed PLS model has a number of appealing features; the model is linear, so it is straightforward to use for predicting the line rating for future periods using the available weather forecast. Unlike the available physical models, the proposed model does not require any physical parameters of the line, which avoids the inaccuracies resulting from the errors and/or variations in these parameters. The developed model is compared with physical model, the Cigre model, and has shown very good accuracy in predicting the conductor temperature as well as in determining the line rating for future time periods. 

Efficient Network in Player and Partner Heterogeneity Models

This paper characterizes efficient networks in player and partner heterogeneity models for both the one-way flow and the two-way flow models. Player (partner) dependent network formation allows benefits and costs to be player (partner) heterogeneous which is an important extension for modeling social networks in the real world. Employing widely used assumptions, I show that efficient networks in the two way flow model are minimally connected and have star or derivative of star type architectures, whereas efficient networks in the one way flow model have wheel architectures.

A statistical characterization of on–body fading using the shadowed k–µ fading model

In this paper we investigate the received signal characteristics of on-body communications channels at 2.45 GHz. The hypothetical body area network configuration considered a transmitter node situated on the person’s left waist and receiving nodes positioned on the head, knee and wrist of the person’s right side. The on-body channel measurements were performed in both anechoic and reverberant environments while the person was moving. It was found that the recently proposed shadowed κ‒μ fading model provided an excellent fit to the measured data.

Human body shadowing in cellular device-to-device communications: channel modeling using the shadowed κ−μ fading model

Using device-to-device communications as an underlay for cellular communications will provide an exciting opportunity to increase network capacity as well as improving spectral efficiency. The unique geometry of device-to-device links, where user equipment is often held or carried at low elevation and in close proximity to the human body, will mean that they are particularly susceptible to shadowing events caused not only by the local environment but also by the user's body. In this paper, the shadowed κ - μ fading model is proposed, which is capable of characterizing shadowed fading in wireless communication channels. In this model, the statistics of the received signal are manifested by the clustering of multipath components. Within each of these clusters, a dominant signal component with arbitrary power may exist. The resultant dominant signal component, which is formed by the phasor addition of these leading contributions, is assumed to follow a Nakagami- m distribution. The probability density function, moments, and the moment-generating function are also derived. The new model is then applied to device-to-device links operating at 868 MHz in an outdoor urban environment. It was found that shadowing of the resultant dominant component can vary significantly depending upon the position of the user equipment relative to the body and the link geometry. Overall, the shadowed κ - μ fading model is shown to provide a good fit to the field data as well as providing a useful insight into the characteristics of the received signal.

AGWAN: A Generative Model for Labelled, Weighted Graphs

Real-world graphs or networks tend to exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Much effort has been directed into creating realistic and tractable models for unlabelled graphs, which has yielded insights into graph structure and evolution. Recently, attention has moved to creating models for labelled graphs: many real-world graphs are labelled with both discrete and numeric attributes. In this paper, we presentAgwan (Attribute Graphs: Weighted and Numeric), a generative model for random graphs with discrete labels and weighted edges. The model is easily generalised to edges labelled with an arbitrary number of numeric attributes. We include algorithms for fitting the parameters of the Agwanmodel to real-world graphs and for generating random graphs from the model. Using real-world directed and undirected graphs as input, we compare our approach to state-of-the-art random labelled graph generators and draw conclusions about the contribution of discrete vertex labels and edge weights to graph structure.

Two-Stage Orthogonal Least Squares Methods for Neural Network Construction

A number of neural networks can be formulated as the linear-in-the-parameters models. Training such networks can be transformed to a model selection problem where a compact model is selected from all the candidates using subset selection algorithms. Forward selection methods are popular fast subset selection approaches. However, they may only produce suboptimal models and can be trapped into a local minimum. More recently, a two-stage fast recursive algorithm (TSFRA) combining forward selection and backward model refinement has been proposed to improve the compactness and generalization performance of the model. This paper proposes unified two-stage orthogonal least squares methods instead of the fast recursive-based methods. In contrast to the TSFRA, this paper derives a new simplified relationship between the forward and the backward stages to avoid repetitive computations using the inherent orthogonal properties of the least squares methods. Furthermore, a new term exchanging scheme for backward model refinement is introduced to reduce computational demand. Finally, given the error reduction ratio criterion, effective and efficient forward and backward subset selection procedures are proposed. Extensive examples are presented to demonstrate the improved model compactness constructed by the proposed technique in comparison with some popular methods.

Platform Competition as Network Contestability

Recent research in industrial organisation has investigated the essential place that middlemen have in the networks that make up our global economy. In this paper we attempt to understand how such middlemen compete with each other through a game theoretic analysis using novel techniques from decision-making under ambiguity.
We model a purposely abstract and reduced model of one middleman who provides a two-sided platform, mediating surplus-creating interactions between two users. The middleman evaluates uncertain outcomes under positional ambiguity, taking into account the possibility of the emergence of an alternative middleman offering intermediary services to the two users.
Surprisingly, we find many situations in which the middleman will purposely extract maximal gains from her position. Only if there is relatively low probability of devastating loss of business under competition, the middleman will adopt a more competitive attitude and extract less from her position.

Local Conventions in Game Play in an Evolving Dual Social Network Framework

People usually perform economic interactions within the social setting of a small group, while they obtain relevant information from a broader source. We capture this feature with a dynamic interaction model based on two separate social networks. Individuals play a coordination game in an interaction network, while updating their strategies using information from a separate influence network through which information is disseminated. In each time period, the interaction and influence networks co-evolve, and the individuals’ strategies are updated through a modified naive learning process. We show that both network structures and players’ strategies always reach a steady state, in which players form fully connected groups and converge to local conventions. We also analyze the influence exerted by a minority group of strongly opinionated players on these outcomes.

A novel radial basis function neural network principal component analysis scheme for PMU-based wide-area power system monitoring

A novel model-based principal component analysis (PCA) method is proposed in this paper for wide-area power system monitoring, aiming to tackle one of the critical drawbacks of the conventional PCA, i.e. the incapability to handle non-Gaussian distributed variables. It is a significant extension of the original PCA method which has already shown to outperform traditional methods like rate-of-change-of-frequency (ROCOF). The ROCOF method is quick for processing local information, but its threshold is difficult to determine and nuisance tripping may easily occur. The proposed model-based PCA method uses a radial basis function neural network (RBFNN) model to handle the nonlinearity in the data set to solve the no-Gaussian issue, before the PCA method is used for islanding detection. To build an effective RBFNN model, this paper first uses a fast input selection method to remove insignificant neural inputs. Next, a heuristic optimization technique namely Teaching-Learning-Based-Optimization (TLBO) is adopted to tune the nonlinear parameters in the RBF neurons to build the optimized model. The novel RBFNN based PCA monitoring scheme is then employed for wide-area monitoring using the residuals between the model outputs and the real PMU measurements. Experimental results confirm the efficiency and effectiveness of the proposed method in monitoring a suite of process variables with different distribution characteristics, showing that the proposed RBFNN PCA method is a reliable scheme as an effective extension to the linear PCA method.

Artificial Neural Network for Compositional Ionic Liquid Viscosity Prediction

Being a new generation of green solvents and high-tech reaction media of the future, ionic liquids have increasingly attracted much attention. Of particular interest in this context are room temperature ionic liquids (in short as ILs in this paper). Due to the relatively high viscosity, ILs is expected to be used in the form of solvent diluted mixture with reduced viscosity in industrial application, where predicting the viscosity of IL mixture has been an important research issue. Different IL mixture and many modelling approaches have been investigated. The objective of this study is to provide an alternative model approach using soft computing technique, i.e., artificial neural network (ANN) model, to predict the compositional viscosity of binary mixtures of ILs [C _n-mim][NTf ₂] with n=4, 6, 8, 10 in methanol and ethanol over the entire range of molar fraction at a broad range of temperatures from T=293.0-328.0K. The results show that the proposed ANN model provides alternative way to predict compositional viscosity successfully with highly improved accuracy and also show its potential to be extensively utilized to predict compositional viscosity taking account of IL alkyl chain length, as well as temperature and compositions simultaneously, i.e., more complex intermolecular interactions between components in which it would be hard or impossible to establish the analytical model. This illustrates the potential application of ANN in the case that the physical and thermodynamic properties are highly non-linear or too complex. © 2012 Copyright the authors.

Micromechanical analysis of cohesive granular materials using the discrete element method with an adhesive elasto-plastic contact model

An adhesive elasto-plastic contact model for the discrete element method with three dimensional non-spherical particles is proposed and investigated to achieve quantitative prediction of cohesive powder flowability. Simulations have been performed for uniaxial consolidation followed by unconfined compression to failure using this model. The model has been shown to be capable of predicting the experimental flow function (unconfined compressive strength vs. the prior consolidation stress) for a limestone powder which has been selected as a reference solid in the Europe wide PARDEM research network. Contact plasticity in the model is shown to affect the flowability significantly and is thus essential for producing satisfactory computations of the behaviour of a cohesive granular material. The model predicts a linear relationship between a normalized unconfined compressive strength and the product of coordination number and solid fraction. This linear relationship is in line with the Rumpf model for the tensile strength of particulate agglomerate. Even when the contact adhesion is forced to remain constant, the increasing unconfined strength arising from stress consolidation is still predicted, which has its origin in the contact plasticity leading to microstructural evolution of the coordination number. The filled porosity is predicted to increase as the contact adhesion increases. Under confined compression, the porosity reduces more gradually for the load-dependent adhesion compared to constant adhesion. It was found that the contribution of adhesive force to the limiting friction has a significant effect on the bulk unconfined strength. The results provide new insights and propose a micromechanical based measure for characterising the strength and flowability of cohesive granular materials. 

Phase transitions and nonlinear phenomena in neuronal network models

Communication and cooperation between billions of neurons underlie the power of the brain. How do complex functions of the brain arise from its cellular constituents? How do groups of neurons self-organize into patterns of activity? These are crucial questions in neuroscience. In order to answer them, it is necessary to have solid theoretical understanding of how single neurons communicate at the microscopic level, and how cooperative activity emerges. In this thesis we aim to understand how complex collective phenomena can arise in a simple model of neuronal networks. We use a model with balanced excitation and inhibition and complex network architecture, and we develop analytical and numerical methods for describing its neuronal dynamics. We study how interaction between neurons generates various collective phenomena, such as spontaneous appearance of network oscillations and seizures, and early warnings of these transitions in neuronal networks. Within our model, we show that phase transitions separate various dynamical regimes, and we investigate the corresponding bifurcations and critical phenomena. It permits us to suggest a qualitative explanation of the Berger effect, and to investigate phenomena such as avalanches, band-pass filter, and stochastic resonance. The role of modular structure in the detection of weak signals is also discussed. Moreover, we find nonlinear excitations that can describe paroxysmal spikes observed in electroencephalograms from epileptic brains. It allows us to propose a method to predict epileptic seizures. Memory and learning are key functions of the brain. There are evidences that these processes result from dynamical changes in the structure of the brain. At the microscopic level, synaptic connections are plastic and are modified according to the dynamics of neurons. Thus, we generalize our cortical model to take into account synaptic plasticity and we show that the repertoire of dynamical regimes becomes richer. In particular, we find mixed-mode oscillations and a chaotic regime in neuronal network dynamics.