Dissertations / Theses on the topic 'MATLAB'

MATLAB is a dynamic scientific language used by scientists, engineers and students worldwide. Although MATLAB is very suitable for rapid prototyping and development, MATLAB users often want to convert their final MATLAB programs to a static language such as FORTRAN, to integrate them into already existing programs of that language, to leverage the performance of powerful static compilers, or to ease the distribution of executables. This thesis presents an extensible object-oriented toolkit to help facilitate the generation of static programs from dynamic MATLAB programs. Our open source toolkit, called the MATLAB Tamer, targets a large subset of MATLAB. Given information about the entry point of the program, the MATLAB Tamer builds a complete callgraph, transforms every function into a reduced intermediate representation, and provides typing information to aid the generation of static code. In order to provide this functionality, we need to handle a large number of MATLAB builtin functions. Part of the Tamer framework is the builtin framework, an extensible toolkit which provides a principled approach to handle a large number of builtin functions. To build the callgraph, we provide an interprocedural analysis framework, which can be used to implement full-program analyses. Using this interprocedural framework, we have developed value analysis, an extensible interprocedural analysis to estimate MATLAB types, which helps discover the call edges needed to build the call graph. In order to make the static analyses even possible, we disallow a small number of MATLAB constructs and features, but attempt to support as large a subset of MATLAB as possible. Thus, by both slightly restricting MATLAB, and by providing a framework with powerful analyses and simplifying transformations, we can "Tame MATLAB".
MATLAB est un langage scientifique utilisé par des ingénieurs, scientifiques, et étudiants à travers le monde. Bien que MATLAB soit très approprié pour les prototypages et les développements rapides, les usagers veulent souvent convertir leurs programmes MATLAB finaux vers un langage statique tel FORTRAN, dans le but de les intégrer à des programmes existants dans ce langage, de tirer avantage des performances des compilateurs statiques plus puissants, ou de faciliter la distribution des fichiers exécutables. Cette thèse présente un toolkit extensible orienté objet pour faciliter la production de programmes statiques à partir de programmes MATLAB dynamiques. Notre toolkit à code source libre, appelé MATLAB Tamer («dompteur MATLAB »), vise un large sous-ensemble de MATLAB. À partir d'informations sur le point d'entrée du programme, le MATLAB Tamer construit un graphe d'appels complet, transforme chaque fonction en une représentation réduite intermédiaire et fournit l'information sur le typage pour faciliter la production du code statique. Pour fournir cette fonctionnalité, nous devons manipuler une grand nombre de fonctions MATLAB intégrées. Une partie du cadre du Tamer est le cadre intégré, un toolkit extensible fournissant une approche de principe pour manipuler un grand nombre de fonctions intégrées. Pour construire le graphe d'appels, nous fournissons un cadre d'analyse interprocédural pouvant être utilisé pour implanter des analyses de programmes complets. En utilisant ce cadre inter-procédural, nous avons développé l'analyse des valeurs, une analyse inter-procédurale extensible pour estimer les types MATLAB, pour aider à découvrir les arrêtes d'appels nécessaires pour construire le graphe d'appels. Pour pouvoir rendre faisable une analyse statique, nous interdisons un petit nombre de concepts et caractéristiques de MATLAB, mais nous tentons de supporter un sous-ensemble de MATLAB aussi grand que possible. Conséquemment, en restreignant légèrement MATLAB, en fournissant un puissant cadre d'analyse et en simplifiant les transformations, nous pouvons «dompter MATLAB».

Thesis (M.S. in Applied Mathematics) Naval Postgraduate School, December 1998.
"December 1998." Thesis advisor(s): Maurice D. Weir. Includes bibliographical references (p. 121). Also available online.

For the user’s comfort in modern programs are created system of means, which are called graphical user interface (GUI). GUI is the window, created by user, with lay out graphical elements: command push button, edit text, list boxes, checkboxes, menu and etc. User graphical interface technology started to implant also in modern computer systems, from which the most advanced one – MATLAB. This work examines two ways of MATLAB graphical user interface creation, looks over graphical elements, MATLAB visual possibilities are compared with one the most popular programming medium C++Builder. In applied example are presented the discrete-time signal examples and real sound “a” signal, witch is possible not even depict, but also to hear out. This example demonstrates graphical user interface created by MATLAB.

Matlab is a very popular dynamic scripting language for numericalcomputations used by scientists, engineers and students world-wide. Matlabprograms are often developed incrementally using a mixture of Matlab scriptsand functions and frequently build upon existing code which may use outdatedfeatures. This results in programs that could benefit from refactoring,especially if the code will be reused and/or distributed. Despite the needfor refactoring there appear to be no Matlab refactoring tools available.Correct refactoring of Matlab is quite challenging because of itsnon-standard rules for binding identifiers. Even simple refactorings arenon-trivial. Compiler writers and software engineers are generally not familiar with \matlab and how it's used sothe problem has been left untouched so far. This thesis has two main contributions. The first is McBench, a tool that helps compiler writers understand the language better. In order to have a systematic approach to the problem, we developed this tool to give us some insight about how programmers use Matlab.The second contribution is a suite of semantic-preserving refactoring for Matlabfunctions and scripts including: function and script inlining, convertingscripts to functions, extracting new functions, and converting dynamic feval calls to static function calls. These refactorings have been implemented using the McLabcompiler framework, and an evaluation is given on a large set of Matlabprograms which demonstrates the effectiveness of our approach.
matlab est un langage de script dynamique utilisé à des fins de calcul numérique par des scientifiques, ingénieurs et étudiants du monde entier. Les programmes matlab sont souvent développés selon une méthode incrémentale, sur la base d'un mélange de scripts et fonctions Matlab, et sont habituellement conçus à partir d'un code existant dont les fonctionnalités seraient obsolètes. Par conséquent, certains programmes pourraient bénéficier de réusinage, surtout si le code sera réutilisé et/ou distribué. Malgré ce besoin, il n'existe aucun outil matlab de ce genre. Le réusinage de Matlab est assez difficile car les règles pour la liaison des identificateurs ne sont pas standards. Même une opération de maintenance simple revêt une certaine complexité. De plus, les créateurs de compilateurs et les ingénieurs en informatique ne sont généralement pas familiers avec matlab et la façon dont il est utilisé. C'est pourquoi à ce jour le problème n'a jamais été traité. Cette thèse apporte deux contributions principales: d'une part la création de MCBENCH, un outil aidant les créateurs de compilateurs à mieux comprendre le langage. Afin d'avoir une approche systématique du problème, nous avons développé cet outil pour en savoir plus sur la façon dont les programmeurs utilisent Matlab. L'autre contribution est une suite de réusinages préservant la sémantique des fonctions et scripts Matlab: incorporation de fonctions et scripts, conversion de scripts en fonctions, extraction de nouvelles fonctions et conversion d'appels dynamiques feval en appels de fonction statique. Le cadriciel et compilateur McLab a été utilisé pour la mise en œuvre de ces réusinages. De plus, une évaluation est donnée sur un large éventail de programmes Matlab afin de démontrer l'efficacité de notre approche.

