Anchor limited q in flexural mode resonators

This paper reports a preliminary examination of the effect of anchor geometry design on the quality factor of flexural mode resonators operating in vacuum using both FE simulation and measurements of resonator frequency response. Three types of structures have been considered in this study: an elliptical mode ring, a double ended tuning fork, and a doubly-clamped beam. We consider the relative distribution of strain energies in both the resonant structure and the connecting stem, which is indicative of the measured quality factor. The measured quality factors of the different structures are compared against each other, based on which suggestions are proposed for optimizing the anchor limited quality factor (Q) in flexural mode micromechanical resonators. ©2008 IEEE.

A general design method for electric machines using magnetic circuit model considering the flux saturation problem

This paper proposes an analytical approach that is generalized for the design of various types of electric machines based on a physical magnetic circuit model. Conventional approaches have been used to predict the behavior of electric machines but have limitations in accurate flux saturation analysis and hence machine dimensioning at the initial design stage. In particular, magnetic saturation is generally ignored or compensated by correction factors in simplified models since it is difficult to determine the flux in each stator tooth for machines with any slot-pole combinations. In this paper, the flux produced by stator winding currents can be calculated accurately and rapidly for each stator tooth using the developed model, taking saturation into account. This aids machine dimensioning without the need for a computationally expensive finite element analysis (FEA). A 48-slot machine operated in induction and doubly-fed modes is used to demonstrate the proposed model. FEA is employed for verification.

Tractable nonparametric bayesian inference in poisson processes with Gaussian process intensities

The inhomogeneous Poisson process is a point process that has varying intensity across its domain (usually time or space). For nonparametric Bayesian modeling, the Gaussian process is a useful way to place a prior distribution on this intensity. The combination of a Poisson process and GP is known as a Gaussian Cox process, or doubly-stochastic Poisson process. Likelihood-based inference in these models requires an intractable integral over an infinite-dimensional random function. In this paper we present the first approach to Gaussian Cox processes in which it is possible to perform inference without introducing approximations or finitedimensional proxy distributions. We call our method the Sigmoidal Gaussian Cox Process, which uses a generative model for Poisson data to enable tractable inference via Markov chain Monte Carlo. We compare our methods to competing methods on synthetic data and apply it to several real-world data sets. Copyright 2009.

Tractable nonparametric Bayesian inference in Poisson processes with Gaussian process intensities

The inhomogeneous Poisson process is a point process that has varying intensity across its domain (usually time or space). For nonparametric Bayesian modeling, the Gaussian process is a useful way to place a prior distribution on this intensity. The combination of a Poisson process and GP is known as a Gaussian Cox process, or doubly-stochastic Poisson process. Likelihood-based inference in these models requires an intractable integral over an infinite-dimensional random function. In this paper we present the first approach to Gaussian Cox processes in which it is possible to perform inference without introducing approximations or finite-dimensional proxy distributions. We call our method the Sigmoidal Gaussian Cox Process, which uses a generative model for Poisson data to enable tractable inference via Markov chain Monte Carlo. We compare our methods to competing methods on synthetic data and apply it to several real-world data sets.

Crack deflection at an interface between dissimilar elastic-materials

A crack intersecting an interface between two dissimilar materials may advance by either penetrating through the interface or deflecting into the interface. The competition between deflection and penetration can be assessed by comparison of two ratios: (i) the ratio of the energy release rates for interface cracking and crack penetration; and (ii) the ratio of interface to material fracture energies. Residual stresses caused by thermal expansion misfit can influence the energy release rates of both the deflected and penetrating crack. This paper analyses the role of residual stresses. The results reveal that expansion misfit can be profoundly important in systems with planar interfaces (such as layered materials, thin film structures, etc.), but generally can be expected to be of little significance in fiber composites. This paper corrects an earlier result for the ratio of the energy release rate for the doubly deflected crack to that for the penetrating crack in the absence of residual stress.

Performance of an Ocean Energy Conversion System with DFIG Sensorless Control

The 2009/28/EC Directive requires Member States of the European Union to adopt a National Action Plan for Renewable Energy. In this context, the Basque Energy Board, EVE, is committed to research activities such as the Mutriku Oscillating Water Column plant, OWC. This is an experimental facility whose concept consists of a turbine located in a pneumatic energy collection chamber and a doubly fed induction generator that converts energy extracted by the turbine into a form that can be returned to the network. The turbo-generator control requires a precise knowledge of system parameters and of the rotor angular velocity in particular. Thus, to remove the rotor speed sensor implies a simplification of the hardware that is always convenient in rough working conditions. In this particular case, a Luenberger based observer is considered and the effectiveness of the proposed control is shown by numerical simulations. Comparing these results with those obtained using a traditional speed sensor, it is shown that the proposed solution provides better performance since it increases power extraction in the sense that it allows a more reliable and robust performance of the plant, which is even more relevant in a hostile environment as the ocean.

