L’objectif de cette thèse est d’étudier la fonction argumentale afin d’élaborer une méthode pour l’acquisition automatique des termes d’une manière pertinente et efficace. Nous avons d’abord discuté du profilage du corpus et de la constitution du corpus web pour le traitement automatique des langues. Ensuite, trois méthodes ont été développées en nous fondant sur les caractéristiques morphologiques des unités lexicales et la relation d’appropriation entre les prédicats appropriés et leurs arguments. La méthode distributionnelle a pour objet d’exploiter les structures prédicat-argument pour repérer les arguments de la classe sémantique donnée. La méthode morphosémantique est développée en se fondant sur les structures internes des unités lexicales en vue d’étendre la liste de termes. La méthode combinatoire qui associe les deux premières approches permet d’améliorer la pertinence du résultat. Finalement, nous avons développé une réflexion sur la particularité de la langue, la classe sémantique, la langue de spécialité et la récursivité de la langue dans la perspective du traitement automatique des langues. / This thesis aims to study the argumental function for finding an efficient method to automatically acquire the terms. We start with a discussion on the problematic of the corpus which is: what kind of corpus should we choose and how should we construct the web corpus. Then, three methods are developed which are based on the morphological characteristics of lexical units and the relation between the appropriate predicates and their arguments. The distributional method tries to exploit the predicate-argument structures for identifying the arguments of the given semantic class. The morph-semantic method is developed on the basis of the morphological characteristics of the lexical units in order to extend the list of terms. The mixed method which combines the two precedent approaches permit to improve the result. Finally, we try to develop a statement on the natural language character, on the semantic class, on the specialized language and on the recursive nature of language in the perspective of natural language processing.

In response to the development of a next-generation networking (NGN) generalized multi-protocol label switching (GMPLS) technology is required for automatically switched optical network (ASON). Reconfigurable optical add-drop multiplexer (ROADM) is an indispensable device for the ASON, and the dense wavelength division multiplexed (DWDM) signals can be transmitted through the network under the management of the network administrator to configure dynamic customer needs and the desired quality of service (QoS). The ROADM can also increase the efficiency of utilizing the existing capacity of the optical fiber lines and can reduce or waive to set up additional optical fiber lines. This thesis studies a novel ROADM based on the arrayed waveguide grating (AWG) and the fiber Bragg grating (FBG) to overcome that the current ROADM cannot process that the input signal channels is greater than the wavelengths channels of AWG. Many types of ROADMs have been proposed and realized through different optical devices. Among these, hybrid optical circulator and FBG based ROADM is more attractive because of its low crosstalk and polarization insensitivity. However, it still suffers from many component counts and high insertion losses due to the use of many circulators and a multiplexer-demultiplexer pair. In this master thesis, we focus on demonstrating a novel ROADM and evaluating its crosstalk performance. It is found that the proposed ROADM has the advantage on extending the number of wavelength signal to make the system configurable and flexible.

