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.

Orthogonal chirp division multiplexing for coherent optical fiber communications

In this paper, we propose an orthogonal chirp division multiplexing (OCDM) technique for coherent optical communication. OCDM is the principle of orthogonally multiplexing a group of linear chirped waveforms for high-speed data communication, achieving the maximum spectral efficiency (SE) for chirp spread spectrum, in a similar way as the orthogonal frequency division multiplexing (OFDM) does for frequency division multiplexing. In the coherent optical (CO)-OCDM, Fresnel transform formulates the synthesis of the orthogonal chirps; discrete Fresnel transform (DFnT) realizes the CO-OCDM in the digital domain. As both the Fresnel and Fourier transforms are trigonometric transforms, the CO-OCDM can be easily integrated into the existing CO-OFDM systems. Analyses and numerical results are provided to investigate the transmission of CO-OCDM signals over optical fibers. Moreover, experiments of 36-Gbit/s CO-OCDM signal are carried out to validate the feasibility and confirm the analyses. It is shown that the CO-OCDM can effectively compensate the dispersion and is more resilient to fading and noise impairment than OFDM.

Influence of the cutting edge micro-geometry of PCBN tools on the flank wear in orthogonal quenched and tempered turning M2 steel

Quenched and tempered high-speed steels obtained by powder metallurgy are commonly used in automotive components, such as valve seats of combustion engines. In order to machine these components, tools with high wear resistance and appropriate cutting edge geometry are required. This work aims to investigate the influence of the edge preparation of polycrystalline cubic boron nitride (PCBN) tools on the wear behavior in the orthogonal longitudinal turning of quenched and tempered M2 high-speed steels obtained by powder metallurgy. For this research, PCBN tools with high and low-CBN content have been used. Two different cutting edge geometries with a honed radius were tested: with a ground land (S shape) and without it (E shape). Also, the cutting speed was varied from 100 to 220 m/min. A rigid CNC lathe was used. The results showed that the high-CBN, E-shaped tool presented the longest life for a cutting speed of 100 m/min. High-CBN tools with a ground land and honed edge radius (S shaped) showed edge damage and lower values of the tool’s life. Low-CBN, S-shaped tools showed similar results, but with an inferior performance when compared with tools with high CBN content in both forms of edge preparation.

Shear, shear stress and shearing

New simpler formulae are derived for the shear of a pair of material elements within the context of infinitesimal strain and finite strain. Also, new formulae are derived for shear stress based on the (symmetric) Cauchy stress and for the rate of shear of a pair of material elements within the rate of strain theory. These formulae are exploited to obtain results and to derive new simpler proofs of familiar classical results. In particular, a very simple short derivation is presented of the classical result of Coulomb and Hopkins on the maximum orthogonal shear stress. © 1992.

Symmetric Interior Penalty DG Methods for the Compressible Navier-Stokes Equations II: Goal--Oriented A Posteriori Error Estimation

In this article we consider the application of the generalization of the symmetric version of the interior penalty discontinuous Galerkin finite element method to the numerical approximation of the compressible Navier--Stokes equations. In particular, we consider the a posteriori error analysis and adaptive mesh design for the underlying discretization method. Indeed, by employing a duality argument (weighted) Type I a posteriori bounds are derived for the estimation of the error measured in terms of general target functionals of the solution; these error estimates involve the product of the finite element residuals with local weighting terms involving the solution of a certain dual problem that must be numerically approximated. This general approach leads to the design of economical finite element meshes specifically tailored to the computation of the target functional of interest, as well as providing efficient error estimation. Numerical experiments demonstrating the performance of the proposed approach will be presented.

Clifford-Hermite polynomials in fractional Clifford analysis

In this paper we generalize radial and standard Clifford-Hermite polynomials to the new framework of fractional Clifford analysis with respect to the Riemann-Liouville derivative in a symbolic way. As main consequence of this approach, one does not require an a priori integration theory. Basic properties such as orthogonality relations, differential equations, and recursion formulas, are proven.

Orthogonal persistence in Java supported by aspect- oriented programming and reflection

The persistence concern implemented as an aspect has been studied since the appearance of the Aspect-Oriented paradigm. Frequently, persistence is given as an example that can be aspectized, but until today no real world solution has applied that paradigm. Such solution should be able to enhance the programmer productivity and make the application less prone to errors. To test the viability of that concept, in a previous study we developed a prototype that implements Orthogonal Persistence as an aspect. This first version of the prototype was already fully functional with all Java types including arrays. In this work the results of our new research to overcome some limitations that we have identified on the data type abstraction and transparency in the prototype are presented. One of our goals was to avoid the Java standard idiom for genericity, based on casts, type tests and subtyping. Moreover, we also find the need to introduce some dynamic data type abilities. We consider that the Reflection is the solution to those issues. To achieve that, we have extended our prototype with a new static weaver that preprocesses the application source code in order to introduce changes to the normal behavior of the Java compiler with a new generated reflective code.