Nowadays many scientific experiment results involve multi-dimensional arrays. It is desirable to store these results in a persistent way and make queries against not only well-structured data objects like arrays but also the metadata that describe the experiments. SPARQL is a Semantic Web standard query language for data and metadata stored in terms of RDF. SciSPARQL is an extended version of SPARQL designed for scientific applications. It includes numeric multi-dimensional array operations and user-defined functions. The SciSPARQL Database Manager (SSDM) is a query processing engine for SciSPARQL. MATLAB is a popular and powerful scientific computing application programming language. We implemented an interface between MATLAB and SciSPARQL called MATLAB SciSPARQL Link (MSL). MSL provides SciSPARQL queries in MATLAB through a client/server interface. It optionally also provides an interface to enable calls to MATLAB in SciSPARQL queries.  With MSL MATLAB users can populate, update, and query SSDM databases it in terms of SciSPARQL queries. For the implementation we use C interfaces of MATLAB and SSDM, and the networking capabilities of SSDM. The DLL we made extends MATLAB with MSL interface functions.

This paper describes methods for pricing European and American options. Monte Carlo simulation and control variates methods are employed to price call options. The binomial model is employed to price American put options. Using daily stock data I am able to compare the model price and market price and speculate as to the cause of difference. Lastly, I build a portfolio in an Interactive Brokers paper trading [1] account using the prices I calculate. This project was done a part of the masters capstone course Math 573: Computational Methods of Financial Mathematics.

Tässä työssä on keskitytty betonin suhteituksen laskemiseen lineaarisen regression kautta. Suhteitus on tärkeä betonin valmistuksen suunnitelma, jolla pyritään saamaan tuoreelle ja kovettuneella betonille halutut ominaisuudet. Puristuslujuus on betonin tärkein ominaisuus ja se toimii tässä työssä vastearvona. Puristuslujuuden vastearvoja tutkitaan ennustemuuttujien eli prediktorien avulla. Ennustemuuttujina ovat esimerkiksi sementtimäärä, vesimäärä, kiviainesmäärä ja erilaisten lisäaineiden määrä. Suhteitusta voidaan suorittaa reaaliaikaisesti betoniasemalla mutta mielestäni se tulisi ottaa yhdeksi suunnittelun osa-alueeksi. Tällöin on kuitenkin oltava betonissa reagoivien osa-aineiden käytöstä aikaisempaa tietoa, jonka avulla laskenta suoritetaan ja päätökset tehdään. Aineiston käsittelyä voidaan tehdä monellakin tavalla mutta nyt keskitytään lineaarisella regressiolla laskettaviin menetelmiin Matlab-ohjelmalla. Matlab-ohjelmassa on valmiina monia valmiita toimintoja laskennan suorittamiseksi ja tulosten esittämiseksi havainnollisesti
This work is focused on the concrete mix design calculation via linear regression. Concrete mix-design is important manufacturing plan, which aims to get desired properties into fresh and hardened concrete. Compressive strength of hardened concrete is the most important feature. Response values of concrete compressive strength are examined with predictors. Predictive variables are for example the amount of cement, water, aggregates and various additives. Concrete mix-design work can be performed in real-time in batching plant, but it should be taken as one action on normal design work. Before we can get any results and make decisions, we must have previous information about the behavior of the materials. The data processing can be done in many ways, but now we focus on the linear regression methods with a software Matlab. Matlab program has many ready-made functions and methods to perform calculations and present the results graphically

Työn tarkoituksena oli tutustua automaattiseen puheentunnistukseen ja toteuttaa Matlab-ohjelmalla toimiva muutaman käskyn tunnistava puhujariippumaton puheentunnistusjärjestelmä, joka voidaan liittää simulaationukkeen kontrolloimaan sen hengitystä. Työssä tutustuttiin yleisiin ja järjestelmän toteutuksen kannalta merkittävimpiin puheentunnistuksen menetelmiin, joiden avulla puheentunnistusjärjestelmä rakennettiin. Toteutuksessa puhetta sisältävä signaali erotettiin hiljaisuudesta käyttäen Rabinerin ja Schaferin kuvaamaa algoritmia ja tunnistettavana yksikkönä käytettiin käskyt sisältävää fraasia. Piirreirrotus tehtiin Mel-Frequency Cepstrum Coefficients (MFCC) -menetelmällä ja akustiset mallit pohjautuivat Gaussin Mixture malliin (GMM) ja Markovin piilomalliin (HMM). Tunnistuksessa käytettiin useampaa mallia rinnakkain vähentämään satunnaisen puheen tunnistamista virheellisesti joksikin opetetuista käskyistä. Akustisten mallien harjoitteluun ja järjestelmän testaukseen tarvittava puheaineisto hankittiin pääasiassa Oulun yliopistollisen sairaalan Sädehoidon yksikön hoitajilta, jotka puheohjausjärjestelmää tulevat käyttämään. Testausten perusteella järjestelmä tunnisti alle 1 % virheellä oikeat puhekäskyt. Ongelmia tuli satunnaisen puheen virheellisellä tunnistuksella joksikin opetetuista puhekäskyistä, mitä ei onnistuttu kokonaan poistamaan. Järjestelmästä tuli kuitenkin toimiva käyttökohteeseensa, sillä käskyt annetaan painamalla näppäimistöstä enteriä pohjassa vastaavasti kuin potilaalle puhutaan mikrofonin kautta pitämällä tangenttia pohjassa ja nukelle annetaan pääsääntöisesti vain oikeita käskyjä
The aim of this thesis was to study automatic speech recognition (ASR) and produce Matlab-based speaker-independent ASR system that recognizes few speech commands and can be joined to control breathing of a simulation manikin. During this thesis commonly used ASR methods was studied and represented. In the produced ASR system, algorithm of Rabiner’s and Schafer’s was used to pick the speech signal from silence. Whole phrase containing the speech command was used as the recognition unit. Feature extraction was made by using Mel-Frequency Cepstrum Coefficients (MFCC) and acoustic models was based on Gaussian Mixture Model (GMM) and Hidden Markov Model (HMM). During recognition state combine of the models was used in tandem to reduce the misrecognition of random speech as the speech commands. Set of speech signals for training the acoustic models and testing performance of the ASR system was acquired mainly in the Oulu University Hospital from nurses who will use the ASR system. The error ratio of the ASR system was less than 1 percent with the correct speech commands according to the tests. The main problem with the system was misrecognition of random speech as the speech commands. However, the ASR system is suitable for use because mainly only correct speech commands is spoken and the speech commands is spoken pressing and holding down the enter key

