Database evolution on an orthogonal persistent programming system: A semi-transparent approach

In this paper the problem of the evolution of an object-oriented database in the context of orthogonal persistent programming systems is addressed. We have observed two characteristics in that type of systems that offer particular conditions to implement the evolution in a semi-transparent fashion. That transparency can further be enhanced with the obliviousness provided by the Aspect-Oriented Programming techniques. Was conceived a meta-model and developed a prototype to test the feasibility of our approach. The system allows programs, written to a schema, access semi-transparently to data in other versions of the schema.

Optimization of quantum states for signaling across an arbitrary qubit noise channel with minimum-error detection

International audience

ADVANCED COMPUTATIONAL MODELING OF THE INTERNAL STRUCTURE OF SMART WIND-TURBINE BLADES

Implementation of stable aeroelastic models with the ability to capture the complex features of Multi concept smartblades is a prime step in reducing the uncertainties that come along with blade dynamics. The numerical simulations of fluid structure interaction can thus be used to test a realistic scenarios comprising of full-scale blades at a reasonably low computational cost. A code which was a combination of two advanced numerical models was designed and was run with the help of paralell HPC supercomputer platform. The first model was based on a variation of dimensional reduction technique proposed by Hodges and Yu. This model was the one to record the structural response of heterogenous composite blades. This technique reduces the geometrical complexities of the heterogenous blade section into a stiffness matrix for an equivalent beam. This derived equivalent 1-D strain energy matrix is similar to the actual 3-D strain energy matrix in an asymptotic sense. As this 1-D matrix helps in accurately modeling the blade structure as a 1-D finite element problem, this substantially redues the computational effort and subsequently the computational cost that are required to model the structural dynamics at each step. Second model comprises of implementation of the Blade Element Momentum Theory. In this approach we map all the velocities and the forces with the help of orthogonal matrices that help in capturing the large deformations and the effects of rotations in calculating the aerodynamic forces. This ultimately helps us to take into account the complex flexo torsional deformations. In this thesis we have succesfully tested these computayinal tools developed by MTU’s research team lead by for the aero elastic analysis of wind-turbine blades. The validation in this thesis is majorly based on several experiments done on NREL-5MW blade, as this is widely accepted as a benchmark blade in the wind industry. Along with the use of this innovative model the internal blade structure was also changed to add up to the existing benefits of the already advanced numerical models.

A dual-polarized microstrip antenna array with port decoupling for MIMO systems

Utilization of multiport-antennas represents an appropriate way for the mitigation of multi-path fading in wireless communication systems. However, to obtain low correlation between the signals from different antenna ports and to prevent gain reduction by cross-talk, large antenna elements spacing is expected. Polarization diversity allows signal separation even with small antenna spacing. Although it is effective, polarization diversity alone does not suffice once the number of antennas exceeds the number of orthogonal polarizations. This paper presents an approach which combines a novel array concept with the use of dual polarization. The theory is verified by a compact dual polarized patch antenna array, which consists of four elements and a decoupling network.

Qualitative spatial reasoning about directions in a corridor containing a single turn

An experiment was conducted to investigate the process of reasoning about directions in an egocentric space. Each participant walked through a corridor containing an angular turn ranging in size from 0° to 90°, in 15° increments. A direction was given to participants at the entrance of the corridor and they were asked to answer this direction at the end of this corridor. Considering the fact that participants had to reason the direction in the featureless corridor, two hypotheses were proposed: (i) reasoning about directions falls into qualitative reasoning by using a small number of coarse angular categories (four 90° categories or eight 45° categories: 90° categories consist of front, back, left, right; 45° categories consist of 90° categories and the four intermediates) that reference axes generate; (ii) reasoning about directions would be done by recalling the rotation angle from the traveling direction to the direction that participants tried to answer. In addition, the configuration of reference axes that participants employed was examined. Both hypotheses were supported, and the data designated that reference axes consisted of eight directions: a pair of orthogonal axes and diagonals.

Idealähtöistä koulualgebraa : IDEAA-opetusmallin kehittäminen algebran opetukseen peruskoulun 7. luokalla

This research is based on the problems in secondary school algebra I have noticed in my own work as a teacher of mathematics. Algebra does not touch the pupil, it remains knowledge that is not used or tested. Furthermore the performance level in algebra is quite low. This study presents a model for 7th grade algebra instruction in order to make algebra more natural and useful to students. I refer to the instruction model as the Idea-based Algebra (IDEAA). The basic ideas of this IDEAA model are 1) to combine children's own informal mathematics with scientific mathematics ("math math") and 2) to structure algebra content as a "map of big ideas", not as a traditional sequence of powers, polynomials, equations, and word problems. This research project is a kind of design process or design research. As such, this project has three, intertwined goals: research, design and pedagogical practice. I also assume three roles. As a researcher, I want to learn about learning and school algebra, its problems and possibilities. As a designer, I use research in the intervention to develop a shared artefact, the instruction model. In addition, I want to improve the practice through intervention and research. A design research like this is quite challenging. Its goals and means are intertwined and change in the research process. Theory emerges from the inquiry; it is not given a priori. The aim to improve instruction is normative, as one should take into account what "good" means in school algebra. An important part of my study is to work out these paradigmatic questions. The result of the study is threefold. The main result is the instruction model designed in the study. The second result is the theory that is developed of the teaching, learning and algebra. The third result is knowledge of the design process. The instruction model (IDEAA) is connected to four main features of good algebra education: 1) the situationality of learning, 2) learning as knowledge building, in which natural language and intuitive thinking work as "intermediaries", 3) the emergence and diversity of algebra, and 4) the development of high performance skills at any stage of instruction.

