Der lehrreiche Moment oder Das erhabene Werkzeug in Gottes Händen : Rede, bei Gelegenheit der, von der Gemeinde zu Posen am ... 4. Aug. 1844, Abends, in der grossen Synagoge abgehaltenen Dankfeier für die Erhaltung Sr. Königlichen Majestät

von Salomon Plessner

Requirement of GCN5 histone acetyltransferase in mouse neural tube closure and skeletal patterning

Histone acetylation plays an essential role in many DNA-related processes such as transcriptional regulation via modulation of chromatin structure. Many histone acetytransferases have been discovered and studied in the past few years, but the roles of different histone acetyltransferases (HAT) during mammalian development are not well defined at present. Gcn5 histone acetyltransferase is highly expressed until E16.5 during development. Previous studies in our lab using a constitutive null allele demonstrated that Gcn5 knock out mice are embryonic lethal, precluding the study of Gcn5 functions at later developmental stages. The creation of a conditional Gcn5 null allele, Gcn5flox allele, bypasses the early lethality. Mice homozygous for this allele are viable and appear healthy. In contrast, mice homozygous for a Gcn5 Δex3-18 allele created by Cre-loxP mediated deletion display a phenotype identical to our original Gcn5 null mice. Strikingly, a Gcn5flox(neo) allele, which contain a neomycin cassette in the second intron of Gcn5 is only partially functional and gives rise to a hypomorphic phenotype. Initiation of cranial neural tube closure at forebrain/midbrain boundary fails, resulting in an exencephaly in some Gcn5flox(neo)/flox(neo) embryos. These defects were found at an even greater penetrance in Gcn5flox(neo)/Δ embryos and become completely penetrant in the 129Sv genetic background, suggesting that Gcn5 controls mouse neural tube closure in a dose dependent manner. Furthermore, both Gcn5flox(neo)/flox(neo) and Gcn5 flox(neo)/Δ embryos exhibit anterior homeotic transformations in lower thoracic and lumbar vertebrae. These defects are accompanied by decreased expression levels and a shift in anterior expression boundary of Hoxc8 and Hoxc9. This study provides the first evidence that Gcn5 regulates Hox gene expression and is required for normal axial skeletal patterning in mice. ^

TRANSCRIPTIONAL REGULATION OF PROFILIN IS REQUIRED FOR DROSOPHILA LARVAL WOUND CLOSURE

Injury is an inevitable part of life, making wound healing essential for survival. In postembryonic skin, wound closure requires that epidermal cells recognize the presence of a gap and change their behavior to migrate across it. In Drosophila larvae, wound closure requires two signaling pathways (the Jun N-terminal kinase (JNK) pathway and the Pvr receptor tyrosine kinase signaling pathway) and regulation of the actin cytoskeleton. In this and other systems, it remains unclear how the signaling pathways that initiate wound closure connect to the actin regulators that help execute wound- induced cell migrations. Here we show that chickadee, which encodes the Drosophila Profilin, a protein important for actin filament recycling and cell migration during development, is required for the physiological process of larval epidermal wound closure. After injury, chickadee is transcriptionally upregulated in cells proximal to the wound. We found that JNK, but not Pvr, mediates the increase in chic transcription through the Jun and Fos transcription factors. Finally, we show that chic deficient larvae fail to form a robust actin cable along the wound edge and also fail to form normal filopodial and lamellipodial extensions into the wound gap. Our results thus connect a factor that regulates actin monomer recycling to the JNK signaling pathway during wound closure. They also reveal a physiological function for an important developmental regulator of actin and begin to tease out the logic of how the wound repair response is organized.

Safety, feasibility, and long-term results of percutaneous closure of atrial septal defects using the Amplatzer septal occluder without periprocedural echocardiography.

