Submitted by Paula Akari Fukushima (paula.fukushima@gmail.com) on 2018-06-07T13:24:40Z No. of bitstreams: 1 dissertacao_com_ficha_catalografica.pdf: 734238 bytes, checksum: 7e83c559085d2370c3126bb9787364f8 (MD5) / Rejected by Elza Mitiko Sato null (elzasato@ibilce.unesp.br), reason: Solicitamos que realize correções na submissão seguindo as orientações abaixo: Problema 01) Observamos que no seu arquivo consta o auxílio da Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES), então na Folha de rosto e de aprovação deve constar a financiadora. Lembramos que o arquivo depositado no repositório deve ser igual ao impresso, o rigor com o padrão da Universidade se deve ao fato de que o seu trabalho passará a ser visível mundialmente. Agradecemos a compreensão on 2018-06-08T19:11:31Z (GMT) / Submitted by Paula Akari Fukushima (paula.fukushima@gmail.com) on 2018-06-12T13:25:21Z No. of bitstreams: 1 dissertacao_com_ficha_catalografica.pdf: 734279 bytes, checksum: 7a81403314e3b2da3076407e9672a090 (MD5) / Approved for entry into archive by Elza Mitiko Sato null (elzasato@ibilce.unesp.br) on 2018-06-12T19:15:16Z (GMT) No. of bitstreams: 1 fukushima_pa_me_sjrp.pdf: 734279 bytes, checksum: 7a81403314e3b2da3076407e9672a090 (MD5) / Made available in DSpace on 2018-06-12T19:15:16Z (GMT). No. of bitstreams: 1 fukushima_pa_me_sjrp.pdf: 734279 bytes, checksum: 7a81403314e3b2da3076407e9672a090 (MD5) Previous issue date: 2018-05-23 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Nesta dissertação estudamos sequências de polinômios ortogonais que surgem como auto-funções polinomiais do problema de Sturm-Liouville, sob a condição de que, nem todos os graus das auto-funções polinomiais estejam presentes na sequência de graus dos polinômios que formam o conjunto ortogonal completo. Estas sequências são chamadas de sequências de polinômios ortogonais excepcionais. Emparticular,realizamosumestudodospolinômiosortogonaisexcepcionais X1-Jacobi e X1-Laguerre. / In this dissertation we study sequences of orthogonal polynomials that arise as polynomial eigenfunctions of the Sturm-Liouville problem, with the condition that not all degrees of polynomial eigenfunctions are present in the sequence of degrees of the polynomials that form a complete orthogonal set. These sequences are called exceptional orthogonal polynomial sequences. In particular, we study the exceptional orthogonal polynomials X1-Jacobi and X1-Laguerre.

Orientador: Eliana Xavier Linhares de Andrade / Banca: Ana Paula Peron / Banca: Alagacone Sri Ranga / Resumo: Sejam Sn(x); n ¸ 0; os polinômios de Sobolev, ortogonais com relação ao produto interno hf; giS = ZR f(x)g(x)dÃ0(x) + ¸ ZR f0(x)g0(x)dÃ1(x); ¸ > 0; onde fdÃ0; dÃ1g forma um par coerente de medidas relacionadas às medidas de Jacobi ou de Laguerre. Denotemos por PÃ0 n (x) e PÃ1 n (x); n ¸ 0; os polinômios ortogonais com respeito a dÃ0 e dÃ1; respectivamente. Neste trabalho, estudamos o comportamento assintótico, quando n ! 1; das razões entre os polinômios de Sobolev, Sn(x); e os polinômios ortogonais PÃ0 n (x) e PÃ1 n (x); além do comportamento limite da razão entre esses dois últimos polinômios. Propriedades assintóticas para os coeficientes da relação de recorrência satisfeita pelos polinômios de Sobolev também foram estudadas. / Abstract: Let Sn(x); n ¸ 0; be the Sobolev polynomials, orthogonal with respect to the inner product hf; giS = ZR f(x)g(x)dÃ0(x) + ¸ ZR f0(x)g0(x)dÃ1(x); ¸ > 0; where fdÃ0; dÃ1g forms a coherent pair of measures related to the Jacobi measure or Laguerre measure. Let PÃ0 n (x) and PÃ1 n (x); n ¸ 0; denote the orthogonal polynomials with respect to dÃ0 and dÃ1; respectively. In this work we study the asymptotic behaviour, as n ! 1; of the ratio between the Sobolev polynomials, Sn(x); and the ortogonal polynomials PÃ0 n (x) and PÃ1 n (x); as well as the limit behaviour of the ratio between the last two polynomials. Furthermore, we also give asymptotic results for the coefficients of the recurrence relation satisfied by the Sobolev polynomials. / Mestre

