Standard goal programming with fuzzy hierarchies: a sequential approach

This paper proposes a pragmatic model for multi-objective decision-making processes involving clusters of objectives which have a decisional meaning for the decision maker (DM). We provide the DMs with a comfortable tool that allows them to express their preferences both by comparing criteria of the same cluster and via the comparison between the different clusters. In standard goal programming the importance of the goals is modeled by the introduction of preferential weights or/and the incorporation of pre-emptive priorities. However, in many cases the DM is not able to establish a precise preference structure. Even in the case of precise weights the solution does not match necessarily the relative weights or, in the case of precise pre-emptive priority, the result could be very restrictive. In order to overcome these drawbacks, in this paper the normalized unwanted deviations are interpreted in terms of achievement degrees of the goals and fuzzy relations are used to model the relative importance of the goals. Thus, we show how several methodologies from the fuzzy goal programming literature can be tailored for solving standard GP problems. We apply this new modeling to problems where there is a “natural” clustering between goals of the same class. We address this situation by solving two phases; in the first one each class is handled separately taking into account the hierarchy of their goals and, in the second phase, we integrate the results of the first phase and the imprecise hierarchy of the different classes. We formulate a new goal programming model called as sequential goal programming with fuzzy hierarchy model. Because many real situations involve decision making in this environment, our proposal can be a useful tool of broad application. A numerical example illustrates the methodology.     

Online recognition of sketched arrow-connected diagrams

We introduce a new, online, stroke-based recognition system for hand-drawn diagrams which belong to a group of documents with an explicit structure obvious to humans but only loosely defined from the machine point of view. We propose a model for recognition by selection of symbol candidates, based on evaluation of relations between candidates using a set of predicates. It is suitable for simpler structures where the relations are explicitly given by symbols, arrows in the case of diagrams. Knowledge of a specific diagram domain is used—the two domains are flowcharts and finite automata. Although the individual pipeline steps are tailored for these, the system can readily be adapted for other domains. Our entire diagram recognition pipeline is outlined. Its core parts are text/non-text separation, symbol segmentation, their classification and structural analysis. Individual parts have been published by the authors previously and so are described briefly and referenced. Thorough evaluation on benchmark databases shows the accuracy of the system reaches the state of the art and is ready for practical use. The paper brings several contributions: (a) the entire system and its state-of-the-art performance; (b) the methodology exploring document structure when it is loosely defined; (c) the thorough experimental evaluation; (d) the new annotated database for online sketched flowcharts and finite automata diagrams.     

Learning Sets of Antecedent-restricted Functional and Multivalued Dependencies with Queries

Identifying dependencies that hold in relational databases is essential to produce good databases designs. In particular, functional and multivalued dependencies are used to obtain relation schemes that satisfy the 4th normal form, a property that is considered satisfactory for most applications. It is known that the class of sets of functional dependencies is learnable in the exact model of learning with queries. Also a subclass of multivalued dependencies, the class of consequent-restricted multivalued dependencies, has been shown to be learnable in this model. In this paper, we present an algorithm that learns a class that contains sets of both functional and multivalued dependencies under some restrictions imposed on the antecedents of dependencies. We also show, as a by-product, an algorithm that learns a non-trivial subclass of 2-quasi Horn formulas, closely related to the class just mentioned.     

A novel methodology to predict urban traffic congestion with ensemble learning

Urban traffic congestion prediction is a very hot topic due to the environmental and economical impacts that currently implies. In this sense, to be able to predict bottlenecks and to provide alternatives to the circulation of vehicles becomes an essential task for traffic management. A novel methodology, based on ensembles of machine learning algorithms, is proposed to predict traffic congestion in this paper. In particular, a set of seven algorithms of machine learning has been selected to prove their effectiveness in the traffic congestion prediction. Since all the seven algorithms are able to address supervised classification, the methodology has been developed to be used as a binary classification problem. Thus, collected data from sensors located at the Spanish city of Seville are analyzed and models reaching up to 83 % are generated.     

Online identification of appliances from power consumption data collected by smart meters