OBJECTIVES We sought to assess the safety and efficacy of percutaneous closure of atrial septal defects (ASDs) under fluoroscopic guidance only, without periprocedural echocardiographic guidance. BACKGROUND Percutaneous closure of ASDs is usually performed using simultaneous fluoroscopic and transthoracic, transesophageal (TEE), or intracardiac echocardiographic (ICE) guidance. However, TEE requires deep sedation or general anesthesia, which considerably lengthens the procedure. TEE and ICE increase costs. METHODS Between 1997 and 2008, a total of 217 consecutive patients (age, 38 ± 22 years; 155 females and 62 males), of whom 44 were children ≤16 years, underwent percutaneous ASD closure with an Amplatzer ASD occluder (AASDO). TEE guidance and general anesthesia were restricted to the children, while devices were implanted under fluoroscopic guidance only in the adults. For comparison of technical safety and feasibility of the procedure without echocardiographic guidance, the children served as a control group. RESULTS The implantation procedure was successful in all but 3 patients (1 child and 2 adults; 1.4%). Mean device size was 23 ± 8 mm (range, 4-40 mm). There was 1 postprocedural complication (0.5%; transient perimyocarditis in an adult patient). At last echocardiographic follow-up, 13 ± 23 months after the procedure, 90% of patients had no residual shunt, whereas a minimal, moderate, or large shunt persisted in 7%, 1%, and 2%, respectively. Four adult patients (2%) underwent implantation of a second device for a residual shunt. During a mean follow-up period of 3 ± 2 years, 2 deaths and 1 ischemic stroke occurred. CONCLUSION According to these results, percutaneous ASD closure using the AASDO without periprocedural echocardiographic guidance seems safe and feasible.

On the Closure of the Tame Automorphism Group of Affine Three-Space

We provide explicit families of tame automorphisms of the complex affine three-space which degenerate to wild automorphisms. This shows that the tame subgroup of the group of polynomial automorphisms of C3 is not closed, when the latter is seen as an infinite-dimensional algebraic group.

A parallel implementation of 3D Zernike moment analysis

Zernike polynomials are a well known set of functions that find many applications in image or pattern characterization because they allow to construct shape descriptors that are invariant against translations, rotations or scale changes. The concepts behind them can be extended to higher dimension spaces, making them also fit to describe volumetric data. They have been less used than their properties might suggest due to their high computational cost. We present a parallel implementation of 3D Zernike moments analysis, written in C with CUDA extensions, which makes it practical to employ Zernike descriptors in interactive applications, yielding a performance of several frames per second in voxel datasets about 2003 in size. In our contribution, we describe the challenges of implementing 3D Zernike analysis in a general-purpose GPU. These include how to deal with numerical inaccuracies, due to the high precision demands of the algorithm, or how to deal with the high volume of input data so that it does not become a bottleneck for the system.

Computing the Hessenberg matrix associated with a self-similar measure

We introduce in this paper a method to calculate the Hessenberg matrix of a sum of measures from the Hessenberg matrices of the component measures. Our method extends the spectral techniques used by G. Mantica to calculate the Jacobi matrix associated with a sum of measures from the Jacobi matrices of each of the measures. We apply this method to approximate the Hessenberg matrix associated with a self-similar measure and compare it with the result obtained by a former method for self-similar measures which uses a fixed point theorem for moment matrices. Results are given for a series of classical examples of self-similar measures. Finally, we also apply the method introduced in this paper to some examples of sums of (not self-similar) measures obtaining the exact value of the sections of the Hessenberg matrix.

Probabilistic Atlas Based Segmentation Using Affine Moment Descriptors and Graph-Cuts

We show a procedure for constructing a probabilistic atlas based on affine moment descriptors. It uses a normalization procedure over the labeled atlas. The proposed linear registration is defined by closed-form expressions involving only geometric moments. This procedure applies both to atlas construction as atlas-based segmentation. We model the likelihood term for each voxel and each label using parametric or nonparametric distributions and the prior term is determined by applying the vote-rule. The probabilistic atlas is built with the variability of our linear registration. We have two segmentation strategy: a) it applies the proposed affine registration to bring the target image into the coordinate frame of the atlas or b) the probabilistic atlas is non-rigidly aligning with the target image, where the probabilistic atlas is previously aligned to the target image with our affine registration. Finally, we adopt a graph cut - Bayesian framework for implementing the atlas-based segmentation.

Level Set Segmentation with Shape and Appearance Models Using Affine Moment Descriptors

We propose a level set based variational approach that incorporates shape priors into edge-based and region-based models. The evolution of the active contour depends on local and global information. It has been implemented using an efficient narrow band technique. For each boundary pixel we calculate its dynamic according to its gray level, the neighborhood and geometric properties established by training shapes. We also propose a criterion for shape aligning based on affine transformation using an image normalization procedure. Finally, we illustrate the benefits of the our approach on the liver segmentation from CT images.

