Toward the sequence-based breeding in legumes in the post-genome sequencing era

Efficiency of breeding programs of legume crops such as chickpea, pigeonpea and groundnut has been considerably improved over the past decade through deployment of modern genomic tools and technologies. For instance, next-generation sequencing technologies have facilitated availability of genome sequence assemblies, re-sequencing of several hundred lines, development of HapMaps, high-density genetic maps, a range of marker genotyping platforms and identification of markers associated with a number of agronomic traits in these legume crops. Although marker-assisted backcrossing and marker-assisted selection approaches have been used to develop superior lines in several cases, it is the need of the hour for continuous population improvement after every breeding cycle to accelerate genetic gain in the breeding programs. In this context, we propose a sequence-based breeding approach which includes use of independent or combination of parental selection, enhancing genetic diversity of breeding programs, forward breeding for early generation selection, and genomic selection using sequencing/genotyping technologies. Also, adoption of speed breeding technology by generating 4–6 generations per year will be contributing to accelerate genetic gain. While we see a huge potential of the sequence-based breeding to revolutionize crop improvement programs in these legumes, we anticipate several challenges especially associated with high-quality and precise phenotyping at affordable costs, data analysis and management related to improving breeding operation efficiency. Finally, integration of improved seed systems and better agronomic packages with the development of improved varieties by using sequence-based breeding will ensure higher genetic gains in farmers’ fields

Multi-view PointNet for 3D Scene Understanding

Fusion of 2D images and 3D point clouds is important because information from dense images can enhance sparse point clouds. However, fusion is challenging because 2D and 3D data live in different spaces. In this work, we propose MVPNet (Multi-View PointNet), where we aggregate 2D multi-view image features into 3D point clouds, and then use a point based network to fuse the features in 3D canonical space to predict 3D semantic labels. To this end, we introduce view selection along with a 2D-3D feature aggregation module. Extensive experiments show the benefit of leveraging features from dense images and reveal superior robustness to varying point cloud density compared to 3D-only methods. On the ScanNetV2 benchmark, our MVPNet significantly outperforms prior point cloud based approaches on the task of 3D Semantic Segmentation. It is much faster to train than the large networks of the sparse voxel approach. We provide solid ablation studies to ease the future design of 2D-3D fusion methods and their extension to other tasks, as we showcase for 3D instance segmentation.Comment: Geometry Meets Deep Learning Workshop, ICCV 201

Self-tuning routine alarm analysis of vibration signals in steam turbine generators

This paper presents a self-tuning framework for knowledge-based diagnosis of routine alarms in steam turbine generators. The techniques provide a novel basis for initialising and updating time series feature extraction parameters used in the automated decision support of vibration events due to operational transients. The data-driven nature of the algorithms allows for machine specific characteristics of individual turbines to be learned and reasoned about. The paper provides a case study illustrating the routine alarm paradigm and the applicability of systems using such techniques

On the evolutionary optimisation of many conflicting objectives

This inquiry explores the effectiveness of a class of modern evolutionary algorithms, represented by Non-dominated Sorting Genetic Algorithm (NSGA) components, for solving optimisation tasks with many conflicting objectives. Optimiser behaviour is assessed for a grid of mutation and recombination operator configurations. Performance maps are obtained for the dual aims of proximity to, and distribution across, the optimal trade-off surface. Performance sweet-spots for both variation operators are observed to contract as the number of objectives is increased. Classical settings for recombination are shown to be suitable for small numbers of objectives but correspond to very poor performance for higher numbers of objectives, even when large population sizes are used. Explanations for this behaviour are offered via the concepts of dominance resistance and active diversity promotion

Bayesian inference through encompassing priors and importance sampling for a class of marginal models for categorical data

We develop a Bayesian approach for selecting the model which is the most supported by the data within a class of marginal models for categorical variables formulated through equality and/or inequality constraints on generalised logits (local, global, continuation or reverse continuation), generalised log-odds ratios and similar higher-order interactions. For each constrained model, the prior distribution of the model parameters is formulated following the encompassing prior approach. Then, model selection is performed by using Bayes factors which are estimated by an importance sampling method. The approach is illustrated through three applications involving some datasets, which also include explanatory variables. In connection with one of these examples, a sensitivity analysis to the prior specification is also considered