Nowadays, it is possible to integrate an increasing number of functionalities on a single chip thanks to the state of the art technology in Electronic design automation. However, designing highly complex electronic systems quickly and reliably requires dealing with all such functionalities, which can be difficult as it requires a long and challenging design process because low-level details are necessary to obtain a functional implementation. One approach to deal with this complexity is to tackle SoC design from a high-level abstraction standpoint. Then, the numerous functionalities can be described and possibly addressed at a high level, as long as the newly created abstraction gap is taken care of. Time-to-market is of crucial importance when designing a product. A design process done at a high-level of abstraction considerably reduces the time required to obtain the final product. ForSyDe was created to address the problem of moving system design (I.E. System on Chip, Hardware, and Software systems) to a higher level of abstraction and bridge the abstraction gap by transformational design refinement. Currently, ForSyDe is implemented in the functional language Haskell and SystemC. The design flow starts from executable application models with individual design constraints that are a consistent part of ForSyDe ’s goals and this thesis’s primary focus. This thesis project presents the implementation of ForSyDe in the widely used modelling software MATLAB/Simulink. This new implementation allows using the ForSyDe methodology together with the powerful simulation tools offered by Simulink and Matlab. The thesis describes and analyses the different Models of Computation (MoCs) used by ForSyDe. It then presents the ForSyDe methodology and its existing Haskell implementation (on which the Simulink implementation is based). The Simulink simulation engine is introduced to show the differences and similarities with Haskell. The Simulink library developed is based on the ForSyDe-Shallow module (an Embedded Domain-Specific Language part of the Haskell implementation). The limits and opportunities introduced by the Simulink implementation are discussed in this thesis. Like the rest of the documentation, all the existing code is available on the Github repository. The evaluation and comparison of the ForSyDe-Simulink library are also done with a concrete application model that is an Audio Filter subsystem of an audio equalizer system. Simulink is concluded to be more efficient in performance considering the execution time and the memory consumption, but it is not suitable to properly accommodate ForSyDe-Shallow due to a lack of expressiveness.
Tack vare framstegen inom automatisering av design för elektroniska system så är det idag möjligt att integrera mer funktionalitet på ett enstaka chip. Att däremot designa komplexa elektroniska system fort och pålitligt så krävs att alla funktioner hanteras korrekt, vilket kan vara svårt eftersom att det kräver en lång och besvärlig design process eftersom en hel del detaljer krävs för att få en fungerande implementation. Ett sätt att handskas med denna komplexitet är angripa problemet för SoC design genom att använda en hög abstraktionsnivå. Då kan all funktionalitet beskrivas och troligen även adresseras på en hög abstraktionsnivå, så länge man åtgärdar de abstraktions gap som detta orsakar. Tid-till-Marknad är av yttersta vikt då man designar en produkt och en designprocess som utförs på en hög abstraktionsnivå minskar kraftigt tiden till dess att produkten kan framställas. ForSyDe skapades för att adressera problemet med att flytta design av system (t.ex. System on Chip, hårdvara och mjukvarusystem) till en högre abstraktionsnivå och brygga gapet genom att använda transformationer och förfiningar av designen. Just nu så är ForSyDe implementerat i det funktionella språket Haskell och även SyStemC. Designflödet startar med exekverbara modeler av applikationen med individuella design begränsningar som är en del av ForSyDe’s mål och detta examensarbetes primära fokus. Detta examensarbetesprojekt presenterar en implementation av ForSyDe i den välanvända modelleringsmjukvaran MATLAB/Simulnik. Denna nya implementation tillåter användandet av ForSyDe metodologin tillsammans med det kraftfulla simulationsverktyget som tillhandahålls av Simulink och Matlab. Examensarbetet beskriver och analyserar de olika modeller för beräkning (MoCs) som används av ForSyDe. Sedan så presenteras ForSyDe metodologin och dens nuvarande Haskell implementation (som även Simulink implementation baseras på). Simulationsmotorn I Simulink introduceras för att påvisa skillnaderna och likheterna med Haskell. Biblioteket som utvecklats I Simulink baseras på ForSyDe- Shallow modulen (ett inbäddat och domänspecifikt språk som är en del av Haskell implementationen). De begränsningar och möjligheter som introduceras I och med Simulink implementationen diskuteras i detta examensarbete. Likt resten av dokumentationen så finns all kod tillgänglig på Github. En utvärdering och jämförelse av ForSyDe-Simulink biblioteket utförs också med en konkret applikationsmodell som är ett ljudfilter ifrån en ljudutjämnare.

Radar warning systems are life saving equipment in modern fighter aircraft. It is therefore vital that the system can tell the difference between a threat genuine frequency) and a false signal (spurious frequency).

This thesis presents a model aimed at predicting the frequencies and other parameters in the RF converter of the radar warning system. The components of the RF converter have been studied, measured, and modelled. The modelling tool has been the Simulink toolbox for Matlab.

Extreme accuracy has been sacrificed in order to make the model easy to use for the working engineer. Instead, this model presents a rough estimate of some of the most important properties of the radar warning system with just a few data sheet figures as input.

The simulation results are satisfactory as a whole. Simulink is the limiting factor in the implementation of the model. Significantly improved results can probably be obtained by working in another software environment.

One of ABB Power Systems´s business areas is HVDC (High Voltage Direct Current) technology. HVDC is used for transmissions for both short and long distances. One of Power Systems’s products is called HVDC Light.

HVDC Light is a relatively new technology for power transmission, but have before only been used for motor drives applications. The technology is based on VSC (Voltage Source Converter) that uses a technique called PWM (Pulse Width Modulation).

There are a lot of PWM patterns that have been examined, but not in the field of power transmission where ABB Power Systems is working.

The different PWM patterns can be used for reducing switching losses or harmonics, that can cause the need of external filters to decrease or increase.

The purpose of this report is to give a general picture of the system that generates the PWM patterns. The report describes some main components in the system. T

he thesis also present amplitude spectrum from various PWM patterns - generated by signals that have been pulse width modulated with a triangle- shaped wave.

By showing the frequency-content, the decisions are eased for the engineers and technicians that are working with this kind of questions.

An analysis of different PWM patterns have been done. The kind of reference waves that generate the PWM patterns are called Dead Band PWM and Modified SPWM.

Comparisons have been done for Dead Band PWM, between harmonics and the width of Dead Band. Comparisons have been done for Modified SPWM, between:

1. fundamental frequency and modulation index.

2. different Modified SPWM and their harmonics.

In this thesis, the focus is on creating a wrapper between MATLAB and the Cadence Virtuoso design environment. The central idea is to use the wrapper and write the code for an entire analog layout as scripts in MATLAB. Basically, we will implement a set of necessary commands for performing the most fundamental tasks in layout generation from within MATLAB.

This master thesis covers the development of an automatic tuning process for the existing speed controller for drive systems. The drive systems are resonant two-mass systems where a motor is used to drive a load connected by a shaft. The developed method relies heavily on system identification and the construction of a complete mechanical model of the process. With this approach, the common problem with poor load speed control that derives from measuring only the motor speed can be addressed and solved for a majority of such processes.

The automatic tuning method has along with general test functions been implemented in a complete tool for automatic tuning, testing and performance evaluation and reporting for drive systems.

This article contains discussions of the algorithms used for the construction of the continuation software implemented in this thesis. The aim of the continuation was to be able to perform continuation of equilibria and periodic solutions originating from a Hopf bifurcation point. Algorithms for detection of simple branch points, folds, and Hopf bifurcation points have also been implemented. Some considerations are made with regard to optimization, and two schemes for mesh adaptation of periodic solutions based on moving mesh equations are suggested.

