Qué define el éxito o el fracaso de los remakes de Disney

Treballs Finals del doble Grau de Gestió d'Informació i Documentació Digital + Comunicació Audiovisual (INFOCOM), Facultat d'Informació i Mitjans Audiovisuals, Universitat de Barcelona. Curs: 2020-2021. Tutora: Margarida Carnicé MurThis dissertation is intended to define which ones are the keys that decide the success or the failure of remakes that Disney has been producing since 2014. For that, six remakes have been selected with their original films (Cinderella; The Jungle Book; Pete’s dragon; Beauty and the Beast; The Lion King; Mulan) and have been classified according to their success or failure from the audience’s punctuation and reviews in databases and online review websites. Next, narrative, aesthetic and technical variables and values in the twelve films have been analysed and compared to understand how they have affected the audience’s punctuation. The valuation that the audience has about the original film will decrease the expectations regarding the remake and, in that way, more likely to like the product or that it will have such high expectations that any little detail could do that the audience rejects the remake. For that, they will pay attention to different elements: the use of new technologies, the accuracy level and the politeness to the original story, and the modification or the reinforcement of the delivered message. So, we can get to the conclusion that the success or the failure of each remake depends on the audience’s expectation

A symbolic network-based nonlinear theory for dynamical systems observability

EBM and MSB acknowledge the Engineering and Physical Sciences Research Council (EPSRC), grant Ref. EP/I032608/1. ISN acknowledges partial support from the Ministerio de Economía y Competitividad of Spain under project FIS2013-41057-P and from the Group of Research Excelence URJC-Banco de Santander.Peer reviewedPublisher PD

Unveiling the connectivity of complex networks using ordinal transition methods

Ordinal measures provide a valuable collection of tools for analyzing correlated data series. However, using these methods to understand the information interchange in networks of dynamical systems, and uncover the interplay between dynamics and structure during the synchronization process, remains relatively unexplored. Here, we compare the ordinal permutation entropy, a standard complexity measure in the literature, and the permutation entropy of the ordinal transition probability matrix that describes the transitions between the ordinal patterns derived from a time series. We find that the permutation entropy based on the ordinal transition matrix outperforms the rest of the tested measures in discriminating the topological role of networked chaotic R\"ossler systems. Since the method is based on permutation entropy measures, it can be applied to arbitrary real-world time series exhibiting correlations originating from an existing underlying unknown network structure. In particular, we show the effectiveness of our method using experimental datasets of networks of nonlinear oscillators.Comment: 9 pages, 5 figure

Cooperation transitions in social games induced by aspiration-driven players

Cooperation and defection are social traits whose evolutionary origin is still unresolved. Recent behavioral experiments with humans suggested that strategy changes are driven mainly by the individuals' expectations and not by imitation. This work theoretically analyzes and numerically explores an aspiration-driven strategy updating in a well-mixed population playing games. The payoffs of the game matrix and the aspiration are condensed into just two parameters that allow a comprehensive description of the dynamics. We find continuous and abrupt transitions in the cooperation density with excellent agreement between theory and the Gillespie simulations. Under strong selection, the system can display several levels of steady cooperation or get trapped into absorbing states. These states are still relevant for experiments even when irrational choices are made due to their prolonged relaxation times. Finally, we show that for the particular case of the Prisoner Dilemma, where defection is the dominant strategy under imitation mechanisms, the self-evaluation update instead favors cooperation nonlinearly with the level of aspiration. Thus, our work provides insights into the distinct role between imitation and self-evaluation with no learning dynamics.Comment: 11 pages, 9 figures; Correction of typos in the metadat

Network-based features for retinal fundus vessel structure analysis

Retinal fundus imaging is a non-invasive method that allows visualizing the structure of the blood vessels in the retina whose features may indicate the presence of diseases such as diabetic retinopathy (DR) and glaucoma. Here we present a novel method to analyze and quantify changes in the retinal blood vessel structure in patients diagnosed with glaucoma or with DR. First, we use an automatic unsupervised segmentation algorithm to extract a tree-like graph from the retina blood vessel structure. The nodes of the graph represent branching (bifurcation) points and endpoints, while the links represent vessel segments that connect the nodes. Then, we quantify structural differences between the graphs extracted from the groups of healthy and non-healthy patients. We also use fractal analysis to characterize the extracted graphs. Applying these techniques to three retina fundus image databases we find significant differences between the healthy and non-healthy groups (p-values lower than 0.005 or 0.001 depending on the method and on the database). The results are sensitive to the segmentation method (manual or automatic) and to the resolution of the images.Peer ReviewedPostprint (published version

Nonlocal analysis of modular roles

We introduce a new methodology to characterize the role that a given node plays inside the community structure of a complex network. Our method relies on the ability of the links to reduce the number of steps between two nodes in the network, which is measured by the number of shortest paths crossing each link, and its impact on the node proximity. In this way, we use node closeness to quantify the importance of a node inside its community. At the same time, we define a participation coefficient that depends on the shortest paths contained in the links that connect two communities. The combination of both parameters allows to identify the role played by the nodes in the network, following the same guidelines introduced by Guimerà et al. [Guimerà & Amaral, 2005] but, in this case, considering global information about the network. Finally, we give some examples of the hub characterization in real networks and compare our results with the parameters most used in the literature