Sets of p-multiplicity in locally compact groups

We initiate the study of sets of p-multiplicity in locally compact groups and their operator versions. We show that a closed subset E of a second countable locally compact group G is a set of p-multiplicity if and only if E∗={(s,t):ts−1∈E} is a set of operator p-multiplicity. We exhibit examples of sets of p-multiplicity, establish preservation properties for unions and direct products, and prove a p-version of the Stone–von Neumann Theorem.

Comments on “Wirtinger-based integral inequality: Application to time-delay systems [Automatica 49 (2013) 2860–2866]”

In a recent paper (Automatica 49 (2013) 2860–2866), the Wirtinger-based inequality has been introduced to derive tractable stability conditions for time-delay or sampled-data systems. We point out that there exist two errors in Theorem 8 for the stability analysis of sampled-data systems, and the correct theorem is presented.

Thermodynamics of trajectories and local fluctuation theorems for harmonic quantum networks

We present a general method to undertake a thorough analysis of the thermodynamics of the quantum jump trajectories followed by an arbitrary quantum harmonic network undergoing linear and bilinear dynamics. The approach is based on the phase-space representation of the state of a harmonic network. The large deviation function associated with this system encodes the full counting statistics of exchange and also allows one to deduce for fluctuation theorems obeyed by the dynamics. We illustrate the method showing the validity of a local fluctuation theorem about the exchange of excitations between a restricted part of the environment (i.e., a local bath) and a harmonic network coupled with different schemes.

Averaged Extended Tree Augmented Naive Classifier

This work presents a new general purpose classifier named Averaged Extended Tree Augmented Naive Bayes (AETAN), which is based on combining the advantageous characteristics of Extended Tree Augmented Naive Bayes (ETAN) and Averaged One-Dependence Estimator (AODE) classifiers. We describe the main properties of the approach and algorithms for learning it, along with an analysis of its computational time complexity. Empirical results with numerous data sets indicate that the new approach is superior to ETAN and AODE in terms of both zero-one classification accuracy and log loss. It also compares favourably against weighted AODE and hidden Naive Bayes. The learning phase of the new approach is slower than that of its competitors, while the time complexity for the testing phase is similar. Such characteristics suggest that the new classifier is ideal in scenarios where online learning is not required.

Learning Extended Tree Augmented Naive Structures

This work proposes an extended version of the well-known tree-augmented naive Bayes (TAN) classifier where the structure learning step is performed without requiring features to be connected to the class. Based on a modification of Edmonds' algorithm, our structure learning procedure explores a superset of the structures that are considered by TAN, yet achieves global optimality of the learning score function in a very efficient way (quadratic in the number of features, the same complexity as learning TANs). We enhance our procedure with a new score function that only takes into account arcs that are relevant to predict the class, as well as an optimization over the equivalent sample size during learning. These ideas may be useful for structure learning of Bayesian networks in general. A range of experiments shows that we obtain models with better prediction accuracy than naive Bayes and TAN, and comparable to the accuracy of the state-of-the-art classifier averaged one-dependence estimator (AODE). We release our implementation of ETAN so that it can be easily installed and run within Weka.