Reporter genes are often used to observe expression of promoters, which may change from its natural behaviour as a result of stress or disease states. Reporter genes are useful because they are easily detectable by a variety of imaging methods, including fluorescence microscopy techniques, magnetic resonance imaging, and positron emission tomography. Previously, methyl 5-MeO-N-aminoanthranilate (MMNA) had been synthesized as an aldehyde-conditional fluorophore and was tested in physiological conditions to identify the Aldehydic Load of cells. Thus, it was hypothesized that a reporter protein displaying an aldehyde on the cell surface can be identified by MMNA. This reporter protein would contain a substrate recognition site for formylglycine generating enzyme (FGE) that converts a specific cysteine residue into a formylglycine residue. This will result in production of an aldehyde at the N-terminal of the transmembrane domain of platelet derived growth factor receptor . In this way, the protein product, Aldehyde-presenting FGE-dependent Readout (Alfred), would display an aldehyde on the extracellular surface of the cell. Alfred was expressed in A549 human lung cancer cells using the Tet-On® Inducible System, which allows expression of a gene of interest by use of doxycyclin (dox) as a chemical trigger. Microscopy of Alfred-transfected cells, induced by dox and probed with MMNA, showed no difference in fluorescence between non-transfected and Alfred-transfected cells. The overexpression of FGE to increase thiol-to-aldehyde conversion, and the imaging of cells at longer timepoints (48 and 72 hours) to allow localization of the protein to the cell surface, were attempted. In addition, Alfred was constitutively expressed in another transfection experiment in efforts to increase gene expression. However, these efforts to evaluate Alfred did not improve the microscopy results. Western blotting confirmed FGE overexpression in transgenic cells. Blotting against the Myc-tag in Alfred showed no detected proteins in Alfred-transfected cells. In conjunction with the microscopy images, these results suggest that Alfred is not expressed and cannot be detected as a reporter gene. Comparison to previous works allows the identification of potential approaches to improve Alfred functionality, including the absence of the hemagglutinin epitope, the choice of aldehyde probe used, the choice of cell line used, and the method of analyzing microscopy. Future directives are postulated to identify sources that hinder Alfred expression, and to improve visualization of Alfred over homeostatic aldehydes.

Title: Converting Prose into Poetry with Neural Networks Author: Memduh Gokirmak Institute: Institute of Formal and Applied Linguistics Supervisor: Martin Popel, Institute of Formal and Applied Linguistics Abstract: We present here our attempts to create a system that generates poetry based on a sequence of text provided to it by a user. We explore the use of machine translation and language model technologies based on the neural network architecture. We use different types of data across three languages in our research, and employ and develop metrics to track the quality of the output of the systems we develop. We find that combining machine translation techniques to generate training data to this end with fine-tuning of pre-trained language models provides the most satisfactory generated poetry. Keywords: poetry machine translation language models iii

No description available.

No description available.

El texto completo de este trabajo no está disponible en el Repositorio Académico UPC por restricciones de la casa editorial donde ha sido publicado. / The research revealed the need to design an information architecture model for Data Governance initiative that can serve as an intercom between current IT / IS management trends: Information technology (IT) management and information management. A model is needed that strikes a balance between the need to invest in technology and the ability to manage the information that originates from the use of those technologies, as well as to measure with greater precision the generation of IT value through the use of quality information and user satisfaction, using the technologies that make it possible for the information to reach them to be used in their daily work.