This article summarizes the ideas behind a few programs we developed for spatial data analysis in EViews and MATLAB. They allow the user to check for spatial autocorrelation using Moran's I and provide a spatial filtering procedure based on the Gi statistic by Getis and Ord (1992). We have also implemented graphical tools like Moran Scatterplots for the detection of outliers or local spatial clusters.

This thesis presents our work on compiler techniques to implement Algo- rithmic Di erentiation (AD) using source transformation in MATLAB. AD is concerned with the accurate and e cient computation of derivatives of complicated mathematical functions represented by computer programs. Source transformation techniques for AD, whilst complicated to imple- ment, are known to yield derivative code with better run-time e ciency than methods using overloading support of the underlying language. We present results from MSAD that con rm the increase in e ciency using source trans- formed code for MATLAB AD. Most importantly, we demonstrate the use of a unique compiler code specialisation method to implement AD. We also assert the need for compiler optimisations in MATLAB, especially in the con- text of AD, and showcase MSAD as an extensible infrastructure to implement new optimisations and algorithms for AD or other applications. Where other e orts on MATLAB AD are implemented using operator overloading or a mix of overloading and source transformation, MSAD (Springer LNCS, Vol. 3994, 2006) was the rst to generate di erentiated MATLAB code using source transformation alone. MSAD is also the only e ort to implement source transformed AD by resolving overloaded MAT- LAB code. The existing MAD package (ACM TOMS, 32, No.2, 2006) pro- vides a highly e cient overloaded implementation of MATLAB AD. MSAD uses compiler code specialisation techniques to specialise and inline fmad and derivvec overloaded operations of the MAD package in order to generate MATLAB AD code. The operator overloading overheads inherent in MAD are eliminated while preserving the derivvec class's optimised derivative combination operations. As a compiler framework for MATLAB, MSAD demonstrates a novel use of an existing e ective compiler algorithm (Sparse Conditional Constant Propagation) to infer properties of MATLAB variables such as type, rank, shape, sparsity and value by propagating a composite lattice of all the prop- erties together.

This item is only available in print in the UCF Libraries. If this is your Honors Thesis, you can help us make it available online for use by researchers around the world by following the instructions on the distribution consent form at http://library.ucf.edu/Systems/DigitalInitiatives/DigitalCollections/InternetDistributionConsentAgreementForm.pdf You may also contact the project coordinator, Kerri Bottorff, at kerri.bottorff@ucf.edu for more information.
Bachelors
Engineering
Electrical Engineering

Orientador : Hugo Enrique Hernandez Figueroa
Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-07-27T17:51:51Z (GMT). No. of bitstreams: 1 Correa_MarioAparecido_M.pdf: 4285270 bytes, checksum: 4525524630a7c23f3fa0cc818e72a548 (MD5) Previous issue date: 2001
Resumo: Apresenta-se um ambiente de simulação computacional, desenvolvido sobre a plataforma MATLAB, para diversos problemas e efeitos eletromagnéticos. Pela sua versatilidade e abrangência o Método dos Elementos Finitos foi adotado na resolução das equações correspondentes, derivadas das Equações de Maxwell. Aspectos computacionais e vários exemplos de aplicação são discutidos em detalhe. A técnica de simulação pelo Método de Elementos Finitos vem sendo largamente utilizada em diversos ramos da engenharia e, em especial, como auxiliar no modelamento de dispositivos baseados em ondas eletromagnéticas. Por outro lado, com uma difusão no meio científico e industrial já bastante ampla, o MATLAB tem se mostrado como uma poderosa ferramenta para o desenvolvimento,testes e implementação dos mais variados algoritmos de computação numérica. Aliar o ambiente do MATLAB às técnicas de programação para o Método de Elementos Finitos torna-se uma tarefa quase que natural se, levarmos em consideração o aspecto matricial do método e, as funcionalidades de manipulação matricial do ambiente. Isto motivou a concepção da toolbox meftoot apresentada neste trabalho em detalhe, a qual tem por filosofia ser um Ambiente MATLAB - Elementos Finitos para Eletromagnetismo
Abstract: A computational simulation environmentis presented, which was developed over the MATLAB platfonn, for a variety of electromagnetic problems and effects. Due to its versatility and wide scope, the Finite Element Method was adopted for the solutionof the corresponding equations,which are derived from the Maxwell's Equations. Computational aspects and several illustrative examples are discussed in detail. The simulation technique for the Finite Element Method has been broadly used in several branches of engineering and, especially, as an effective aid in the modeling of wave electromagnetic devices. On the other hand,with a very wide diffusion in the scientific and industrial market, MATLAB has shown itself as a powerful tool for the development, test and implementation of a large variety of routines for numerical computation. The merge between MATLAB and the Finite Element programming techniques becomes an almost natural task, if we take into account the characteristics of the method and the MATLAB's functionality to manipulate arrays, in an efficient and effective manner. This motivated the conception of the toolbox presented here, called meftool, which has for philosophy o be a MATLAB-Finite Element Environment for Electromagnetics
Mestrado
Telecomunicações e Telemática
Mestre em Engenharia Elétrica

Розглянуто можливість розрахунку регуляторів системи електропривода у ППП Matlab. Вказано на переваги та недоліки пакету оптимізаційних розрахунків NCD Blockset.
The possibility of calculating the electric system regulators in Matlab. Specified on the advantages and disadvantages of package optimization calculations NCD Blockset

This diploma thesis deals with the implementation of SIL and PIL simulation for the microcontroller Aurix TriCore TC277D performed in the Matlab Simulink. The realization of the simulation represents, among other things, the implementation of the simulated model into the microcontroller, as well as the creation of an interface for the communication of the microcontroller with the Matlab Simulink. The accuracy of SIL and PIL simulations was verified by comparing the simulated waveforms from the simulation in Simulink. The simulated model used a thermal model of a car cabin created in the previous bachelor's thesis of the author of this diploma thesis. The model in TC277D, as well as the configuration for SIL / PIL is created for use with the C programming language. The work also includes instructions according to which the model and configuration can be modified so that the simulations can be performed on any device containing the necessary software. From the comparison of the simulated data is it clear that the created configuration can be used for SIL or PIL simulation.

Calculate solutions of a dynamic MMC energy-based model, when the system variables, i.e. the voltages and currents, are given as periodic signals. The signals are represented by a finite number distinct frequency components. As a result, the arm energies and cell voltages are given in this signal domain and can easily be translated to time domain as well.:cplx_series.m cplx_series_demo.m energy_series.m denergy_series.m check_symmetry.m transf2arm.m LICENSE.GNU_AGPLv3 sconv2.m

