Multicriteria decisions on interdependent infrastructure transportation projects using an evolutionary-based framework

When evaluating transportation infrastructure projects and determining which of them will be carried out from a set of projects and given a budget constraint, several criteria need to be considered in the decision. Standard evaluation practices imply the aggregation of impacts into one utility function which is later optimized. Nevertheless these techniques used for translation of different measuring units into monetary terms are highly controversial. Multicriteria techniques can explicitly deal with different measuring units, however, they are not suitable to model interdependence relationships of projects that share a common characteristic (same route, location or target population, for instance). In this research we model this transportation planning problem, the multi-objective transportation infrastructure project selection problem (MTIPSP), as a constrained multi-objective optimization problem with quadratic objective functions, using a variation of the multi-objective 0–1 knapsack problem plus some additional constraints. Given the combinatorial nature of the problem, an evolutionary-based framework is used for the identification of Pareto solutions, and later, those with non-attractive properties are filtered using a Knee Identification Procedure. The final selection of the projects portfolio is made using a well known multicriteria decision aid method and including the decision makers’ preferences based on the existing context.     

An artist life cycle model for digital media content: Strategies for the Light Web and the Dark Web

This paper surveys and categorizes emerging digital media business models. We apply the customer activity cycle of Vandermerwe (2000) to the consumption of digital media, taking three phases into account: pre-consumption, consumption and post-consumption. Our analysis of the business models focuses on their social costs and benefits. We derive the parameters as follows: convenience of use, exposure, ease of compliance and administration. We distinguish two polar environments for digital media: the Dark Web with content created by the masses, and the Light Web with content created by big media. We develop an artist life cycle model in which different business models appear to be optimal at different stages of an artist’s career. Voluntary payment-based models seem to be ideal for newcomers in the Dark Web, while digital rights management-based and complementary product and service-based models are the likely choice of established artists in the Light Web. Established artists might change their approach again, using voluntary payment-based or complementary product and service-based models when they retire.     

Inductively coupled probe for the measurement of partial discharges

Partial discharges are a transient phenomena whose measurement is remarkably important for electrical equipment diagnosis and maintenance. These discharges appear in the measurement circuit as very narrow current pulses of some nanoseconds. Therefore, discharge pulse detection is a particularly difficult problem, especially because they are superposed on the high voltage waveforms that cause them. In this paper, we present an inductively coupled probe able to measure this physical phenomenon by means of a very simple and inexpensive device that can be installed in the equipment under test. After modeling the probe, its response will be compared to that of commercial devices using both calibrated discharges and partial discharges occurring at real power.     

A logical approach to efficient Max-SAT solving

Weighted Max-SAT is the optimization version of SAT and many important problems can be naturally encoded as such. Solving weighted Max-SAT is an important problem from both a theoretical and a practical point of view. In recent years, there has been considerable interest in finding efficient solving techniques. Most of this work focuses on the computation of good quality lower bounds to be used within a branch and bound DPLL-like algorithm. Most often, these lower bounds are described in a procedural way. Because of that, it is difficult to realize the logic that is behind.In this paper we introduce an original framework for Max-SAT that stresses the parallelism with classical SAT. Then, we extend the two basic SAT solving techniques: search and inference. We show that many algorithmic tricks used in state-of-the-art Max-SAT solvers are easily expressible in logical terms in a unified manner, using our framework.We also introduce an original search algorithm that performs a restricted amount of weighted resolution at each visited node. We empirically compare our algorithm with a variety of solving alternatives on several benchmarks. Our experiments, which constitute to the best of our knowledge the most comprehensive Max-SAT evaluation ever reported, demonstrate the practical usability of our approach.     

New approach for optimizing the interpretation and representation of the degree of historical-archaeological evidence in the virtual reconstructions

Virtual Reality - Virtual reconstruction is defined as the visual recovery of a building or object through the creation of a three-dimensional model of the asset to be reconstructed, in a...     

Comparing the Slack-Variable Mixture Model With Other Alternatives

There have been many linear regression models proposed to analyze mixture experiments including the Scheffé model, the slack-variable model, and the Kronecker model. The use of the slack-variable model is somewhat controversial within the mixture experiment research community. However, in situations that the slack-variable ingredient is used to fill in the formulation and the remaining ingredients have constraints such that they can be chosen independently of one another, the slack-variable model is extremely popular by practitioners mainly due to the ease of interpretation. In this article, we advocate that for some mixture experiments the slack-variable model has appealing properties including numerical stability and better prediction accuracy when model-term selection is performed. We also explain how the effects of the slack-variable model components should be interpreted and how easy it is for practitioners to understand the components effects. We also investigate how to choose the slack-variable component, what transformation should be used to reduce collinearity, and under what circumstances the slack-variable model should be preferred. Both simulation and practical examples are provided to support the conclusions.     