Thesis (MScEng (Electrical and Electronic Engineering))--University of Stellenbosch, 2011. / ENGLISH ABSTRACT: This thesis presents a system that is designed to replace the manual process of generating a pronunciation dictionary for use in automatic speech recognition. The proposed system has several stages. The first stage segments the audio into what will be known as the subword units, using a frequency domain method. In the second stage, dynamic time warping is used to determine the similarity between the segments of each possible pair of these acoustic segments. These similarities are used to cluster similar acoustic segments into acoustic clusters. The final stage derives a pronunciation dictionary from the orthography of the training data and corresponding sequence of acoustic clusters. This process begins with an initial mapping between words and their sequence of clusters, established by Viterbi alignment with the orthographic transcription. The dictionary is refined iteratively by pruning redundant mappings, hidden Markov model estimation and Viterbi re-alignment in each iteration. This approach is evaluated experimentally by applying it to two subsets of the TIMIT corpus. It is found that, when test words are repeated often in the training material, the approach leads to a system whose accuracy is almost as good as one trained using the phonetic transcriptions. When test words are not repeated often in the training set, the proposed approach leads to better results than those achieved using the phonetic transcriptions, although the recognition is poor overall in this case. / AFRIKAANSE OPSOMMING: Die doelwit van die tesis is om ’n stelsel te beskryf wat ontwerp is om die handgedrewe proses in die samestelling van ’n woordeboek, vir die gebruik in outomatiese spraakherkenningsstelsels, te vervang. Die voorgestelde stelsel bestaan uit ’n aantal stappe. Die eerste stap is die segmentering van die oudio in sogenaamde sub-woord eenhede deur gebruik te maak van ’n frekwensie gebied tegniek. Met die tweede stap word die dinamiese tydverplasingsalgoritme ingespan om die ooreenkoms tussen die segmente van elkeen van die moontlike pare van die akoestiese segmente bepaal. Die ooreenkomste word dan gebruik om die akoestiese segmente te groepeer in akoestiese groepe. Die laaste stap stel die woordeboek saam deur gebruik te maak van die ortografiese transkripsie van afrigtingsdata en die ooreenstemmende reeks akoestiese groepe. Die finale stap begin met ’n aanvanklike afbeelding vanaf woorde tot hul reeks groep identifiseerders, bewerkstellig deur Viterbi belyning en die ortografiese transkripsie. Die woordeboek word iteratief verfyn deur oortollige afbeeldings te snoei, verskuilde Markov modelle af te rig en deur Viterbi belyning te gebruik in elke iterasie. Die benadering is getoets deur dit eksperimenteel te evalueer op twee subversamelings data vanuit die TIMIT korpus. Daar is bevind dat, wanneer woorde herhaal word in die afrigtingsdata, die stelsel se benadering die akkuraatheid ewenaar van ’n stelsel wat met die fonetiese transkripsie afgerig is. As die woorde nie herhaal word in die afrigtingsdata nie, is die akkuraatheid van die stelsel se benadering beter as wanneer die stelsel afgerig word met die fonetiese transkripsie, alhoewel die akkuraatheid in die algemeen swak is.

Orientador: Edson Moschim / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-06T19:40:07Z (GMT). No. of bitstreams: 1 Dante_ReinaldoGolmia_D.pdf: 5560458 bytes, checksum: a0ff22b15404f7232c1e6c38c9668fdc (MD5) Previous issue date: 2006 / Resumo: Neste trabalho, apresentam-se algumas contribuições para o estudo de redes ópticas inteligentes e transparentes, por exemplo: Redes Ópticas Comutáveis Automaticamente (ASON), no que tange aos protocolos de roteamento e atribuição de comprimentos de onda para o estabelecimento de conexões fim-a-fim em ambientes distribuídos. Os resultados deste trabalho foram obtidos através da simulação dos algoritmos de roteamento e atribuição de comprimentos de onda desenvolvidos em C++. Para que o estudo pudesse ser feito, foram adotadas algumas topologias de rede comerciais e hipotéticas para a comparação de desempenho entre os algoritmos de roteamento e atribuição de comprimentos de onda propostos e os clássicos de modo a identificar as diferenças de comportamento destes algoritmos nas redes ópticas em diversas situações, incluindo as condições de restrição de alcance dos canais ópticos e a continuidade do comprimento de onda no estabelecimento de uma conexão fim-a-fim. Os resultados mostraram que os algoritmos de roteamento e de atribuição de comprimentos de onda propostos são eficientes para o funcionamento destas redes, provendo desempenhos iguais ou superiores em relação aos demais algoritmos de roteamento e atribuição de comprimentos de onda tradicionais medidos em termos da probabilidade de bloqueio dos pedidos de conexão. Como conseqüência, estes algoritmos propostos demonstraram que são capazes de aperfeiçoar o QoS óptico nas redes ópticas inteligentes e transparentes / Abstract: In this work, we present contributions to the routing and wavelength assignment protocols in transparent and intelligent optical networks such as Automatically Switched Optical Networks (ASON) for end-to-end connection establishment on the distributed environments. The results of this work were obtained through simulation of the routing and wavelengh assignment algorithms which were developed in C++. For this study, some commercially and hypothetical network topologies were adopted to compare the performance of the proposed routing and wavelengh assignment algorithms with traditional ones in order to identify the differences of those algorithm performance. Studies were carried out in optical networks under several conditions such as the limit of optical transmission reach and wavelength-continuity constraints for end-to-end connection establishment. The results have shown that the proposed routing and wavelengh assignment algorithms are efficient for use in these networks, providing equal or higher performance than traditional routing and wavelengh assignment algorithms measured in terms of blocking probability of the connection requests. Consequently, the proposed algorithms showed that they are able to improve the optical QoS in transparent and intelligent optical networks / Doutorado / Telecomunicações e Telemática / Doutor em Engenharia Elétrica