Microprocessor-based polynomial generator

A new method of generating polynomials using microprocessors is proposed. The polynomial is generated as a 16-bit digital word. The algorithm for generating a variety of basic 'building block' functions and its implementation is discussed. A technique for generating a generalized polynomial based on the proposed algorithm is indicated. The performance of the proposed generator is evaluated using a commercially available microprocessor kit.

Reverse Channel Training For Reciprocal Mimo Systems With Spatial Multiplexing

This paper investigates the problem of designing reverse channel training sequences for a TDD-MIMO spatial-multiplexing system. Assuming perfect channel state information at the receiver and spatial multiplexing at the transmitter with equal power allocation to them dominant modes of the estimated channel, the pilot is designed to ensure an stimate of the channel which improves the forward link capacity. Using perturbation techniques, a lower bound on the forward link capacity is derived with respect to which the training sequence is optimized. Thus, the reverse channel training sequence makes use of the channel knowledge at the receiver. The performance of orthogonal training sequence with MMSE estimation at the transmitter and the proposed training sequence are compared. Simulation results show a significant improvement in performance.

Microprocessor-based polynomial generator

A new method of generating polynomials using microprocessors is proposed. The polynomial is generated as a 16-bit digital word. The algorithm for generating a variety of basic 'building block' functions and its implementation is discussed. A technique for generating a generalized polynomial based on the proposed algorithm is indicated. The performance of the proposed generator is evaluated using a commercially available microprocessor kit.

Efficient space-time codes from cyclic division algebras

An overview of space-time code construction based on cyclic division algebras (CDA) is presented. Applications of such space-time codes to the construction of codes optimal under the diversity-multiplexing gain (D-MG) tradeoff, to the construction of the so-called perfect space-time codes, to the construction of optimal space-time codes for the ARQ channel as well as to the construction of codes optimal for the cooperative relay network channel are discussed. We also present a construction of optimal codes based on CDA for a class of orthogonal amplify and forward (OAF) protocols for the cooperative relay network

The Dπ form factors from analyticity and unitarity

We study the shape parameters of the Dπ scalar and vector form factors using as input dispersion relations and unitarity for the moments of suitable heavy-light correlators evaluated with Operator Product Expansions, including O(α 2 s) terms in perturbative QCD. For the scalar form factor, a low energy theorem and phase information on the unitarity cut are implemented to further constrain the shape parameters. We finally determine points on the real axis and isolate regions in the complex energy plane where zeros of the form factors are excluded.

The Ginibre Ensemble and Gaussian Analytic Functions

We show that as n changes, the characteristic polynomial of the n x n random matrix with i.i.d. complex Gaussian entries can be described recursively through a process analogous to Polya's urn scheme. As a result, we get a random analytic function in the limit, which is given by a mixture of Gaussian analytic functions. This suggests another reason why the zeros of Gaussian analytic functions and the Ginibre ensemble exhibit similar local repulsion, but different global behavior. Our approach gives new explicit formulas for the limiting analytic function.

Lovasz theta function, SVMs and Finding Dense Subgraphs

In this paper we establish that the Lovasz theta function on a graph can be restated as a kernel learning problem. We introduce the notion of SVM-theta graphs, on which Lovasz theta function can be approximated well by a Support vector machine (SVM). We show that Erdos-Renyi random G(n, p) graphs are SVM-theta graphs for log(4)n/n <= p < 1. Even if we embed a large clique of size Theta(root np/1-p) in a G(n, p) graph the resultant graph still remains a SVM-theta graph. This immediately suggests an SVM based algorithm for recovering a large planted clique in random graphs. Associated with the theta function is the notion of orthogonal labellings. We introduce common orthogonal labellings which extends the idea of orthogonal labellings to multiple graphs. This allows us to propose a Multiple Kernel learning (MKL) based solution which is capable of identifying a large common dense subgraph in multiple graphs. Both in the planted clique case and common subgraph detection problem the proposed solutions beat the state of the art by an order of magnitude.

On the curvature ODE associated to the Ricci flow

In the vector space of algebraic curvature operators we study the reaction ODE which is associated to the evolution equation of the Riemann curvature operator along the Ricci flow. More precisely, we give a partial classification of the zeros of this ODE up to suitable normalization and analyze the stability of a special class of zeros of the same. In particular, we show that the ODE is unstable near the curvature operators of the Riemannian product spaces where is an Einstein (locally) symmetric space of compact type and not a spherical space form when .

Composite materials dynamic fracture studies by generalized Shmuely difference algorithm

The generalized Shmuely Difference Algorithm (GSDA) is presented here to analyze the dynamic fracture performance of orthogonal-anisotropic composite materials, such as glass fibre reinforced phenolplast. The difference recurrence Formulae and boundary condition difference extrapolation formulae are derived and programmed. The dynamic stress intensity factors (DSIF) of the isotropic and anisotropic centrally cracked plates are computed respectively using GSDA and compared with that published previously. GSDA is proved effective and reliable. Copyright (C) 1996 Elsevier Science Ltd.