Miscible blends of modified poly(aryl ether ketones) with aromatic polyimides

The phase behavior of binary blends of poly(ether ether ketone) (PEEK), sulfonated PEEK, and sulfamidated PEEK with aromatic polyimides is reported. PEEK was determined to be immiscible with a poly(amide imide) (TORLON 4000T). Blends of sulfonated and sulfamidated PEEK with this poly(amide imide), however, are reported here to be miscible in all proportions. Blends of sulfonated PEEK and a poly(ether imide) (ULTEM 1000) are also reported to be miscible. Spectroscopic investigations of the intermolecular interactions suggest that formation of electron donoracceptor complexes between the sulfonated/sulfamidated phenylene rings of the PEEKs and the n-phenylene units of the polyimides are responsible for this miscibility. © 1993 John Wiley & Sons, Inc.     

A Construction of Optimal Constant Composition Codes

In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal constant composition codes meeting the upper bound given by [13].     

On parabolic equations with a small parameter

A singularly perturbed parabolic equation with a nonlinear right-hand side of a special form is examined. A numerical analytical study of such equations is performed.     

An Implicit Iteration Process with Errors for a Finite Family of r-strictly Asymptotically Pseudocontractive Mappings

In this paper,we will establish several strong convergence theorems for the approximation ofcommon fixed points of r-strictly asymptotically pseudocontractive mappings in uniformly convex Banachspaces using the modiied implicit iteration sequence with errors,and prove the necessary and sufficient conditionsfor the convergence of the sequence.Our results generalize,extend and improve the recent work,in thistopic.     

Involutions for upper triangular matrix algebras

In this paper we describe completely the involutions of the first kind of the algebra UT_n(F) of n×n upper triangular matrices. Every such involution can be extended uniquely to an involution on the full matrix algebra. We describe the equivalence classes of involutions on the upper triangular matrices. There are two distinct classes for UT_n(F) when n is even and a single class in the odd case.Furthermore we consider the algebra UT₂(F) of the 2×2 upper triangular matrices over an infinite field F of characteristic different from 2. For every involution *, we describe the *-polynomial identities for this algebra. We exhibit bases of the corresponding ideals of identities with involution, and compute the Hilbert (or Poincaré) series and the codimension sequences of the respective relatively free algebras.Then we consider the *-polynomial identities for the algebra UT₃(F) over a field of characteristic zero. We describe a finite generating set of the ideal of *-identities for this algebra. These generators are quite a few, and their degrees are relatively large. It seems to us that the problem of describing the *-identities for the algebra UT_n(F) of the n×n upper triangular matrices may be much more complicated than in the case of ordinary polynomial identities.     

Integral-Type Darboux Transformations for the mKdV Hierarchy with Self-Consistent Sources

We present integral-type Darboux transformation for the mKdV hierarchy and for the mKdV hierarchy withself-consistent sources. In contrast with the normal Darboux transformation, the integral-type Darboux transformationscan offer non-auto-Backlund transformation between two (2n 1)-th mKdV equations with self-consistent sources withdifferent degrees. This kind of Darboux transformation enables us to construct the N-soliton solution for the mKdVhierarchy with self-consistent sources. We also propose the formulas for the m times repeated integral-type Darbouxtransformations for both mKdV hierarchy and mKdV hierarchy with self-consistent sources.     

Codes with a Certain Weight-preserving Transitive Group of Automorphisms

We determine all linear codes C containing the constant code E, for which there is a weight-preserving group of semilinear automorphisms which acts transitively on the set of nontrivial cosets of E in C. Michael Giudici - The author holds an Australian Postdoctoral Fellowship.     

Enumeration of inequivalent irreducible Goppa codes

We consider irreducible Goppa codes over F_q of length qⁿ defined by polynomials of degree r, where q is a prime power and n,r are arbitrary positive integers. We obtain an upper bound on the number of such codes.     

The largest strongly consecutive repeat-free code

Answering a question of Körner and Simonyi, this paper gives a strongly consecutive repeat-free code of maximal size in [b]ⁿ.     

高非线性度向量弹性函数

利用已知弹性函数级联上高非线性度多输出布尔函数的方法构造（n,m,t）弹性函数,其非线性度为2^n-1-2^n-l/2-1＋2^l/2.nlmax（n-l,m,t）,在相同条件下改进了Kurosawa的非线性度2^n-1-2^n-l/2-1.特别地,本文构造了两类具体的向量弹性函数,得到两个不同的非线性度.本文所得函数的非线性度在大多数情况下是比较好的.