Medidas autosemejantes en el plano, momentos y matrices de Hessenberg

La tesis MEDIDAS AUTOSEMEJANTES EN EL PLANO, MOMENTOS Y MATRICES DE HESSENBERG se enmarca entre las áreas de la teoría geométrica de la medida, la teoría de polinomios ortogonales y la teoría de operadores. La memoria aborda el estudio de medidas con soporte acotado en el plano complejo vistas con la óptica de las matrices infinitas de momentos y de Hessenberg asociadas a estas medidas que en la teoría de los polinomios ortogonales las representan. En particular se centra en el estudio de las medidas autosemejantes que son las medidas de equilibrio definidas por un sistema de funciones iteradas (SFI). Los conjuntos autosemejantes son conjuntos que tienen la propiedad geométrica de descomponerse en unión de piezas semejantes al conjunto total. Estas piezas pueden solaparse o no, cuando el solapamiento es pequeño la teoría de Hutchinson [Hut81] funciona bien, pero cuando no existen restricciones falla. El problema del solapamiento consiste en controlar la medida de este solapamiento. Un ejemplo de la complejidad de este problema se plantea con las convoluciones infinitas de distribuciones de Bernoulli, que han resultado ser un ejemplo de medidas autosemejantes en el caso real. En 1935 Jessen y A. Wintner [JW35] ya se planteaba este problema, lejos de ser sencillo ha sido estudiado durante más de setenta y cinco años y siguen sin resolverse las principales cuestiones planteadas ya por A. Garsia [Gar62] en 1962. El interés que ha despertado este problema así como la complejidad del mismo está demostrado por las numerosas publicaciones que abordan cuestiones relacionadas con este problema ver por ejemplo [JW35], [Erd39], [PS96], [Ma00], [Ma96], [Sol98], [Mat95], [PS96], [Sim05],[JKS07] [JKS11]. En el primer capítulo comenzamos introduciendo con detalle las medidas autosemejante en el plano complejo y los sistemas de funciones iteradas, así como los conceptos de la teoría de la medida necesarios para describirlos. A continuación se introducen las herramientas necesarias de teoría de polinomios ortogonales, matrices infinitas y operadores que se van a usar. En el segundo y tercer capítulo trasladamos las propiedades geométricas de las medidas autosemejantes a las matrices de momentos y de Hessenberg, respectivamente. A partir de estos resultados se describen algoritmos para calcular estas matrices a partir del SFI correspondiente. Concretamente, se obtienen fórmulas explícitas y algoritmos de aproximación para los momentos y matrices de momentos de medidas fractales, a partir de un teorema del punto fijo para las matrices. Además utilizando técnicas de la teoría de operadores, se han extendido al plano complejo los resultados que G. Mantica [Ma00, Ma96] obtenía en el caso real. Este resultado es la base para definir un algoritmo estable de aproximación de la matriz de Hessenberg asociada a una medida fractal u obtener secciones finitas exactas de matrices Hessenberg asociadas a una suma de medidas. En el último capítulo, se consideran medidas, μ, más generales y se estudia el comportamiento asintótico de los autovalores de una matriz hermitiana de momentos y su impacto en las propiedades de la medida asociada. En el resultado central se demuestra que si los polinomios asociados son densos en L2(μ) entonces necesariamente el autovalor mínimo de las secciones finitas de la matriz de momentos de la medida tiende a cero. ABSTRACT The Thesis work “Self-similar Measures on the Plane, Moments and Hessenberg Matrices” is framed among the geometric measure theory, orthogonal polynomials and operator theory. The work studies measures with compact support on the complex plane from the point of view of the associated infinite moments and Hessenberg matrices representing them in the theory of orthogonal polynomials. More precisely, it concentrates on the study of the self-similar measures that are equilibrium measures in a iterated functions system. Self-similar sets have the geometric property of being decomposable in a union of similar pieces to the complete set. These pieces can overlap. If the overlapping is small, Hutchinson’s theory [Hut81] works well, however, when it has no restrictions, the theory does not hold. The overlapping problem consists in controlling the measure of the overlap. The complexity of this problem is exemplified in the infinite convolutions of Bernoulli’s distributions, that are an example of self-similar measures in the real case. As early as 1935 [JW35], Jessen and Wintner posed this problem, that far from being simple, has been studied during more than 75 years. The main cuestiones posed by Garsia in 1962 [Gar62] remain unsolved. The interest in this problem, together with its complexity, is demonstrated by the number of publications that over the years have dealt with it. See, for example, [JW35], [Erd39], [PS96], [Ma00], [Ma96], [Sol98], [Mat95], [PS96], [Sim05], [JKS07] [JKS11]. In the first chapter, we will start with a detailed introduction to the self-similar measurements in the complex plane and to the iterated functions systems, also including the concepts of measure theory needed to describe them. Next, we introduce the necessary tools from orthogonal polynomials, infinite matrices and operators. In the second and third chapter we will translate the geometric properties of selfsimilar measures to the moments and Hessenberg matrices. From these results, we will describe algorithms to calculate these matrices from the corresponding iterated functions systems. To be precise, we obtain explicit formulas and approximation algorithms for the moments and moment matrices of fractal measures from a new fixed point theorem for matrices. Moreover, using techniques from operator theory, we extend to the complex plane the real case results obtained by Mantica [Ma00, Ma96]. This result is the base to define a stable algorithm that approximates the Hessenberg matrix associated to a fractal measure and obtains exact finite sections of Hessenberg matrices associated to a sum of measurements. In the last chapter, we consider more general measures, μ, and study the asymptotic behaviour of the eigenvalues of a hermitian matrix of moments, together with its impact on the properties of the associated measure. In the main result we demonstrate that, if the associated polynomials are dense in L2(μ), then necessarily follows that the minimum eigenvalue of the finite sections of the moments matrix goes to zero.

