• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 213
  • 45
  • 27
  • 26
  • 24
  • 21
  • 16
  • 15
  • 12
  • 7
  • 6
  • 4
  • 3
  • 3
  • 2
  • Tagged with
  • 456
  • 71
  • 56
  • 55
  • 47
  • 40
  • 39
  • 35
  • 31
  • 31
  • 30
  • 30
  • 29
  • 25
  • 24
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
111

XML Parsers - A comparative study with respect to adaptability

Holm, Johan, Gustavsson, Mats January 2018 (has links)
Data migration is common as information needs to be moved and transformed between services and applications. Performance in the context of speed is important and may have a crucial impact on the handling of data. Information can be sent in varying formats and XML is one of the more commonly used. The information that is sent can change in structure from time to time and these changes needs to be handled. The parsers’ ability to handle these changes are described as the property “adaptability”. The transformation of XML files is done with the use of parsing techniques. The parsing techniques have different approaches, for example event-based or memory-based. Each approach has its pros and cons. The aim of this study is to research how three different parsers handle parsing XML documents with varying structures in the context of performance. The chosen parsing techniques are SAX, DOM and VTD. SAX uses an event-based approach while DOM and VTD uses a memory-based. Implementation of the parsers have been made with the purpose to extract information from XML documents an adding it to an ArrayList. The results from this study show that the parsers differ in performance, where DOM overall is the slowest and SAX and VTD perform somewhat equal. Although there are differences in the performance between the parsers depending on what changes are made to the XML document.
112

Měření a hodnocení výkonnosti firem ve vybraném odvětví / Measurement and evaluation of efficiencies of companies in chosen branch

MASTNÝ, Miroslav January 2009 (has links)
My work dwells on measurement and evaluation of efficiencies of companies and on sector analysis of energetic branch. We can regard the efficiency with various points of view. Generally we can define it as an ability of company to valorize as much as possible the assest that was put in it. At first my work is engaged in measurement and control of the efficiency of companies and in value control of efficiency. After that follows the summary of traditional and modern indicators of efficiency with account of their advatnages and shortcomings. Then I mention some instruments and concepts that contribute to increases of efficiency. The last part of my work contains case study, where I analyse the efficiency of companies acting in energetic branch by means of benchmark study.
113

Spatial Star Shema Benchmark – um benchmark para data warehouse geográfico

Nascimento, Samara Martins do 25 March 2013 (has links)
Submitted by Luiz Felipe Barbosa (luiz.fbabreu2@ufpe.br) on 2015-03-12T15:00:05Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Dissertação Samara Nascimento.pdf: 9257843 bytes, checksum: 902eb4bdc806735989a42837a7f7bbe3 (MD5) / Approved for entry into archive by Daniella Sodre (daniella.sodre@ufpe.br) on 2015-03-13T13:15:07Z (GMT) No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Dissertação Samara Nascimento.pdf: 9257843 bytes, checksum: 902eb4bdc806735989a42837a7f7bbe3 (MD5) / Made available in DSpace on 2015-03-13T13:15:07Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Dissertação Samara Nascimento.pdf: 9257843 bytes, checksum: 902eb4bdc806735989a42837a7f7bbe3 (MD5) Previous issue date: 2013-03-25 / CNPQ / A técnica experimental de avaliação de desempenho utilizada em aplicações e sistemas de bancos de dados é composta principalmente da técnica de benchmark, que consiste em um conjunto de testes experimentais previamente definidos e posteriormente executados para obtenção de resultados de desempenho. Data Warehouses Geográficos (DWG) permitem o armazenamento de geometrias dos objetos que representam localizações na superfície terrestre e possibilitam o processamento de consultas analíticas e multidimensionais. Os benchmarks TPC-D, TPC-H e SSB são utilizados para avaliar o desempenho de Data Warehouses Convencionais. O benchmark Spadawan é utilizado para avaliar o desempenho de Data Warehouses Geográficos. Contudo, os benchmarks anteriores não conseguem ser considerados abrangentes, devido a sua limitada carga de trabalho. Desta forma, nesta dissertação, propomos um novo benchmark, chamado Spatial Star Schema Benchmark, ou Spatial SSB, projetado especialmente para realizar a avaliação de desempenho de consultas em ambientes de DWG. As principais contribuições do Spatial SSB estão concentradas em três pontos. Primeiro, o Spatial SSB utiliza três tipos de dados geométricos (i.e. pontos, linhas e polígonos), propostos em um esquema híbrido. Além disto, garante o controle da seletividade, que indica o número de linhas retornadas na tabela de fatos para cada consulta espacial pertencente à carga de trabalho deste benchmark. Segundo, o Spatial SSB controla a geração e distribuição dos dados no extent, assim como a variação do volume de dados, tanto aumentando a complexidade dos objetos espaciais, quanto aumentando o número de objetos espaciais, pelo aumento do fator de escala. Terceiro, o Spatial SSB obtém o número de objetos intersectados por janelas de consultas definidas de forma ad hoc, que sobrepõem uma porcentagem do extent definida pelo usuário. Os resultados experimentais mostraram que estas características degradam significativamente o desempenho de consultas sobre DWG.
114