Sliding Mode Control Strategy for Wind Turbine Power Maximization

The efficiency of the wind power conversions systems can be greatly improved using an appropriate control algorithm. In this work, a sliding mode control for variable speed wind turbine that incorporates a doubly fed induction generator is described. The electrical system incorporates a wound rotor induction machine with back-to-back three phase power converter bridges between its rotor and the grid. In the presented design the so-called vector control theory is applied, in order to simplify the electrical equations. The proposed control scheme uses stator flux-oriented vector control for the rotor side converter bridge control and grid voltage vector control for the grid side converter bridge control. The stability analysis of the proposed sliding mode controller under disturbances and parameter uncertainties is provided using the Lyapunov stability theory. Finally simulated results show, on the one hand, that the proposed controller provides high-performance dynamic characteristics, and on the other hand, that this scheme is robust with respect to the uncertainties that usually appear in the real systems.

Adaptive variable structure control law for a variable speed wind turbine

Presentado en el 13th WSEAS International Conference on Automatic Control, Modelling and Simulation, ACMOS'11

Sliding mode control strategy for variable speed wind turbines

EFTA 2009

Transceiver designs and analysis for LTI, LTV and broadcast channels - new matrix decompositions and majorization theory

Signal processing techniques play important roles in the design of digital communication systems. These include information manipulation, transmitter signal processing, channel estimation, channel equalization and receiver signal processing. By interacting with communication theory and system implementing technologies, signal processing specialists develop efficient schemes for various communication problems by wisely exploiting various mathematical tools such as analysis, probability theory, matrix theory, optimization theory, and many others. In recent years, researchers realized that multiple-input multiple-output (MIMO) channel models are applicable to a wide range of different physical communications channels. Using the elegant matrix-vector notations, many MIMO transceiver (including the precoder and equalizer) design problems can be solved by matrix and optimization theory. Furthermore, the researchers showed that the majorization theory and matrix decompositions, such as singular value decomposition (SVD), geometric mean decomposition (GMD) and generalized triangular decomposition (GTD), provide unified frameworks for solving many of the point-to-point MIMO transceiver design problems.

In this thesis, we consider the transceiver design problems for linear time invariant (LTI) flat MIMO channels, linear time-varying narrowband MIMO channels, flat MIMO broadcast channels, and doubly selective scalar channels. Additionally, the channel estimation problem is also considered. The main contributions of this dissertation are the development of new matrix decompositions, and the uses of the matrix decompositions and majorization theory toward the practical transmit-receive scheme designs for transceiver optimization problems. Elegant solutions are obtained, novel transceiver structures are developed, ingenious algorithms are proposed, and performance analyses are derived.

The first part of the thesis focuses on transceiver design with LTI flat MIMO channels. We propose a novel matrix decomposition which decomposes a complex matrix as a product of several sets of semi-unitary matrices and upper triangular matrices in an iterative manner. The complexity of the new decomposition, generalized geometric mean decomposition (GGMD), is always less than or equal to that of geometric mean decomposition (GMD). The optimal GGMD parameters which yield the minimal complexity are derived. Based on the channel state information (CSI) at both the transmitter (CSIT) and receiver (CSIR), GGMD is used to design a butterfly structured decision feedback equalizer (DFE) MIMO transceiver which achieves the minimum average mean square error (MSE) under the total transmit power constraint. A novel iterative receiving detection algorithm for the specific receiver is also proposed. For the application to cyclic prefix (CP) systems in which the SVD of the equivalent channel matrix can be easily computed, the proposed GGMD transceiver has K/log_2(K) times complexity advantage over the GMD transceiver, where K is the number of data symbols per data block and is a power of 2. The performance analysis shows that the GGMD DFE transceiver can convert a MIMO channel into a set of parallel subchannels with the same bias and signal to interference plus noise ratios (SINRs). Hence, the average bit rate error (BER) is automatically minimized without the need for bit allocation. Moreover, the proposed transceiver can achieve the channel capacity simply by applying independent scalar Gaussian codes of the same rate at subchannels.

In the second part of the thesis, we focus on MIMO transceiver design for slowly time-varying MIMO channels with zero-forcing or MMSE criterion. Even though the GGMD/GMD DFE transceivers work for slowly time-varying MIMO channels by exploiting the instantaneous CSI at both ends, their performance is by no means optimal since the temporal diversity of the time-varying channels is not exploited. Based on the GTD, we develop space-time GTD (ST-GTD) for the decomposition of linear time-varying flat MIMO channels. Under the assumption that CSIT, CSIR and channel prediction are available, by using the proposed ST-GTD, we develop space-time geometric mean decomposition (ST-GMD) DFE transceivers under the zero-forcing or MMSE criterion. Under perfect channel prediction, the new system minimizes both the average MSE at the detector in each space-time (ST) block (which consists of several coherence blocks), and the average per ST-block BER in the moderate high SNR region. Moreover, the ST-GMD DFE transceiver designed under an MMSE criterion maximizes Gaussian mutual information over the equivalent channel seen by each ST-block. In general, the newly proposed transceivers perform better than the GGMD-based systems since the super-imposed temporal precoder is able to exploit the temporal diversity of time-varying channels. For practical applications, a novel ST-GTD based system which does not require channel prediction but shares the same asymptotic BER performance with the ST-GMD DFE transceiver is also proposed.

The third part of the thesis considers two quality of service (QoS) transceiver design problems for flat MIMO broadcast channels. The first one is the power minimization problem (min-power) with a total bitrate constraint and per-stream BER constraints. The second problem is the rate maximization problem (max-rate) with a total transmit power constraint and per-stream BER constraints. Exploiting a particular class of joint triangularization (JT), we are able to jointly optimize the bit allocation and the broadcast DFE transceiver for the min-power and max-rate problems. The resulting optimal designs are called the minimum power JT broadcast DFE transceiver (MPJT) and maximum rate JT broadcast DFE transceiver (MRJT), respectively. In addition to the optimal designs, two suboptimal designs based on QR decomposition are proposed. They are realizable for arbitrary number of users.

Finally, we investigate the design of a discrete Fourier transform (DFT) modulated filterbank transceiver (DFT-FBT) with LTV scalar channels. For both cases with known LTV channels and unknown wide sense stationary uncorrelated scattering (WSSUS) statistical channels, we show how to optimize the transmitting and receiving prototypes of a DFT-FBT such that the SINR at the receiver is maximized. Also, a novel pilot-aided subspace channel estimation algorithm is proposed for the orthogonal frequency division multiplexing (OFDM) systems with quasi-stationary multi-path Rayleigh fading channels. Using the concept of a difference co-array, the new technique can construct M^2 co-pilots from M physical pilot tones with alternating pilot placement. Subspace methods, such as MUSIC and ESPRIT, can be used to estimate the multipath delays and the number of identifiable paths is up to O(M^2), theoretically. With the delay information, a MMSE estimator for frequency response is derived. It is shown through simulations that the proposed method outperforms the conventional subspace channel estimator when the number of multipaths is greater than or equal to the number of physical pilots minus one.

Optimal uncertainty quantification via convex optimization and relaxation

Many engineering applications face the problem of bounding the expected value of a quantity of interest (performance, risk, cost, etc.) that depends on stochastic uncertainties whose probability distribution is not known exactly. Optimal uncertainty quantification (OUQ) is a framework that aims at obtaining the best bound in these situations by explicitly incorporating available information about the distribution. Unfortunately, this often leads to non-convex optimization problems that are numerically expensive to solve.

This thesis emphasizes on efficient numerical algorithms for OUQ problems. It begins by investigating several classes of OUQ problems that can be reformulated as convex optimization problems. Conditions on the objective function and information constraints under which a convex formulation exists are presented. Since the size of the optimization problem can become quite large, solutions for scaling up are also discussed. Finally, the capability of analyzing a practical system through such convex formulations is demonstrated by a numerical example of energy storage placement in power grids.

When an equivalent convex formulation is unavailable, it is possible to find a convex problem that provides a meaningful bound for the original problem, also known as a convex relaxation. As an example, the thesis investigates the setting used in Hoeffding's inequality. The naive formulation requires solving a collection of non-convex polynomial optimization problems whose number grows doubly exponentially. After structures such as symmetry are exploited, it is shown that both the number and the size of the polynomial optimization problems can be reduced significantly. Each polynomial optimization problem is then bounded by its convex relaxation using sums-of-squares. These bounds are found to be tight in all the numerical examples tested in the thesis and are significantly better than Hoeffding's bounds.

The decay properties of the ψ(3770)

