MULTIGROUP DIFFUSION THEORY FORMULATION OF THE CALCULATION OF THE MEAN SQUARE SLOWING DOWN DISTANCE IN AN INFINITE MEDIUM

Simple expressions for the mean square distance from a point fission source for slowing down past a given energy and for the mean square distance of neutrons that belong to a given energy group are derived within the framework of multigroup diffusion theory. The expressions may be applied to systems having arbitrary group transfer cross sections. (auth

Use of Commercial Off the Shelf GPS Technology to Solve Guidance Problems with the Improved Tactical Air Launched Decoy (ITALD)

As the capabilities of threat surface-to-air missile systems increased, the US Navy looked to improve upon the performance of the Tactical Air Launched Decoy (TALD), an air launched glider vehicle with switchblade wings designed to resemble attacking aircraft to confuse and saturate enemy air defenses. In the early 1990’s the contractor proposed the Improved Tactical Air Launched Decoy (ITALD), a turbo jet powered air-launched vehicle which tripled the existing range and added a radar altimeter to simulate low level attacks. In 1998, after several design iterations, the Naval Air Warfare Center at Point Mugu tested the ITALD for suitability in the defense suppression mission and found major deficiencies with the navigation system and product reliability. The contractor resolved the reliability issues; however the navigation system, a simple dead reckoning 2-axis gyro and flight computer, needed improvement. The ITALD navigation system drifted excessively causing the decoy to drift off course and out of field of regard of the intended surface-to-air missile systems. Incorporating a commercial of the shelf (COTS) global positioning system (GPS) proved to be an effective, expeditious and inexpensive solution to the vehicle’s navigational problems. In 2001, the new ITALD-GPS was tested during five flights with mostly satisfactory results. The opinions, analysis and conclusions expressed in this thesis are those of the author and have not been officially endorsed by the Department of the Navy, Naval Air Systems Command, or Israeli Military Industries, LTD

Syntactical consistency proofs for term induction revisited

GIn [6] wird von Gerhard Gentzen die Widerspruchsfreiheit der Peano Arithmetik erster Stufe PA bewiesen. Die Methode geht dabei folgendermaßen vor: Man deniert einen simplen Teil SPA der Peano Arithmetik (SPA enthält im speziellen keine Anwendung des Induktionsschemas) und zeigt zuerst die von SPA. Der Rest des Arguments verläuft indirekt. Man nimmt an, dass PA einen Widerspruch ableitet und zeigt das dessen Deduktion zu einer Deduktion in SPA transformiert werden kann, was der Widerspruchsfreiheit von SPA widerspricht. Diese Transformation verläuft wie folgt: Jeder Deduktion in PA wird eine Ordinalzahl (oder genauer, ein Ordinalzahlterm eines Ordinalzahlnotations Systems) zugeordnet, diese wird der Rang der Deduktion genannt. Dann wird gezeigt, dass es zu jeder Deduktion eines Widerspruches (die nicht in SPA verläuft) eine Deduktion (ebenfalls eines Widerspruches) gibt die einen kleineren Rang hat. Diese Methode benötigt daher die Wohlfundiertheit des verwendeten Ordinalzahlnotations Systems (in diesem Fall bis "0). Bei näherer Betrachtung von Gentzens Methode fällt auf, dass sie lediglich folgende Eigenschaften von PA verwendet: 1. Alle Axiome von PA sind Allsätze oder Instanzen des Induktionsschemas φ(0) ^ ∀ x[φ(x) -> φ(x + 1)] -> ∀ xφ(x): 2. Alle geschlossenen Terme sind beweisbar (in SPA) gleich zu einem Term der lediglich aus 0 und dem Symbol der Nachfolgerfunktion aufgebaut ist. Dies erlaubt eine Verallgemeinerung von Gentzens Methode. In dieser Diplomarbeit werden wir daher Theorien Tf = (Tf )0 [ (Tf )Ind betrachten die folgende Eigenschaften erfüllen: 1. (Tf )0 besteht lediglich aus Allsätzen. 2. (Tf )Ind beinhaltet alle Instanzen des Induktionsschemas φ(c1)^:::^φ(cm)^∀ ~x[φ(x1)^:::^φ(xn) -> φ(f(x1; :::; xn))] -> ∀ xφ(x): 3. Der simple Teil von Tf beweist für jeden geschlossenen Term t, dass t gleich einem Term _t ist der lediglich aus den symbolen c1; :::; cm und f aufgebaut ist. Die Widerspruchsfreiheit von Tf kann nun, wie in [6] für PA, relativ zu ihrem simplen Teil (wo Induktion wie zuvor bei Gentzen nicht möglich ist) gezeigt werden. Eine Konsequenz dieses Resultates ist das folgende Korollar. Korollar. Sei φ(a) quantorenfrei und Tf widerspruchsfrei. Wenn Tf j= 9xφ(x), dann (Tf )0 j= 9xφ(x). Insbesondere ist Tf _0 1 -konservativ über (Tf )0. Es scheint mir als wäre die Methode, die von Kurt Schütte in seinem Widerspruchsfreiheitsbeweis von PA verwendet wird, eine gänzlich andere. Schütte, Tait und Andere verwenden Kalküle mit unendlichen Deduktionsregeln um, in einem gewissen Sinne, die Beweistheoretische Ordinalzahl einer Theorie zu berechnen. Dies erfolgt über eine Transformation der endlichenDeduktionen der Theorie (in der Logik erster Stufe) in Deduktionen ineinem unendlichen Kalkül, das Schnittelimination erlaubt. Im Gegensatz zu Gentzens Methode hat die von Schütte eine enge Beziehung zu den beweistheoretischenOrdinalzahlen. Auf die Unterschiede der beiden Methoden wird nicht weiter eingegangen werden. Anstatt dieses Vergleiches wird lediglich eine Variante von Taits Methode dazu verwendet die _1 1-Ordinalzahl, wie von Wolfram Pohlers in [∀ ] beschrieben, von Theorien TAf (aufgefasst als Taitkalkühl) zu messen. Es wird angenommen das TAf folgende Eigenschaften erfüllt: 1. TAf enthält für jede primitiv rekursive Funktion die denierenden Formeln als Axiome. 2. Weiters enthält TAf alle Instanzen des Schemas φ(c1)^:::^φ(cm)^∀ ~x[φ(x1)^:::^φ(xn) -> φ(f(x1; :::; xn))] -> ∀ xφ(x): Hierbei ist f ein m-stelliges Symbol einer gleichstelligen primitiv rekursiven Funktion und c1; :::; cl Individuenkonstanten. 3. Es wird außerdem angenommen das jedes n 2 N gleich einer Komposition aus fN und den natürlichen Zahlen cN1;:::; cN l ist.Gerhard Gentzen proves the consistency of first-order Peano arithmetic \textbf{PA}. His method works as follows: Define a simple part \textbf{SPA} of peano arithmetic (\textbf{SPA} does in particular not contain induction) and first show the consistency of \textbf{SPA}. Now assume towards a contradiction that \textbf{PA} deducts an contradiction. Show that this deduction can be transformed into a deduction in \textbf{SPA}, this contradicts the consistency of \textbf{SPA}. How to get a deduction in \textbf{SPA}: We assign an ordinal (more exact an ordinal term of an ordinal notation system) to each deduction in \textbf{PA}, called the rank of the deduction. Next show that for each deduction which deducts a contradiction (and is not in \textbf{SPA}) there is a deduction (also deducting and contradiction) with smaller rank. This method requires that the ordinal notation system (which goes up to $\varepsilon_0$) is well-founded. It turns out that Gentzen's method requires only to the following properties of \textbf{PA}: \begin{enumerate} \item All axioms of \textbf{PA} are universal sentences or instances of the induction schema $$\varphi(0) \wedge \forall x [\varphi(x) \rightarrow \varphi(x+1)] \rightarrow \forall x \varphi(x).$$ \item All closed terms are provable equal to a term build up just from $0$ and the symbol of the successor function. \end{enumerate} This allows a slight generalisation of Gentzen's method. In this Diploma Thesis we consider theories $T_f = (T_f)_0 \cup (T_f)_{\text{Ind}}$ with the following properties: \begin{enumerate} \item $(T_f)_0$ contains only universal sentences. \item $(T_f)_{\text{Ind}}$ contains all instances of the general induction schema $$\varphi(c_1)\wedge ... \wedge \varphi(c_m) \wedge \forall \vec{x} [\varphi(x_1)\wedge...\wedge \varphi(x_n) \rightarrow \varphi(f(x_1,...,x_n))] \rightarrow \forall x \varphi(x).$$ \item The simple part of $T_f$ proves for every closed term $t$ the equality of $t$ to a term $\bar{t}$ build up just from $c_1,...,c_m$ and $f$. \end{enumerate} As Gentzen did for \textbf{PA}, the consistency of $T_f$ can be shown with respect to their simple part which corresponds to the simple part of Gentzen (also without induction). As a consequence, one gets the following result for all such theories. \begin{cor2} Assume $\varphi(a)$ is quantifier free and $T_f$ consistent.\\ If $T_f \models \exists x \varphi(x)$, then $(T_f)_0 \models \exists x \varphi(x)$.\\ I.e., $T_f$ is $\Sigma_1^0$-conservative over $(T_f)_0$. \end{cor2} It seems that this method is different in an essential way to the method Kurt Sch\"{u}tte uses in his consistency proof of \textbf{PA}. Sch\"{u}tte, Tait and others uses calculi with infinite deduction rules. These methods compute, in some sense, the proof theoretical ordinal of the considered theory by embedding the deductions of the theory (in ordinary first-order logic) in an infinite system which allows cut-elimination. In contrast to Gentzen's method Sch\"{u}tte's and Tait's methods are closely related to the proof theoretical ordinals.\\ We do not provide an analysis of the disparities of both methods. Instead we present the point of view Wolfram Pohlers propose, to measure the $\Pi_1^1$-ordinal of theories $\mathsf{TA}_f$ (presented as a Tait-calculus) satisfying the following conditions: \begin{enumerate} \item $\mathsf{TA}_f$ includes all defining axioms for primitive recursive functions. \item All instances of the schema $$\varphi(c_1)\wedge ... \wedge \varphi(c_m) \wedge \forall \vec{x} [\varphi(x_1)\wedge...\wedge \varphi(x_n) \rightarrow \varphi(f(x_1,...,x_n))] \rightarrow \forall x \varphi(x)$$ are included. Here $f$ is an $m$-array primitive recursive function constant and $c_1,...,c_l$ are individual constants. \item Every $n \in \mathbb{N}$ is equal to a composition of $f^\mathbb{N}$ and the elements $c_1^\mathbb{N},...,c_l^\mathbb{N}$. \end{enumerate

Fabricação de memórias resistivas dos tipos regravável e worm com nanocompósito de cianoacrilato e nanopartículas de carbono

Orientador: Prof. Dr. Celso de Araújo DuarteTese (doutorado) - Universidade Federal do Paraná, Setor de Ciências Exatas, Programa de Pós-Graduação em Física. Defesa : Curitiba, 15/12/2022Inclui referênciasResumo: Este trabalho apresenta um estudo sobre dispositivos de memória orgânica do tipo resistivas tendo como camada ativa um filme fino de nanocompósito de cianoacrilato e nanoestruturas de carbono de uma única camada. O cianoacrilato foi usado como matriz polimérica por suas vantagens como mudança no subtipo do dispositivo de regravável para WORM (Write Once Read Many Times Memory) controlando apenas o tempo de envelhecimento. Para conferir biestabilidade ao cianoacrilato, que por si só é um ótimo isolante, e possibilitar seu emprego no desenvolvimento das memórias resistivas, adicionou-se quantidade controlada de nanoestruturas condutivas de Carbono (C). As nanoestruturas usadas foram nanopartículas de Carbono (NPC). Os dispositivos apresentaram razões de ION/IOFF da ordem de 104 a 105, revelando eficácia por meio da grande distinção dos estados de bits "0" e "1" e tensão de gravação de 2.0 V, o que é uma tensão baixa quando comparada com as pesquisas da área.Abstract: This work presents a study on organic resistive memory devices with nanostructures/cyanoacrylate thin film nanocomposites as the active layer. Cyanoacrylate was used as a polymer matrix for its advantages such as changing the device subtype from rewritable to WORM (Write Once Read Many Times Memory), controlling only the aging time. In order to provide bistability, since the cyanoacrylate is itself an excellent insulator, enabling its use in the development of resistive memories, a controlled amount of conductive Carbon (C) nanostructures was added. The nanostructures used were Carbon nanoparticles (NPC). The devices showed an ION/IOFF of the order of 104 to 105, revealing efficacy for the application owing to the distinguihability of the "0" and "1" bit states at the recording voltage of 2.0 V, which would be a low voltage when compared to research in the area

Desenvolvimento de memórias orgânicas com base em resina epóxi em mono e multicamadas

Orientador: Prof. Dr. Celso de Araujo DuarteDissertação (mestrado) - Universidade Federal do Paraná, Setor de Ciências Exatas, Programa de Pós-Graduação em Física. Defesa : Curitiba, 28/02/2018Inclui referênciasResumo: Este trabalho apresenta um estudo sobre dispositivos de memória orgânica do tipo WORM (Write Once Read Many times) tendo como camada ativa filmes finos de nanocompósitos de resina epóxi e nanoestruturas de carbono de uma única camada ou em multicamadas. A resina epóxi foi usada como matriz polimérica por suas inúmeras vantagens oferecendo a possibilidade da utilização do mesmo componente na fabricação da camada ativa e no encapsulamento simultaneamente (consistindo na chamada técnica "AW1", previamente criada em nosso grupo de pesquisa, [1,2]). Para conferir biestabilidade à resina (que por si só é um ótimo isolante) e possibilitar seu emprego no desenvolvimento das memórias WORM, adicionou-se quantidade controlada de nanoestruturas condutivas de C. As nanoestruturas usadas foram nanoesferas de C (NEC) e nanopartículas de C (NPC), sendo a primeira utilizada apenas no estudo da sobreposição de camadas (memórias em camadas empilhadas), já que o emprego em monocamada já revelou sucesso em trabalho anterior [1,2]. Os dispositivos apresentaram razões de ION/IOFF da ordem de 105 a 107, revelando eficácia por meio da grande distinção dos estados de bits "0" e "1" e tempo de gravação mínimo com apenas 100 ns. Palavras-chave: Memória WORM, nanoestruturas, resina epóxi, eletrônica orgânica.Abstract: This work presents a study or organic memory devices like WORM (Write Once Read Many times) having as active layer thin films of epoxy resin nanocomposites and single-layer or multi-layer carbon nanostructures. Epoxy resin was used as polymer matrix for its many advantages allowing the possibility of using the same component in the fabrication of the active layer and the encapsulation simultaneously (consisting of the so-called "AW1" technique previously created in our research group [1,2]). In order to confer bistability to the resin (which in itself is a good insulator) and to enable its use in the development of the WORM memories, a controlled fraction of conductive carbon nanostructures was added. The nanostructures used were C nanospheres (NEC) and C nanoparticles (NPC), being the first one used only in the study of layer overlap (memories in stacked layers), since monolayer use has already shown success in a previous job [1,2]. The devices showed ION/IOFF ratios of the order of 105 to 107, revealing efficiency through the great distinction of bit states "0" and "1 and minimum recording time with only 100 ns. Key-words: WORM memory, nanostructures, epoxy resin, organic electronics

Complexities of Proof-Theoretical Reductions

The present thesis is a contribution to a project that is carried out by Michael Rathjen and Andreas Weiermann to give a general method to study the proof-complexity of Pi_2 sentences. This general method uses the generalised ordinal-analysis that was given by Buchholz, Rueede and Strahm as well as the generalised characterisation of provable-recursive functions of PA with axioms for transfinite induction that was given by Weiermann. The present thesis links these two methods by giving an explicit elementary bound, for the proof-complexity increment that occurs after the transition from the theory that was used by Rueede and Strahm, to PA with axioms for transfinite induction, which was analysed by Weiermann

Effect of pH-lowering litter amendment on animal-based welfare indicators and litter quality in a European commercial broiler husbandry

ABSTRACT Several studies have shown that litter moisture is a major reason for foot pad lesions (FPD) and promotes microbial growth of nitrifying bacteria. The aim of the current study was to determine the possible effects of a sodium bisulfate complex (SBS) as a litter additive on FPD, hock burn (HB), and litter parameters. Two application rates of SBS were examined in 2 experiments on a commercial farm. Two groups of about 30,000 broiler chicks each were introduced on spelt granulate spread at 700 g/m² and kept for 36 d. In the first experiment (TRT1), 250 g/m² SBS was spread on top of litter 20 h before chick placement; in the second experiment (TRT2), SBS was reduced to 150 g/m². Each experiment consisted of 1 treatment group (SBS) and a control group without treatment (CON). Both experiments were repeated once. Litter parameters (pH, percentage of dry matter), foot pad, hock condition and body weight of randomly sampled birds (n = 60 per group) were recorded weekly. Mortality rate was higher in SBS groups compared to CON groups (TRT1 2.79 vs. CON 2.03%, TRT2 2.88 vs. CON 2.27%). SBS had no effect on body weight averaged over the whole production period (P> 0.05). Incidence of FPD was significantly reduced in both groups treated with SBS compared to CON (P 0.05) but by dry matter content (

IBM-704 CODES FOR REACTIVITY STEP CALCULATIONS (RE-126 AND RE-135)

Two codes were written for the IBM-704 to calculate the behavior of a reactor following a step change in reactivity, using one-group. space- independent, zero-power kinetic theory. The reactor is assumed to be running at constant level before the step is made, either at critical or subcritical conditions, with an external source. The code RE-128 assumes all delayed-neutron precursors in equilibrium at the time of the step, while the code RE-135 allows cases with nonequilibrium precursors to be handled. RE-126 can handle the case of zero final reactivity. Both codes are written in FORTRAN language. (C.J.G.

Monitoring ammonia as part of flock management in poultry husbandry systems

In der Diskussion um umwelt- und tiergerechte Haltungsverfahren steht insbesondere die Nutzgeflügelhaltung im Fokus. Mit der zunehmenden Entwicklung von sensorgestützten Technologien sind mit dem DOL 53 sowie dem Extox-Stable zwei elektrochemische Ammoniaksensoren auf den Markt gekommen, welche eine kontinuierliche Messung der NH3-Konzentration in der Stallluft ermöglichen. Dadurch kann nicht nur frühzeitig im Management zur Sicherstellung tiergerechter Haltungssysteme agiert werden, sollten die Sensoren Schwellenwerte aufzeigen, sondern auch durch eine kontinuierliche Anwendung NH3-reduzierender Maßnahmen die Ammoniakemissionen in der Nutzgeflügelhaltung vermindert werden. Voraussetzung ist jedoch die richtige Anwendung und regelmäßige Überprüfung der Sensoren mittels Prüfstandard.Poultry farming is required to meet the increasing demands regarding animal welfare, environmental protection and sustainability. Digital and smart techniques are increasingly used in poultry husbandry to fulfil these requirements. As an example to monitor and evaluate barn climate continuously, data of two sensors (DOL 53 and Extox-Stable) were evaluated on-farm during a broiler fattening cycle. The study showed that both sensors may be able to successively and validly detect ammonia emissions over the course of fattening cycle and thus may be implemented in proactive flock management strategies and tools