Essays on Entertainment Analytics

This thesis explores live entertainment analytics and revenue management allocation strategies for live entertainment. In Chapter two, we look at empirical factors that effect the success of Broadway shows. How well-known actors (stars) effect film revenues has been a recurring question of entertainment producers and academics. Because a film cannot be disentangled from a star involved, researchers have long struggled to rule out ``reverse-causality\u27\u27 - that stars have access to higher quality movies. Using a novel data set that includes Broadway show revenues and actor usage, we provide a fixed-effects regression and case studies. We find across multiple specifications that increases in star power in a show improve revenue. Motivated by social grouping and the associated operational challenges, in Chapter three we formulate and study extensions to the Dynamic Stochastic Knapsack Problem (DSKP). We compartmentalize the knapsack according to predefined reward-to-weight ratios, and incorporate a stochastic interaction between the offered set of open compartments and the item placement. Using a specific interaction function inspired by customer choice in the entertainment industry, we provide an algorithm to determine the optimal solution and obtain insights into structural properties. Given the computational complexity of the dynamic program we also propose and analyze via simulation a heuristic algorithm. In Chapter four, in a large sequence of simulations, we propose and study practical heuristic algorithms on which seats should be offered to requests. We propose an algorithm that offers revenue improvements from a ``naive\u27\u27 policy on the order of 5-10%. Throughout, we aim for managerial relevance, providing implications to current techniques both in strategy as well as operations

Creating an Objective Methodology for Human-Robot Team Configuration Selection

As technology has been advancing and designers have been looking to future applications, it has become increasingly evident that robotic technology can be used to supplement, augment, and improve human performance of tasks. Team members can be combined in various combinations to better utilize their capabilities and skills to create more efficient and diversified operational teams. A primary obstacle to integrating new robotic technology has been the inability to quantitatively compare overall team performance between very different team configurations without limiting the analysis to a few metrics. To-date, mission designers have arbitrarily assigned importance to mission parameters, subjectively limiting the search space. While this has been effective at evaluating individual mission plans, the arbitrary evaluation criteria has made a straightforward comparison between different research projects and ranking scales impossible. The question then becomes how to select an objective set of criteria for any given problem. It is this final question that this research sought to answer. A methodology was developed to facilitate performance comparison amongst heterogeneous human and robot teams. This methodology makes no assumptions about mission priorities or preferences. Instead, it provides an objective, generic, quantitative method to reduce the complexity of the mission designer's decision space. It employs an heuristic, greedy objective reduction algorithm to reduce problem complexity and a multi-objective genetic algorithm to explore the design space. The human-robot team configuration selection problem was utilized as the application that motivated this research. The methodology, however, will be applicable to a wider domain of research. It will provide a structure to enable broader search of the design space, exploration of the differences between performance metrics, and comparison of optimization models that facilitate evaluation of the design options

Frontiers of Membrane Computing: Open Problems and Research Topics

