Binucleate Rhizoctonia sp AG G causing root rot in yacon (Smallanthus sonchifolius) in Brazil

A new rot caused by a binucleate Rhizoctonia sp. affecting the tuberous root cortex of the domesticated yacon (Smallanthus sonchifolius) has been observed in Brazil. Isolates of a binucleate Rhizoctonia sp. were collected from roots with rot symptoms and characterized by the number of nuclei per cell, hyphal anastomosis, RAPD molecular markers, ITS-5.8S rDNA sequence and pathogenicity tests. All isolates had a mean of 1.9-2.2 nuclei per cell and anastomosed with the binucleate Rhizoctonia sp. AG G-tester strain. RAPD analysis was carried out between 11 isolates recovered from yacon and 11 AG (A, Ba, Bb, Bo, C, D, F, G, O, P, Q) standard testers of binucleate Rhizoctonia sp. Genetic similarities of 94.8-100% were observed among isolates of the binucleate Rhizoctonia sp. from yacon and all isolates were genetically more closely related to the AG G tester than other strains according to UPGMA analysis using RAPD markers. Homologies of complete ITS nucleotide sequences were 100% between binucleate isolates of Rhizoctonia sp. from yacon and the AG G tester. According to pathogenicity tests, the isolates caused typical rot symptoms of yacon tubers 90 days after inoculation.

Inferência filogenética revela a complexa etiologia das manchas areolada e foliar em seringueira e em outras espécies cultivadas na Amazônia

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A complexa etiologia da mancha areolada de Thanatephorus sp. e/ou Ceratobasidium sp. em espécies cultivadas ou nativas da Amazônia

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A grouping model for distributed pipeline assets maintenance decision

Distributed pipeline assets systems are crucial to society. The deterioration of these assets and the optimal allocation of limited budget for their maintenance correspond to crucial challenges for water utility managers. Decision makers should be assisted with optimal solutions to select the best maintenance plan concerning available resources and management strategies. Much research effort has been dedicated to the development of optimal strategies for maintenance of water pipes. Most of the maintenance strategies are intended for scheduling individual water pipe. Consideration of optimal group scheduling replacement jobs for groups of pipes or other linear assets has so far not received much attention in literature. It is a common practice that replacement planners select two or three pipes manually with ambiguous criteria to group into one replacement job. This is obviously not the best solution for job grouping and may not be cost effective, especially when total cost can be up to multiple million dollars. In this paper, an optimal group scheduling scheme with three decision criteria for distributed pipeline assets maintenance decision is proposed. A Maintenance Grouping Optimization (MGO) model with multiple criteria is developed. An immediate challenge of such modeling is to deal with scalability of vast combinatorial solution space. To address this issue, a modified genetic algorithm is developed together with a Judgment Matrix. This Judgment Matrix is corresponding to various combinations of pipe replacement schedules. An industrial case study based on a section of a real water distribution network was conducted to test the new model. The results of the case study show that new schedule generated a significant cost reduction compared with the schedule without grouping pipes.

Clustering composite SaaS components in cloud computing using a grouping genetic algorithm

Recently, Software as a Service (SaaS) in Cloud computing, has become more and more significant among software users and providers. To offer a SaaS with flexible functions at a low cost, SaaS providers have focused on the decomposition of the SaaS functionalities, or known as composite SaaS. This approach has introduced new challenges in SaaS resource management in data centres. One of the challenges is managing the resources allocated to the composite SaaS. Due to the dynamic environment of a Cloud data centre, resources that have been initially allocated to SaaS components may be overloaded or wasted. As such, reconfiguration for the components’ placement is triggered to maintain the performance of the composite SaaS. However, existing approaches often ignore the communication or dependencies between SaaS components in their implementation. In a composite SaaS, it is important to include these elements, as they will directly affect the performance of the SaaS. This paper will propose a Grouping Genetic Algorithm (GGA) for multiple composite SaaS application component clustering in Cloud computing that will address this gap. To the best of our knowledge, this is the first attempt to handle multiple composite SaaS reconfiguration placement in a dynamic Cloud environment. The experimental results demonstrate the feasibility and the scalability of the GGA.

