Fourier methods for quasi‐periodic oscillations

Quasi‐periodic oscillations and invariant tori play an important role in the study of forced or coupled oscillators. This paper presents two new numerical methods for the investigation of quasi‐periodic oscillations. Both algorithms can be regarded as generalizations of the averaging and the harmonic (spectral) balance methods. The algorithms are easy to implement and require only minimal a priori knowledge of the system. Most importantly, the methods do not depend on an a priori co‐ordinate transformation. The methods are applied to a number of illustrative examples from non‐linear electrical engineering and the results show that the methods are efficient and reliable. In addition, these examples show that the presented algorithms can also continue through regions of sub‐harmonic (phase‐locked) resonance even though they are designed only for the quasi‐periodic case. Copyright © 2006 John Wiley & Sons, Ltd.     

Generalized notions of mind change complexity

Gold introduced the notion of learning in the limit where a class S is learnable iff there is a recursive machine M which reads the course of values of a function f and converges to a program for f whenever f is in S. An important measure for the speed of convergence in this model is the quantity of mind changes before the onset of convergence. The oldest model is to consider a constant bound on the number of mind changes M makes on any input function; such a bound is referred here as type 1. Later this was generalized to a bound of type 2 where a counter ranges over constructive ordinals and is counted down at every mind change. Although ordinal bounds permit the inference of richer concept classes than constant bounds, they still are a severe restriction. Therefore the present work introduces two more general approaches to bounding mind changes. These are based on counting by going down in a linearly ordered set (type 3) and on counting by going down in a partially ordered set (type 4). In both cases the set must not contain infinite descending recursive sequences. These four types of mind changes yield a hierarchy and there are identifiable classes that cannot be learned with the most general mind change bound of type 4. It is shown that existence of type 2 bound is equivalent to the existence of a learning algorithm which converges on every (also nonrecursive) input function and the existence of type 4 is shown to be equivalent to the existence of a learning algorithm which converges on every recursive function. A partial characterization of type 3 yields a result of independent interest in recursion theory. The interplay between mind change complexity and choice of hypothesis space is investigated. It is established that for certain concept classes, a more expressive hypothesis space can sometimes reduce mind change complexity of learning these classes. The notion of mind change bound for behaviourally correct learning is indirectly addressed by employing the above four types to restrict the number of predictive errors of commission in finite error next value learning (NV′′)—a model equivalent to behaviourally correct learning. Again, natural characterizations for type 2 and type 4 bounds are derived. Their naturalness is further illustrated by characterizing them in terms of branches of uniformly recursive families of binary trees.     

Transport properties of 1,1,1,2-tetrafluoroethane (R134a)

New equations for the thermal conductivity and the viscosity of R134a that are valid in a wide range of pressures and temperatures are presented. They were obtained through a theoretically based, critical evaluation of the available experimental data, which showed considerable inconsistencies between data sets, in particular in the vapor phase. In the critical region the observed enhancement in the thermal conductivity is well represented by a crossover model for the transport properties of fluids. Since thermodynamic properties enter into the calculation of the critical enhancement of the transport properties, a new fundamental equation for the critical region was developed also.Paper dedicated to Professor Joseph Kestin.     

Probabilistic analysis of the application of the cross ratio to model based vision

The probability density function for the cross ratio is obtained under the hypothesis that the four image points have independent, identical, Gaussian distributions. The density function has six symmetries which are closely linked to the six different values of the cross ratio obtained by permuting the quadruple of points from which the cross ratio is calculated. The density function has logarithmic singularities corresponding to values of the cross ratio for which two of the four points are coincident. The cross ratio forms the basis of a simple system for recognising or classifying quadruples of collinear image points. The performance of the system depends on the choice of rule for deciding whether four image points have a given cross ratio . A rule is stated which is computationally straightforward and which takes into account the effects on the cross ratio of small errors in locating the image points. Two key properties of the rule are the probabilityR of rejection, and the probabilityF of a false alarm. The probabilitiesR andF depend on a thresholdt in the decision rule. There is a trade off betweenR andF obtained by varyingt. It is shown that the trade off is insensitive to the given cross ratio . LetF _w =max _o {F}. ThenR, F _w are related approximately by , provided ^–1 F _w 4. In the equation, is the accuracy with which image points can be located relative to the width of the image, andr _F is a constant known as the normalised false alarm rate. In the range ^–1 F _w 4 the probabilitiesR andF _w are related approximately by . The value ofr _F is 14.37. The consequences of these relations between R and F_w are discussed. It is conjectured that the above general form of the trade off betweenR andF _w holds for a wide class of scalar invariants that could be used for model based object recognition. Invariants with the same type of trade off between the probability of rejection and the probability of false alarm are said to be nondegenerate for model based vision.     

Die Bewertung von Wurstwaren auf Grund des Verh?ltnisses Leimgebende Substanz: Gesamt-Stickstoffsubstanz

Ohne ZusammenfassungMitteilung aus der Nahrungsmittel-Untersuchungsstelle an der Technischen Hochschule in Braunschweig.     

The Functional Characterization of GCaMP3.0 Variants Specifically Targeted to Subcellular Domains

Calcium (Ca²⁺) ions play a pivotal role in physiology and cellular signaling. The intracellular Ca²⁺ concentration ([Ca²⁺]_i) is about three orders of magnitude lower than the extracellular concentration, resulting in a steep transmembrane concentration gradient. Thus, the spatial and the temporal dynamics of [Ca²⁺]_i are ideally suited to modulate Ca²⁺-mediated cellular responses to external signals. A variety of highly sophisticated methods have been developed to gain insight into cellular Ca²⁺ dynamics. In addition to electrophysiological measurements and the application of synthetic dyes that change their fluorescent properties upon interaction with Ca²⁺, the introduction and the ongoing development of genetically encoded Ca²⁺ indicators (GECI) opened a new era to study Ca²⁺-driven processes in living cells and organisms. Here, we have focused on one well-established GECI, i.e., GCaMP3.0. We have systematically modified the protein with sequence motifs, allowing localization of the sensor in the nucleus, in the mitochondrial matrix, at the mitochondrial outer membrane, and at the plasma membrane. The individual variants and a cytosolic version of GCaMP3.0 were overexpressed and purified from E. coli cells to study their biophysical properties in solution. All versions were examined to monitor Ca²⁺ signaling in stably transfected cell lines and in primary cortical neurons transduced with recombinant Adeno-associated viruses (rAAV). In this comparative study, we provide evidence for a robust approach to reliably trace Ca²⁺ signals at the (sub)-cellular level with pronounced temporal resolution.     

Dynamic Control Over Electronic Transport in 3D Bulk Nanographene via Interfacial Charging

Electrochemical surface charge‐induced variation of physical properties in interface‐dominated bulk materials is a rapidly emerging field in material science. The recently developed three‐dimensional bulk nanographene (3D‐BNG) macro‐assemblies with ultra‐high surface area and chemical inertness offer new opportunities in this area. Here, the electronic transport in centimeter‐sized 3D‐BNG monoliths can be dynamically controlled via electrochemically induced surface charge density. Specifically, a fully reversible variation in macroscopic conductance up to several hundred percent is observed with ≤1 V applied gate potential. The observed conductivity change can be explained in the light of the electrochemically‐induced accumulation or depletion of charge carriers in combination with a large variation in the carrier mobility; the latter, being highly affected by the defect density modulations resulting from the interfacial charge injection, sharply decreases with an increase in defect concentrations. The phenomenon presented in this study is believed to open the door to novel applications of bulk graphene materials such as, for example, low voltage and high power tunable resistors.