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.

Transactions and schema evolution in a persistent object-oriented programming system

Applications are subject of a continuous evolution process with a profound impact on their underlining data model, hence requiring frequent updates in the applications' class structure and database structure as well. This twofold problem, schema evolution and instance adaptation, usually known as database evolution, is addressed in this thesis. Additionally, we address concurrency and error recovery problems with a novel meta-model and its aspect-oriented implementation. Modern object-oriented databases provide features that help programmers deal with object persistence, as well as all related problems such as database evolution, concurrency and error handling. In most systems there are transparent mechanisms to address these problems, nonetheless the database evolution problem still requires some human intervention, which consumes much of programmers' and database administrators' work effort. Earlier research works have demonstrated that aspect-oriented programming (AOP) techniques enable the development of flexible and pluggable systems. In these earlier works, the schema evolution and the instance adaptation problems were addressed as database management concerns. However, none of this research was focused on orthogonal persistent systems. We argue that AOP techniques are well suited to address these problems in orthogonal persistent systems. Regarding the concurrency and error recovery, earlier research showed that only syntactic obliviousness between the base program and aspects is possible. Our meta-model and framework follow an aspect-oriented approach focused on the object-oriented orthogonal persistent context. The proposed meta-model is characterized by its simplicity in order to achieve efficient and transparent database evolution mechanisms. Our meta-model supports multiple versions of a class structure by applying a class versioning strategy. Thus, enabling bidirectional application compatibility among versions of each class structure. That is to say, the database structure can be updated because earlier applications continue to work, as well as later applications that have only known the updated class structure. The specific characteristics of orthogonal persistent systems, as well as a metadata enrichment strategy within the application's source code, complete the inception of the meta-model and have motivated our research work. To test the feasibility of the approach, a prototype was developed. Our prototype is a framework that mediates the interaction between applications and the database, providing them with orthogonal persistence mechanisms. These mechanisms are introduced into applications as an {\it aspect} in the aspect-oriented sense. Objects do not require the extension of any super class, the implementation of an interface nor contain a particular annotation. Parametric type classes are also correctly handled by our framework. However, classes that belong to the programming environment must not be handled as versionable due to restrictions imposed by the Java Virtual Machine. Regarding concurrency support, the framework provides the applications with a multithreaded environment which supports database transactions and error recovery. The framework keeps applications oblivious to the database evolution problem, as well as persistence. Programmers can update the applications' class structure because the framework will produce a new version for it at the database metadata layer. Using our XML based pointcut/advice constructs, the framework's instance adaptation mechanism is extended, hence keeping the framework also oblivious to this problem. The potential developing gains provided by the prototype were benchmarked. In our case study, the results confirm that mechanisms' transparency has positive repercussions on the programmer's productivity, simplifying the entire evolution process at application and database levels. The meta-model itself also was benchmarked in terms of complexity and agility. Compared with other meta-models, it requires less meta-object modifications in each schema evolution step. Other types of tests were carried out in order to validate prototype and meta-model robustness. In order to perform these tests, we used an OO7 small size database due to its data model complexity. Since the developed prototype offers some features that were not observed in other known systems, performance benchmarks were not possible. However, the developed benchmark is now available to perform future performance comparisons with equivalent systems. In order to test our approach in a real world scenario, we developed a proof-of-concept application. This application was developed without any persistence mechanisms. Using our framework and minor changes applied to the application's source code, we added these mechanisms. Furthermore, we tested the application in a schema evolution scenario. This real world experience using our framework showed that applications remains oblivious to persistence and database evolution. In this case study, our framework proved to be a useful tool for programmers and database administrators. Performance issues and the single Java Virtual Machine concurrent model are the major limitations found in the framework.

Evolution of the application and database with aspects

