Nontrivial Solutions for Resonant Hemivariational Inequalities

We study a resonant semilinear elliptic hemivariational inequality. Under some assumptions of strong resonance on the Clarke subdifferential of the superpotential, and using nonsmooth critical point theory, the existence of a nontrivial solution of the problem is shown. This paper has been partially supported by the State Committee for Scientific Research of Poland (KBN) under research grants no. 2 P03A 003 25 and no. 4 T07A 027 26.     

Preparation of antimicrobial poly(vinyl alcohol) nanofibers containing silver nanoparticles

Polyvinyl alcohol (PVA) nanofibers containing Ag nanoparticles were prepared by electrospinning PVA/silver nitrate (AgNO₃) aqueous solutions, followed by short heat treatment, and their antimicrobial activity was investigated for wound dressing applications. Since PVA is a water soluble and biocompatible polymer, it is one of the best materials for the preparation of wound dressing nanofibers. After heat treatment at 155 °C for 3 min, the PVA/AgNO₃ nanofibers became insoluble, while the Ag⁺ ions therein were reduced so as to produce a large number of Ag nanoparticles situated preferentially on their surface. The residual Ag⁺ ions were reduced by subsequent UV irradiation for 3 h. The average diameter of the Ag nanoparticles after the heat treatment was 5.9 nm and this value increased slightly to 6.3 nm after UV irradiation. It was found that most of the Ag⁺ ions were reduced by the simple heat treatment. The PVA nanofibers containing Ag nanoparticles showed very strong antimicrobial activity. © 2006 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 44: 2468–2474, 2006     

Tchebychev acceleration technique for large scale nonsymmetric matrices

Summary The acceleration by Tchebychev iteration for solving nonsymmetric eigenvalue problems is dicussed. A simple algorithm is derived to obtain the optimal ellipse which passes through two eigenvalues in a complex plane relative to a reference complex eigenvalue. New criteria are established to identify the optimal ellipse of the eigenspectrum. The algorithm is fast, reliable and does not require a search for all possible ellipses which enclose the spectrum. The procedure is applicable to nonsymmetric linear systems as well.     

Structural studies of Cr-doped mullite derived from single-phase precursors

Cr-doped mullites were prepared from single-phase precursors containing up to 9.60 wt% Cr₂O₃ using a sol-gel technique followed by thermal treatment. Particle induced X-ray emission spectroscopy and X-ray powder diffraction were used to characterize the samples. Mullites were orthorhombic, space group Pbam. Cr doping caused the increase of unit-cell parameters. Strongest expansion was noticed along c-axis followed by a and b (Δc/c=0.089, Δa/a=0.061, Δb/b=0.045% per mole Cr₂O₃). A second phase, namely θ-(Al,Cr)₂O₃, was revealed by XRD in the sample containing 9.60 wt% Cr₂O₃. The structure of mullites was refined by the Rietveld method, location of Cr³⁺ was performed by the EPR spectroscopy. At low chromium doping level (Cr₂O₃ content less than ∼5 wt%) Cr³⁺ ions were substituted for Al³⁺ in the AlO₆ octahedra of the mullite structure (M1 site). For higher doping level, Cr³⁺ ions were additionally substituted for Al³⁺ in the AlO₆ octahedra of the second phase [θ-(Al,Cr)₂O₃ at 1400 °C, or α-(Al,Cr)₂O₃ at 1600 °C] which segregated in the system. Substitution of Cr³⁺ for Al³⁺ on M1 site in the mullite structure resulted in increase of average distances in (M1)O₆ octahedron and decrease of average distances in T*O₄ tetrahedron, while average distances in TO₄ tetrahedron stayed almost constant.     

Conversion of single-stranded oligonucleotides into cloned duplexes and its consecutive application to short artificial genes.

A general method to convert single-stranded, chemically synthesized oligonucleotides into cloned duplexes is described. Oligonucleotides supplied with 3'-terminal extensions that are complementary to 3'-protruding ends obtained by certain restriction enzymes can be cloned either directly or with the help of an adapter molecule into double-stranded vectors. Two methods have also been developed for consecutive cloning applications. According to these methods, the synthetic oligonucleotides (and their enzymatically prepared complementary strands) are joined, one after the other, inside a cloning vector, each joining requiring one cloning step. Synthetic genes are thus built up from oligonucleotides corresponding to only one strand of the DNA. The sequential assembly of the cloned duplex takes place in the 5' to 3' direction. Each oligonucleotide is supplied with a four-nucleotide-long 3'-terminal extension, but this sequence is eliminated when the joining takes place, leaving no limiting sequence between the oligonucleotides. The two consecutive cloning methods, the adapter and the polycloning site methods, are illustrated by the assembly of short artificial genes.     

The Recognition of Double Euler Trails in Series-Parallel Networks

Given a series-parallel network (network, for short)N, its dual networkN′ is given by interchanging the series connection and the parallel connection of networkN. We usually use a series-parallel graph to represent a network. LetG[N] andG[N′] be graph representations ofNandN′, respectively. A sequence of edgese₁, e₂,…,e_kis said to form a common trail on (G[N], G[N′]) if it is a trail on bothG[N] andG[N′]. If a common trail covers all of the edges inG[N] andG[N′], it is called adouble Euler trail.However, there are many different graph representations for a network. We say that a networkNhas a double Euler trail (DET) if there is a common Euler trail for someG[N] and someG[N′]. Finding a DET in a network is essential for optimizing the layout area of a complementary CMOS functional cell. Maziasz and Hayes (IEEE Trans. Computer-Aided Design9(1990), 708–719) gave a linear time algorithm for solving the layout problem in fixedG[N] andG[N′] and an exponential algorithm for finding the optimal cover in a network without fixing graph representations. In this paper, we study properties of subnetworks of a DET network. According to these properties, we propose an algorithm that automatically generates the rules for composition of trail cover classes. On the basis of these rules, a linear time algorithm for recognizing DET networks is presented. Furthermore, we also give a necessary and sufficient condition for the existence of a double Euler circuit in a network.     

Neocompact Sets and the Fixed Point Property

We use a newly introduced concept of neocompactness to study problems from metric fixed point theory. In particular, we give a sufficient condition for a superreflexive Banach space X to have the fixed point property and obtain shorter proofs of some well-known results in that theory.