An aspect-oriented framework for orthogonal persistence

The life cycle of software applications in general is very short and with extreme volatile requirements. Within these conditions programmers need development tools and techniques with an extreme level of productivity. We consider the code reuse as the most prominent approach to solve that problem. Our proposal uses the advantages provided by the Aspect-Oriented Programming in order to build a reusable framework capable to turn both programmer and application oblivious as far as data persistence is concerned, thus avoiding the need to write any line of code about that concern. Besides the benefits to productivity, the software quality increases. This paper describes the actual state of the art, identifying the main challenge to build a complete and reusable framework for Orthogonal Persistence in concurrent environments with support for transactions. The present work also includes a successfully developed prototype of that framework, capable of freeing the programmer of implementing any read or write data operations. This prototype is supported by an object oriented database and, in the future, will also use a relational database and have support for transactions.

The symmetric syntax of Japanese complex verbs and Slavic prefixes

We report on a robust symmetry between the Polish and the Japanese sequence of syntactic projections in what superficially looks like different domains, namely verbal prefixes (Polish) and multiple verbs (Japanese). This paralellism strongly supports the thesis about the finegrained sequence of positions in syntax, namely that there exists the functional sequence of syntactic heads (fseq) which is invariantly ordered by UG (see e.g. Cinque (1999)) and the surface differences among particular langauges in the order of elements that instantiate this fseq result solely from movement (not from the variation in fseq itself).

A lower bound for the energy of symmetric matrices and graphs

The energy of a symmetric matrix is the sum of the absolute values of its eigenvalues. We introduce a lower bound for the energy of a symmetric partitioned matrix into blocks. This bound is related to the spectrum of its quotient matrix. Furthermore, we study necessary conditions for the equality. Applications to the energy of the generalized composition of a family of arbitrary graphs are obtained. A lower bound for the energy of a graph with a bridge is given. Some computational experiments are presented in order to show that, in some cases, the obtained lower bound is incomparable with the well known lower bound $2\sqrt{m}$, where $m$ is the number of edges of the graph.

DnaG interacts with a linker region that joins the N- and C-domains of DnaB and induces the formation of 3-fold symmetric rings

Loading of the replicative ring helicase onto the origin of replication (oriC) is the final outcome of a well coordinated series of events that collectively constitute a primosomal cascade. Once the ring helicase is loaded, it recruits the primase and signals the switch to the polymerization mode. The transient nature of the helicase-primase (DnaB-DnaG) interaction in the Escherichia coli system has hindered our efforts to elucidate its structure and function. Taking advantage of the stable DnaB-DnaG complex in Bacillus stearothermophilus, we have reviewed conflicting mutagenic data from other bacterial systems and shown that DnaG interacts with the flexible linker that connects the N- and C-terminal domains of DnaB. Furthermore, atomic force microscopy (AFM) imaging experiments show that binding of the primase to the helicase induces predominantly a 3-fold symmetric morphology to the hexameric ring. Overall, three DnaG molecules appear to interact with the hexameric ring helicase but a small number of complexes with two and even one DnaG molecule bound to DnaB were also detected. The structural/functional significance of these data is discussed and a speculative structural model for this complex is suggested.

Convolution of Orbital Measures on Symmetric Spaces of type Cp and Dp

International audience

Search of symmetric composition methods of symmetric integrators

Composition methods are useful when solving Ordinary Differential Equations (ODEs) as they increase the order of accuracy of a given basic numerical integration scheme. We will focus on sy-mmetric composition methods involving some basic second order symmetric integrator with different step sizes [17]. The introduction of symmetries into these methods simplifies the order conditions and reduces the number of unknowns. Several authors have worked in the search of the coefficients of these type of methods: the best method of order 8 has 17 stages [24], methods of order 8 and 15 stages were given in [29, 39, 40], 10-order methods of 31, 33 and 35 stages have been also found [24, 34]. In this work some techniques that we have built to obtain 10-order symmetric composition methods of symmetric integrators of s = 31 stages (16 order conditions) are explored. Given some starting coefficients that satisfy the simplest five order conditions, the process followed to obtain the coefficients that satisfy the sixteen order conditions is provided.