This thesis summarizes latest findings about municipal solid waste (MSW) modelling. These are used to solve multivariable version of inverse prediction problem. It is not possible to solve such problem analytically, so heuristic framework using regression models and data reconciliation was developed. As a side product, models for MSW modelling using PCA (Principal Component Analysis) and LM (Linear Model) were created. These were compared with heuristic model called RF (Random Forest). Both of these models were also used for per capita MSW modelling. Theoretical parts about generalized linear models, data reconciliation and nonlinear programming are also included.

This thesis describes the theory of model predictive control and application of the theory to synchronous drives. It shows explicit and on-line solutions and compares the results with classical vector control structure.

Cette thèse a pour objet la résolution exacte d’un problème d’optimisation des flux de puissance (OPF) dans un réseau électrique. Dans l’OPF, on doit planifier la production et la répartition des flux de puissances électriques permettant de couvrir, à un coût minimal, la consommation en différents points du réseau. Trois variantes du problème de l’OPF sont étudiées dans ce manuscrit. Nous nous concentrerons principalement sur la résolution exacte des deux problèmes (OPF − L) et (OPF − Q), puis nous montrerons comment notre approche peut naturellement s’´étendre à la troisième variante (OPF − UC). Cette thèse propose de résoudre ces derniers à l’aide d’une méthode de reformulation que l’on appelle RC-OPF. La contribution principale de cette thèse réside dans l’étude, le développement et l’utilisation de notre méthode de résolution exacte RC-OPF sur les trois variantes d’OPF. RC-OPF utilise également des techniques de contractions de bornes, et nous montrons comment ces techniques classiques peuvent être renforcées en utilisant des résultats issus de notre reformulation optimale. / Alternative Current Optimal Power Flow (ACOPF) is naturally formulated as a non-convex problem. In that context, solving (ACOPF) to global optimality remains a challenge when classic convex relaxations are not exact. We use semidefinite programming to build a quadratic convex relaxation of (ACOPF). We show that this quadratic convex relaxation has the same optimal value as the classical semidefinite relaxation of (ACOPF) which is known to be tight. In that context, we build a spatial branch-and-bound algorithm to solve (ACOPF) to global optimality that is based on a quadratic convex programming bound.

A class of Lagrange-Newton-SQP methods is investigated for optimal control problems governed by semilinear parabolic initial- boundary value problems. Distributed and boundary controls are given, restricted by pointwise upper and lower bounds. The convergence of the method is discussed in appropriate Banach spaces. Based on a weak second order sufficient optimality condition for the reference solution, local quadratic convergence is proved. The proof is based on the theory of Newton methods for generalized equations in Banach spaces.

In this paper we propose an approach for incremental learning of semi-supervised SVM. The proposed approach makes use of the locality of radial basis function kernels to do local and incremental training of semi-supervised support vector machines. The algorithm introduces a se- quential minimal optimization based implementation of the branch and bound technique for training semi-supervised SVM problems. The novelty of our approach lies in the in the introduction of incremental learning techniques to semisupervised SVMs.