RTSCup: testbed for multiagent systems evaluation / Vicente Vieira Filho.

Vieira Filho, Vicente 31 January 2008 (has links)
Made available in DSpace on 2014-06-12T15:57:40Z (GMT). No. of bitstreams: 2 arquivo3218_1.pdf: 3612539 bytes, checksum: 40d4ce8fc0d298c91987ed31e8b8fc74 (MD5) license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2008 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / A avaliação de sistemas computacionais é uma importante fase em seu processo de desenvolvimento, e isso não é diferente para sistemas que utilizam Inteligência Artificial (IA). Para esses sistemas, em particular, existe uma tendência à utilização de ambientes de simulação, conhecidos como testbeds, os quais auxiliam na avaliação desses sistemas em diferentes cenários de teste. A área de concentração desse trabalho é Sistemas Multiagentes (SMA). Essa área de pesquisa encontra-se em fase de expansão devido aos SMAs estarem sendo empregados em problemas considerados difíceis ou até mesmo impossíveis de serem solucionados por um único agente ou por sistemas monolíticos. Além disso, vários problemas interessantes surgem durante a interação entre os agentes normalmente envolvendo a resolução distribuída de problemas em tempo real. Atualmente existem vários testbeds utilizados na atividade de pesquisa na área de SMA tais como Trading Agent Competition, RoboCup Rescue e ORTS. Entretanto, a maioria desses testbeds não apresenta as características necessárias para auxiliar os pesquisadores na definição, implementação e validação de suas hipóteses. Este trabalho apresenta um ambiente de simulação, chamado RTSCup, para ser utilizado como testbed para implementação de aplicações na área de Sistemas Multiagentes. O RTSCup já foi utilizado com sucesso em experimentos práticos durante competições realizadas entre estudantes da Universidade Federal de Pernambuco
115

Análise de sistemas operacionais de tempo real

