An Integrated Two Phases Approach to Zn2+ Ions Electroreduction on Hg

The following two numerical models have been applied to zinc cations electroreduction in 1 M NaClO₄ water solution: a classical EE model describing the concentration of involved species in solution (semi infinitive diffusion region), an extended EE model describing both: the concentration of involved species in solution and the concentration of metallic zinc inside mercury drop (in limited area of diffusion). In the latter model the inner part of mercury drop and surrounding solution were treated as dynamic interrelated system. Both models were applied to experimental cyclic voltammetric CV data in 1 M NaClO₄, the results compared and discussed. The concentration profiles of all species including metallic zinc inside mercury drop were performed. The presented integrated model is essential for theoretical and analytical aspects of the electrochemistry of mercury soluble metal cations and amalgams.     

Synthesis of bioactive indolocarbazoles: synthesis, nucleophilic ring-opening and chiral base desymmetrisation of a cyclic sulfate intermediate

A number of new functionalised bridged indolocarbazole systems have been prepared by ring-opening reactions of a key cyclic sulfate intermediate, prepared from the corresponding diol by the action of sulfuryl diimidazole and DBU. The same cyclic sulfate also undergoes an unprecedented asymmetric rearrangement to a chiral ketone, on treatment with a chiral lithium amide base.     

Backward extensions of subnormal operators

The concept of backward extension for subnormal weighted shifts is generalized to arbitrary subnormal operators. Several differences and similarities in these contexts are explored, with emphasis on the structure of the underlying measures.

     

Polyadic codes of prime power length

Polyadic codes constitute a special class of cyclic codes and are generalizations of quadratic residue codes, duadic codes, triadic codes, m-adic residue codes and split group codes, which have good error-correcting properties. In this paper, we give necessary and sufficient conditions for the existence of polyadic codes of prime power length. Examples of some good codes arising from the family of polyadic codes of prime power length are also given.     

New classes of 2-weight cyclic codes

We introduce new classes of 2-weight cyclic codes which are direct sums of 1-weight irreducible cyclic codes      

Representations, convolution square roots and spherical vectors

We extend results on square integrable representations of a locally compact group to subrepresentations of a representations induced from a character of a closed subgroup. We do so working in the framework of quotient representations of ∗-algebras.     

The effect of ITO films thickness on the properties of flexible organic light emitting diode

Indium tin oxide (ITO) thin films were deposited on cyclic olefin copolymer substrate at room temperature by an inverse target sputtering system. The crystal structure and the surface morphology of the deposited ITO films were examined by X-ray diffraction and atomic force microscopy, separately. The electrical properties of the conductive films were explored by four-point probing. Visible spectrometer was used to measure the optical properties of ITO-coated films. The performance of the flexible organic light emitting diode device with different thickness anode was investigated in this study.     

Cyclic cohomology and algebra extensions

We construct a spectral sequence to study cyclic cohomology for an extension A = R/I of algebras. When R is a free algebra we describe the cyclic cohomology of A in terms of traces defined on R or powers of I. Explicit cyclic cocycles representing the cyclic cohomology class belonging to the trace are constructed as analogues of Chern character and Chern-Simons forms.Dedicated to Alexander Grothendieck     

Cyclic networks with general blocking and starvation

We introducegeneral starvation and consider cyclic networks withgeneral blocking and starvation (GBS). The mechanism of general blocking allows the server to process a limited number of jobs when the buffer downstream is full, and that of general starvation allows the server to perform a limited number of services in anticipation of jobs that are yet to arrive. The two main goals of this paper are to investigate how the throughput of cyclic GBS networks is affected by varying (1) the total number of jobsJ, and (2) the buffer allocationk=(k₁..., k_m) subject to a fixed total buffer capacityK=k ₁ +... + k_m. In particular, we obtain sufficient conditions for the throughput to be symmetric inJ and to be maximized whenJ=K/2. We also show that the equal buffer allocation is optimal under the two regimes of light or heavy usage. In order to establish these results, we obtain several intermediate structural properties of the throughput, using duality, reversibility, and concavity, which are of independent interest.Research supported in part by NSF Grant No. ECS-8919818.     

Cyclic BSEC of block size 3

Balanced sampling plans excluding contiguous units (or BSEC) were first introduced by Hedayat, Rao and Stufken in 1988. In this note, we discuss constructions of these designs having cyclic automorphisms. We use Langford sequences to construct all possible cyclic BSEC (or CBSEC) with block size 3 and λ = 1,2, which establishes the necessary and sufficient conditions for such designs. Some constructions of the balanced sampling plan avoiding adjacent units, a generalization of BSEC, are also given for fixed λ.