any (continuous) map N → M between stably parallelizable compact n-manifolds, n 6= 1, 2, 3, 7, is realizable in R, i.e. the composition of f with an embedding M ⊂ R is C-approximable by embeddings. It has been long believed that any degree 2 map S → S, obtained by capping off at infinity a time-symmetric (e.g. Shapiro’s) sphere eversion S×I → R, was non-realizable in R. We show that there exist...

In this paper, the effect of air turbulence intensity on the flame structure in various radii and lengths of a flame holder numerically studied. Finite volume method is used to solve the governing equations. The obtained numerical results using realizable k-ε and β-PDF models show a good agreement with the experimental data. The results show that flame holder with greater lengths yield shorter ...

Two notions of primitive recursive realizability for arithmetic sentences are considered. The first one is strictly primitive recursive realizability introduced by Z. Damnjanovic in 1994. We prove that intuitionistic predicate logic is not sound with this kind of realizability. Namely there exists an arithmetic sentence which is deducible in the intuitionistic predicate calculus but is not stri...

Researcher: Royce Fernandes Title: Investigation of Pin Fin Cooling Channels for Applications in Gas Turbines Institution: Embry-Riddle Aeronautical University Degree: Master of Science in Aerospace Engineering Year: 2016 Gas turbine blades are often cooled using internal cooling channels to prevent failure at temperatures beyond material limitations. Pin fin channels are commonly used on the t...

The Gram dimension gd(G) of a graph is the smallest integer k ≥ 1 such that, for every assignment of unit vectors to the nodes of the graph, there exists another assignment of unit vectors lying in R, having the same inner products on the edges of the graph. The class of graphs satisfying gd(G) ≤ k is minor closed for fixed k, so it can characterized by a finite list of forbidden minors. For k ...

We study the copoint graph of a convex geometry. We give a family of copoint graphs for which the ratio of the chromatic number to the clique number can be arbitrarily large. For any natural numbers 1 < d < k, we study the existence of a number Kd(k) so that the chromatic number of the copoint graph of a convex geometry on a set of at least Kd(k) elements, with every d-element subset closed, ha...

Problem statement: Rotating turbine ventilators were generally found in most countries. They were simple in structure, light in weight and cheap to install. It was quite surprising that, the aerodynamics of this common device had not been numerically examined and the design process of most of these ventilators had developed progressively through trial and error methods. Approach: This study was...

2 The General Case 2 2.1 Specifications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.2 Realizable Specifications . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 Realizability Under Fairness . . . . . . . . . . . . . . . . . . . . . . . 5 2.4 Weakly Realizable Specifications . . . . . . . . . . . . . . . . . . . . . 6 2.5 Games and Specifications . . . . . . . . . . ...