Submitted by Sandro Camargo (sandro.camargo@unipampa.edu.br) on 2015-05-09T23:05:48Z No. of bitstreams: 1 117110020.pdf: 13178438 bytes, checksum: f29a9ebb8c16cd912a974177b062c58e (MD5) / Made available in DSpace on 2015-05-09T23:05:48Z (GMT). No. of bitstreams: 1 117110020.pdf: 13178438 bytes, checksum: f29a9ebb8c16cd912a974177b062c58e (MD5) Previous issue date: 2014-04-04 / Neste trabalho é apresentado um estudo de redes lineares de antenas com elementos isotrópicos e projetos em tecnologia de microfita, com diagrama de irradiação conformado e controle dos lóbulos secundários. A especificação a ser cumprida éa de uma antena para estações rádio-base operando na frequência alocada par a tecnologia 4G no Brasil. O trabalho descreve ferramentas computacionais que auxiliem na síntese de redes de antenas. Como resultado do processo de otimização, os coeficientes de excitação dos diversos elementos que compõem as redes de antenas são obtidos. Primeiramente é descrito o sistema de telefonia móvel celular, apresentando os principais pontos de interesse neste trabalho, tais como evolução dos sistemas de comunicação sem fio, conceito de reuso de frequência, capacidade do sistema, interferência co-canal e posicionamento das estações rádio-base no sistema celular, além das principais características elétricas das antenas utilizadas atualmente no atendimento aos assinantes. Em seguida, considera-se a existência de uma linha de visada entre a estação rádio-base e o usuário, possibilitando a obtenção do nível aproximado de potência recebida à medida este se afasta da torre. Como meta, deseja-se a distribuição uniforme da potência até o limite da célula, que resulta em um diagrama de irradiação para a antena na forma de cossecante ao quadrado. Além disso, busca-se a minimização da interferência co-canal e a redução do percentual de energia irradiada na região do horizonte. Métodos de síntese de diagrama são estudados e implementados em Matlab visanado a obtenção do diagrama desejado a partir dos coeficientes de excitação dos elementos da rede linear, tais como, método da Transformada de Fourier, de Woodward-Lawson e dos mínimos quadrados. Apesar destes métodos serem vastamente utilizados, não foi possível obter uma síntese adequada do diagrama desejado. Desta forma, métodos de otimização iterativos foram investigados visando ao controle dos lóbulos secundários e a conformação do diagrama. Optou-se pela combinação do algoritmo genético com a programação quadrática sequencial, empregado para a busca de um mínimo local tendo como partida a melhor solução encontrada pelo algoritmo genético. Tal combinação permitiu rápida convergência na obtenção dos coeficientes de excitação da rede. Em seguida uma rede de antenas de microfita foi projetada no software HFSS para reproduzir o diagrama na forma de cossecante ao quadrado quando excitadas pelos coeficientes calculados com a ferramenta computacional. Durante o processo de síntese, todos os efeitos observados em uma rede de antenas foram considerados, tais como acoplamento mútuo e efeito de borda. Após conhecidos o coeficientes de excitação, projetou-se um sistema alimentador em tecnologia de microfita para fornecer os respectivos valores de correntes às antenas que compõem a rede. Por fim, é realizada a comparação entre o diagrama sintetizado e o obtido, o que permitiu a validação da ferramenta computacional. / In this work, the development of a computational tool that performs the synthesis of linear antenna arrays is presented and extensively discussed. The main intended applications is the design of an antenna suitable for radio-base stations of mobile communications systems, whereby uniform power distribution should be achieved inside the cell. The present work starts with the presentation of a review about mobile communication systems, whereby the main aspects are briefly discussed. An analysis is carried out to derive an expression that relates the antenna radiation pattern to the uniform power distribution inside a cell. This feature is achieved if the radiation pattern of the transmitting structure exhibits squared-cosecant shaped. Classical methods for pattern synthesis have been implemented in Matlab and have tested for the case of a squared-cosecant shape. Neither the Fourier Transform nor the Woodward-Lawson techniques could synthesize such a pattern satisfactorily. Thus iterative methods have been studied and implemented. The first iterative technique was based on the minimization of least-square errors, which has been used successfully for beamforming purposes. However, this technique proved to be unsuitable for the synthesis of squared-cosecant shaped patterns. Acceptable results could only be obtained by means of a genetic algorithm-square quadratic programming combined approach, which allowed obtaining fast convergence of the optimization of the excitation coefficients for the linear array elements. In order to demonstrate the efficiency of the developed tool, two microstrip antenna arrays that operate in the frequency band allocated for the Brazilian 4G systems have been studied. The embedded radiation pattern of each array element has been taken into account during the synthesis of the squared-cosecant shaped pattern. This approach allowed mutual coupling, as well as the truncation of the ground plane, to be compensated during the optimization process. The synthesized pattern enabled to reduce the power radiated above the horizon, as well as the co-channel interference. In order to validate the technique, a complete array including the power divider has been designed using the electromagnetic simulator HFSS. Good agreement has been obtained between the synthesized pattern and the simulated one in HFSS.