Luiz Souza Moreira, Anderson January 2007 (has links)
Made available in DSpace on 2014-06-12T16:00:18Z (GMT). No. of bitstreams: 2 arquivo6366_1.pdf: 916097 bytes, checksum: 97d1590a79f754b720809815be7c379e (MD5) license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2007 / Sistemas críticos de tempo real estão se tornando cada vez mais utilizados. A grande complexidade na criação de aplicações para tempo real favorece o surgimento de novos recursos que facilitam ao projetista adequar tais sistemas às suas necessidades, entre eles os Sistemas Operacionais de Tempo Real (SOTR). Conseqüência disso é que a adoção dos SOTR têm aumentado significativamente, principalmente entre os que são baseados em Sistemas Operacionais de Propósito Geral (SOPG), mais precisamente os que são baseados em Linux. Existem também aqueles sistemas que foram desenvolvidos especificamente para o tratamento de tarefas temporais, sendo um dos mais famosos o VxWorks da Wind River como também o Windows CE da Microsoft. Contudo o SOTR é uma peça integrante em um sistema de tempo real. O presente trabalho tem como ideal facilitar o projetista de tempo real a escolher entre os diversos tipos de SOTR, entre eles o sistema proprietário da Microsoft, Windows CE e os sistemas de código aberto RTLinux e RTAI. Elementos chaves, como previsibilidade, tamanho, modularidade e adaptabilidade são verificados para ter o conhecimento necessário que auxilie o projetista no desenvolvimento de sistemas mais confiáveis. O resultado final será a verificação da real capacidade e maturidade de tais sistemas, auxiliando o projetista de tempo real na criação de aplicações. Também será analisado se os mesmos podem ter seus escalonadores modificados
116

OpenMPBench : An Open-Source Benchmark for Multiprocessor Based Embedded Systems / OpenMPBench : en Open-Source riktmärke för multiprocessor baserade inbyggda system

Liang, Yuchen, Iqbal, Syed Muhammad Zeeshan January 2010 (has links)
It is a new and open-source benchmark for multiprocessor based embedded system. It comprises a set of parallel implementations for seven classical algorithms that cover different computing features of general-purpose processor. The performance data including tables and figures is provided for guiding the potential users to evaluate the design of multiprocessor based embedded system. The parallel implementations for seven applications that cover four categories are shown according to the category: Automation and Industry Control * Bitcount * SUSAN * BASICMATH Network * Patricia * Dijkstra Office * Stringsearch Security * SHA Among them, Bitcount and Dijkstra involve more than one parallel application implemented for different functions or using different strategies. Bitcount consists three parallel applications, parallel Bitcnt_1, parallel Bitstring and parallel Bitcnts, that implemented bit counting with different strategy. Three parallel applications implemented for Dijkstra. One is for all-pairs shortest paths problem. Another two are for solving single-source shortest paths problem using single queue strategy and multiple queue strategy respectively. Stringsearch consists of Pratt-Boyer-Moore, Case-sensitive Boyer-Moore-Horspool, Case-Insensitive Boyer-Moore-Horspool, and Boyer-Moore-Horspool (Case-insensitive with accented character translation) implementations. Source code of sequential versions of these applications download from Mibench as well as the standard output based on x86-linux. For OpenMPBench, all parallel applications have been implemented in ANCI C language using POSIX threads. All libraries related to implementations are based on GNU standard library. Development environment is in UBUNTU 9.04 with 2.6.28-generic Linux kernel, GCC 4.2.4 compiler, and Emacs 22.1 editor. On the basis of current hardware condition, a workstation with 8 processors, shipped with UBUNTU 4.2.4, is selected for experiment environment. UBUNTU is a free GNU Linux version that offers all GNU standard library and GCC has been installed by default. In conclusion, we consider this experiment environment is available to simulate the multiprocessor based on embedded systems. / Det är en ny och öppen källkod riktmärke för multiprocessor baserade inbyggda system. Det innehåller en rad parallella implementationer i sju klassiska algoritmer som täcker olika datorer funktioner i allmänt bruk processor. Uppgifter om prestanda inklusive tabeller och siffror ges för att styra potentiella användare att utvärdera utformningen av multiprocessor baserade inbyggda system. De parallella implementeringar för sju ansökningar som omfattar fyra kategorier visas beroende på vilken kategori: Automation och industri Control * Bitcount * SUSAN * BASICMATH Nätverk * Patricia * Dijkstra Office * Stringsearch Säkerhet * SHA Bland dem, Bitcount och Dijkstra omfattar mer än en parallell ansökan genomförs för olika funktioner eller med hjälp av olika strategier. Bitcount består tre parallella program, parallell Bitcnt_1, parallell Bitstring och parallella Bitcnts, som genomförs bit räknar med olika strategi. Tre parallella ansökningar genomförs för Dijkstra. Den ena är för all-par kortaste stigar problem. Ytterligare två är för att lösa enda källa kortaste stigar problemet, använder en kö strategi och flera kö strategi respektive. Stringsearch består av Pratt-Boyer-Moore, skiftlägeskänslig Boyer-Moore-Horspool, skiftlägesokänslig Boyer-Moore-Horspool, och Boyer-Moore-Horspool (små bokstäver med accenttecken översättning) implementationer. Källkod sekventiell versioner av dessa program att hämta från Mibench liksom standard produktion baserad på x86-linux. För OpenMPBench har alla parallella ansökningar har genomförts i ANCI C-språk med POSIX trådar. Alla bibliotek i samband med implementationer är baserat på GNU standard bibliotek. Utvecklingsmiljö i Ubuntu 9.04 med 2.6.28-generic Linuxkärnan, GCC 4.2.4 kompilator och Emacs 22,1 redaktör. På grundval av nuvarande hårdvara skick, en arbetsstation med 8 processorer, som levereras med Ubuntu 4.2.4, har valts för experiment miljön. Ubuntu är ett gratis GNU Linux-version som kan erbjuda alla GNU Standard bibliotek och GCC har installerats som standard. Sammanfattningsvis anser vi att detta experiment miljön är tillgänglig för att simulera multiprocessor baserade på inbyggda system. / Yuchen Liang: phone no: 8641182120823 6-3-1, No. 44, Huabei Road Ganduan, Ganjingzi District, Dalian City, 116023, Liaoning Province, P. R. China Syed Muhammad Zeeshan Iqbal: phone no: 92415510275 Muhallah Gurunanak Pura, Street No: 7, House No:211, Faisalabad, Pakistan
117

