The s-elementary frame wavelets are path connected

An s-elementary frame wavelet is a function which is a frame wavelet and is defined by a Lebesgue measurable set such that . In this paper we prove that the family of s-elementary frame wavelets is a path-connected set in the -norm. This result also holds for s-elementary -dilation frame wavelets in in general. On the other hand, we prove that the path-connectedness of s-elementary frame wavelets cannot be strengthened to uniform path-connectedness. In fact, the sets of normalized tight frame wavelets and frame wavelets are not uniformly path-connected either.

     

The s-elementary wavelets are path-connected

A construction of wavelet sets containing certain subsets of is given. The construction is then modified to yield a continuous dependence on the underlying subset, which is used to prove the path-connectedness of the s-elementary wavelets. A generalization to is also considered.

     

Further results on the connectivity of Parseval frame wavelets

In a previous paper, the authors introduced new ideas to treat the problem of connectivity of Parseval frames. With these ideas it was shown that a large set of Parseval frames is arcwise connected. In this article we exhibit a larger class of Parseval frames for which the arcwise connectivity is true. This larger class fails to include all Parseval frames.

     

On a multicriteria shortest path problem

Multicriteria shortest path problems have not been treated intensively in the specialized literature, despite their potential applications. In fact, a single objective function may not be sufficient to characterize a practical problem completely. For instance, in a road network several parameters (as time, cost, distance, etc.) can be assigned to each arc. Clearly, the shortest path may be too expensive to be used. Nevertheless the decision-maker must be able to choose some solution, possibly not the best for all the criteria.In this paper we present two algorithms for this problem. One of them is an immediate generalization of the multiple labelling scheme algorithm of Hansen for the bicriteria case. Based on this algorithm, it is proved that any pair of nondominated paths can be connected by nondominated paths. This result is the support of an algorithm that can be viewed as a variant of the simplex method used in continuous linear multiobjective programming. A small example is presented for both algorithms.     

On the second point-to-point undirected shortest simple path problem

We address the determination of the second point-to-point shortest simple path in undirected networks. The effective reduced cost concept is introduced to compute the second best solution. This concept is used to prove that a path tree containing the second point-to-point shortest simple path is adjacent to any shortest path tree. Therefore, this result immediately implies a method requiring O(m) time once that the shortest path tree is obtained on an undirected network with n nodes and m edges.     

On the K shortest path trees problem

We address the problem of finding the K best path trees connecting a source node with any other non-source node in a directed network with arbitrary lengths. The main result in this paper is the proof that the kth shortest path tree is adjacent to at least one of the previous (k-1) shortest path trees. Consequently, we design an O(f(n,m,C_max)+Km) time and O(K+m) space algorithm to determine the K shortest path trees, in a directed network with n nodes, m arcs and maximum absolute length C_max, where O(f(n,m,C_max)) is the best time needed to solve the shortest simple paths connecting a source node with any other non-source node.     

Generalized low pass filters and MRA frame wavelets

A tight frame wavelet ψ is an L ²(ℝ) function such that {ψ jk(x)} = {2^j/2 ψ(2 ^j x −k), j, k ∈ ℤ},is a tight frame for L ² (ℝ).We introduce a class of “generalized low pass filters” that allows us to define (and construct) the subclass of MRA tight frame wavelets. This leads us to an associated class of “generalized scaling functions” that are not necessarily obtained from a multiresolution analysis. We study several properties of these classes of “generalized” wavelets, scaling functions and filters (such as their multipliers and their connectivity). We also compare our approach with those recently obtained by other authors.     

Algorithms for the quickest path problem and the reliable quickest path problem

The quickest path problem consists of finding a path in a directed network to transmit a given amount of items from an origin node to a destination node with minimal transmission time, when the transmission time depends on both the traversal times of the arcs, or lead time, and the rates of flow along arcs, or capacity. In telecommunications networks, arcs often also have an associated operational probability of the transmission being fault free. The reliability of a path is defined as the product of the operational probabilities of its arcs. The reliability as well as the transmission time are of interest. In this paper, algorithms are proposed to solve the quickest path problem as well as the problem of identifying the quickest path whose reliability is not lower than a given threshold. The algorithms rely on both the properties of a network which turns the computation of a quickest path into the computation of a shortest path and the fact that the reliability of a path can be evaluated through the reliability of the ordered sequence of its arcs. Other constraints on resources consumed, on the number of arcs of the path, etc. can also be managed with the same algorithms.     

