Using the web graph to influence application behaviour

The Web's link structure (termed the Web Graph) is a richly connected set of Web pages. Current applications use this graph for indexing and information retrieval purposes. In contrast the relationship between Web Graph and application is reversed by letting the structure of the Web Graph influence the behaviour of an application. Presents a novel Web crawling agent, AlienBot, the output of which is orthogonally coupled to the enemy generation strategy of a computer game. The Web Graph guides AlienBot, causing it to generate a stochastic process. Shows the effectiveness of such unorthodox coupling to both the playability of the game and the heuristics of the Web crawler. In addition, presents the results of the sample of Web pages collected by the crawling process. In particular, shows: how AlienBot was able to identify the power law inherent in the link structure of the Web; that 61.74 per cent of Web pages use some form of scripting technology; that the size of the Web can be estimated at just over 5.2 billion pages; and that less than 7 per cent of Web pages fully comply with some variant of (X)HTML.

Largest connected component of a star graph with faulty vertices

In order to make a full evaluation of an interconnection network, it is essential to estimate the minimum size of a largest connected component of this network provided the faulty vertices in the network may break its connectedness. Star graphs are recognized as promising candidates for interconnection networks. This article addresses the size of a largest connected component of a faulty star graph. We prove that, in an n-star graph (n >= 3) with up to 2n-4 faulty vertices, all fault-free vertices but at most two form a connected component. Moreover, all fault-free vertices but exactly two form a connected component if and only if the set of all faulty vertices is equal to the neighbourhood of a pair of fault-free adjacent vertices. These results show that star graphs exhibit excellent fault-tolerant abilities in the sense that there exists a large functional network in a faulty star graph.

Development of a semantic graph-based scene description

Software representations of scenes, i.e. the modelling of objects in space, are used in many application domains. Current modelling and scene description standards focus on visualisation dimensions, and are intrinsically limited by their dependence upon their semantic interpretation and contextual application by humans. In this paper we propose the need for an open, extensible and semantically rich modelling language, which facilitates a machine-readable semantic structure. We critically review existing standards and techniques, and highlight a need for a semantically focussed scene description language. Based on this defined need we propose a preliminary solution, based on hypergraph theory, and reflect on application domains.

Graph-based algorithms for comparison and prediction of household-level energy use profiles

We present an efficient graph-based algorithm for quantifying the similarity of household-level energy use profiles, using a notion of similarity that allows for small time–shifts when comparing profiles. Experimental results on a real smart meter data set demonstrate that in cases of practical interest our technique is far faster than the existing method for computing the same similarity measure. Having a fast algorithm for measuring profile similarity improves the efficiency of tasks such as clustering of customers and cross-validation of forecasting methods using historical data. Furthermore, we apply a generalisation of our algorithm to produce substantially better household-level energy use forecasts from historical smart meter data.

Software evolution: a graph based model

A model based on graph isomorphisms is used to formalize software evolution. Step by step we narrow the search space by an informed selection of the attributes based on the current state-of-the-art in software engineering and generate a seed solution. We then traverse the resulting space using graph isomorphisms and other set operations over the vertex sets. The new solutions will preserve the desired attributes. The goal of defining an isomorphism based search mechanism is to construct predictors of evolution that can facilitate the automation of ’software factory’ paradigm. The model allows for automation via software tools implementing the concepts.

Software evolution: a graph based model

A model based on graph isomorphisms is used to formalize software evolution. Step by step we narrow the search space by an informed selection of the attributes based on the current state-of-the-art in software engineering and generate a seed solution. We then traverse the resulting space using graph isomorphisms and other set operations over the vertex sets. The new solutions will preserve the desired attributes. The goal of defining an isomorphism based search mechanism is to construct predictors of evolution that can facilitate the automation of ’software factory’ paradigm. The model allows for automation via software tools implementing the concepts.

Bond graph models of DC-DC converters operating in both CCM and DCM

In this paper, Bond Graphs are employed to develop a novel mathematical model of conventional switched-mode DC-DC converters valid for both continuous and discontinuous conduction modes. A unique causality bond graph model of hybrid models is suggested with the operation of the switch and the diode to be represented by a Modulated Transformer with a binary input and a resistor with fixed conductance causality. The operation of the diode is controlled using an if-then function within the model. The extracted hybrid model is implemented on a Boost and Buck converter with their operations to change from CCM to DCM and to return to CCM. The vector fields of the models show validity in a wide operation area and comparison with the simulation of the converters using PSPICE reveals high accuracy of the proposed model, with the Normalised Root Means Square Error and the Maximum Absolute Error remaining adequately low. The model is also experimentally tested on a Buck topology.

The iso-Score Curve Graph. A new tool for competitive bidding

The present work describes a new tool that helps bidders improve their competitive bidding strategies. This new tool consists of an easy-to-use graphical tool that allows the use of more complex decision analysis tools in the field of Competitive Bidding. The graphic tool described here tries to move away from previous bidding models which attempt to describe the result of an auction or a tender process by means of studying each possible bidder with probability density functions. As an illustration, the tool is applied to three practical cases. Theoretical and practical conclusions on the great potential breadth of application of the tool are also presented.

Cacao swollen shoot virus in Nigeria: analysis of a pathogen and its vectors