Comparing Pixel-based Quality of Experience in Remote Desktop Applications / Jämförelse av Upplevd Kvalitet i Fjärrskrivbord

Holm, Sally, Ringström, Sebastian January 2020 (has links)
Få verktyg är riktade uttryckligen till fjärråtkomst och fjärrskrivbordprestanda. De få verktyg som gör det är utvecklade specifikt till det användarområde som de var utformade för och är därför begränsade i sin tillämpning. Eftersom upplevelsekvalitet är en problematisk term att sätta fingret på, eftersom det är, per definition, subjektivt och kommer därför skilja sig mellan användare, uppmuntrar användandet av ett verktyg som kan mäta prestandan. I detta papper undersökts om ett universellt verktyg kan användas för att jämföra fjärrskrivbordsprogram från en användares perspektiv. Genom att fokusera på vad användare ser på skärmen från fjärrskrivbordsprogrammet, så försäkrar denna vinkel att mätningarna tagna är oberoende av vad för fjärrskrivbords protokoll, eller vad för fjärrskrivbordprogram som används. Med målet att kunna mäta en skillnad mellan två tester, så användes två applikationer, TeamViewer och RealVNC, för att ansluta till en maskin och utföra en rad förprogrammerade handlingar. Tester med varierande nätverksfördröjning spelades in i form av skärmklipp, som därefter analyserades av ett program som kan upptäcka färgskillnader på pixlar mellan två tester. Resultatet visar att det finns en mätbar skillnad mellan de två olika fjärrskrivbordsprogrammen, vilket ger hopp om att i framtiden så kan en universal metod tas fram för att mäta upplevelsekvalitet på fjärrskrivbord. / Few tools are targeted explicitly to remote access and remote desktop performance, those who do, are highly specified to the scenarios they were designed for and are therefore limited in their application. Since Quality of Experience (QoE) is a problematic term to pinpoint, as it is, by definition, subjective and will therefore differ between users, it encourages the use of a tool that can measure performance. This paper examines whether a universal tool can be used to compare remote desktop applications from a QoE perspective. By focusing on what is displayed, rather than how the remote desktop application displays it, this angle ensures that the measurements taken are independent of what remote desktop protocol or application are used. With the goal to able to measure a difference between two tests, two applications, TeamViewer and RealVNC, were used to connect to a machine and perform a series of pre-scripted actions. Tests with varying network latency were recorded in the form of screenshots, which were then analysed by a program that can detect colour differences in pixels between two tests. The results show that there is a measurable difference between the two different remote desktop applications, which gives hope that in the future a universal method can be developed to measure the Quality of Experience of remote desktop applications.
118

