In mobile and wireless networks, data broadcasting for popular data items enables the efficient utilization of the limited wireless bandwidth. However, efficient data scheduling schemes are needed to fully exploit the benefits of data broadcasting. Towards this goal, several broadcast scheduling policies have been proposed. These existing schemes have mostly focused on either minimizing response time, or drop rate, when requests are associated with hard deadlines. The inherent inaccuracy of hard deadlines in a dynamic mobile environment motivated us to use Service Level Agreements (SLAs) where a user specifies the utility of data as a function of its arrival time. Moreover, SLAs provide the mobile user with an already familiar quality of service specification from wired environments. Hence, in this dissertation, we propose SAAB, an SLA-aware adaptive data broadcast scheduling policy for maximizing the system utility under SLA-based performance measures. To achieve this goal, SAAB considers both the characteristics of disseminated data objects as well as the SLAs associated with them. Additionally, SAAB automatically adjusts to the system workload conditions which enables it to constantly outperform existing broadcast scheduling policies.

In mobile and wireless networks, data broadcasting for popular data items enables the efficient utilization of the limited wireless bandwidth. However, efficient data scheduling schemes are needed to fully exploit the benefits of data broadcasting. Towards this goal, several broadcast scheduling policies have been proposed. These existing schemes have mostly focused on either minimizing response time, or drop rate, when requests are associated with hard deadlines. The inherent inaccuracy of hard deadlines in a dynamic mobile environment motivated us to use Service Level Agreements (SLAs) where a user specifies the utility of data as a function of its arrival time. Moreover, SLAs provide the mobile user with an already familiar quality of service specification from wired environments. Hence, in this dissertation, we propose SAAB, an SLA-aware adaptive data broadcast scheduling policy for maximizing the system utility under SLA-based performance measures. To achieve this goal, SAAB considers both the characteristics of disseminated data objects as well as the SLAs associated with them. Additionally, SAAB automatically adjusts to the system workload conditions which enables it to constantly outperform existing broadcast scheduling policies.

Submitted by Pedro Mizukami (pedro.mizukami@fgv.br) on 2011-08-17T22:05:36Z No. of bitstreams: 1 DMPPJ - ROSÂNGELA OLIVIERI.pdf: 4814344 bytes, checksum: d767b7d40429dd4631c936543af77882 (MD5) / Approved for entry into archive by Pedro Mizukami (pedro.mizukami@fgv.br) on 2011-08-19T17:44:12Z (GMT) No. of bitstreams: 1 DMPPJ - ROSÂNGELA OLIVIERI.pdf: 4814344 bytes, checksum: d767b7d40429dd4631c936543af77882 (MD5) / Made available in DSpace on 2011-09-01T13:02:46Z (GMT). No. of bitstreams: 1 DMPPJ - ROSÂNGELA OLIVIERI.pdf: 4814344 bytes, checksum: d767b7d40429dd4631c936543af77882 (MD5) Previous issue date: 2010 / Este estudo teve o objetivo de examinar a contribuição do processo eletrônico na redução do tempo médio de tramitação do processo. Para alcançar este objetivo, realizou-se pesquisa descritiva documental, com dados de campo coletados, em junho de 2009, em catorze Juizados Especiais Federais e três Turmas Recursais da 2ª Região, totalizando 1444 processos (físicos e eletrônicos) que atingiram a baixa finda no referido mês. Os principais resultados indicam que, no período observado, o processo eletrônico foi mais célere do que o processo físico, alcançando, em média, 70% de redução do tempo de tramitação do processo. Sustentam também que essa redução é variável no tempo transcorrido entre fases distintas do processo. Nesse contexto, propõe-se a criação de indicador de Tempo Médio de Tramitação do Processo, que indique a ocorrência atualizada de cada fase selecionada, em comparação com o passado, pois ambos constituem referência para análise e estudo de situações e tomadas de decisão relativas à celeridade na prestação jurisdicional, sem perda da qualidade dos resultados já obtidos. Em síntese, os resultados sustentam a premissa de que o processo eletrônico é uma das ferramentas valiosas para combater a morosidade no Poder Judiciário e auxiliar no aumento do Índice de Confiança na Justiça no Brasil, fortalecendo o Poder Judiciário e ampliando o acesso à Justiça. Ao final, apresentam-se conclusões e sugestões que têm em vista acelerar e ampliar o acesso à justiça. / This study aimed to examine the contribution of the electronic process in reducing the average length of the proceedings. To achieve this goal, we carried out descriptive documentary, with field data collected in June 2009, in fourteen Special Federal Courts and three Courts of Appeal in the 2nd Region, totaling 1444 cases (physical and electronic) that reached their conclusion that month. The main results indicate that during the period observed, the electronic process is faster than the physical process, reaching on average 70% reduction in length of the proceedings. It was also found that this reduction is variable in time among distinct stages of the processo Based on these results and directions of the doctrine, it is proposed to create an indicator of average time of proceedings, which indicates the current occurrence of each stage selected, as well as past behavior, since both make reference to analysis and study of situations and future decision-making associated with the speed of adjudication, without loss of quality of the results already obtained. The electronic process is one of the tools used to address delays in the judicial branch and can help increase the Index of Confidence in Justice in Brazil, strengthening the judiciary and enhancing access to justice. In the end, we present conclusions and suggestions which are intended to accelerate and expand access to justice.