Orientador: Cleonice Fátima Bracciali / Banca: Walter dos Santos Motta Junior / Banca: Eliana Xavier Linhares de Andrade / Resumo: O objetivo deste trabalho é estudar uma aplicação de polinômios conhecidos, como polinômios para-ortogonais, na solução do problema de análise de freqüência. Para isto, estudamos os polinômios de Szegö que são ortogonais no cýrculo unitário e que dão origem aos polinômios para-ortogonais. Estudamos casos especiais de polinômios para-ortogonais que, através de uma transformação do cýrculo unitário no intervalo [-1, 1], estão associados a certos polinômios ortogonais. Apresentamos também uma abordagem do problema de análise de freqüência utilizando esses polinômios ortogonais em [-1, 1]. / Abstract: The purpose of this work is to study an application of some polynomials, known as para-orthogonal polynomials, in the solution of the frequency analysis problem. We study the Szeguo polynomials that are orthogonal polynomials on the unit circle and give origin to the para-orthogonal polynomials. We investigate some special cases of para-orthogonal polynomials that are associate with certain orthogonal polynomials on [-1, 1] through a transformation from the unit circle to the real interval [-1, 1]. We also present an approach of the frequency analysis problem using these orthogonal polynomials on [-1, 1]. / Mestre

京都大学 / 0048 / 新制・課程博士 / 博士(情報学) / 甲第22583号 / 情博第720号 / 新制||情||123(附属図書館) / 京都大学大学院情報学研究科数理工学専攻 / (主査)教授 中村 佳正, 教授 矢ヶ崎 一幸, 准教授 辻本 諭 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM

It is well known that communication systems employing multiple transmit and multiple receive antennas provide high data rates along with increased reliability. Some of the design criteria of the space-time block codes (STBCs) for multiple input multiple output (MIMO)communication system are that these codes should attain large transmit diversity, high data-rate, low decoding-complexity, low decoding –delay and low peak-to-average power ratio (PAPR). STBCs based on real orthogonal designs (RODs) and complex orthogonal designs (CODs) achieve full transmit diversity and in addition, these codes are single-symbol maximum-likelihood (ML) decodable. It has been observed that the data-rate (in number of information symbols per channel use) of the square CODs falls exponentially with increase in number of antennas and it has led to the construction of rectangular CODs with high rate. We have constructed a class of maximal-rate CODs for n transmit antennas with rate if n is even and if n is odd. The novelty of the above construction is that they 2n+1 are constructed from square CODs. Though these codes have a high rate, this is achieved at the expense of large decoding delay especially when the number of antennas is 5or more. Moreover the rate also converges to half as the number of transmit antennas increases. We give a construction of rate-1/2 CODs with a substantial reduction in decoding delay when compared with the maximal- rate codes. Though there is a significant improvement in the rate of the codes mentioned above when compared with square CODs for the same number of antennas, the decoding delay of these codes is still considerably high. For certain applications, it is desirable to construct codes which are balanced with respect to both rate and decoding delay. To this end, we have constructed high rate and low decoding-delay RODs and CODs from Cayley-Dickson Algebra. Apart from the rate and decoding delay of orthogonal designs, peak-to-average power ratio (PAPR) of STBC is very important from implementation point of view. The standard constructions of square complex orthogonal designs contain a large number of zeros in the matrix result in gin high PAPR. We have given a construction for square complex orthogonal designs with lesser number of zero entries than the known constructions. When a + 1 is a power of 2, we get codes with no zero entries. Further more, we get complex orthogonal designs with no zero entry for any power of 2 antennas by introducing co- ordinate interleaved variables in the design matrix. These codes have significant advantage over the existing codes in term of PAPR. The only sacrifice that is made in the construction of these codes is that the signaling complexity (of these codes) is marginally greater than the existing codes (with zero entries) for some of the entries in the matrix consist of co-ordinate interleaved variables. Also a class of maximal-rate CODs (For mathematical equations pl see the pdf file)