Generally, the evolution process of applications has impact on their underlining data models, thus becoming a time-consuming problem for programmers and database administrators. In this paper we address this problem within an aspect-oriented approach, which is based on a meta-model for orthogonal persistent programming systems. Applying reflection techniques, our meta-model aims to be simpler than its competitors. Furthermore, it enables database multi-version schemas. We also discuss two case studies in order to demonstrate the advantages of our approach.

Orthogonal polynomials and recurrence equations, operator equations and factorization

This article surveys the classical orthogonal polynomial systems of the Hahn class, which are solutions of second-order differential, difference or q-difference equations. Orthogonal families satisfy three-term recurrence equations. Example applications of an algorithm to determine whether a three-term recurrence equation has solutions in the Hahn class - implemented in the computer algebra system Maple - are given. Modifications of these families, in particular associated orthogonal systems, satisfy fourth-order operator equations. A factorization of these equations leads to a solution basis.

On Connection, Linearization and Duplication Coefficients of Classical Orthogonal Polynomials

In this work, we have mainly achieved the following: 1. we provide a review of the main methods used for the computation of the connection and linearization coefficients between orthogonal polynomials of a continuous variable, moreover using a new approach, the duplication problem of these polynomial families is solved; 2. we review the main methods used for the computation of the connection and linearization coefficients of orthogonal polynomials of a discrete variable, we solve the duplication and linearization problem of all orthogonal polynomials of a discrete variable; 3. we propose a method to generate the connection, linearization and duplication coefficients for q-orthogonal polynomials; 4. we propose a unified method to obtain these coefficients in a generic way for orthogonal polynomials on quadratic and q-quadratic lattices. Our algorithmic approach to compute linearization, connection and duplication coefficients is based on the one used by Koepf and Schmersau and on the NaViMa algorithm. Our main technique is to use explicit formulas for structural identities of classical orthogonal polynomial systems. We find our results by an application of computer algebra. The major algorithmic tools for our development are Zeilberger’s algorithm, q-Zeilberger’s algorithm, the Petkovšek-van-Hoeij algorithm, the q-Petkovšek-van-Hoeij algorithm, and Algorithm 2.2, p. 20 of Koepf's book "Hypergeometric Summation" and it q-analogue.

On Solutions of Holonomic Divided-Difference Equations on Non-Uniform Lattices

