The aim of this study is to investigate how subtitles might affect students understanding of spoken English. A comparison was made between four classes at Polhemskolan, an upper secondary school in Lund, Sweden. Each class was shown two different scenes from the movies …And Justice for All and The Verdict. Two of the classes were shown the scenes with subtitles and the remaining two without subtitles. During the test the students also filled out a questionnaire with questions about the information disclosed in the scenes. The students’ results were discussed with the help of the Acquisition and Learning theory and different theories dealing with listening comprehension.

This paper examines the competitive dynamics in a standard-based industry through a historical examination of the U.S. home video industry. It analyzes how the Blu-ray technology wins the battle of the high definition DVD market over HD-DVD technology, by focusing on the aspects of the first-mover advantages, network effects. The analysis suggests that the success in the network-based industry partially support to traditional argument on first-mover advantages; they were important only to the point that the first mover takes advantages of the lead time to develop a network of complementary products. This study illustrates that building a network of complementary products and installed base should be the primary goal to succeed in the standard setting competition.

Zip.ca is an online DVD rental company that faces two major operational problems: calculation of the assignment of DVDs to customers every thirty minutes throughout the day and purchasing of new inventory in regular intervals. In this thesis, we model these two problems and develop algorithms to solve them. In doing so, we encounter many theoretical problems that are both applicable to Zip’s operations and intrinsically interesting problems independent of the application. First, we note that the assignment problem facing Zip is inherently in an online setting. With returns of DVDs being processed throughout the day, the dataset is constantly changing. Although the ideal solution would be to wait until the end of the day to make decisions, physical work load capacities prevent this. For this reason we discuss two online problems, online 0-1 budgeted matching and the budgeted Adwords auction. We present a 1/(2 w_max/w_min)-competitive algorithm for the online 0-1 budgeted matching problem, and prove that this is the best possible competitive ratio possible for a wide class of algorithms. We also give a (1− (S+1)/(S+e) )-competitive algorithm for the budgeted Adwords auction as the size of the bids and cost get small compared to the budgets, where S is the ratio of the highest and lowest ratios of bids to costs. We suggest a linear programming approach to solve Zip’s assignment problem. We develop an integer program that models the B-matching instance with additional constraints of concern to Zip, and prove that this integer program belongs to a larger class of integer programs that has totally unimodular constraint matrices. Thus, the assignment problem can be solved to optimality every thirty minutes. We additionally create a test environment to check daily performance, and provide real-time implementation results, showing a marked improvement over Zip’s old algorithm. We show that Zip’s purchasing problem can be modeled by the matching augmentation problem defined as follows. Given a graph with vertex capacities and costs, edge weights, and budget C, find a purchasing of additional node capacity of cost at most C that admits a B-matching of maximum weight. We give a PTAS for this problem, and then present a special case that is polynomial time solvable that still models Zip’s purchasing problem, under the assumption of uniform costs. We then extend the augmentation idea to matroids and present matroid augmentation, matroid knapsack, and matroid intersection knapsack, three NP-hard problems. We give an FPTAS for matroid knapsack by dynamic programming, PTASes for the other two, and demonstrate applications of these problems.

This paper examines the competitive dynamics in a standard-based industry through a historical examination of the U.S. home video industry. It analyzes how the Blu-ray technology wins the battle of the high definition DVD market over HD-DVD technology, by focusing on the aspects of the first-mover advantages, network effects. The analysis suggests that the success in the network-based industry partially support to traditional argument on first-mover advantages; they were important only to the point that the first mover takes advantages of the lead time to develop a network of complementary products. This study illustrates that building a network of complementary products and installed base should be the primary goal to succeed in the standard setting competition.