A penalty-based grouping genetic algorithm for multiple composite SaaS components clustering in Cloud

Software as a Service (SaaS) in Cloud is getting more and more significant among software users and providers recently. A SaaS that is delivered as composite application has many benefits including reduced delivery costs, flexible offers of the SaaS functions and decreased subscription cost for users. However, this approach has introduced a new problem in managing the resources allocated to the composite SaaS. The resource allocation that has been done at the initial stage may be overloaded or wasted due to the dynamic environment of a Cloud. A typical data center resource management usually triggers a placement reconfiguration for the SaaS in order to maintain its performance as well as to minimize the resource used. Existing approaches for this problem often ignore the underlying dependencies between SaaS components. In addition, the reconfiguration also has to comply with SaaS constraints in terms of its resource requirements, placement requirement as well as its SLA. To tackle the problem, this paper proposes a penalty-based Grouping Genetic Algorithm for multiple composite SaaS components clustering in Cloud. The main objective is to minimize the resource used by the SaaS by clustering its component without violating any constraint. Experimental results demonstrate the feasibility and the scalability of the proposed algorithm.

Grouping people in social networks using a weighted multi-constraints clustering method

Grouping users in social networks is an important process that improves matching and recommendation activities in social networks. The data mining methods of clustering can be used in grouping the users in social networks. However, the existing general purpose clustering algorithms perform poorly on the social network data due to the special nature of users' data in social networks. One main reason is the constraints that need to be considered in grouping users in social networks. Another reason is the need of capturing large amount of information about users which imposes computational complexity to an algorithm. In this paper, we propose a scalable and effective constraint-based clustering algorithm based on a global similarity measure that takes into consideration the users' constraints and their importance in social networks. Each constraint's importance is calculated based on the occurrence of this constraint in the dataset. Performance of the algorithm is demonstrated on a dataset obtained from an online dating website using internal and external evaluation measures. Results show that the proposed algorithm is able to increases the accuracy of matching users in social networks by 10% in comparison to other algorithms.

A new grouping genetic algorithm for the MapReduce placement problem in cloud computing

MapReduce is a computation model for processing large data sets in parallel on large clusters of machines, in a reliable, fault-tolerant manner. A MapReduce computation is broken down into a number of map tasks and reduce tasks, which are performed by so called mappers and reducers, respectively. The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation. From the computational point of view, the mappers/reducers placement problem is a generation of the classical bin packing problem, which is NPcomplete. Thus, in this paper we propose a new grouping genetic algorithm for the mappers/reducers placement problem in cloud computing. Compared with the original one, our grouping genetic algorithm uses an innovative coding scheme and also eliminates the inversion operator which is an essential operator in the original grouping genetic algorithm. The new grouping genetic algorithm is evaluated by experiments and the experimental results show that it is much more efficient than four popular algorithms for the problem, including the original grouping genetic algorithm.

Effect of Grouping Feedlot Steers by Temperament on Performance and Carcass Traits

Cattle temperament is correlated with liveweight gains during feedlotting (Voisinet et al., 1997) ie. cattle that are nervous and flighty (poor temperament) do not perform as well as those that are quiet and docile (good temperament). This experiment investigated the effect of grouping into feedlot pens cattle of good temperament, poor temperament and mixed (some good and some poor) temperament on average daily gain (ADG), body condition score (CS), feed conversion efficiency (FCE) and various carcase traits. Animal production for a consuming world : proceedings of 9th Congress of the Asian-Australasian Association of Animal Production Societies [AAAP] and 23rd Biennial Conference of the Australian Society of Animal Production [ASAP] and 17th Annual Symposium of the University of Sydney, Dairy Research Foundation, [DRF]. 2-7 July 2000, Sydney, Australia.

