Rozprawy doktorskie na temat „Mesh data”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Mesh data”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Karlsson, Simon. "A Data Collection Framework for Bluetooth Mesh Networks". Thesis, Linköpings universitet, Programvara och system, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-157660.
Pełny tekst źródłaLee, Kai-wah, i 李啟華. "Mesh denoising and feature extraction from point cloud data". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B42664330.
Pełny tekst źródłaLee, Kai-wah. "Mesh denoising and feature extraction from point cloud data". Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B42664330.
Pełny tekst źródłaAl, Shbat Sherin [Verfasser]. "Decoupling Mesh and Data Representations for Geo-spatial Data Visualization / Sherin Al Shbat". Bremen : IRC-Library, Information Resource Center der Jacobs University Bremen, 2012. http://d-nb.info/1035265885/34.
Pełny tekst źródłaCheung, Steven. "Packet routing on mesh-connected computers /". [Hong Kong] : University of Hong Kong, 1992. http://sunzi.lib.hku.hk/hkuto/record.jsp?B13209607.
Pełny tekst źródłaKruskall, Peter S. (Peter Stephen). "Collaborative internet and voice data transfer using bluetooth mesh networking". Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/63013.
Pełny tekst źródłaCataloged from PDF version of thesis.
Includes bibliographical references (p. 61-62).
We present a new networking protocol, AirRAID, intended for wireless devices that, using the collective power of multiple devices within short-range communication sight, extends the availability of a secondary medium over an ad-hoc mesh network, resilient to the erratic movements of the mobile nodes from which it is comprised. We suggest improvements to the Bluetooth discovery algorithm, making use of a quantized hop velocity space to lower the probability of two devices missing each other completely during discovery, and introduce the concept of redundant backup paths to the wireless mesh, allowing for improved reliability in dynamic mesh network situations.
by Peter S. Kruskall.
M.Eng.
Xiao, Fei. "Hexahedral Mesh Generation from Volumetric Data by Dual Interval Volume". The Ohio State University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=osu1532003347814656.
Pełny tekst źródłaMaglo, Adrien Enam. "Progressive and Random Accessible Mesh Compression". Phd thesis, Ecole Centrale Paris, 2013. http://tel.archives-ouvertes.fr/tel-00966180.
Pełny tekst źródła張治昌 i Steven Cheung. "Packet routing on mesh-connected computers". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1992. http://hub.hku.hk/bib/B3121020X.
Pełny tekst źródłaOlsson, Rasmus, i Jens Egeland. "Reinforcement Learning Routing Algorithm for Bluetooth Mesh Networks". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-234287.
Pełny tekst źródłaDagens kontors- och hemmiljöer rör sig mot mer sammankopplad digital in-frastruktur, vilket innebär att det finns många heterogena enheter som behöver kommunicera med varandra på korta avstånd. Mobiltelefoner, tablets, bärbara datorer, sensorer, skrivare är exempel på enheter i sådana miljöer. Utifrån detta uppkommer IoT, och för att möjliggöra det, behövs energieffektiva M2M kom-munikationslösningar. Vår studie kommer att anvanda BLE teknik för kommu-nikation mellan enheter, och den kommer att demonstrera effekterna av routing algoritmer i sådana nätverk. Med målet att öka livstiden för nätverket föreslås en distribuerad och dynamisk RL routing algoritm baserad på Q-learning. En jämförelse mellan den föreslagna algoritmen och de två statiska och centraliser-ade referensalgoritmerna görs i olika simulerings scenarier. Resultaten visar att vår föreslagna RL routing algoritm fungerar bättre när nod graden i topologin ökar. Jämfört med referensalgoritmerna kan den föreslagna algoritmen hantera en högre belastning på nätverket med betydande prestandaförbättring, tack vare den dynamiska förändringen av rutter som leder till en bättre belastningsbal-ans. Ökningen i nätverkslivstiden med 75 enheter är 124% och med 100 enheter är ökningen 349%, på grund av förmågan att byta rutter vilket syns tydligare när nodgraden ökar. För 35, 55 och 75 enheter är nodgraderna 2.21, 2.39 och 2.54. Vid ett lägre antal enheter presterar vår RL routing algoritm nästan lika bra som den bästa referensalgoritmen, EAR, med en minskning av nätverks livstiden på runt 19% med 35 enheter och 10% med 55 enheter. En minskning av nätverks livstiden på lägre antal enheter beror på att kostnaden för att lära sig nya vägar är högre än vinsten från att utforska flera vägar.
Randrianarivony, Maharavo. "Software pertaining to the preparation of CAD data from IGES interface for mesh-free and mesh-based numerical solvers". Universitätsbibliothek Chemnitz, 2007. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200700267.
Pełny tekst źródłaMara, Jösch Ronja. "Managing Microservices with a Service Mesh : An implementation of a service mesh with Kubernetes and Istio". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-280407.
Pełny tekst źródłaTillämpningen av microservices underlättar utvidgningen av datorsystem i storlek, komplexitet och distribution. Utöver fördelarna introducerar de möjligheten till partiella misslyckanden. Förutom att fokusera på affärslogiken måste utvecklare hantera övergripande problem med kommunikation mellan olika tjänster som nu definierar applikationernas pålitlighet och prestanda. För närvarande använder utvecklare bibliotek inbäddade i programkoden för att hantera dessa problem. Detta ökar dock kodens komplexitet och kräver underhåll och hantering av olika bibliotek. Service mesh är en relativt ny teknik som kan möjliggöra för utvecklare att hålla fokus på sin affärslogik. Denna avhandling undersöker ett av de tillgängliga service mesh som kallas Istio för att identifiera dess fördelar och begränsningar. De viktigaste fördelarna som hittas är att Istio lägger till resistens och säkerhet, tillåter funktioner som för närvarande är svåra att implementera och möjliggör en renare struktur och en standardimplementering av funktioner inom och över olika team. Nackdelarna är att det minskar prestandan genom att öka CPU-användning, minnesanvändning och latens. Dessutom är Istios största nackdel dess begränsade testverktyg. Baserat på resultaten kan Webcore Infra-teamet i företaget fatta ett mer informerat beslut om Istio ska införas eller inte.
Choung, Yunjae. "Extraction of blufflines from 2.5 dimensional Delaunay triangle mesh using LiDAR data". The Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=osu1251138890.
Pełny tekst źródłaAgnihotri, Mohit Kumar. "Energy efficient topology formation for Bluetooth mesh networks using heterogeneous devices". Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-187022.
Pełny tekst źródłaNandwani, Mukta. "Real-time Remote Visualization of Scientific Data". Thesis, Virginia Tech, 2002. http://hdl.handle.net/10919/33138.
Pełny tekst źródłaMaster of Science
Gudla, Prabhakar Reddy. "Texture-based segmentation and finite element mesh generation for heterogeneous biological image data". College Park, Md. : University of Maryland, 2005. http://hdl.handle.net/1903/2395.
Pełny tekst źródłaThesis research directed by: Biological Resources Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Rokos, Georgios. "Scalable multithreaded algorithms for mutable irregular data with application to anisotropic mesh adaptivity". Thesis, Imperial College London, 2014. http://hdl.handle.net/10044/1/24812.
Pełny tekst źródłaDeo, Sonali. "Mesh Networking in Low Power Location Systems (Swarm)". Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-204558.
Pełny tekst źródłaShan, Ju-Lin. "Research and application of adaptive finite element Mesh generation algorithm". Reims, 2007. http://theses.univ-reims.fr/exl-doc/GED00000709.pdf.
Pełny tekst źródłaCakmak, Ozan. "PRIVACY PRESERVATION IN A HYBRID MULTI MESH-LTE AMI NETWORK FOR SMART GRID". OpenSIUC, 2015. https://opensiuc.lib.siu.edu/theses/1720.
Pełny tekst źródłaXing, Baoyuan. "Improved 3D Heart Segmentation Using Surface Parameterization for Volumetric Heart Data". Digital WPI, 2013. https://digitalcommons.wpi.edu/etd-theses/270.
Pełny tekst źródłaKpodzo, Elias, Marc DiLemmo i Wearn-Juhn Wang. "Wireless Rotor Data Acquisition System". International Foundation for Telemetering, 2011. http://hdl.handle.net/10150/595665.
Pełny tekst źródłaFlight test data acquisition systems have been widely deployed in helicopter certification programs for a few decades. A data acquisition system uses a series of strategically placed sensors to provide instantaneous status condition of the helicopter's components and structure. However, until recently, it has been difficult to collect flight test data from helicopter rotors in motion. Traditional rotor solutions have used slip rings to electrically connect fixed and rotating mechanical elements; but slip rings are inconvenient to use, prone to wear, and notoriously unreliable.
Balduzzi, Mathilde. "Plant canopy modeling from Terrestrial LiDAR System distance and intensity data". Thesis, Montpellier 2, 2014. http://www.theses.fr/2014MON20203.
Pełny tekst źródłaThe challenge of this thesis is reconstruct the 3D geometry of vegetation from distance and intensity data provided by a 3D scanner LiDAR. A method of “Shape-From-Shading” by propagation is developed to be combined with a fusion method of type “Kalman” to get an optimal reconstruction of the leaves. -Introduction-The LiDAR data analysis shows that the point cloud quality is variable. This quality depends upon the measurement set up. When the LiDAR laser beam reaches the edge of a surface (or a steeply inclined surface), it also integrate background measurement. Those set up produce outliers. This kind of set up is common for foliage measurement as foliages have in general fragmented and complex shape. LiDAR data are of bad quality and the quantity of leaves in a scan makes the correction of outliers fastidious. This thesis goal is to develop a methodology to allow us to integrate the LiDAR intensity data to the distance to make an automatic correction of those outliers. -Shape-from-shading-The Shape-from-shading principle is to reconstruct the distance values from intensities of a photographed object. The camera (LiDAR sensor) and the light source (LiDAR laser) have the same direction and are placed at infinity relatively to the surface. This makes the distance effect on intensity negligible and the hypothesis of an orthographic camera valid. In addition, the relationship between the incident angle light beam and intensity is known. Thanks to the LiDAR data analysis, we are able to choose the best data between distance and intensity in the scope of leaves reconstruction. An algorithm of propagation SFS along iso-intense regions is developed. This type of algorithm allows us to integrate a fusion method of type Kalman. -Mathematical design of the method-The patches of the surface corresponding to the iso-intense regions are patches of surfaces called the constant slope surfaces, or sand-pile surfaces. We are going to use those surfaces to rebuild the 3D geometry corresponding to the scanned surfaces. We show that from the knowledge of the 3d of an iso-intensity region, we can construct those sand-pile surfaces. The initialization of the first iso-intense regions contour (propagation seeds) is done with the 3D LiDAR data. The greatest slope lines of those surfaces are generated. Thanks to the propagation of those lines (and thus of the corresponding sand-pile surface), we build the other contour of the iso-intense region. Then, we propagate the reconstruction iteratively. -Kalman filter-We can consider this propagation as being the computation of a trajectory on the reconstructed surface. In our study framework, the distance data is always available (3D scanner data). It is thus possible to choose which data (intensity vs distance) is the best to reconstruct the object surface. This can be done with a fusion of type Kalman filter. -Algorithm-To proceed a reconstruction by propagation, it is necessary to order the iso-intensity regions. Once the propagation seeds are found, they are initialized with the distances provided by the LiDAR. For each nodes of the hierarchy (corresponding to an iso-intensity region), the sand-pile surface reconstruction is done. -Manuscript-The thesis manuscript gathers five chapters. First, we give a short description of the LiDAR technology and an overview of the traditional 3D surface reconstruction from point cloud. Then we make a state-of-art of the shape-from –shading methods. LiDAR intensity is studied in a third chapter to define the strategy of distance effect correction and to set up the incidence angle vs intensity relationship. A fourth chapter gives the principal results of this thesis. It gathers the theoretical approach of the SFS algorithm developed in this thesis. We will provide its description and results when applied to synthetic images. Finally, a last chapter introduces results of leaves reconstruction
Chai, Yi. "A novel progressive mesh representation method based on the half-edge data structure and √3 subdivision". Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5797.
Pełny tekst źródła0707671386
Quan, Yongyun. "Topology-based Device Self-identification in Wireless Mesh Networks". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-261147.
Pełny tekst źródłaI samband med Internet of Things (IoT) är igångkörning processen att säkert lägga till en ny enhet i ett nätverk. Den täcker många olika uppgifter, inklusive fysisk distribution av enheter och konfigurering av parametrar. Det är nätverksinstallatörer som måste manuellt beställa varje enhet en efter en med hjälp av installationsverktyg. I praktiken är den första uppgiften för en nätverksinstallatör att korrekt identifiera varje enhet innan den konfigureras med lämpliga parametrar. Att identifiera varje enhet speciellt i ett stort nätverk är en mycket tidskrävande process. Detta är också känt som identifieringsproblemet. Detta projekt kommer att ta itu med problemet.En nyhetsidentifieringsmetod presenteras i avhandlingen och det finns ingen mänsklig intervention involverad i identifieringsprocessen. Enheter försöker identifiera sig baserat på fördefinierade regler och information. Tillvägagångssättet kallas därför enhetens självidentifiering och det implementeras i två olika algoritmer, en är centraliserad enhetens självidentifiering och den andra är distribuerad enhetens självidentifiering. Kort sagt, endast en enhet deltar i enhetsidentifieringsprocessen i centraliserat tillvägagångssätt, och i distribuerad motsvarighet är varje enhet en del av identifieringsprocessen.Resultaten av implementationerna visar potentialen för det nya sättet att identifiera enheter i IoT. Enheter i både centraliserat tillvägagångssätt och distribuerat tillvägagångssätt kan identifiera sig med den information som krävs för nätverket. En detaljerad diskussion om de två föreslagna algoritmerna och nätverksinformationen presenteras i avhandlingen.
Rahat, Alma As-Aad Mohammad. "Hybrid evolutionary routing optimisation for wireless sensor mesh networks". Thesis, University of Exeter, 2015. http://hdl.handle.net/10871/21330.
Pełny tekst źródłaLavén, Andreas. "Multi-Channel Anypath Routing for Multi-Channel Wireless Mesh Networks". Thesis, Karlstad University, Faculty of Economic Sciences, Communication and IT, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-5370.
Pełny tekst źródłaIncreasing capacity in wireless mesh networks can be achieved by using multiple channels and radios. By using different channels, two nodes can send packets at the same time without interfering with each other. To utilize diversity of available frequency, typically cards use channel-switching, which implies significant overhead in terms of delay. Assignment of which channels to use needs to be coupled with routing decisions as routing influences topology and traffic demands, which in turn impacts the channel assignment.
Routing algorithms for wireless mesh networks differ from routing algorithms that are used in wired networks. In wired networks, the number of hops is usually the only metric that matters. Wireless networks, on the other hand, must consider the quality of different links, as it is possible for a path with a larger amount of hops to be better than a path with fewer hops.
Typical routing protocols for wireless mesh networks such as Optimized Link State Routing (OLSR) use a single path to send packets from source to destination. This path is precomputed based on link state information received through control packets. The consideration of more information than hop-count in the routing process has shown to be beneficial as for example link quality and physical layer data rate determines the quality of the end-to-end path. In multi-channel mesh networks, also channel switching overhead and channel diversity need to be considered as a routing metric. However, a major drawback of current approaches is that a path is precomputed and used as long as the path is available and shows a good enough metric. As a result, short term variations on link quality or channel switching are not considered.
In this thesis, a new routing protocol is designed that provides a set of alternative forwarding candidates for each destination. To minimize delay (from both transmission and channel switching), a forwarding mechanism is developed to select one of the available forwarding candidates for each packet. The implementation was tested on an ARM based multi-radio platform, of which the results show that in a simple evaluation scenario the average delay was reduced by 22 % when compared to single path routing.
Pieskä, Marcus. "Emulating Software-Defined Small-Cell Wireless Mesh Networks Using ns-3 and Mininet". Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-68795.
Pełny tekst źródłaSOCRA
Sun, Zhen. "Latency-aware Optimization of the Existing Service Mesh in Edge Computing Environment". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254621.
Pełny tekst źródłaEdge computing, som ett tillvägagångssätt för att utnyttja beräkningsfunktioner som finns på olika ställen, används i stor utsträckning i branschen nuförtiden. Med utvecklingen av kantdatabasen flyttar många stora företag från den traditionella monolitiska mjukvaruarkitekturen till mikroserviceteknik. För att ge bättre prestanda för de applikationer som innehåller många löst kopplade moduler som distribueras bland flera kluster, måste service routing bland flera kluster vara effektiva. De flesta befintliga lösningarna är dock dedikerade till statisk service-routing och belastningsbalanseringsstrategi, vilket gör att programmets prestanda inte effektivt kan optimeras när nätverksförhållandena ändras.För att ta itu med problemet som nämnts ovan föreslog vi en dynamisk viktad round robin-algoritm och implementerade den ovanpå den avancerade servicenätverket Istio. Lösningen implementeras som en Docker-bild som heter RoutingAgent, som är enkel att distribuera och hantera. Med agenten som körs i systemet ändras vikten av målruteringsklustret dynamiskt baserat på den upptäckta interklusternätets latens. Följaktligen kommer klientsidans begäran om omställningstid att minskas.Lösningen utvärderas i en emulerad miljö. Jämfört med Istio utan agent visar experimentresultaten att klientens latentitet effektivt kan minimeras av den föreslagna lösningen i multicluster-miljö med dynamiska nätverksförhållanden. Förutom att minimera responstid visar emuleringsresultat att belastningar i varje kluster är välbalanserade.
Cho, Minn, i Philipe Granhäll. "An Analysis on Bluetooth Mesh Networks and its Limits to Practical Use". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-301847.
Pełny tekst źródłaEtt mesh nätverk är en teknik som blivit populär igen och används ofta av allmänheten. Eftersom denna ökade användning observeras, tekniker som Bluetooth anpassas för att skapa mesh nätverksvarianter. I denna avhandling skapas och testas ett Bluetoothnätverk med Raspberry pi 4’s och Bluetoothgränssnittet, btferret. Denna uppsats försöker nå gränserna för denna teknik med hjälp av tillgängliga verktyg, definiera nätverks prestandan som en riktlinje för att avgöra om det är lämpligt för användning för uppgifter till hands. Resultaten visar att BLE mesh nätverk har tydliga begränsningar som avslöjar sig i olika sammanhang. I denna raport så undersöks paket storlek och antal hopp som ett paket kan göra inom nätverket utan signifikant prestandafall. Dessutom har olika andra faktorer, såsom väggar och andra störande radiofrekvenser visat sig påverka nätverket. Från alla experiment som genomförts så illustreras relativa effekt av det olika faktorer.
Mara, Hubert [Verfasser], i Willi [Akademischer Betreuer] Jäger. "Multi-Scale Integral Invariants for Robust Character Extraction from Irregular Polygon Mesh Data / Hubert Mara ; Betreuer: Willi Jäger". Heidelberg : Universitätsbibliothek Heidelberg, 2012. http://d-nb.info/1177039567/34.
Pełny tekst źródłaLimper, Max [Verfasser], Dieter W. [Akademischer Betreuer] Fellner i Marc [Akademischer Betreuer] Alexa. "Automatic Optimization of 3D Mesh Data for Real-Time Online Presentation / Max Limper ; Dieter W. Fellner, Marc Alexa". Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2018. http://d-nb.info/1162275170/34.
Pełny tekst źródłaLi, Yinan. "Integrated Mobility and Service Management for Network Cost Minimization in Wireless Mesh Networks". Diss., Virginia Tech, 2012. http://hdl.handle.net/10919/27622.
Pełny tekst źródłaPh. D.
Brage, Carl. "Synchronizing 3D data between software : Driving 3D collaboration forward using direct links". Thesis, Linköpings universitet, Institutionen för datavetenskap, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-175165.
Pełny tekst źródłaLe, goff Nicolas. "Construction of a conformal hexahedral mesh from volume fractions : theory and applications". Electronic Thesis or Diss., université Paris-Saclay, 2020. http://www.theses.fr/2020UPASG033.
Pełny tekst źródłaThis thesis addresses the problem of the automatic generation of purely hexahedral meshes for simulation codes when having a mesh carrying volume fraction data as an input, meaning that there can be several materials inside one cell. The proposed approach should create an hexahedral mesh where each cell corresponds to a single material, and where interfaces between materials form smooth surfaces. From a theoretical standpoint, we aim at adapting and extending state-of-the-art techniques and we apply them on examples, some classically issued from CAD models (and imprinted onto a mesh to obtain volume fractions), some procedurally generated cases and others in an intercode capacity where we take the results of a first simulation code to be our inputs. We first define a metric that allows the evaluation of our (or others') results and a method to improve those; we then introduce a discrete material interface reconstruction method inspired from the scientific visualization field and finally we present an algorithmic pipeline, called {sc ELG}, that offers a guarantee on the mesh quality by performing geometrical and topological mesh adaptation
Gurung, Topraj. "Compact connectivity representation for triangle meshes". Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/47709.
Pełny tekst źródłaJoshi, Shriyanka. "Reverse Engineering of 3-D Point Cloud into NURBS Geometry". University of Cincinnati / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1595849563494564.
Pełny tekst źródłaBerbel, Talita dos Reis Lopes. "Recomendação semântica de documentos de texto mediante a personalização de agregações OLAP". Universidade Federal de São Carlos, 2015. https://repositorio.ufscar.br/handle/ufscar/632.
Pełny tekst źródłaWith the rapid growth of unstructured data, such as text documents, it becomes more and more interesting and necessary to extract such information to support decision making in business intelligence systems. Recommendations can be used in the OLAP process, because they allow users to have a particular experience in exploiting data. The process of recommendation, together with the possibility of query personalisation, allows recommendations to be increasingly relevant. The main contribution of this work is to propose an effective solution for semantic recommendation of documents through personalisation of OLAP aggregation queries in a data warehousing environment. In order to aggregate and recommend documents, we propose the use of semantic similarity. Domain ontology and the statistical measure of frequency are used in order to verify the similarity between documents. The threshold of similarity between documents in the recommendation process is adjustable and this is the personalisation that provides to the user an interactive way to improve the relevance of the results. The proposed case study is based on articles from PubMed and its domain ontology in order to create a prototype using real data. The results of the experiments are presented and discussed, showing that good recommendations and aggregations are possible with the suggested approach. The results are discussed on the basis of evaluation measures: precision, recall and F1-measure.
Com o crescimento do volume dos dados não estruturados, como os documentos de texto, torna-se cada vez mais interessante e necessário extrair informações deste tipo de dado para dar suporte à tomada de decisão em sistemas de Business Intelligence. Recomendações podem ser utilizadas no processo OLAP, pois permitem que os usuários tenham uma experiência diferenciada na exploração dos dados. O processo de recomendação, aliado à possibilidade da personalização das consultas dos usuários, tomadores de decisão, permite que as recomendações possam ser cada vez mais relevantes. A principal contribuição deste trabalho é a proposta de uma solução eficaz para a recomendação semântica de documentos mediante a personalização de consultas de agregação OLAP em um ambiente de Data Warehousing. Com o intuito de agregar e recomendar documentos propõe-se a utilização da similaridade semântica. A ontologia de domínio e a medida estatística de frequência são utilizadas com o objetivo de verificar a similaridade entre os documentos. O limiar de similaridade entre os documentos no processo de recomendação pode ser parametrizado e é esta a personalização que oferece ao usuário uma maneira interativa de melhorar a relevância dos resultados obtidos. O estudo de caso proposto se baseia em artigos da PubMed e em sua ontologia de domínio com o propósito de criar um protótipo utilizando dados reais. Os resultados dos experimentos realizados são expostos e analisados, mostrando que boas recomendações e agregações são possíveis utilizando a abordagem sugerida. Os resultados são discutidos com base nas métricas de avaliação: precision, recall e F1-measure.
Carosi, Robert. "Protractor: Leveraging distributed tracing in service meshes for application profiling at scale". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232139.
Pełny tekst źródłaStorskaliga Internettjänster implementeras allt oftare som distribuerade system för att uppnå feltolerans, tillgänglighet och skalbarhet. När en request spänner över flera tjänster ger inte längre end-to-end övervakning en tydlig bild av orsaken till felet. Distribuerad tracing utvecklades för att spåra end-to-end request latency per tjänst och för att ge en indikation vart problemet kan ligger med visar oftas inte orsaken. Genom user research fann vi att root-cause-analys av prestandaproblem ofta fortfarande görs genom att manuellt korrelera information från loggar, stack traces och övervakningsverktyg. Kod-profilering tillhandahåller detaljerad information, men vi fann att den sällan används i produktionssystem på grund av att de kräver ändringar i den befintliga koden, de stora lagringskraven som de introducerar och eftersom det är svårt att korrelera profilerings data med information från andra källor. Utbredning av moderna kodprofilerare med låg overhead öppnar upp möjligheten att kontinuerligt köra dem i produktionsmiljöer. Vi introducerar Protractor som kombinerar kodprofilering och distribuerad tracing. Genom att utnyttja och bygga på koncept så som service meshes uppnår vi transparens på applikationsnivå och använder anomalitetsdetektering för att selektivt lagra relevant profileringsinformation. Den informationen korreleras med distribuerade traces för att ge kontext för root-cause-analys. Protractor har stöd för olika kodprofilerare och experiment har visat att påverkan på end-to-end request latency är mindre än 3Användbarheten av Protractor är ytterligare underbyggd med en undersökning som visar att majoriteten av deltagarna skulle använda den ofta.
Rountree, Richard John. "Novel technologies for the manipulation of meshes on the CPU and GPU : a thesis presented in partial fulfilment of the requirements for the degree of Masters of Science in Computer Science at Massey University, Palmerston North, New Zealand". Massey University, 2007. http://hdl.handle.net/10179/700.
Pełny tekst źródłaCunha, Ícaro Lins Leitão da. "Estrutura de dados Mate Face e aplicações em geração e movimento de malhas". Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-17062009-105850/.
Pełny tekst źródłaTopological data Structures (DS) oer several advantages when performing a deformation on a mesh. These DSs allow movement throughout the mesh without modifying its topology, are relatively simple to implement, and there is always the possibility of merging it to simulation/deformation cycle on a completely automatic and ecient form. The main goal of this work is to design and implement a topological DS to represent elastic meshes. These meshes can be either of surface or volume kind, and even simple or mixed. For better performance, more reliability and lower memory consumption, it is necessary that the DSs allow the representation of incident and adjacent components of a given element to be implicit. The second objective to this work is to tackle the problem of mesh generation on arbitrary domains defined by implicit functions. The proposed method is an extension to the algorithm of Partition of Unity Implicits (PUI). For this the proposed method is based on an isosurface stung approach. It adaptively generates the tetrahedra in dierent levels of refinement accordingly to the level of detail presented by the regions of the domain. Dierently to previous work, this feature is done naturally without the aid of an auxiliary data structure. To this end, we use an algebraic structure, named Ja1 triangulation, which is capable of dealing with such refinements. In addition, the Ja1 triangulation permits traversing through the mesh by simply using algebraic rules which is another advantage to the proposed method
Randrianarivony, Maharavo. "Geometric processing of CAD data and meshes as input of integral equation solvers". Doctoral thesis, [S.l. : s.n.], 2006. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200601972.
Pełny tekst źródłaLundgren, Therese. "Digitizing the Parthenon using 3D Scanning : Managing Huge Datasets". Thesis, Linköping University, Department of Science and Technology, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2636.
Pełny tekst źródłaDigitizing objects and environments from real world has become an important part of creating realistic computer graphics. Through the use of structured lighting and laser time-of-flight measurements the capturing of geometric models is now a common process. The result are visualizations where viewers gain new possibilities for both visual and intellectual experiences.
This thesis presents the reconstruction of the Parthenon temple and its environment in Athens, Greece by using a 3D laser-scanning technique.
In order to reconstruct a realistic model using 3D scanning techniques there are various phases in which the acquired datasets have to be processed. The data has to be organized, registered and integrated in addition to pre and post processing. This thesis describes the development of a suitable and efficient data processing pipeline for the given data.
The approach differs from previous scanning projects considering digitizing this large scale object at very high resolution. In particular the issue managing and processing huge datasets is described.
Finally, the processing of the datasets in the different phases and the resulting 3D model of the Parthenon is presented and evaluated.
Li, Ting. "Contributions to Mean Shift filtering and segmentation : Application to MRI ischemic data". Phd thesis, INSA de Lyon, 2012. http://tel.archives-ouvertes.fr/tel-00768315.
Pełny tekst źródłaItier, Vincent. "Nouvelles méthodes de synchronisation de nuages de points 3D pour l'insertion de données cachées". Thesis, Montpellier, 2015. http://www.theses.fr/2015MONTS017/document.
Pełny tekst źródłaThis thesis addresses issues relating to the protection of 3D object meshes. For instance, these objects can be created using CAD tool developed by the company STRATEGIES. In an industrial context, 3D meshes creators need to have tools in order to verify meshes integrity, or check permission for 3D printing for example.In this context we study data hiding on 3D meshes. This approach allows us to insert information in a secure and imperceptible way in a mesh. This may be an identifier, a meta-information or a third-party content, for instance, in order to transmit secretly a texture. Data hiding can address these problems by adjusting the trade-off between capacity, imperceptibility and robustness. Generally, data hiding methods consist of two stages, the synchronization and the embedding. The synchronization stage consists of finding and ordering available components for insertion. One of the main challenges is to propose an effective synchronization method that defines an order on mesh components. In our work, we propose to use mesh vertices, specifically their geometric representation in space, as basic components for synchronization and embedding. We present three new synchronisation methods based on the construction of a Hamiltonian path in a vertex cloud. Two of these methods jointly perform the synchronization stage and the embedding stage. This is possible thanks to two new high-capacity embedding methods (from 3 to 24 bits per vertex) that rely on coordinates quantization. In this work we also highlight the constraints of this kind of synchronization. We analyze the different approaches proposed with several experimental studies. Our work is assessed on various criteria including the capacity and imperceptibility of the embedding method. We also pay attention to security aspects of the proposed methods
Jääskeläinen, Perttu. "Comparing Cloud Architectures in terms of Performance and Scalability". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254615.
Pełny tekst źródłaMolntjänster blir alltmer populära i dagens industri, där stora mängder av företagens omsättning består av tjänster erbjudna i form av molnlösningar. När det kommer till att välja en lösning finns många för samma problem, där det är upp till kunden att välja vilken som passar bäst. Denna rapport fokuserar på tjänster erbjudna av Microsofts Azure plattform, i en jämförelse av arkitekturer som belastningstestas för att mäta prestanda och skalbarhet.För att avgöra vilken arkitektur som är optimalast mäts tre olika tjänster erbjudna i Azure: Cloud Services (CS), Service Fabric Mesh (SFM) och Virtual Machines (VM). Detta görs genom att utveckla och deploya ett REST Web API som är simulerat med användare, där prestanda mäts genom att ta medelresponstiden i millisekunder per anrop. För att avgöra skalbarhet identifieras en punkt där tjänsten inte längre klarar av antalet inkommande anrop och börjar returnera felkoder. Maskinerna för varje tjänst testas både genom att skala upp, genom att förstärka en maskin, men även genom att skala ut, där det skapas flera instanser av samma maskin.Resultatet visar att Virtual Machines hamnar betydligt efter både CS och SFM i både prestanda och skalbarhet för ett vanligt användarfall. För låga mängder anrop ligger samtliga tjänster väldigt lika, men så fort anropen börjar öka så märks det tydligt att SFM och CS presterar bättre än Virtual Machines. I slutändan ligger CS i framkant, både i form av prestanda och skalbarhet.Vidare undersökning kan göras för de olika plattformarna erbjudna av konkurrenter, så som Amazon Web Services (AWS) och Google Cloud, samt andra arkitekturer från Azure.
Hauge, John Hutcheson Drew Scott Paul. "Boundary layer data system (BLDS) heating system : final project report /". Click here to view, 2009. http://digitalcommons.calpoly.edu/mesp/2/.
Pełny tekst źródłaJain, Sachin. "Multiresolution strategies for the numerical solution of optimal control problems". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/22656.
Pełny tekst źródłaCommittee Chair: Tsiotras, Panagiotis; Committee Member: Calise, Anthony J.; Committee Member: Egerstedt, Magnus; Committee Member: Prasad, J. V. R.; Committee Member: Russell, Ryan P.; Committee Member: Zhou, Hao-Min.
Ross, Brant Arnold. "Flexible Engineering Software: An Integrated Workstation Approach to Finite Element Analysis". BYU ScholarsArchive, 1985. https://scholarsarchive.byu.edu/etd/3460.
Pełny tekst źródłaAkbar, Yousef M. A. H. "Intrusion Detection of Flooding DoS Attacks on Emulated Smart Meters". Thesis, Virginia Tech, 2020. http://hdl.handle.net/10919/98554.
Pełny tekst źródłaM.S.
The power grid is becoming more digitized and is utilizing information and communication technologies more, hence the smart grid. New systems are developed and utilized in the modernized power grid that directly relies on new communication networks. The power grid is becoming more efficient and more effective due to these developments, however, there are some considerations to be made as for the security of the power grid. An important expectation of the power grid is the reliability of power delivery to its customers. New information and communication technology integration brings rise to new cyber vulnerabilities that can inhibit the functionality of the power grid. A coordinated cyber-attack was conducted against the Ukrainian power grid in 2015 that targeted the cyber vulnerabilities of the system. The attackers made sure that the grid operators were unable to observe their system being attacked via Denial of Service attacks. Smart meters are the digitized equivalent of a traditional energy meter, it wirelessly communicates with the grid operators. An increase in deployment of these smart meters makes it such that we are more dependent on them and hence creating a new vulnerability for an attack. The smart meter integration into the power grid needs to be studied and carefully considered for the prevention of attacks. A testbed is created using devices that emulate the smart meters and a network is established between the devices. The network was attacked with a Denial of Service attack to validate the testbed performance, and an Intrusion detection method was developed and applied onto the testbed to prove that the testbed created can be used to study and develop methods to cover the vulnerabilities present.