New chaos generators

Originating from a sinusoidal oscillator circuit that employs the current feedback op amp (CFOA) as the active building block, a new chaos generator that utilizes a discrete nonlinear device of asymmetrical nonlinearity is proposed. Two different positions of the nonlinearity within the circuit structure are investigated. A slight modification incorporating the addition of a single resistor to the generator is shown to facilitate its tuning and affect the dynamics of its chaotic behavior. Experimental laboratory results agree well with PSpice simulations, and both are included.     

New comparison results for impulsive integro-differential equations and applications

We prove some new maximum principles for ordinary integro-differential equations. This allows us to introduce a new definition of lower and upper solutions which leads to the development of the monotone iterative technique for a periodic boundary value problem related to a nonlinear first-order impulsive integro-differential equation.     

Limit theorems for semigroups with perturbed generators,with applications to multiscaled random evolutions

For parameters η, let {B(η)} denote infinitesimal operators of strongly continuous semigroups, with resolvents R(λ; B(η)) satisfying λR(λ; B(η)) = P(η) + λV(η) + o(λ). For parameters α, let {A(α)} denote possibly unbounded, linear operators for which {A(α) + B(η)} are infinitesimal operators of strongly continuous semigroups {U_α·η(t)}. For α, η converging simultaneously, we show strong convergence of the semigroups U_α·η(t) to a strongly continuous semigroup U(t), with limiting infinitesimal operator characterized by lim_α·η ∑_jP(η) A(α) × (V(η) A(α))ⁱf. We give applications of the abstract perturbation theorems to limit theorems of random evolutions and associated abstract Cauchy problems, in which multiscaling occurs in the convergence.     

Explicitly given pairs of dual frames with compactly supported generators and applications to irregular B-splines

We consider systems of functions appearing by letting a class of modulations act on a countable collection of functions. These systems correspond to shift-invariant systems, considered on the Fourier side. We provide sufficient conditions for the system to be a frame, as well as an explicit construction of a class of frames and associated duals. We use the result to construct frames based on B-splines with knot sequences satisfying a natural condition, as well as explicitly given duals.     

Transitive approximation to pairwise comparison matrices by using interval goal programming

Paired comparison is a very popular method for establishing the relative importance of n objects, when they cannot be directly rated. The challenge faced by the pairwise comparison method stems from some missing properties in its associated matrix. In this paper, we focus on the following general problem: given a non-reciprocal and inconsistent matrix computing intransitivities, what is its associated ranking (defined by importance values)? We propose to use inconsistencies as a source of information for obtaining importance values. For this purpose, a methodology with a decomposition and aggregation phase is proposed. Interval Goal Programming will be a useful tool for implementing the aggregation process defined in the second phase.     

Constrained CVT meshes and a comparison of triangular mesh generators

Mesh generation in regions in Euclidean space is a central task in computational science, and especially for commonly used numerical methods for the solution of partial differential equations, e.g., finite element and finite volume methods. We focus on the uniform Delaunay triangulation of planar regions and, in particular, on how one selects the positions of the vertices of the triangulation. We discuss a recently developed method, based on the centroidal Voronoi tessellation (CVT) concept, for effecting such triangulations and present two algorithms, including one new one, for CVT-based grid generation. We also compare several methods, including CVT-based methods, for triangulating planar domains. To this end, we define several quantitative measures of the quality of uniform grids. We then generate triangulations of several planar regions, including some having complexities that are representative of what one may encounter in practice. We subject the resulting grids to visual and quantitative comparisons and conclude that all the methods considered produce high-quality uniform grids and that the CVT-based grids are at least as good as any of the others.     

Chaining algorithms for multiple genome comparison

Given n fragments from k>2 genomes, Myers and Miller showed how to find an optimal global chain of colinear non-overlapping fragments in O(nlog^kn) time and O(nlog^k−1n) space. For gap costs in the L₁-metric, we reduce the time complexity of their algorithm by a factor and the space complexity by a factor logn. For the sum-of-pairs gap cost, our algorithm improves the time complexity of their algorithm by a factor . A variant of our algorithm finds all significant local chains of colinear non-overlapping fragments. These chaining algorithms can be used in a variety of problems in comparative genomics: the computation of global alignments of complete genomes, the identification of regions of similarity (candidate regions of conserved synteny), the detection of genome rearrangements, and exon prediction.     

A goal programming method for obtaining interval weights from an interval comparison matrix

Crisp comparison matrices lead to crisp weight vectors being generated. Accordingly, an interval comparison matrix should give an interval weight estimate. In this paper, a goal programming (GP) method is proposed to obtain interval weights from an interval comparison matrix, which can be either consistent or inconsistent. The interval weights are assumed to be normalized and can be derived from a GP model at a time. The proposed GP method is also applicable to crisp comparison matrices. Comparisons with an interval regression analysis method are also made. Three numerical examples including a multiple criteria decision-making (MCDM) problem with a hierarchical structure are examined to show the potential applications of the proposed GP method.     

Solvable Lie algebras,products by generators,and some of its applications

In this work, we enlarge the definition of products by generators of Lie algebras to the class of solvable Lie algebras. We analyze the number of independent invariant functions for the coadjoint representation of these algebras by means of the Maurer-Cartan equations and give some applications to product structures on Lie algebras. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 11, No. 4, pp. 85–94, 2005.     

New clustering methods for interval data

Summary  In this paper we propose two clustering methods for interval data based on the dynamic cluster algorithm. These methods use different homogeneity criteria as well as different kinds of cluster representations (prototypes). Some tools to interpret the final partitions are also introduced. An application of one of the methods concludes the paper.     

A comparison of interval linear programming with the simplex method

A detailed comparison of the simplex method for linear programming with a recent interval linear programming algorithm reveals that the methods are identical in the sense that the same sequence of extreme points can be generated by either algorithm.     

New mathematical identities with applications to flexure and torsion

We obtain some new trigonometric identities and find the corresponding Chebyshev polynomials identities. We also indicate their applications to certain boundary value problems which arise in Mechanics.     

New dependence coefficients. Examples and applications to statistics

To measure the dependence between a real-valued random variable X and a -algebra , we consider four distances between the conditional distribution function of X given and the distribution function of X. The coefficients obtained are weaker than the corresponding mixing coefficients and may be computed in many situations. In particular, we show that they are well adapted to functions of mixing sequences, iterated random functions and dynamical systems. Starting from a new covariance inequality, we study the mean integrated square error for estimating the unknown marginal density of a stationary sequence. We obtain optimal rates for kernel estimators as well as projection estimators on a well localized basis, under a minimal condition on the coefficients. Using recent results, we show that our coefficients may be also used to obtain various exponential inequalities, a concentration inequality for Lipschitz functions, and a Berry-Esseen type inequality.Mathematics Subject Classification (2000): 62G07, 60J10, 60E15, 37C30     

New interval methods for constrained global optimization

Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adaptive multisection rules which enable the algorithm to choose the proper multisection type depending on simple heuristic decision rules. Moreover, for the selection of the next box to be subdivided, we investigate new criteria. Both the adaptive multisection and the subinterval selection rules seem to be specially suitable for being used in inequality constrained global optimization problems. The usefulness of these new techniques is shown by computational studies.