No description available.

This project accomplished two correlated goals of designing a new rotor blade to be used with the Cal Poly Wind Power Research Center, as well as defining the methodology required for the aerodynamic analysis of an optimized blade, the procedure required for generation of an accurate CAD model for the new blade geometry, and structural integrity verification procedure for the new blade via finite element analysis under several operating scenarios. The new rotor blades were designed to perform at peak efficiency at a much lower wind speed than the current CPWPRC rotor blades and incorporated a FEA verification process which was not performed on the earlier rotor blade design. Since the wind characteristics relative to the location of the CPWPRC are essentially unchanging the most viable option, in regards to generating power for longer periods of time, is to redesign the HAWT rotor to capture more of the wind energy available. To achieve this, the swept area of the rotor was increased, suitable airfoils were utilized, and the new rotor blades were optimized to maximize their performance under the CPWPRC location’s wind conditions. With an increased magnitude of wind energy being captured the aerodynamic loading on the rotor blades simultaneously increased which necessitated a structural analysis step to be implemented, both with classical hand calculations and with the assistance of an adequate FEA program, to ensure the new rotor blades did not fail under normal or extreme wind conditions. With the completion of this project the new rotor blade designed and analyzed in this report may be finalized and refined in order to be incorporated into the CPWPRC system in the future or the methodology defined throughout this project may be used to design an entirely different aerodynamically optimized rotor blade, including a CAD model and FEA structural integrity verification, as well.

Yes / Modern manufacturing companies face increased pressures to adapt to shorter product life cycles and the need to reconfigure more frequently their production systems to offer new product variants. This paper proposes a new multi-agent architecture utilising “plug and produce” principles for configuration and reconfiguration of production systems with minimum human intervention. A new decision-making approach for system reconfiguration based on tasks re-allocation is presented using goal driven methods. The application of the proposed architecture is described with a number of architectural views and its deployment is illustrated using a validation scenario implemented on an industrial assembly platform. The proposed methodology provides an innovative application of a multi-agent control environment and architecture with the objective of significantly reducing the time for deployment and ramp-up of small footprint assembly systems. / The reported research has been part of the EU FP7 research project “PRIME”

<p> In this thesis, we undertake a study of imperative reasoning. Beginning with a philosophical analysis of the distinction between imperative and functional language features, we define a (pure) imperative language as one whose constructs are inherently referentially opaque. We then give a definition of a reasoning language by identifying desirable properties such a language should have.</p> <p> The rest of the thesis presents a new pure imperative reasoning language, Assignment Calculus AC. The main idea behind AC is that R. Montague's modal operators of intension and extension are useful tools for modeling procedures in programming languages. This line of thought builds on T. Janssen's demonstration that Montague's intensional logic is well suited to dealing with assignment statements, pointers, and other difficult features of imperative languages.</p> <p> AC consists of only four basic constructs, assignment 'X := t', sequence 't; u', procedure formation 'it' and procedure invocation '!t'. Three interpretations are given for AC: an operational semantics, a denotational semantics, and a term-rewriting system. The three are shown to be equivalent. Running examples are used to illustrate each of the interpretations.</p> <p> Five variants of AC are then studied. By removing restrictions from AC's syntactic and denotational definitions, we can incorporate L-values, lazy evaluation, state backtracking, and procedure composition into AC. By incorporating procedure composition, we show that AC becomes a self-contained Turing complete language in the same way as the untyped λ-calculus: by encoding numerals, Booleans, and control structures as AC terms. Finally we look at the combination of AC with a typed λ-calculus.</p> / Thesis / Doctor of Philosophy (PhD)

Abstract Not Provided. / Thesis / Candidate in Philosophy

<p> This thesis is concerned with control procedures employed in Pavlovian conditioning, in particular, the "truly random" control. Pilot work indicated that this procedure employed in a CER paradigm resulted in response suppression. Our first objective then was to examine this finding in a more formal experiment, as well as attempting to determine the cause of the observed suppression. In a second experiment, a variable predicted to affect the amount of conditioning within traditional conditioning theory was employed to determine the possible role of this variable in suppression produced by the random control procedure.</p> <p> It was found, in the first experiment, that two variations of the random procedure resulted in suppression in testing. The results of a third group indicated that the suppression was not due to a between-session discriminative function of the CS. A fourth group demonstrated, within contingency logic, inhibitory control, but this group, like the others, showed suppression.</p> <p> In the second experiment, variations of stimulus conditions, none of which made the US contingent on the CS, resulted in marked differences in suppression in testing. Further, significantly different recovery rates of the operant baseline were noted both as a function of the recovery condition and of the CS employed in training.</p> / Thesis / Master of Arts (MA)

No description available.

No description available.

No description available.

No description available.