Submitted by Marlene Santos (marlene.bc.ufg@gmail.com) on 2014-11-28T19:44:35Z No. of bitstreams: 2 Dissertação - Kelton de Sousa Santiago - 2013.pdf: 1524155 bytes, checksum: d6ef69ca7d54266b0df3f43d6f5a6ced (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2014-12-04T14:17:43Z (GMT) No. of bitstreams: 2 Dissertação - Kelton de Sousa Santiago - 2013.pdf: 1524155 bytes, checksum: d6ef69ca7d54266b0df3f43d6f5a6ced (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2014-12-04T14:17:43Z (GMT). No. of bitstreams: 2 Dissertação - Kelton de Sousa Santiago - 2013.pdf: 1524155 bytes, checksum: d6ef69ca7d54266b0df3f43d6f5a6ced (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2013-03-05 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / samples and variables selection simultaneously. The algorithmic methods combination for selecting samples and variables in the multivariate calibration aims to building an effective model for predicting the concentration of a certain interest property. As study case uses data acquired by a material analysis with near infrared waves (NIR) on wheat samples in order to estimate the proteins concentration. The algorithms for selection samples as the random number generator (RNG), KennardStone (KS), sample set partitioning based on joint X and Y (SPXY) were used in conjunction with successive projection algorithms (SPA) and partial least square algorithm (PLS) for selection of variables in order to obtain results that can be used for comparison basis with the proposed algorithm AGCD results obtained. The presented results by samples selection algorithms (GNA, KS and SPXY) were too close,butwhenusedtogetherwithvariableselectionalgorithms(SPAandPLS)theresults were better in RMSEP terms. TheAGCDachievedsignificantlybetterresultscomparedtotheotherstestedalgorithms, reaching an improvement of 97% in comparison with the KS algorithm and an improvement of 63% over SPXY-PLS algorithm, which further approached the AGCD results. / Este trabalho propõe o uso de um algoritmo genético de cromossomo duplo (AGCD) paraaseleçãodeamostrasedevariáveisdeformasimultânea.Aassociaçãodosmétodos algoritmicos para a seleção de amostras e variáveis na calibração multivariada busca a construção de um modelo eficaz para a predição da concentração de uma determinada propriedade de interesse. Como estudo de caso utiliza-se dados adquiridos por uma análise de material com ondas de infravermelho próximo (NIR) sobre amostras de trigo com o propósito de estimar a concentração de proteínas existentes. Os algoritmos de seleção de amostras como o gerador de números aleatórios (GNA), Kennard-Stone(KS),particionamentodeconjuntodeamostrasbaseadanadistânciadeX e Y (SPXY) foram utilizados em conjunto aos algoritmos de projeção sucessivas (SPA) e o algoritmo de mínimos quadrados parciais (PLS) para seleção de variáveis, a fim de se obter resultados que sirvam como base de comparação com os resultados obtidos pelo algoritmo AGCD proposto. Os resultados apresentados pelos algoritmos de seleção de amostras (GNA, KS e SPXY) semostrarambastantepróximos,masquandoutilizadosjuntamentecomosalgoritmosde seleção de variáveis (SPA e PLS) seus resultados foram melhores em termos de RMSEP. O algoritmo evolutivo de cromossomo duplo (AGCD) alcançou resultados significativamentemelhoresemcomparaçãoaosdemaisalgoritmostestados,atingindoumamelhoria de 97% em comparação com o algoritmo KS e uma melhoria de 63% sobre o algoritmo SPXY-PLS, o que mais se aproximou dos resultados do AGCD.

The aim of this paper is to find an algorithm to establish and maintain a virtual enclosure around a mobile unit. The area may take any form and should be scalable up to and including national borders. The enclosure is managed on the mobile unit. The target system is Android. Smartphones, tablets and more recently, cameras is examples of mobile units. A modern mobile unit is part of a computer network. It is designed to be connected all the time. A mobile unit have the capability to handle large volumes of data, data that might be both sensitive and possess an economic value. Management of mobile units is vital to protect the data and insure security for the entire network. A mobile unit is a resource in the network. Each resource is defined by a set of parameters. One parameter that make a mobile unit special is the lack of physical boundaries to world. Typically, the first step in security is access control to resources. Therefore, the lack of physical access control has to be replaced by other means such as tracking the location of the mobile unit. In this paper I have studied the possibility of creating a virtual fence around the mobile unit. The mobile unit is free to move within the area enclosed by the virtual fence. The mobile unit alert all concerned parties if it crossed the fence and thus leave the enclosed area. The aim was to find a practical algorithm to establish and maintain a virtual fence around the mobile device. A grid-based algorithm was selected because it can handle small to very large areas. All data are collected in a table which makes the algorithm fast, regardless the size of the area. A grid enables management of multiple enclosures and relationships between them. Deeper analysis revealed that the mobile device is not able to position sufficiently often and accurately for the grid-based algorithm to handle small areas. A complementary method is needed for minimizing the need for positioning. To manage properties, such as geographical information, the selected algorithm is deemed to be well suited. / Telefon: 0734 097 404 Skype: di98jgu

This master thesis presents a method to find the optimal speed profile for a dynamic system in the shape of an electric vehicle and any topography using a search algorithm. The search algorithm is capable of considering all the speed choices in a topography presented discretely, in order to find the most energy efficient one. How well the calculations made by the search algorithm represents the reality, depends on the speed and topography resolution and the vehicle energy model. With the correct settings, up to 18.4% of energy can be saved for a given topography compared to having the lowest constant speed allowed. The speed is ranging between 85-95 km/h but the method presented is capable of having any set of speed options, even if the resolution varies from point to point on the road. How to use this method and its properties is explained in detail using text and step for step figures of how the search algorithm iterates.A comparison between allowing regenerative braking and not allowing it is shown in the results. It is clear that there is most energy saving potential where no regenerative braking is allowed. / <p>Mustafa Ali Arat has stopped working at NEVS and moved abroad.</p>

Under de senaste åren har blockchain-tekniken fått mer och mer uppmärksamhet. Det har visat speciella fördelar i digital valuta, eftersom det distribueras och dess data inte kan ändras. Med fler länder som presenterar idén om kraftsysteminnovationen har ett stort antal distribuerade kraftkällor dykt upp. Nätanslutningen för dessa distribuerade kraftkällor leder till instabil nätdrift och ökar svårigheten att hantera kraftigt. Därför finns det ett akut behov av en lösning som kan realisera direkt transaktion av distribuerad kraftförsörjning. Denna artikel gör en fördjupad analys av blockchain-tekniken, inklusive hasalgoritm, konsensusmekanism, Merkle-träd, smart kontrakt etc. Och sedan studeras Ethereum och smarta nät. Den här artikeln realiserar automatisering och intelligens för mätning av eltransaktioner genom smart kontraktsteknik som tillhandahålls av Ethereum. En blockchain privat kedja skapas och sedan distribueras det smarta kontraktet i den privata kedjan. Med fördelarna med blockchaintekniken ovan kommer lagring av kraftdata och krafttransaktioner att vara mer trovärdig och mer transparent. Sammantaget designar och bygger detta papper ett smart grid-system baserat på blockchain-smarta teknik. Systemet kan inte bara användas för smarta nätsystem utan även för andra energisystem. Denna artikel ger en referens för tillämpning av blockchain-teknik. / In recent years, blockchain technology has received more and more attention. It has shown special advantages in digital currency, because it is distributed and its data cannot be altered. With more countries put forward the idea of the power system innovation, a large number of distributed power sources have emerged. The grid connection of these distributed power sources will lead to unstable grid operation and greatly increase the difficulty of management. Therefore, there is an urgent need for a solution that can realize direct transaction of distributed power supply. This article makes an in-depth analysis of the blockchain technology, including hash algorithm, consensus mechanism, Merkle tree, smart contract, etc. And then the Ethereum and smart grids are studied. This article realizes automation and intelligence of the electricity transaction measurement through the smart contract technology provided by Ethereum. A blockchain private chain is created and then the smart contract is deployed into the private chain. With the advantages of blockchain technology aforementioned, the storage of power data and the power transactions will be more credible and more transparent. All in all, this paper designs and builds a smart grid system based on the smart contract technology of blockchain. The system can be used not only for smart grid systems but also for other energy trading systems. This article provides a reference for the application of blockchain technology.

Today, inventory management at Marabou is organised in such way that articles are stored based on which production line they belong to and are sent to storage locations close to their production line. However, some storage locations are not optimised, insofar articles are stored out of pure habit and follow what is considered most convenient. This means that the storage locations are not based on any fixed instructions or standard. In this report, we propose optimal storage locations with respect to transportation cost by modelling the problem mathematically as a minimal cost matching problem, which we solve using the so-called Hungarian algorithm. To be able to implement the Hungarian algorithm, we collected data regarding the stock levels of articles in the factory throughout 2016. We adjusted the collected data by turning the articles into units of pallets. We considered three different implementations of the Hungarian algorithm. The results from the different approaches are presented together with several suggestions regarding pallet optimisation. In addition to the theoretical background, our work is based on an empirical study through participant observations as well as qualitative interviews with factory employees. In addition to our modelling work, we thus offer several further suggestions for efficiency savings or improvements at the factory, as well as for further work building on this report. / Idag är lagerhanteringen i Marabou fabriken ordnat på sådant sätt att artiklarna är lagrade utifrån vilken linje den tillhör och därmed står i ett lager nära den specifika linjen. Dock finns det lagerplatser idag som inte är optimerade, i den mån att det endast är lagrade från vana och vad som anses enklast. Därmed är lagerplatserna inte ordnade utifrån någon standard.I detta examensarbete föreslår vi därför de mest optimala lagerplatserna med hänsyn till totala transportkostnaderna. Det här problemet kan modelleras som ett matchningsproblem som kan lösas av en så kallad Ungersk algoritm. Denna ska resultera i den optimala matchningen mellan produktionslinjens behov mot lagerplatserna i fabriken med tillhörande kostnad. För att använda Ungerska algoritmen samlade vi in data av den totala mängd artiklar som fanns i fabriken för 2016, vilket togs fram genom datasystemet SAP som Marabou använder sig av. Därefter justerade vi datat genom att dela upp alla artiklarna i antalet pallar samt vilken linje den tillhör. Denna information kompletterades med empiriska undersökningar genom egna observationer samt kvalitativa intervjuer med de anställda i fabriken. I metoden använder vi tre olika implementeringar av den Ungerska algoritmen. I resultatet presenteras resultaten från de olika tillvägagångsätten tillsammans med flera palloptimeringsförslag. I slutet sammanställs flera förbättringsförslag och idéer om vidareutveckling i rapporten.

The thesis introduces a study about the different ways of generating metadata and implementing them in web pages. Metadata are often called data about data. In web pages, metadata holds the information that might include keywords, a description, author, and other information that helps the user to describe and explain an information resource in order to use, manage and retrieve data easily. Since web pages depend significantly on metadata to increase the traffic in search engines, studying the different methods of generation of metadata is an important issue. Generation of metadata can be made both manually and automatically. The aim of the research is to show the results of applying different methods including a new proposed method of generating automatic metadata using a qualitative study. The goal of the research is to show the enhancement achieved by applying the new proposed method of generating metadata automatically that are implemented in web pages. / Uppsatsen presenterar en studie om olika sätt att generera metadata och genomföra dem på webbsidor. Metadata kallas ofta data om data eller information om information som innehåller den information som hjälper användaren att beskriva, förklara och hitta en informationskälla för att kunna använda, hantera och hämta data enkelt. Eftersom webbsidor är märkbart beroende av metadata för att öka trafiken i sökmotorer, att studera olika metoder för skapandet av metadata är en viktig fråga. Skapande av metadata kan ske både manuellt och automatiskt. Syftet med forskningen är att visa resultaten av tillämpningen av olika metoder inklusive en ny föreslagen metod för att generera automatiska metadata med hjälp av en kvalitativ studie. Målet med forskningen är att visa förbättringen som uppnås genom den nya föreslagna metoden för att generera metadata automatisk som genomförs på webbsidor.

For workplaces with a preference or need for staffing around the clock, employees commonly work in shifts, which are work sessions that span different parts of the day. The scheduling of these shifts is a multi-objective optimization problem with both hard and soft constraints. The reduction in the available workforce when employees go on vacation makes the problem especially constrained. We describe a method that uses a genetic algorithm to generate shift schedules, for teams of employees and time periods with vacations. The method supports a staffing demand that can be met with one of multiple combinations of shifts. The genetic algorithm features specialized crossovers, together with a repair step aimed at maintaining staffing that fulfils the staffing requirements. A software implementation of the method is evaluated on three real-life problem instances. For two of them, it can produce schedules that are feasible, but subpar to those constructed manually by an experienced personnel scheduling professional. Several ideas to improve the program are presented.

This thesis is dealing text ranking on the internet background. There are described available methods for classification and splitting of the text reports. The part of this thesis is implementation of Bayes naive algorithm and classifier using neuron nets. Selected methods are compared considering their error rate or other ranking features.

Community detection in graphs has been an important research topic for many fields. The aim of community detection is to extract from graphs those groups of nodes that present more connections between them than with the rest of the network. Detecting such groups at different scales can help understanding the global behaviour of the system. However, recent studies have shown that realworld graphs follow power-law distributions for degree and community sizes. Specifically, these graphs present many small communities but just a few large ones. This unbalanced community size distribution poses a great challenge for community detection algorithms.Most of the existing methods are based on global approaches that require information about the network to be processed as a whole. Thus, those techniques can not be applied when the graph is too big to fit into one single machine, or in distributed setting when the graph is partitioned among multiple machines. To solve this limitations, a completely decentralized community detection algorithm is presented. It is based on diffusion, following a vertex-centric approach that allows each node to decide the diffusion rates based on local information. It adds as well a mechanism for controlling the diffusion speed through a customizable function.We evaluate the algorithm with a variety of graphs with different levels of imbalance and community structures. Our algorithm is able to detect (almost) perfectly the communities when the imbalance between community sizes is not extreme. We show as well how the sizes of the detected communities can be controlled by the diffusion strategy, allowing for better detection of finer or coarser resolutions in hierarchical graphs. The algorithm is also compared to other two well-known existing methods, achieving similar results in most of the cases though with a higher computation time. / Gemenskap detektering i grafer har varit ett viktigt forsknings ämne förmånga områden. Gemenskapsdetekterings syftet är att extrahera ur grafernade grupper av noder som har mer kopplingar mellan varandra än med restenav nätverket. Att upptäcka sådana grupper i olika skaler kan hjälpa till att förstå systemets globala beteende. Däremot har nyliga studier visat att verkliga grafers grad och gemenskap storlek följer en potenslagen fördelning. Specifikt,dessa grafer uppvisar många små gemenskaper men bara några stora. Denhär obalanserade gemenskaps storleks fördelningen utgör en stor utmaning för gemenskapsdetekterings algoritmer.De flesta av de befintliga metoderna är baserade på globala tillvägagångssätt som kräver att information om nätverket behandlas som helhet. Således kan dessa tekniker inte tillämpas när grafen är för stor för att passa in i en enda maskin, eller på distribuerat sätt när grafen är uppdelad bland flera maskiner. För att lösa dessa begränsningar, uppvisas en helt decentraliserad gemenskapsdetekterings algoritm.Denär baserad pådiffusion som följer en vertex-centrerad tillvägagångssätt.Varje node valder diffusionshastigheten baserad på lokal information. Deninnehåller även en mekanism som kontrollerar diffusionens hastighet genom en anpassningsbar funktion.Vi utvärderar algoritmen genom flera olika grafer med olika nivåer av obalans och gemenskaps strukurer. Vår algoritm kan (nästan) felfritt upptäcka gemenskaper där obalansen mellan dem inte är för stor. Vi visar även hur storlekenpå de hittade gemenskaperna kan kontrolleras genom diffusions strategin, somtillåter bättre uptäckt av finare eller grövre resolution av hierarkiska grafer. Algoritmen kan också jämföras med två befintliga, välkända metoder, vilka ger liknande resultat i de flesta fallen men tar längre tid att genomföra.

As many tasks considering structural design in civil engineering become digitalised, the possibility of creating a more effective workflow increases. The development of computer programs that can handle large amounts of data and assist the decision making during design process increases the requirement of the data management to fully utilize the potential of a digital workflow. The design of reinforcement layout of concrete structures is time demanding and often performed manually. These characteristics of a workflow indicates that it may be suitable to be subject to automation. The aim of this thesis is to highlight the potential and the difficulties of using automated design procedures in civil engineering with focus on reinforcement layout design. Specifically, the selection of straight rebars and their placement within concrete structures has been studied with respect to buildability and the amount of reinforcement used. A computer program has been developed to select rebar diameters and arrangement, satisfying the required amount of reinforcement as well as some of the rules according to the Eurocode standard. In order to find feasible solutions, an optimization of the amount of reinforcement as well as different measures of buildability is performed, using a genetic algorithm. The result from two case studies showed that the program managed to perform tasks similar to an engineer and create design solutions which reduced the amount of reinforcement and the number of rebar types. Furthermore, it was shown that consideration to the identified buildability parameters played an important role in finding an optimal solution. The findings indicate that the design of reinforcement layout may be automated and that a more effective workflow can be achieved. / I takt med att fler delar av projekteringen av anläggningskonstruktioner blir digitaliserade ökar möjligheterna för att effektivisera arbetet. Utvecklandet av datorprogram som kan hantera mycket information och ge stöd till beslutsfattande ställer också krav på hanterandet av denna data för att utnyttja den fulla potentialen av ett digitaliserat arbetsflöde. Arbetsprocessen vid armering av betongkonstruktioner är tidskrävande och utförs idag ofta helt eller delvis för hand. Sådana processer bär karaktärsdrag som tyder på att de är lämpade för automatisering. Målet med studien är att undersöka problematiken kring att automatisera arbetsprocesser vid projektering av anläggningskonstruktioner med inriktning på armering av betongkonstruktioner. Specifikt, så har valet av raka armeringsjärn och dess placering i betongkonstruktioner studerats med avseende på byggbarhet och armeringsmängder. Ett datorprogram har utvecklats för att välja armeringsjärn och dess placering för ett givet behov och ett antal krav som ställs enligt Eurokod. För att hitta en möjlig lösning är problemet formulerat som en optimering av armeringsmängd och olika mått på byggbarhet. Optimeringen genomfördes med en genetisk algoritm. Resultatet från två fallstudier visar att programmet lyckades genomföra konstruktörens arbetsuppgifter och skapa lösningar som minskade mängden använd armering och antalet olika typer av armeringsjärn samtidigt som de identifierade måtten på byggbarhet främjades. Vidare visade resultatet att de identifierade byggbarhetsparametrarna spelade en viktig roll för att finna en optimal lösning. Detta indikerar att det är möjligt att automatisera denna process och att ett effektivare arbetsflöde kan erhållas.