Assessing the Novelty of Computer-Generated Narratives Using Empirical Metrics

Novelty is a key concept to understand creativity. Evaluating a piece of artwork or other creation in terms of novelty requires comparisons to other works and considerations about the elements that have been reused in the creative process. Human beings perform this analysis intuitively, but in order to simulate it using computers, the objects to be compared and the similarity metrics to be used should be formalized and explicitly implemented. In this paper we present a study on relevant elements for the assessment of novelty in computer-generated narratives. We focus on the domain of folk-tales, working with simple plots and basic narrative elements: events, characters, props and scenarios. Based on the empirical results of this study we propose a set of computational metrics for the automatic assessment of novelty. Although oriented to the implementation of our own story generation system, the measurement methodology we propose can be easily generalized to other creative systems.     

A novel ordered weighted averaging weight determination based on ordinal dispersion

One of the most common techniques to find the adequate weights in ordered weighted averaging (OWA) operators is based on the orness concept, where the weights are determined by maximizing the entropy (variation) for a fixed orness value. But such an entropy represents a dispersion measure for nominal variables, while weights in an OWA operator are essentially ordinal rather than nominal. Hence, in this paper, we propose a novel way to determine OWA weights based upon ordinal dispersion measures instead of an standard entropy measure. From this approach, we find an explicit formula for the weights, and we illustrate differences by means some multicriteria decision-making examples.     

Variational Foundations and Generalized Unified Theory of RVE-Based Multiscale Models

A unified variational theory is proposed for a general class of multiscale models based on the concept of Representative Volume Element. The entire theory lies on three fundamental principles: (1) kinematical admissibility, whereby the macro- and micro-scale kinematics are defined and linked in a physically meaningful way; (2) duality, through which the natures of the force- and stress-like quantities are uniquely identified as the duals (power-conjugates) of the adopted kinematical variables; and (3) the Principle of Multiscale Virtual Power, a generalization of the well-known Hill-Mandel Principle of Macrohomogeneity, from which equilibrium equations and homogenization relations for the force- and stress-like quantities are unequivocally obtained by straightforward variational arguments. The proposed theory provides a clear, logically-structured framework within which existing formulations can be rationally justified and new, more general multiscale models can be rigorously derived in well-defined steps. Its generality allows the treatment of problems involving phenomena as diverse as dynamics, higher order strain effects, material failure with kinematical discontinuities, fluid mechanics and coupled multi-physics. This is illustrated in a number of examples where a range of models is systematically derived by following the same steps. Due to the variational basis of the theory, the format in which derived models are presented is naturally well suited for discretization by finite element-based or related methods of numerical approximation. Numerical examples illustrate the use of resulting models, including a non-conventional failure-oriented model with discontinuous kinematics, in practical computations.     

A parallel evolutionary algorithm for technical market indicators optimization

This paper deals with the optimization of parameters of technical indicators for stock market investment. Price prediction is a problem of great complexity and, usually, some technical indicators are used to predict market trends. The main difficulty in using technical indicators lies in deciding a set of parameter values. We proposed the use of Multi-Objective Evolutionary Algorithms (MOEAs) to obtain the best parameter values belonging to a collection of indicators that will help in the buying and selling of shares. The experimental results indicate that our MOEA offers a solution to the problem by obtaining results that improve those obtained through technical indicators with standard parameters. In order to reduce execution time is necessary to parallelize the executions. Parallelization results show that distributing the workload of indicators in multiple processors to improve performance is recommended. This parallelization has been performed taking advantage of the idle time in a corporate technology infrastructure. We have configured a small parallel grid using the students Labs of a Computer Science University College.     

User encoding for clustering in very sparse recommender systems tasks

Multimedia Tools and Applications - Recommender Systems are a very useful tool which let companies and service providers focus in the preferences of their customers, helping them to avoid an...     

Detection of bodies in maritime rescue operations using unmanned aerial vehicles with multispectral cameras

In this study, we use unmanned aerial vehicles equipped with multispectral cameras to search for bodies in maritime rescue operations. A series of flights were performed in open‐water scenarios in the northwest of Spain, using a certified aquatic rescue dummy in dangerous areas and real people when the weather conditions allowed it. The multispectral images were aligned and used to train a convolutional neural network for body detection. An exhaustive evaluation was performed to assess the best combination of spectral channels for this task. Three approaches based on a MobileNet topology were evaluated, using (a) the full image, (b) a sliding window, and (c) a precise localization method. The first method classifies an input image as containing a body or not, the second uses a sliding window to yield a class for each subimage, and the third uses transposed convolutions returning a binary output in which the body pixels are marked. In all cases, the MobileNet architecture was modified by adding custom layers and preprocessing the input to align the multispectral camera channels. Evaluation shows that the proposed methods yield reliable results, obtaining the best classification performance when combining green, red‐edge, and near‐infrared channels. We conclude that the precise localization approach is the most suitable method, obtaining a similar accuracy as the sliding window but achieving a spatial localization close to 1 m. The presented system is about to be implemented for real maritime rescue operations carried out by Babcock Mission Critical Services Spain.     

