Code and its image: the functions of text and visualisation in a code-based design studio

Traditionally, design learning in the architecture studio has taken place through a combination of individual work and joint projects. The introduction of code-based design practices in the design studio has altered this balance, introducing new models of joint authorship and new ways for individuals to contribute to co-authored projects. This paper presents a case study describing four design studios in a higher education setting that used code as a tool for generating architectural geometry. The format of the studios encouraged the students to reflect critically on their role as authors and to creatively address the multiple opportunities for shared authorship available with code-based production. The research question addressed in this study involved the role of code-based practices in altering the model of architectural education in the design studio, in particular the role of visual representations of a code-based design process in the production of shared knowledge

Mumford dendrograms and discrete p-adic symmetries

In this article, we present an effective encoding of dendrograms by embedding them into the Bruhat-Tits trees associated to $p$-adic number fields. As an application, we show how strings over a finite alphabet can be encoded in cyclotomic extensions of $\mathbb{Q}_p$ and discuss $p$-adic DNA encoding. The application leads to fast $p$-adic agglomerative hierarchic algorithms similar to the ones recently used e.g. by A. Khrennikov and others. From the viewpoint of $p$-adic geometry, to encode a dendrogram $X$ in a $p$-adic field $K$ means to fix a set $S$ of $K$-rational punctures on the $p$-adic projective line $\mathbb{P}^1$. To $\mathbb{P}^1\setminus S$ is associated in a natural way a subtree inside the Bruhat-Tits tree which recovers $X$, a method first used by F. Kato in 1999 in the classification of discrete subgroups of $\textrm{PGL}_2(K)$. Next, we show how the $p$-adic moduli space $\mathfrak{M}_{0,n}$ of $\mathbb{P}^1$ with $n$ punctures can be applied to the study of time series of dendrograms and those symmetries arising from hyperbolic actions on $\mathbb{P}^1$. In this way, we can associate to certain classes of dynamical systems a Mumford curve, i.e. a $p$-adic algebraic curve with totally degenerate reduction modulo $p$. Finally, we indicate some of our results in the study of general discrete actions on $\mathbb{P}^1$, and their relation to $p$-adic Hurwitz spaces.Comment: 14 pages, 6 figure

Chirality Properties of Modeling Water in Different Aqueous Systems

The research addresses the problem of chirality existence in modeling water with various impurity molecules using new numerical algorithm of chirality determination. It is based on asymmetry analysis of molecular system composed of water molecules. The following molecular systems are investigated: (1) small water clusters such as (H2O)n, K+(H2O)m, and Na+(H2O)m (n = 4÷8, m = 5÷10) at temperature 1 K; (2) (H2O)n, K+(H2O)p, and Na+(H2O)p (n = 4÷9, p = 5÷8) at temperature 300 K; and (3) chiral biological molecules of L-valine, D-valine, L-glycerose, and D-glycerose and left or right water clusters (H2O)4 with water molecule’s shell with thickness varied from 4 to 14 Å with a step of 2 Å. The systems (1), (2) are investigated by Monte Carlo method and the interaction is simulated with Poltev-Malenkov potentials. Systems (3) are initiated using Solvate software, and then aqueous systems are optimized by the conjugate gradient algorithm using the MMFF94 potential. It is revealed that there is no predominance of right-handed or lefthanded substructures in all studied configurations of water molecules. But in small aqueous systems (2), (3), the number of types of water structures, taking into account chirality, depends on the presence of impurity ion and its type

Development of strain tolerant thermal barrier coating systems, tasks 1 - 3

Insulating ceramic thermal barrier coatings can reduce gas turbine airfoil metal temperatures as much as 170 C (about 300 F), providing fuel efficiency improvements greater than one percent and durability improvements of 2 to 3X. The objective was to increase the spalling resistance of zirconia based ceramic turbine coatings. To accomplish this, two baseline and 30 candidate duplex (layered MCrAlY/zirconia based ceramic) coatings were iteratively evaluated microstructurally and in four series of laboratory burner rig tests. This led to the selection of two candidate optimized 0.25 mm (0.010 inch) thick plasma sprayed partially stabilized zirconia ceramics containing six weight percent yttria and applied with two different sets of process parameters over a 0.13 mm (0.005 inch) thick low pressure chamber sprayed MCrAlY bond coat. Both of these coatings demonstrated at least 3X laboratory cyclic spalling life improvement over the baseline systems, as well as cyclic oxidation life equivalent to 15,000 commercial engine flight hours

A NWB-based dataset and processing pipeline of human single-neuron activity during a declarative memory task

A challenge for data sharing in systems neuroscience is the multitude of different data formats used. Neurodata Without Borders: Neurophysiology 2.0 (NWB:N) has emerged as a standardized data format for the storage of cellular-level data together with meta-data, stimulus information, and behavior. A key next step to facilitate NWB:N adoption is to provide easy to use processing pipelines to import/export data from/to NWB:N. Here, we present a NWB-formatted dataset of 1863 single neurons recorded from the medial temporal lobes of 59 human subjects undergoing intracranial monitoring while they performed a recognition memory task. We provide code to analyze and export/import stimuli, behavior, and electrophysiological recordings to/from NWB in both MATLAB and Python. The data files are NWB:N compliant, which affords interoperability between programming languages and operating systems. This combined data and code release is a case study for how to utilize NWB:N for human single-neuron recordings and enables easy re-use of this hard-to-obtain data for both teaching and research on the mechanisms of human memory

On Long Words Avoiding Zimin Patterns

A pattern is encountered in a word if some infix of the word is the image of the pattern under some non-erasing morphism. A pattern p is unavoidable if, over every finite alphabet, every sufficiently long word encounters p. A theorem by Zimin and independently by Bean, Ehrenfeucht and McNulty states that a pattern over n distinct variables is unavoidable if, and only if, p itself is encountered in the n-th Zimin pattern. Given an alphabet size k, we study the minimal length f(n,k) such that every word of length f(n,k) encounters the n-th Zimin pattern. It is known that f is upper-bounded by a tower of exponentials. Our main result states that f(n,k) is lower-bounded by a tower of n-3 exponentials, even for k=2. To the best of our knowledge, this improves upon a previously best-known doubly-exponential lower bound. As a further result, we prove a doubly-exponential upper bound for encountering Zimin patterns in the abelian sense