MATLAB has gained widespread acceptance among engineers and scientists. Several aspects of the language such as dynamic loading and typing, safe updates, copy semantics for arrays, and support for higher-order functions contribute to its appeal, but at the same time provide many challenges to the compiler and virtual machine. MATLAB is a dynamic language. Traditional implementations of the language use interpreters and have been found to be too slow for large computations. More recently, researchers and software developers have been developing JIT compilers for MATLAB and other dynamic languages. This thesis is about the development of new compiler analyses and transformations for a MATLAB JIT compiler, McJIT, which is based on the LLVM JIT compiler toolkit. The new contributions include a collection of novel analyses for optimizing copying of arrays, which are performed when a function is first compiled. We designed and implemented four analyses to support an efficient implementation of array copy semantics in a MATLAB JIT compiler. Experimental results show that copy optimization is essential for performance improvement in a compiler for the MATLAB language. We also developed a variety of new dynamic analyses and code transformations for optimizing running code on-the-fly according to the current conditions of the runtime environment. LLVM does not currently support on-the-fly code transformation. So, we first developed a new on-stack replacement approach for LLVM. This capability allows the runtime stack to be modified during the execution of a function, thus enabling a continuation of the execution at a higher optimization level. We then used the on-stack replacement implementation to support selective inlining of function calls in long-running loops. Our experimental results show that function calls in long-running loops can result in high runtime overhead, and that selective dynamic inlining can be used to drastically reduce this overhead.The built-in function feval is an important MATLAB feature for certain classes of numerical programs and solvers which benefit from having functions as parameters. Programmers may pass a function name or function handle to the solver and then the solver uses feval to indirectly call the function. In this thesis, we show that although feval provides anacceptable abstraction mechanism for these types of applications, there are significant performance overheads for function calls via feval, in both MATLAB interpreters and JITs. The thesis then proposes, implements and compares two on-the-fly mechanisms for specialization of feval calls. The first approach uses our on-stack replacement technology. The second approach specializes calls of functions with feval using a combination of runtime input argument types and values. Experimental results on seven numerical solvers show that the techniques provide good performance improvements.The implementation of all the analyses and code transformations presented in this thesis has been done within the McLab virtual machine, McVM, and is available to the public as open source software.
MATLAB est devenu reconnu parmi les ingénieurs et les scientifiques. Plusieurs aspects du langage comme le chargement et le typage dynamique, la mise à jour sûr, la sémantique de copie pour les tableaux, et le support des fonctions d'ordre supérieur contribuent à son attrait, mais induisent de nombreuses difficultés pour les compilateurs et les machines virtuelles. MATLAB est un langage dynamique. Les implémentations classiques du langage fonctionnent grâce à des interpréteurs et sont généralement trop lentes pour des larges calculs. Plus récemment, les chercheurs ainsi que les programmeurs ont développé des compilateurs JIT pour MATLAB et d'autres langages dynamiques. Cette thèse traite le développement de nouvelles analyses et transformations pour un compilateur JIT MATLAB, McJIT, qui est basé sur l'outil LLVM. Ces nouvelles contributions comprennent plusieurs analyses novatrices pour optimiser la copie de tableaux, qui sont exécutées quand une fonction est compilée pour la première fois. Nous avons implémenté quatre analyses pour permettre une implémentation efficace de la sémantique de copie de tableaux dans un compilateur JIT MATLAB. Les résultats expérimentaux montrent que l'optimisation de la copie est essentielle pour améliorer les performances dans un compilateur pour le langage MATLAB.Nous avons aussi développé une variété d'analyses dynamiques novatrices et des transformations de code pour optimiser du code à la volée en fonction de l'environnement d'exécution. Actuellement, LLVM ne supporte pas les transformations de code à la volée. En conséquence, nous avons d'abord développé une nouvelle approche pour faire du remplacement sur la pile avec LLVM. Cette fonctionnalité permet à la pile d'exécution d'être modifiée pendant l'exécution de la fonction, ce qui permet de continuer l'exécution à un niveau supérieur d'optimisation. Nous avons ensuite utilisé cette implémentation du remplacement sur la pile pour permettre l'en line des appels de fonctions dans les boucles. Nos résultats expérimentaux montrent que les appels de fonctions dans les boucles à long temps d'exécution peuvent induire un coût important en termes de performances, et que l'en line dynamique et sélectif peut être utilisé pour réduire drastiquement ce coût. La fonction "feval" est une fonctionnalité importante de MATLAB pour certains programmes de calcul numérique qui profitent de la possibilité de passer des fonctions comme paramètres. Les programmeurs peuvent passer le nom d'une fonction ou un pointeur de fonctions à un programme qui utilisera ensuite feval pour appeler indirectement cette fonction. Dans cette thèse, nous montrons que malgré le fait que feval soit un mécanisme d'abstraction appréciable pour certaines applications, il induit un coût significatif, à la fois pour les interpréteurs et pour les compilateurs JIT. Cette thèse propose, implémente et compare deux mécanismes à la volée pour la spécialisation des appels utilisant feval. La première méthode utilise notre mécanisme de remplacement sur la pile. La seconde méthode spécialise les appels de fonctions utilisant feval en combinant le type et la valeur des arguments à l'exécution. Les résultats expérimentaux sur sept programmes différents montrent que ces techniques permettent une bonne amélioration des performances. L'implémentation de toute les analyses et transformations de code présentées dans cette thèse a été effectué dans la machine virtuelle McLab, appelée McVM, et est disponible au public en tant que logiciel libre.

Master’s thesis is dedicated to the issue of network element. In the first part are described technological aspects as the internal structure of network elements and control mechanisms that provide differentiaton of services and support their quality requirements. In the first chapter are listed control mechanisms from most simple like FIFO to the more sophisticated like CBWFQ. Active queue managements are not missing and they are described in the section Riadiaci člen. Significant role in the differentiation of services have processes marking and pakets classification. The second chapter is devoted most promising standard DiffServ. Contains section devoted to architecture, paket marking, code point DSCP and the final part is devoted to the types of per-hop behavior and it is expedited forwarding EF and technique assured forwarding AF. The third chapter gives an overview common models of neural networks, their properties and assess their suitability for deployment in network elements. The routher design itself and its structure in programming environment Matlab/Simulink is the subject of the fourth chapter. Except used bloks from Simulink library is described their setting and function in the wiring. Consequently results are reviewied and conclusions drawn.

The thesis deals with the visualization of biomedical data in MATLAB environment. The thesis contains following statistical methods and their descriptions: P-P plot, Q-Q plot, histogram, box plot, kernel denstity estimation, scatter plot and several time series metrics. Some functions are programmed from buil-in functions of MATLAB and others using external functions, which are changed to fit to this thesis’s purpose. First part of the thesis conserns theoretical background, whereas the second part conserns practical programmed realizations of mentioned functions. The program contains a graphical user interface - GUI, which the thesis describes in detail. The purpose of the GUI is to ensure ease of use and also data processing. The output graphs of GUI are shown in chapter 5. The last part deals with the possible extensions of the program.

Questo elaborato presenta un'analisi del toolbox anmglib_2.0: verranno esposte le modifiche migliorative apportate e verrà realizzata una documentazione semplice ed esaustiva per il suo utilizzo in ambito didattico, ma non solo. Il toolbox si presenta come una libreria di function, utilizzabile in ambiente MATLAB, e permette di calcolare e rappresentare vari elementi geometrici, quali curve, superfici e solidi ed eseguire operazioni su questi. Attraverso le differenti chiavi di lettura è possibile approfondire i vari aspetti che caratterizzano questo toolbox.

