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.

A specific group of genes respond to cold dehydration stress in cut Alstroemeria flowers whereas ambient dehydration stress accelerates developmental senescence expression patterns

Petal development and senescence entails a normally irreversible process. It starts with petal expansion and pigment production, and ends with nutrient remobilization and ultimately cell death. In many species this is accompanied by petal abscission. Post-harvest stress is an important factor in limiting petal longevity in cut flowers and accelerates some of the processes of senescence such as petal wilting and abscission. However, some of the effects of moderate stress in young flowers are reversible with appropriate treatments. Transcriptomic studies have shown that distinct gene sets are expressed during petal development and senescence. Despite this, the overlap in gene expression between developmental and stress-induced senescence in petals has not been fully investigated in any species. Here a custom-made cDNA microarray from Alstroemeria petals was used to investigate the overlap in gene expression between developmental changes (bud to first sign of senescence) and typical post-harvest stress treatments. Young flowers were stressed by cold or ambient temperatures without water followed by a recovery and rehydration period. Stressed flowers were still at the bud stage after stress treatments. Microarray analysis showed that ambient dehydration stress accelerates many of the changes in gene expression patterns that would normally occur during developmental senescence. However, a higher proportion of gene expression changes in response to cold stress were specific to this stimulus and not senescence related. The expression of 21 transcription factors was characterized, showing that overlapping sets of regulatory genes are activated during developmental senescence and by different stresses.

Radiometric analysis of the light coupled by optimally cut plastic optical fiber amplitude modulating reflectance displacement sensors

A radiometric analysis of the light coupled by optical fiber amplitude modulating extrinsic-type reflectance displacement sensors is presented. Uncut fiber sensors show the largest range but a smaller responsivity. Single cut fiber sensors exhibit an improvement in responsivity at the expense of range. A further increase in responsivity as well as a reduction in the operational range is obtained when the double cut sensor configuration is implemented. The double cut configuration is particularly suitable in applications where feedback action is applied to the moving reflector surface. © 2000 American Institute of Physics.

Feedback dew-point sensor utilising optimally cut plastic optical fibres

A plastic optical fibre reflectance sensor that makes full use of the critical angle of the fibres is implemented to monitor dew formation on a Peltier-cooled reflector surface. The optical configuration permits isolation of optoelectronic components from the sensing head and better light coupling between the reflector and the detecting fibre, giving a better signal of the onset of dew formation on the reflector. Continuous monitoring of the rate of change in reflectance as well as the absolute reflectance signals, the use of a novel polymethyl-methacrylate-coated hydrophobic film reflector on the Peltier element and the application of feedback around the point of dew formation, further reduces the possibility of contamination of the sensor head. Under closed-loop operation, the sensor is capable of cycling around the point of dew formation at a frequency of 2.5 Hz.

Connectivity measures for internet topologies on the level of autonomous systems

Classical measures of network connectivity are the number of disjoint paths between a pair of nodes and the size of a minimum cut. For standard graphs, these measures can be computed efficiently using network flow techniques. However, in the Internet on the level of autonomous systems (ASs), referred to as AS-level Internet, routing policies impose restrictions on the paths that traffic can take in the network. These restrictions can be captured by the valley-free path model, which assumes a special directed graph model in which edge types represent relationships between ASs. We consider the adaptation of the classical connectivity measures to the valley-free path model, where it is -hard to compute them. Our first main contribution consists of presenting algorithms for the computation of disjoint paths, and minimum cuts, in the valley-free path model. These algorithms are useful for ASs that want to evaluate different options for selecting upstream providers to improve the robustness of their connection to the Internet. Our second main contribution is an experimental evaluation of our algorithms on four types of directed graph models of the AS-level Internet produced by different inference algorithms. Most importantly, the evaluation shows that our algorithms are able to compute optimal solutions to instances of realistic size of the connectivity problems in the valley-free path model in reasonable time. Furthermore, our experimental results provide information about the characteristics of the directed graph models of the AS-level Internet produced by different inference algorithms. It turns out that (i) we can quantify the difference between the undirected AS-level topology and the directed graph models with respect to fundamental connectivity measures, and (ii) the different inference algorithms yield topologies that are similar with respect to connectivity and are different with respect to the types of paths that exist between pairs of ASs.

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.

Consumers perception and evaluation of fresh cut buying attributes: a survey on the Italian market

During the last twenty years, consumer choice in high income countries is no longer merely dictated by price and the organoleptic characteristics of a product, but also by other features some of which are not patently tangible. The growing importance of such attributes in the process of consumer choice is not only due to income increase, but also to changes in lifestyle such as migrations from the countryside, a generalized urbanization and consequential city life style, female emancipation and work outside the domestic walls for women, the drastic decrease in hard physical labor and the process of internationalization. The present survey study aims to explore the importance that Italian consumers give to fresh cut buying attributes and which of these attributes should be taken into consideration by industries in order to satisfy the needs of the most critical shoppers. Where possible, market and survey data for fresh cut products will be compared with those for cooked products and before presenting the results and conclusions of the study, the technical issues of processing will be highlighted owing to the fact that they affect the marketing of these products, the recent market situation with regard to consumption will be illustrated and the methodology used will be described.