<p>Programming is a very complex activity that has many simultaneous learning elements. The area of Live-programming offers possibilities for enhancing programming work by speeding up the feedback loop and providing means for reducing the cognitive load on the working memory during the task. This could allow for better education for novice programmers. In this work a number of systems with a shared aim of providing educational tools for scholars from compulsory level to undergraduate college were studied. The common approach in the majority of the tools was to use program abstractions like tangible morphs, playing cards, capsules for code segments, and visual stories. For the user these abstractions and tools offer better focus on the constructive and creative side of programming because they relieve the user from the cumbersome work of writing program code, but they also sacrifice some of the expressiveness of a low-level language.</p><p>A Live programming system, called PyMorphic, based on the Morphic model was built in the Python programming language. Two different solutions, based on the Wx toolkit for Python, were constructed and evaluated. The results show that Morphic and Python go well together because Python is a programming language that allows for compact and dynamic code. PyMorphic was evaluated with the cognitive dimensions framework and theories on cognitive load and working memory. A user attitude test was performed and the results showed that the users had a positive attitude towards the PyMorphic system.</p><p>The PyMorphic project is open-source and it is hosted on Sourceforge. The code can be downloaded from the project web-site: http://pymorphic.sourceforge.net. Anyone is welcome to take part in further development of PyMorphic.</p>

Controlling the robots through a robotic platform has recently been used widely; however, it is necessary to make the platform friendlier in use to bring this product deeply into the family. The screenplay based performance platform (SBPP) of robotic puppet shows proposed in this thesis is a robotic platform composed with cloud computing, User Interface (UI) and Screenplay Interpreter(SI). The users can connect to the UI to edit and setup the screenplay ubiquitously through any device which can link to the internet. Through screenplay interpreter, the robot can perform as the designed screenplay after the setup; that is, one can always designate a different robot to execute during the process of editing, and the actions of these robots will be a message communication with preset meaning. The project of SBPP is divided into two modules: the UI and SI for multi-morphic robots. The work of this thesis takes charge mainly of screenplay interpreter for a variety of robot models and interfacing between NAO(pronounced now) which is a humanoid robot and the screenplay interpreter. And we integrate UI and SI. The integration of the work provides users a friendly UI to edit scenario of NAO and DARwIn-OP such the robot, NAO and DARwIn-OP(Dynamic Anthropomorphic Robot with Intelligence - Open Platform), can play in a scenario as the screenplay describing. The system is demonstrated by a play of ¡§do-as-I-do¡¨ and recorded in a video at YouTube, http://www.youtube.com/watch?v=v8ErTOgAQSo.

This thesis concerns infinite words over finite alphabets. It contributes to two topics in this area: critical exponents and stabilizers. Let w be a right-infinite word defined over a finite alphabet. The critical exponent of w is the supremum of the set of exponents r such that w contains an r-power as a subword. Most of the thesis (Chapters 3 through 7) is devoted to critical exponents. Chapter 3 is a survey of previous research on critical exponents and repetitions in morphic words. In Chapter 4 we prove that every real number greater than 1 is the critical exponent of some right-infinite word over some finite alphabet. Our proof is constructive. In Chapter 5 we characterize critical exponents of pure morphic words generated by uniform binary morphisms. We also give an explicit formula to compute these critical exponents, based on a well-defined prefix of the infinite word. In Chapter 6 we generalize our results to pure morphic words generated by non-erasing morphisms over any finite alphabet. We prove that critical exponents of such words are algebraic, of a degree bounded by the alphabet size. Under certain conditions, our proof implies an algorithm for computing the critical exponent. We demonstrate our method by computing the critical exponent of some families of infinite words. In particular, in Chapter 7 we compute the critical exponent of the Arshon word of order n for n ≥ 3. The stabilizer of an infinite word w defined over a finite alphabet Σ is the set of morphisms f: Σ*→Σ* that fix w. In Chapter 8 we study various problems related to stabilizers and their generators. We show that over a binary alphabet, there exist stabilizers with at least n generators for all n. Over a ternary alphabet, the monoid of morphisms generating a given infinite word by iteration can be infinitely generated, even when the word is generated by iterating an invertible primitive morphism. Stabilizers of strict epistandard words are cyclic when non-trivial, while stabilizers of ultimately strict epistandard words are always non-trivial. For this latter family of words, we give a characterization of stabilizer elements. We conclude with a list of open problems, including a new problem that has not been addressed yet: the D0L repetition threshold.