The identification of flow characteristics and the reduction of high-dimensional simulation data have capitalized on an orthogonal basis achieved by proper orthogonal decomposition (POD), also known as principal component analysis (PCA) or the Karhunen-Loeve transform (KLT). In the realm of aerospace engineering, an orthogonal basis is versatile for diverse applications, especially associated with reduced-order modeling (ROM) as follows: a low-dimensional turbulence model, an unsteady aerodynamic model for aeroelasticity and flow control, and a steady aerodynamic model for airfoil shape design. Provided that a given data set lacks parts of its data, POD is required to adopt a least-squares formulation, leading to gappy POD, using a gappy norm that is a variant of an L2 norm dealing with only known data. Although gappy POD is originally devised to restore marred images, its application has spread to aerospace engineering for the following reason: various engineering problems can be reformulated in forms of missing data estimation to exploit gappy POD. Similar to POD, gappy POD has a broad range of applications such as optimal flow sensor placement, experimental and numerical flow data assimilation, and impaired particle image velocimetry (PIV) data restoration. Apart from POD and gappy POD, both of which are deterministic formulations, probabilistic principal component analysis (PPCA), a probabilistic generalization of PCA, has been used in the pattern recognition field for speech recognition and in the oceanography area for empirical orthogonal functions in the presence of missing data. In formulation, PPCA presumes a linear latent variable model relating an observed variable with a latent variable that is inferred only from an observed variable through a linear mapping called factor-loading. To evaluate the maximum likelihood estimates (MLEs) of PPCA parameters such as a factor-loading, PPCA can invoke an expectation-maximization (EM) algorithm, yielding an EM algorithm for PPCA (EM-PCA). By virtue of the EM algorithm, the EM-PCA is capable of not only extracting a basis but also restoring missing data through iterations whether the given data are intact or not. Therefore, the EM-PCA can potentially substitute for both POD and gappy POD inasmuch as its accuracy and efficiency are comparable to those of POD and gappy POD. In order to examine the benefits of the EM-PCA for aerospace engineering applications, this thesis attempts to qualitatively and quantitatively scrutinize the EM-PCA alongside both POD and gappy POD using high-dimensional simulation data. In pursuing qualitative investigations, the theoretical relationship between POD and PPCA is transparent such that the factor-loading MLE of PPCA, evaluated by the EM-PCA, pertains to an orthogonal basis obtained by POD. By contrast, the analytical connection between gappy POD and the EM-PCA is nebulous because they distinctively approximate missing data due to their antithetical formulation perspectives: gappy POD solves a least-squares problem whereas the EM-PCA relies on the expectation of the observation probability model. To juxtapose both gappy POD and the EM-PCA, this research proposes a unifying least-squares perspective that embraces the two disparate algorithms within a generalized least-squares framework. As a result, the unifying perspective reveals that both methods address similar least-squares problems; however, their formulations contain dissimilar bases and norms. Furthermore, this research delves into the ramifications of the different bases and norms that will eventually characterize the traits of both methods. To this end, two hybrid algorithms of gappy POD and the EM-PCA are devised and compared to the original algorithms for a qualitative illustration of the different basis and norm effects. After all, a norm reflecting a curve-fitting method is found to more significantly affect estimation error reduction than a basis for two example test data sets: one is absent of data only at a single snapshot and the other misses data across all the snapshots. From a numerical performance aspect, the EM-PCA is computationally less efficient than POD for intact data since it suffers from slow convergence inherited from the EM algorithm. For incomplete data, this thesis quantitatively found that the number of data-missing snapshots predetermines whether the EM-PCA or gappy POD outperforms the other because of the computational cost of a coefficient evaluation, resulting from a norm selection. For instance, gappy POD demands laborious computational effort in proportion to the number of data-missing snapshots as a consequence of the gappy norm. In contrast, the computational cost of the EM-PCA is invariant to the number of data-missing snapshots thanks to the L2 norm. In general, the higher the number of data-missing snapshots, the wider the gap between the computational cost of gappy POD and the EM-PCA. Based on the numerical experiments reported in this thesis, the following criterion is recommended regarding the selection between gappy POD and the EM-PCA for computational efficiency: gappy POD for an incomplete data set containing a few data-missing snapshots and the EM-PCA for an incomplete data set involving multiple data-missing snapshots. Last, the EM-PCA is applied to two aerospace applications in comparison to gappy POD as a proof of concept: one with an emphasis on basis extraction and the other with a focus on missing data reconstruction for a given incomplete data set with scattered missing data. The first application exploits the EM-PCA to efficiently construct reduced-order models of engine deck responses obtained by the numerical propulsion system simulation (NPSS), some of whose results are absent due to failed analyses caused by numerical instability. Model-prediction tests validate that engine performance metrics estimated by the reduced-order NPSS model exhibit considerably good agreement with those directly obtained by NPSS. Similarly, the second application illustrates that the EM-PCA is significantly more cost effective than gappy POD at repairing spurious PIV measurements obtained from acoustically-excited, bluff-body jet flow experiments. The EM-PCA reduces computational cost on factors 8 ~ 19 compared to gappy POD while generating the same restoration results as those evaluated by gappy POD. All in all, through comprehensive theoretical and numerical investigation, this research establishes that the EM-PCA is an efficient alternative to gappy POD for an incomplete data set containing missing data over an entire data set.

