Roll angle measurement based on common path compensation principle

We propose a novel and compact roll angle displacement measurement method based on collimated laser position measurement and the common path compensation principle. The principles of the roll angle displacement measurement and the common path compensation are analyzed. The feasibility of the measurement method is verified, and the experimental results revealed a linear correlation coefficient of 0.99995 between the relative displacement of the measuring beam spot and the angular displacement. Furthermore, the theoretical measurement resolution is 0.013  arcsec. To test the performance of the compensation, a series of experiments, including one system stability experiment and two different environmental interference experiments, were performed. The experimental results indicated that the standard deviations of the measuring beam spot’s angular drift were improved by 82.6–87.2%. Thus, the stability of the system and the measurement resolution were improved.     

Forecasting mortality in subpopulations using Lee–Carter type models: A comparison

The relative performance of multipopulation stochastic mortality models is investigated. When targeting mortality rates, we consider five extensions of the well known Lee–Carter single population extrapolative approach. As an alternative, we consider similar structures when mortality improvement rates are targeted. We use a dataset of deaths and exposures of Italian regions for the years 1974–2008 to conduct a comparison of the models, running a battery of tests to assess the relative goodness of fit and forecasting capability of different approaches. Results show that the preferable models are those striking a balance between complexity and flexibility.     

Parallel Algorithms for Solving a Class of Variational Inequalities over the Common Fixed Points Set of a Finite Family of Demicontractive Mappings

Abstract

We propose parallel algorithms for solving a class of variational inequalities over the set of common fixed points for a finite family of demicontractive mappings in real Hilbert spaces. Under some suitable conditions, we prove that the sequence generated by the proposed algorithms converges strongly to a solution of the problem. We apply the proposed algorithms to strongly monotone variational inequality problems with pseudomonotone equilibrium constraints by defining a quasi-nonexpansive and demi-closed mapping whose fixed point set coincides with the solution set of the equilibrium problem.     

Alternate strip-based substructuring algorithms for elliptic PDEs in two dimensions

^** Email: angela.mihai{at}strath.ac.uk^*** Email: alan.craig{at}durham.ac.uk The alternate strip-based substructuring algorithms are efficientpreconditioning techniques for the discrete systems which arisefrom the finite-element approximation of symmetric ellipticboundary-value problems in 2D Euclidean spaces. The new approachis based on alternate decomposition of the given domain intoa finite number of strips. Each strip is a union of non-overlappingsubdomains and the global interface between subdomains is partitionedas a union of edges between strips and edges between subdomainsthat belong to the same strip. Both scalability and efficiencyare achieved by alternating the direction of the strips. Thisapproach generates algorithms in two stages and allows the useof a two-grid V cycle. Numerical estimates illustrate the behaviourof the new domain decomposition techniques.     

Fast algorithms for identifying maximal common connected sets of interval graphs

Given a family of interval graphs F={G₁=(V,E₁),…,G_k=(V,E_k)} on the same vertices V, a set S⊂V is a maximal common connected set of F if the subgraphs of G_i,1?i?k, induced by S are connected in all G_i and S is maximal for the inclusion order. The maximal general common connected set for interval graphs problem (gen-CCPI) consists in efficiently computing the partition of V in maximal common connected sets of F. This problem has many practical applications, notably in computational biology. Let n=|V| and . For k?2, an algorithm in O((kn+m)logn) time is presented in Habib et al. [Maximal common connected sets of interval graphs, in: Combinatorial Pattern Matching (CPM), Lecture Notes in Computer Science, vol. 3109, Springer, Berlin, 2004, pp. 359-372]. In this paper, we improve this bound to O(knlogn+m). Moreover, if the interval graphs are given as k sets of n intervals, which is often the case in bioinformatics, we present a simple time algorithm.     

Comment on: “New exact solutions for the Kawahara equation using Exp-function method” [J. Comput. Appl. Math. 233 (2009) 97-102]

Assas [Laila M.B. Assas, New exact solutions for the Kawahara equation using Exp-function method, J. Comput. Appl. Math. 233 (2009) 97-102] found some supposedly new exact solutions to the Kawahara equation by means of the Exp-function method. Unfortunately, they are incorrect. We emphasize that the article contains erroneous formulas and resulting relations. In fact, no numerical method was used.     

When some complement of a z-closed submodule is a summand

In this article we study modules with the condition that every z-closed submodule has a complement which is a direct summand. This new class of modules properly contains the class of extending modules. It is well known that the class of extending modules is closed under direct summands, but not under direct sums. In contrast to extending (or CS) modules, it is shown that the class of modules with former property is closed under direct sums. However we provide number of algebraic topological examples which show that this new class of modules is not closed under direct summands. To this end we obtain several results on the inheritance of the latter closure property.     

Common fixed points of generalized contractions on partial metric spaces and an application

In this paper, common fixed point theorems for four mappings satisfying a generalized nonlinear contraction type condition on partial metric spaces are proved. Presented theorems extend the very recent results of I. Altun, F. Sola and H. Simsek [Generalized contractions on partial metric spaces, Topology and its applications 157 (18) (2010) 2778-2785]. As application, some homotopy results for operators on a set endowed with a partial metric are given.