The efficient use of resources is a matter of great concern in today’s society, especially in the energy sector. Although the main strategy to decrease energy use has long been focused on supply, over the last few years, there has been a shift to the demand side. Under this new line of action, demand-side management networks have emerged and extended from the household level to larger installations, with the appearance of the concepts of Smart Grids and even Smart Cities. The extended use of Smart Meters for measuring residential electricity consumption facilitates the creation of such intelligent environments. In this context, this article proposes a system which extracts value from the collected consumer information to identify the appliances belonging to that smart environment by means of machine learning techniques. Considering the large amount of information that would be handled when millions of homes were sending data, big data technology has been used. An experiment to evaluate the classification method was carried out with seven devices and three different configurations. The results are also reported, achieving promising results, with recognition rates of 75 % after 1 h of training and 100 % after 4 h.     

Competition and Cooperation in a Bidding Model of Electrical Energy Trade

A cooperative game-theoretic framework is introduced to study the behavior of cooperating and competing electrical-energy providers in the wholesale market considering price-preference rational consumers. We study the physical and economic aspects of the power transmission system operation focussing on the incentives for group formation. We analyze the interactions of generators in an idealized environment described by a DC load flow model where the network is lossless and is operated by an independent network operator who ensures network stability and fulfillment of consumption needs while taking into account the preferences of consumers over generators. We show that cooperation of generators may be necessary to divert consumers from their previous providers. In the second part of the paper we assume an iterative process in which the generators publish their price offers simultaneously, based on which the consumers preferences are determined. We study the dynamics of the prices and profits as the system evolves in time while each coalition is trying to maximize its expected profit in each step. The model deals with network congestion and n ? 1 line-contingency reliability as not every generator-consumer matching is allowed to ensure the safe operation of the transmission system. The profit of the generators is determined as the difference between their income and their production cost, which is a quadratic concave function of the production amount. Any non-monopolistic proper subset of the generators may cooperate and harmonize their offered prices to increase their resulting profit. Since we allow the redistribution of profits among cooperating generators, a transferable-utility game-theoretic framework is used. Furthermore, as cooperation affects the outsiders as well, the resulting game is defined in partition function form. The model is able to demonstrate some interesting benefits of cooperation as well as the effect of market regulations and asymmetric information on the resulting profits and total social cost.     

Parallel simulation of Population Dynamics P systems: updates and roadmap

Population Dynamics P systems are a type of multienvironment P systems that serve as a formal modeling framework for real ecosystems. The accurate simulation of these probabilistic models, e.g. with Direct distribution based on Consistent Blocks Algorithm, entails large run times. Hence, parallel platforms such as GPUs have been employed to speedup the simulation. In 2012, the first GPU simulator of PDP systems was presented. However, it was able to run only randomly generated PDP systems. In this paper, we present current updates made on this simulator, involving an input modu le for binary files and an output module for CSV files. Finally, the simulator has been experimentally validated with a real ecosystem model, and its performance has been tested with two high-end GPUs: Tesla C1060 and K40.     

Is It Possible to Retain Customer Loyalty When a Service Has Failed?

This article aims to analyze the impact of recovery on loyalty in the context of a service chain characterized by the e‐quality–perceived value–loyalty relationship. A sample of 91 out of 1,201 respondents claimed to have had service problems with an online travel agency website. A causal model to test relationships was performed using structural equations modeling, and it was found that data fit with the proposed model. The really important point to retaining customers is quality. It is not so clear that the recovery effort might affect loyalty. Our findings underpin some previous stream of literature confirming that recovery does not always affect loyalty. Although the literature has not reached a consensus in this topic, we add new elements in this debate.     

Robust flat filtering DSP based control of the boost converter

The article deals with the design and implementation of a flat filter tracking digital controller for a boost dc-dc power converter. A highly perturbed switched boost converter circuit is shown to be efficiently controlled, in a trajectory tracking task for its non-minimum phase output, by means of a suitable linear filter, here addressed as a flat filter. Flat filtering is a natural robust version of generalized proportional integral control (GPIC) by which the effects of arbitrary time varying exogenous disturbances, unknown endogenous nonlinearities and un-modeled dynamics can be jointly attenuated in a conceptually similar fashion to observer-based active disturbance rejection control (ADRC) and algebraic identification based model free control (MFC) but: a) without using extended state observers and b) respecting the original system order in a time-varying simplified model while avoiding algebraic estimation techniques. The proposed control technique based on the TMS320F28335 digital signal processor chip is tested by means of realistic simulations and experimental setup.