Der Aufsatz beschäftigt sich mit den aktuellen Änderungen des Sachverständigenrechtes aufgrund der ZPO-Novelle am 15.10.2016. Die Novellierung des Sachverständigenrechtes stellt im Wesentlichen eine Festschreibung der bisher bereits bestehenden Praxis dar. Sie beschränkt sich auf fünf Rechtsnormierungen und hat damit nicht alle Optimierungsmöglichkeiten des Sachverständigenrechtes ausgeschöpft, die dieses zulassen würde. Ob es sinnvoll war, eine verpflichtende Anhörung der Parteien vor der Benennung des Sachverständigen einzuführen, wird sich in der Praxis erst noch weisen müssen. Zumindest wird die Richterschaft hierdurch in der bislang allein ihrem Ermessen unterliegenden Verfahrensgestaltung begrenzt.

Submitted by Bruno Rodrigo Pereira (brunorp85@gmail.com) on 2015-01-16T16:41:00Z No. of bitstreams: 1 Bruno Pereira.pdf: 421482 bytes, checksum: e18975a6489a6c78d53c53117da75c7d (MD5) / Approved for entry into archive by JOANA MARTORINI (joana.martorini@fgv.br) on 2015-01-16T18:38:08Z (GMT) No. of bitstreams: 1 Bruno Pereira.pdf: 421482 bytes, checksum: e18975a6489a6c78d53c53117da75c7d (MD5) / Made available in DSpace on 2015-01-16T19:56:33Z (GMT). No. of bitstreams: 1 Bruno Pereira.pdf: 421482 bytes, checksum: e18975a6489a6c78d53c53117da75c7d (MD5) Previous issue date: 2014-12-16 / The relationship between investment fund raising and performance are very common in the literature of Brazilian funds, and papers shown that investors make their investment decisions based on the recent performance of the funds, applying more in funds with good recent performance than funds that yield below the market average.This work is dedicated to, more than investigate the uptake ratio and performance of investment funds in Brazil, further study regarding the payback period longer considered by investors when choosing products to invest, that is, if you are already documented the literature that this behavior exists, we want to know: what is the exact performance period more analyzed by investors when choosing your funds? The results achieved through regression on panel with fixed time effect model is that the deadlines that have greater representation in the investor's choice are the windows from one month up to six months and from six months up to one year history, longer terms have the same positive relationship but fall considerably. / A relação entre captação e desempenho é muito estudada na literatura brasileira de fundos. Os artigos sobre o tema atestam que os investidores tomam suas decisões de investimentos baseados no desempenho recente dos fundos, aplicando mais em fundos com bom desempenho recente do que em fundos que rendem abaixo da média de mercado. Esse trabalho dedica-se a, mais do que investigar a relação entre captação e desempenho de fundos de investimentos no Brasil, aprofundar o estudo no tocante ao prazo de retorno mais considerado pelos investidores ao escolherem em qual fundo investir. O resultado alcançado através de nossas regressões em painel com efeito fixo de tempo é de que os prazos com maior representatividade na escolha do investidor são as janelas de um até seis meses e de seis meses até um ano de histórico. Prazos maiores têm a mesma relação positiva, mas caem consideravelmente.

Scheduling is extremely important for modern real-time systems. It enables several programs to run in parallel and succeed with their tasks. Many systems today are real-time systems, which means that good scheduling is highly needed. This thesis aims to evaluate the real-time scheduling algorithm earliest deadline first, newly introduced into the Linux kernel, and compare it to the already existing real-time scheduling algorithms first in, first out and round robin in the context of firm tasks. By creating a test program that can create pthreads and set their scheduling characteristics, the performance of earliest deadline first can be evaluated and compared to the others. / Schemaläggning är extremt viktigt för dagens realtidssystem. Det tillåter att flera program körs parallellt samtidigt som deras processer inte misslyckas med sina uppgifter. Idag är många system realtidssystem, vilket innebär att det finns ett ytterst stort behov för en bra schemaläggningsalgoritm. Målet med det här examensarbetet är att utvärdera schema-läggningsalgoritmen earliest deadline first som nyligen introducerats i operativsystemet Linux. Målet är även att jämföra algoritmen med två andra schemaläggningsalgoritmer (first in, first out och round robin), vilka redan är väletablerade i Linux kärnan. Det här görs med avseende på processer klassificerade som firm. Genom att skapa ett program som kan skapa pthreads med önskvärda egenskaper kan prestandan av earliest deadline first algoritmen utvärderas, samt jämföras med de andra algoritmerna.