Persistent Aerial Tracking

Mueller, Matthias 13 April 2016 (has links)
In this thesis, we propose a new aerial video dataset and benchmark for low altitude UAV target tracking, as well as, a photo-realistic UAV simulator that can be coupled with tracking methods. Our benchmark provides the first evaluation of many state of-the-art and popular trackers on 123 new and fully annotated HD video sequences captured from a low-altitude aerial perspective. Among the compared trackers, we determine which ones are the most suitable for UAV tracking both in terms of tracking accuracy and run-time. We also present a simulator that can be used to evaluate tracking algorithms in real-time scenarios before they are deployed on a UAV ”in the field”, as well as, generate synthetic but photo-realistic tracking datasets with free ground truth annotations to easily extend existing real-world datasets. Both the benchmark and simulator will be made publicly available to the vision community to further research in the area of object tracking from UAVs. Additionally, we propose a persistent, robust and autonomous object tracking system for unmanned aerial vehicles (UAVs) called Persistent Aerial Tracking (PAT). A computer vision and control strategy is applied to a diverse set of moving objects (e.g. humans, animals, cars, boats, etc.) integrating multiple UAVs with a stabilized RGB camera. A novel strategy is employed to successfully track objects over a long period, by ’handing over the camera’ from one UAV to another. We integrate the complete system into an off- 4 the-shelf UAV, and obtain promising results showing the robustness of our solution in real-world aerial scenarios.
119

Benchmarking XML Database Systems: First Experiences

Böhme, Timo, Rahm, Erhard 09 November 2018 (has links)
We recently developed and published a scaleable multi-user benchmark called XMach-1 (XML Data Management benchmark) for evaluating the performance of XML data management systems [1]. To our knowledge it is the first such benchmark. It aims at realistically evaluating the performance of individual systems as well as to allow for a performance comparison between different systems and architectures ranging from native XML data management systems to XML-enabled relational DBMS. Specifying and implementing the benchmark revealed a number of problems which are partly due to the lack of a standardized XML query language, the complexity of the XML format and the relative immaturity of current XML database software. After a brief review of XMach-1 we will discuss our experiences made so far.
120

The effects of constraints on the performance of actively managed funds in relation to their benchmark indices

Eiselen, Linda Minette January 2018 (has links)
Actively-managed funds have recently come under fire as it has been determined that they consistently underperform passive funds. Benchmarking, and the constraints placed on actively-managed funds, are standard practices within the industry, but research suggests that these constraints negatively affect fund performance. This research paper explores the effectiveness of actively-managed funds in relation to their benchmark indices, in terms of tracking errors and weighting constraints. This is done by qualifying the effect of these constraints on the performance of hypothetically constructed portfolios in relation to the FTSE / JSE Top 40 Index. The results are presented graphically and show that tracking error limits did, as expected, limit the possible upside returns of these funds. It was found however, that the tracking error constraints had a much greater effect on limiting downside risk than they had on limiting upside effects. Weighting limitations did not have a single universal effect on the simulated portfolios’ performance but affect performance in conjunction with tracking error limits. It was concluded that for the hypothetically constructed portfolios for the period studied, constraints did not affect the possible upside return to such a magnitude that the constraints themselves could account for the underperformance of actively managed funds and they had an overall positive effect on performance. / Mini Dissertation (MBA)--University of Pretoria, 2018. / Gordon Institute of Business Science (GIBS) / MBA / Unrestricted

Page generated in 0.0268 seconds