Este trabalho tem por objetivo atualizar um Sistema Flexível de Manufatura, (SFM) didático, que devido às suas características construtivas apresentava inúmeras dificuldades de operação e manutenção, necessitando sempre de mão de obra altamente especializada. As dificuldades com a manutenção tornavam o SFM totalmente inoperante para a utilização nas aulas de uma das unidades da escola SENAI, o que prejudicava as atividades práticas, em laboratório, das disciplinas do curso técnico da área de produção. O projeto deste trabalho consistiu em uma reengenharia completa da parte elétrica de um Veículo Guiado Automaticamente (AGV) como também no desenvolvimento de um sistema supervisório, que comanda a comunicação entre os CNCs, AGV e computadores. Após as modificações efetuadas, os alunos das disciplinas da área de produção poderão interagir com o sistema, modificando a logística de produção conforme as necessidades didáticas a serem estudadas. Por outro lado os alunos de automação, por meio do acesso à documentação e à estrutura do sistema de manufatura, poderão desenvolver estudos e possíveis modificações, uma vez que o sistema se tornou mais didático e amigável. / This paper aims to update a didactic Flexible Manufacturing System (FMS) that due to their construction had numerous difficulties in operation and maintenance, and so constantly require manpower to operate and maintain highly specialized. The difficulties with maintaining the SFM became totally irrelevant, for use in the classroom of an unit school SENAI, would hinder the practical activities in the disciplines of laboratory technician course from the production area. The design of this work consisted in re-engineering of the complete electrical part of an Automatically Guided Vehicle (AGV) and development of a supervisory system and communication between the CNCs, AGV and computers. After the modifications to the students of the disciplines of production may interact with the system by modifying the production logistics as required didactic to be studied. Furthermore students automation through access to documentation and structure of the manufacturing system can develop studies and possible changes, since the system became more didactic and friendly.

This diploma thesis deals with design of retractable landing gear for Rapid 600 aircraft. The main purpose of this thesis is to analyze different retraction options for front and main landing gear and resulting selection of suitable variants. The thesis is consequently concerned with design of selected options including proposal of automatic landing gear control system and specifying the features and characteristics of this system. In the thesis there is also included the analysis of critical flight conditions which could be detected by this system.

To create, update, or deploy a mobile application, a collection of hand-operated works must be satisfied. In this project, regardless of the mobile application's code and its core functionalities, which can be an e-book, an application, or even a mobile game, we will study how to automate, visualize and simplify the following manual procedures: 1.Create a remote Git repository for the mobile application. 2.Constructing or altering the mobile application's configuration or graphical contents. 3.Push all changes to the remote Git repository. 4.Deploy or distribute the mobile application from its Git repository after each push. / För att skapa, uppdatera eller distribuera en mobilapplikation måste en samling handstyrda verk uppfyllas. I detta projekt, oavsett mobilapplikationens kod och dess kärnfunktioner, som kan vara en e-bok, en applikation eller till och med ett mobilspel, kommer vi att studera hur man automatiserar, visualiserar och förenklar följande manuella procedurer: 1. Skapa ett avlägset Git -arkiv för mobilapplikationen. 2.Konstruera eller ändra mobilapplikationens konfiguration eller grafiska innehåll. 3.Push alla ändringar i det externa Git -arkivet. 4. Distribuera mobilappen från sitt Git -arkiv efter varje ändring.