Effects of Grouping Feedlot Steers with a Range of Flight Speeds on Liveweight and Temperament Changes

Poor temperament cattle that are nervous and flighty do not perform as well in feedlots as good temperament cattle that are quiet and docile (Burrow and Dillon, 1997). There are contradictory anecdotal reports from industry about the effect of mixing cattle of different temperament on subsequent performance and temperament. Supposedly the presence of a few docile cattle in a feedlot pen-group will have a ‘calming’ effect on flighty pen-mates or the presence of a few flighty animals will ‘upset’ a group of quiet cattle. These hypotheses were tested using data in the experiment described by Petherick et al. (2000) where cattle were grouped into feedlot pens of good temperament, poor temperament and mixed (some good and some poor) temperaments. Animal production for a consuming world : proceedings of 9th Congress of the Asian-Australasian Association of Animal Production Societies [AAAP] and 23rd Biennial Conference of the Australian Society of Animal Production [ASAP] and 17th Annual Symposium of the University of Sydney, Dairy Research Foundation, [DRF]. 2-7 July 2000, Sydney, Australia.

Robustness of the partitions in grouping multi-item inventories

A recent work obtained closed-form solutions to the.problem of optimally grouping a multi-item inventory into subgroups with a common order cycle per group, when the distribution by value of the inventory could be described by a Pareto function. This paper studies the sensitivity of the optimal subgroup boundaries so obtained. Closed-form expressions have been developed to find intervals for the subgroup boundaries for any given level of suboptimality. Graphs have been provided to aid the user in selecting a cost-effective level of aggregation and choosing appropriate subgroup boundaries for a whole range of inventory distributions. The results of sensitivity analyses demonstrate the availability of flexibility in the partition boundaries and the cost-effectiveness of any stock control system through three groups, and thus also provide a theoretical support to the intuitive ABC system of classifying the items.

UAV Grouping and Coordination Tactics for Ground Attack Missions

Grouping and coordination tactics for ground attack missions by a heterogeneous mix of reconnaissance, enemy suppression, and attack unmanned aerial vehicles (UAVs) is presented. Dubins' paths are used to determine the optimal number of attack UAVs and their positional and heading freedoms, as functions of weapon seeker range and field of view. A generic battlefield scenario with layered defense is created and the tactics are evaluated on a Group Flyer simulation platform for both nominal and off-nominal conditions.

Deciphering complex patterns of class-I HLA-peptide cross-reactivity via hierarchical grouping

T-cell responses in humans are initiated by the binding of a peptide antigen to a human leukocyte antigen (HLA) molecule. The peptide-HLA complex then recruits an appropriate T cell, leading to cell-mediated immunity. More than 2000 HLA class-I alleles are known in humans, and they vary only in their peptide-binding grooves. The polymorphism they exhibit enables them to bind a wide range of peptide antigens from diverse sources. HLA molecules and peptides present a complex molecular recognition pattern, as many peptides bind to a given allele and a given peptide can be recognized by many alleles. A powerful grouping scheme that not only provides an insightful classification, but is also capable of dissecting the physicochemical basis of recognition specificity is necessary to address this complexity. We present a hierarchical classification of 2010 class-I alleles by using a systematic divisive clustering method. All-pair distances of alleles were obtained by comparing binding pockets in the structural models. By varying the similarity thresholds, a multilevel classification was obtained, with 7 supergroups, each further subclassifying to yield 72 groups. An independent clustering performed based only on similarities in their epitope pools correlated highly with pocket-based clustering. Physicochemical feature combinations that best explain the basis of clustering are identified. Mutual information calculated for the set of peptide ligands enables identification of binding site residues contributing to peptide specificity. The grouping of HLA molecules achieved here will be useful for rational vaccine design, understanding disease susceptibilities and predicting risk of organ transplants.