A formal framework is developed and implemented in this research for preliminary rotorcraft design using IPPD methodology. All the technical aspects of design are considered including the vehicle engineering, dynamic analysis, stability and control, aerodynamic performance, propulsion, transmission design, weight and balance, noise analysis and economic analysis. The design loop starts with a detailed analysis of requirements. A baseline is selected and upgrade targets are identified depending on the mission requirements. An Overall Evaluation Criterion (OEC) is developed that is used to measure the goodness of the design or to compare the design with competitors. The requirements analysis and baseline upgrade targets lead to the initial sizing and performance estimation of the new design. The digital information is then passed to disciplinary experts. This is where the detailed disciplinary analyses are performed. Information is transferred from one discipline to another as the design loop is iterated. To coordinate all the disciplines in the product development cycle, Multidisciplinary Design Optimization (MDO) techniques e.g. All At Once (AAO) and Collaborative Optimization (CO) are suggested. The methodology is implemented on a Light Turbine Training Helicopter (LTTH) design. Detailed disciplinary analyses are integrated through a common platform for efficient and centralized transfer of design information from one discipline to another in a collaborative manner. Several disciplinary and system level optimization problems are solved. After all the constraints of a multidisciplinary problem have been satisfied and an optimal design has been obtained, it is compared with the initial baseline, using the earlier developed OEC, to measure the level of improvement achieved. Finally a digital preliminary design is proposed. The proposed design methodology provides an automated design framework, facilitates parallel design by removing disciplinary interdependency, current and updated information is made available to all disciplines at all times of the design through a central collaborative repository, overall design time is reduced and an optimized design is achieved.

Pour faire face aux mutations du paysage énergétique, les réseaux de distribution d'électricité sont soumis à des exigences de fonctionnement avec des indices de fiabilité à garantir. Dans les années à venir, de grands investissements sont prévus pour la construction des réseaux électriques flexibles, cohérents et efficaces, basés sur de nouvelles architectures et des solutions techniques innovantes, adaptatifs à l'essor des énergies renouvelables. En prenant en compte ces besoins industriels sur le développement des réseaux de distribution du futur, nous proposons, dans cette thèse, une approche reposant sur la théorie des graphes et l'optimisation combinatoire pour la conception de nouvelles architectures pour les réseaux de distribution. Notre démarche consiste à étudier le problème général de recherche d'une architecture optimale qui respecte l'ensemble de contraintes topologiques (redondance) et électrotechniques (courant maximal, plan de tension) selon des critères d'optimisation bien précis : minimisation du coût d'exploitation (OPEX) et minimisation de l'investissement (CAPEX). Ainsi donc, les deux familles des problèmes combinatoires (et leurs relaxations) ont été explorées pour proposer des résolutions efficaces (exactes ou approchées) du problème de planification des réseaux de distribution en utilisant une formulation adaptée. Nous nous sommes intéressés particulièrement aux graphes 2-connexes et au problème de flot arborescent avec pertes quadratiques minimales. Les résultats comparatifs de tests sur les instances de réseaux (fictifs et réels) pour les méthodes proposées ont été présentés. / To cope with the changes in the energy landscape, electrical distribution networks are submitted to operational requirements in order to guarantee reliability indices. In the coming years, big investments are planned for the construction of flexible, consistent and effective electrical networks, based on the new architectures, innovative technical solutions and in response to the development of renewable energy. Taking into account the industrial needs of the development of future distribution networks, we propose in this thesis an approach based on the graph theory and combinatorial optimization for the design of new architectures for distribution networks. Our approach is to study the general problem of finding an optimal architecture which respects a set of topological (redundancy) and electrical (maximum current, voltage plan) constraints according to precise optimization criteria: minimization of operating cost (OPEX) and minimization of investment (CAPEX). Thus, the two families of combinatorial problems (and their relaxations) were explored to propose effective resolutions (exact or approximate) of the distribution network planning problem using an adapted formulation. We are particularly interested in 2-connected graphs and the arborescent flow problem with minimum quadratic losses. The comparative results of tests on the network instances (fictional and real) for the proposed methods were presented.