International Telemetering Conference Proceedings / October 27-30, 1997 / Riviera Hotel and Convention Center, Las Vegas, Nevada / This paper analyzes the performance of an M-ary spread spectrum system with orthogonal codes. A new scheme of M-ary spread spectrum communication with phase shifted msequence is proposed, and the method to implement code synchronization in the scheme is given. The performance of the new scheme is analyzed, and compared to conventional spread spectrum systems and orthogonal code M-ary systems. The results show that stronger anti-interference ability, and better data transmission efficiency, and lower complexity is achieved in the system employing phase shifted m-sequence.

Thesis (PhD)--Stellenbosch University, 2015. / ENGLISH ABSTRACT: Numerical simulations are widely used for predicting and optimising the exploitation of aquifers. They are also used to determine certain physical parameters, for example soil conductivity, by inverse calculations, where the model parameters are changed until the model results correspond optimally to measurements taken on site. The Richards’ equation describes the movement of an unsaturated fluid through porous media, and is characterised as a non-linear partial differential equation. The equation is subject to a number of parameters and is typically computationally expensive to solve. To determine the parameters in the Richards’ equation, inverse modelling studies often need to be undertaken. In these studies, the parameters of a numerical model are varied until the numerical response matches a measured response. Inverse modelling studies typically require 100’s of simulations, which implies that parameter optimisation in unsaturated case studies is common only in small or 1D problems in the literature. As a solution to overcome the computational expense incurred in inverse modelling, the use of Proper Orthogonal Decomposition (POD) as a Reduced Order Modelling (ROM) method is proposed in this thesis to speed-up individual simulations. An explanation of the Finite Element Method (FEM) is given using the Galerkin method, followed by a detailed explanation of the Galerkin POD approach. In the development of the Galerkin POD approach, the method of reducing matrices and vectors is shown, and the treatment of Neumann and Dirichlet boundary values is explained. The Galerkin POD method is applied to two case studies. The first case study is the Kogelberg site in the Table Mountain Group near Cape Town in South Africa. The response of the site is modelled at one well over the period of 2 years, and is assumed to be governed by saturated flow, making it a linear problem. The site is modelled as a 3D transient, homogeneous site, using 15 layers and ≈ 20000 nodes, using the FEM implemented on the open-source software FreeFem++. The model takes the evapotranspiration of the fynbos vegetation at the site into consideration, allowing the calculation of annual recharge into the aquifer. The ROM is created from high-fidelity responses taken over time at different parameter points, and speed-up times of ≈ 500 are achieved, corresponding to speed-up times found in the literature for linear problems. The purpose of the saturated groundwater model is to demonstrate that a POD-based ROM can approximate the full model response over the entire parameter domain, highlighting the excellent interpolation qualities and speed-up times of the Galerkin POD approach, when applied to linear problems. A second case study is undertaken on a synthetic unsaturated case study, using the Richards’ equation to describe the water movement. The model is a 2D transient model consisting of ≈ 5000 nodes, and is also created using FreeFem++. The Galerkin POD method is applied to the case study in order to replicate the high-fidelity response. This did not yield in any speed-up times, since the full matrices of non-linear problems need to be recreated at each time step in the transient simulation. Subsequently, a method is proposed in this thesis that adapts the Galerkin POD method by linearising the non-linear terms in the Richards’ equation, in a method named the Linearised Galerkin POD (LGP) method. This method is applied to the same 2D synthetic problem, and results in speed-up times in the range of 10 to 100. The adaptation, notably, does not use any interpolation techniques, favouring a code intrusive, but physics-based, approach. While the use of an intrusively linearised POD approach adds to the complexity of the ROM, it avoids the problem of finding kernel parameters typically present in interpolative POD approaches. Furthermore, the interpolation and possible extrapolation properties inherent to intrusive POD-based ROM’s are explored. The good extrapolation properties, within predetermined bounds, of intrusive POD’s allows for the development of an optimisation approach requiring a very small Design of Experiments (DOE) sets (e.g. with improved Latin Hypercube sampling). The optimisation method creates locally accurate models within the parameter space using Support Vector Classification (SVC). The region inside of the parameter space in which the optimiser is allowed to move is called the confidence region. This confidence region is chosen as the parameter region in which the ROM meets certain accuracy conditions. With the proposed optimisation technique, advantage is taken of the good extrapolation characteristics of the intrusive POD-based ROM’s. A further advantage of this optimisation approach is that the ROM is built on a set of high-fidelity responses obtained prior to the inverse modelling study, avoiding the need for full simulations during the inverse modelling study. In the methodologies and case studies presented in this thesis, initially infeasible inverse modelling problems are made possible by the use of the POD-based ROM’s. The speed up times and extrapolation properties of POD-based ROM’s are also shown to be favourable. In this research, the use of POD as a groundwater management tool for saturated and unsaturated sites is evident, and allows for the quick evaluation of different scenarios that would otherwise not be possible. It is proposed that a form of POD be implemented in conventional groundwater software to significantly reduce the time required for inverse modelling studies, thereby allowing for more effective groundwater management. / AFRIKAANSE OPSOMMING: Die Richards vergelyking beskryf die beweging van ’n vloeistof deur ’n onversadigde poreuse media, en word gekenmerk as ’n nie-lineêre parsiële differensiaalvergelyking. Die vergelyking is onderhewig aan ’n aantal parameters en is tipies berekeningsintensief om op te los. Om die parameters in die Richards vergelyking te bepaal, moet parameter optimering studies dikwels onderneem word. In hierdie studies, word die parameters van ’n numeriese model verander totdat die numeriese resultate die gemete resultate pas. Parameter optimering studies vereis in die orde van honderde simulasies, wat beteken dat studies wat gebruik maak van die Richards vergelyking net algemeen is in 1D probleme in die literatuur. As ’n oplossing vir die berekingskoste wat vereis word in parameter optimering studies, is die gebruik van Eie Ortogonale Ontbinding (POD) as ’n Verminderde Orde Model (ROM) in hierdie tesis voorgestel om individuele simulasies te versnel in die optimering konteks. Die Galerkin POD benadering is aanvanklik ondersoek en toegepas op die Richards vergelyking, en daarna is die tegniek getoets op verskeie gevallestudies. Die Galerkin POD metode word gedemonstreer op ’n hipotetiese gevallestudie waarin water beweging deur die Richards-vergelyking beskryf word. As gevolg van die nie-lineêre aard van die Richards vergelyking, het die Galerkin POD metode nie gelei tot beduidende vermindering in die berekeningskoste per simulasie nie. ’n Verdere gevallestudie word gedoen op ’n ware grootskaalse terrein in die Tafelberg Groep naby Kaapstad, Suid-Afrika, waar die grondwater beweging as versadig beskou word. Weens die lineêre aard van die vergelyking wat die beweging van versadigde water beskryf, is merkwaardige versnellings van > 500 in die ROM waargeneem in hierdie gevallestudie. Daarna was die die Galerkin POD metode aangepas deur die nie-lineêre terme in die Richards vergelyking te lineariseer. Die tegniek word die geLineariserde Galerkin POD (LGP) tegniek genoem. Die aanpassing het goeie resultate getoon, met versnellings groter as 50 keer wanneer die ROM met die oorspronklike simulasie vergelyk word. Al maak die tegniek gebruik van verder lineariseering, is die metode nogsteeds ’n fisika-gebaseerde benadering, en maak nie gebruik van interpolasie tegnieke nie. Die gebruik van ’n fisika-gebaseerde POD benaderings dra by tot die kompleksiteit van ’n volledige numeriese model, maar die kompleksiteit is geregverdig deur die merkwaardige versnellings in parameter optimerings studies. Verder word die interpolasie eienskappe, en moontlike ekstrapolasie eienskappe, inherent aan fisika-gebaseerde POD ROM tegnieke ondersoek in die navorsing. In die navorsing word ’n tegniek voorgestel waarin hierdie inherente eienskappe gebruik word om plaaslik akkurate modelle binne die parameter ruimte te skep. Die voorgestelde tegniek maak gebruik van ondersteunende vektor klassifikasie. Die grense van die plaaslik akkurate model word ’n vertrouens gebeid genoem. Hierdie vertrouens gebied is gekies as die parameter ruimte waarin die ROM voldoen aan vooraf uitgekiesde akkuraatheidsvereistes. Die optimeeringsbenadering vermy ook die uitvoer van volledige simulasies tydens die parameter optimering, deur gebruik te maak van ’n ROM wat gebaseer is op die resultate van ’n stel volledige simulasies, voordat die parameter optimering studie gedoen word. Die volledige simulasies word tipies uitgevoer op parameter punte wat gekies word deur ’n proses wat genoem word die ontwerp van eksperimente. Verdere hipotetiese grondwater gevallestudies is onderneem om die LGP en die plaaslik akkurate tegnieke te toets. In hierdie gevallestudies is die grondwater beweging weereens beskryf deur die Richards vergelyking. In die gevalle studie word komplekse en tyd-rowende modellerings probleme vervang deur ’n POD gebaseerde ROM, waarin individuele simulasies merkwaardig vinniger is. Die spoed en interpolasie/ekstrapolasie eienskappe blyk baie gunstig te wees. In hierdie navorsing is die gebruik van verminderde orde modelle as ’n grondwaterbestuursinstrument duidelik getoon, waarin voorsiening geskep word vir die vinnige evaluering van verskillende modellering situasies, wat andersins nie moontlik is nie. Daar word voorgestel dat ’n vorm van POD in konvensionele grondwater sagteware geïmplementeer word om aansienlike versnellings in parameter studies moontlik te maak, wat na meer effektiewe bestuur van grondwater sal lei.

The thesis outlines the use of Orthogonal Arrays for the training of Artificial Neural Networks. Such arrays are popularly used in system optimisation and are known as Taguchi Methods. The chief advantage of the method is that the network can learn quickly. Fast training methods may be used in certain Control Systems and it has been suggested that they could find application in ‘disaster control,’ where a potentially dangerous system (for example, suffering a mechanical failure) needs to be controlled quickly. Previous work on the methods has shown that they suffer problems when used with multi-layer networks. The thesis discusses the reasons for these problems and reports on several successful techniques for overcoming them. These techniques are based on the consideration of the neuron, rather then the individual weight, as a factor to be optimised. The applications of technique and further work are also discussed.

published_or_final_version / abstract / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy