Higher order modes (HOM) are electromagnetic resonant fields. They can be excited by an electron beam entering an accelerating cavity, and constitute a component of the wakefield. This wakefield has the potential to dilute the beam quality and, in the worst case, result in a beam-break-up instability. It is therefore important to ensure that these fields are well suppressed by extracting energy through special couplers. In addition, the effect of the transverse wakefield can be reduced by aligning the beam on the cavity axis. This is due to their strength depending on the transverse offset of the excitation beam. For suitably small offsets the dominant components of the transverse wakefield are dipole modes, with a linear dependence on the transverse offset of the excitation bunch. This fact enables the transverse beam position inside the cavity to be determined by measuring the dipole modes extracted from the couplers, similar to a cavity beam position monitor (BPM), but requires no additional vacuum instrumentation.At the FLASH facility in DESY, 1.3 GHz (known as TESLA) and 3.9 GHz (third harmonic) cavities are installed. Wakefields in 3.9 GHz cavities are significantly larger than in the 1.3 GHz cavities. It is therefore important to mitigate the adverse effects of HOMs to the beam by aligning the beam on the electric axis of the cavities. This alignment requires an accurate beam position diagnostics inside the 3.9 GHz cavities. It is this aspect that is focused on in this thesis. Although the principle of beam diagnostics with HOM has been demonstrated on 1.3 GHz cavities, the realization in 3.9 GHz cavities is considerably more challenging. This is due to the dense HOM spectrum and the relatively strong coupling of most HOMs amongst the four cavities in the third harmonic cryo-module. A comprehensive series of simulations and HOM spectra measurements have been performed in order to study the modal band structure of the 3.9 GHz cavities. The dependencies of various dipole modes on the offset of the excitation beam were subsequently studied using a spectrum analyzer. Various data analysis methods were used: modal identification, direct linear regression, singular value decomposition and k-means clustering. These studies lead to three modal options promising for beam position diagnostics, upon which a set of test electronics has been built. The experiments with these electronics suggest a resolution of 50 micron accuracy in predicting local beam position in the cavity and a global resolution of 20 micron over the complete module. This constitutes the first demonstration of HOM-based beam diagnostics in a third harmonic 3.9 GHz superconducting cavity module. These studies have finalized the design of the online HOM-BPM for 3.9 GHz cavities at FLASH.

The performance of three methods of mortality modelling and forecasting are compared. These include the basic Lee–Carter and two functional demographic models; the basic Hyndman–Ullah and the weighted Hyndman–Ullah. Using age-specific data from the Human Mortality Database of two developed countries, France and the UK (England&Wales), these methods are compared; through within-sample forecasting for the years 1999-2018. The weighted Hyndman–Ullah method is adjudged superior among the three methods through a comparison of mean forecast errors and qualitative inspection per the dataset of the selected countries. The weighted HU method is then used to conduct a 32–year ahead forecast to the year 2050.

We extend our results on the degree of ill-posedness for linear integration opera- tors A with weights mapping in the Hilbert space L^2(0,1), which were published in the journal 'Inverse Problems' in 2005 ([5]). Now we can prove that the degree one also holds for a family of exponential weight functions. In this context, we empha- size that for integration operators with outer weights the use of the operator AA^* is more appropriate for the analysis of eigenvalue problems and the corresponding asymptotics of singular values than the former use of A^*A.

In der vorliegenden Arbeit wird ein neues Tensorformat vorgestellt und eingehend analysiert. Das hierarchische Format verwendet einen binären Baum, um den Tensorraum der Ordnung d mit einer geschachtelten Unterraumstruktur zu versehen. Der Speicheraufwand für diese Darstellung ist von der Größenordnung O(dnr + dr^3), wobei n den Speicheraufwand in den Ansatzräumen kennzeichnet und r ein Rangparameter ist, der durch die Dimensionen der geschachtelten Unterräume bestimmt wird. Das hierarchische Format umfasst verschiedene Standardformate zur Tensordarstellung wie das kanonische oder r-Term-Format und die Unterraum-/Tucker-Darstellung. Die in dieser Arbeit entwickelte zugehörige Arithmetik inklusive mehrerer Approximationsmethoden basiert auf stabilen Methoden der Linearen Algebra, insbesondere die Singulärwertzerlegung und die QR-Zerlegung sind von zentraler Bedeutung. Die rechnerische Komplexität ist hierbei O(dnr^2+dr^4). Die lineare Abhängigkeit von der Ordnung d des Tensorraumes ist hervorzuheben. Für die verschiedenen Approximationsmethoden, deren Effizienz und Effektivität für die Anwendbarkeit des neuen Formates entscheidend sind, werden qualitative und quantitative Fehlerabschätzungen gezeigt. Umfassende numerische Experimente mit einem Fokus auf den Approximationsmethoden bestätigen zum einen die theoretischen Resultate und belegen die Stärken der neuen Tensordarstellung, zeigen aber zum anderen auch weitere, eher überraschende positive Eigenschaften der mit FastHOSVD bezeichneten schnellsten Kürzungsmethode. / In this dissertation we present and a new format for the representation of tensors and analyse its properties. The hierarchical format uses a binary tree in order to define a hierarchical structure of nested subspaces in the tensor space of order d. The strorage requirements are O(dnr+dr^3) where n is determined by the storage requirements in the ansatz spaces and r is a rank parameter determined by the dimensions of the nested subspaces. The hierarchichal representation contains the standard representation like canonical or r-term representation and subspace or Tucker representation. The arithmetical operations that have been developed in this work, including several approximation methods, are based on stable Linear Alebra methods, especially the singular value decomposition (SVD) and the QR decomposition are of importance. The computational complexity is O(dnr^2+dr^4). The linear dependence from the order d of the tensor space is important. The approximation methods are one of the key ingredients for the applicability of the new format and we present qualitative and quantitative error estimates. Numerical experiments approve the theoretical results and show some additional, but unexpected positive aspects of the fastest method called FastHOSVD.

The essence of face recognition within the image is generally computer vision, which provides methods and algorithms for the implementation. Some of them are described just in this work. Whole process is split in to three main phases. These are detection, aligning of detected faces and finally its recognition. Algorithms which are used to applied in given issue and which are still in progress from todays view are mentioned in every phase. Implementation is build up on three main algorithms, AdaBoost to obtain the classifier for detection, method of aligning face by principal features and method of Eigenfaces for recognizing. There are theoretically described except already mentioned algorithms neural networks for detection, ASM - Active Shape Models algorithm for aligning and AAM - Active Appearance Model for recognition. In the end there are tables of data retrieved by implemented system, which evaluated the main implementation.

Führungsgetriebe die durch Servomotoren angetrieben werden, benötigen für definierte Stellungen des Abtriebsglieds eine programmierte Funktion (elektronische Kurvenscheibe). Diese leitet sich aus dem möglicherweise fehlerbehafteten kinematischen Modell des Getriebes ab (inverse Kinematik). Zur Verbesserung der Genauigkeit der Führungsbewegung wird ein Verfahren zur Justierung der Übertragungsfunktion auf Basis des Newton-Verfahrens unter Nutzung der Singulärwertzerlegung vorgestellt. Dabei werden die realen Getriebeabmessungen anhand einer Messung berechnet und werden anschließend korrigiert zur Anpassung der Übertragungsfunktion verwendet.

No description available.

Many capacity and near-capacity achieving methods in multiple-input-multipleoutput (MIMO) wireless channels make use of the singular value decomposition (SVD) of the channel matrix. For the multi-user case, the SVD of the channel matrix for each user may result in right and left singular vectors that are similar between users. This proposes another descriptive characterization of the multi-user MIMO channel. Closely aligned singular vectors between any two users could reduce the achievable signaling rates of signal processing communication methods as one user would be more difficult to resolve in space-time from another. An examination into how this alignment can be described in realistic MIMO multipath channels using a two ring channel model is presented. The effects of correlation between singular vectors on achievable signaling rates is shown for one existing algorithm that approaches the sum capacity known as block-diagonalization. Analyzed is actual data collected in several indoor and outdoor experiments performed using newly constructed measurement hardware that extends the capabilities of an existing MIMO measurement system.

No description available.

<p>Exchange proteins directly activated by cAMP (EPAC) are guanine nucleotide exchange factors for the small GTPases, Rap1 and Rap2. The central regulatory module of EPAC is a cAMP binding domain (CBD), which in the absence of cAMP provides auto-inhibition of the catalytic guanine nucleotide exchange activity. Binding of the allosteric effector, cAMP, removes the auto-inhibition exerted by the CBD of EPAC. Herein, we investigate through NMR spectroscopy the structural and dynamical basis of auto-inhibition and cAMP-dependent allosteric activation in the CBD of EPAC. Specifically, the work described in this dissertation proposes novel methods that utilize NMR chemical shifts to define the network of residues that mediates long-range intra-molecular signalling, <em>i.e.</em> the chemical shift covariance analysis (CHESCA) and the chemical shift projection analysis (CHESPA). Using CHESCA as explained in Chapter 2, we identified an allosteric network that bridges the sites of cAMP-binding and cAMP-dependent structural changes to those of cAMP-dependent dynamical changes, which are critical for the release of auto-inhibition. The CHESCA results therefore rationalize how cAMP leads to activation through modulation of both structure and dynamics. In order to dissect the determinants of auto-inhibition in the absence of cAMP, several mutations along the signaling pathways identified by CHESCA were implemented and their effect on the auto-inhibitory conformational equilibrium of the apo-CBD was assessed through CHESPA, as outlined in Chapters 3 and 4. Overall, we have shown how CHESCA and CHESPA provide unprecedented insight into the allosteric networks underlying auto-inhibition and cAMP dependent activation in the CBD of EPAC. In addition, the methods employed here to map EPAC allostery are likely to be generally applicable to other systems.</p> / Doctor of Philosophy (PhD)