The problem of profiled school scheduling is important for Lithuanian schools and for similar schools in many other countries. No polynomial time methods are known for this problem. The objective of this PhD thesis is to investigate heuristic methods for optimization of profiled school schedules. The convenience of application in real-life situations is provided by the vector optimization approach using platform-independent software implementation. The task of experimental investigation is to select such parameters of heuristic methods that minimize expected deviation from the optimum. Four optimization methods were regarded: Local Deterministic (LD), Local Randomized (LR), Simulated Annealing (SA), and SA with parameters optimized using the Bayesian approach (BA). The composite method of AM and BA provided the best results. In Chapter 1 of the dissertation, various aspects of work of optimization methods as well as popular program languages suitable for school schedule optimization are analyzed. Literature about school scheduling is analysed. In Chapter 2, conclusions are drawn how the optimization of heuristic parameters influences the speed and accuracy of finding the optimal solution. A technical rating analysis of popular schedule programs is made and technical disadvantages are listed. Criteria for evaluating the quality of results are proposed that include heuristic parameters in search of optimal schedules. Recommendations are states how to assess the choice and... [to full text] / Profiliuotos mokyklos tvarkaraščio kūrimas yra aktualus uždavinys tiek Lietuvoje, tiek kitose šalyse. Nėra žinoma polinominių būdų šiai problemai spręsti. Pagrindinis šios daktaro disertacijos objektas yra ištirti euristinius metodus, skirtus profiliuotos mokyklos tvarkaraščio optimizavimui. Tvarkaraščio formavimo kriterijai, kurie yra reikalingi realiame gyvenime, nustatomi vektorinio optimizavimo metodais bei realizuojami nuo operacinės sistemos nepriklausoma programine įranga. Eksperimentinių tyrimų uždavinys – surasti tokius euristinių metodų parametrus, kurie minimizuotų numatytą nuokrypį. Disertacijoje aprašomi keturi optimizavimo metodai: lokalus determinuotas (LD), lokalus atsitiktinis (LA), atkaitinimo modeliavimo (AM) ir AM parametrų optimizavimas naudojant Bayes (BA) metodą. Kombinuotas AM ir Bayes metodas duoda geriausius rezultatus. Pirmajame apžvelgiama su mokyklos tvarkaraščių formavimu susijusi literatūra. Analizuojami tinkamiausi optimizavimo metodų darbo aspektai. Analizuojamos populiariausios programavimo kalbos, tinkančios kurti mokyklų tvarkaraščių optimizavimo programą. Antrajame skyriuje formuluojamas profiliuotų mokyklų tvarkaraščio kūrimo matematinis modelis. Analizuojami profiliuotose mokyklose naudojami euristiniai parametrai. Atlikti populiarių tvarkaraščių programų vertinimai ir analizės. Įvardijami šių programų trūkumai. Trečiajame skyriuje, remiantis 2 skyriaus analize ir išvadomis, pateiktas profiliuotos mokyklos lanksčios tvarkaraščio... [toliau žr. visą tekstą]