BirdVis: visualizing and understanding bird populations

Birds are unrivaled windows into biotic processes at all levels and are proven indicators of ecological well-being. Understanding the determinants of species distributions and their dynamics is an important aspect of ecology and is critical for conservation and management. Through crowdsourcing, since 2002, the eBird project has been collecting bird observation records. These observations, together with local-scale environmental covariates such as climate, habitat, and vegetation phenology have been a valuable resource for a global community of educators, land managers, ornithologists, and conservation biologists. By associating environmental inputs with observed patterns of bird occurrence, predictive models have been developed that provide a statistical framework to harness available data for predicting species distributions and making inferences about species-habitat associations. Understanding these models, however, is challenging because they require scientists to quantify and compare multiscale spatialtemporal patterns. A large series of coordinated or sequential plots must be generated, individually programmed, and manually composed for analysis. This hampers the exploration and is a barrier to making the cross-species comparisons that are essential for coordinating conservation and extracting important ecological information. To address these limitations, as part of a collaboration among computer scientists, statisticians, biologists and ornithologists, we have developed BirdVis, an interactive visualization system that supports the analysis of spatio-temporal bird distribution models. BirdVis leverages visualization techniques and uses them in a novel way to better assist users in the exploration of interdependencies among model parameters. Furthermore, the system allows for comparative visualization through coordinated views, providing an intuitive interface to identify relevant correlations and patterns. We justify our design decisions and present case studies that show how BirdVis has helped scientists obtain new evidence for existing hypotheses, as well as formulate new hypotheses in their domain.     

Weighting Efficient Accuracy and Minimum Sensitivity for Evolving Multi-Class Classifiers

Recently, a multi-objective Sensitivity–Accuracy based methodology has been proposed for building classifiers for multi-class problems. This technique is especially suitable for imbalanced and multi-class datasets. Moreover, the high computational cost of multi-objective approaches is well known so more efficient alternatives must be explored. This paper presents an efficient alternative to the Pareto based solution when considering both Minimum Sensitivity and Accuracy in multi-class classifiers. Alternatives are implemented by extending the Evolutionary Extreme Learning Machine algorithm for training artificial neural networks. Experiments were performed to select the best option after considering alternative proposals and related methods. Based on the experiments, this methodology is competitive in Accuracy, Minimum Sensitivity and efficiency.     

Angle-of-arrival localization based on antenna arrays for wireless sensor networks

Among the large number of contributions concerning the localization techniques for wireless sensor networks (WSNs), there is still no simple, energy and cost efficient solution suitable in outdoor scenarios. In this paper, a technique based on antenna arrays and angle-of-arrival (AoA) measurements is carefully discussed. While the AoA algorithms are rarely considered for WSNs due to the large dimensions of directional antennas, some system configurations are investigated that can be easily incorporated in pocket-size wireless devices.A heuristic weighting function that enables decreasing the location errors is introduced. Also, the detailed performance analysis of the presented system is provided. The localization accuracy is validated through realistic Monte-Carlo simulations that take into account the specificity of propagation conditions in WSNs as well as the radio noise effects. Finally, trade-offs between the accuracy, localization time and the number of anchors in a network are addressed.     

Unsupervised WSD by Finding the Predominant Sense Using Context as a Dynamic Thesaurus

We present and analyze an unsupervised method for Word Sense Disambiguation (WSD). Our work is based on the method presented by McCarthy et al. in 2004 for finding the predominant sense of each word in the entire corpus. Their maximization algorithm allows weighted terms (similar words) from a distributional thesaurus to accumulate a score for each ambiguous word sense, i.e., the sense with the highest score is chosen based on votes from a weighted list of terms related to the ambiguous word. This list is obtained using the distributional similarity method proposed by Lin Dekang to obtain a thesaurus. In the method of McCarthy et al., every occurrence of the ambiguous word uses the same thesaurus, regardless of the context where the ambiguous word occurs. Our method accounts for the context of a word when determining the sense of an ambiguous word by building the list of distributed similar words based on the syntactic context of the ambiguous word. We obtain a top precision of 77.54% of accuracy versus 67.10% of the original method tested on SemCor. We also analyze the effect of the number of weighted terms in the tasks of finding the Most Frecuent Sense (MFS) and WSD, and experiment with several corpora for building the Word Space Model.