Questo scritto ha lo scopo di illustrare i principi dell’olografia digitale. Nella prima parte descriverò le basi dell’olografia per poi analizzare i processi numerici, svolti al computer, che permettono di simulare i fenomeni della diffrazione della luce incidente su di un ostacolo. Nella seconda parte esporrò un programma illustrativo, il quale ripercorre i passaggi fondamentali della Computer Generated Holography. Per la scrittura dei programmi utilizzerò OCTAVE, un’applicazione software open-source per l’analisi numerica in gran parte compatibile con MATLAB. Octave ha un insieme di funzionalità fornite per il calcolo matriciale ed è scritto in conformità dello standard POSIX nel linguaggio C++ usando le librerie Standard Template Library.

The object of this thesis is to provide a MATLAB framework for nonlinear filtering in general, and particle filtering in particular. This is done by using the object-oriented programming paradigm, resulting in truly expandable code. Three types of discrete and nonlinear state-space models are supported by default, as well as three filter algorithms: the Extended Kalman Filter and the SIS and SIR particle filters. Symbolic expressions are differentiated automatically, which allows for comfortable EKF filtering. A graphical user interface is also provided to make the process of filtering even more convenient. By implementing a specified interface, programming new classes for use within the framework is easy and guidelines for this are presented.

Vid malmbrytning förflyttas malm långa sträckor med tåg. Malmbanan är en järnväg som går från Luleå till Narvik i Norge. Mellan Kiruna och Narvik fraktas det årligen ca 15 miljoner ton järnmalm. Tåget består av 2 lok med 52 vagnar där varje vagn kan väga upp till 100 ton. I kopplen mellan vissa vagnar uppstår sprickor som kan leda till brott så att tåget riskerar tappa vagnar.

Syftet med det här arbetet är att titta på hur stora krafterna blir i kopplen mellan tågvagnarna. Tåget har i denna studie simulerats i Matlab i form av ett system bestående av massor, fjädrar och dämpare.

Vad som är intressant att se är hur dessa krafter varierar när tåget accelererar samt bromsar in så att systemet sätts i svängning. Problemet löstes genom att tillföra en varierande kraft F(t)=F0sin(wt) på loket, vilket simulerar accelerations- samt inbromsnings-tillfällena. Då krafterna mellan vagnarna är större än dragkraften från loket (F0) finns det risk för brott i kopplen (fjädrarna). Detta kan medföra att tåget tappar vagnar. Därför är det önskvärt att studera vilka parametrar som påverkar krafternas storlek i kopplen. Matlab-programmeringen för att räkna ut krafterna mellan vagnarna är uppdelade i två filer, nämligen train_input.m och solver.m. I filen train_input förbereds inputdata för den ordinära differentialekvationslösaren i filen solver.m. De bägge filerna har varsin input-sektion där önskade parametrar måste specificeras innan Matlab-koden exekveras.

Om man i Matlab-programmet till en början har ett lok och en vagn, så kan man studera hur den maximala kraften (Fmax) i kopplen påverkas genom att successivt koppla på en extra vagn. Krafterna i kopplen ökar inte proportionellt med ökande antalet vagnar, som man först spontant kan tro. Till en början ökar krafterna mellan dem men när antalet vagnar blir fler och fler så börjar kraftökningen att avta. Flera olika egensvängningar kan äga rum och beroende på vilket tidsintervall man vill studera får man olika värden på Fmax. Detta gör att man inte kan ange vid vilket antal vagnar som krafterna börjar avta.

Då styvhetskonstanten är hög samt när deformationen av kopplet/fjädern mellan varje vagn är som störst uppstår stora krafter i kopplen. Styvhetsvärdet k påverkar även vagnarnas position relativt loket under körning. Fjädringen i kopplen minskar med ökande värde på styvhetsvärdet k och kopplen blir på så sätt stelare. Detta resulterar i att vagnarnas position relativt loket inte ändras lika mycket då kopplen görs stelare.

När tågvagnarna lastas med malm ökar givetvis även vikten på hela ekipaget och får till följd att loket måste klara av att dra mer last. Kraften i kopplen ökar till följd av ökad massa på tåget. När tågvagnarna inte har någon last och därmed lägre vikt går tåget ryckigt, men när man lastar tåget får det en mjukare gång, frekvensen blir lägre.

Dragkraften påverkar kraften i kopplen. Ju större dragkraft desto större kraft uppstår på kopplen.

Stora krafter i kopplen uppstår då systemet börjar självsvänga med någon av dess egenvinkelfrekvenser samt då vinkelfrekvensen ligger nära egenvinkelfrekvensen.

Betrakta en analytisk funktion f som beror av en komplex variabel z och ett ändligt antal reella parametrar param1, param2, ..., paramk, där k är ett positivt heltal. Rötterna till funktionen, med avseende på variabeln z, erhålls genom att lösa ekvationen f(z, param1, param2, ..., paramk)=0. Således kommer dessa rötter att vara beroende av parametrarna. Låt en av parametrarna paramj, där j är ett positivt heltal mindre än eller lika med k, vara monotont ökande eller avtagande på ett reellt intervall. Även funktionens rötter kommer att variera, till följd av de olika värdena på parametern paramj.

Ett datorprogram, som beräknar och undersöker rörelsen hos rötterna till en funktion då en parameter varierar, har utvecklats och implementerats i MatLab. Underprogram som använder numerisk analys i form av sekantmetoden för att beräkna approximationer av rötter och linear algebra för att kunna identifiera de rötter som är felaktiga, har också skrivits. Det vill säga, programmets huvudsakliga åtgärder ligger i att kontrollera om de beräknade värdena är korrekta och att rätta till de som är felaktiga.

Examensuppgiften och det implementerade programmet har främst varit inriktade på ljuddämpare, vilket innebär en problemställning, där rötterna till en funktion undersöks för att analysera hur akustiska vågor fortplantas vid olika villkor. Således har den huvudsakliga målsättningen varit att förenkla tillvägagångssättet för att beräkna rötter.

Consider an analytic function f of a complex variable z and of a finite number of real parameters param1, param1, ..., paramk, for a positive integer k. The roots of the function, with respect to the variable z, are obtained by solving the equation f(z, param1, param2, ..., paramk)=0. Consequently those roots will depend on the parameters. Let one of the parameters paramj, where j is a positive integer less or equal to k, be monotonically increasing or decreasing on an interval of the real line. As a consequence of those different values of paramj, also the roots of the function f will vary.

A computer program that calculates and examines the behavior of the roots of a function as one parameter varies, has been developed and implemented in MatLab. Subroutines have been written, which use numerical analysis by using the secant method to calculate approximations of roots and linear algebra to identify the false roots. That is, the main measures of this program is to make sure that the calculated values are correct and to adjust the false ones.

The paper and the implemented program are principally concentrated on silencers, that is, on modal analysis. Modal analysis is the examination of how the shape and the behaviour of acoustic waves are affected by different conditions, which is done by studying the roots of a function. Consequently, the main purpose has been to facilitate the procedure of finding roots.