Profiliuotos mokyklos tvarkaraščio kūrimas yra aktualus uždavinys tiek Lietuvoje, tiek kitose šalyse. Nėra žinoma polinominių būdų šiai problemai spręsti. Pagrindinis šios daktaro disertacijos objektas yra ištirti euristinius metodus, skirtus profiliuotos mokyklos tvarkaraščio optimizavimui. Tvarkaraščio formavimo kriterijai, kurie yra reikalingi realiame gyvenime, nustatomi vektorinio optimizavimo metodais bei realizuojami nuo operacinės sistemos nepriklausoma programine įranga. Eksperimentinių tyrimų uždavinys – surasti tokius euristinių metodų parametrus, kurie minimizuotų numatytą nuokrypį. Disertacijoje aprašomi keturi optimizavimo metodai: lokalus determinuotas (LD), lokalus atsitiktinis (LA), atkaitinimo modeliavimo (AM) ir AM parametrų optimizavimas naudojant Bayes (BA) metodą. Kombinuotas AM ir Bayes metodas duoda geriausius rezultatus. Pirmajame apžvelgiama su mokyklos tvarkaraščių formavimu susijusi literatūra. Analizuojami tinkamiausi optimizavimo metodų darbo aspektai. Analizuojamos populiariausios programavimo kalbos, tinkančios kurti mokyklų tvarkaraščių optimizavimo programą. Antrajame skyriuje formuluojamas profiliuotų mokyklų tvarkaraščio kūrimo matematinis modelis. Analizuojami profiliuotose mokyklose naudojami euristiniai parametrai. Atlikti populiarių tvarkaraščių programų vertinimai ir analizės. Įvardijami šių programų trūkumai. Trečiajame skyriuje, remiantis 2 skyriaus analize ir išvadomis, pateiktas profiliuotos mokyklos lanksčios tvarkaraščio... [toliau žr. visą tekstą] / The problem of profiled school scheduling is important for Lithuanian schools and for similar schools in many other countries. No polynomial time methods are known for this problem. The objective of this PhD thesis is to investigate heuristic methods for optimization of profiled school schedules. The convenience of application in real-life situations is provided by the vector optimization approach using platform-independent software implementation. The task of experimental investigation is to select such parameters of heuristic methods that minimize expected deviation from the optimum. Four optimization methods were regarded: Local Deterministic (LD), Local Randomized (LR), Simulated Annealing (SA), and SA with parameters optimized using the Bayesian approach (BA). The composite method of AM and BA provided the best results. In Chapter 1 of the dissertation, various aspects of work of optimization methods as well as popular program languages suitable for school schedule optimization are analyzed. Literature about school scheduling is analysed. In Chapter 2, conclusions are drawn how the optimization of heuristic parameters influences the speed and accuracy of finding the optimal solution. A technical rating analysis of popular schedule programs is made and technical disadvantages are listed. Criteria for evaluating the quality of results are proposed that include heuristic parameters in search of optimal schedules. Recommendations are states how to assess the choice and... [to full text]

Finding an optimal solution for the logic circuit design problem is challenging and time-consuming especially for complex logic circuits. As the number of logic gates increases the task of designing optimal logic circuits extends beyond human capability. A number of evolutionary algorithms have been invented to tackle a range of optimisation problems, including logic circuit design. This dissertation explores two of these evolutionary algorithms i.e. Gene Expression Programming (GEP) and Multi Expression Programming (MEP) with the aim of integrating their strengths into a new Genetic Programming (GP) algorithm. GEP was invented by Candida Ferreira in 1999 and published in 2001 [8]. The GEP algorithm inherits the advantages of the Genetic Algorithm (GA) and GP, and it uses a simple encoding method to solve complex problems [6, 32]. While GEP emerged as powerful due to its simplicity in implementation and exibility in genetic operations, it is not without weaknesses. Some of these inherent weaknesses are discussed in [1, 6, 21]. Like GEP, MEP is a GP-variant that uses linear chromosomes of xed length [23]. A unique feature of MEP is its ability to store multiple solutions of a problem in a single chromosome. MEP also has an ability to implement code-reuse which is achieved through its representation which allow multiple references to a single sub-structure. This dissertation proposes a new GP algorithm, Improved Gene Expression Programming (IGEP) which im- proves the performance of the traditional GEP by combining the code-reuse capability and simplicity of gene encoding method from MEP and GEP, respectively. The results obtained using the IGEP and the traditional GEP show that the two algorithms are comparable in terms of the success rate when applied on simple problems such as basic logic functions. However, for complex problems such as one-bit Full Adder (FA) and AND-OR Arithmetic Logic Unit (ALU) the IGEP performs better than the traditional GEP due to the code-reuse in IGEP / Mathematical Sciences / M. Sc. (Applied Mathematics)