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 present AGWAN (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 AGWAN model to real-world graphs and for generating random graphs from the model. Using the Enron “who communicates with whom” social graph, 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 the structure of real-world graphs.

Serum erythropoietic activity in acute anemia--an animal model

Serum erythropoietic activity and reticulocyte response to anemia were investigated using a rabbit model. In hemolytic anemia, induced by injections of phenylhydrazine on Day 0 the hemoglobin reached a nadir (mean, 6.23 g/dl) on Day 4 when SEA was maximal (mean, 765 mU/ml). In animals venesected on Day 0 and Day 1 to produce anemia of equal severity, the SEA was maximal (mean 235 mU/ml) on Day 2. In both groups the reticulocyte response peaked on Day 7--at 34% for the hemolytic group and 21% for the venesected group. The 2,3-diphosphoglycerate, measured on Day 4, was significantly reduced in the PHZ-treated group. In the venesected group the 2,3-DPG increased between Day 0 and Day 4. There were no concurrent changes in acid-base balance. These results imply that the degree of anemia is only one of the factors which influence the level of circulating SEA.

A-level Mathematics Module Choice and Subsequent Performance in First Year of an Engineering Degree

The A-level Mathematics qualification is based on a compulsory set of pure maths modules and a selection of applied maths modules. The flexibility in choice of applied modules has led to concerns that many students would proceed to study engineering at university with little background in mechanics. A survey of aerospace and mechanical engineering students in our university revealed that a combination of mechanics and statistics (the basic module in both) was by far the most popular choice of optional modules in A-level Mathematics, meaning that only about one-quarter of the class had studied mechanics beyond the basic module within school mathematics. Investigation of student performance in two core, first-year engineering courses, which build on a mechanics foundation, indicated that any benefits for students who studied the extra mechanics at school were small. These results give concern about the depth of understanding in mechanics gained during A-level Mathematics.

Exploring Vertex Interactions in Ferroelectric Flux-Closure Domains

Using piezoresponse force microscopy, we have observed the progressive development of ferroelectric flux-closure domain structures and Landau−Kittel-type domain patterns, in 300 nm thick single-crystal BaTiO3 platelets. As the microstructural development proceeds, the rate of change of the domain configuration is seen to decrease exponentially. Nevertheless, domain wall velocities throughout are commensurate with creep processes in oxide ferroelectrics. Progressive screening of macroscopic destabilizing fields, primarily the surface-related depolarizing field, successfully describes the main features of the observed kinetics. Changes in the separation of domain-wall vertex junctions prompt a consideration that vertex−vertex interactions could be influencing the measured kinetics. However, the expected dynamic signatures associated with direct vertex−vertex interactions are not resolved. If present, our measurements confine the length scale for interaction between vertices to the order of a few hundred nanometers.

Adaptive uncertain information fusion to enhance plan selection in BDI agent systems

Correctly modelling and reasoning with uncertain information from heterogeneous sources in large-scale systems is critical when the reliability is unknown and we still want to derive adequate conclusions. To this end, context-dependent merging strategies have been proposed in the literature. In this paper we investigate how one such context-dependent merging strategy (originally defined for possibility theory), called largely partially maximal consistent subsets (LPMCS), can be adapted to Dempster-Shafer (DS) theory. We identify those measures for the degree of uncertainty and internal conflict that are available in DS theory and show how they can be used for guiding LPMCS merging. A simplified real-world power distribution scenario illustrates our framework. We also briefly discuss how our approach can be incorporated into a multi-agent programming language, thus leading to better plan selection and decision making.

Ideals of A(G) and bimodules over maximal abelian selfadjoint algebras

This paper is concerned with weak⁎ closed masa-bimodules generated by A(G)-invariant subspaces of VN(G). An annihilator formula is established, which is used to characterise the weak⁎ closed subspaces of B(L2(G)) which are invariant under both Schur multipliers and a canonical action of M(G) on B(L2(G)) via completely bounded maps. We study the special cases of extremal ideals with a given null set and, for a large class of groups, we establish a link between relative spectral synthesis and relative operator synthesis.

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.

Vertex Clustering of Augmented Graph Streams

In this paper we propose a graph stream clustering algorithm with a unied similarity measure on both structural and attribute properties of vertices, with each attribute being treated as a vertex. Unlike others, our approach does not require an input parameter for the number of clusters, instead, it dynamically creates new sketch-based clusters and periodically merges existing similar clusters. Experiments on two publicly available datasets reveal the advantages of our approach in detecting vertex clusters in the graph stream. We provide a detailed investigation into how parameters affect the algorithm performance. We also provide a quantitative evaluation and comparison with a well-known offline community detection algorithm which shows that our streaming algorithm can achieve comparable or better average cluster purity.