The decays of the ψ(3770) resonance to final states that do not contain charmed D mesons are measured for the first time. Using a sample of 9.3pb ^(-1) of e^+e^- annihilations at √s = 3.77 GeV, collected with the Mark III detector at SPEAR, we have measured the branching ratio for the decays ψ(3770) → J/ψπ^(+)π^(-) and γχ_j. These branching ratios together with the electronic widths of the ψ(3685) and ψ(3770) are used to determine the mixing angle between the 2^(3)S_1 and 1^(3)D_1 Charmonium states and are compared with a number of predictions. In addition, evidence is found for other non-DD hadronic final states, such as 3π, 4π, and 5π, as well as η2π, η4π, pp2π and pp3π.

Control of dynamical systems with temporal logic specifications

This thesis is motivated by safety-critical applications involving autonomous air, ground, and space vehicles carrying out complex tasks in uncertain and adversarial environments. We use temporal logic as a language to formally specify complex tasks and system properties. Temporal logic specifications generalize the classical notions of stability and reachability that are studied in the control and hybrid systems communities. Given a system model and a formal task specification, the goal is to automatically synthesize a control policy for the system that ensures that the system satisfies the specification. This thesis presents novel control policy synthesis algorithms for optimal and robust control of dynamical systems with temporal logic specifications. Furthermore, it introduces algorithms that are efficient and extend to high-dimensional dynamical systems.

The first contribution of this thesis is the generalization of a classical linear temporal logic (LTL) control synthesis approach to optimal and robust control. We show how we can extend automata-based synthesis techniques for discrete abstractions of dynamical systems to create optimal and robust controllers that are guaranteed to satisfy an LTL specification. Such optimal and robust controllers can be computed at little extra computational cost compared to computing a feasible controller.

The second contribution of this thesis addresses the scalability of control synthesis with LTL specifications. A major limitation of the standard automaton-based approach for control with LTL specifications is that the automaton might be doubly-exponential in the size of the LTL specification. We introduce a fragment of LTL for which one can compute feasible control policies in time polynomial in the size of the system and specification. Additionally, we show how to compute optimal control policies for a variety of cost functions, and identify interesting cases when this can be done in polynomial time. These techniques are particularly relevant for online control, as one can guarantee that a feasible solution can be found quickly, and then iteratively improve on the quality as time permits.

The final contribution of this thesis is a set of algorithms for computing feasible trajectories for high-dimensional, nonlinear systems with LTL specifications. These algorithms avoid a potentially computationally-expensive process of computing a discrete abstraction, and instead compute directly on the system's continuous state space. The first method uses an automaton representing the specification to directly encode a series of constrained-reachability subproblems, which can be solved in a modular fashion by using standard techniques. The second method encodes an LTL formula as mixed-integer linear programming constraints on the dynamical system. We demonstrate these approaches with numerical experiments on temporal logic motion planning problems with high-dimensional (10+ states) continuous systems.

Zirconocenes as models for homogeneous Ziegler-Natta olefin polymerization catalysts

Using density functional theory, we studied the fundamental steps of olefin polymerization for zwitterionic and cationic Group IV ansa-zirconocenes and a neutral ansa- yttrocene. Complexes [H₂E(C₅H₄)₂ZrMe]ⁿ (n = 0: E = BH₂ (1), BF₂ (2), AlH₂(3); n = +: E = CH₂(4), SiH₂(5)) and H₂Si(C₅H₄)₂YMe were used as computational models. The largest differences among these three classes of compounds were the strength of olefin binding and the stability of the β-agostic alkyl intermediate towards β-hydrogen elimination. We investigated the effect of solvent on the reaction energetics for land 5. We found that in benzene the energetics became very similar except that a higher olefin insertion barrier was calculated for 1. The calculated anion affinity of [CH₃BF₃]^- was weaker towards 1 than 5. The calculated olefin binding depended primarily on the charge of the ansa linker, and the olefin insertion barrier was found to decrease steadily in the following order: [H₂C(C₅H₄)₂ZrMe]⁺ > [F₂B(C₅H₄)₂ZrMe] ≈ [H₂B(C₅H₄)₂ZrMe] > [H₂Si(C₅H₄)₂ZrMe]⁺ > [H₂Al(C₅H₄)₂ZrMe].