Este trabajo analiza la idoneidad de dos de los principales métodos de asignación de tareas en entornos con restricciones temporales. Se pondrá de manifiesto que ambos tipos de mecanismos presentan carencias para tratar tareas con deadlines, especialmente cuando los robots han de formar coaliciones. Uno de los aspectos a los que esta tesis dedica mayor atención es la predicción del tiempo de ejecución, que depende, entre otros factores, de la interferencia física entre robots. Este fenómeno no se ha tenido en cuenta en los mecanismos actuales de asignación basados en subastas. Así, esta tesis presenta el primer mecanismo de subastas para la creación de coaliciones que tiene en cuenta la interferencia entre robots. Para ello, se ha desarrollado un modelo de predicción del tiempo de ejecución y un nuevo paradigma llamado subasta doble. Además, se han propuesto nuevos mecanismos basados en swarm

Des nombreuses applications participatives, commerciales et académiques se appuient sur des volontaires ("la foule") pour acquérir, désambiguiser et nettoyer des données. Ces applications participatives sont largement connues sous le nom de plates-formes de crowdsourcing où des amateurs peuvent participer à de véritables projets scientifiques ou commerciaux. Ainsi, des demandeurs sous-traitent des tâches en les proposant sur des plates-formes telles que Amazon MTurk ou Crowdflower. Puis, des participants en ligne sélectionnent et exécutent ces tâches, appelés microtasks, acceptant un micropaiement en retour. Ces plates-formes sont confrontées à des défis tels qu'assurer la qualité des réponses acquises, aider les participants à trouver des tâches pertinentes et intéressantes, tirer parti des compétences expertes parmi la foule, respecter les délais des tâches et promouvoir les participants qui accomplissent le plus de tâches. Cependant, la plupart des plates-formes ne modélisent pas explicitement les compétences des participants, ou se basent simplement sur une description en terme de mots-clés. Dans ce travail, nous proposons de formaliser les compétences des participants au moyen d'une structure hiérarchique, une taxonomie, qui permet naturellement de raisonner sur les compétences (détecter des compétences équivalentes, substituer des participants, ...). Nous montrons comment optimiser la sélection de tâches au moyen de cette taxonomie. Par de nombreuses expériences synthétiques et réelles, nous montrons qu'il existe une amélioration significative de la qualité lorsque l'on considère une structure hiérarchique de compétences au lieu de mots-clés purs. Dans une seconde partie, nous étudions le problème du choix des tâches par les participants. En effet, choisir parmi une interminable liste de tâches possibles peut s'avérer difficile et prend beaucoup de temps, et s’avère avoir une incidence sur la qualité des réponses. Nous proposons une méthode de réduction du nombre de propositions. L'état de l'art n'utilise ni une taxonomie ni des méthodes de classement. Nous proposons un nouveau modèle de classement qui tient compte de la diversité des compétences du participant et l'urgence de la tâche. À notre connaissance, nous sommes les premiers à combiner les échéances des tâches en une métrique d'urgence avec la proposition de tâches pour le crowdsourcing. Des expériences synthétiques et réelles montre que nous pouvons respecter les délais, obtenir des réponses de haute qualité, garder l'intérêt des participants tout en leur donnant un choix de tâches ciblé. / A large number of commercial and academic participative applications rely on a crowd to acquire, disambiguate and clean data. These participative applications are widely known as crowdsourcing platforms where amateur enthusiasts are involved in real scientific or commercial projects. Requesters are outsourcing tasks by posting them on online commercial crowdsourcing platforms such as Amazon MTurk or Crowdflower. There, online participants select and perform these tasks, called microtasks, accepting a micropayment in return. These platforms face challenges such as reassuring the quality of the acquired answers, assisting participants to find relevant and interesting tasks, leveraging expert skills among the crowd, meeting tasks' deadlines and satisfying participants that will happily perform more tasks. However, related work mainly focuses on modeling skills as keywords to improve quality, in this work we formalize skills with the use a hierarchical structure, a taxonomy, that can inherently provide with a natural way to substitute tasks with similar skills. It also takes advantage of the whole crowd workforce. With extensive synthetic and real datasets, we show that there is a significant improvement in quality when someone considers a hierarchical structure of skills instead of pure keywords. On the other hand, we extend our work to study the impact of a participant’s choice given a list of tasks. While our previous solution focused on improving an overall one-to-one matching for tasks and participants we examine how participants can choose from a ranked list of tasks. Selecting from an enormous list of tasks can be challenging and time consuming and has been proved to affect the quality of answers to crowdsourcing platforms. Existing related work concerning crowdsourcing does not use either a taxonomy or ranking methods, that exist in other similar domains, to assist participants. We propose a new model that takes advantage of the diversity of the parcipant's skills and proposes him a smart list of tasks, taking into account their deadlines as well. To the best of our knowledge, we are the first to combine the deadlines of tasks into an urgency metric with the task proposition for knowledge-intensive crowdsourcing. Our extensive synthetic and real experimentation show that we can meet deadlines, get high quality answers, keep the interest of participants while giving them a choice of well selected tasks.