Made available in DSpace on 2014-07-29T15:03:39Z (GMT). No. of bitstreams: 1 lilian pureza.pdf: 2774999 bytes, checksum: 2a074d04ee02c7e1c87fdbe8c2c68ef6 (MD5) Previous issue date: 2006-10-20 / The aim of this work is to present a formulation and corresponding computational implementation for sizing optimization of plane frames and cable-stayed columns considering geometric non liner behavior. The structural analysis is based on the finite element method using the updated lagrangian approach for plane frame and cable elements, which are represented by plane truss elements. The non linear system is solved by the Newton-Raphson method coupled to load increment strategies such as the arch length method and the generalized displacement parameter method, which allow the algorithm to transpose any critical point that happen to appear along the equilibrium path. In the optimization process the design variables are the heights of the crosssection of the frame elements, the objective function represents the volume of the structure and the constraints impose limits to displacements and critical load. Lateral constraints impose limits to the design variables. The finite difference method is used in the sensitivity analysis of the displacement and critical load constraints. The optimization process is carried out using three different optimization strategies: the sequential quadratic programming algorithm; the interior points algorithm; and the branch and bound method. Some numerical experiments are carried out so as to test the analysis and the sensitivity strategies. Numerical experiments are presented to show the validity of the implementation presented in this dissertation. / O objetivo deste trabalho é a otimização de dimensões de pórticos planos e de colunas estaiadas planas pela minimização do volume da estrutura, considerando os efeitos da não-linearidade geométrica em seu comportamento. A formulação utiliza, para análise das estruturas, elementos finitos de pórtico e de treliça planos e referencial lagrangeano atualizado. O método de Newton-Raphson foi utilizado como estratégia para solução do sistema de equações não lineares. Foram acopladas estratégias especiais para ultrapassagem de pontos críticos que possam existir ao longo da trajetória de equilíbrio, tais como o comprimento de arco cilíndrico e o controle dos deslocamentos generalizados. Na otimização, as variáveis de projeto são as alturas das seções transversais dos elementos, a função objetivo é o volume do material e as restrições dizem respeito a limitações impostas a deslocamentos e à carga limite, além de limitações impostas aos valores das variáveis. A sensibilidade da função objetivo foi obtida por diferenciação direta e a sensibilidade das restrições pelo método das diferenças finitas. Foram utilizados o algoritmo de programação quadrática seqüencial, PQS, o algoritmo de pontos interiores, PI, e o algoritmo de Branch and Bound, B&B. São apresentados exemplos de validação das estratégias de análise não linear e da análise de sensibilidade, além dos exemplos de validação da formulação empregada para a otimização resolvidos pelos métodos implementados.