This thesis concerns infinite words over finite alphabets. It contributes to two topics in this area: critical exponents and stabilizers. Let w be a right-infinite word defined over a finite alphabet. The critical exponent of w is the supremum of the set of exponents r such that w contains an r-power as a subword. Most of the thesis (Chapters 3 through 7) is devoted to critical exponents. Chapter 3 is a survey of previous research on critical exponents and repetitions in morphic words. In Chapter 4 we prove that every real number greater than 1 is the critical exponent of some right-infinite word over some finite alphabet. Our proof is constructive. In Chapter 5 we characterize critical exponents of pure morphic words generated by uniform binary morphisms. We also give an explicit formula to compute these critical exponents, based on a well-defined prefix of the infinite word. In Chapter 6 we generalize our results to pure morphic words generated by non-erasing morphisms over any finite alphabet. We prove that critical exponents of such words are algebraic, of a degree bounded by the alphabet size. Under certain conditions, our proof implies an algorithm for computing the critical exponent. We demonstrate our method by computing the critical exponent of some families of infinite words. In particular, in Chapter 7 we compute the critical exponent of the Arshon word of order n for n ≥ 3. The stabilizer of an infinite word w defined over a finite alphabet Σ is the set of morphisms f: Σ*→Σ* that fix w. In Chapter 8 we study various problems related to stabilizers and their generators. We show that over a binary alphabet, there exist stabilizers with at least n generators for all n. Over a ternary alphabet, the monoid of morphisms generating a given infinite word by iteration can be infinitely generated, even when the word is generated by iterating an invertible primitive morphism. Stabilizers of strict epistandard words are cyclic when non-trivial, while stabilizers of ultimately strict epistandard words are always non-trivial. For this latter family of words, we give a characterization of stabilizer elements. We conclude with a list of open problems, including a new problem that has not been addressed yet: the D0L repetition threshold.

Programming is a very complex activity that has many simultaneous learning elements. The area of Live-programming offers possibilities for enhancing programming work by speeding up the feedback loop and providing means for reducing the cognitive load on the working memory during the task. This could allow for better education for novice programmers. In this work a number of systems with a shared aim of providing educational tools for scholars from compulsory level to undergraduate college were studied. The common approach in the majority of the tools was to use program abstractions like tangible morphs, playing cards, capsules for code segments, and visual stories. For the user these abstractions and tools offer better focus on the constructive and creative side of programming because they relieve the user from the cumbersome work of writing program code, but they also sacrifice some of the expressiveness of a low-level language. A Live programming system, called PyMorphic, based on the Morphic model was built in the Python programming language. Two different solutions, based on the Wx toolkit for Python, were constructed and evaluated. The results show that Morphic and Python go well together because Python is a programming language that allows for compact and dynamic code. PyMorphic was evaluated with the cognitive dimensions framework and theories on cognitive load and working memory. A user attitude test was performed and the results showed that the users had a positive attitude towards the PyMorphic system. The PyMorphic project is open-source and it is hosted on Sourceforge. The code can be downloaded from the project web-site: http://pymorphic.sourceforge.net. Anyone is welcome to take part in further development of PyMorphic.

abstract: Phenotypic and molecular profiling demonstrates a high degree of heterogeneity in the breast tumors. TP53 tumor suppressor is mutated in 30% of all breast tumors and the mutation frequency in basal-like subtype is as high as 80% and co-exists with several other somatic mutations in different genes. It was hypothesized that tumor heterogeneity is a result of a combination of neo-morphic functions of specific TP53 driver mutations and distinct co-mutations or the co-drivers for each type of TP53 mutation. The 10 most common p53 missense mutant proteins found in breast cancer patients were ectopically expressed in normal-like mammary epithelial cells and phenotypes associated with various hallmarks of cancer examined. Supporting the hypothesis, a wide spectrum of phenotypic changes in cell survival, resistance to apoptosis and anoikis, cell migration, invasion and polarity was observed in the mutants compared to wildtype p53 expressing cells. The missense mutants R248W, R273C and Y220C were most aggressive. Integrated analysis of ChIP and RNA seq showed distinct promoter binding profiles of the p53 mutant proteins different than wildtype p53, implying altered transcriptional activity of mutant p53 proteins and the phenotypic heterogeneity of tumors. Enrichment and model-based pathway analyses revealed dysregulated adherens junction and focal adhesion pathways associated with the aggressive p53 mutants. As several somatic mutations co-appear with mutant TP53, we performed a functional assay to fish out the relevant collaborating driver mutations, the co-drivers. When PTEN was deleted by CRISPR-Cas9 in non-invasive p53-Y234C mutant cell, an increase in cell invasion was observed justifying the concept of co-drivers. A genome wide CRISPR library-based screen on p53-Y234C and R273C cells identified separate candidate co-driver mutations that promoted cell invasion. The top candidates included several mutated genes in breast cancer patients harboring TP53 mutations and were associated with cytoskeletal and apoptosis resistance pathways. Overall, the combined approach of molecular profiling and functional genomics screen highlighted distinct sets of co-driver mutations that can lead to heterogeneous phenotypes and promote aggressiveness in cells with different TP53 mutation background, which can guide development of novel targeted therapies. / Dissertation/Thesis / Doctoral Dissertation Biochemistry 2019

This Master's thesis is about web browser Scamper in Squeak Smalltalk system environment, it's actual progress, new design and implementation, which respect CSS box model and visual formatting model including tables. Also describe web browsers generally and Internet technologies such HTTP protocol, or structure MIME. Next part of this document is describing Squeak Smalltalk system and it's graphic environment Morphic.

