First synthesis of arylpyrrolo- and pyrazolopyrrolizinones as useful agents with potential biological interest

Novel arylpyrrolo- and pyrazolopyrrolizinones were prepared in three or four steps starting from aminoarylpyrrole and pyrazole carboxylates through the cyclisation of a Vilsmeier-Haack intermediate. This synthesis was enhanced by diverse N-protections of the aza-heterocycle and furnish new series with potential biological interest.     

Equivalence of inverse Sturm-Liouville problems with boundary conditions rationally dependent on the eigenparameter

Three inverse problems for a Sturm-Liouville boundary value problem −y″+qy=λy, y(0)cosα=y′(0)sinα and y′(1)=f(λ)y(1) are considered for rational f. It is shown that the Weyl m-function uniquely determines α, f, and q, and is in turn uniquely determined by either two spectra from different values of α or by the Prüfer angle. For this it is necessary to produce direct results, of independent interest, on asymptotics and oscillation.     

Construction of best Bregman approximations in reflexive Banach spaces

An iterative method is proposed to construct the Bregman projection of a point onto a countable intersection of closed convex sets in a reflexive Banach space.

     

Photothermal microanalysis of thermal discontinuities in metallic samples

Modeling the behavior of a protective coating during a thermal shock not only requires the knowledge of its own thermophysical characteristics, but also those of the coating–substrate discontinuity. According to its nature, this discontinuity can be modeled as a zero-thickness interface (thermal contact resistance) or a finite thickness layer (thermal third body). This paper presents an experimental device and two associated thermal transfer models developed in view of the microscale characterization of such discontinuities.     

A Reality Proof in PT-Symmetric Quantum Mechanics

We review the proof of a conjecture concerning the reality of the spectra of certain PT-symmetric quantum mechanical systems, obtained via a connection between the theories of ordinary differential equations and integrable models. Spectral equivalences inspired by the correspondence are also discussed.     

Tabu search applied to the general fixed charge problem

Recent successes in applying tabu search to a wide variety of classical optimization problems have motivated the investigation of applying tabu search to the well-known general fixed charge problem (GFCP). In this paper, an adaptation of tabu search to GFCP is described and computational results are given. In addition, the computational results are compared with those obtained from SWIFT-2, the most well-known and frequently used heuristic method for GFCP. As will be shown, the results are very encouraging.     

Effect of stoichiometry on liquid crystalline supramolecular polymers formed with complementary nucleobase pair interactions

We report herein studies on the liquid crystalline behavior of a series of supramolecular materials that contain different ratios of two complementary symmetrically-substituted alkoxy-bis(phenylethynyl)benzene AA- and BB-type monomers. One monomer has thymine units placed at either end of the rigid mesogenic core, while the other has N⁶-(4-methoxybenzoyl)-adenine units placed on the ends. Differential scanning calorimetric and polarized optical microscopy studies have been carried out on these systems. These studies show that the material's behavior is strongly dependent on its thermal history. As a result, the materials can exhibit, on heating, either a liquid crystalline phase, a crystalline phase, or the coexistence of crystalline and liquid crystalline regions. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 5049–5059, 2006     

Bounds on Codes Derived by Counting Components in Varshamov Graphs

We are interested in improving the Varshamov bound for finite values of length n and minimum distance d. We employ a counting lemma to this end which we find particularly useful in relation to Varshamov graphs. Since a Varshamov graph consists of components corresponding to low weight vectors in the cosets of a code it is a useful tool when trying to improve the estimates involved in the Varshamov bound. We consider how the graph can be iteratively constructed and using our observations are able to achieve a reduction in the over-counting which occurs. This tightens the lower bound for any choice of parameters n, k, d or q and is not dependent on information such as the weight distribution of a code. This work is taken from the author’s thesis [10]