Cacao swollen shoot virus (CSSV) causes the Cacao swollen shoot virus disease (CSSVD) and significantly reduces production in West African cacao. This study characterised the current status of the disease in the major cacao growing States in Nigeria and attempted a clarification on the manner of CSSV transmission. Two separate field surveys and sample collections were conducted in Nigeria in summer 2012 and spring 2013. PCR-based screening of cacao leaf samples and subsequent DNA sequencing showed that the disease continues to persist in Ondo and Oyo States and in new cacao sites in Abia, Akwa Ibom, Cross River and Edo States. Mealybug samples collected were identified using a robust approach involving environmental scanning electron microscopy, histology and DNA barcoding, which highlighted the importance of integrative taxonomy in the study. The results show that the genus Planococcus (Planococcus citri (Risso) and/or Planococcus minor (Maskell)) was the most abundant vector (73.5%) at the sites examined followed by Formicococcus njalensis (Laing) (19.0 %). In a laboratory study, the feeding behaviour of Pl. citri, Pseudococcus longispinus (Targioni-Tozzetti) and Pseudococcus viburni (Signoret) on cacao were investigated using electrical penetration graph (EPG) analysis. EPG waveforms reflecting intercellular stylet penetration (C), extracellular salivation (E1e), salivation in sieve elements (E1), phloem ingestion (E2), derailed stylet mechanics (F), xylem ingestion (G) and non-probing phase (Np) were analysed. Individual mealybugs exhibited marked variation within species and significantly differed (p ≤ .05) between species for E1e and E1. PCR-based assessments of the retention time for CSSV in viruliferous Pl. citri, Ps. longispinus and Ps. viburni fed on a non-cacao diet showed that CSSV was still detectable after 144 hours. These unusually long durations for a pathogen currently classified as a semi-persistent virus have implications for the design of non-malvaceous barrier crops currently being considered for the protection of new cacao plantings.

PODOCARPUS SP.PL. REFUGIA IN BRAZIL`S ATLANTIC FOREST: ANALYSING THE PAST TO IMPROVE FUTURE PROTECTION

The Atlantic rainforest has the second highest biodiversity in Brazil. It has been shrinking rapidly in area as a result of intensive deforestation, and only 7% of the original cover now remains, as isolated patches or in ecological reserves. In order to obtain new information on the distribution of the Atlantic rainforest during the Quaternary, we examined herbarium data to locate relevant populations and extracted DNA from fresh leaves from 26 populations. The present-day distribution of endemic Podocarpus populations shows that they are widely dispersed across eastern Brazil, and that the expansion of Podocarpus recorded in single Amazonian pollen records may have originated from either western or eastern populations. Genetic analysis enabled us to determine the boundaries of their regional expansion: northern and central populations of P. sellowii appeared between 5 degrees and 15 degrees S some 16,000 years ago; populations of P lambertii or sellowii have appeared between 15 degrees and 23 degrees S at different times since the last glaciation at least; and P lambertii appeared between 23 degrees and 30 degrees S during the recent expansion of Araucaria forests. The combination of botanical, pollen, and molecular analyses proved to be a rapid means of inferring distribution boundaries for sparse populations and their regional evolution within tropical ecosystems. Today the rainforest refugia we identified have become hotspots that are crucial to the survival of the Atlantic forest under unfavourable climatic conditions and, as such, offer the only possible opportunity for this type of forest to expand in the event of future climate change.

PL spectroscopy of Fermi electrons in regime of the quantum Hall effect

The influence of the interlayer coupling on formation of the quantized Hall phase at the filling factor v = 2 was studied in the multilayer GaAs/AlGaAs heterostructures The disorder broaden Gaussian photoluminescence line due to the localized electrons was found in the quantized Hall phase of the isolated multi-quantum well structure On the other hand. the quantized Hall phase of the weakly-coupled multilayers emitted an asymmetrical line similar to that one observed in the metallic electron systems. We demonstrated that the observed asymmetry indicates a formation of the Fermi Surface in the quantized Hall phase of the multilayer electron system due to the interlayer peicolation. A sharp decrease of the single-particle scattering time associated with the extended states oil the Fermi surface was observed at the filling factor v = 2. (C) 2009 Elsevier B.V All rights reserved

Designing Novel Antitrypanosomal Agents from a Mixed Graph-Theoretical Substructural Approach

Chagas disease is nowadays the most serious parasitic health problem. This disease is caused by Trypanosoma cruzi. The great number of deaths and the insufficient effectiveness of drugs against this parasite have alarmed the scientific community worldwide. In an attempt to overcome this problem, a model for the design and prediction of new antitrypanosomal agents was obtained. This used a mixed approach, containing simple descriptors based on fragments and topological substructural molecular design descriptors. A data set was made up of 188 compounds, 99 of them characterized an antitrypanosomal activity and 88 compounds that belong to other pharmaceutical categories. The model showed sensitivity, specificity and accuracy values above 85%. Quantitative fragmental contributions were also calculated. Then, and to confirm the quality of the model, 15 structures of molecules tested as antitrypanosomal compounds (that we did not include in this study) were predicted, taking into account the information on the abovementioned calculated fragmental contributions. The model showed an accuracy of 100% which means that the ""in silico"" methodology developed by our team is promising for the rational design of new antitrypanosomal drugs. (C) 2009 Wiley Periodicals, Inc. J Comput Chem 31: 882-894. 2010