In the modern world, because of increasing oil prices and the need to control greenhouse gas emission, a new interest in the production of electric cars is coming about. One of the products is a charging point for electric cars, at which electric cars can be recharged by a plug in cable. Usually people are required to pay for the electricity after recharging the electric cars. Today, the payment is handled by using SMS or through the parking system. There is now an opportunity, in cooperation with AES (the company with which we are working), to equip the pole with GPRS, and this requires development and maintenance of the antenna. The project will include data analysis of the problem, measurements and calculations. In this work, we are computing energy flow of the wave due to the location of the antenna inside the box. We need to do four steps. First, we take a set of points (determined by the computational mesh) that have the same distance from the antenna in the domain. Second, we calculate the angles between the ground and the points in the set. Third, we do an angle-energy plot, to analyse which angle can give the maximum energy. And last, we need to compare the maximum energy value of different position of the antenna. We are going to solve the problem in Matlab, based on the Maxwell equation and the Helmholtz equation, which is not time-dependent.

A MATLAB Finite Element code for plane strain analysis of footings on an Elasto-plastic material using the Mohr Coulomb failure criteria has been developed. The first step is to develop codes for mesh generation and Gaussian numerical integration. Next, the force matrix, the stiffness matrix and the self weight matrix are assembled. After that functions for non linear analysis such as the plastic potential derivatives are formed. Finally plots of the mesh, displacement shadings, stress shadings and stress-strain curves are developed. For the purpose of verification results from the code for biaxial test are compared with the theoretical solution. Additionally comparison is made between the code and prandtl’s bearing capacity solutions for a footing problem. These results show that accuracy depends on two factors: - the type of the element and the number of elements used. The three node triangular element and the four node rectangular element give less accurate results when compared to higher order element types. And for a relatively accurate result the number of elements should be too high.

Increased usage of electronic devices and the fast development of microprocessors has increased the usage of digital filters ahead of analog filters. Digital filters offer great benefits over analog filters in that they are inexpensive, they can be reprogrammed easily and they open up whole new range of possibilities when it comes to Internet of things. This thesis describes development of a program that can sample music from the computer's microphone input, filter it inside the program with user built filters and reconstruct the music to the computer's headphone output meaning that the music can be played from the speakers. All of this is to happen in real time. The program is developed for students studying at the department of ``Signals and Systems" and the program is supposed the be one of the educational tools to make sense of signals and filtering. The program works well and filters the sound with satisfying results. It is easy to create filters and filter the signal. Since it is music that is filtered constructing perfect filters with minimum ripple, minimum or linear phase is quite difficult to achieve. The program could be improved by improving the user interface, making the environment more interactive and less difficult to construct good filters. Some improvements could also be made to the implementation; as of now the program might run a bit slow on startup on slower computers.

The primary intention of this paper was to visually compare film trailers without considering semantic information, through use of a self-developed Matlab program, resembling that of human perception. Circa 150 people participated in an online survey where they were shown two film trailers and asked to rate their visual similarities. The result from the program was weighted against the survey results in such a way that the weights corresponded to a 75% accuracy between the program’s and the participant’s (for participants with prior experience in the field of photography and/or film) comparisons. How accurate can we compare still images from film trailers, and find similar trailers for the human viewer, by analyzing saturation, color tone, contrast and lightness with a self-developed Matlab program.
Syftet med undersökningen var att jämföra filmtrailers visuella element, bortsett från semantiskt innehåll, med hjälp av ett egenutvecklat Matlabprogram, likt den mänskliga perceptionen. En undersökning, med cirka 150 deltagare, gjordes via internet där deltagare fick se på två filmtrailers (utav 13 möjliga trailerpar) och gradera dess visuella likhet/olikhet.  Resultatet från programmet viktades sedan mot enkätsvaren sådant att viktningen gav en 75% likhet mellan programmets och deltagarnas (för deltagare med tidigare erfarenhet av foto och film) jämförelser. Det vill säga i tre av fyra fall kunde vårat program hitta samma likhet/olikhet i filmtrailerparet. Hur väl kan vi med programmet Matlab jämföra stillbilder från filmtrailers utifrån färgmättnad, färgton, kontrast, och ljushet, och därmed hitta (för åskådaren) visuellt liknande trailers?

The high-level array programming language MATLAB is widely used for prototyping algorithms and applications of scientific computations. However, its dynamically-typed nature, which means that MATLAB programs are usually executed via an interpreter, leads to poor performance. An alternative approach would be converting MATLAB programs to equivalent Fortran 95 programs. The resulting programs could be compiled using existing high-performance Fortran compilers and thus could provide better performance. This thesis presents techniques that are developed for our MATLAB-to-Fortran compiler, McFor, for extracting information from the high-level semantics of MATLAB programs to produce efficient and reusable Fortran code.
The McFor compiler includes new type inference techniques for inferring intrinsic type and shape of variables and uses a value-propagation analysis to precisely estimate the sizes of arrays and to eliminate unnecessary array bounds checks and dynamic reallocations. In addition to the techniques for reducing execution overhead, McFor also aims to produce programmer-friendly Fortran code. By utilizing Fortran 95 features, the compiler generates Fortran code that keeps the original program structure and preserves the same function declarations.
We implemented the McFor system and experimented with a set of benchmarks with different kinds of computations. The results show that the compiled Fortran programs perform better than corresponding MATLAB executions, with speedups ranging from 1.16 to 102, depending on the characteristics of the program.
Le langage de programmation de tableaux de haut niveau MATLAB est largement utilisé afin de faire du prototypage d'algorithmes et des applications de calculs scientifiques. Cependant, sa nature de type dynamique, ce qui veut dire que les programmes MATLAB sont habituellement exécutés par un interpréteur, amène une mauvaise performance. Une approche alternative serait de convertir les programmes MATLAB aux programmes Fortran 95 équivalents. Les programmes résultants pourraient être compilés en utilisant les compilateurs de haute performance Fortran, ainsi ils peuvent fournir une meilleure performance. Cette thèse présente les techniques qui sont développées pour notre compilateur MATLAB-à-Fortran, McFor, pour extraire l'information des hauts niveaux des sémantiques des programmes MATLAB afin de produire un code Fortran efficace et réutilisable.
Le compilateur McFor inclut de nouvelles techniques de déduction pour inférer les types et formes intrinsèques des variables et utilise une analyse à propagation de valeurs pour estimer avec précision la tailles des tableaux de variables et pour éliminer les vérifications des limites et les réallocations dynamiques superflues de ces tableaux. En plus de ces techniques de réduction des temps d'exécution, McFor vise aussi a génèrer du code Fortran convivial pour les développeurs. En utilisant les avantages de Fortran 95, le compilateur génère du code Fortran qui préserve la structure originale du programme ainsi que les mêmes déclarations de fonctions.
Nous avons mis en oeuvre le système McFor et l'avons expérimenté avec un ensemble de tests de performance avec différentes sortes de calculs. Les résultats montrent que les programmes de Fortran compilés offrent une meilleure performance que les exécutions MATLAB correspondantes, avec une cadence accélérée de l'ordre de 1.16 à 102, selon les caractéristiques du programme.

