A support vector machine integrated system for the classification of operation anomalies in nuclear components and systems

A support vector machine (SVM) approach to the classification of transients in nuclear power plants is presented. SVM is a machine-learning algorithm that has been successfully used in pattern recognition for cluster analysis. In the present work, single- and multiclass SVM are combined into a hierarchical structure for distinguishing among transients in nuclear systems on the basis of measured data. An example of application of the approach is presented with respect to the classification of anomalies and malfunctions occurring in the feedwater system of a boiling water reactor. The data used in the example are provided by the HAMBO simulator of the Halden Reactor Project.     

Optimizing a remotely sensed proxy for plankton biomass in Lake Kivu

Many regions of the world, including inland lakes, present with suboptimal conditions for the remotely sensed retrieval of optical signals, thus challenging the limits of available satellite data-processing tools, such as atmospheric correction models (ACM) and water constituent-retrieval (WCR) algorithms. Working in such regions, however, can improve our understanding of remote-sensing tools and their applicability in new contexts, in addition to potentially offering useful information about aquatic ecology. Here, we assess and compare 32 combinations of two ACMs, two WCRs, and three binary categories of data quality standards to optimize a remotely sensed proxy of plankton biomass in Lake Kivu. Each parameter set is compared against the available ground-truth match-ups using Spearman’s right-tailed ρ. Focusing on the best sets from each ACM–WCR combination, their performances are discussed with regard to data distribution, sample size, spatial completeness, and seasonality. The results of this study may be of interest both for ecological studies on Lake Kivu and for epidemiological studies of disease, such as cholera, the dynamics of which has been associated with plankton biomass in other regions of the world.     

Quad‐Mesh Generation and Processing: A Survey

Triangle meshes have been nearly ubiquitous in computer graphics, and a large body of data structures and geometry processing algorithms based on them has been developed in the literature. At the same time, quadrilateral meshes, especially semi‐regular ones, have advantages for many applications, and significant progress was made in quadrilateral mesh generation and processing during the last several years. In this survey we discuss the advantages and problems of techniques operating on quadrilateral meshes, including surface analysis and mesh quality, simplification, adaptive refinement, alignment with features, parametrisation and remeshing.     

Local SVM approaches for fast and accurate classification of remote-sensing images

In this article, the task of remote-sensing image classification is tackled with local maximal margin approaches. First, we introduce a set of local kernel-based classifiers that alleviate the computational limitations of local support vector machines (SVMs), maintaining at the same time high classification accuracies. Such methods rely on the following idea: (a) during training, build a set of local models covering the considered data and (b) during prediction, choose the most appropriate local model for each sample to evaluate. Additionally, we present a family of operators on kernels aiming to integrate the local information into existing (input) kernels in order to obtain a quasi-local (QL) kernel. To compare the performances achieved by the different local approaches, an experimental analysis was conducted on three distinct remote-sensing data sets. The obtained results show that interesting performances can be achieved in terms of both classification accuracy and computational cost.     

Multirobot motion coordination in space and time

This paper describes a solution to the multirobot motion planning problem based on a decoupled analysis in the space domain and in the time domain. It investigates the practical use of the notion of motion plan quality and of the motion plan robustness measures for computing safe motions. The use of anytime algorithms allows one to evaluate the opportunity of looking for alternative solution paths by generating small variations of robot motions affecting both its geometrical path and its scheduled velocity. By using the concept of plan robustness, several alternative paths are generated and evaluated through various performance indices and impact factors, using heuristic rules. These indices allow one to know how much a variation affects a given plan. Finally, some recent experiments are outlined.     

User modeling in an OAM support system

This paper outlines studies relative to a research project on the development of a system that permits different people of an enterprise, with different roles and experience, to gain an adequate and personalized vision of the real status of the network and managed systems. What has been achieved is an easy to handle system, which permits quick and simple queries without utilizing complex man machine languages, and tailors personalized answers on the basis of the characteristics of the user. To achieve these results, User Modeling aspects have been considered and pursued.     