Submitted by Maike Costa (maiksebas@gmail.com) on 2016-03-28T11:10:07Z No. of bitstreams: 1 arquivototal.pdf: 800250 bytes, checksum: 42e76ab05ea580b4fd24a3312b9b4212 (MD5) / Made available in DSpace on 2016-03-28T11:10:07Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 800250 bytes, checksum: 42e76ab05ea580b4fd24a3312b9b4212 (MD5) Previous issue date: 2015-04-30 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / Morphic numbers are numbers related to the form and, somehow, they establish a conception of beauty, aesthetics and harmony. These numbers have important of applications in various branches of knowledge, such as geometry, arithmetic, architecture, and engineering. There are only two morphic numbers, the golden number and the plastic number. The rst one has been studied since ancient Greece, and the second one has only become a subject of interest in the twentieth century, what makes the plastic number a relatively new branch of research. In this work, we will analyze a data collection concerning arithmetic, algebraic or geometric properties of these numbers, by establishing a straight relation between the morphic numbers and the Fibonacci and Padovan sequences. / Os números mór cos são números relacionados à forma e que, de alguma maneira, estabelecem uma concepção de beleza, estética e harmonia. Esses números possuem uma série de aplicações em vários ramos do conhecimento, como geometria, aritmética, arquitetura e engenharia. Existem apenas dois números mór cos, o número de ouro e o número plástico, o primeiro deles é estudado desde a antiga Grécia e o segundo passou a ser estudado no século XX, o que torna o assunto relativamente novo. Traremos neste trabalho uma coleção de informações acerca desses números, sejam propriedades aritméticas, algébricas ou geométricas, estabelecendo um paralelo muito forte entre os mesmos e também como eles se relacionam com as sequências de Fibonacci e Padovan.

Cette thèse est composée de deux parties : l’une traite des propriétés combinatoires de mots infinis et l’autre des problèmes de colorations des graphes.La première partie du manuscrit concerne les structures régulières dans les mots apériodiques infinis, à savoir les sous-séquences arithmétiques et les premiers retours complets.Nous étudions la fonction qui donne la longueur maximale d’une sous-séquence arithmétique monochromatique (une progression arithmétique) en fonction de la différence commune d pour une famille de mots morphiques uniformes, qui inclut le mot de Thue-Morse. Nous obtenons la limite supérieure explicite du taux de croissance de la fonction et des emplacements des progressions arithmétiques de longueurs maximales et de différences d. Pour étudier des sous-séquences arithmétiques périodiques dans des mots infinis, nous définissons la notion d'indice arithmétique et obtenons des bornes supérieures et inférieures sur le taux de croissance de la fonction donnant l’indice arithmétique dans la même famille de mots.Dans la même veine, une autre question concerne l’étude de deux nouvelles fonctions de complexité de mots infinis basées sur les notions de mots ouverts et fermés. Nous dérivons des formules explicites pour les fonctions de complexité ouverte et fermée pour un mot d'Arnoux-Rauzy sur un alphabet de cardinalité finie.La seconde partie de la thèse traite des colorations parfaites (des partitions équitables) de graphes infinis de degré borné. Nous étudions les graphes de Caley de groupes additifs infinis avec un ensemble de générateurs fixé. Nous considérons le cas où l'ensemble des générateurs est composé d'entiers de l'intervalle [-n, n], et le cas où les générateurs sont des entiers impairs de [-2n-1, 2n+1], où n est un entier positif. Pour les deux familles de graphes, nous obtenons une caractérisation complète des colorations parfaites à deux couleurs / The content of the thesis is comprised of two parts: one deals with combinatorial properties of infinite words and the other with graph coloring problems.The first main part of the manuscript concerns regular structures in infinite aperiodic words, such as arithmetic subsequences and complete first returns.We study the function that outputs the maximal length of a monochromatic arithmetic subsequence (an arithmetic progression) as a function of the common difference d for a family of uniform morphic words, which includes the Thue-Morse word. We obtain the explicit upper bound on the rate of growth of the function and locations of arithmetic progressions of maximal lengths and difference d. To study periodic arithmetic subsequences in infinite words we define the notion of an arithmetic index and obtain upper and lower bounds on the rate of growth of the function of arithmetic index in the same family of words.Another topic in this direction involves the study of two new complexity functions of infinite words based on the notions of open and closed words. We derive explicit formulae for the open and closed complexity functions for an Arnoux-Rauzy word over an alphabet of finite cardinality.The second main part of the thesis deals with perfect colorings (a.k.a. equitable partitions) of infinite graphs of bounded degree. We study Caley graphs of infinite additive groups with a prescribed set of generators. We consider the case when the set of generators is composed of integers from the interval [-n,n], and the case when the generators are odd integers from [-2n-1,2n+1], where n is a positive integer. For both families of graphs, we obtain a complete characterization of perfect 2-colorings