Siga este link para ver outros tipos de publicações sobre o tema: Automatic.
Teses / dissertações sobre o tema "Automatic"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Veja os 50 melhores trabalhos (teses / dissertações) para estudos sobre o assunto "Automatic".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Veja as teses / dissertações das mais diversas áreas científicas e compile uma bibliografia correta.
1
Svensson, Andreas. "Automatic Generation of Control Code for Flexible Automation." Thesis, Linköpings universitet, Reglerteknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-84412.
Texto completo da fonteResumo:
In order to quickly adapt the production on a production line to the demand, there is a needfor flexibility. A tool designed for this purpose, p-sop, has been developed at UniversityWest. This thesis deals with implementation of p-sop in a demonstrator, and developmentof a framework for priority policies as well as a graphical user interface to p-sop. The prioritypolicies evaluated in the demonstrator did note give an increased efficiency, and thegraphical user interface is shown to be well suited for the demonstrator and p-sop in general.
2
Danelia, David, and Allendes Nanitza Gonzalez. "Automatic Whiteboard Eraser : A systematic and automated process." Thesis, KTH, Skolan för industriell teknik och management (ITM), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-264388.
Texto completo da fonteResumo:
The whiteboard is a tool being used in several different facilities around the world. However, erasing the ink off the board can be unnecessarily time consuming and distracting. The purpose of the project was therefore to create a demonstrator to automate the process with a few restrictions. The demonstrator was required to be light enough and small enough to be handheld. In addition, the demonstrator needed to function and work properly on a magnetic surface. To conceptualize the purpose a demonstrator was built with an iterative process and thereafter programmed to get a systematic movement. It utilized continuous servo motors, IR-sensors and a 3-axis gyroscope and an accelerometer in combination with 3D-printed components. The final prototype turned out to function properly but could be improved as its erasing properties are not working as one could expect from a finished prototype.<br>Whiteboard är ett verktyg som används i flera olika fastigheter runt om i världen. Att ta bort bläcket från whiteboarden kan dock vara onödigt tidskrävande och distraherande. Syftet med projektet var därför att automatisera processen med några begränsningar. Två begränsningar var att prototypen skulle väga lite och vara tillräckligt liten för att vara handhållen. En annan begränsning var att den skulle fungera korrekt på en magnetisk yta. För att konceptualisera syftet byggdes en prototyp med en iterativ process och därefter programmerades den för att få en systematisk rörelse. Den utnyttjade kontinuerliga servomotorer, IR-sensorer och ett 3-axligt gyroskop i kombination med 3D-printade komponenter. Den slutgiltiga prototypen visade sig fungera korrekt men kan förbättras eftersom dess raderingsegenskaper inte fungerar som man kunde ha förväntat sig från en färdig prototyp.
3
Saberi, Atefeh. "Automatic outlier detection in automated water quality measurement stations." Master's thesis, Université Laval, 2015. http://hdl.handle.net/20.500.11794/25908.
Texto completo da fonteResumo:
Des stations de mesure de la qualité de l’eau sont utilisées pour mesurer la qualité de l'eau à haute fréquence. Pour une gestion efficace de ces mesures, la qualité des données doit être vérifiée. Dans une méthode univariée précédemment développée, des points aberrants et des fautes étaient détectés dans les données mesurées par ces stations en employant des modèles à lissage exponentiel pour prédire les données au moment suivant avec l’intervalle de confiance. Dans la présente étude, ne considérant que le cas univarié, la détection de points aberrants est améliorée par l’identification d’un modèle autorégressif à moyenne mobile sur une fenêtre mobile de données pour prédire la donnée au moment suivant. Les données de turbidité mesurées à l'entrée d'une station d'épuration municipale au Danemark sont utilisées comme étude de cas pour comparer la performance de l’utilisation des deux modèles. Les résultats montrent que le nouveau modèle permet de prédire la donnée au moment suivant avec plus de précision. De plus, l’inclusion du nouveau modèle dans la méthode univariée présente une performance satisfaisante pour la détection de points aberrants et des fautes dans les données de l'étude de cas.<br>Water quality monitoring stations are used to measure water quality at high frequency. For effective data management, the quality of the data must be evaluated. In a previously developed univariate method both outliers and faults were detected in the data measured by these stations by using exponential smoothing models that give one-step ahead forecasts and their confidence intervals. In the present study, the outlier detection step of the univariate method is improved by identifying an auto-regressive moving average model for a moving window of data and forecasting one-step ahead. The turbidity data measured at the inlet of a municipal treatment plant in Denmark is used as case study to compare the performance of the use of the two models. The results show that the forecasts made by the new model are more accurate. Also, inclusion of the new forecasting model in the univariate method shows satisfactory performance for detecting outliers and faults in the case study data.
4
Österlund, Erik. "Automatic memory management system for automatic parallelization." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-13693.
Texto completo da fonteResumo:
With Moore’s law coming to an end and the era of multiprocessor chips emerging, the need for ways of dealing with the essential problems with concurrency is becoming imminent. Automatic parallelization for imperative languages and pure functions in functional programming languages all try to prove independence statically. This thesis argues that independence is dynamic in nature. Static analysis for automatic parallelization has failed to do anything but trivial optimizations. This thesis shows a new approach where dynamic analysis about the system is provided for very low costs using a garbage collector that has to go through all live cells anyway. Immutable sub-graphs of objects that cannot change state are found. Their methods become pure functions that can be parallelized. The garbage collector implemented is a kind of replicating collector. It is about three times faster than Boehm’s collector in garbage collection, fully concurrent and provides the dynamic analysis almost for free.
5
Valle, Danilo Basseto do [UNESP]. "A influência do controlador gupfc no sistema elétrico de potência visando a estabilidade a pequenas perturbações." Universidade Estadual Paulista (UNESP), 2014. http://hdl.handle.net/11449/111129.
Texto completo da fonteResumo:
Made available in DSpace on 2014-12-02T11:16:56Z (GMT). No. of bitstreams: 0
Previous issue date: 2014-04-04Bitstream added on 2014-12-02T11:20:51Z : No. of bitstreams: 1
000796071.pdf: 3231946 bytes, checksum: cd5022e624fc51b6b608afccd527ebed (MD5)<br>Neste trabalho é proposto um modelo de injeção de potência para o controlador Generalized Unified Power Flow Controller (GUPFC) que permite representá-lo em programas de fluxo de potência e fluxo de potência ótimo. Também é proposto um modelo para a estrutura do sistema de controle do GUPFC que permite representar sua dinâmica em sistemas elétricos de potência. Todas as análises dinâmicas realizadas neste trabalho visam a estabilidade a pequenas perturbações, porém, o modelo de injeção de potência do GUPFC e o modelo de sua estrutura de controle permitem representálo também em um ambiente não linear. A partir das equações algébricas fornecidas pelo modelo de injeção de potência do GUPFC e das equações dinâmicas obtidas a partir da sua estrutura do sistema de controle, é possível analisar a influência que o controlador GUPFC causa no sistema, realizando-se inicialmente uma abordagem estática (em regime permanente), que foi realizada utilizando-se a ferramenta de fluxo de potência expandido. A ferramenta de fluxo de potência expandido trata as variáveis diferenciais como algébricas, para um dado ponto de equilíbrio, ficando o problema restrito a encontrar os zeros de um conjunto de funções não-lineares, cuja solução pode ser obtida através do método de Newton-Raphson, como em um fluxo de potência convencional. Com a solução desse fluxo de potência, pode-se incluir diretamente as correspondentes submatrizes do GUPFC no Modelo de Sensibilidade de Potência (MSP), já que este foi o modelo escolhido para representação de todos os componentes dinâmicos do sistema. Com todos os componentes modelados no MSP, foi realizada uma análise dinâmica do sistema, visando a estabilidade a pequenas perturbações. Para melhorar o desempenho dinâmico do sistema, foi essencial que controladores ESPs e POD fossem inclusos às malhas de controle dos Reguladores Automáticos ...<br>This thesis proposes a power injection model for the GUPFC (Generalized Power Flow Controller) which is suited for the GUPFC representation in both power flows and optimal power flows analyses. It is also proposed a model for the control system GUPFC that represents its dynamics in electric power systems. This work main aim is the small signal stability analysis. However, the power injection model of the GUPFC and the structure control model could be used in nonlinear environment. The algebraic equations provided by the power injection model of the GUPFC and the dynamical equations obtained from the control model, are used to analyze the influence of the GUPFC on the system, initially executing a static approach (in steady state) using the expanded power flow tools. The expanded power flow considers the differential variables as algebraic, at a given equilibrium point, and the problem is to find the zeros of a nonlinear function set, whose solution can be obtained by a Newton Raphson method as in a conventional power flow. From the solution of the power flow, it is possible to include directly the corresponding sub matrices of the GUPFC in to the Power Sensitive Model (PSM), which is the chosen model to represent all the dynamic components of the system. Once, every component is modeled in the PSM, a small signal stability is performed. The ESP and POD controllers are included in to the control loop of the Automatic Voltage Regulators (AVR) and the GUPFC respectively, to improve the dynamical performance of the system. To provide additional damping to the unstable or little damped modes and increase the stability limits, a Particle Swarm Optimization (PSO) technique is used to provide the parameters of the supplementary damping controller. Two objective functions are proposed to lead the problem solution to good results and then compared to well known classical techniques
6
Nunes, Hugo. "Automatic designer /." Sion, 2008. http://doc.rero.ch/record/12800?ln=fr.
Texto completo da fonte
7
Axenskär, Christian, and David Winde. "Automatic Trimmerhead." Thesis, Högskolan i Halmstad, Sektionen för ekonomi och teknik (SET), 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-17805.
Texto completo da fonteResumo:
Automatic trimmerhead is an examination project for making an automatic trimmerhead for grass trimmers with the user and functionality in focus. Our perception is that a happy user is a user who can pick up his or her trimmer, use it and put it back to its place when the job is done. It should not be necessary to interrupt work and perform maintenance on the machine just to make it work as promised. The project has been made in collaboration with the company Husqvarna, which is one of the biggest actors dealing with garden machinery on the market. Together we determined the project goal, “To invent, construct and test a brand new concept for how an automatic trimmerhead can look and function”. At this day there are several different automatic trimmerheads on the market, both semi and fully automatic. After having seen and tested many of these trimmerheads, we have come to the following conclusion. They are either difficult for users to handle or has unreliable functions, sometimes both. We have, with this kept in mind, tested and analyzed the different models to find the problem. We found one, and maybe the only, reason to why these trimmerheads does not function as promised. All the trimmerheads functions are based on the increased rotation speed that will occur when the cord breaks off. In our product we have therefore designed a mechanical solution that feed cord based on not only the force affecting the cord but also on the length of the cord. A trimmerhead with a cord feeding function which can activate based on the length of the cord does not exist on the market and is according to Husqvarna, who has much knowledge on the subject, a new and very interesting way of solving the problem. Since the beginning of the project we have had many ideas and surely we have encountered even more problems, but this is what has given us the knowledge we needed to make it to where we are today. The result of this is a brand new concept with good patent possibilities on several parts and functions which have given Husqvarna everything they need to continue the work and to turn our solution into a high quality product.
8
Rubin, Sasha. "Automatic structures." Thesis, University of Auckland, 2004. http://hdl.handle.net/2292/1262.
Texto completo da fonteResumo:
This thesis investigates structures that are presentable by finite automata working synchronously on tuples of finite words. The emphasis is on understanding the expressiveness and limitations of automata in this setting. In particular, the thesis studies the classification of classes of automatic structures, the complexity of the isomorphism problem, and the relationship between definability and recognisability.
9
Hoffmann, Michael. "Automatic semigroups." Thesis, University of Leicester, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.366330.
Texto completo da fonte
10
Ström, David, and Carl Jensen. "Compact safety system for automatic flagpole : Flow sensor anemometer." Thesis, KTH, Skolan för industriell teknik och management (ITM), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-264448.
Texto completo da fonteResumo:
Automating tasks and processes are becoming more and more common in both corporate and everyday life. The aim of this project is to assist the company Hotswap in the development of a safety system for an existing automatic flagpole. The safety system should be able to monitor wind velocity and, optionally, wind direction as well as communicate the data to the flagpole’s main control unit. The thesis describes and discusses the different possible mechanisms, solutions for measuring wind, and a possible implementation. A method for measuring wind velocity by utilizing an FS5 thermal mass flow sensor was selected and a prototype was developed for testing the performance of the implementation. The tests showed that the thermal mass flow sensor fulfilled the requirements regarding wind velocity measurement and accuracy with an average deviation of 0.19 m/s from the reference value. The solution was then discussed and compared with Hotswap’s existing prototype. The comparison showed that the prototype was a viable alternative. Finally, some suggestions for further development were presented along with the conclusion that the prototype provides a proof of concept for a fully realizable solution.<br>Automatisering av arbetsuppgifter och processer blir mer och mer vanligt både på företag och i vardagslivet. Detta projekt hade som mål att bistå företaget Hotswap med utvecklingen av ett säkerhetssystem för en befintlig automatisk flaggstång. Säkerhetssystemet ska kunna mäta vindstyrka och vindriktning och kommunicera den uppmätta datan till flaggstångens kontrollenhet. Rapporten beskriver och diskuterar de olika möjliga mekanismer och lösningar som finns för att mäta vindhastighet samt en möjlig implementering. En metod för mätning av vindhastighet där en hot-wire flödessensor valdes och en prototyp utvecklades sedan för att testa den implementerade metodens prestanda. Testen visade att användning av flödessensorn tillfredsställde de ställda kraven på prototypen gällande vindhastighetsmätning och mätprecision med en medelavvikelse på 0.19 m/s från referensvärdet. Lösningen diskuterades och jämfördes sedan med Hotswaps befintliga prototyp. Jämförelsen visade att prototypen var ett rimligt alternativ. Slutligen presenterades några förslag på vidareutveckling tillsammans med slutsatsen att prototypen är en konceptvalidering för en fullt realiserbar lösning.
11
Nayfeh, Taysir H. "Multi-signal processing for voice recognition in noisy environments." Thesis, This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-10222009-125021/.
Texto completo da fonte
12
Lindgren, Max, and Max Thiel. "Automatic Color Mixer : A method for automated color recognition and replication." Thesis, KTH, Maskinkonstruktion (Inst.), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-226684.
Texto completo da fonteResumo:
Throughout history colors have been an important way forliving organisms to signal something to their surroundings.For instance, the color of a plant’s leaves or petals havebeen the way with which the plant communicates with itssurroundings for example to attract insects to spread itsDNA, or to signal that it is poisonous. Animals have alsobeen using colors to impress the other gender or to frightenother animals in order to stay alive and spread their DNA.One could argue that colors in some cases are vital andhave played a major role in evolution. This may not be thecase today for us humans, but the importance and use ofcolor is still very significant in todays society.The purpose of this project is to construct a demonstratorthat can mix a color that it gets as input from auser. Using automation control the machine can first mix acolor and then compensate for any errors just like a humanwould do to get the right result. To be able to do this acolor sensor that reads color in RGB is used. The differentlevels are then translated to a another color model calledHSV, which is then used for mixing the final color.The performance of the system was tested by lettinga sensor scan a sample color card, calculate how much ofeach primary color to pour into the mix. The mixed paintwas then painted onto a piece of paper that was left todry before being scanned. The difference in hue was notedafter the first mix and the system continued adjusting forany deviations until a good result was achieved. The resultof the tests was that it took a maximum amount of threemixes to get within 0,8% of the reference value. In half ofthe tests the demonstrator achieved a good result after thevery first mix.<br>Färg har genom historien varit ett effektivt sätt att signaleranågot till sin omgivning. Till exempel har färger påblad hos blommor och växter fungerat som växters sätt attkommunisera med sin omgivning. Antingen för att lockatill sig insekter f¨or att sprida sitt DNA eller för att signaleragiftighet. Djur har använt sig av färger för att imponerapå det andra könet och därigenom kunna föra sittDNA vidare. Man skulle kunna argumentera för att färghar haft en viktig roll i evolutionen. För människan är deti dagsläget inte riktigt lika viktigt evolutionärt, men viktenav och användningen av färg har en stor betydelse i dagenssamhälle. Numera finns det färgaffärer som tillhandahållermaskiner som kan låta kunden själv välja precis vilken färgden vill ha och med hjälp av maskinerna blanda upp denna.Syftet med detta projekt är att konstruera en mekatroniskkonstruktion som kan ta indata i form av färgval frånen användare. Genom användandet av reglerteknik låtermaskinen först blanda färgen en första gång och sedan kompenseraför eventuella fel precis som en människa skulle. Föratt uppnå detta används en färgsensor som läser av färgensom RGB och sedan översätter detta till färgmodellen HSVsom används för att bestämma blandningens volymproportioner.För att testa systemet läts en sensor läsa av ett färgkortoch beräkna hur mycket av vardera primärfärg att hälla iblandningen. Den blandade färgen applicerades senare påett papper och läts torka innan avläsning. Skillnaden i nyansefter första beredningen noterades och systemet fortsatteatt korrigera eventuella fel tills ett bra resultat erhölls.Resultatet av alla tester var att det tog högst tre blandningarför att komma inom 0,8% från referensnyansen. Ihälften av testerna erhölls bra resultat redan efter den initiellablandningen.
13
Kwon, Hyun Sik. "Development of Automated Design Tools for Automotive Automatic Transmission Gear System." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1370019857.
Texto completo da fonte
14
Daoudi, Gabriele Yunes. "Development of a Kinetic Energy Recovery System for a Rotary Turret Machine." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/16595/.
Texto completo da fonteResumo:
The scope of the Kinetic Energy Recovering Systems is to store a certain amount
of energy during the system’s nominal operation by recovering it from the brakes
and reuse it later.
The scope of this thesis will be studied the development of such system on an automatic
machine. The field of application is known as "Green Automation", that
became popular during the last decade.
The machine analyzed is a rotary turret one that operates in the beverage automation.
Its role is to apply a particular type of cap on the cans to improve the hygiene
and the aesthetics.
The problem has been tackled by elaborating mathematical models of the physical
systems, performing different tests and data logging, applying Parameter Identification
Algorithms and finally developing the solution. It has been also performed a
brief analysis of the different available technologies to realize the system.The project
has been validated performing simulations on the models.
15
Enoiu, Eduard. "Automatic test generation for industrial control software." Doctoral thesis, Mälardalens högskola, Inbyggda system, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-33364.
Texto completo da fonteResumo:
Since the early days of software testing, automatic test generation has been suggested as a way of allowing tests to be created at a lower cost. However, industrially useful and applicable tools for automatic test generation are still scarce. As a consequence, the evidence regarding the applicability or feasibility of automatic test generation in industrial practice is limited. This is especially problematic if we consider the use of automatic test generation for industrial safety-critical control systems, such as are found in power plants, airplanes, or trains. In this thesis, we improve the current state of automatic test generation by developing a technique based on model-checking that works with IEC 61131-3 industrial control software. We show how automatic test generation for IEC 61131-3 programs, containing both functional and timing information, can be solved as a model checking problem for both code and mutation coverage criteria. The developed technique has been implemented in the CompleteTest tool. To evaluate the potential application of our technique, we present several studies where the tool is applied to industrial control software. Results show that CompleteTest is viable for use in industrial practice; it is efficient in terms of the time required to generate tests that satisfy both code and mutation coverage and scales well for most of the industrial programs considered. However, our results also show that there are still challenges associated with the use of automatic test generation. In particular, we found that while automatically generated tests, based on code coverage, can exercise the logic of the software as well as tests written manually, and can do so in a fraction of the time, they do not show better fault detection compared to manually created tests. Specifically, it seems that manually created tests are able to detect more faults of certain types (i.e, logical replacement, negation insertion and timer replacement) than automatically generated tests. To tackle this issue, we propose an approach for improving fault detection by using mutation coverage as a test criterion. We implemented this approach in the CompleteTest tool and used it to evaluate automatic test generation based on mutation testing. While the resulting tests were more effective than automatic tests generated based on code coverage, in terms of fault detection, they still were not better than manually created tests. In summary, our results highlight the need for improving the goals used by automatic test generation tools. Specifically, fault detection scores could be increased by considering some new mutation operators as well as higher-order mutations. Our thesis suggests that automatically generated test suites are significantly less costly in terms of testing time than manually created test suites. One conclusion, strongly supported by the results of this thesis, is that automatic test generation is efficient but currently not quite as effective as manual testing. This is a significant progress that needs to be further studied; we need to consider the implications and the extent to which automatic test generation can be used in the development of reliable safety-critical systems.
16
Couper, Kenney Fiona. "Automatic determination of sub-word units for automatic speech recognition." Thesis, University of Edinburgh, 2008. http://hdl.handle.net/1842/2788.
Texto completo da fonteResumo:
Current automatic speech recognition (ASR) research is focused on recognition of continuous, spontaneous speech. Spontaneous speech contains a lot of variability in the way words are pronounced, and canonical pronunciations of each word are not true to the variation that is seen in real data. Two of the components of an ASR system are acoustic models and pronunciation models. The variation within spontaneous speech must be accounted for by these components. Phones, or context-dependent phones are typically used as the base subword unit, and one acoustic model is trained for each sub-word unit. Pronunciation modelling largely takes place in a dictionary, which relates words to sequences of phones. Acoustic modelling and pronunciation modelling overlap, and the two are not clearly separable in modelling pronunciation variation. Techniques that find pronunciation variants in the data and then reflect these in the dictionary have not provided expected gains in recognition. An alternative approach to modelling pronunciations in terms of phones is to derive units automatically: using data-driven methods to determine an inventory of sub-word units, their acoustic models, and their relationship to words. This thesis presents a method for the automatic derivation of a sub-word unit inventory, whose main components are 1. automatic and simultaneous generation of a sub-word unit inventory and acoustic model set, using an ergodic hidden Markov model whose complexity is controlled using the Bayesian Information Criterion 2. automatic generation of probabilistic dictionaries using joint multigrams The prerequisites of this approach are fewer than in previous work on unit derivation; notably, the timings of word boundaries are not required here. The approach is language independent since it is entirely data-driven and no linguistic information is required. The dictionary generation method outperforms a supervised method using phonetic data. The automatically derived units and dictionary perform reasonably on a small spontaneous speech task, although not yet outperforming phones.
17
De, Nardi Renzo. "Automatic Design of Controllers for Miniature Vehicles through Automatic Modelling." Thesis, University of Essex, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.522077.
Texto completo da fonte
18
Corrado, Joseph R. "Robust fixed-structure controller synthesis." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/12945.
Texto completo da fonte
19
Quiroz, Marco Antonio. "Simulation of a microload automated storage/retrieval system." Thesis, Georgia Institute of Technology, 1986. http://hdl.handle.net/1853/24574.
Texto completo da fonte
20
Ollesson, Niklas. "Automatic Configuration of Vision Sensor." Thesis, Linköpings universitet, Datorseende, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-93415.
Texto completo da fonteResumo:
In factory automation cameras and image processing algorithms can be used to inspect objects. This can decrease the faulty objects that leave the factory and reduce manual labour needed. A vision sensor is a system where camera and image processing is delivered together, and that only needs to be configured for the application that it is to be used for. Thus no programming knowledge is needed for the customer. In this Master’s thesis a way to make the configuration of a vision sensor even easier is developed and evaluated. The idea is that the customer knows his or her product much better than he or she knows image processing. The customer could take images of positive and negative samples of the object that is to be inspected. The algorithm should then, given these images, configure the vision sensor automatically. The algorithm that is developed to solve this problem is described step by step with examples to illustrate the problems that needed to be solved. Much of the focus is on how to compare two configurations to each other, in order to find the best one. The resulting configuration from the algorithm is then evaluated with respect to types of applications, computation time and representativeness of the input images.
21
Zhang, Xiaozheng. "Automatic speechreading for improved speech recognition and speaker verification." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/13067.
Texto completo da fonte
22
Philipose, Matthai. "Automatic staged compilation /." Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/6891.
Texto completo da fonte
23
Almqvist, Håkan. "Automatic bucket fill." Thesis, Linköping University, Department of Electrical Engineering, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-51490.
Texto completo da fonteResumo:
<p>This report contains the first step towards a complete, fully autonomous, robust bucket fill regulator for a wheel loader working with gravel materials.</p><p>The bucket fill procedure is the most critical part of the work cycle of a wheel loader. It is a task that has a long learning curve and also is weary, even for experienced drivers. The automation of it could therefore have a big impact on the cost effectiveness for wheel loaders and for the comfort of the drivers.</p><p>In this report, a suggestion for the complete solution of an automatic bucket fill regulator is presented. A regulator prototype is also constructed with a Volvo L120F as the base. The scope for the prototype is limited to one type of gravel material and quite optimal conditions for the wheel loader, but the complete solution is kept in mind throughout the synthesis. The constructed regulator is prepared for expansion, but the implementation and field testing is limited to the scope.</p>
24
Gunning, Christoffer, and Daniel Forslund. "Automatic Twitter ResponseGenerator." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-134835.
Texto completo da fonteResumo:
Since the beginning of chatbots, the most common techniques used for simulating conversation has been different pattern matching-techniques. This is a study of possible alternative methods and an attempt of implementation. As the research of natural language processing is rapidly progressing, the aim of this report is to clarify current techniques and what could possibly be achieved by adapting recent findings on the area. A combination of part-of-speech tagging, methods for information retrieval and known methods for generating language are covered and described of how it could be of use. An implementation is reviewed and compared to traditional programs. The final conclusion states that the implementation is not as satisfying as chatbots using elaborated pattern matching-techniques. However, it is concluded that the new methods covered are more likely to be part of future chatbots considering the progress of natural language processing.
25
Forsman, Isabelle. "Automatic LOD selection." Thesis, Linköpings universitet, Medie- och Informationsteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-142888.
Texto completo da fonteResumo:
In this paper a method to automatically generate transition distances for LOD, improving image stability and performance is presented. Three different methods were tested all measuring the change between two level of details using the spatial frequency. The methods were implemented as an optional pre-processing step in order to determine the transition distances from multiple view directions. During run-time both view direction based selection and the furthest distance for each direction was tested in order to measure the performance and image stability. The work was implemented in the Frostbite game engine and tested using data from DICE. The result is a method that generates transition distances by calculating the spatial frequency of the exclusive or comparison between the silhouette of a ground truth mesh and each level of detail. The transition distances generated using the automatic LOD selection tool was evaluated using visual empirical tests and performance measurements comparing the performance of a scene using automatic generated distances and manually selected distances. The tests shows that the resulting method produces good transition distances for meshes where the reduction is visible in the mesh silhouette. The values might need a bit of tweaking in order to account for other image artifacts than silhouette changes but provide a good guidance to the artists.
26
Zogheib, Ali. "Automatic language translation /." Göteborg : IT-universitetet, Chalmers tekniska högskola och Göteborgs universitet, 2007. http://www.ituniv.se/w/index.php?option=com_itu_thesis&Itemid=319.
Texto completo da fonte
27
Larsson, Agnes. "Automatic Mesh Repair." Thesis, Linköpings universitet, Informationskodning, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-98734.
Texto completo da fonteResumo:
To handle broken 3D models can be a very time consuming problem. Several methods aiming for automatic mesh repair have been presented in the recent years. This thesis gives an extensive evaluation of automatic mesh repair algorithms, presents a mesh repair pipeline and describes an implemented automatic mesh repair algorithm. The presented pipeline for automatic mesh repair includes three main steps: octree generation, surface reconstruction and ray casting. Ray casting is for removal of hidden objects. The pipeline also includes a pre processing step for removal of intersecting triangles and a post processing step for error detection. The implemented algorithm presented in this thesis is a volumetric method for mesh repair. It generates an octree in which data from the input model is saved. Before creation of the output, the octree data will be patched to remove inconsistencies. The surface reconstruction is done with a method called Manifold Dual Contouring. First new vertices are created from the information saved in the octree. Then there is a possibility to cluster vertices together for decimation of the output. Thanks to a special Manifold criterion, the output is guaranteedto be manifold. Furthermore the output will have sharp and clear edges and corners thanks to the use of Singular Value Decomposition during determination of the positions of the new vertices.
28
Ke, Shih Wen. "Automatic email classification." Thesis, University of Sunderland, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.488788.
Texto completo da fonte
29
Ha, Hai Nam. "Automatic lighting design." Thesis, University of Newcastle Upon Tyne, 2008. http://hdl.handle.net/10443/103.
Texto completo da fonteResumo:
A significant problem in the automatic design of 3D graphics is the configuration of the lighting for a scene. The number of lights included, and the properties of these lights, has an enormous impact on what a viewer can judge about the content (the objects), properties (the geometric characteristics and spatial relations of the objects) and other aesthetic qualities of a scene. The traditional approach to lighting design for image synthesis is based on manual design methods, whereby users interactively specify values of lighting parameters, render the scene, and modify the lighting parameters until the desired visual properties of the scene are achieved. Non-expert users encounter a number of difficulties in selecting the appropriate lighting parameters, as the process requires both a subtle technical and aesthetic understanding of lighting in computer graphics. In this thesis, perceptual aspects such as contrast and the non-linear characteristics of our perceptual response to colour are combined with practical studio lighting techniques and a novel treatment of shadows, to yield an extension to existing perceptual approaches to lighting design. This so-called ideal lighting approach optimises the lighting configuration for a scene with respect to a set of absolute perceptual metrics. An intuitive approach to lighting design, lighting-by-example, is also proposed and extensively explored in forms that exploit both the perception-based lighting framework and a new wavelet formulation. User studies are conducted both to configure the perception-based lighting objective function and to evaluate the performance of the proposed lighting design approaches. Finally, we develop an interactive interface for the lighting design process that incorporates both the ideal lighting and lighting-by-example approaches.
30
Roberts, Paul J. "Automatic product classification." Thesis, University of Reading, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.542272.
Texto completo da fonte
31
Petheram, R. J. "Automatic pattern recognition." Thesis, University of Nottingham, 1989. http://eprints.nottingham.ac.uk/28974/.
Texto completo da fonteResumo:
In this thesis the author presents a new method for the location, extraction and normalisation of discrete objects found in digital images. The extraction is by means of sub-pixcel contour following around the object. The normalisation obtains and removes the information concerning size, orientation and location of the object within an image. Analyses of the results are carried out to determine the confidence in recognition of patterns, and methods of cross correlation of object descriptions using Fourier transforms are demonstrated.
32
Redfern, Ian Douglas. "Automatic coset systems." Thesis, University of Warwick, 1993. http://wrap.warwick.ac.uk/56939/.
Texto completo da fonteResumo:
This thesis describes the theory of automatic coset systems. These provide a simple and economical way of describing a system of co- sets in a group with respect to a subgroup, such as the cosets of the stabiliser of an object under a group of transformations. An automatic coset system possesses a finite state automaton that provides a name for each coset, and a set of finite state automata that allow these cosets to be multiplied by group generators. An algorithm is given that will produce a certain type of automatic coset system, should one exist, from a description of the group and subgroup. The type of system produced has the advantage that it names each coset uniquely using as short a name as possible. This makes it particularly useful for coset enumeration, and several ex- amples of its use are given in an appendix. Two theorems are also proved: the property of being an automatic coset system is independent of the generating set chosen, and quasiconvex subgroups of hyperbolic groups have automatic coset sys- tems.
33
McGleenan, Conall Anthony. "Automatic multiblock generation." Thesis, Queen's University Belfast, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.326369.
Texto completo da fonte
34
Mahmood, A. "Automatic drawing recognition." Thesis, University of Nottingham, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.381072.
Texto completo da fonte
35
Reid, G. T. "Automatic moire topography." Thesis, University of Strathclyde, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.314722.
Texto completo da fonte
36
Ahmed, Alaa Eldin Abdel-Rehim. "Automatic blind deconvolution." Thesis, Cranfield University, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359511.
Texto completo da fonte
37
Long, Fan Ph D. Massachusetts Institute of Technology. "Automatic input rectification." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/75663.
Texto completo da fonteResumo:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 51-55).<br>We present a novel technique, automatic input rectification, and a prototype implementation, SOAP. SOAP learns a set of constraints characterizing typical inputs that an application is highly likely to process correctly. When given an atypical input that does not satisfy these constraints, SOAP automatically rectifies the input (i.e., changes the input so that it satisfies the learned constraints). The goal is to automatically convert potentially dangerous inputs into typical inputs that the program is highly likely to process correctly. Our experimental results show that, for a set of benchmark applications (Google Picasa, ImageMagick, VLC, Swfdec, and Dillo), this approach effectively converts malicious inputs (which successfully exploit vulnerabilities in the application) into benign inputs that the application processes correctly. Moreover, a manual code analysis shows that, if an input does satisfy the learned constraints, it is incapable of exploiting these vulnerabilities. We also present the results of a user study designed to evaluate the subjective perceptual quality of outputs from benign but atypical inputs that have been automatically rectified by SOAP to conform to the learned constraints. Specifically, we obtained benign inputs that violate learned constraints, used our input rectifier to obtain rectified inputs, then paid Amazon Mechanical Turk users to provide their subjective qualitative perception of the difference between the outputs from the original and rectified inputs. The results indicate that rectification can often preserve much, and in many cases all, of the desirable data in the original input.<br>by Fan Long.<br>S.M.
38
Kathiresan, Thayabaran. "Automatic Melody Generation." Thesis, KTH, Signalbehandling, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-175990.
Texto completo da fonte
39
Salamin, Hugues Eric. "Automatic role recognition." Thesis, University of Glasgow, 2013. http://theses.gla.ac.uk/4367/.
Texto completo da fonteResumo:
The computing community is making significant efforts towards the development of automatic approaches for the analysis of social interactions. The way people interact depends on the context, but there is one aspect that all social interactions seem to have in common: humans behave according to roles. Therefore, recognizing the roles of participants is an essential step towards understanding social interactions and the construction of socially aware computer. This thesis addresses the problem of automatically recognizing roles of participants in multi-party recordings. The objective is to assign to each participant a role. All the proposed approaches use a similar strategy. They all start by segmenting the audio into turns. Those turns are used as basic analysis units. The next step is to extract features accounting for the organization of turns. The more sophisticated approaches extend the features extracted with features from either the prosody or the semantic. Finally, the mapping of people or turns to roles is done using statistical models. The goal of this thesis is to gain a better understanding of role recognition and we will investigate three aspects that can influence the performance of the system: We investigate the impact of modelling the dependency between the roles. We investigate the contribution of different modalities for the effectiveness of role recognition approach. We investigate the effectiveness of the approach for different scenarios. Three models are proposed and tested on three different corpora totalizing more than 90 hours of audio. The first contribution of this thesis is to investigate the combination of turn-taking features and semantic information for role recognition, improving the accuracy of role recognition from a baseline of 46.4% to 67.9% on the AMI meeting corpus. The second contribution is to use features extracted from the prosody to assign roles. The performance of this model is 89.7% on broadcast news and 87.0% on talk-shows. Finally, the third contribution is the development of a model robust to change in the social setting. This model achieved an accuracy of 86.7% on a database composed of a mixture of broadcast news and talk-shows.
40
Zhou, Fei, Hantao Cai, and Ruoyu Zhang. "Automatic Billiards Table." Thesis, Blekinge Tekniska Högskola, Institutionen för maskinteknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2100.
Texto completo da fonteResumo:
With the development of the society, people are more willing to focus on their leisure activities. A growing number of new equipment are created nowadays. For example, automatic mahjong machine in China. Inspired by the automatic mahjong machine, we propose to add some devices on the billiard table to achieve sorting balls automatically. It includes recognition system, ball-separating system, and sorting system. We use Autodesk Inventor 2012 to model the billiards table. Some complex calculations and nonlinear analysis are completed by Matlab. Through our method, we can achieve the purpose of sorting balls automatically.<br>Med utvecklingen av samhället, människor är mer villiga att fokusera på sina fritidsaktiviteter. Ett växande antal av ny utrustning skapas nuförtiden. Till exempel, automatisk mahjong maskin i Kina. Inspirerad av den automatiska mahjong maskin, föreslår vi att lägga till några enheter på biljardbordet för att uppnå sorterings bollar automatiskt. Den innehåller igenkänningssystem, boll-separerar systemet, och sorteringssystem. Vi använder Autodesk Inventor 2012 för att modellera tabellen biljard. Vissa komplexa beräkningar och olinjär analys är klara med Matlab. Genom vår metod kan vi uppnå syftet att sortera bollar automatiskt.
41
Almeida, Hugo Ricardo da Costa. "Automatic cymbal classification." Master's thesis, Faculdade de Ciências e Tecnologia, 2010. http://hdl.handle.net/10362/4923.
Texto completo da fonteResumo:
Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de
Lisboa para a obtenção do grau de Mestre em Engenharia Informática<br>Most of the research on automatic music transcription is focused on the transcription of pitched instruments, like the guitar and the piano. Little attention has been given to unpitched instruments, such as the drum kit, which is a collection of unpitched instruments. Yet, over the last few years this type of instrument started to garner more attention, perhaps due to increasing popularity of the drum kit in the western music.
There has been work on automatic music transcription of the drum kit, especially the snare drum, bass drum, and hi-hat. Still, much work has to be done in order to achieve automatic music transcription of all unpitched instruments. An example of a type of unpitched instrument that has very particular acoustic characteristics and that has deserved almost no attention by the research community is the drum kit cymbals.
A drum kit contains several cymbals and usually these are treated as a single instrument or are totally disregarded by automatic music classificators of unpitched instruments. We propose to fill this gap and as such, the goal of this dissertation is automatic music classification of drum kit cymbal events, and the identification of which class of cymbals they belong to.
As stated, the majority of work developed on this area is mostly done with very different percussive instruments, like the snare drum, bass drum, and hi-hat. On the other hand, cymbals are very similar between them. Their geometry, type of alloys, spectral and sound traits shows us just that. Thus, the great achievement of this work is not only being able to correctly classify the different cymbals, but to be able to identify such similar instruments, which makes this task even harder.
42
Hamilton, Philip, and Rasmus Holmskov. "Automatic Wire Cutter." Thesis, KTH, Skolan för industriell teknik och management (ITM), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-264517.
Texto completo da fonteResumo:
This bachelor thesis project in mechatronics involved making a working prototype of an automatic wire cutter and evaluating its accuracy. The accuracy of the machine was increased by analysing measurements of the machine’s initial precision and thereafter performing a calibration to diminish the eect of unwanted errors. Before calibration the machine’s accuracy was ± 0.73 cm and after calibration it was calculated to be ± 0.06 cm in its intended operating range of 5-20 cm. The main limitations of the machine’s accuracy were determined to be slippage in the feeding mechanism, the mathematical model that was used, the step resolution of the stepper motors, the oset between the blades in the cutting mechanism as well as the wires bending when being fed.<br>I detta kandidatexamnesarbete inom mekatronik designades och tillverkades en fungerande prototyp av en automatisk kabelklippare, och dess noggrannhet undersöktes sedan. Maskinens noggrannhet förbättrades genom att först undersöka maskinens ursprungliga noggrannhet och därefter kalibrerades maskinen för att minska effekten av oönskade fel. Före kalibrering var maskinens noggrannhet ± 0,73 cm och efteråt räknades den ut att vara ± 0,06 cm i dess tilltänkta driftintervall på 5-20 cm. De huvudsakliga begränsningarna för maskinens noggrannhet visade sig vara glidning i matningsmekanismen, den matematiska modellen, stegmotorns stegupplösning, avståndet mellan bladen i klippmekanismen samt att kablarna böjer sig under frammatning.
43
Carey, Rachael Marie. "Graph automatic semigroups." Thesis, University of St Andrews, 2016. http://hdl.handle.net/10023/8645.
Texto completo da fonteResumo:
In this thesis we examine properties and constructions of graph automatic semigroups, a generalisation of both automatic semigroups and finitely generated FA-presentable semigroups. We consider the properties of graph automatic semigroups, showing that they are independent of the choice of generating set, have decidable word problem, and that if we have a graph automatic structure for a semigroup then we can find one with uniqueness. Semigroup constructions and their effect on graph automaticity are considered. We show that finitely generated direct products, free products, finitely generated Rees matrix semigroup constructions, zero unions, and ordinal sums all preserve unary graph automaticity, and examine when the converse also holds. We also demonstrate situations where semidirect products, Bruck-Reilly extensions, and semilattice constructions preserve graph automaticity, and consider the conditions we may impose on such constructions in order to ensure that graph automaticity is preserved. Unary graph automatic semigroups, that is semigroups which have graph automatic structures over a single letter alphabet, are also examined. We consider the form of an automaton recognising multiplication by generators in such a semigroup, and use this to demonstrate various properties of unary graph automatic semigroups. We show that infinite periodic semigroups are not unary graph automatic, and show that we may always find a uniform set of normal forms for a unary graph automatic semigroup. We also determine some necessary conditions for a semigroup to be unary graph automatic, and use this to provide examples of semigroups which are not unary graph automatic. Finally we consider semigroup constructions for unary graph automatic semigroups. We show that the free product of two semigroups is unary graph automatic if and only if both semigroups are trivial; that direct products do not always preserve unary graph automaticity; and that Bruck-Reilly extensions are never unary graph automatic.
44
Garg, Ajay. "Automatic mesh generation /." Online version of thesis, 1990. http://hdl.handle.net/1850/11022.
Texto completo da fonte
45
Frye, Lisa M. "Automatic program generation." Instructions for remote access. Click here to access this electronic resource. Access available to Kutztown University faculty, staff, and students only, 1993. http://www.kutztown.edu/library/services/remote_access.asp.
Texto completo da fonteResumo:
Thesis (M.S.)--Kutztown University of Pennsylvania, 1993.<br>Source: Masters Abstracts International, Volume: 45-06, page: 3185. Abstract precedes thesis title page as [2] preliminary leaves. Typescript. Includes bibliographical references (leaves 90-94).
46
Searle, Aaron James. "Automatic relative debugging." Thesis, Queensland University of Technology, 2006. https://eprints.qut.edu.au/16445/1/Aaron_Searle_Thesis.pdf.
Texto completo da fonteResumo:
Relative Debugging is a paradigm that assists users to locate errors in programs that have been corrected or enhanced. In particular, the contents of key data structures in the development version are compared with the contents of the corresponding data structures, in an existing version, as the two programs execute. If the values of two corresponding data structures differ at points where they should not, an error may exist and the user is notified.
Relative Debugging requires users to identify the corresponding data structures within the two programs, and the locations at which the comparisons should be performed.
To quickly and effectively identify useful data structures and comparison points requires that users have a detailed knowledge of the two programs under consideration. Without a detailed knowledge of the two programs, the task of locating useful data structures and comparison points can quickly become a difficult and time consuming process. Prior to the research detailed in this thesis, the Relative Debugging paradigm did not provide any assistance that allowed users to quickly and effectively identify suitable data structures and program points that will help discover the source of an error.
Our research efforts have been directed at enhancing the Relative Debugging paradigm. The outcome of this research is the discovery of techniques that empower
Relative Debugging users to become more productive and allow the Relative Debugging paradigm to be significantly enhanced. Specifically, the research has resulted in the following three contributions:
1. A Systematic Approach to Relative Debugging.
2. Data Flow Browsing for Relative Debugging.
3. Automatic Relative Debugging.
These contributions have enhanced the Relative Debugging paradigm and allow errors to be localized with little human interaction. Minimizing the user's involvement reduces the cost of debugging programs that have been corrected or enhanced, and has a significant impact on current debugging practices.
47
Searle, Aaron James. "Automatic relative debugging." Queensland University of Technology, 2006. http://eprints.qut.edu.au/16445/.
Texto completo da fonteResumo:
Relative Debugging is a paradigm that assists users to locate errors in programs that have been corrected or enhanced. In particular, the contents of key data structures in the development version are compared with the contents of the corresponding data structures, in an existing version, as the two programs execute. If the values of two corresponding data structures differ at points where they should not, an error may exist and the user is notified. Relative Debugging requires users to identify the corresponding data structures within the two programs, and the locations at which the comparisons should be performed. To quickly and effectively identify useful data structures and comparison points requires that users have a detailed knowledge of the two programs under consideration. Without a detailed knowledge of the two programs, the task of locating useful data structures and comparison points can quickly become a difficult and time consuming process. Prior to the research detailed in this thesis, the Relative Debugging paradigm did not provide any assistance that allowed users to quickly and effectively identify suitable data structures and program points that will help discover the source of an error. Our research efforts have been directed at enhancing the Relative Debugging paradigm. The outcome of this research is the discovery of techniques that empower Relative Debugging users to become more productive and allow the Relative Debugging paradigm to be significantly enhanced. Specifically, the research has resulted in the following three contributions: 1. A Systematic Approach to Relative Debugging. 2. Data Flow Browsing for Relative Debugging. 3. Automatic Relative Debugging. These contributions have enhanced the Relative Debugging paradigm and allow errors to be localized with little human interaction. Minimizing the user's involvement reduces the cost of debugging programs that have been corrected or enhanced, and has a significant impact on current debugging practices.
48
Öun, Martin. "Automatic Transmission Power Flow Matrix Representation." Thesis, KTH, Maskinkonstruktion (Inst.), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-157471.
Texto completo da fonteResumo:
The project has worked with the function and structure of epicyclical automatic transmissions. The goal of the project has been to find a mathematical way of representing the transmissions setup and possible power flows. Furthermore the project has included the generation of all theoretically possible matrix representations of two simple planetary gear sets in MATLAB as the base for a future optimization model. The result of the project is a large quantity of matrix representations of the two planetary gear sets and their connections and shafts. The result from the MATLAB program has been verified by comparing the structure and the number of solutions to all manually derived setups. The result from the program can be considered to be complete for two planetary gears but to extend the analysis to more complex planetary gears and gearboxes with more than two sets, another method is suggested. The generation process in this project has been rather complex and time consuming. The conclusions drawn from this project is that it is possible to represent many epicyclical automatic transmissions in matrix form. An optimization program based on this type of matrix would simplify the design of new, more complex and more efficient epicyclical transmissions leading to more efficient vehicles. Key words: automatic transmission, planetary gear, matrix representation<br>Projektet har behandlat epicykliska automatväxellådor och dess uppbyggnad och funktion. Idén med projektet har varit att ta fram ett sätt för att på ett matematiskt sätt representera växellådans struktur och dess möjliga effektflöden. Utöver detta har arbetet inneburit att alla teoretiskt möjliga matrisrepresentationer för två enkla sammankopplade planetväxlar har tagits fram i MATLAB som underlag för en framtida optimeringsmodell. Resultatet av arbetet är en stor mängd uppställningar av dessa två planetväxlar och dessas sammankopplingar. Resultatet från MATLAB har jämförts och verifierats genom manuell beräkning av antalet variationer och dessas utseende. Resultatet från programmet kan anses som komplett men för en utökad analys av epicykliska automatväxellådor med fler än två planetväxlar och andra typer än den enklaste formen av planetväxel, rekommenderas en annan typ av framställning av alla möjliga variationer. Den metoden för att generera sammankopplingar som har använts i detta projekt är för komplex och tidskrävande. Slutsatsen av projektet är att det finns möjlighet att generera och representera många epicykliska automatväxellådor på matrisform. Ett optimeringsprogram baserat på denna typ av matris kan förenkla utvecklingen av nya mer avancerade och mer effektiva epicykliska automatväxelådor vilket leder till mer effektiva fordon. Nyckelord: automatisk växellåda, planetväxel, matrisrepresentation
49
Haritos, Georgios. "Automatic semi/automatic generation of software to control flexible manufacturing cells." Thesis, Staffordshire University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.308911.
Texto completo da fonte
50
Armstrong, Claire Louise. "Automatic vs. non-automatic cognitive biases in social and dependent drinkers." Thesis, Queen's University Belfast, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.343281.
Texto completo da fonte