The interaction of riblets with wall-bounded turbulence

The purpose of this thesis is to give answer to the question: why do riblets stop working for a certain size? Riblets are small surface grooves aligned in the mean direction of an overlying turbulent flow, designed specifically to reduce the friction between the flow and the surface. They were inspired by biological surfaces, like the oriented denticles in the skin of fastswimming sharks, and were the focus of a significant amount of research in the late eighties and nineties. Although it was found that the drag reduction depends on the riblet size scaled in wall units, the physical mechanisms implicated have not been completely understood up to now. It has been explained how riblets of vanishing size interact with the turbulent flow, producing a change in the drag proportional to their size, but that is not the regime of practical interest. The optimum performance is achieved for larger sizes, once that linear behavior has broken down, but before riblets begin adopting the character of regular roughness and increasing drag. This regime, which is the most relevant from a technological perspective, was precisely the less understood, so we have focused on it. Our efforts have followed three basic directions. First, we have re-assessed the available experimental data, seeking to identify common characteristics in the optimum regime across the different existing riblet geometries. This study has led to the proposal of a new length scale, the square root of the groove crosssection, to substitute the traditional peak-to-peak spacing. Scaling the riblet dimension with this length, the size of breakdown of the linear behavior becomes roughly universal. This suggests that the onset of the breakdown is related to a certain, fixed value of the cross-section of the groove. Second, we have conducted a set of direct numerical simulations of the turbulent flow over riblets, for sizes spanning the full drag reduction range. We have thus been able to reproduce the gradual transition between the different regimes. The spectral analysis of the flows has proven particularly fruitful, since it has made possible to identify spanwise rollers immediately above the riblets, which begin to appear when the riblet size is close to the optimum. This is a quite surprising feature of the flow, not because of the uniqueness of the phenomenon, which had been reported before for other types of complex and porous surfaces, but because most previous studies had focused on the detail of the flow above each riblet as a unit. Our novel approach has provided the adequate tools to capture coherent structures with an extended spanwise support, which interact with the riblets not individually, but collectively. We have also proven that those spanwise structures are responsible for the increase in drag past the viscous breakdown. Finally, we have analyzed the stability of the flow with a simplified model that connects the appearance of rollers to a Kelvin–Helmholtz-like instability, as is the case also for the flow over plant canopies and porous surfaces. In spite of the model emulating the presence of riblets only in an averaged, general fashion, it succeeds to capture the essential attributes of the breakdown, and provides a theoretical justification for the scaling with the groove cross-section.

Optimal recall from bounded metaplastic synapses: predicting functional adaptations in hippocampal area CA3.

A venerable history of classical work on autoassociative memory has significantly shaped our understanding of several features of the hippocampus, and most prominently of its CA3 area, in relation to memory storage and retrieval. However, existing theories of hippocampal memory processing ignore a key biological constraint affecting memory storage in neural circuits: the bounded dynamical range of synapses. Recent treatments based on the notion of metaplasticity provide a powerful model for individual bounded synapses; however, their implications for the ability of the hippocampus to retrieve memories well and the dynamics of neurons associated with that retrieval are both unknown. Here, we develop a theoretical framework for memory storage and recall with bounded synapses. We formulate the recall of a previously stored pattern from a noisy recall cue and limited-capacity (and therefore lossy) synapses as a probabilistic inference problem, and derive neural dynamics that implement approximate inference algorithms to solve this problem efficiently. In particular, for binary synapses with metaplastic states, we demonstrate for the first time that memories can be efficiently read out with biologically plausible network dynamics that are completely constrained by the synaptic plasticity rule, and the statistics of the stored patterns and of the recall cue. Our theory organises into a coherent framework a wide range of existing data about the regulation of excitability, feedback inhibition, and network oscillations in area CA3, and makes novel and directly testable predictions that can guide future experiments.

Dense active appearance models using a bounded diameter minimum spanning tree

We present a method for producing dense Active Appearance Models (AAMs), suitable for video-realistic synthesis. To this end we estimate a joint alignment of all training images using a set of pairwise registrations and ensure that these pairwise registrations are only calculated between similar images. This is achieved by defining a graph on the image set whose edge weights correspond to registration errors and computing a bounded diameter minimum spanning tree (BDMST). Dense optical flow is used to compute pairwise registration and we introduce a flow refinement method to align small scale texture. Once registration between training images has been established we propose a method to add vertices to the AAM in a way that minimises error between the observed flow fields and a flow field interpolated between the AAM mesh points. We demonstrate a significant improvement in model compactness using the proposed method and show it dealing with cases that are problematic for current state-of-the-art approaches.

On equations for regular languages, finite automata, and sequential networks

