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.

Horizon 2020: a call to forge biodiversity links

For the upcoming calls for Horizon 2020 research funding, the European Commission has said that it would prefer bids from open, collaborative consortia rather than the competitive bids seen in previous funding programmes. To this end, the organizers of 18 European biodiversity informatics projects agreed at a meeting in Rome…

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.

EVOLUTIONARY BIOLOGY IN BIODIVERSITY SCIENCE, CONSERVATION, AND POLICY: A CALL TO ACTION

Evolutionary biologists have long endeavored to document how many species exist on Earth, to understand the processes by which biodiversity waxes and wanes, to document and interpret spatial patterns of biodiversity, and to infer evolutionary relationships. Despite the great potential of this knowledge to improve biodiversity science, conservation, and policy, evolutionary biologists have generally devoted limited attention to these broader implications. Likewise, many workers in biodiversity science have underappreciated the fundamental relevance of evolutionary biology. The aim of this article is to summarize and illustrate some ways in which evolutionary biology is directly relevant We do so in the context of four broad areas: (1) discovering and documenting biodiversity, (2) understanding the causes of diversification, (3) evaluating evolutionary responses to human disturbances, and (4) implications for ecological communities, ecosystems, and humans We also introduce bioGENESIS, a new project within DIVERSITAS launched to explore the potential practical contributions of evolutionary biology In addition to fostering the integration of evolutionary thinking into biodiversity science, bioGENESIS provides practical recommendations to policy makers for incorporating evolutionary perspectives into biodiversity agendas and conservation. We solicit your involvement in developing innovative ways of using evolutionary biology to better comprehend and stem the loss of biodiversity.

Advertisement call, vocal activity, and geographic distribution of Brachycephalus hermogenesi (Giaretta and Sawaya, 1998) (Anura, Brachycephalidae)

Brachycephalus hermogenesi is an endemic leaf litter inhabitant of the Atlantic forest of southeastern Brazil, whose original distribution included a restricted area near the boundaries of the States of Sao Paulo and Rio de Janeiro. We were surprised to find out, while conducting herpetofaunal surveys at Estacao Biologica de Boraceia (EBB), that the background forest insect-like sound we have been searching for corresponded to calling individuals of the species. Males call during the day at high densities, hidden under the leaf litter. Individuals do not answer playback, seem to move very infrequently, and seem to ignore nearby calling activity. We gathered data on annual and daily vocal activity of the species at EBB, observing a total of 1,549 calls given by 31 focal individuals in November 2003 and 2005. The call varies from short single note calls to calls composed of groups of two to seven similar notes emitted at regular intervals. We also extend the known distribution of the species southward to the State of Sao Paulo.

Natural History of the Lutz`s Frog Cycloramphus lutzorum Heyer, 1983 (Anura: Cycloramphidae) in the Brazilian Atlantic Forest: Description of the Advertisement Call, Tadpole, and Karyotype

We describe the advertisement call, tadpole, karyotype, and additional information on the natural history of Cycloramphus lutzorum from southern Brazil. Sonograms were generated from digitally recorded calls. Tadpoles were collected in the field for description in the lab, and an adult was collected for karyotyping. Data on seasonal activity were gathered monthly from November 2005 to November 2007. All tadpoles (N = 21), juveniles (N = 18), and adults (N = 52) were found exclusively in streams. Reproduction, as identified by calling frogs, occurred from July through November. Frogs call all day long, but mostly at dusk, from rock crevices inside the stream edges near the splash zone. The call is short and loud, with 11 pulsed notes, of 491-641 ms, with a dominant frequency of 0.98-1.39 kHz. We describe the exotrophic and semiterrestrial tadpoles, always found in constantly humid vertical rock walls in the stream. Tadpoles of C. lutzorum are recognized by differences in labial tooth row formula, eye diameter, body shape, position of nares, and development of tail. Like congeneric species, the karyotype of C. lutzorum comprises 26 metacentric and submetacentric chromosomes. Cycloramphus lutzorum is restricted to and adapted for living in fast flowing streams, many of which are threatened by deforestation, pollution, and habitat loss. Therefore, we recommend the status of C. lutzorum be changed from its current ""Data Deficient"" to ""Near Threatened (NT)"" in the IUCN species red list.

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

Design of novel antituberculosis compounds using graph-theoretical and substructural approaches

The increasing resistance of Mycobacterium tuberculosis to the existing drugs has alarmed the worldwide scientific community. In an attempt to overcome this problem, two models for the design and prediction of new antituberculosis agents were obtained. The first used a mixed approach, containing descriptors based on fragments and the topological substructural molecular design approach (TOPS-MODE) descriptors. The other model used a combination of two-dimensional (2D) and three-dimensional (3D) descriptors. A data set of 167 compounds with great structural variability, 72 of them antituberculosis agents and 95 compounds belonging to other pharmaceutical categories, was analyzed. The first model showed sensitivity, specificity, and accuracy values above 80% and the second one showed values higher than 75% for these statistical indices. Subsequently, 12 structures of imidazoles not included in this study were designed, taking into account the two models. In both cases accuracy was 100%, showing that the methodology in silico developed by us is promising for the rational design of antituberculosis drugs.

Using ant colonies for solve the multiprocessor task graph scheduling

The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer.In this paper, we propose an application of the Ant Colony Optimization (ACO) to a multiprocessor scheduling problem (MPSP). In the MPSP, no preemption is allowed and each operation demands a setup time on the machines. The problem seeks to compose a schedule that minimizes the total completion time.We therefore rely on heuristics to find solutions since solution methods are not feasible for most problems as such. This novel heuristic searching approach to the multiprocessor based on the ACO algorithm a collection of agents cooperate to effectively explore the search space.A computational experiment is conducted on a suit of benchmark application. By comparing our algorithm result obtained to that of previous heuristic algorithm, it is evince that the ACO algorithm exhibits competitive performance with small error ratio.