Concept Fire Truck

A prototype Concept Fire Truck was designed using Autodesk Inventor 3D Design Software. Various pictures of old-time and toy fire trucks were utilized for this project. The prototype was printed using a 3D printer to verify that all parts of the truck would fit and work as intended.https://digitalcommons.mtech.edu/stdt_rsch_day_2013/1006/thumbnail.jp

Decomposition and Descriptional Complexity of Shuffle on Words and Finite Languages

We investigate various questions related to the shuffle operation on words and finite languages. First we investigate a special variant of the shuffle decomposition problem for regular languages, namely, when the given regular language is the shuffle of finite languages. The shuffle decomposition into finite languages is, in general not unique. Thatis,therearelanguagesL^,L2,L3,L4withLiluL2= £3luT4but{L\,L2}^ {I/3, L4}. However, if all four languages are singletons (with at least two combined letters), it follows by a result of Berstel and Boasson [6], that the solution is unique; that is {L\,L2} = {L3,L4}. We extend this result to show that if L\ and L2 are arbitrary finite sets and Lz and Z-4 are singletons (with at least two letters in each), the solution is unique. This is as strong as it can be, since we provide examples showing that the solution can be non-unique already when (1) both L\ and L2 are singleton sets over different unary alphabets; or (2) L\ contains two words and L2 is singleton. We furthermore investigate the size of shuffle automata for words. It was shown by Campeanu, K. Salomaa and Yu in [11] that the minimal shuffle automaton of two regular languages requires 2mn states in the worst case (where the minimal automata of the two component languages had m and n states, respectively). It was also recently shown that there exist words u and v such that the minimal shuffle iii DFA for u and v requires an exponential number of states. We study the size of shuffle DFAs for restricted cases of words, namely when the words u and v are both periods of a common underlying word. We show that, when the underlying word obeys certain conditions, then the size of the minimal shuffle DFA for u and v is at most quadratic. Moreover we provide an efficient algorithm, which decides for a given DFA A and two words u and v, whether u lu u C L(A)

The Choral Embodiment of Oedipus: Sacramental Performance in Oedipus at Colonus and Gospel at Colonus

In researching the original performances of Sophocles’s Oedipus at Colonus, contemporary composer Lee Breuer concluded that Ancient Greek productions were “close to rock concerts” full with “responses from the audience like choral or choir responses in the church.” What Breuer recognized was that Sophoclean performances were lively and engaging to their audiences, inviting them to participate and help tell the story being dramatized on stage. What he also recognized was the sacramental power of performance in Ancient Greek tragedies, when a spirit is gifted from performer to viewer. This spirit is passed through the rhythm and meter of the language, but only as sung, as embodied. This focus on the performance of the Sophoclean piece shifted importance from the meaning of the words used to the ways in which the words were being sung. Because Breuer grasped the power of music in Sophoclean tragedy, his re-creation of Sophocles’s play, Gospel at Colonus, unearthed a sacramental capacity in the original Sophoclean text. By comparing Sophocles’s Oedipus at Colonus and Breuer’s Gospel at Colonus, we can begin to see how music works to imbue a sacramental power in the story of Oedipus. As I propose to demonstrate, the conclusions of both Sophocles’s and Breuer’s plays relate the embodiment of Oedipus by the chorus. But that embodiment does not simply occur within the narrative or even within its dramatization by actors on stage; it occurs within the music, allowing us—as scholars—to be enlightened about the role of music in Ancient Greek tragedy, and—as audiences—to be enlivened by the sacramental power of performance

Past with Present: A Design Process

The design process detailed in this thesis addresses how a designer brings a design that is both relevant but dated into the present. Four stages make up the design process: investigation, scattered design, design réseau, and focused design, and the process covers the choice of artifact, historical and cultural research, and the conclusions derived from research. The chandelier acts as artifact in this design process iteration. The goal of the thesis project is a process that stresses both innovation as well as the cultural and symbolic importance of older designs; the outcome of this design iteration is honed chandelier concepts with prototypes

Report on Activities of the Financial Accounting Foundation, As Presented at the AICPA Spring Council meeting, May 9, 1973

https://egrove.olemiss.edu/aicpa_assoc/1933/thumbnail.jp

On the Shuffle Automaton Size for Words

We investigate the state size of DFAs accepting the shuffle of two words. We provide words u and v, such that the minimal DFA for u shuffled with v requires an exponential number of states. We also show some conditions for the words u and v which ensure a quadratic upper bound on the state size of u shuffled with v. Moreover, switching only two letters within one of u or v is enough to trigger the change from quadratic to exponential

Parallel Solution of Large-Scale Dynamic Optimization Problems

This paper presents a decomposition strategy applicable to DAE constrained optimization problems. A common solution method for such problems is to apply a direct transcription method and to solve the resulting non-linear program using an interior point algorithm, where the time to solve the linearized KKT system at each iteration is dominating the total solution time. In the proposed method, the structure of the KKT system resulting from a direct collocation scheme for approximating the DAE constraint is exploited in order to distribute the required linear algebra operations on multiple processors. A prototype implementation applied to benchmark models shows promising results