This is a list of open problems and research topics collected after the Twelfth Conference on Membrane Computing, CMC 2012 (Fontainebleau, France (23 - 26 August 2011), meant initially to be a working material for Tenth Brainstorming Week on Membrane Computing, Sevilla, Spain (January 30 - February 3, 2012). The result was circulated in several versions before the brainstorming and then modified according to the discussions held in Sevilla and according to the progresses made during the meeting. In the present form, the list gives an image about key research directions currently active in membrane computing

NERSC-6 Workload Analysis and Benchmark Selection Process

This report describes efforts carried out during early 2008 to determine some of the science drivers for the"NERSC-6" next-generation high-performance computing system acquisition. Although the starting point was existing Greenbooks from DOE and the NERSC User Group, the main contribution of this work is an analysis of the current NERSC computational workload combined with requirements information elicited from key users and other scientists about expected needs in the 2009-2011 timeframe. The NERSC workload is described in terms of science areas, computer codes supporting research within those areas, and description of key algorithms that comprise the codes. This work was carried out in large part to help select a small set of benchmark programs that accurately capture the science and algorithmic characteristics of the workload. The report concludes with a description of the codes selected and some preliminary performance data for them on several important systems

CELLmicrocosmos - Integrative cell modeling at the molecular, mesoscopic and functional level

Sommer B. CELLmicrocosmos - Integrative cell modeling at the  molecular, mesoscopic and functional level. Bielefeld: Bielefeld University; 2012.The modeling of cells is an important application area of Systems Biology. In the context of this work, three cytological levels are defined: the mesoscopic, the molecular and the functional level. A number of related approaches which are quite diverse will be introduced during this work which can be categorized into these disciplines. But none of these approaches covers all areas. In this work, the combination of all three aforementioned cytological levels is presented, realized by the CELLmicrocosmos project, combining and extending different Bioinformatics-related methods. The mesoscopic level is covered by CellEditor which is a simple tool to generate eukaryotic or prokaryotic cell models. These are based on cell components represented by three-dimensional shapes. Different methods to generate these shapes are discussed by using partly external tools such as Amira, 3ds Max and/or Blender; abstract, interpretative, 3D-microscopy-based and molecular-structure-based cell component modeling. To communicate with these tools, CellEditor provides import as well as export capabilities based on the VRML97 format. In addition, different cytological coloring methods are discussed which can be applied to the cell models. MembraneEditor operates at the molecular level. This tool solves heterogeneous Membrane Packing Problems by distributing lipids on rectangular areas using collision detection. It provides fast and intuitive methods supporting a wide range of different application areas based on the PDB format. Moreover, a plugin interface enables the use of custom algorithms. In the context of this work, a high-density-generating lipid packing algorithm is evaluated; The Wanderer. The semi-automatic integration of proteins into the membrane is enabled by using data from the OPM and PDBTM database. Contrasting with the aforementioned structural levels, the third level covers the functional aspects of the cell. Here, protein-related networks or data sets can be imported and mapped into the previously generated cell models using the PathwayIntegration. For this purpose, data integration methods are applied, represented by the data warehouse DAWIS-M.D. which includes a number of established databases. This information is enriched by the text-mining data acquired from the ANDCell database. The localization of proteins is supported by different tools like the interactive Localization Table and the Localization Charts. The correlation of partly multi-layered cell components with protein-related networks is covered by the Network Mapping Problem. A special implementation of the ISOM layout is used for this purpose. Finally, a first approach to combine all these interrelated levels is represented; CellExplorer which integrates CellEditor as well as PathwayIntegration and imports structures generated with MembraneEditor. For this purpose, the shape-based cell components can be correlated with networks as well as molecular membrane structures using Membrane Mapping. It is shown that the tools discussed here can be applied to scientific as well as educational tasks: educational cell visualization, initial membrane modeling for molecular simulations, analysis of interrelated protein sets, cytological disease mapping. These are supported by the user-friendly combination of Java, Java 3D and Web Start technology. In the last part of this thesis the future of Integrative Cell Modeling is discussed. While the approaches discussed here represent basically three-dimensional snapshots of the cell, prospective approaches have to be extended into the fourth dimension; time

Heuristic Approaches to Portfolio Optimization.

One of the most frequently studied areas in finance is the classical mean-variance portfolio selection model pioneered by Harry Markowitz; which is also, undoubtedly recognized as the foundation of modern portfolio theory. The model in its basic form deals with the selection of portfolio of assets such that a reasonable trade-off is achieved between the conflicting objectives of maximum possible return at a minimum risk, given that the right choice of constituent assets is made and proper weights are allocated. However, despite its enormous contribution to this branch of knowledge, the model is not immune from criticisms ranging from those associated with its in ability to capture the realism of an investment setting - such as transaction costs, cardinality constraints, floor and ceiling constraints, etc. In this research we extended the classical model by incorporating into it the cardinality as well as the floor & ceiling constraints after which we implemented six different metaheuristic algorithms to solve this advanced model. We then designed and implemented some neighbourhood transition strategies to enable our designed algorithms solve the problem in an efficient and intelligent way. Furthermore, we proposed a new portfolio selection model with target-semivariance (as defined in a previous research) as the objective, and constrained by additional real life (cardinality and floor & ceiling) constraints