The main aim of this paper is the development of suitable bases (replacing the power basis x^n (n\in\IN_\le 0) which enable the direct series representation of orthogonal polynomial systems on non-uniform lattices (quadratic lattices of a discrete or a q-discrete variable). We present two bases of this type, the first of which allows to write solutions of arbitrary divided-difference equations in terms of series representations extending results given in [16] for the q-case. Furthermore it enables the representation of the Stieltjes function which can be used to prove the equivalence between the Pearson equation for a given linear functional and the Riccati equation for the formal Stieltjes function. If the Askey-Wilson polynomials are written in terms of this basis, however, the coefficients turn out to be not q-hypergeometric. Therefore, we present a second basis, which shares several relevant properties with the first one. This basis enables to generate the defining representation of the Askey-Wilson polynomials directly from their divided-difference equation. For this purpose the divided-difference equation must be rewritten in terms of suitable divided-difference operators developed in [5], see also [6].

Análise de flavanóides por cromatografia líquida de alta eficiência e eletroforese capilar - otimização de separação e aplicações tecnológicas

No presente trabalho foram estudadas as separações de 18 flavonóides (9 agliconas e 9 glicosídeos) pelas técnicas de Cromatografia Líquida de Alta Eficiência em fase reversa (RP-HPLC) e Cromatografia Micelar Eletrocinética em fluxo reverso (RF-Meck). Em ambas as técnicas foram avaliados solventes puros (metanol, acetonitrila e tetrahidrofurano) e suas misturas como formas de promover a variação de seletividade, através da modificação da fase móvel em HPLC, e da natureza do aditivo orgânico em RF-Meck. Nos estudos efetuados em HPLC utilizando-se gradiente, pode-se comprovar a possibilidade da modelagem do fator de retenção em funçã da proporção de solvente utilizados (MeOH, ACN, THF e suas misturas). Pode-se ainda, com base nos dados de retenção e na análise hierárquica de c1usters, diferenciar quatro diferentes grupos de sistemas cromatográficos com diferentes seletividades para flavonóides agliconas, e outros quatro com diferentes seletividades para glicosídeos. Os sistemas cromatográficos mais ortogonais (cada um pertencente a um grupo de seletividade) foram aplicados na separação de uma planta modelo (Azadirachta indica), de onde pode-se escolher a fase móvel mais seletiva para se otimizar a separação dos flavonóides glicosilados presentes nas folhas desta planta. No método final otimizado pode-se identificar e quantificar cinco dos flavonóides majoritários presentes, sendo três glicosídeos de quercetina (rutina, isoquercitrina e quercitrina) e dois glicosídeos de kaempferol (astragalin e nicotiflorin), em amostras de duas diferentes procedências (Piracicaba-SP e Silvânia-GO). Nos estudos envolvendo a separação dos dezoito flavonóides por RFMEKC pode-se comprovar diferenças significativas de seletividade quando se varia a natureza do solvente orgânico utilizado como aditivo, além de se observar tendências na migração em função das propriedades do solvente adicionado e da estrutura molecular do flavonóide. O solvente de menor eficiência para separação dos flavonóides foi o MeOH. Através da análise dos eletroferogramas obtidos através de um planejamento experimental de misturas, e das trocas de pares críticos observadas nos vários eletrólitos utilizados, obteve-se um método de separação com apenas um par crítico em menos de 12 minutos de corrida. O coeficiente de variação obtido para o fator de retenção foi de 1,5% e para área de 3%, considerando-se cinco injeções. O método desenvolvido foi aplicado com sucesso na identificação dos flavonóides majoritários presentes na planta modelo (Neem), obtendo-se o mesmo resultado do estudo anterior. Como forma de avaliar a concentração de flavonóides totais presentes em espécies vegetais é comum a análise de extratos após hidrólise ácida (conversão de todos glicosídeos em agliconas). Desta forma otimizou-se uma metodologia de separação em RP-HPLC de 8 flavonóides agliconas comumente presentes em alimentos e extratos vegetais de uso cosmético. A otimização foi efetuada mediante um planejamento experimental de misturas, para escolha da fase móvel mais seletiva, e de um planejamento fatorial composto central, para otimização das condições de gradiente. O método obtido foi o mais rápido já visto dentro da literatura consultada. A separação em linha de base foi efetuada em menos de 15 minutos, com coeficientes de variação de área entre 0,1 e 1,8%, coeficiente de correlação de 0,9993 a 0,9994 na faixa de 5 a 100 µg/mL, e limites de quantificação estimados na faixa de 0,1 a 0,21µg/mL. O método desenvolvido foi aplicado na otimização das condições de hidrólise de um extrato de Neem. A otimização foi efetuada através de metodologia de superfície de resposta, levando-se em consideração a concentração de ácido adicionada, o tempo de reação, a temperatura, e a concentração de um antioxidante (ácido ascórbico) adicionado. O resultado da otimização foi uma metodologia de hidrólise com tempo de reação igual a 5 minutos, utilizando-se 1,4 mol/L de HCI, 119°C e 500 µg/mL de ácido ascórbico. Através das metodologias de análise e de hidrólise desenvolvidas pode-se constatar a presença e quantificar no extrato de Neem os flavonóides agliconas quercetina, kaempferol e miricetina. Com o objetivo de se avaliar quais os componentes presentes em extratos vegetais são os responsáveis pelo poder antioxidante atribuído a determinadas plantas, foi montado um sistema de avaliação de poder antioxidante \"on-line\" com reação pós-coluna em HPLC (baseado na literatura) utilizando-se como \"radical livre modelo\" o ABTS. A análise da planta modelo (Neem) neste sistema mostrou que os flavonóides glicosilados identificados nas partes anteriores deste trabalho são os responsáveis pelo poder antioxidante atribuído a esta planta. De posse desta informação, e visando a obtenção de extratos para aplicações cosméticas com poder antioxidante, modelou-se a extração dos flavonóide do Neem em função da composição do solvente extrator (água, etanol , propilenoglicol e suas misturas), de acordo com um planejamento simplex centróide ampliado. Além da previsão da concentração dos princípios ativos pode-se ainda prever outras propriedades dos extratos obtidos, tais como, índice de refração e densidade, muitas vezes constituintes de especificações técnicas de acordo com as aplicações a que se destinam (cremes, xampús, etc).

Orthogonal systems in finite grahps

To a finite graph there corresponds a free partially commutative group: with the given graph as commutation graph. In this paper we construct an orthogonality theory for graphs and their corresponding free partially commutative groups. The theory developed here provides tools for the study of the structure of partially commutative groups, their universal theory and automorphism groups. In particular the theory is applied in this paper to the centraliser lattice of such groups.

Mean first-passage times for systems driven by equilibrium persistent-periodic dichotomous noise

In a recent paper, [J. M. Porrà, J. Masoliver, and K. Lindenberg, Phys. Rev. E 48, 951 (1993)], we derived the equations for the mean first-passage time for systems driven by the coin-toss square wave, a particular type of dichotomous noisy signal, to reach either one of two boundaries. The coin-toss square wave, which we here call periodic-persistent dichotomous noise, is a random signal that can only change its value at specified time points, where it changes its value with probability q or retains its previous value with probability p=1-q. These time points occur periodically at time intervals t. Here we consider the stationary version of this signal, that is, equilibrium periodic-persistent noise. We show that the mean first-passage time for systems driven by this stationary noise does not show either the discontinuities or the oscillations found in the case of nonstationary noise. We also discuss the existence of discontinuities in the mean first-passage time for random one-dimensional stochastic maps.

Signal detection for orthogonal space-time block coding over time-selective fading channels: the H(i) systems

One major assumption in all orthogonal space-time block coding (O-STBC) schemes is that the channel remains static over the length of the code word. However, time-selective fading channels do exist, and in such case conventional O-STBC detectors can suffer from a large error floor in the high signal-to-noise ratio (SNR) cases. As a sequel to the authors' previous papers on this subject, this paper aims to eliminate the error floor of the H(i)-coded O-STBC system (i = 3 and 4) by employing the techniques of: 1) zero forcing (ZF) and 2) parallel interference cancellation (PIC). It is. shown that for an H(i)-coded system the PIC is a much better choice than the ZF in terms of both performance and computational complexity. Compared with the, conventional H(i) detector, the PIC detector incurs a moderately higher computational complexity, but this can well be justified by the enormous improvement.

Signal detection for orthogonal space-time block coding over time-selective fading channels: a PIC approach for the Gi Systems

One major assumption in all orthogonal space-time block coding (O-STBC) schemes is that the channel remains static over the entire length of the codeword. However, time selective fading channels do exist, and in such case the conventional O-STBC detectors can suffer from a large error floor in the high signal-to-noise ratio (SNR) cases. This paper addresses such an issue by introducing a parallel interference cancellation (PIC) based detector for the Gi coded systems (i=3 and 4).

Orthogonal space-time block coding over time-selective fading channels: a PIC detector for the Gi systems

All the orthogonal space-time block coding (O-STBC) schemes are based on the following assumption: the channel remains static over the entire length of the codeword. However, time selective fading channels do exist, and in many cases the conventional O-STBC detectors can suffer from a large error floor in the high signal-to-noise ratio (SNR) cases. This paper addresses such an issue by introducing a parallel interference cancellation (PIC) based detector for the Gi coded systems (i=3 and 4).