Siga este enlace para ver otros tipos de publicaciones sobre el tema: OpenBCI.
Tesis sobre el tema "OpenBCI"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "OpenBCI".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
1
Заворотний, А. О. "Додаток для моніторингу та аналізу стану психофізіологічного здоров'я користувача". Thesis, Чернігів, 2021. http://ir.stu.cn.ua/123456789/25127.
Texto completoResumen
Заворотний, А. О. Додаток для моніторингу та аналізу стану психофізіологічного здоров'я користувача : випускна кваліфікаційна робота : 121 "Інженерія програмного забезпечення" / А. О. Заворотний ; керівник роботи А. М. Акименко ; НУ "Чернігівська політехніка", кафедра технологій та програмної інженерії. – Чернігів, 2021. – 75 с.Об'єктом розробки є додаток для моніторингу та аналізу стану психофізіологічного здоров’я користувача за допомогою методів електроенцефалографії. Результатом роботи є реалізація таких можливостей додатку: – збір даних з пристрою електроенцефалографії у реальному часі; – розпізнавання паттернів активності головного мозку користувача у реальному часі та виділення характеристик станів психофізіологічного здоров’я користувача у реальному часі; – демонстрація статистики зміни станів психофізіологічного здоров’я користувача за довільний проміжок часу у вигляді інтерактивної візуалізації часових рядів; – сповіщення користувача про необхідність перерви та про критичні показники характеристик стану психофізіологічного здоров’я користувача у реальному часі. Для розгортання додатку необхідно встановити на персональному комп'ютері Python версії 3.7+, веб-сервіс Greafana та СУБД RedisTimeSeries. Реалізація додатку була виконана з використанням технологій OpenBCI, BrainFlow, Python, MNE, Timeloop, RedisTimeSeries та Grafana. Для реалізації додатку використовувалося інтегроване середовище розробки Visual Studio Code. Подальша розробка додатку можлива в сторону оптимізації та додання відстежуваних показників. Робота має практичну цінність. Розрахунок економічної цінності не проводився.
The object of development is a software application for monitoring and analysis of the state of psychophysiological health using electroencephalography. The result is an implementation of the following features of the application: – real time data collection from the electroencephalography device; – real-time pattern recognition of user's brain activity; – real-time analysis of a user's psychophysiological health; – interactive visualization of changes in a user's psychophysiological health for any period of time; – informing a user about the need for a break and about critical indicators of a user's brain activity in real time. To deploy the application, you need to install Python version 3.7+, Grafana web service and RedisTimeSeries database. The application was implemented using OpenBCI, BrainFlow, Python, MNE-Python, Timeloop, RedisTimeSeries, Grafana. The integrated development environment Visual Studio Code was used to develop the application. Further development of the application is possible in the direction of optimizing and adding another mental health indicators. The work has practical value. The calculation of economic value was not carried out.
2
Persich, Alexandr. "Analýza a klasifikace dat ze snímače mozkové aktivity". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2020. http://www.nusl.cz/ntk/nusl-417221.
Texto completoResumen
This thesis describes recording, processing and classifying brain activity which is being captured by a brain-computer interface (BCI) device manufactured by OpenBCI company. Possibility of use of such a device for controlling an application with brain activity, specifically with thinking of left or right hand movement, is discussed. To solve this task methods of signal processing and machine learning are used. As a result a program that is capable of recording, processing and classifying brain activity using an artificial neural network is created. An average accuracy of classification of synthetic data is 99.156%. An average accuracy of classification of real data is 73.71%.
3
Mikalsen, Magnus Alvestad. "OpenACC-based Snow Simulation". Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-23000.
Texto completoResumen
In recent years, the GPU platform has risen in popularity in high performance com-puting due to its cost effectiveness and high computing power offered through its manyparallel cores. The GPUs computing power can be harnessed using the low-level GPGPUprogramming APIs CUDA and OpenCL. While both CUDA and OpenCL gives the pro-grammer fine-grained control of a GPUs resources, they are both generally considereddifficult to use and can potentially lead to complicated software design. To simplifyGPGPU programming and gain more mainstream usage of GPUs, there is an increasedinterest in moving the complexity of GPGPU programming over to the compiler. Thishas lead to the development of the directive-based standard for heterogeneous computingcalled OpenACC, supported by NVIDIA, Cray, PGI, CAPS and others.In this thesis, we explore using OpenACC on a high performance snow simulator code de-veloped by the HPC-Lab at NTNU. The snow simulator consists of two main simulationcomponents; the simulation of wind, and the simulation of snow particle movement.The OpenACC version of the snow simulator is made by first updating the currentCUDA version, porting it to a sequential CPU implementation, and applying OpenACCdirectives to accelerate compute intensive regions in the code. The OpenACC port isalso optimized by reducing datamovement between host and device using OpenACClibrary routines.Due to the heterogeneous nature of OpenACC, we show that the inability to explicitlyuse shared memory as temporary storage and not being able to use texture memory forhardware based interpolation and 3D caching, are the largest performance bottleneckswhen comparing to the CUDA version.This is supported by the benchmarks of the OpenACC implementation which is shown togive only 40.6% performance of the CUDA version with an average speedup of 3.2x whenscaling the amount of snow particles simulated and using a balanced windfield dimension.When scaling the windfield with constant snow particles 58% of the CUDA performanceis reached with an average speedup of 4.84x. The best real-time performance is found atabout 1.5M snow particles when using a balanced windfield with about 524K grid cells.Using OpenACC for accelerating high performance graphical simulations can be a viableoption if the goal is high code portability, however, when the goal is to achieve the best possible performance, our experience show that it is still better to use the more low-level alternatives CUDA or OpenCL.
4
Muller, Bjørn Christian. "Implementering av openBIM i kalkulasjonsprosessen". Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for bygg, anlegg og transport, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-18463.
Texto completoResumen
Implementering av openBIM i kalkulasjonsprosessen vil åpne for helt andre muligheter i tilnærmingen til et nytt prosjekt. Med det menes at informasjonen tilknyttet en åpen BIM vil bidra til å gi et bedre grunnlag for konseptvalg og alternative løsninger gjennom gode visualiseringsegenskaper i modellen og en høyere informasjonsgrad i en tidligere fase sammenlignet med en tradisjonell 2D-basert kalkulasjonsprosess. OpenBIM baserer seg i hovedsak på de tre ulike og åpne standardene IFC, IFD og IDM. Når man setter de tre aspektene av openBIM i sammenheng omtaler man åpen BIM som å ha et omforent lagringsformat med enighet om terminologi der BIM-modellen kan kobles opp mot veletablerte forretningsprosesser. Åpen BIM vil dermed fungere som en universell tilnærming til samarbeid, realisering og drift av bygninger basert på åpne standarder og god informasjonsutveksling.En openBIM-basert kalkulasjonsprosess består i å integrere objektene og deres tilhørende attributter/informasjon fra prosjektets ulike BIM-modeller inn i entreprenørens kostnadsdatabase som inneholder prisinformasjon til hvert enkelt objekt eller delobjekt. En slik prosess kan deles inn i tre delprosesser som beskriver arbeidet fra entreprenørens mottakelse av en BIM til ferdig utarbeidet kalkyle. De tre prosessene er; organisering av modellen, oppbygning av objektenes resepter og selve kalkulasjonen av kalkylen.Mengdeberegning sees ofte på som det første steget innenfor kalkulasjonsprosessen og i tradisjonelle kalkulasjonsprosesser utgjør mengdeberegning mellom 50-80 prosent av kalkulatørenes tidsbruk. OpenBIM vil tilrettelegge for en tilnærmet automatisk mengdeberegningsprosess, noe som vil frigjøre mye tid og ressurser hos kalkulatørene der de heller kan fokusere på nøyere vurdering av prosjektets konsept og tilhørende alternative løsninger. På bakgrunn av dette er mengdeberegningsprosessen en av de prosessene som har størst potensial til forbedring ved implementering av openBIM. Selv om åpen BIM tillater automatiske mengdeberegninger vil behovet for kalkulatører i en kalkulasjonsprosess aldri endre seg. Deres arbeidsoppgaver, ved å besitte gode kalkulasjonsegenskaper og samtidig ta hånd om og strukturere informasjonen i en BIM, er helt nødvendig for å utvikle et godt anbud. Dagens kalkulasjonspraksis i MajaTeknobygg framstår i dag som en mindre integrert prosess enn den ville gjort ved full utnyttelse av BIM. Calcus tas i bruk i tidligfasen for å få et hurtig kostnadsestimat av prosjektet. Mengdene hentes ut ved hjelp av et 2D-basert mengdeberegningsprogram for så å implementeres inn i ressurskalkyleverktøyet ByggOffice. Prosessene har lite eller ingen integrasjon mellom seg og nå som både ByggOffice og Calcus har fått innført egen BIM-modul med bedre integrasjon seg imellom vil det å se på samhandlingen mellom programvarene være viktig å gjøre for MajaTeknobygg. Fordelene ved å ta i bruk IFC-formatet i kalkulasjonsprosessen vil helt klart være en bedre samspillprosess og en mer komprimert prosjektering der informasjonsflyten på tvers av ulike fag vil fungere på en god måte. I en slik prosess må kalkulatørene etablere leveringskrav til de ulike aktørene under modelleringsprosessen slik at nødvendig modellinformasjon ligger tilgjengelig til riktig tidspunkt. Det må også avklares og bestemmes et system for objektenes rolle i en BIM. Ofte modelleres det objekt i en BIM uten at det videre er avklart om dets plassering og oppbygning er bestemt eller om det kun brukes til visualisering i modellen. Calcus har lenge vært et godt kalkulasjonsverktøy for vurderinger av kostnadsbildet i tidligfasen av et prosjekt. Med programmets nyetablerte BIM-modul for import/eksport av IFC-modeller vil prosjektet fremstå med blant annet større sporbarhet, (delvis) automatisk mengdeberegning og et bedre produkt for konseptvalg med tilhørende alternative løsninger. Kalkulasjonsverktøyet har i dag en god struktur med kontoplan oppbygd etter NS3451 og integrerte prislinjer basert på NS 3420. Ved standardisert bruk av BIM vil Calcus etter hvert få implementert et standard objektbibliotek som blir viktig i en kalkulasjonsprosess med openBIM.
5
Sundholm, Erik. "Distance Fields Acceleratedwith OpenCL". Thesis, Umeå University, Department of Computing Science, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-34953.
Texto completoResumen
An important task in any graphical simulation is the collision detection between the objects in the simulation. It is desirable to have a good general method for collision detection with high performance. This thesis describes an implementation of a collision detection method that uses distance fields to detect collisions. This method is quite robust and able to detect collisions between most possible shapes. It is also capable of computing contact data for collisions. A problem with distance fields is that the performance cost for making a distance field is quite extensive. It is therefore customary to have some way of accelerating the computation of the distance field (usually by only computing select parts of the field). The application implemented in this thesis solves this performance problem by using the parallel framework OpenCL for accelerating the construction of the field.OpenCL enables programmers to execute code on the GPU. The GPU is highly data parallel and a huge increase in performance can be obtained by letting the GPU handle the computations associated with the initiation of the field.
6
Bremseth, Morten. "Om implementering av frekvenshopping i OpenBTS". Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for elektronikk og telekommunikasjon, 2011. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-16348.
Texto completoResumen
Denne Rapporten gir en forklaring på hva programvaredefinert radio er generelt. Den omtaler en konkret realisering ved hjelp av programvaren GNU Radio og den universale radioenheten USRP (Universal Software Radio Peripheral). GSM forklares slik at leseren får den nødvendige oversikten som trengs for å forstå resten av rapporten. Frekvenshopping forklares generelt og hvordan det er gjort i GSM. Det fremstilles en mulig realisering av frekvenshopping med USRP. Programvaren som benyttes for å opprette et GSM-nettverk presenteres. Programvaren som trengs er OpenBTS, GNU Radio og Asterisk. Den fysiske oppkoblingen av USRP når OpenBTS benyttes i programvare GSM blir forklart og hvilket testmiljø eksperimentene ble utført i beskrives. Delvis vellykkede resultater presenteres og rapporten konkluderer med at det skal være mulig å implementere frekvenshopping i OpenBTS med USRP som RF-maskinvare.
7
Fagerlund, Olav Aanes. "Multi-core programming with OpenCL: performance and portability : OpenCL in a memory bound scenario". Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-11119.
Texto completoResumen
With the advent of multi-core processors desktop computers have become multiprocessors requiring parallel programming to be utilized efficiently. Efficient and portable parallel programming of future multi-core processors and GPUs is one of todays most important challenges within computer science. Okuda Laboratory at The University of Tokyo in Japan focuses on solving engineering challenges with parallel machines. A multi-core FEM solver package is under development within this laboratory that utilizes both standard CPUs and GPUs.This student project, given by Department of Computer and Information Science (IDI) at NTNU in cooperation with Okuda Laboratory at The University of Tokyo, seeks to explore the promising path towards more platform independent parallel programming given by the OpenCL library, runtime system and language. And, in doing so, contributing to their FEM solver software CUKr by making it utilize OpenCL.
8
Belgiovine, Mauro. "Accelerare l'algebra lineare con OpenCL". Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amslaurea.unibo.it/5079/.
Texto completo
9
Sundholm, Erik. "Distance Fields Accelerated with OpenCL". Thesis, Umeå universitet, Institutionen för datavetenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-34953.
Texto completoResumen
An important task in any graphical simulation is the collision detection between the objects in the simulation. It is desirable to have a good general method for collision detection with high performance. This thesis describes an implementation of a collision detection method that uses distance fields to detect collisions. This method is quite robust and able to detect collisions between most possible shapes. It is also capable of computing contact data for collisions. A problem with distance fields is that the performance cost for making a distance field is quite extensive. It is therefore customary to have some way of accelerating the computation of the distance field (usually by only computing select parts of the field). The application implemented in this thesis solves this performance problem by using the parallel framework OpenCL for accelerating the construction of the field.OpenCL enables programmers to execute code on the GPU. The GPU is highly data parallel and a huge increase in performance can be obtained by letting the GPU handle the computations associated with the initiation of the field.
10
Rogeiro, João Pedro Martins. "Geometry based visualization with OpenCL". Master's thesis, Faculdade de Ciências e Tecnologia, 2011. http://hdl.handle.net/10362/7951.
Texto completoResumen
Dissertação para obtenção do Grau de Mestre em
Engenharia InformáticaThis work targets the design and implementation of an isosurface extraction solution capable of handling large datasets. The Marching Cubes algorithm is the method used to extract the isosurfaces. These are graphical representations of points with a constant value (e.g. matter density) within volumetric datasets. A very useful approach to visualize particular regions of such data. One of the major goals of this work is to get a significant performance improvement, compared to the currently available CPU solutions. The OpenCL framework is used to accelerate the solution. This framework is an open standard for parallel programming of heterogeneous systems recently proposed. Unlike previous programming frameworks for GPUs such as CUDA, with OpenCL the workload can be distributed among CPUs, GPUs, DSPs, and other similar microprocessors.
11
Afonso, Mário João da Costa. "Clopencl (opencl para ambiente cluster)". Master's thesis, Instituto Politécnico de Bragança, Escola Superior de Tecnologia e Gestão, 2012. http://hdl.handle.net/10198/8066.
Texto completoResumen
Nos dias correntes, as pessoas estão cada vez mais familiarizadas com a necessidade de um aumento dos recursos computacionais. Com isto, torna-se evidente a junção de dispositivos, como CPUs e GPUs de fabricantes diferentes, com a finalidade de preencher o mesmo propósito. Este nível de heterogeneidade é trazida pela tecnologia OpenCL.
O trabalho aqui desenvolvido abrange o High-Performance Computing e o OpenCL, com o resultado do clOpenCL. O objetivo do clOpenCL é suportar o conjunto de dispositivos OpenCL num ambiente cluster. O clOpenCL foi construído sobre duas vertentes, estando estas inteiramente ligadas ao tipo de tecnologia utilizada no processo de comunicação entre a biblioteca e o daemon. A primeira vertente da API foi construída sobre a tecnologia de comunicação socket TCP/IP e a segunda foi desenvolvida sobre o Open-MX. Ambos os modelos do clOpenCL estão ligados à tecnologia de comunicação e à forma como é suportada a comunicação ao nível de programação.
No decorrer do trabalho serão apresentadas todas as caraterísticas integradas pelo clOpenCL e todos os seus recursos abrangidos. Irá também ser analisada a performance obtida para cada vertente do clOpenCL, em termos de utilização de largura de banda e com a leitura e escrita em buffers remotos.
In the current days, people are increasingly acquainted with the need for an increase computing resources. It becomes evident the combination of devices such as CPUs and GPUs from different vendors, with the task of fulfill the same purpose. This level of heterogeneity, is brought by OpenCL technology.
This work covers the High-Performance Computing and OpenCL, with the result of clOpenCL. The main goal of clOpenCL is to support a set of OpenCL devices in a cluster environment. The clOpenCL was built in two branches, fully connected with the type of technology used in the comunication process, between the library and the daemon.
The first version of the API was built on socket TCP/IP communication technology, and the second one was developed on the Open-MX tecnology. Both clOpenCL models are connected to the communication technology and the way that communication is supported at programming level.
Throughout this work, we will present all the clOpenCL integrated features and all its covered resources. We will also analyze the performance obtained for each side of clOpenCL in terms of bandwidth usage, through the reading and writing of remote buffers.
12
Kos, Ondřej. "Obnova hesel v distribuovaném prostředí". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2016. http://www.nusl.cz/ntk/nusl-255460.
Texto completoResumen
The goal of this thesis is to design and implement a framework allowing password recovery in a distributed environment. The research is therefore focused on analyzing the security of passwords, techniques used for attacks on them and also presents methods preventing attacks on passwords. Described is the Wrathion tool which is allowing password recovery using acceleration on graphic cards through the integration of OpenCL framework. Conducted is also an analysis of available environments providing means to run computing tasks on multiple devices, based on which the OpenMPI platform is chosen for extending Wrathion. Disclosed are various modifications and added components, and the entire system is also subjected to experiments aiming at the measuring of scalability and network traffic performance. The financial side of the use of Wrathion tool is also discussed in terms of its usability in cloud based distributed environment.
13
Laivamaa, J. (Juuso). "Reinforcement Q-Learning using OpenAI Gym". Bachelor's thesis, University of Oulu, 2019. http://jultika.oulu.fi/Record/nbnfioulu-201903151329.
Texto completoResumen
Abstract. Q-Learning is an off-policy algorithm for reinforcement learning, that can be used to find optimal policies in Markovian domains. This thesis is about how Q-Learning can be applied to a test environment in the OpenAI Gym toolkit. The utility of testing the algorithm on a problem case is to find out how well it performs as well proving the practical utility of the algorithm. This thesis starts off with a general overview of reinforcement learning as well as the Markov decision process, both of which are crucial in understanding the theoretical groundwork that Q-Learning is based on. After that we move on to discussing the Q-Learning technique itself and dissect the algorithm in detail. We also go over OpenAI Gym toolkit and how it can be used to test the algorithm’s functionality. Finally, we introduce the problem case and apply the algorithm to solve it and analyse the results.
The reasoning for this thesis is the rise of reinforcement learning and its increasing relevance in the future as technological progress allows for more and more complex and sophisticated applications of machine learning and artificial intelligence.
14
Winberg, Andreas y Lindström Oliver Öhrstam. "Reinforcement Learning Methods for OpenAI Environments". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-293855.
Texto completoResumen
Using the powerful methods developed in the fieldof reinforcement learning requires an understanding of theadvantages and drawbacks of different methods as well as theeffects of the different adjustable parameters. This paper high-lights the differences in performance and applicability betweenthree different Q-learning methods: Q-table, deep Q-network anddouble deep Q-network where Q refers to the value assigned toa given state-action pair. The performance of these algorithms isevaluated on the two OpenAI gym environments MountainCar-v0 and CartPole-v0. The implementations are done in Pythonusing the Tensorflow toolkit with Keras. The results show thatthe Q-table was the best to use in the Mountain car environmentbecause it was the easiest to implement and was much fasterto compute, but it was also shown that the network methodsrequired far less training data. No significant difference inperformance was found between the deep Q-network and thedouble deep Q-network. In the end, there is a trade-off betweenthe number of episodes required and the computation time foreach episode. The network parameters were also harder to tunesince much more time was needed to compute and visualize theresult.Att använda de kraftfulla metoderna som utvecklats inom området reinforcement learning kräver en förståelse av fördelar och nackdelar mellan olika metoder samt effekterna av de olika justerbara parametrarna. Denna artikel belyser skillnaderna i prestanda och funktionalitet mellan tre olika metoder: Q-table, deep Q-network och double deep Q- network. Prestandan för dessa algoritmer utvärderas i de två OpenAI gym-miljöerna MountainCar-v0 samt Cartpole-v0. Implementeringarna görs i python med hjälp av programvarubiblioteket Tensorflow tillsammans med Keras. Resultaten visar att Q-table var lättast att implementera och tränade snabbast i båda miljöerna. Nätverksmetoderna krävde dock mindre träningsdata även om det tog lång tid att träna på den data som fanns. Inga stora skillnader i prestanda hittades mellan deep Q-network och double deep Q-network. I slutändan kommer det alltid vara en balansgång mellan mängden träningsdata som krävs och tiden det tar att träna på den data som finns.
15
Hrušovský, Marek. "Akcelerace genetického algoritmu s využitím OpenCL". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237246.
Texto completoResumen
Tato práce se zabývá problematikou urychlování genetických algoritmů a hned v úvodu nastiňuje možnosti využití genetických algoritmů v praxi. V první kapitole je detailně rozebrán princip fungování genetického algoritmu. Tato kapitola se dále zabývá možnostmi zákódování problému, který je použit pro běh genetického algoritmu. Konkrétně je vzpomenuto binární zakódování jedince, celočíselné zakódování jedince, neceločíselné zakódování jedince a permutační zakódování jedince. Pro každý typ zakódování jsou dále představeny genetické operátory mutace, křížení a selekce. Důraz je kladen na permutační genetické operátory OX a PMX. Další kapitola se zabývá možnostmi paralelizace genetického algoritmu. Další kapitola představuje nový standard jménem OpenCL, který umožňuje snadnou paralelizaci výpočtú s využitím různých typů procesorů v ten samý čas. OpenCL taktéž zjednodušuje programování pro grafické karty. Další kapitola navrhuje možnost, jak urychlit výpočet genetického algoritmu s využitím grafické karty a jazyka OpenCL. Pro urychlení byl zvolen permutační genetický algoritmus "problém N-dam", který je náročný na paměť grafické karty. Tato kapitola rozebírá technické specifikace grafické karty, které jsou nevyhnutelné k určení maximální velikosti šachovnice. V kapitole je analyzována správná práce s pamětí grafické karty, která je nevyhnutelná k dosažení urychlení zvoleného genetického algoritmu. Jsou zde taky nastíněny dva generátory náhodných čísel, které jsou součástí testů. Následující kapitola detailně popisuje fungování navržené paralelizace genetického algoritmu. Jsou zde porovnány dvě metody evaluace jedince a je popsán způsob testování a vyhodnocování výsledků. Předposlední kapitola porovnává časovou náročnost generátorů náhodných čísel. Bylo zjištěno, že generátor HybridTaus je o 20 rychlejší o proti generátoru XORshift na GPU. Na CPU byl naopak rychlejší generátor XORshift. Generátor XORshift je na GPU 20 krát rychlejší a generátor HybridTaus je dokonce až 80 krát rychlejší. Dále byly porovnány evaluační funkce. Bylo zjištěno, že GPU běh je 800 krát rychlejší oproti běhu na CPU. Paměťově náročná evaluační metoda byla schopná dosáhnout jenom dvojnásobné zrychlení. Kapitola dále porovnává funkce křížení. PMX dosáhlo zrychlení maximálně o 100 a i to v případech, které nejsou atraktivní pro řešení problému N-dam (N>20). V případe OX je možné dosáhnout zrychlení až o 1100. Také v tomto případě jsou atraktivní hodnoty pouze do 500. Testy, které vyhodnocují běh celého GA, ukázaly, že GPU verze je zhruba dvojnásobně rychlejší. Malé zrychlení bylo způsobeno operátorem selekce a funkcí křížení.
16
Šnobl, Pavel. "Překlad OpenCL aplikací pro vestavěné systémy". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2016. http://www.nusl.cz/ntk/nusl-255361.
Texto completoResumen
This master's thesis deals with the support for compilation and execution of programs written using OpenCL framework on embedded systems. OpenCL is a system for programming heterogeneous systems comprising processors, graphic accelerators and other computing devices. But it also finds usage on systems composed of just one computing unit, where it allows to write parallel programs (task and data parallelism) and work with hierarchical system of memories. In this thesis, various available open source OpenCL implementations are compared and one selected is then integrated into LLVM compiler infrastructure. This compiler is generated as a part of toolchain provided by application specific instruction set architecture processor developement environment called Codasip Studio. Designed and implemented are also optimizations for architectures with SIMD instructions and VLIW architectures. The result is tested and demonstrated on a set of testing applications.
17
Badalamenti, Bryan M. "OpenCL Based Digital Image Projection Acceleration". University of Dayton / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=dayton1438277905.
Texto completo
18
Karlsson, Tim. "Implementing Cauchy Reed-Solomon Utilizing OpenCL". Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4823.
Texto completoResumen
In this paper the performance of executing Cauchy Reed-Solomon (CRS) coding on the GPU is evaluated and compared with execution on the CPU. Three different prototypes are developed. One is sequential and developed in C++, the other two are developed utilizing C++ and OpenCL. The measurements are done by comparing the execution time of different data block sizes ranging from 16KB up to 256MB with two different encoding ratios, 9/12 and 10/16. The measurements are done on an Intel CPU with 4 cores with an integrated graphics card and an AMD graphics card. The OpenCL prototypes are executed with three different targets, the CPU, the integrated graphics card and the AMD graphics card. The sequential prototype is executed on the same CPU, but on a single core. The results from the measurements show that the GPU is faster than the CPU on larger data sizes. The highest measured throughput is achieved with the multithreaded CPU prototypes (OpenCL executed on the CPU) for sizes around 1MB.I den här rapporten genomförs prestandatester för exekvering av Cauchy Reed-Solomon (CRS) coding på grafikkortet och jämförs med exekvering på en CPU. Tre olika prototyper har utvecklats. En är sekventiell och utvecklad i C++, de två andra är utvecklade i OpenCL och C++. Testerna genomförs genom tidtagning på olika stora datablock, från 16KB upp till 256MB med olika enkodnings ratios, 9/12 och 10/16. CPU:n som används i testerna är en Intel CPU med 4 kärnor, och grafikkorten som används är det integrerade grafikkortet på CPU:n samt ett grafikkort från AMD. OpenCL prototyperna exekveras med tre olika inställningar, CPU för multitrådat, det integrerade Intel grafikkortet och det dedikerade AMD grafikkortet. Den sekventiella prototypen exekveras på samma CPU, men med en kärna. Resultaten från experimenten visar att grafikkorten är snabbare än CPU:n för större datablock. Den prototyp som fick högst genomströmning av data var den multitrådade CPU prototypen för datablock i storleksordningen 1MB.
19
Meinel, Christoph y Christian Willems. "openHPI : das MOOC-Angebot des Hasso-Plattner-Instituts". Universität Potsdam, 2013. http://opus.kobv.de/ubp/volltexte/2013/6680/.
Texto completoResumen
Die neue interaktive Online-Bildungsplattform openHPI (https://openHPI.de) des Hasso-Plattner-Instituts (HPI) bietet frei zugängliche und kostenlose Onlinekurse für interessierte Teilnehmer an, die sich mit Inhalten aus dem Bereich der Informationstechnologien und Informatik beschäftige¬n. Wie die seit 2011 zunächst von der Stanford University, später aber auch von anderen Elite-Universitäten der USA angeboten „Massive Open Online Courses“, kurz MOOCs genannt, bietet openHPI im Internet Lernvideos und weiterführenden Lesestoff in einer Kombination mit lernunterstützenden Selbsttests, Hausaufgaben und einem sozialen Diskussionsforum an und stimuliert die Ausbildung einer das Lernen fördernden virtuellen Lerngemeinschaft. Im Unterschied zu „traditionellen“ Vorlesungsportalen, wie z.B. dem tele-TASK Portal (http://www.tele-task.de), bei dem multimedial aufgezeichnete Vorlesungen zum Abruf bereit gestellt werden, bietet openHPI didaktisch aufbereitete Onlinekurse an. Diese haben einen festen Starttermin und bieten dann in einem austarierten Zeitplan von sechs aufeinanderfolgenden Kurswochen multimedial aufbereitete und wann immer möglich interaktive Lehrmaterialien. In jeder Woche wird ein Kapitel des Kursthemas behandelt. Dazu werden zu Wochenbeginn eine Reihe von Lehrvideos, Texten, Selbsttests und ein Hausaufgabenblatt bereitgestellt, mit denen sich die Kursteilnehmer in dieser Woche beschäftigen. Kombiniert sind die Angebote mit einer sozialen Diskussionsplattform, auf der sich die Teilnehmer mit den Kursbetreuern und anderen Teilnehmern austauschen, Fragen klären und weiterführende Themen diskutieren können. Natürlich entscheiden die Teilnehmer selbst über Art und Umfang ihrer Lernaktivitäten. Sie können in den Kurs eigene Beiträge einbringen, zum Beispiel durch Blogposts oder Tweets, auf die sie im Forum verweisen. Andere Lernende können diese dann kommentieren, diskutieren oder ihrerseits erweitern. Auf diese Weise werden die Lernenden, die Lehrenden und die angebotenen Lerninhalte in einer virtuellen Gemeinschaft, einem sozialen Lernnetzwerk miteinander verknüpft.The new interactive online educational platform openHPI, (https://openHPI.de) from Hasso Plattner Institute (HPI), offers freely accessible courses at no charge for all who are interested in subjects in the field of information technology and computer science. Since 2011, “Massive Open Online Courses,” called MOOCs for short, have been offered, first at Stanford University and then later at other U.S. elite universities. Following suit, openHPI provides instructional videos on the Internet and further reading material, combined with learning-supportive self-tests, homework and a social discussion forum. Education is further stimulated by the support of a virtual learning community. In contrast to “traditional” lecture platforms, such as the tele-TASK portal (http://www.tele-task.de) where multimedia recorded lectures are available on demand, openHPI offers didactic online courses. The courses have a fixed start date and offer a balanced schedule of six consecutive weeks presented in multimedia and, whenever possible, interactive learning material. Each week, one chapter of the course subject is treated. In addition, a series of learning videos, texts, self-tests and homework exercises are provided to course participants at the beginning of the week. The course offering is combined with a social discussion platform where participants have the opportunity to enter into an exchange with course instructors and fellow participants. Here, for example, they can get answers to questions and discuss the topics in depth. The participants naturally decide themselves about the type and range of their learning activities. They can make personal contributions to the course, for example, in blog posts or tweets, which they can refer to in the forum. In turn, other participants have the chance to comment on, discuss or expand on what has been said. In this way, the learners become the teachers and the subject matter offered to a virtual community is linked to a social learning network.
20
Meinel, Christoph y Christian Willems. "openHPI : the MOOC offer at Hasso Plattner Institute". Universität Potsdam, 2013. http://opus.kobv.de/ubp/volltexte/2013/6717/.
Texto completoResumen
The new interactive online educational platform openHPI, (https://openHPI.de) from Hasso Plattner Institute (HPI), offers freely accessible courses at no charge for all who are interested in subjects in the field of information technology and computer science. Since 2011, “Massive Open Online Courses,” called MOOCs for short, have been offered, first at Stanford University and then later at other U.S. elite universities. Following suit, openHPI provides instructional videos on the Internet and further reading material, combined with learning-supportive self-tests, homework and a social discussion forum. Education is further stimulated by the support of a virtual learning community. In contrast to “traditional” lecture platforms, such as the tele-TASK portal (http://www.tele-task.de) where multimedia recorded lectures are available on demand, openHPI offers didactic online courses. The courses have a fixed start date and offer a balanced schedule of six consecutive weeks presented in multimedia and, whenever possible, interactive learning material. Each week, one chapter of the course subject is treated. In addition, a series of learning videos, texts, self-tests and homework exercises are provided to course participants at the beginning of the week. The course offering is combined with a social discussion platform where participants have the opportunity to enter into an exchange with course instructors and fellow participants. Here, for example, they can get answers to questions and discuss the topics in depth. The participants naturally decide themselves about the type and range of their learning activities. They can make personal contributions to the course, for example, in blog posts or tweets, which they can refer to in the forum. In turn, other participants have the chance to comment on, discuss or expand on what has been said. In this way, the learners become the teachers and the subject matter offered to a virtual community is linked to a social learning network.Die neue interaktive Online-Bildungsplattform openHPI (https://openHPI.de) des Hasso-Plattner-Instituts (HPI) bietet frei zugängliche und kostenlose Onlinekurse für interessierte Teilnehmer an, die sich mit Inhalten aus dem Bereich der Informationstechnologien und Informatik beschäftige¬n. Wie die seit 2011 zunächst von der Stanford University, später aber auch von anderen Elite-Universitäten der USA angeboten „Massive Open Online Courses“, kurz MOOCs genannt, bietet openHPI im Internet Lernvideos und weiterführenden Lesestoff in einer Kombination mit lernunterstützenden Selbsttests, Hausaufgaben und einem sozialen Diskussionsforum an und stimuliert die Ausbildung einer das Lernen fördernden virtuellen Lerngemeinschaft. Im Unterschied zu „traditionellen“ Vorlesungsportalen, wie z.B. dem tele-TASK Portal (http://www.tele-task.de), bei dem multimedial aufgezeichnete Vorlesungen zum Abruf bereit gestellt werden, bietet openHPI didaktisch aufbereitete Onlinekurse an. Diese haben einen festen Starttermin und bieten dann in einem austarierten Zeitplan von sechs aufeinanderfolgenden Kurswochen multimedial aufbereitete und wann immer möglich interaktive Lehrmaterialien. In jeder Woche wird ein Kapitel des Kursthemas behandelt. Dazu werden zu Wochenbeginn eine Reihe von Lehrvideos, Texten, Selbsttests und ein Hausaufgabenblatt bereitgestellt, mit denen sich die Kursteilnehmer in dieser Woche beschäftigen. Kombiniert sind die Angebote mit einer sozialen Diskussionsplattform, auf der sich die Teilnehmer mit den Kursbetreuern und anderen Teilnehmern austauschen, Fragen klären und weiterführende Themen diskutieren können. Natürlich entscheiden die Teilnehmer selbst über Art und Umfang ihrer Lernaktivitäten. Sie können in den Kurs eigene Beiträge einbringen, zum Beispiel durch Blogposts oder Tweets, auf die sie im Forum verweisen. Andere Lernende können diese dann kommentieren, diskutieren oder ihrerseits erweitern. Auf diese Weise werden die Lernenden, die Lehrenden und die angebotenen Lerninhalte in einer virtuellen Gemeinschaft, einem sozialen Lernnetzwerk miteinander verknüpft.
21
Smith, Kevin R. "Linux, OpenBSD, and Talisker : a comparative complexity analysis". Thesis, Monterey, California. Naval Postgraduate School, 2002. http://hdl.handle.net/10945/6016.
Texto completoResumen
Approved for public release; distribution is unlimited.Security engineering requires a combination of features and assurance to provide confidence that security policy is correctly enforced. Rigorous engineering principles are applicable across a broad range of systems. The purpose of this study is to analyze and compare three operating systems, including two general-purpose operating systems (Linux and OpenBSD) and a commercially available, embedded operating system (Talisker). The basis for the comparison considers secure software design principles, such as information hiding, hierarchical structuring, and modularity, as well as software complexity metrics, such as the McCabe Cyclomatic Complexity and the number-of-lines-of-code. In this analysis, we use a reverse engineering tool to show how the three operating systems compare to each other with respect to the qualities of a secure operating system design. The operating systems, their kernels, and their scheduling subsystems are analyzed and compared. From the results, it is shown that the OpenBSD operating system, kernel, and scheduler are the best when considering hierarchical structuring, modularity, and information hiding. The Linux kernel and scheduler and the Talisker operating system are least complex when considering the McCabe complexity and the number-of-lines-of-code.
22
Janeček, Martin. "Soustava kamer jako stereoskopický senzor pro měření vzdálenosti v reálném čase". Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2014. http://www.nusl.cz/ntk/nusl-220332.
Texto completoResumen
Project shows calibration stereoscopic sensor. Also describes basic methods stereo-corespodation using library OpenCV. Project contains calculations of disparity maps on CPU or graphic card(using library OpenCL).
23
Saffar, Shamshirgar Davoud. "Accelerated Pressure Projection using OpenCL on GPUs". Thesis, KTH, Mekanik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-102771.
Texto completoResumen
A GPU version of the pressure projection solver using OpenCL is implemented. Then it has been compared with CPU version which is accelerated with OpenMP. The GPU version shows a sensible reduction in time despite using a simple algorithm in the kernel. The nal code is plugged into a commercial uid simulator software. Dierent kinds of algorithms and data transfer methods have been investigated. Overlapping the computation and communication showed a more than 3 times speed-up versus the serial communication-computation pattern. Finally we exploit methods for partitioning data and writing kernels to use many of the bene ts of computation on a heterogeneous system. We ran all the simulations on a machine with an Intel core i7-2600 cpu and 16 GB main memory coupled with a GeForce GTX 560 Ti graphic processing unit on a windows OS.
24
Kalay, Harshal A. "Parallelization of lane detection algorithm using OpenCL". Thesis, California State University, Long Beach, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=1603755.
Texto completoResumen
In this thesis we explore and experiment on using OpenCL for the parallelization of an important computer vision problem of lane detection. Lane detection aims at identifying lane markings on a road and has applications in autonomous vehicles as well as for providing guidance to the drivers. The parallelization is implemented using OpenCL on Graphics Processing Units (GPUs) as well as on multi-core CPU, both these platforms are supported by OpenCL library for parallel programming.
Our study aims at finding an effective way to parallelize the lane detection using OpenCL through experimentations. Lane detection involves use of image processing algorithms and computer vision techniques, which are both often parallelizable and may benefit greatly by using OpenCL. With our hardware configuration, we are able to achieve eight, four and six times the speedup on multi-core CPU, PCIe based GPU and CPU integrated GPU systems respectively, when compared to sequential C++ program.
25
Varano, Pietro. "Elaborazioni di immagini con la libreria OpenCV". Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2010. http://amslaurea.unibo.it/810/.
Texto completo
26
Ruggeri, Eugenio. "Tracking di oggetti mediante la libreria opencv". Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amslaurea.unibo.it/7864/.
Texto completo
27
Bajcar, Martin. "Použití OpenCl v AVG na platformě Windows". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-236431.
Texto completoResumen
The main topic of this thesis is the practical use of OpenCL at AVG company. AVG is looking for ways to decrease hardware requirement of their security product and also to decrease computation time of some algorithms. Using OpenCL is one way to achieve this requirement. Significant part of this thesis deals with optimization strategies for AMD and NVIDIA graphics cards as they are most common cards among users. Practical part of the thesis describes parallelization of two algorithms, their analysis and implementation. After that, the obtained results are presented and cases in which the use of OpenCL is beneficial are identified. As a part of implementation, library containing various utility functions which can aid programmers to implement OpenCL based code was developed.
28
Urminský, Andrej. "Akcelerace mikroskopické simulace dopravy za použití OpenCL". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2011. http://www.nusl.cz/ntk/nusl-237011.
Texto completoResumen
As the number of vehicles on our roads increases, the problems related to this phenomenon emerge more dramatically. These problems include car accidents, congestions and CO2 emissions production, increasing CO2 concentrations in the atmosphere. In order to minimize these impacts and to use the road infrastructure eff ectively, the use of traffic simulators can come in handy. Thanks to these tools, it is possible to evaluate the evolution of a traffic flow with various initial states of the simulation and thus know what to do and how to react in different states of the real-world traffic situations. This thesis deals with acceleration of microscopic urban traffic simulation using OpenCL. Supposing it is necessary to simulate a large network traffic, the need to accelerate the simulation is necessary. For this purpose, it is possible, for example, to use the graphics processing units (GPUs) and the technique of GPGPU for general purpose computations, which is used in this work. The results show that the performance gains of GPUs are significant compared to a parallel implementation on CPU.
29
Hrubý, Michal. "Využití grafického procesoru jako akcelerátoru - technologie OpenCL". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2011. http://www.nusl.cz/ntk/nusl-236932.
Texto completoResumen
This work deals with the OpenCL technology and its use for the task of object detection. The introduction is devoted to description of OpenCL fundamentals, as well as basic theory of object detection. Next chapter of the work is analysis, with design proposal which takes into consideration the possibilities of OpenCL. Further, there's description of implementation of detection application and experimental evaluation of detector's performance. The last chapter summarizes the achieved results.
30
Lagarto, Jorge Miguel Raposeira. "Acceleration of physics simulation engine through OpenCL". Master's thesis, Faculdade de Ciências e Tecnologia, 2011. http://hdl.handle.net/10362/6044.
Texto completoResumen
Dissertação para obtenção do Grau de Mestre em
Engenharia InformáticaNowadays, physics simulation is a relevant topic in several domains, from scientific areas like medicine to entertainment purposes such as movie’s effects, computer animation and games. To make easier the production of faster simulations, developers are using physics engines because they provide a variety of features like rigid and deformable body simulation, fluids dynamics and collision detection. Computer game and film industries use increasingly more physics engines in order to introduce realism in their products. In these areas, speed is more important than accuracy and efforts have been made to achieve high performance simulations. Besides faster physical simulation algorithms, GPUs’ performance improvement in the past few years have lead developers to transfers heavy calculation work to these devices instead of doing it in the Central Processing Unit (CPU). Some engines already provide GPU implementations of several key features, particularly on rigid body collision detection. In this work we want to accelerate a feature present in most of the current physics engines: cloth simulation. Since collision detection is one of the major bottlenecks in this kind of simulation,we will focus specifically in improving this phase. To achieve a considerably speed-up we plan to exploit the massive parallelism of the Graphics Processing Unit (GPU) by designing an efficient algorithm using the Open Computing Language (OpenCL) framework. Finally,a study will be made to compare the performance of a sequential CPU approach against the parallel GPU proposed solution.
31
Pickering, Brent Phillip. "Evaluating the OpenACC API for Parallelization of CFD Applications". Thesis, Virginia Tech, 2014. http://hdl.handle.net/10919/50487.
Texto completoResumen
Directive-based programming of graphics processing units (GPUs) has recently appeared as a viable alternative to using specialized low-level languages such as CUDA C and OpenCL for general-purpose GPU programming. This technique, which uses directive or pragma statements to annotate source codes written in traditional high-level languages, is designed to permit a unified code base to serve multiple computational platforms and to simplify the transition of legacy codes to new architectures. This work analyzes the popular OpenACC programming standard, as implemented by the PGI compiler suite, in order to evaluate its utility and performance potential in computational fluid dynamics (CFD) applications. Of particular interest is the handling of stencil algorithms, which are an important component of finite-difference and finite-volume numerical methods. To this end, the process of applying the OpenACC Fortran API to a preexisting finite-difference CFD code is examined in detail, and all modifications that must be made to the original source in order to run efficiently on the GPU are noted. Optimization techniques for OpenACC are also explored, and it is demonstrated that tuning the code for a particular accelerator architecture can result in performance increases of over 30%. There are also some limitations and programming restrictions imposed by the API: it is observed that certain useful features of modern Fortran (2003/8) are effectively disabled within OpenACC regions. Finally, a combination of OpenACC and OpenMP directives is used to create a truly cross-platform Fortran code that can be compiled for either CPU or GPU hardware. The performance of the OpenACC code is measured on several contemporary NVIDIA GPU architectures, and a comparison is made between double and single precision arithmetic showing that if reduced precision can be tolerated, it can lead to significant speedups. To assess the performance gains relative to a typical CPU implementation, the execution time for a standard benchmark case (lid-driven cavity) is used as a reference. The OpenACC version is compared against the identical Fortran code recompiled to use OpenMP on multicore CPUs, as well as a highly-optimized C++ version of the code that utilizes hardware aware programming techniques to attain higher performance on the Intel Xeon platforms being tested. Low-level optimizations specific to these architectures are analyzed and it is observed that the stencil access pattern required by the structured-grid CFD code sometimes leads to performance degrading conflict misses in the hardware managed CPU caches. The GPU code, which primarily uses software managed caching, is found to be free from these issues. Overall, it is observed that the OpenACC GPU code compares favorably against even the best optimized CPU version: using a single NVIDIA K20x GPU, the Fortran+OpenACC code is seen to outperform the optimized C++ version by 20% and the Fortran+OpenMP version by more than 100% with both CPU codes running on a 16-core Xeon workstation.Master of Science
32
Sjölander, Erik. "Krypteringsalgoritmer i OpenCL : AES-256 och ECC ElGamal". Thesis, Linköpings universitet, Institutionen för systemteknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-81660.
Texto completoResumen
De senaste åren har grafikkorten genomgått en omvandling från renderingsenheter till att klara av generella beräkningar, likt en vanlig processor. Med hjälp av språk som OpenCL blir grafikkorten kraftfulla enheter som går att använda effektivt vid stora beräkningar. Målet med detta examensarbete var att visa krypteringsalgoritmer som passar bra att accelerera med OpenCL på grafikkort. Ytterligare mål var att visa att programmet inte behöver omfattande omskrivning för att fungera i OpenCL. Två krypteringsalgoritmer portades för att kunna köras på grafikkorten. Den första algoritmen AES-256 testades i två olika implementationer, en 8- samt 32-bitars. Den andra krypteringsalgoritmen som användes var ECC ElGamal. Dessa två är valda för visa att både symmetrisk och öppen nyckelkryptering går att accelerera. Resultatet för AES-256 i ECB mod på GPU blev 7 Gbit/s, en accelerering på 25 gånger jämfört med CPU. För elliptiska kurvor ElGamal blev resultatet en acceleration på 55 gånger för kryptering och 67 gånger för avkryptering. Arbetet visar skalärmultiplikation med kurvan B-163 som tar 65us. Båda implementationerna bygger på dataparallellisering, där dataelementen distribueras över tillgänglig hårdvara. Arbetet är utfört på Syntronic Software Innovations AB i Linköping.Last years, the graphic cards have become more powerful than ever before. A conversion from pure rendering components to more general purpose computing devices together with languages like OpenCL have created a new division for graphics cards. The goal of this thesis is to show that crypthography algorithms are well suited for acceleration with OpenCL using graphics cards. A second goal was to show that C-code can be easily translated into OpenCL kernel with just a small syntax change. The two algorithms that have been used are AES-256 implemented in 8- and 32-bits variants, and the second algorithm is Elliptic Curve Crypthography with the ElGamal scheme. The algoritms are chosen to both represent fast symmetric and the slower public-key schemes. The results for AES-256 in ECB mode on GPU, ended up with a throughtput of 7Gbit/s which is a acceleration of 25 times compared to a CPU. For Elliptic Curve, a single scalar point multiplication for the B-163 NIST curve is computed on the GPU in 65us. Using this in the ElGamal encryption scheme, an acceleration of 55 and 67 times was gained for encryption and decryption. The work has been made at Syntronic Software Innovations AB in Linköping, Sweden.
33
Maddison, John. "Automatisk validering av skärmgrafik med OpenCV och Tesseract". Thesis, Linköpings universitet, Programvara och system, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-151912.
Texto completoResumen
I dagens flygplan finns det mycket information som på ett snabbt och pålitligt sätt behöver förmedlas till piloten via instrument på flera skärmar i cockpit. Att verifiera att skärmarna visar korrekt data för olika indata är ett tidskrävande och monotont arbete. Därför undersöker Saab möjligheten att automatisera delar av arbetet. Examensarbetet undersöker genom praktiskt implementation ifall det är möjligt att automatisera bildanalysen med hjälp av programmen OpenCV och Tesseract. Resultatet visade att det går att enkelt konstruera tester för att automatiskt identifiera oönskade förändringar i den implementerade instrumentingen.
34
Shagrithaya, Kavya Subraya. "Enabling Development of OpenCL Applications on FPGA platforms". Thesis, Virginia Tech, 2012. http://hdl.handle.net/10919/34669.
Texto completoResumen
FPGAs can potentially deliver tremendous acceleration in high-performance server and em-
bedded computing applications. Whether used to augment a processor or as a stand-alone
device, these reconfigurable architectures are being deployed in a large number of implemen-
tations owing to the massive amounts of parallelism offered. At the same time, a significant
challenge encountered in their wide-spread acceptance is the laborious efforts required in
programming these devices. The increased development time, level of experience needed by
the developers, lower turns per day and difficulty involved in faster iterations over designs
affect the time-to-market for many solutions. High-level synthesis aims towards increasing
the productivity of FPGAs and bringing them within the reach software developers and
domain experts. OpenCL is a specification introduced for parallel programming purposes
across platforms. Applications written in OpenCL consist of two parts - a host program
for initialization and management, and kernels that define the compute intensive tasks. In
this thesis, a compilation flow to generate customized application-specific hardware descrip-
tions from OpenCL computation kernels is presented. The flow uses Xilinx AutoESL tool to
obtain the design specification for compute cores. An architecture provided integrates the
cores with memory and host interfaces. The host program in the application is compiled and
executed to demonstrate a proof-of-concept implementation towards achieving an end-to-end
flow that provides abstraction of hardware at the front-end.Master of Science
35
Pelini, Nicholas Michael. "Netlist Security Algorithm Acceleration Using OpenCL on FPGAs". University of Dayton / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=dayton1501861339318045.
Texto completo
36
Ek, Joel. "A Data-Parallel Graphics Pipeline Implemented in OpenCL". Thesis, Linköpings universitet, Institutionen för systemteknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-85679.
Texto completoResumen
This report documents implementation details, results, benchmarks and technical discussions for the work carried out within a master’s thesis at Linköping University. Within the master’s thesis, the field of software rendering is explored in the age of parallel computing. Using the Open Computing Language, a complete graphics pipeline was implemented for use on general processing units from different vendors. The pipeline is tile-based, fully-configurable and provides means of rendering visually compelling images in real-time. Yet, further optimizations for parallel architectures are needed as uneven work loads drastically decrease the overall performance of the pipeline.
37
Persson, Magnus. "A Comparative Study of Security Features in FreeBSD and OpenBSD". Thesis, Karlstad University, Division for Information Technology, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-147.
Texto completoResumen
Security in operating systems is a highly topical subject nowadays as the Internet keeps expanding. The larger the Internet gets the more systems, with valuable information, get connected, which could be subjects of attacks. An operating system needs to protect its information from these attacks. Many servers are using UNIX based operating systems and the security in these systems is a widely discussed topic.
This project is going to test and investigate the security in two of the most common UNIX distributions, both based on the Berkley Software Distribution (BSD). The selected systems are FreeBSD and OpenBSD. The Add-on called TrustedBSD/SEBSD for FreeBSD will also be a subject for this project. A comparison of the security features in the two systems was performed both theoretically and practically and this report reflects the results of these experiments and comparisons. A conclusion is that each system suits best in different environments with different needs. The selected distributions also have different level of security in specific areas. An introduction to security in operating systems on a general basis is provided before the actual comparison begins.
38
Gabbana, Alessandro. "Accelerating the D3Q19 Lattice Boltzmann Model with OpenACC and MPI". Thesis, Umeå universitet, Institutionen för datavetenskap, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-109595.
Texto completoResumen
Multi-GPU implementations of the Lattice Boltzmann method are of practical interest as they allow the study of turbulent flows on large-scale simulations at high Reynolds numbers. Although programming GPUs, and in general power-efficient accelerators, typically guarantees high performances, the lack of portability in their low-level programming models implies significant efforts for maintainability and porting of applications. Directive-based models such as OpenACC look promising in tackling these aspects. In this work we will evaluate the performances of a Multi-GPU implementation of the Lattice Boltzmann method accelerated with OpenACC. The implementation will allow for multi-node simulations of fluid flows in complex geometries, also supporting heterogeneous clusters for which the load balancing problem is investigated.
39
McCall, Andrew James. "Multi-level Parallelism with MPI and OpenACC for CFD Applications". Thesis, Virginia Tech, 2017. http://hdl.handle.net/10919/78203.
Texto completoResumen
High-level parallel programming approaches, such as OpenACC, have recently become popular in complex fluid dynamics research since they are cross-platform and easy to implement. OpenACC is a directive-based programming model that, unlike low-level programming models, abstracts the details of implementation on the GPU. Although OpenACC generally limits the performance of the GPU, this model significantly reduces the work required to port an existing code to any accelerator platform, including GPUs. The purpose of this research is twofold: to investigate the effectiveness of OpenACC in developing a portable and maintainable GPU-accelerated code, and to determine the capability of OpenACC to accelerate large, complex programs on the GPU. In both of these studies, the OpenACC implementation is optimized and extended to a multi-GPU implementation while maintaining a unified code base. OpenACC is shown as a viable option for GPU computing with CFD problems.
In the first study, a CFD code that solves incompressible cavity flows is accelerated using OpenACC. Overlapping communication with computation improves performance for the multi-GPU implementation by up to 21%, achieving up to 400 times faster performance than a single CPU and 99% weak scalability efficiency with 32 GPUs.
The second study ports the execution of a more complex CFD research code to the GPU using OpenACC. Challenges using OpenACC with modern Fortran are discussed. Three test cases are used to evaluate performance and scalability. The multi-GPU performance using 27 GPUs is up to 100 times faster than a single CPU and maintains a weak scalability efficiency of 95%.Master of Science
40
Jaroň, Lukáš. "Ovládání počítače gesty". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-236609.
Texto completoResumen
This masters thesis describes possibilities and principles of gesture-based computer interface. The work describes general approaches for gesture control. It also deals with implementation of the selected detection method of the hands and fingers using depth maps loaded form Kinect sensor. The implementation also deals with gesture recognition using hidden Markov models. For demonstration purposes there is also described implementation of a simple photo viewer that uses developed gesture-based computer interface. The work also focuses on quality testing and accuracy evaluation for selected gesture recognizer.
41
Jileček, Jan. "Analýza a klasifikace dat ze snímače mozkové aktivity". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2019. http://www.nusl.cz/ntk/nusl-403817.
Texto completoResumen
This thesis aims to implement methods for recording EEG data obtained with the neural activity sensor OpenBCI Ultracortex IV headset. It also describes neurofeedback, methods of obtaining data from the motor cortex for further analysis and takes a look at the machine learning algorithms best suited for the presented problem. Multiple training and testing datasets are created, as well as a tool for recording the brain activity of a headset-wearing test subject, which is being visually presented with cognitive challenges on the screen in front of him. A neurofeedback demo app has been developed, presented and later used for calibration of new test subjects. Next part is data analysis, which aims to discriminate the left and right hand movement intention signatures in the brain motor cortex. Multiple classification methods are used and their utility reviewed.
42
Tosi, Giammarco. "Reinforcement Learning per robot grasping in ambiente Gym openAI". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/12932/.
Texto completoResumen
La teoria del Reinforcement Learning fornisce considerazioni formali, profondamente radicate nelle prospettive psicologiche e neuroscientifiche sul comportamento animale, di come gli agenti siano in grado di ottimizzare il loro controllo su un ambiente. In seguito allo studio dei metodi di Reinforcement Learning, l’obiettivo principale del lavoro di tesi è dimostrare che mediante gli stessi, un agente, servendosi di un braccio meccanico, è in grado di apprendere autonomamente come afferrare un oggetto. Al fine di conseguire l’obiettivo posto vengono realizzati gli ambienti di simulazione 2D robotArm, in diverse configurazioni, e due agenti: Q-Learning e Deep Q-Learning. Il primo agente implementa il metodo Q-Learning come proposto in letteratura con materializzazione della tabella per la stima della funzione valore, mentre il secondo sostituisce la tabella con una rete neurale volta all’approssimazione della funzione valore, la quale ha permesso l’utilizzo di una più dettagliata rappresentazione dello stato dell’ambiente. In seguito ai risultati ottenuti, viene dimostrato che mediante i metodi di Reinforcement Learning, un agente è in grado di apprendere in modo autonomo le dinamiche richieste per afferrare correttamente sia un oggetto in posizione statica che in movimento.
43
Tonelli, Alfredo. "Image Processing e Computer Vision con Python e OpenCV". Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/20390/.
Texto completoResumen
Studio di uno degli ecosistemi software oggi maggiormente utilizzati per Image Processing e Computer Vision.
Lo studio affrontato parte dalle discipline di Image Processing e Computer Vision, passando per le principali soluzioni software adottate, tra le quali spiccano il linguaggio di programmazione ad alto livello Python e la libreria di Computer Vision OpenCV, per terminare con esempi pratici di base utili per capire il funzionamento delle tecnologie illustrate.
44
Örtenberg, Alexander. "Parallelization of DIRA and CTmod Using OpenMP and OpenCL". Thesis, Linköpings universitet, Informationskodning, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119183.
Texto completoResumen
Parallelization is the answer to the ever-growing demands of computing power by taking advantage of multi-core processor technology and modern many-core graphics compute units. Multi-core CPUs and many-core GPUs have the potential to substantially reduce the execution time of a program but it is often a challenging task to ensure that all available hardware is utilized. OpenMP and OpenCL are two parallel programming frameworks that have been developed to allow programmers to focus on high-level parallelism rather than dealing with low-level thread creation and management. This thesis applies these frameworks to the area of computed tomography by parallelizing the image reconstruction algorithm DIRA and the photon transport simulation toolkit CTmod. DIRA is a model-based iterative reconstruction algorithm in dual-energy computed tomography, which has the potential to improve the accuracy of dose planning in radiation therapy. CTmod is a toolkit for simulating primary and scatter projections in computed tomography to optimize scanner design and image reconstruction algorithms. The results presented in this thesis show that parallelization combined with computational optimization substantially decreased execution times of these codes. For DIRA the execution time was reduced from two minutes to just eight seconds when using four iterations and a 16-core CPU so a speedup of 15 was achieved. CTmod produced similar results with a speedup of 14 when using a 16-core CPU. The results also showed that for these particular problems GPU computing was not the best solution.
45
Lax, Derek Michael. "Memory efficient indexing algorithm for physical properties in OpenMC". Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/97862.
Texto completoResumen
Thesis: S.M., Massachusetts Institute of Technology, Department of Nuclear Science and Engineering, 2015.Cataloged from PDF version of thesis.
Includes bibliographical references (pages 55-56).
OpenMC is an open source Monte Carlo code designed at MIT with a focus on parallel scalability for large nuclear reactor simulations. The target problem for OpenMC is a full core high-fidelity multi-physics coupled simulation. This encompasses not only nuclear physics, but also material science and thermohydraulics. One of the challenges associated with this problem is efficient data management, as the memory required for tallies alone can easily enter the Terabyte range. This thesis presents an efficient system for data storage which allows for physical properties of materials to be indexed without any constraints on the geometry. To demonstrate its functionality, a sample depletion calculation with 4 isotopes is completed on the BEAVRS benchmark geometry. Additionally, a temperature distribution assembly layout is presented.
by Derek Michael Lax.
S.M.
46
Sung, Hsiang-Wei y 宋相緯. "OpenCV Optimization on Heterogeneous Multi-Core Systems for Gesture Recognition Applications via OpenCL Flow". Thesis, 2017. http://ndltd.ncl.edu.tw/handle/85k63z.
Texto completo
47
Zídek, Karel. "Využití GPU výpočtů pro rozpoznání dopravních značek". Master's thesis, 2015. http://www.nusl.cz/ntk/nusl-189527.
Texto completoResumen
The thesis deals with the problem of GPU acceleration of algorithms for traffic sign recognition. Theoretical part of the thesis outlines methods for object detection with emphasis on the traffic sign detection problem. Further, it provides comparison of two well known tools for programming on the GPU: CUDA and OpenCL. On the basis of the review, an architecture of own solution is proposed. Finally, the thesis contains description of the implementation as well as evaluation of the results.
48
Chin, Stephen Alexander. "Reusable OpenCL FPGA Infrastructure". Thesis, 2012. http://hdl.handle.net/1807/32567.
Texto completoResumen
OpenCL has emerged as a standard programming model for heterogeneous systems. Recent work combining OpenCL and FPGAs has focused on high-level synthesis. Building a complete OpenCL FPGA system requires more than just high-level synthesis. This work introduces a reusable OpenCL infrastructure for FPGAs that complements previous work and specifically targets a key architectural element - the memory interface. An Aggregating Memory Controller that aims to maximize bandwidth to external, large, high-latency, high-bandwidth memories and a template Processing Array with soft-processor and hand-coded hardware elements are designed, simulated, and implemented on an FPGA. Two micro-benchmarks were run on both the soft-processor elements and the hand-coded hardware elements to exercise the Aggregating Memory Controller. The micro-benchmarks were simulated as well as implemented in a hardware prototype. Memory bandwidth results for the system show that the external memory interface can be saturated and the high-latency can be effectively hidden using the Aggregating Memory Controller.
49
Παπαϊωάννου, Μαγδαληνή. "Δημιουργία χάρτη βάθους σκηνής σε υπολογιστικά συστήματα παράλληλης επεξεργασίας". Thesis, 2015. http://hdl.handle.net/10889/8589.
Texto completoResumen
Σκοπός της παρούσας εργασίας ήταν η μελέτη της μεθόδου κατασκευής του χάρτη βάθους μιας σκηνής από δύο εικόνες της, οι οποίες προσομοιάζουν την ανθρώπινη διοφθαλμική όραση. Η μέθοδος αναλύθηκε στους βασικούς της αλγορίθμους, και εξετάστηκε κατά πόσο και με ποιόν τρόπο θα μπορούσαν αυτοί να παραλληλοποιηθούν. Το OpenCL framework και η OpenCV βιβλιοθήκη μελετήθηκαν, και βρέθηκαν κατάλληλες και ικανές για την παραλληλοποίηση ενός αλγορίθμου υπολογιστικής όρασης. Με χρήση των παραπάνω υλοποιήθηκαν ενδεικτικά κάποιοι αλγόριθμοι και υπολογίστηκε το σχετικό βάθος των χαρακτηριστικών σημείων των εικόνων. Τέλος έγινε αξιολόγηση των αλγορίθμων ως προς την ταχύτητα και την ποιότητα των αποτελεσμάτων.The goal of the present thesis was to study a scene's depthmap creation, using a pair of images simulating human binocular vision. At first the whole method was cut down to its elementary algorithms. Then it was examined wether and how could these algorithms be parallelized. OpenCL framework and OpenCV library were found adequate and capable of parallelizing computer vision algorithms, so they were used to implement some indicative algorithms. Finally, the relative depth of image features was calculated via various algorithm combinations, that were then evaluated according to speed and accuracy.
50
Lin, Yu Kai y 林郁凱. "Interactive Photon Mapping in OpenCL". Thesis, 2014. http://ndltd.ncl.edu.tw/handle/8x6257.
Texto completoResumen
碩士國立臺灣師範大學
資訊工程學系
102
In recent years, the computing power of graphics processor has increasedgradually, and the GPGPU application model is more popular now. The ability of parallelcomputing in graphics processors can significantly enhance computing efficiency. Andthe support of various vendors to open computing language (OpenCL) platform, leadsto convenient features and the ability to handle memory using multiple layers withdifferent bandwidth. Also, OpenCL is a good interface for the heterogeneous systemarchitecture (HSA) implementations because it naturally supports cross-platform andparallel programming of modern processors. In order to improve the image quality, a number of different algorithms have beendeveloped to simulate real-world ighting situations in 3D rendering, where the math correctness of ray tracing and the ability to calculate various lighting effects have been proved. By using the information of the illumination environment such as photon map, the image quality will get more close to photo-realistic image. However, we must make a choice between render speed and image quality on traditional architecture because the huge amount of calculation. Fortunately, the ray tracing algorithms have parallel computing feature, which can render each pixel on the screen in parallel. We take advantage of this feature to obtain a significant performance boost on GPGPU platforms. In this research, we render static scene and focus on fast rendering and global illumination effects. We implement ray tracing and photon mapping algorithms on today's commonly used devices in OpenCL and analysis the characteristics of the algorithms to adjust to OpenCL platform. We also focus on the feasibility to enhancing program performance by some experimental results and try different way to make improvements for the photon mapping algorithm.