Abstract Multiple-input multiple-output transmitted signal design for the partially coherent Rayleigh fading channels with discrete inputs under a given average transmit power constraint is consider in this thesis. The objective is to design the space-time constellations and linear precoders to adapt to the degradation caused by the imperfect channel estimation at the receiver and the transmit-receive antenna correlation. The system is partially coherent so that the multiple-input multiple-output channel coefficients are estimated at the receiver and its error covariance matrix is fed back to the transmitter. Two constellation design criteria, one for the single and another for the multiple transmit antennae are proposed. An upper bound on the average bit error probability for the single transmit antenna and cutoff rate, i.e., a lower bound on the mutual information, for multiple transmit antennae are derived. Both criteria are functions of channel estimation error covariance matrix. The designed constellations are called as partially coherent constellation. Additionally, to use the resulting constellations together with forward error control codes requires efficient bit mapping schemes. Because these constellations lack geometrical symmetry in general, the Gray mapping is not always possible in the majority of the constellations obtained. Moreover, different mapping schemes may lead to highly different bit error rate performances. Thus, an efficient bit mapping algorithm called the modified binary switching algorithm is proposed. It minimizes an upper bound on the average bit error probability. It is shown through computer simulations that the designed partially coherent constellation and their optimized bit mapping algorithm together with turbo codes outperform the conventional constellations. Linear precoder design was also considered as a simpler, suboptimal alternative. The cutoff rate expression is again used as a criterion to design the linear precoder. A linear precoder is obtained by numerically maximizing the cutoff rate with respect to the precoder matrix with a given average transmit power constraint. Furthermore, the precoder matrix is decomposed using singular-value-decomposition into the input shaping, power loading, and beamforming matrices. The beamforming matrix is found to coincide with the eigenvectors of the transmit correlation matrix. The power loading and input shaping matrices are solved numerically using the difference of convex functions programming algorithm and optimization under the unitary constraint, respectively. Computer simulations show that the performance gains of the designed precoders are significant compared to the cutoff rate optimized partially coherent constellations without precoding. / Tiivistelmä Väitöskirjassa tarkastellaan lähetyssignaalien suunnittelua osittain koherenteissa Rayleigh-häipyvissä kanavissa toimiviin monitulo-monilähtöjärjestelmiin (MIMO). Lähettimen keskimääräinen lähetysteho oletetaan rajoitetuksi ja lähetyssignaali diskreetiksi. Tavoitteena on suunnitella tila-aikakonstellaatioita ja lineaarisia esikoodereita jotka mukautuvat epätäydellisen kanavaestimoinnin aiheuttamaan suorituskyvyn heikkenemiseen sekä lähetin- ja vastaanotinantennien väliseen korrelaatioon. Tarkasteltavien järjestelmien osittainen koherenttisuus tarkoittaa sitä, että MIMO-kanavan kanavakertoimet estimoidaan vastaanottimessa, josta niiden virhekovarianssimatriisi lähetetään lähettimelle. Työssä esitetään kaksi konstellaatiosuunnittelukriteeriä, toinen yhdelle lähetinantennille ja toinen moniantennilähettimelle. Molemmat kriteerit ovat kanavan estimaatiovirheen kovarianssimatriisin funktioita. Työssä johdetaan yläraja keskimääräiselle bittivirhetodennäköisyydelle yhden lähetinantennin tapauksessa sekä rajanopeus (cutoff rate), joka on alaraja keskinäisinformaatiolle, usean lähetinantennin tapauksessa. Konstellaatioiden käyttö yhdessä virheenkorjauskoodien kanssa edellyttää tehokaita menetelmiä, joilla bitit kuvataan konstellaatiopisteisiin. Koska tarvittavat konstellaatiot eivät ole tyypillisesti geometrisesti symmetrisiä, Gray-kuvaus ei ole yleensä mahdollinen.Lisäksi erilaiset kuvausmenetelmät voivat johtaa täysin erilaisiin bittivirhesuhteisiin. Tästä johtuen työssä esitetään uusi kuvausalgoritmi (modified bit switching algorithm), joka minimoi keskimääräisen bittivirhetodennäköisyyden ylärajan. Simulointitulokset osoittavat, että työssä kehitetyt konstellaatiot antavat paremman suorituskyvyn turbokoodatuissa järjestelmissä kuin perinteiset konstellaatiot. Työssä tarkastellaan myös lineaarista esikoodausta yksinkertaisena, alioptimaalisena vaihtoehtona uusille konstellaatioille. Esikoodauksen suunnittelussa käytetään samaa kriteeriä kuin konstellaatioiden kehityksessä eli rajanopeutta. Lineaarinen esikooderi löydetään numeerisesti maksimoimalla rajanopeus kun rajoitusehtona on lähetysteho. Esikoodausmatriisi hajotetaan singulaariarvohajotelmaa käyttäen esisuodatus, tehoallokaatio ja keilanmuodostusmatriiseiksi, jonka havaitaan vastaavan lähetyskorrelaatiomatriisin ominaisvektoreita. Tehoallokaatiomatriisi ratkaistaan numeerisesti käyttäen difference of convex functions -optimointia ja esisuodatusmatriisi optimoinnilla unitaarista rajoitusehtoa käyttäen. Simulaatiotulokset osoittavat uusien esikoodereiden tarjoavan merkittävän suorituskykyedun sellaisiin rajanopeusoptimoituihin osittain koherentteihin konstellaatioihin nähden, jotka eivät käytä esikoodausta.