Polynomial approximation using particle swarm optimization of lineal enhanced neural networks with no hidden layers.

This paper presents some ideas about a new neural network architecture that can be compared to a Taylor analysis when dealing with patterns. Such architecture is based on lineal activation functions with an axo-axonic architecture. A biological axo-axonic connection between two neurons is defined as the weight in a connection in given by the output of another third neuron. This idea can be implemented in the so called Enhanced Neural Networks in which two Multilayer Perceptrons are used; the first one will output the weights that the second MLP uses to computed the desired output. This kind of neural network has universal approximation properties even with lineal activation functions. There exists a clear difference between cooperative and competitive strategies. The former ones are based on the swarm colonies, in which all individuals share its knowledge about the goal in order to pass such information to other individuals to get optimum solution. The latter ones are based on genetic models, that is, individuals can die and new individuals are created combining information of alive one; or are based on molecular/celular behaviour passing information from one structure to another. A swarm-based model is applied to obtain the Neural Network, training the net with a Particle Swarm algorithm.

Approximation to earth material from international normative

For centuries, earth has been used as a construction material. Nevertheless, the normative in this matter is very scattered, and the most developed countries, to carry out a construction with this material implies a variety of technical and legal problems. In this paper we review, in an international level, the normative panorama about earth constructions. It analyzes ninety one standards and regulations of countries all around the five continents. These standards represent the state of art that normalizes the earth as a construction material. In this research we analyze the international standards to earth construction, focusing on durability test (spray and drip erosion tests). It analyzes the differences between methods of test. Also we show all results about these tests in two types of compressed earth block.

Diffusion Gradient Temporal Difference for Cooperative Reinforcement Learning with Linear Function Approximation

We introduce a diffusion-based algorithm in which multiple agents cooperate to predict a common and global statevalue function by sharing local estimates and local gradient information among neighbors. Our algorithm is a fully distributed implementation of the gradient temporal difference with linear function approximation, to make it applicable to multiagent settings. Simulations illustrate the benefit of cooperation in learning, as made possible by the proposed algorithm.

Accurate analytical approximation of asteroid deflection with constant tangential thrust

We present analytical formulas to estimate the variation of achieved deflection for an Earth-impacting asteroid following a continuous tangential low-thrust deflection strategy. Relatively simple analytical expressions are obtained with the aid of asymptotic theory and the use of Peláez orbital elements set, an approach that is particularly suitable to the asteroid deflection problem and is not limited to small eccentricities. The accuracy of the proposed formulas is evaluated numerically showing negligible error for both early and late deflection campaigns. The results will be of aid in planning future low-thrust asteroid deflection missions