Heterogeneous pair approximation for voter models on networks

For models whose evolution takes place on a network it is often necessary to augment the mean-field approach by considering explicitly the degree dependence of average quantities (heterogeneous mean-field). Here we introduce the degree dependence in the pair approximation (heterogeneous pair approximation) for analyzing voter models on uncorrelated networks. This approach gives an essentially exact description of the dynamics, correcting some inaccurate results of previous approaches. The heterogeneous pair approximation introduced here can be applied in full generality to many other processes on complex networks.Comment: 6 pages, 6 figures, published versio

Circular motion of neutral test particles in Reissner-Nordstr\"om spacetime

We investigate the motion of neutral test particles in the gravitational field of a mass $M$ with charge $Q$ described by the Reissner-Nordstr\"om (RN) spacetime. We focus on the study of circular stable and unstable orbits around configurations describing either black holes or naked singularities. We show that at the classical radius, defined as $Q^2/M$, there exist orbits with zero angular momentum due to the presence of repulsive gravity. The analysis of the stability of circular orbits indicates that black holes are characterized by a continuous region of stability. In the case of naked singularities, the region of stability can split into two non-connected regions inside which test particles move along stable circular orbits.Comment: 23 pages, 22 figures. To be published Phys. Rev.

Grid computing technologies for renewable electricity generator monitoring and control

In this paper we discuss the use of real-time Grid computing for the monitoring, control and simulation of renewable electricity generators and their associated electrical networks. We discuss briefly the architectural design of GRIDCC and how we have integrated a number of real (solar, CHP) and simulated conventional power generators into the GRIDCC environment. A local weather station has also been attached to an Instrument Manager to alert experts appropriately when the Solar Array is not generating. The customised remote control and monitoring environment (a virtual control room), distributed using a standard web server, is discussed

A Logical Verification Methodology for Service-Oriented Computing

We introduce a logical verification methodology for checking behavioural properties of service-oriented computing systems. Service properties are described by means of SocL, a branching-time temporal logic that we have specifically designed to express in an effective way distinctive aspects of services, such as, e.g., acceptance of a request, provision of a response, and correlation among service requests and responses. Our approach allows service properties to be expressed in such a way that they can be independent of service domains and specifications. We show an instantiation of our general methodology that uses the formal language COWS to conveniently specify services and the expressly developed software tool CMC to assist the user in the task of verifying SocL formulae over service specifications. We demonstrate feasibility and effectiveness of our methodology by means of the specification and the analysis of a case study in the automotive domain

Haptoglobin from Psoriatic Patients Exhibits Decreased Activity in Binding Hemoglobin and Inhibiting LCAT Activity.

Objective: The aim of this work was to assess whether psoriasis is associated with phenotype prevalence and altered activity of Haptoglobin (Hpt). Background: Hpt is a plasma acute phase glycoprotein, displaying in humans three phenotypes. Phenotype prevalence or structure modification of Hpt was associated with several diseases. The Hpt main function is to bind and carry to the liver free hemoglobin for degradation and iron recycling. Hpt was recently found able to bind the apolipoprotein A-I (ApoA-I), thus impairing its stimulation on the activity of the enzyme lecithin-cholesterol acyl-transferase (LCAT) Study design: Hpt was isolated from patients with psoriasis vulgaris, and its activity in hemoglobin or ApoA-I binding and LCAT inhibition was compared with that of normal protein. Methods: Two affinity chromatography steps, the first using resin-coupled hemoglobin and the second anti-Hpt antibodies, were used to purify Hpt. The protein phenotype was assessed by electrophoresis. Binding experiments were performed by ELISA with stationary hemoglobin or ApoA-I, Hpt in solution, and anti-Hpt antibodies for detection of bound Hpt. Standard LCAT assays were carried out in the presence of Hpt purified from patients or healthy subjects. Results: Phenotype prevalence of Hpt in psoriasis was not found. After affinity chromatography by hemoglobin, albumin and ApoA-I were routinely found heavily contaminating only Hpt from normal subjects. Isolated Hpt from patients had lower activity than normal protein in both hemoglobin binding and LCAT inhibition. Conclusions: In psoriasis, Hpt displays some structure modification(s) which might be associated with the protein function in the disease

Random copying in space

Random copying is a simple model for population dynamics in the absence of selection, and has been applied to both biological and cultural evolution. In this work, we investigate the effect that spatial structure has on the dynamics. We focus in particular on how a measure of the diversity in the population changes over time. We show that even when the vast majority of a population's history may be well-described by a spatially-unstructured model, spatial structure may nevertheless affect the expected level of diversity seen at a local scale. We demonstrate this phenomenon explicitly by examining the random copying process on small-world networks, and use our results to comment on the use of simple random-copying models in an empirical context.Comment: 26 pages, 11 figures. Based on invited talk at AHRC CECD Conference on "Cultural Evolution in Spatially Structured Populations" at UCL, September 2010. To appear in ACS - Advances in Complex System

A Calculus for Orchestration of Web Services

We introduce COWS (Calculus for Orchestration of Web Services), a new foundational language for SOC whose design has been influenced by WS-BPEL, the de facto standard language for orchestration of web services. COWS combines in an original way a number of ingredients borrowed from well-known process calculi, e.g. asynchronous communication, polyadic synchronization, pattern matching, protection, delimited receiving and killing activities, while resulting different from any of them. Several examples illustrates COWS peculiarities and show its expressiveness both for modelling imperative and orchestration constructs, e.g. web services, flow graphs, fault and compensation handlers, and for encoding other process and orchestration languages

Debugging of Web Applications with Web-TLR

Web-TLR is a Web verification engine that is based on the well-established Rewriting Logic--Maude/LTLR tandem for Web system specification and model-checking. In Web-TLR, Web applications are expressed as rewrite theories that can be formally verified by using the Maude built-in LTLR model-checker. Whenever a property is refuted, a counterexample trace is delivered that reveals an undesired, erroneous navigation sequence. Unfortunately, the analysis (or even the simple inspection) of such counterexamples may be unfeasible because of the size and complexity of the traces under examination. In this paper, we endow Web-TLR with a new Web debugging facility that supports the efficient manipulation of counterexample traces. This facility is based on a backward trace-slicing technique for rewriting logic theories that allows the pieces of information that we are interested to be traced back through inverse rewrite sequences. The slicing process drastically simplifies the computation trace by dropping useless data that do not influence the final result. By using this facility, the Web engineer can focus on the relevant fragments of the failing application, which greatly reduces the manual debugging effort and also decreases the number of iterative verifications.Comment: In Proceedings WWV 2011, arXiv:1108.208

A criterion for separating process calculi

We introduce a new criterion, replacement freeness, to discern the relative expressiveness of process calculi. Intuitively, a calculus is strongly replacement free if replacing, within an enclosing context, a process that cannot perform any visible action by an arbitrary process never inhibits the capability of the resulting process to perform a visible action. We prove that there exists no compositional and interaction sensitive encoding of a not strongly replacement free calculus into any strongly replacement free one. We then define a weaker version of replacement freeness, by only considering replacement of closed processes, and prove that, if we additionally require the encoding to preserve name independence, it is not even possible to encode a non replacement free calculus into a weakly replacement free one. As a consequence of our encodability results, we get that many calculi equipped with priority are not replacement free and hence are not encodable into mainstream calculi like CCS and pi-calculus, that instead are strongly replacement free. We also prove that variants of pi-calculus with match among names, pattern matching or polyadic synchronization are only weakly replacement free, hence they are separated both from process calculi with priority and from mainstream calculi.Comment: In Proceedings EXPRESS'10, arXiv:1011.601