We consider systems of equations of the form where A is the underlying alphabet, the Xi are variables, the Pi,a are boolean functions in the variables Xi, and each δi is either the empty word or the empty set. The symbols υ and denote concatenation and union of languages over A. We show that any such system has a unique solution which, moreover, is regular. These equations correspond to a type of automation, called boolean automation, which is a generalization of a nondeterministic automation. The equations are then used to determine the language accepted by a sequential network; they are obtainable directly from the network.

practical type checking of functions defined on context-free languages

A type checking method for the functional language LFC is presented. A distinct feature of LFC is that it uses Context-Free (CF) languages as data types to represent compound data structures. This makes LFC a dynamically typed language. To improve efficiency, a practical type checking method is presented, which consists of both static and dynamic type checking. Although the inclusion relation of CF.languages is not decidable,a special subset of the relation is decidable, i.e., the sentential form relation, which can be statically checked.Moreover, most of the expressions in actual LFC programs appear to satisfy this relation according to the statistic data of experiments. So, despite that the static type checking is not complete, it undertakes most of the type checking task. Consequently the run-time efficiency is effectively improved. Another feature of the type checking is that it converts the expressions with implicit structures to structured representation. Structure reconstruction technique is presented.

pattern matching compilation of functions defined in context-free languages

LFC is a functional language based on recursive functions defined in context-free languages. In this paper, a new pattern matching algorithm for LFC is presented, which can represent a sequence of patterns as an integer by an encoding method. It is a rather simple method and produces efficient case-expressions for pattern matching definitions of LFC. The algorithm can also be used for other functional languages, but for nested patterns it may become complicated and further studies are needed.

facilitating formal specification acquisition by using recursive functions on context-free languages

Although formal specification techniques are very useful in software development, the acquisition of formal specifications is a difficult task. This paper presents the formal specification language LFC, which is designed to facilitate the acquisition and validation of formal specifications. LFC uses context-free languages for syntactic aspect and relies on a new kind of recursive functions, i.e. recursive functions on context-free languages, for semantic aspect of specifications. Construction and validation of LFC specifications are machine-aided. The basic ideas behind LFC, the main aspects of LFC, and the use of LFC and illustrative examples are described.

on string languages generated by spiking neural p systems

We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the set of spike trains of halting computations of a given system constitutes the language generated by that system. Although the "direct" generative capacity of spiking neural P systems is rather restricted (some very simple languages cannot be generated in this framework), regular languages are inverse-morphic images of languages of finite spiking neural P systems, and recursively enumerable languages are projections of inverse-morphic images of languages generated by spiking neural P systems.

Stabilization of Uncertain Nonholonomic Dynamic Systems with Bounded Inputs

The sliding mode approach and the multi-step control strategy are exploited to propose a stabilizing controller for uncertain nonholonomic dynamic systems with bounded inputs. This controller can stabilize the system to an arbitrarily small neighborhood about its equilibrium in a finite time .Its application to a nonholonomic wheeled mobile robot is described. Simulation result shows that the proposed controller is effective

Affine Matching with Bounded Sensor Error: A Study of Geometric Hashing and Alignment

Affine transformations are often used in recognition systems, to approximate the effects of perspective projection. The underlying mathematics is for exact feature data, with no positional uncertainty. In practice, heuristics are added to handle uncertainty. We provide a precise analysis of affine point matching, obtaining an expression for the range of affine-invariant values consistent with bounded uncertainty. This analysis reveals that the range of affine-invariant values depends on the actual $x$-$y$-positions of the features, i.e. with uncertainty, affine representations are not invariant with respect to the Cartesian coordinate system. We analyze the effect of this on geometric hashing and alignment recognition methods.

A Note of Zipf's Law, Natural Languages, and Noncoding DNA Regions

In Phys. Rev. Letters (73:2), Mantegna et al. conclude on the basis of Zipf rank frequency data that noncoding DNA sequence regions are more like natural languages than coding regions. We argue on the contrary that an empirical fit to Zipf"s "law" cannot be used as a criterion for similarity to natural languages. Although DNA is a presumably "organized system of signs" in Mandelbrot"s (1961) sense, and observation of statistical featurs of the sort presented in the Mantegna et al. paper does not shed light on the similarity between DNA's "gramar" and natural language grammars, just as the observation of exact Zipf-like behavior cannot distinguish between the underlying processes of tossing an M-sided die or a finite-state branching process.

Supporting Dynamic Languages on the Java Virtual Machine

In this note, I propose two extensions to the Java virtual machine (or VM) to allow dynamic languages such as Dylan, Scheme and Smalltalk to be efficiently implemented on the VM. These extensions do not affect the performance of pure Java programs on the machine. The first extension allows for efficient encoding of dynamic data; the second allows for efficient encoding of language-specific computational elements.

The Dirichlet problem in convex bounded domains for operators with L^\infty-coefficients

M.Hieber, I.Wood: The Dirichlet problem in convex bounded domains for operators with L^\infty-coefficients, Diff. Int. Eq., 20, 7 (2007),721-734.