MATLAB is a dynamic numerical scripting language widely used by scientists, engineers and students. While MATLAB's high-level syntax and dynamic types make it ideal for fast prototyping, programmers often prefer using high-performance static languages such as FORTRAN for their final distribution. Rather than rewriting the code by hand, our solution is to provide a source-to-source compiler that translates the original MATLAB program to an equivalent FORTRAN program.In this thesis, we introduce MC2FOR, a source-to-source compiler which transforms MATLAB to FORTRAN and handles several important challenges during the transformation, such as efficiently estimating the static type characteristics of all the variables in a given MATLAB program, mapping numerous MATLAB built-in functions to FORTRAN, and correctly supporting some MATLAB dynamic features in the generated FORTRAN code.This compiler consists of two major parts. The first part is an interprocedural analysis component to estimate the static type characteristics, such as the shapes of the arrays and the ranges of the scalars, which are used to generate variable declarations and to remove unnecessary array bounds checking in the translated FORTRAN program. The second part is an extensible FORTRAN code generation framework automatically transforming MATLAB constructs to equivalent FORTRAN constructs.This work has been implemented within the McLab framework, and we evaluated the performance of the MC2FOR compiler on a collection of 20 MATLAB benchmarks. For most of the benchmarks, the generated FORTRAN program runs 1.2 to 337 times faster than the original MATLAB program, and in terms of physical lines of code, typically grows only by a factor of around 2. These experimental results show that the code generated by MC2FOR performs better on average, at the cost of only a modest increase in code size.
MATLAB est un langage de script dynamique très utilisé par les scientifiques, les ingénieurs et les étudiants. La syntaxe de haut niveau et le typage dynamique de MATLAB en font un langage idéal pour faire du prototypage rapide, mais les programmeurs préfèrent souvent utiliser des langages statiques performants comme FORTRAN pour la distribution finale. Au lieu de réécrire le code à la main, notre solution est de proposer un compilateur qui traduit le programme MATLAB original vers un program FORTRAN équivalent.Dans cette thèse, nous introduisons MC2FOR, un compilateur qui transforme MATLAB vers FORTRAN et surmonte plusieurs difficultés importantes rencontrées durant la transformation, dont celles d'estimer efficacement le type statique de toutes les variables dans un programme MATLAB donné, de trouver une correspondance pour les nombreuses fonctions intégrées de MATLAB vers FORTRAN et de supporter correctement quelques caractéristiques dynamiques de MATLAB dans le code FORTRAN généré.Le compilateur est constitué de deux parties majeures: la première partie est une analyse interprocédurale qui estime des caractéristiques du type statique, comme la forme des tableaux et les limites des scalaires, qui sont utlilisées pour générer des déclarations de variables et pour supprimer les vérifications de limite de tableaux inutiles dans le programme FORTRAN généré. La deuxième partie est un framework de génération de code extensible qui transforment utomatiquement des constructions de MATLAB vers des constructions de FORTRAN équivalentes.Ce travail a été implementé dans le framework McLab, et nous avons évalué les performances du compilateur MC2FOR sur une collection de 20 programmes MATLAB. Pour la plupart des programmes, le programme FORTRAN généré s'éxécute entre 1.2 et 337 fois plus rapidement que le programme MATLAB original, et en termes de lignes de code, grandit seulement par un facteur de deux. Ces résultats expérimentaux démontrent que MC2FOR est en mesure de générer du code qui performe mieux en moyenne que l'original sans pour autant augmenter de trop sa taille.

Matlab is a proprietary, interactive, dynamically-typed language for technical computing. It is widely used for prototyping algorithms and applications of scientific computations. Since it is a dynamically typed language, the execution of programs has to be analyzed and interpreted which results in lower computational performance. In order to increase the performance and integrate with Modelica applications it is useful to be able to translate Matlab programs to statically typed Modelica programs. This project presents the design and implementation of Matlab to Modelica translator. The Lexical and Syntax analysis is done with the help of the OMCCp (OpenModelica Compiler Compiler parser generator) tool which generates the Matlab AST, which is later used by the translator for generating readable and reusable Modelica code.

En el primer capítulo se explica la importancia del sistema CDMA en el desarrollo de los futuros sistemas celulares y el motivo del desarrollo de esta tesis. En el segundo capítulo se explica la evolución de la tecnología celular, en la cual fueron apareciendo diferentes tecnologías, las cuales ofrecían mejores prestaciones para el usuario final. En el tercer capítulo se describen todas las técnicas de acceso múltiple empleados por los diversos sistemas de comunicación. En el cuarto capítulo se desarrolla el cálculo de las pérdidas en el trayecto; de tal manera que con este cálculo se puede encontrar la cobertura de la señal. Además, se explican algunos modelos utilizados en la práctica tales como Okumura, Hata y Link Budget. También define algunos conceptos útiles para este capítulo y por último se muestra las bandas asignadas en Perú. En el quinto capitulo se explican los temas relacionados con el estándar IS-95, la cual engloba diferentes técnicas para procesar la señal; los conceptos para entender el funcionamiento y los canales que posee en los dos sentidos downlink & uplink. En el sexto capítulo se desarrollan los diagramas de flujo del programa principal y los subprogramas. Los subprogramas ayudan a organizar las tareas de cada una de las técnicas utilizadas simular el estándar, de tal manera que el programa principal haga uso de los subprogramas para el procesamiento de la señal. Adicionalmente, en este capítulo se explica las perdidas de datos en la codificación de la voz, la clave de la técnica del CDMA con ayuda de la correlación de las secuencias pseudoaleatorias y por último un manual, donde explica cómo se debe usar el programa. En el séptimo y octavo capítulo se presentan las observaciones y recomendaciones que se observaron durante el desarrollo del trabajo de tesis. En el noveno capítulo se dan las referencias bibliográficas utilizadas para el desarrollo de la tesis, cabe destacar que la mayor fuente de información fue Internet. Al final de la tesis se muestra un pequeño glosario de las palabras técnicas empleadas en la tesis.
Tesis

Thesis (S.B. M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
Includes bibliographical references (leaves 30-31).
by Jeremy Sawicki.
S.B.M.Eng.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
Includes bibliographical references (p. 36).
by Tanmaya Shubham Bhatnagar.
M.Eng.

Large data sets are required to store all of the information contained in option chains. The data set we work with includes all U.S. exchange traded put and call options. This data set is part of a larger data set commonly referred to as the National Best Bid Offer (NBBO) data set. The national bid best offer is a Securities and Exchange Commission (SEC) term for the best available ask price and bid price. Brokers must guarantee investors these prices on their trades. We have acquired data for the 5 year period from 2005 to 2009 for all U.S. traded options. Each year of data is approximately 6 gigabytes. The company, (DeltaNeutral - Options Data And End Of Day Downloads, 2010), from which we acquired the data, also has a software package, OptimalTrader, to process the data. For this data to be used in research projects, the data must be accessible by specific underlying security for selected date ranges. This type of data is more useful to the financial mathematics student than the output given by the software provided by DeltaNeutral. The software used in this data manipulation is Matlab. Each individual file of original data was parsed, and new files were written with some reformatting in which the original data was largely reorganized. The new organization will make searching for information from one stock or any specific group of stocks easier to achieve. We have created 3 m-files in Matlab which deal with reformatting the data, error handling, and searching through the original or reformatted data. The result is that new datasets can be created for further studying and manipulation. Future students working with this data should find this method, toolset, and the newly constructed datasets to be useful tools in working with options data and examining option chains.