Dissertations / Theses on the topic 'Matrix array'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Matrix array.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Rashedin, Razib. "Novel miniature matrix array transducer system for loudspeakers." Thesis, Cardiff University, 2007. http://orca.cf.ac.uk/56177/.
Full textLe, Hai Van Dinh. "A new general purpose systolic array for matrix computations." PDXScholar, 1988. https://pdxscholar.library.pdx.edu/open_access_etds/3796.
Full textHanson, Timothy B. "Cascade adaptive array structures." Ohio : Ohio University, 1990. http://www.ohiolink.edu/etd/view.cgi?ohiou1173207031.
Full textLIU, HUAZHOU. "DIGITAL DIRECTION FINDING SYSTEM DESIGN AND ANALYSIS." University of Cincinnati / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1060976413.
Full textQuintero, Badillo Jorge R. "Non-destructive Evaluation of Ceramic Matrix Composites at High Temperature using Laser Ultrasonics." University of Cincinnati / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1511800640467908.
Full textLepkowski, Stefan. "An ultra-compact and low loss passive beamforming network integrated on chip with off chip linear array." Thesis, Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/53599.
Full textPark, Edward S. "Microfluidic chamber arrays for testing cellular responses to soluble-matrix and gradient signals." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/39471.
Full textLiu, Yuanli. "Development of Cross-reactive Sensors Array: Practical Approach for Ion Detection in Aqueous Media." Bowling Green State University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1345428697.
Full textDiarra, Bakary. "Study and optimization of 2D matrix arrays for 3D ultrasound imaging." Thesis, Lyon 1, 2013. http://www.theses.fr/2013LYO10165/document.
Full text3D Ultrasound imaging is a fast-growing medical imaging modality. In addition to its numerous advantages (low cost, non-ionizing beam, portability) it allows to represent the anatomical structures in their natural form that is always three-dimensional. The relativelyslow mechanical scanning probes tend to be replaced by two-dimensional matrix arrays that are an extension in both lateral and elevation directions of the conventional 1D probe. This2D positioning of the elements allows the ultrasonic beam steering in the whole space. Usually, the piezoelectric elements of a 2D array probe are aligned on a regular grid and spaced out of a distance (the pitch) subject to the space sampling law (inter-element distancemust be shorter than a mid-wavelength) to limit the impact of grating lobes. This physical constraint leads to a multitude of small elements. The equivalent in 2D of a 1D probe of 128elements contains 128x128 = 16,384 elements. Connecting such a high number of elements is a real technical challenge as the number of channels in current ultrasound scanners rarely exceeds 256. The proposed solutions to control this type of probe implement multiplexing or elements number reduction techniques, generally using random selection approaches (« spars earray »). These methods suffer from low signal to noise ratio due to the energy loss linked to the small number of active elements. In order to limit the loss of performance, optimization remains the best solution. The first contribution of this thesis is an extension of the « sparse array » technique combined with an optimization method based on the simulated annealing algorithm. The proposed optimization reduces the required active element number according to the expected characteristics of the ultrasound beam and permits limiting the energy loss compared to the initial dense array probe.The second contribution is a completely new approach adopting a non-grid positioningof the elements to remove the grating lobes and to overstep the spatial sampling constraint. This new strategy allows the use of larger elements leading to a small number of necessaryelements for the same probe surface. The active surface of the array is maximized, whichresults in a greater output energy and thus a higher sensitivity. It also allows a greater scansector as the grating lobes are very small relative to the main lobe. The random choice of the position of the elements and their apodization (or weighting coefficient) is optimized by the simulated annealing.The proposed methods are systematically compared to the dense array by performing simulations under realistic conditions. These simulations show a real potential of the developed techniques for 3D imaging.A 2D probe of 8x24 = 192 elements was manufactured by Vermon (Vermon SA, Tours,France) to test the proposed methods in an experimental setting. The comparison between simulation and experimental results validate the proposed methods and prove their feasibility
L'ecografia 3D è una modalità di imaging medicale in rapida crescita. Oltre ai vantaggiin termini di prezzo basso, fascio non ionizzante, portabilità, essa permette di rappresentare le strutture anatomiche nella loro forma naturale, che è sempre tridimensionale. Le sonde ascansione meccanica, relativamente lente, tendono ad essere sostituite da quelle bidimensionali che sono una estensione in entrambe le direzioni laterale ed azimutale dellasonda convenzionale 1D. Questo posizionamento 2D degli elementi permette l'orientamentodel fascio ultrasonico in tutto lo spazio. Solitamente, gli elementi piezoelettrici di una sondamatriciale 2D sono allineati su una griglia regolare e separati da una distanza (detta “pitch”) sottoposta alla legge del campionamento spaziale (la distanza inter-elemento deve esseremeno della metà della lunghezza d'onda) per limitare l'impatto dei lobi di rete. Questo vincolo fisico porta ad una moltitudine di piccoli elementi. L'equivalente di una sonda 1D di128 elementi contiene 128x128 = 16.384 elementi in 2D. Il collegamento di un così grandenumero di elementi è una vera sfida tecnica, considerando che il numero di canali negliecografi attuali supera raramente 256. Le soluzioni proposte per controllare questo tipo disonda implementano le tecniche di multiplazione o la riduzione del numero di elementi, utilizzando un metodo di selezione casuale (« sparse array »). Questi metodi soffrono di unbasso rapporto segnale-rumore dovuto alla perdita di energia. Per limitare la perdita di prestazioni, l’ottimizzazione rimane la soluzione migliore. Il primo contributo di questa tesi è un’estensione del metodo dello « sparse array » combinato con un metodo di ottimizzazione basato sull'algoritmo del simulated annealing. Questa ottimizzazione riduce il numero degli elementi attivi richiesto secondo le caratteristiche attese del fascio di ultrasuoni e permette di limitare la perdita di energia.Il secondo contributo è un approccio completamente nuovo, che propone di adottare un posizionamento fuori-griglia degli elementi per rimuovere i lobi secondari e per scavalcare il vincolo del campionamento spaziale. Questa nuova strategia permette l'uso di elementi piùgrandi, riducendo così il numero di elementi necessari per la stessa superficie della sonda. La superficie attiva della sonda è massimizzata, questo si traduce in una maggiore energia equindi una maggiore sensibilità. Questo permette inoltre la scansione di un più grande settore,in quanto i lobi secondari sono molto piccoli rispetto al lobo principale. La scelta casualedella posizione degli elementi e la loro apodizzazione viene ottimizzata dal simulate dannealing. I metodi proposti sono stati sistematicamente confrontati con la sonda completaeseguendo simulazioni in condizioni realistiche. Le simulazioni mostrano un reale potenzialedelle tecniche sviluppate per l'imaging 3D.Una sonda 2D di 8x24 = 192 elementi è stata fabbricata da Vermon (Vermon SA, ToursFrance) per testare i metodi proposti in un ambiente sperimentale. Il confronto tra lesimulazioni e i risultati sperimentali ha permesso di convalidare i metodi proposti edimostrare la loro fattibilità
Ozer, Erhan. "Application of the T-matrix method to the numerical modeling of a linear active sonar array." Monterey, California: Naval Postgraduate School, 2013. http://hdl.handle.net/10945/34718.
Full textClassically, the T-matrix method is a procedure to exactly compute the multiple scattering of an incident wave from a “cloud” of objects, given knowledge of the free-field scattering properties of a single object for an arbitrary incident wave. For acoustic waves, Profs. Baker and Scandrett have extended the T-matrix method to the case in which the radiation sources are also the scatterers, that is, to the case of an array of active transducers. This thesis is the first successful practical demonstration of the T-matrix method applied to an active sonar array for which a finite-element model was employed to compute the scattering properties of a single transducer. For validation, a T-matrix model of a linear array of piezoelectric spherical thin-shell transducers was modeled, for which analytical approximate values of the T-matrix element values are known. Subsequently, a T-matrix model of a linear array of piezoelectric class V flextensional “ring-shell” transducers was modeled. Beam patterns of the linear array models computed with the T-matrix method are compared with those of an array of point sources, demonstrating that the T-matrix method produces more realistic beam patterns, especially for end fire arrays.
Baiotto, Ricardo. "Imaging methodologies applied on phased array ultrasonic data from austenitic welds and claddings." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2018. http://hdl.handle.net/10183/186162.
Full textThe increasing trend to use austenitic welded and cladded materials in critical components employed in some industrial sectors, such as the oil&gas and nuclear industries, leads to an increasing demand for their non-destructive assessment by reliable non-destructive methods. Among the methods used to access the integrity of austenitic welds and claddings are the Ultrasonic Phased Array methods, which are usually used to detect the presence and determine the position of defects. However, austenitic welds and claddings are challenging to inspect with Phased Array methods due to the anisotropy and inhomogeneity caused by their coarse grain microstructure, which is capable of increasing noise levels, misplace indications and create false indications. Therefore, the selection of an appropriate phased array method needs to take into account the method’s ability to overcome the impairment caused by anisotropy and inhomogeneity. This thesis presents two non-conventional methods based on ultrasonic phased array imaging techniques designed to assist the structural integrity assessment of components where austenitic welds and clads are present. Both proposed methods are based on the Total Focusing Method (TFM); the first approach is an expansion of the adaptive delay laws concept named Adaptive Delay Total Focusing Method (ADTFM), while the second method uses the coherence weights combined with the TFM images. From the imaging methods applied it was possible to significantly increase the quality of the ultrasonic images in comparison with the standard TFM, primarily when it was possible to combine both approaches.
Herrero, Zaragoza Jose Ramón. "A framework for efficient execution of matrix computations." Doctoral thesis, Universitat Politècnica de Catalunya, 2006. http://hdl.handle.net/10803/5991.
Full textWe study some important operations which appear in the solution of real world problems: some sparse and dense linear algebra codes and a classification algorithm. In particular, we focus our attention on the efficient execution of the following operations: sparse Cholesky factorization; dense matrix multiplication; dense Cholesky factorization; and Nearest Neighbor Classification.
A lot of research has been conducted on the efficient parallelization of numerical algorithms. However, the efficiency of a parallel algorithm depends ultimately on the performance obtained from the computations performed on each node. The work presented in this thesis focuses on the sequential execution on a single processor.
There exists a number of data structures for sparse computations which can be used in order to avoid the storage of and computation on zero elements. We work with a hierarchical data structure known as hypermatrix. A matrix is subdivided recursively an arbitrary number of times. Several pointer matrices are used to store the location of
submatrices at each level. The last level consists of data submatrices which are dealt with as dense submatrices. When the block size of this dense submatrices is small, the number of zeros can be greatly reduced. However, the performance obtained from BLAS3 routines drops heavily. Consequently, there is a trade-off in the size of data submatrices used for a sparse Cholesky factorization with the hypermatrix scheme. Our goal is that of reducing the overhead introduced by the unnecessary operation on zeros when a hypermatrix data structure is used to produce a sparse Cholesky factorization. In this work we study several techniques for reducing such overhead in order to obtain high performance.
One of our goals is the creation of codes which work efficiently on different platforms when operating on dense matrices. To obtain high performance, the resources offered by the CPU must be properly utilized. At the same time, the memory hierarchy must be exploited to tolerate increasing memory latencies. To achieve the former, we produce inner kernels which use the CPU very efficiently. To achieve the latter, we investigate nonlinear data layouts. Such data formats can contribute to the effective use of the memory system.
The use of highly optimized inner kernels is of paramount importance for obtaining efficient numerical algorithms. Often, such kernels are created by hand. However, we want to create efficient inner kernels for a variety of processors using a general approach and avoiding hand-made codification in assembly language. In this work, we present an alternative way to produce efficient kernels automatically, based on a set of simple codes written in a high level language, which can be parameterized at compilation time. The advantage of our method lies in the ability to generate very efficient inner kernels by means of a good compiler. Working on regular codes for small matrices most of the compilers we used in different platforms were creating very efficient inner kernels for matrix multiplication. Using the resulting kernels we have been able to produce high performance sparse and dense linear algebra codes on a variety of platforms.
In this work we also show that techniques used in linear algebra codes can be useful in other fields. We present the work we have done in the optimization of the Nearest Neighbor classification focusing on the speed of the classification process.
Tuning several codes for different problems and machines can become a heavy and unbearable task. For this reason we have developed an environment for development and automatic benchmarking of codes which is presented in this thesis.
As a practical result of this work, we have been able to create efficient codes for several matrix operations on a variety of platforms. Our codes are highly competitive with other state-of-art codes for some problems.
Kapkar, Rohan Viren. "Modeling and Simulation of Altera Logic Array Block using Quantum-Dot Cellular Automata." University of Toledo / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1304616947.
Full textFinnell, Jordan Grant. "Anthrax, Matrix Biology, and Angiogenesis: Capillary Morphogenesis Gene 2 Mediates Activity and Uptake of Type IV Collagen-Derived Anti-Angiogenic Peptides." BYU ScholarsArchive, 2017. https://scholarsarchive.byu.edu/etd/6849.
Full textFaye, Clément. "Le réseau d'interactions de l'endostatine, une matricryptine du collagène XVIII." Thesis, Lyon 1, 2009. http://www.theses.fr/2009LYO10176.
Full textEndostatin is the carboxyl-terminal fragment of collagen XVIII released in the extracellular matrix by proteolytic cleavage. It inhibits angiogenesis and tumor growth. Endostatin inhibits the proliferation and migration of endothelial cells induced by Fibroblast Growth Factor-2 and Vascular Endothelial Growth Factor and it inhibits 65 different tumor types. Endostatin is currently under clinical trials for several tumors. We have used surface plasmon resonance (SPR) binding assays to characterize interactions between endostatin and α5β1 or αvβ3 integrins which are over-expressed at cell surface of actived endothelial cell. We have identified the binding site of endostatin on those integrins, and we have built a molecular modeling of the endostatin/integrin αvβ3 complex. We have shown that endostatin can not bind simultaneously to integrins and to heparan sulfate. In order to identify new partners of endostatin we have developed glycosaminoglycan and protein arrays based on SPR detection. We have found nine new partners of endostatin include glycosaminoglycans (chondroitin and dermatan sulfate), matricellular proteins (thrombospondin-1 and SPARC), collagens (I, IV and VI), the amyloid peptide Aβ(1-42), and transglutaminase-2 (TG-2). We have shown that endostatin binds to transglutaminase-2 with an high affinity (KD ~ 6 nM) in a calcium-dependent manner. Enzymatic assays indicated that, in contrast to other extracellular matrix proteins, endostatin is not a glutaminyl substrate of TG-2, but would rather be an acyl acceptor. The endostatin network comprises a number of extracellular proteins containing EGF domains (Epidermal Growth Factor), and able to bind calcium. Depending on the trigger event, and on the availability of its members in a given tissue at a given time, the endostatin network might be involved either in the control of angiogenesis, and tumor growth, or in neurogenesis and neurodegenerative diseases
Wan, Chunru. "Systolic algorithms and applications." Thesis, Loughborough University, 1996. https://dspace.lboro.ac.uk/2134/10479.
Full textLeclerc, Céline. "Étude et conception de matrices d'alimentation multifaisceaux pour réseaux à rayonnement direct ou dans le plan focal d'un réflecteur." Phd thesis, Toulouse, INPT, 2013. http://oatao.univ-toulouse.fr/10907/1/leclerc.pdf.
Full textAhmed, Mamun. "Adaptive Sub band GSC Beam forming using Linear Microphone-Array for Noise Reduction/Speech Enhancement." Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-6174.
Full textMamun Ahmed E-mail: mamuncse99cuet@yahoo.com
de, Sousa Emma Louise. "The use of novel xenografting methods to reveal differential gene expression between breast cancer at primary and metastatic sites." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:20c957a8-68c7-43f1-b0f6-722ae71dfb5a.
Full textMcPhillips, Kenneth J. "Far field shallow water horizontal wave number estimation given a linear towed array using fast maximum likelihood, matrix pencil, and subspace fitting techniques /." View online ; access limited to URI, 2007. http://0-digitalcommons.uri.edu.helin.uri.edu/dissertations/AAI3276997.
Full textPALMER, LUKE A. "DIVINUS TEMPUS: II. CHRISTMAS." University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1091043457.
Full textMiller, William H. "Analog Implementation of DVM and Farrow Filter Based Beamforming Algorithms for Audio Frequencies." University of Akron / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=akron1531951902410037.
Full textSpalt, Taylor Brooke. "Constrained Spectral Conditioning for the Spatial Mapping of Sound." Diss., Virginia Tech, 2014. http://hdl.handle.net/10919/70868.
Full textPh. D.
Prokš, Jiří. "Zákaznicky upravitelný modul zadní skupinové svítilny s HD rozlišením." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2017. http://www.nusl.cz/ntk/nusl-318409.
Full textKrejčíř, Dominik. "Anténa s řiditelným svazkem." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2021. http://www.nusl.cz/ntk/nusl-442413.
Full textLundström, Tomas. "Matched Field Beamforming applied to Sonar Data." Thesis, Linköping University, Department of Electrical Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-16338.
Full textTwo methods for evaluating and improving plane wave beamforming have beendeveloped. The methods estimate the shape of the wavefront and use theinformation in the beamforming. One of the methods uses estimates of the timedelays between the sensors to approximate the shape of the wavefront, and theother estimates the wavefront by matching the received wavefront to sphericalwavefronts of different radii. The methods are compared to a third more commonmethod of beamforming, which assumes that the impinging wave is planar. Themethods’ passive ranging abilities are also evaluated, and compared to a referencemethod based on triangulation.Both methods were evaluated with both real and simulated data. The simulateddata was obtained using Raylab, which is a simulation program based on ray-tracing. The real data was obtained through a field-test performed in the Balticsea using a towed array sonar and a stationary source emitted tones.The performance of the matched beamformers depends on the distance to the tar-get. At a distance of 600 m near broadside the power received by the beamformerincreases by 0.5-1 dB compared to the plane wave beamformer. At a distance of300 m near broadside the improvement is approximately 2 dB. In general, obtain-ing an accurate distance estimation proved to be difficult, and highly dependenton the noise present in the environment. A moving target at a distance of 600 mat broadside can be estimated with a maximum error of 150 m, when recursiveupdating of the covariance matrix with a updating constant of 0.25 is used. Whenrecursive updating is not used the margin of error increases to 400 m.
Cardell, Sara D. "Constructions of MDS codes over extension alphabets." Doctoral thesis, Universidad de Alicante, 2012. http://hdl.handle.net/10045/27320.
Full textWeiser, Armin. "Amino acid substitutions in protein binding." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät I, 2009. http://dx.doi.org/10.18452/15962.
Full textA central task of the evolutionary process is the alteration of amino acid sequences, such as the substitution of one amino acid by another. Not only do these amino acid changes occur gradually over large time scales and result in the variety of life surrounding us, but they also happen daily within an organism. Such alterations take place rapidly for the purposes of defense, which in higher vertebrates, is managed by the humoral immune system. For an effective immune response, antibodies are subjected to a micro-evolutionary process that includes multiple rounds of diversification by somatic hypermutation resulting in increased binding affinity to a particular pathogen. The goal of this work was to provide insights into the microevolution of antibodies during the immune response, including the relationship between amino acid substitutions and binding affinity changes. A preliminary step in this work was to determine the accuracy of the SPOT synthesis technique, which could be shown to be an accurate method for assigning measured signal intensities to three different binding affinity classes. A substitution matrix based on data produced with these binding experiments was constructed and named AFFI. AFFI is the first substitution matrix that is based solely on binding affinity. A theoretical approach has additionally revealed that an AFFI-derived reduced set of amino acids constitutes an optimal basis for epitope searching. For the process of somatic hypermutation and selection, a novel approach to identify mutations relevant to affinity maturation was presented. The analysis revealed that the spectrum of mutations favored by the selection process is much broader than previously thought. The fact that particular silent mutations are strongly favored indicates either that intrinsic mutability has been grossly underestimated, or that selection acts not only on antibody affinity but also on their expression rates.
Haider, Shahid Abbas. "Systolic arrays for the matrix iterative methods." Thesis, Loughborough University, 1993. https://dspace.lboro.ac.uk/2134/28173.
Full textWirfält, Petter. "Exploiting Prior Information in Parametric Estimation Problems for Multi-Channel Signal Processing Applications." Doctoral thesis, KTH, Signalbehandling, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-134034.
Full textDenna doktorsavhandling behandlar parameterestimeringsproblem inom flerkanals-signalbehandling. Den gemensamma förutsättningen för dessa problem är att det finns information om de sökta parametrarna redan innan data analyseras; tanken är att på ett så finurligt sätt som möjligt använda denna kunskap för att förbättra skattningarna av de okända parametrarna. I en uppsats studeras kovariansmatrisskattning när det är känt att den sanna kovariansmatrisen har Kronecker- och Toeplitz-struktur. Baserat på denna kunskap utvecklar vi en metod som säkerställer att även skattningarna har denna struktur, och vi kan visa att den föreslagna skattaren har bättre prestanda än existerande metoder. Vi kan också visa att skattarens varians når Cram\'er-Rao-gränsen (CRB). Vi studerar vidare olika sorters förhandskunskap i riktningsbestämningsscenariot: först i det fall då riktningarna till ett antal av sändarna är kända. Sedan undersöker vi fallet då vi även vet något om kovariansen mellan de mottagna signalerna, nämligen att vissa (eller alla) signaler är okorrelerade. Det visar sig att just kombinationen av förkunskap om både korrelation och riktning är speciellt betydelsefull, och genom att utnyttja denna kunskap på rätt sätt kan vi skapa skattare som är mycket noggrannare än tidigare möjligt. Vi härleder även CRB för fall med denna förhandskunskap, och vi kan visa att de föreslagna skattarna är effektiva. Slutligen behandlar vi även frekvensskattning. I detta problem är data en en-dimensionell temporal sekvens som vi modellerar som en spatiell fler-kanalssignal. Fördelen med denna modelleringsstrategi är att vi kan använda liknande metoder i estimatorerna som vid sensor-signalbehandlingsproblemen. Vi utnyttjar återigen förhandskunskap om källsignalerna: i ett av bidragen är antagandet att vissa frekvenser är kända, och vi modifierar en existerande metod för att ta hänsyn till denna kunskap. Genom att tillämpa den föreslagna metoden på experimentell data visar vi metodens användbarhet. Det andra bidraget inom detta område studerar data som erhålls från exempelvis experiment inom kärnmagnetisk resonans. Vi introducerar en ny modelleringsmetod för sådan data och utvecklar en algoritm för att skatta de önskade parametrarna i denna modell. Vår algoritm är betydligt snabbare än existerande metoder, och skattningarna är tillräckligt noggranna för typiska tillämpningar.
QC 20131115
Mahmud, Rashad Hassan. "Synthesis of waveguide antenna arrays using the coupling matrix approach." Thesis, University of Birmingham, 2016. http://etheses.bham.ac.uk//id/eprint/6564/.
Full textOsman, Ahmad. "Automated evaluation of three dimensional ultrasonic datasets." Phd thesis, INSA de Lyon, 2013. http://tel.archives-ouvertes.fr/tel-00995119.
Full textLiu, Peng. "Joint Estimation and Calibration for Motion Sensor." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-286839.
Full textI denna rapport utvecklas och implementeras en kalibreringsmethod för att skatta positionen för en grupp av accelerometrar placerade i en så kallad IMU sensor array. För att beskriva rörelsen för hela sensorgruppen, härleds en dynamisk tillståndsmodell. Problemställningen är då att skatta parametrarna i tillståndsmodellen. Detta löses med hjälp av Maximum Likelihood-metoden (ML) där två stycken algoritmer implementeras och analyseras. En baseras på Expectation Maximization (EM) och i den andra optimeras kostnadsfunktionen direkt med gradientsökning. I EM-algoritmen uppstår ett illa konditionerat delproblem i M-steget, vilket försämrar algoritmens prestanda, speciellt när det initiala felet är litet. Den resulterande MSE-kurvan kommer att avvika i detta fall. Däremot fungerar EM-algoritmen väl när antalet datasampel är tillräckligt och det initiala felet är större. I gradientsökningsmetoden undviks konditioneringsproblemen med hjälp av en omformulering. Slutligen analyseras medelkvadratfelet (MSE) för parameterskattningarna med hjälp av Monte Carlo-simulering. De resulterande MSE-kurvorna visar att gradientsökningsmetoden är mer robust mot numeriska problem, speciellt när det initiala felet är litet. Simuleringarna visar även att gradientsökning är robust mot brus.
Bárta, Jakub. "Implementace tvarování anténních příjmových svazků radaru v FPGA." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2019. http://www.nusl.cz/ntk/nusl-400718.
Full textTekkouk, Karim. "Développement d'antennes multi-faisceaux multicouches de la bande Ku à la bande V." Thesis, Rennes 1, 2014. http://www.theses.fr/2014REN1S165.
Full textThis PhD thesis deals with the design of multi-beam antennas. A single radiating aperture is used to generate several beams with high gain and a large field of view. The multi beam operation is achieved by using two topologies of Beam Forming Networks (BFN): quasi optical BFN, and circuit-based BFN. For each category, several solutions have been proposed and validated experimentally. In particular, for the quasi-optical configurations, pillbox structures, mono-pulse antennas in pillbox technology, and multi-layer Rotman lenses have been considered. On the other hand, for circuit-based multi-beam antennas, two solutions have been analyzed: a phased array for SATCOM applications in the framework of a national ANR project and a Butler matrix with controlled side-lobe levels for the radiated beams within a collaboration with the Tokyo Institute of Technology, Japan. The proposed concepts and antenna solutions have been considered in different frequency bands: Ku, K and V. Two technologies have been mainly adopted for the fabrication of the various prototypes: Substrate Integrated Waveguide technology (SIW) which combines the advantages in terms of cost of the printed circuit board (PCB) fabrication process with the efficiency of classical waveguide technology. Considerable efforts have been devoted to the implementation of multilayer SIW structures to overcome and go beyond the current state of the art at national level on PCB fabrication process. Diffusion Bounding Technique, developed at “Ando and Hirokawa lab” at the Tokyo Institute of Technology, which consists of bonding laminated thin metal plates under high temperature and high pressure. This technique allows the fabrication of planar hollow waveguide structures with efficiencies up to 80% in the millimeter wave-band
Pesik, Lisa Josephine. "Practical investigation of Butler matrix application for beamforming with circular antenna arrays." Thesis, University of Bristol, 2007. http://hdl.handle.net/1983/650cf9d2-e075-4efb-b03d-6b5fa0b5dd67.
Full textKinder, Erich W. "Fabrication of All-Inorganic Optoelectronic Devices Using Matrix Encapsulation of Nanocrystal Arrays." Bowling Green State University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1339719904.
Full textStatzer, Eric L. "Matrix Pencil Method for Direction of Arrival Estimation with Uniform Circular Arrays." University of Cincinnati / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1313427307.
Full textDavall, Rosemarie Anne Regina. "The application of algorithm-based fault tolerance to VLSI processor arrays." Thesis, University of Newcastle Upon Tyne, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.295477.
Full textCombernoux, Alice. "Détection et filtrage rang faible pour le traitement d'antenne utilisant la théorie des matrices aléatoires en grandes dimensions." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLC016/document.
Full textNowadays, more and more applications deal with increasing dimensions. Thus, it seems relevant to exploit the appropriated tools as the random matrix theory in the large dimensional regime. More particularly, in the specific array processing applications as the STAP and MIMO-STAP radar applications, we were interested in the treatment of a signal of interest corrupted by an additive noise composed of a low rang noise and a white Gaussian. Therefore, the aim of this thesis is to study the low rank filtering and detection (function of projectors) in the large dimensional regime for array processing with random matrix theory tools.This thesis has three main contributions in the context of asymptotic analysis of projector functionals. Thus, the large dimensional regime first allows to determine an approximation/prediction of theoretical non asymptotic performance, much more precise than the literature in the classical asymptotic regime (when the number of estimation data tends to infinity at a fixed dimension). Secondly, two new low rank adaptive filters and detectors have been proposed and it has been shown that they have better performance as a function of the system parameters, in terms of SINR loss, false alarm probability and detection probability. Finally, the results have been validated on a jamming application and have been secondly applied to the STAP and sparse MIMO-STAP processings. Hence, the study highlighted a noticeable difference with the jamming application, related to the covariance matrix models concerned by this thesis
Chiniard, Renaud. "Contribution à la modélisation de la surface équivalente radar des grandes antennes réseaux par une approche multi domaine/Floquet." Toulouse 3, 2007. http://www.theses.fr/2007TOU30295.
Full textThis study proposes to treat large array antennas with an original approach. It makes it possible to reach problems whose great dimensions lead traditional and rigorous methods to be unsuccessful. The first part is devoted to the description of the employed methods. The first one is the multi domain method which makes it possible to split in sub domains the initial problem. Each domain is then calculated using the numerical method (integral equations, finite elements,…) adapted. It allows to obtain a condensed operator (S matrix) for each sub domain in an uncoupled way. Once they have been put together with the feeding, the problem can be solved. The main advantage lies in the modular approach which makes it very efficient in parametric studies by re-use of the matrices S of unchanged volumes. We further present the development in Floquet modes, assuming the planar, infinite and periodic hypothesis. It thus makes it possible to reduce the problem to the size of the elementary cell. In the second part, the hybridization of the two methods previously introduced is shown. It is discussed on a rectangular guide array case which, in addition to validating our approach, allows the installation of physical indicators. To enhance our tool, in the next chapter we couple the array to its mechanical support and propose an efficient modelling of this global realistic antenna. The final chapter makes it possible to confront our code with the measurements of one real array antenna. It allows to estimate all the capabilities of the method developed during this study. At the end of this study, a software tool has been developed and it makes it possible to calculate Radar Cross Section of the large antenna arrays inserted in their supports and for various conditions of feeding impedances
Keung, Chi Wing. "Matrix-addressable III-nitride light emitting diode arrays on silicon substrates by flip-chip technology /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?ECE%202007%20KEUNG.
Full textNemchinov, Alexander. "Using Colloidal Nanocrystal Matrix Encapsulation Technique for the Development of Novel Infrared Light Emitting Arrays." Bowling Green State University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1339806993.
Full textMoroz, Pavel. "A Novel Approach for the Fabrication of All-Inorganic Nanocrystal Solids: Semiconductor Matrix Encapsulated Nanocrystal Arrays." Bowling Green State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1435324105.
Full textLobato, Daniel Corrêa. "Proposta de um ambiente de simulação e aprendizado inteligente para RAID." Universidade de São Paulo, 2000. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-26072001-181852/.
Full textThe component with the worst performance usually limits the overall performance of a computing system. The performance of processors and main memory has improved faster than the secondary memory, such as magnetic disks. Johnson, in 1984, introduced the concept of fragmentation, in which a data file is written into a disk array, in a way that its stripes can be recovered in parallel and therefore, in a faster way. The main problem with fragmentation is the reduction of the reliability. If one disk fails, all data file becomes inaccessible. Patterson, Gibson and Katz proposed, in 1988, five ways to store redundant information in the array, increasing the reliability, comprising the main RAID (Redundant Array of Independent Disks) configurations. Some other ways to store the redundant information have been proposed over the years, making the RAID taxonomy more complex. Furthermore, changes in the array parameters takes to performance variations that are not always understood. With the purpose of facilitating the comprehension of the taxonomy and allowing the execution of experiments looking forward to improve performance, this MSc Dissertation proposes an Intelligent Simulation and Learning Environment for RAID, where the user can interact with several RAID models, or even create his/her own models, in order to evaluate their performance under different situations. The environment also allows the user to interact with the knowledge of the area, acting as a tutor. This Dissertation also presents a prototype of a magnetic disk simulator, that can be used as the kernel for the development of a RAID simulator to be used by the environment.
Acquaro, Marcela Conde. "Regra-matriz de incidência tributária do imposto territorial rural." Pontifícia Universidade Católica de São Paulo, 2010. https://tede2.pucsp.br/handle/handle/9107.
Full textThis paper intends to undertake a study of legal standards in our legal system take care of the rural land tax, your institution, regulation, tax collection, among other aspects. For that, at baseline, we established assumptions and concepts, for, after, we dedicate to the topic itself. We decided to make the study of the ITR through rule-array of tax incidence. Thus, we analyzed all the elements contained in the rule-array, the antecedent of its standard criteria material, temporal and spatial, while the consequent, we saw the staff and quantitative criteria. How we treat the test material, we intend to define the scope to be taken to property taxation. At the time criterion, we study the moments of occurrence of the legal fact, and, finally, on the criteria of the antecedent of the rule, we verify the criterion space and its various conflicts, what is meant by urban and rural areas, where the parameters for imposition of property tax or ITR, among other issues. Already in relation to consequent of the norm in the criteria staff, established the subject of the relationship by checking who may appear as a taxpayer's tax liability and asset. No quantitative criterion, we did extensive research to go into current discussions about the exclusions from the calculation basis permitted by law, discussions covering the delivery of the ADA - Declaratory Act Environmental wetlands by hydroelectric plants, among others. Finally, we make our conclusions as to the doctrinal or jurisprudential discussions
O presente trabalho pretende realizar um estudo das normas jurídicas vigentes em nosso sistema jurídico que cuidam do imposto territorial rural, sua instituição, regulamentação, arrecadação, dentre outros aspectos. Para tanto, no início da pesquisa, estabelecemos premissas e conceitos fundamentais, para, após, nos dedicarmos ao tema em si. Decidimos fazer o estudo do ITR por meio da regra-matriz de incidência tributária. Assim, analisamos todos os elementos contidos na regra-matriz, no antecedente da norma seus critérios material, temporal e espacial, enquanto, no consequente, vimos o critério pessoal e quantitativo. Quanto tratamos do critério material, pretendemos delimitar o âmbito que se deve ter para tributação da propriedade. No critério temporal, estudamos os momentos da ocorrência do fato jurídico, e, por fim, quanto aos critérios do antecedente da norma, verificamos o critério espacial e seus diversos conflitos, o que deve ser entendido por zona urbana e zona rural, quais os parâmetros para a tributação do IPTU ou ITR, dentre outras questões. Já no que tange ao consequente da norma no critério pessoal, estabelecemos os sujeitos da relação, verificando quem poderá figurar como sujeito passivo e ativo da obrigação tributária. No critério quantitativo, fizemos um vasto estudo para adentrarmos em discussões atuais quanto às exclusões da base de cálculo permitidas pela legislação, discussões que abrangem a entrega do ADA Ato Declaratório Ambiental, as áreas alagadas pelas usinas hidrelétricas, dentre outros. Por fim, realizamos nossas conclusões quanto às discussões doutrinarias ou jurisprudenciais
Tas, Idir. "Traitement d'antenne passif : détection et identification de sources." Grenoble INPG, 1987. http://www.theses.fr/1987INPG0076.
Full textAktas, Metin. "Online Calibration Of Sensor Arrays Using Higher Order Statistics." Phd thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614054/index.pdf.
Full texter-Rao bound (CRB) for DOA and unknown calibration parameters for non-circular complex Gaussian noise with unknown covariance matrix. Simulation results show that the performances of the proposed methods approach to the CRB for both DOA and unknown calibration parameter estimations for high SNR.
Hütten, Moritz. "Prospects for Galactic dark matter searches with the Cherenkov Telescope Array (CTA)." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät, 2017. http://dx.doi.org/10.18452/17766.
Full textIn the current understanding of structure formation in the Universe, the Milky Way is embedded in a clumpy halo of dark matter (DM). Regions of high DM density are expected to emit enhanced γ-radiation from the DM relic annihilation. This γ-radiation can possibly be detected by γ-ray observatories on Earth, like the forthcoming Cherenkov Telescope Array (CTA). This dissertation presents a semi-analytical density modeling of the subclustered Milky Way DM halo, and the γ-ray intensity at Earth from DM annihilation in Galactic subclumps is calculated for various substructure models. It is shown that the modeling approach is able to reproduce the γ-ray intensities obtained from extensive dynamical DM simulations, and that it is consistent with the DM properties derived from optical observations of dwarf spheroidal galaxies. A systematic confidence margin of plausible γ-ray intensities from Galactic DM annihilation is estimated, encompassing a variety of previous findings. The average distances, masses, and extended emission profiles of the γ-ray-brightest DM clumps are calculated. The DM substructure models are then used to draw reliable predictions for detecting Galactic DM density clumps with CTA, using the most recent benchmark calculations for the performance of the instrument. A Likelihood-based calculation with CTA analysis software is applied to find the instrumental sensitivity to detect the γ-ray-brightest DM clump in the projected CTA extragalactic survey. An alternative Likelihood-based analysis method is developed, to detect DM substructures as anisotropies in the angular power spectrum of the extragalactic survey data. The analyses predict that the CTA extragalactic survey will be able to probe annihilation cross sections of ⟨σv⟩ > 1 × 10−24 cm3 s−1 at the 95% confidence level for a DM particle mass of mχ ∼ 500 GeV from DM annihilation in substructures. This sensitivity is compatible with long-term observations of single dwarf spheroidal galaxies with CTA. Independent of a particular source model, it is found that the CTA extragalactic survey will be able to detect anisotropies in the diffuse γ-ray background above 100 GeV at a relative amplitude of CP_F > 10−2.
Amba, Prakhar. "Learning methods for digital imaging." Thesis, Université Grenoble Alpes (ComUE), 2018. http://www.theses.fr/2018GREAS011/document.
Full textTo produce color images we need information of three primary colors (notably Red, Green and Blue) at each pixel point. To capture this information most digital cameras utilize a Color Filter Array (CFA), i.e. a mosaic arrangement of these colors is overlaid on the sensor such that only one color is sampled at one pixel.This arrangement is similar to the Human Visual System (HVS) wherein a mosaic of LMS cones (for sensitivity to Long, Medium and Short wavelength) forms the surface of the retina. For HVS, the arrangement is random and differs between individuals, whereas for cameras we use a regular arrangement of color filters. For digital cameras one needs to interpolate the missing colors to recover the full color image and this process is known as demosaicing. Due to regular or periodic arrangement of color filters the output demosaiced image is susceptible to false colors and artifacts. In literature, the demosaicing algorithms proposed so far cater mainly to regular CFAs.In this thesis, we propose an algorithm for demosaicing which can be used to demosaic any random or regular CFA by learning statistics of an image database. Further, we optimize and propose CFAs such that they outperform even the state of art algorithms on regular CFAs. At the same time the demosaiced images from proposed CFAs are free from false colors and artifacts.We extend our algorithm such that it is not limited to only three colors but can be used for any random arrangement of any number of spectral filters. Having more than three colors allows us to not only record an image but to record a spectral signature of the scene. These mosaics are known as Spectral Filter Arrays (SFAs). Recent technological advances give us greater flexibility in designing the spectral filters and by demosaicing them we can get more accurate colors and also do estimation of spectral radiance of the scene. We know that silicon is inherently sensitive to Near-Infrared radiation and therefore both Visible and NIR filters can be combined on the same mosaic. This is useful for low light night vision cameras which is a new challenge in digital imaging.We demonstrate the applicability of our algorithm on several state of the art cameras using these novel SFAs. In this thesis, we demonstrate that our method outperforms the state of art algorithms in image quality and computational efficiency. We propose a method to optimize filters and their arrangement such that it gives best results depending on metrics and application chosen.The method based on minimization of mean square error is linear in nature and therefore very fast and suitable for real time applications. Finally to challenge the linear nature of LMMSE we propose a demosaicing algorithm using Neural Networks training on a small database of images which is slightly better than the linear demosaicing however, it is computationally more expensive