Thermoelectric Power Generation Utilizing the Waste Heat from a Biomass Boiler

The objective of the presented work is to test the possibility of using thermoelectric power to convert flue gas waste heat from a small-scale domestic pellet boiler, and to assess the influence of a thermoelectric generator on its function. A prototype of the generator, able to be connected to an existing device, was designed, constructed, and tested. The performance of the generator as well as the impact of the generator on the operation of the boiler was investigated under various operating conditions. The boiler gained auxiliary power and could become a combined heat and power unit allowing self-sufficient operation. The created unit represents an independent source of electricity with effective use of fuel.     

Introduction to the Special Issue on Meta-Learning

Recent advances in meta-learning are providing the foundations to construct meta-learning assistants and task-adaptive learners. The goal of this special issue is to foster an interest in meta-learning by compiling representative work in the field. The contributions to this special issue provide strong insights into the construction of future meta-learning tools. In this introduction we present a common frame of reference to address work in meta-learning through the concept of meta-knowledge. We show how meta-learning can be simply defined as the process of exploiting knowledge about learning that enables us to understand and improve the performance of learning algorithms.     

Cascade Generalization

Using multiple classifiers for increasing learning accuracy is an active research area. In this paper we present two related methods for merging classifiers. The first method, Cascade Generalization, couples classifiers loosely. It belongs to the family of stacking algorithms. The basic idea of Cascade Generalization is to use sequentially the set of classifiers, at each step performing an extension of the original data by the insertion of new attributes. The new attributes are derived from the probability class distribution given by a base classifier. This constructive step extends the representational language for the high level classifiers, relaxing their bias. The second method exploits tight coupling of classifiers, by applying Cascade Generalization locally. At each iteration of a divide and conquer algorithm, a reconstruction of the instance space occurs by the addition of new attributes. Each new attribute represents the probability that an example belongs to a class given by a base classifier. We have implemented three Local Generalization Algorithms. The first merges a linear discriminant with a decision tree, the second merges a naive Bayes with a decision tree, and the third merges a linear discriminant and a naive Bayes with a decision tree. All the algorithms show an increase of performance, when compared with the corresponding single models. Cascade also outperforms other methods for combining classifiers, like Stacked Generalization, and competes well against Boosting at statistically significant confidence levels.     

Comparing Strategies of Collaborative Networks for R&D: An Agent-Based Study

In this work we analyze the evolving dynamics of different strategies of collaborative networks that emerge from the creation and diffusion of knowledge. An evolutionary economic approach is adopted by introducing decision rules that are applied routinely and an agent-based model is developed. Firms (the agents) can collaborate and create networks for research and development purposes. We have compared three collaboration strategies (A—peer-to-peer complementariness, B—concentration process and C—virtual cooperation networks) that were defined on the basis of literature and on empirical evidence. Strategies are introduced exogenously in the simulation. The aims of this paper are twofold: (i) to analyze the importance of the networking effects; and (ii) to test the differences among collaboration strategies. It was possible to conclude that profit is associated with higher stock of knowledge and with smaller network diameter. In addition, concentration strategies are more profitable and more efficient in transmitting knowledge through the network. These processes reinforce the stock of knowledge and the profit of the firms located in the centers of the networks.     

Speeding up algorithm selection using average ranking and active testing by introducing runtime

Algorithm selection methods can be speeded-up substantially by incorporating multi-objective measures that give preference to algorithms that are both promising and fast to evaluate. In this paper, we introduce such a measure, A3R, and incorporate it into two algorithm selection techniques: average ranking and active testing. Average ranking combines algorithm rankings observed on prior datasets to identify the best algorithms for a new dataset. The aim of the second method is to iteratively select algorithms to be tested on the new dataset, learning from each new evaluation to intelligently select the next best candidate. We show how both methods can be upgraded to incorporate a multi-objective measure A3R that combines accuracy and runtime. It is necessary to establish the correct balance between accuracy and runtime, as otherwise time will be wasted by conducting less informative tests. The correct balance can be set by an appropriate parameter setting within function A3R that trades off accuracy and runtime. Our results demonstrate that the upgraded versions of Average Ranking and Active Testing lead to much better mean interval loss values than their accuracy-based counterparts.     

Strategies for the selective catalytic oxidation of alkanes

An overview is provided of the state of technology for the upgrading of alkane feedstocks to chemical intermediates. This is a technology survey based largely on the information from recent patent literature. Examples are described for options for commercial application of oxidation catalysis for converting alkanes to commodity chemicals. These examples are used to illustrate points about economic incentives and technical hurdles across several prospective alkane conversion processes.     

Metalearning and Algorithm Selection: progress,state of the art and introduction to the 2018 Special Issue

This article serves as an introduction to the Special Issue on Metalearning and Algorithm Selection. The introduction is divided into two parts. In the the first section, we give an overview of how the field of metalearning has evolved in the last 1–2 decades and mention how some of the papers in this special issue fit in. In the second section, we discuss the contents of this special issue. We divide the papers into thematic subgroups, provide information about each subgroup, as well as about the individual papers. Our main aim is to highlight how the papers selected for this special issue contribute to the field of metalearning.     

Ranking Learning Algorithms: Using IBL and Meta-Learning on Accuracy and Time Results

We present a meta-learning method to support selection of candidate learning algorithms. It uses a k-Nearest Neighbor algorithm to identify the datasets that are most similar to the one at hand. The distance between datasets is assessed using a relatively small set of data characteristics, which was selected to represent properties that affect algorithm performance. The performance of the candidate algorithms on those datasets is used to generate a recommendation to the user in the form of a ranking. The performance is assessed using a multicriteria evaluation measure that takes not only accuracy, but also time into account. As it is not common in Machine Learning to work with rankings, we had to identify and adapt existing statistical techniques to devise an appropriate evaluation methodology. Using that methodology, we show that the meta-learning method presented leads to significantly better rankings than the baseline ranking method. The evaluation methodology is general and can be adapted to other ranking problems. Although here we have concentrated on ranking classification algorithms, the meta-learning framework presented can provide assistance in the selection of combinations of methods or more complex problem solving strategies.