On slender 0L languages

AbstractWe give a complete proof of Theorem 3.1 in [2]. A pathological exception of Theorem 4.3 in [2] is exhibited and a condition to remove it is mentioned

Pure 2D picture grammars and languages

A new syntactic model, called pure two-dimensional (2D) context-free grammar (P2DCFG), is introduced based on the notion of pure context-free string grammar. The rectangular picture generative power of this 2D grammar model is investigated. Certain closure properties are obtained. An analogue of this 2D grammar model called pure 2D hexagonal context-free grammar (P2DHCFG) is also considered to generate hexagonal picture arrays on triangular grids

Numerical Analysis and Spanwise Shape Optimization for Finite Wings of Arbitrary Aspect Ratio

This work focuses on the development of efficient methods for wing shape optimization for morphing wing technologies. Existing wing shape optimization processes typically rely on computational fluid dynamics tools for aerodynamic analysis, but the computational cost of these tools makes optimization of all but the most basic problems intractable. In this work, we present a set of tools that can be used to efficiently explore the design spaces of morphing wings without reducing the fidelity of the results significantly. Specifically, this work discusses automatic differentiation of an aerodynamic analysis tool based on lifting line theory, a light-weight gradient-based optimization framework that provides a parallel function evaluation capability not found in similar frameworks, and a modification to the lifting line equations that makes the analysis method and optimization process suitable to wings of arbitrary aspect ratio. The toolset discussed is applied to several wing shape optimization problems. Additionally, a method for visualizing the design space of a morphing wing using this toolset is presented. As a result of this work, a light-weight wing shape optimization method is available for analysis of morphing wing designs that reduces the computational cost by several orders of magnitude over traditional methods without significantly reducing the accuracy of the results

Minimal Synthesis of String To String Functions From Examples

We study the problem of synthesizing string to string transformations from a set of input/output examples. The transformations we consider are expressed using deterministic finite automata (DFA) that read pairs of letters, one letter from the input and one from the output. The DFA corresponding to these transformations have additional constraints, ensuring that each input string is mapped to exactly one output string. We suggest that, given a set of input/output examples, the smallest DFA consistent with the examples is a good candidate for the transformation the user was expecting. We therefore study the problem of, given a set of examples, finding a minimal DFA consistent with the examples and satisfying the functionality and totality constraints mentioned above. We prove that, in general, this problem (the corresponding decision problem) is NP-complete. This is unlike the standard DFA minimization problem which can be solved in polynomial time. We provide several NP-hardness proofs that show the hardness of multiple (independent) variants of the problem. Finally, we propose an algorithm for finding the minimal DFA consistent with input/output examples, that uses a reduction to SMT solvers. We implemented the algorithm, and used it to evaluate the likelihood that the minimal DFA indeed corresponds to the DFA expected by the user.Comment: SYNT 201

Ethics of Robotic Aesthetics

This article explores the relationship between expressivity morphology and acceptance, defining the conditions that make service robots desirable by man. In the attempt to define “an ethic for robotic aesthetics”, it is discussed the evolution happened in robot design and how they where perceived by people, both in scientific community and in pop culture. The conception of robots begin with an approach strongly oriented to a biological imitation, especially anthropomorphic, conversely, nowadays, the scenario is various and robots assume a multitude of synthetic aesthetic languages and, moreover, are characterized on the base of the context. In the final part of this article, it is described, through a series of examples, the contemporary scenario in which to the multitude of languages is added also the contamination of the digital world, outlining new morphological types. One of the examples is Virgil, a service robot for Cultutal Heritage enhancement, designed by the research team JOLCRAB Telecom Italia/Politecnico di Torino

Madame Chrysanthemum’s Sisters

English translation of two articles published in the newspaper Le Temps by Adolphe Brisson in April and May 1900. They are dedicated to the twelve geishas brought from Japan to perform at the Panorama du Tour du monde, the sisters of Pierre Loti\u27s “Madame Chrysanthemum” (the model for Puccini\u27s Madama Butterfly). Brisson\u27s interviews with a number of figures important for Japonisme (Hayashi and Bigot, in particular) provide insights into Franco-Japanese relations in 1900 and to the living and working conditions of foreign performers at the Paris Exposition

Curtis\u27s botanical magazine.

v.92=ser.3:v.22 (1866) [no.5552-5617