An 802.11e HCCA scheduler with an end-to-end quality aware territory method

In this paper we present a solution for the IEEE 802.11e HCCA (Hybrid coordination function Controlled Channel Access) mechanism which aims both at supporting strict real-time traffic requirements and, simultaneously, at handling TCP applications efficiently. Our proposal combines a packet scheduler and a dynamic resource allocation algorithm. The scheduling discipline is based on the Monolithic Shaper-Scheduler, which is a modification of a General Processor Sharing (GPS) related scheduler. It supports minimum-bandwidth and delay guarantees and, at the same time, it achieves the optimal latency of all the GPS-related schedulers. In addition, our innovative resource allocation procedure, called the territory method, aims at prioritizing real time services and at improving the performance of TCP applications. For this purpose, it splits the wireless channel capacity (in terms of transmission opportunities) into different territories for the different types of traffic, taking into account the end-to-end network dynamics. In order to give support to the desired applications, we consider the following traffic classes: conversational, streaming, interactive and best-effort. The so called territories shrink or expand depending on the current quality experienced by the corresponding traffic class. We evaluated the performance of our solution through extensive simulations in a heterogeneous wired-cum-wireless scenario under different traffic conditions. Additionally, we compare our proposal to other HCCA scheduling algorithms, the HCCA reference scheduler and Fair Hybrid Coordination Function (FHCF). The results show that the combination of the MSS and the territory method obtains higher system capacity for VoIP traffic (up to 32 users) in the simulated scenario, compared to FHCF and the HCCA reference scheduler (13 users). In addition, the MSS with the territory method also improves the throughput of TCP sources (one FTP application achieves between 6.1 Mbps without VoIP traffic and 2.1 Mbps with 20 VoIP users) compared to the reference scheduler (at most 388 kbps) and FHCF (with a maximum FTP throughput of 4.8 Mbps).     

GPU accelerated waterpixel algorithm for superpixel segmentation of hyperspectral images

The Journal of Supercomputing - The high computational cost of the superpixel segmentation algorithms for hyperspectral remote sensing images makes them ideal candidates for parallel computation....     

Business customer communities and knowledge sharing: exploratory study of critical issues

Businesses in knowledge intensive industries must appropriately engage with their customers in order to produce goods and services that are desired and valued in the marketplace. Engagement with customers calls for exchanging information and knowledge with customers and fostering exchanges between customers. Recent developments in the area of information and communication technologies (ICTs) have radically increased the variety of opportunities for improving customer engagement. In this paper, we will examine the use of ICTs to build Business Customer Communities (BCCs) to help an organization foster knowledge exchanges between its professional and institutional customers. We define BCCs as groups of business customers, which are deliberately enabled by a firm and share a long-term need to exchange work related knowledge through online and offline interaction. The objectives of this study are (1) to describe BCCs and outline their attributes and features, and (2) to contribute to the understanding of challenges associated with the enabling of BCC formation and how firms can overcome these challenges. As such, a contribution is made to the discussion of knowing in practice in customer communities, which rely in large part on ICT.     

Ontological reasoning for improving the treatment of emotions in text

With the advent of affective computing, the task of adequately identifying, representing and processing the emotional connotations of text has acquired importance. Two problems facing this task are addressed in this paper: the composition of sentence emotion from word emotion, and a representation of emotion that allows easy conversion between existing computational representations. The emotion of a sentence of text should be derived by composition of the emotions of the words in the sentence, but no method has been proposed so far to model this compositionality. Of the various existing approaches for representing emotions, some are better suited for some problems and some for others, but there is no easy way of converting from one to another. This paper presents a system that addresses these two problems by reasoning with two ontologies implemented with Semantic Web technologies: one designed to represent word dependency relations within a sentence, and one designed to represent emotions. The ontology of word dependency relies on roles to represent the way emotional contributions project over word dependencies. By applying automated classification of mark-up results in terms of the emotion ontology the system can interpret unrestricted input in terms of a restricted set of concepts for which particular rules are provided. The rules applied at the end of the process provide configuration parameters for a system for emotional voice synthesis.