Zip.ca is an online DVD rental company that faces two major operational problems: calculation of the assignment of DVDs to customers every thirty minutes throughout the day and purchasing of new inventory in regular intervals. In this thesis, we model these two problems and develop algorithms to solve them. In doing so, we encounter many theoretical problems that are both applicable to Zip’s operations and intrinsically interesting problems independent of the application. First, we note that the assignment problem facing Zip is inherently in an online setting. With returns of DVDs being processed throughout the day, the dataset is constantly changing. Although the ideal solution would be to wait until the end of the day to make decisions, physical work load capacities prevent this. For this reason we discuss two online problems, online 0-1 budgeted matching and the budgeted Adwords auction. We present a 1/(2 w_max/w_min)-competitive algorithm for the online 0-1 budgeted matching problem, and prove that this is the best possible competitive ratio possible for a wide class of algorithms. We also give a (1− (S+1)/(S+e) )-competitive algorithm for the budgeted Adwords auction as the size of the bids and cost get small compared to the budgets, where S is the ratio of the highest and lowest ratios of bids to costs. We suggest a linear programming approach to solve Zip’s assignment problem. We develop an integer program that models the B-matching instance with additional constraints of concern to Zip, and prove that this integer program belongs to a larger class of integer programs that has totally unimodular constraint matrices. Thus, the assignment problem can be solved to optimality every thirty minutes. We additionally create a test environment to check daily performance, and provide real-time implementation results, showing a marked improvement over Zip’s old algorithm. We show that Zip’s purchasing problem can be modeled by the matching augmentation problem defined as follows. Given a graph with vertex capacities and costs, edge weights, and budget C, find a purchasing of additional node capacity of cost at most C that admits a B-matching of maximum weight. We give a PTAS for this problem, and then present a special case that is polynomial time solvable that still models Zip’s purchasing problem, under the assumption of uniform costs. We then extend the augmentation idea to matroids and present matroid augmentation, matroid knapsack, and matroid intersection knapsack, three NP-hard problems. We give an FPTAS for matroid knapsack by dynamic programming, PTASes for the other two, and demonstrate applications of these problems.

Gemeinsamer Workshop von Universitaetsrechenzentrum und Professur Rechnernetze und verteilte Systeme (Fakultaet fuer Informatik) der TU Chemnitz. Workshop-Thema: Infrastruktur der ¨Digitalen Universitaet¨

Techn. Universiẗat, Diss., 2003--Darmstadt.

No description available.

<p>This thesis is about cover illustrations of DVD movies as examples of visual communication. I have studied the cover illustrations of the three movies <em>Gran Torino, Secret Window</em> and <em>As White As Snow.</em> My research assignment has been to find out how the cover illustrations of DVD movies communicate in relation to the story. I have also been looking for what makes a cover illustration interesting and if the interest in itself is individually considered or if there are certain general rules regardless of the observer.</p><p>To reach a conclusion I have been studying components in advertising pictures, visual communication and how the commercial producers use advertising to communicate with the observer. Semiotics, advertising and comparisons between the cover illustrations have been my method for analyze.</p><p>I have come to the conclusion that cover illustrations are meticulously produced, and that every single part of them is important for the observers’ over all impression and interpretation of the cover illustration. The place of picture elements, colours, looks and occurrence of persons in the covers are striving to send a uniform message about the cover and movie. They also guide the observer in his/her interpretation of the cover and what kind of movie it represents, and they are components that make the cover more visible. What makes the cover illustration interesting is both something individual and something general. For example the occurrence of humans, looks, strong emotions and colours make the cover more visible and interesting in relation to others. The observers’ interest for the cover may be individual depending on the observer’s experiences and interpretation.</p><p> </p>

This thesis is about cover illustrations of DVD movies as examples of visual communication. I have studied the cover illustrations of the three movies Gran Torino, Secret Window and As White As Snow. My research assignment has been to find out how the cover illustrations of DVD movies communicate in relation to the story. I have also been looking for what makes a cover illustration interesting and if the interest in itself is individually considered or if there are certain general rules regardless of the observer. To reach a conclusion I have been studying components in advertising pictures, visual communication and how the commercial producers use advertising to communicate with the observer. Semiotics, advertising and comparisons between the cover illustrations have been my method for analyze. I have come to the conclusion that cover illustrations are meticulously produced, and that every single part of them is important for the observers’ over all impression and interpretation of the cover illustration. The place of picture elements, colours, looks and occurrence of persons in the covers are striving to send a uniform message about the cover and movie. They also guide the observer in his/her interpretation of the cover and what kind of movie it represents, and they are components that make the cover more visible. What makes the cover illustration interesting is both something individual and something general. For example the occurrence of humans, looks, strong emotions and colours make the cover more visible and interesting in relation to others. The observers’ interest for the cover may be individual depending on the observer’s experiences and interpretation.