We prepared ansa-zirconocene dicarbonyl complexes Me₂ECp₂Zr(CO)₂ (E = Si, C), and t-butyl substituted complexes (t-BuCp)₂Zr(CO)₂, Me₂E(t-BuCp)₂Zr(CO)₂ (E = Si, C), (Me₂Si)₂(t-BuCp)₂Zr(CO)₂ as well as analogous zirconocene complexes. Both the reduction potentials and carbonyl stretching frequencies follow the same order: Me₂SiCp₂ZrCl₂> Me₂CCp₂ZrCl₂> Cp₂ZrCl₂> (Me₂Si)₂Cp₂ZrCl₂. This ordering is a result of both the donating abilities of the cyclopentadienyl substituents and the orientation of the cyclopentadiene rings. Additionally, we prepared a series of analogous cationic zirconocene complexes [LZrOCMe₃][MeB(C₆F₅)₃] (L = CP₂, Me₂SiCp₂, Me₂CCP₂, (Me₂Si)₂Cp₂) and studied the kinetics of anion dissociation. We found that the enthalpy of anion dissociation increased from 10.3 kcal•mol^-1 to 17.6 kcal•mol^-1 as exposure of the zirconium center increased.

We also prepared series of zirconocene complexes bearing 2,2-dimethyl-2-sila-4-pentenyl substituents (and methyl-substituted olefin variants). Methide abstraction with B(C₆F₅) results in reversible coordination of the tethered olefin to the cationic zirconium center. The kinetics of olefin dissociation have been examined using NMR methods, and the effects of ligand variation for unlinked, singly [SiMe₂]-linked and doubly [SiMe₂]-linked bis(cyclopentadienyl) arrangements has been compared (ΔG‡ for olefin dissociation varies from 12.8 to 15.6 kcal•mol^-1). Methide abstraction from 1,2-(SiMe₂)₂(η⁵-C₅H₃)₂Zr(CH₃)-(CH₂CMe₂CH₂CH = CH₂) results in rapid β-allyl elimination with loss of isobutene yielding the allyl cation [{1,2-(SiMe₂)₂(η⁵-C₅H₃)₂Zr(η³-CH₂CH=CH₂)]⁺.

Investigations of the origin of stereocontrol in syndiospecific Ziegler-Natta polymerizations

In order to expand our understanding of the mechanism of stereocontrol in syndiospecific α-olefin polymerization, a family of Cs-symmetric, ansa-group 3 metallocenes was targeted as polymerization catalysts. The syntheses of new ansa-yttrocene and scandocene derivatives that employ the doubly [SiMe₂]- bridged ligand array (1,2-SiMe₂)₂{C₅H-3,5-(CHMe₂)₂} (where R = t- butyl, tBuThp; where R = i-propyl, iPrThp) are described. The structures of tBuThpY(µ-Cl)₂K(THF)₂, tBuThpSc(µ-Cl)₂K(Et₂O)₂, tBuThpYCH(SiMe₃)₂, Y₂{µ₂-(tBuThp)₂}(µ₂-H)₂, and tBuThpSc(µ-CH₃)₂ have been examined by single crystal X-ray diffraction methods. Ansa-yttrocenes and scandocenes that incorporate the singly [CPh₂]-bridged ligand array (CPh₂)(C₅H₄)(C₁₃H₈)(where C₅H₄ = Cp, cyclopentadienyl; where C₁₃H₈ = Flu, fluourenyl) have also been prepared. Select meallocene alkyl complexes are active single component catalysts for homopolymerization of propylene and 1-pentene. The scandocene tetramethylaluminate complexes generate polymers with the highes molecular weights of the series. Under all conditions examined atactic polymer microstructures are observed, suggesting a chain-end mechanism for stereocontrol.

A series of ansa-tantalocenes have been prepared as models for Ziegler-Natta polymerization catalysts. A singly bridged ansa-tantalocene trimethyl complex, Me₂Si(η⁵-C₅H₄)₂TaMe₃, has been prepared and used for the synthesis of a tantalocene ethylene-methyl complex. Addition of propylene to this ethylene-methyl adduct results in olefin exchange to give a mixture of endo and exo propylene isomers. Doubly-silylene bridged ansa-tantalocene complexes have been prepared with the tBuThp ligand; a tantalocene trimethyl complex and a tantalocene methylidene-methyl complex have been synthesized and characterized by X-ray diffraction. Thermolysis of the methylidene-methyl complex affords the corresponding ethylene-hydride complex. Addition of either propylene or styrene to this ethylene-hydride compound results in olefin exchange. In both cases, only one product isomer is observed. Studies of olefin exchange with ansa-tantalocene olefin-hydride and olefin-methyl complexes have provided information about the important steric influences for olefin coordination in Ziegler-Natta polymerization.