Numerical simulations of particle image velocimetry (PIV) experiments conducted with vortex generating jets (VGJs) on a flat plate, at a Reynolds number based on plate length of 50,000, were performed for three flow conditions using a time-accurate hybrid Navier-Stokes solver. Time-averaged steady blowing of angled jets, subjected to a zero pressure gradient, yielded excellent agreement with the PIV data in terms of vortex formation and strength. Observed flow features include primary and secondary vortices, where the primary vortex eventually dominates the downstream region. A shell wall structure, created by smaller vortical structures surrounding the developing vortices, was also observed. A pulsed jet in a zero pressure gradient was then initialized from a no-control case. A qualitative comparison between averaged experimental and instantaneous numerical results was performed with good agreement in terms of the convected size and distance of the wake. Analysis of the instantaneous numerical flow field agreed well with various flow visualization experiments describing the formation of "kidney" vortices. Various indicators point to the production of a primary vortex by the reduced mass flow of the pulsed jet. Finally, an adverse pressure gradient was applied, inducing a laminar separation zone on the plate. A pulsed angled jet induced strong spanwise vortices in the separated shear layer which appear to weaken the separation zone and allow the bulk jet fluid to flush the remaining low-momentum fluid out of the domain. It is reasonable to assume that reduced blowing ratios and duty cycles would produce similar shear layer vortices and comparable loss reductions. Influences of both turbulent transition and dominant vortical structures were observed, though the spanwise shear layer vortices appear to be critical to the laminar separation reduction scenarios observed in this study.

[pt] Este trabalho descreve um método de cálculo da confiabilidade da capacidade de geração de sistemas de potência, para fins de operação do mesmo. O objetivo desejado foi o de permitir uma discussão matemático- estatistica, no que diz respeito a determinação da reserva girante a ser mantida pelos sistemas de potência. Foram abordados conceitos básicos de confiabilidade e de processos de Markov. O trabalho é concluído com a apresentação de exemplos numéricos. / [en] This work describes a method of calculating the reliability of the generating capacity of power systems necessary in order to operate them. The purpose is to open a mathematical-statistical discussion about the definition of the spinning reserve to be maintained by the power systems. This work also touches on basic concepts of reliability and Marlov processes. It concludes with the presentation of numerical examples.

In 1939, I.M. Sheffer proved that every polynomial sequence belongs to one and only one type. Sheffer extensively developed properties of the B-Type 0 polynomial sequences and determined which sets are also orthogonal. He subsequently generalized his classification method to the case of arbitrary B-Type k by constructing the generalized generating function A(t)exp[xH1(t) + · · · + xk+1Hk(t)] = ∑∞n=0 Pn(x)tn, with Hi(t) = hi,iti + hi,i+1t i+1 + · · · , h1,1 ≠ 0. Although extensive research has been done on characterizing polynomial sequences, no analysis has yet been completed on sets of type one or higher (k ≥ 1). We present a preliminary analysis of a special case of the B-Type 1 (k = 1) class, which is an extension of the B-Type 0 class, in order to determine which sets, if any, are also orthogonal sets. Lastly, we consider an extension of this research and comment on future considerations. In this work the utilization of computer algebra packages is indispensable, as computational difficulties arise in the B-Type 1 class that are unlike those in the B-Type 0 class.

Yes / It is shown that the probability generating function of a lifetime random variable T on a finite lattice with polynomial failure rate satisfies a certain differential equation. The interrelationship with Markov chain theory is highlighted. The differential equation gives rise to a system of differential equations which, when inverted, can be used in the limit to express the polynomial coefficients in terms of the factorial moments of T. This then can be used to estimate the polynomial coefficients. Some special cases are worked through symbolically using Computer Algebra. A simulation study is used to validate the approach and to explore its potential in the reliability context.

Chess is a deep and intricate game, the master of which depends on learning tens of thousands of the patterns that may occur on the board. At Noctie, their mission is to aid this learning process through humanlike chess AI. A prominent challenge lies in curating instructive chess positions for students. Usually these are either manually found by going through large numbers of real games, or handcrafted – a time-consuming process. For effective learning, it is often useful to collect many positions following the same theme, or exhibiting the same type of pattern. Curating such collections from real games is a challenging task. This thesis investigates the transformer decoder-only architecture and its capability of generating realistic, game-like chess-positions. This investigation involved the development and training of a decoder model using Pytorch, and a simple web-based Turing test gaining larger understanding of testers experience. The developed chess model successfully generates chess positions, with constraining possibilities of fixed pieces, score intervals, and fixed empty positions. Controlled re-generation ensures satisfaction of score intervals, while empty positions are handled by iterating over the model's probabilities. Based on the limited data provided by the Turing test, the model seems to fool players below 2000 rank-points on chess.com, where guess percentages land near the 50 percent mark, providing no clear indication that it deviates from randomness.