On divergence-free wavelets

This paper is concerned with the construction of compactly supported divergence-free vector wavelets. Our construction is based on a large class of refinable functions which generate multivariate multiresolution analyses which includes, in particular, the non tensor product case.For this purpose, we develop a certain relationship between partial derivatives of refinable functions and wavelets with modifications of the coefficients in their refinement equation. In addition, we demonstrate that the wavelets we construct form a Riesz-basis for the space of divergence-free vector fields.Work supported by the Deutsche Forschungsgemeinschaft in the Graduiertenkolleg Analyse und Konstruktion in der Mathematik at the RWTH Aachen.     

On trigonometric wavelets

Wavelets in terms of sine and cosine functions are constructed for decomposing 2π-periodic square-integrable functions into different octaves and for yielding local information within each octave. Results on a simple mapping into the approximate sample space, order of approximation of this mapping, and pyramid algorithms for decomposition and reconstruction are also discussed.     

Subspaces with normalized tight frame wavelets in

In this paper we investigate the subspaces of which have normalized tight frame wavelets that are defined by set functions on some measurable subsets of called Bessel sets. We show that a subspace admitting such a normalized tight frame wavelet falls into a class of subspaces called reducing subspaces. We also consider the subspaces of that are generated by a Bessel set in a special way. We present some results concerning the relation between a Bessel set and the corresponding subspace of which either has a normalized tight frame wavelet defined by the set function on or is generated by .

     

Orthogonal wavelets on direct products of cyclic groups

We describe a method for constructing compactly supported orthogonal wavelets on a locally compact Abelian group G which is the weak direct product of a countable set of cyclic groups of pth order. For all integers p, n ≥ 2, we establish necessary and sufficient conditions under which the solutions of the corresponding scaling equations with p ⁿ numerical coefficients generate multiresolution analyses in L ²(G). It is noted that the coefficients of these scaling equations can be calculated from the given values of p ⁿ parameters using the discrete Vilenkin-Chrestenson transform. Besides, we obtain conditions under which a compactly supported solution of the scaling equation in L ²(G) is stable and has a linearly independent system of “integer” shifts. We present several examples illustrating these results.     

A wavelets method for plane elasticity problem

A Neumann boundary value problem of plane elasticity problem in the exterior circular domain is reduced into an equivalent natural boundary integral equation and a Poisson integral formula with the DtN method. Using the trigonometric wavelets and Galerkin method, we obtain a fast numerical method for the natural boundary integral equation which has an unique solution in the quotient space. We decompose the stiffness matrix in our numerical method into four circulant and symmetrical or antisymmetrical submatrices, and hence the solution of the associated linear algebraic system can be solved with the fast Fourier transform (FFT) and the inverse fast Fourier transform (IFFT) instead of the inverse matrix. Examples are given for demonstrating our method has good accuracy of our method even though the exact solution is almost singular.     

On interpolatory divergence-free wavelets

We construct interpolating divergence-free multiwavelets based on cubic Hermite splines. We give characterizations of the relevant function spaces and indicate their use for analyzing experimental data of incompressible flow fields. We also show that the standard interpolatory wavelets, based on the Deslauriers-Dubuc interpolatory scheme or on interpolatory splines, cannot be used to construct compactly supported divergence-free interpolatory wavelets.

     

On wavelets inL 1

In this paper we give a method to characterize the smoothness of functions inL ₁ by anr-regular multiresolution analysis and its derivatives.This project is supported by Zhejiang Provincial Natural Science Foundation and the Special Program of China.     

On MRA Riesz wavelets

We investigate the properties of univariate MRA Riesz wavelets. In particular we obtain a generalization to semiorthogonal MRA wavelets of a well-known representation theorem for orthonormal MRA wavelets.

     

On Parseval super-frame wavelets

Suppose that η1,...,ηn are measurable functions in L2(R).We call the n-tuple (η1,…,ηn) a Parseval super frame wavelet of length n if {2k/2η1(2kt-)（@）...(@)2k/2ηn(2kt-l):k,l∈Z}is a Parseval frame for L2...