Tree-Based Credal Networks for Classification

Bayesian networks are models for uncertain reasoning which are achieving a growing importance also for the data mining task of classification. Credal networks extend Bayesian nets to sets of distributions, or credal sets. This paper extends a state-of-the-art Bayesian net for classification, called tree-augmented naive Bayes classifier, to credal sets originated from probability intervals. This extension is a basis to address the fundamental problem of prior ignorance about the distribution that generates the data, which is a commonplace in data mining applications. This issue is often neglected, but addressing it properly is a key to ultimately draw reliable conclusions from the inferred models. In this paper we formalize the new model, develop an exact linear-time classification algorithm, and evaluate the credal net-based classifier on a number of real data sets. The empirical analysis shows that the new classifier is good and reliable, and raises a problem of excessive caution that is discussed in the paper. Overall, given the favorable trade-off between expressiveness and efficient computation, the newly proposed classifier appears to be a good candidate for the wide-scale application of reliable classifiers based on credal networks, to real and complex tasks.     

Translation-based approaches for solving disjunctive temporal problems with preferences

Disjunctive Temporal Problems (DTPs) with Preferences (DTPPs) extend DTPs with piece-wise constant preference functions associated to each constraint of the form l ≤ x ? y ≤ u, where x,y are (real or integer) variables, and l,u are numeric constants. The goal is to find an assignment to the variables of the problem that maximizes the sum of the preference values of satisfied DTP constraints, where such values are obtained by aggregating the preference functions of the satisfied constraints in it under a “max” semantic. The state-of-the-art approach in the field, implemented in the native DTPP solver Maxilitis, extends the approach of the native DTP solver Epilitis. In this paper we present alternative approaches that translate DTPPs to Maximum Satisfiability of a set of Boolean combination of constraints of the form l?x ? y?u, ? ∈{<,≤}, that extend previous work dealing with constant preference functions only. We prove correctness and completeness of the approaches. Results obtained with the Satisfiability Modulo Theories (SMT) solvers Yices and MathSAT on randomly generated DTPPs and DTPPs built from real-world benchmarks, show that one of our translation is competitive to, and can be faster than, Maxilitis (This is an extended and revised version of Bourguet et al. 2013).     

Molecular Subtyping of Invasive Breast Cancer Using a PAM50-Based Multigene Expression Test-Comparison with Molecular-Like Subtyping by Tumor Grade/Immunohistochemistry and Influence on Oncologist’s Decision on Systemic Therapy in a Real-World Setting

In intermediate risk hormone receptor (HR) positive, HER2 negative breast cancer (BC), the decision regarding adjuvant chemotherapy might be facilitated by multigene expression tests. In all, 142 intermediate risk BCs were investigated using the PAM50-based multigene expression test Prosigna® in a prospective multicentric study. In 119/142 cases, Prosigna® molecular subtyping was compared with local and two central (C1 and C6) molecular-like subtypes relying on both immunohistochemistry (IHC; HRs, HER2, Ki-67) and IHC + tumor grade (IHC+G) subtyping. According to local IHC, 35.4% were Luminal A-like and 64.6% Luminal B-like subtypes (local IHC+G subtype: 31.9% Luminal A-like; 68.1% Luminal B-like). In contrast to local and C1 subtyping, C6 classified >2/3 of cases as Luminal A-like. Pairwise agreement between Prosigna® subtyping and molecular-like subtypes was fair to moderate depending on molecular-like subtyping method and center. The best agreement was observed between Prosigna® (53.8% Luminal A; 44.5% Luminal B) and C1 surrogate subtyping (Cohen’s kappa = 0.455). Adjuvant chemotherapy was suggested to 44.2% and 88.6% of Prosigna® Luminal A and Luminal B cases, respectively. Out of all Luminal A-like cases (locally IHC/IHC+G subtyping), adjuvant chemotherapy was recommended if Prosigna® testing classified as Prosigna® Luminal A at high / intermediate risk or upgraded to Prosigna® Luminal B.