Sparse signal representation by adaptive non-uniform B-spline dictionaries on a compact interval

Non-uniform B-spline dictionaries on a compact interval are discussed in the context of sparse signal representation. For each given partition, dictionaries of B-spline functions for the corresponding spline space are built up by dividing the partition into subpartitions and joining together the bases for the concomitant subspaces. The resulting slightly redundant dictionaries are composed of B-spline functions of broader support than those corresponding to the B-spline basis for the identical space. Such dictionaries are meant to assist in the construction of adaptive sparse signal representation through a combination of stepwise optimal greedy techniques.

Precipitation casting of drug-loaded microporous PCL matrices:incorporation of progesterone by co-dissolution

Microporous, poly(ε-caprolactone) (PCL) matrices were loaded with progesterone by precipitation casting using co-solutions of PCL and progesterone in acetone. Progesterone loadings up to 32% w/w were readily achieved by increasing the drug content of the starting PCL solution. The kinetics of steroid release in PBS at 37°C over 10 days could be described effectively by a diffusional release model although the Korsmeyer-Peppas model indicated the involvement of multiple release phenomena. The diffusion rate constant (D) increased from 8 to 24 μg/mg matrix/day0.5 as the drug loading increased from 3.6 to 12.4% w/w. A total cumulative release of 75%-95% indicates the high efficiency of steroid delivery. Increasing the matrix density from 0.22 to 0.39 g/cm3, by increasing the starting PCL solution concentration, was less effective in changing drug release kinetics. Retention of anti-proliferative activity of released steroid was confirmed using cultures of breast cancer epithelial (MCF-7) cells. Progesterone released from PCL matrices into PBS at 37°C over 14 days retarded the growth of MCF-7 cells by a factor of at least 3.5 compared with progesterone-free controls. These findings recommend further investigation of precipitation-cast PCL matrices for delivery of bioactive molecules such as anti-proliferative agents from implanted, inserted or topical devices.

Delivery of the antibiotic gentamicin sulphate from precipitation cast matrices of polycaprolactone

Microporous, poly(ε-caprolactone) (PCL) matrices were loaded with the aminoglycoside antibiotic, gentamicin sulphate (GS) using the precipitation casting technique by suspension of powder in the PCL solution prior to casting. Improvements in drug loading from 1.8% to 6.7% w/w and distribution in the matrices were obtained by pre-cooling the suspension to 4°C. Gradual release of approximately 80% of the GS content occurred over 11 weeks in PBS at 37°C and low amounts of antibiotic were measured up to 20 weeks. The kinetics of release could be described effectively by the Higuchi model with the diffusion rate constant (D) increasing from of 1.7 to 5.1 μg/mg matrix/day0.5 as the drug loading increased from 1.4% to 8.3% w/w. GS-loaded PCL matrices retained anti-bacterial activity after immersion in PBS at 37°C over 14 days as demonstrated by inhibition of growth of S. epidermidis in culture. These findings recommend further investigation of precipitation-cast PCL matrices for delivery of hydrophilic molecules such as anti-bacterial agents from implanted, inserted or topical devices. © 2005 Elsevier B.V. All rights reserved.

Competition for shortest paths on sparse graphs

Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of a nonlinear overlap cost that penalizes congestion. Routing becomes more difficult as the number of selected nodes increases and exhibits ergodicity breaking in the case of multiple routers. The ground state of such systems reveals nonmonotonic complex behaviors in average path length and algorithmic convergence, depending on the network topology, and densities of communicating nodes and routers. A distributed linearly scalable routing algorithm is also devised. © 2012 American Physical Society.

Sparse representation of astronomical images

Sparse representation of astronomical images is discussed. It is shown that a significant gain in sparsity is achieved when particular mixed dictionaries are used for approximating these types of images with greedy selection strategies. Experiments are conducted to confirm (i) the effectiveness at producing sparse representations and (ii) competitiveness, with respect to the time required to process large images. The latter is a consequence of the suitability of the proposed dictionaries for approximating images in partitions of small blocks. This feature makes it possible to apply the effective greedy selection technique called orthogonal matching pursuit, up to some block size. For blocks exceeding that size, a refinement of the original matching pursuit approach is considered. The resulting method is termed "self-projected matching pursuit," because it is shown to be effective for implementing, via matching pursuit itself, the optional backprojection intermediate steps in that approach. © 2013 Optical Society of America.

Sparse image representation with encryption

In this thesis we present an overview of sparse approximations of grey level images. The sparse representations are realized by classic, Matching Pursuit (MP) based, greedy selection strategies. One such technique, termed Orthogonal Matching Pursuit (OMP), is shown to be suitable for producing sparse approximations of images, if they are processed in small blocks. When the blocks are enlarged, the proposed Self Projected Matching Pursuit (SPMP) algorithm, successfully renders equivalent results to OMP. A simple coding algorithm is then proposed to store these sparse approximations. This is shown, under certain conditions, to be competitive with JPEG2000 image compression standard. An application termed image folding, which partially secures the approximated images is then proposed. This is extended to produce a self contained folded image, containing all the information required to perform image recovery. Finally a modified OMP selection technique is applied to produce sparse approximations of Red Green Blue (RGB) images. These RGB approximations are then folded with the self contained approach.

Research allocation on sparse graphs

DUE TO COPYRIGHT RESTRICTIONS ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY AND INFORMATION SERVICES WITH PRIOR ARRANGEMENT

Message-passing for inference and optimization of real variables on sparse graphs

The inference and optimization in sparse graphs with real variables is studied using methods of statistical mechanics. Efficient distributed algorithms for the resource allocation problem are devised. Numerical simulations show excellent performance and full agreement with the theoretical results. © Springer-Verlag Berlin Heidelberg 2006.

Numerical implementation of low-PMD spun fibres with precomputed M(w) matrices

Poster With the use of the coarse-step method for simulating the phenomenon of PMD the fibre-twist as not included into the equations. This was an obstacle in representing low-PMD spun fibres numerially.

Parallel Class Intersection Matrices of Orthogonal Resolutions

This work was partially supported by the Bulgarian National Science Fund under Contract No MM 1405. Part of the results were announced at the Fifth International Workshop on Optimal Codes and Related Topics (OCRT), White Lagoon, June 2007, Bulgaria

Primitive Ideals and Symplectic Leaves of Quantum Matrices

It is proved that there exists a bijection between the primitive ideals of the algebra of regular functions on quantum m × n-matrices and the symplectic leaves of associated Poisson structure.

Exponents of Subvarieties of Upper Triangular Matrices over Arbitrary Fields are Integral

Partially supported by grant RFFI 98-01-01020.

On a Five-Diagonal Jacobi Matrices and Orthogonal Polynomials on Rays in the Complex Plane

∗ Partially supported by Grant MM-428/94 of MESC.

Fermat's Equation in Matrices

The Fermat equation is solved in integral two by two matrices of determinant one as well as in finite order integral three by three matrices.

Description Reduction for Restricted Sets of (0,1) Matrices

* The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.be