On the Price of Anarchy of Highly Congested Nonatomic Network Games

We consider nonatomic network games with one source and one destination. We examine the asymptotic behavior of the price of anarchy as the inflow increases. In accordance with some empirical observations, we show that, under suitable conditions, the price of anarchy is asymptotic to one. We show with some counterexamples that this is not always the case. The counterexamples occur in very simple parallel graphs.Comment: 26 pages, 6 figure

On The Singular Scheme Of Split Foliations

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)We prove that the tangent sheaf of a codimension-one locally free distribution splits as a sum of line bundles if and only if its singular scheme is arithmetically Cohen-Macaulay. In addition, we show that a foliation by curves is given by an intersection of generically transversal holomorphic distributions of codimension one if and only if its singular scheme is arithmetically Buchsbaum. Finally, we establish that these foliations are determined by their singular schemes, and deduce that the Hilbert scheme of certain arithmetically Buchsbaum schemes of codimension 2 is birational to a Grassmannian.64513591381Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)CNPq [302477/2010-1]FAPESP [2014/14743-8

Non-Preemptive Scheduling on Machines with Setup Times

Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type. The objective is to minimize the makespan of the resulting schedule. We design and analyze an approximation algorithm that runs in time polynomial in n, m and k and computes a solution with an approximation factor that can be made arbitrarily close to 3/2.Comment: A conference version of this paper has been accepted for publication in the proceedings of the 14th Algorithms and Data Structures Symposium (WADS

“Sex, Money, Social Climbing, Fantastic!” – A lógica cultural dos anos de chumbo no cone sul e a história das cinematecas (arquivos/ museus de cinema).

O período abordado aqui está no centro dos debates em torno das ditaduras militares no cone-sul latino-americano. Nosso intuito é analisá-lo a partir do enfoque do que Fredric Jameson chamou de “a lógica cultural do capitalismo tardio”, onde nas palavras da professora Iná Camargo Costa “mercado vira cultura e cultura vira mercado”. Isso porque a indústria do entretenimento cumpriu papel fundamental em dissuadir as massas – sobretudo em seus setores mais conservadores – do significado de um dos principais sentidos ideológicos das transformações políticas advindas com as ditaduras: a preparação para a abertura, em nosso caso ampliação, de novos mercados. O objetivo desse texto é comentar e analisar a ampliação e a preparação para a consolidação de um nicho específico: o mercado do patrimônio, especificamente o cinematográfico

Scheduling MapReduce Jobs under Multi-Round Precedences

We consider non-preemptive scheduling of MapReduce jobs with multiple tasks in the practical scenario where each job requires several map-reduce rounds. We seek to minimize the average weighted completion time and consider scheduling on identical and unrelated parallel processors. For identical processors, we present LP-based O(1)-approximation algorithms. For unrelated processors, the approximation ratio naturally depends on the maximum number of rounds of any job. Since the number of rounds per job in typical MapReduce algorithms is a small constant, our scheduling algorithms achieve a small approximation ratio in practice. For the single-round case, we substantially improve on previously best known approximation guarantees for both identical and unrelated processors. Moreover, we conduct an experimental analysis and compare the performance of our algorithms against a fast heuristic and a lower bound on the optimal solution, thus demonstrating their promising practical performance

A model for transition-based visuospatial pattern recognition

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.Cataloged from PDF version of thesis.Includes bibliographical references (p. 87).In my research, I designed and implemented a system for learning and recognizing visual actions based on state transitions. I recorded three training videos of each of 16 actions (approach, bounce, carry, catch, collide, drop, fly over, follow, give, hit, jump, pick, push, put, take, throw), each lasting 10 seconds and 300 frames. After using a prototype system developed by Dr. Satyajit Rao for focus and actor recognition, actions are represented as qualitative state transitions, tied together to form tens of thousands of patterns, which are then available as action classifiers. The resulting system was able to build simple, intuitive classifiers that fit the training data perfectly.by Telmo Luis Correa Junior.M.Eng

RESUMOS / ABSTRACTS

RESUMOS / ABSTRACT