Identification of optically clear regions of ternary polymer blends using a novel rapid screening method

The application of a rapid screening method for the construction of ternary phase diagrams is described for the first time, providing detailed visualization of phase boundaries in solvent-mediated blends. Our new approach rapidly identifies ternary blend compositions that afford optically clear materials, useful for applications where transparent films are necessary. The use of 96-well plates and a scanning plate reader has enabled rapid optical characterization to be carried out by transmission spectrophotometry (450 nm), whilst the nature and extent of crystallinity was examined subsequently by wide angle X-ray scattering (WAXS). The moderating effect of cellulose acetate butyrate can be visualized as driving the position of the phase boundaries in poly(l-lactic acid)/polycaprolactone (PLLA/PCL) blends. More surprisingly, the boundaries are critically dependent on the molecular weight of the crystallizable PLLA and PCL, with higher molecular weight polymers leading to blends with reduced phase separation. On the other hand, the propensity to crystallize was more evident in shorter chains. WAXS provides a convenient way of characterizing the contribution of the individual blend components to the crystalline regions across the range of blend compositions. © 2013 Society of Chemical Industry.

Using genetic programming and decision trees for generating structural descriptions of four bar mechanisms

Four bar mechanisms are basic components of many important mechanical devices. The kinematic synthesis of four bar mechanisms is a difficult design problem. A novel method that combines the genetic programming and decision tree learning methods is presented. We give a structural description for the class of mechanisms that produce desired coupler curves. Constructive induction is used to find and characterize feasible regions of the design space. Decision trees constitute the learning engine, and the new features are created by genetic programming.

On the Error-Correcting Performance of some Binary and Ternary Linear Codes

In this work, we determine the coset weight spectra of all binary cyclic codes of lengths up to 33, ternary cyclic and negacyclic codes of lengths up to 20 and of some binary linear codes of lengths up to 33 which are distance-optimal, by using some of the algebraic properties of the codes and a computer assisted search. Having these weight spectra the monotony of the function of the undetected error probability after t-error correction P(t)ue (C,p) could be checked with any precision for a linear time. We have used a programm written in Maple to check the monotony of P(t)ue (C,p) for the investigated codes for a finite set of points of p € [0, p/(q-1)] and in this way to determine which of them are not proper.

Necessary and Sufficient Conditions for the Extendability of Ternary Linear Codes

We give the necessary and sufficient conditions for the extendability of ternary linear codes of dimension k ≥ 5 with minimum distance d ≡ 1 or 2 (mod 3) from a geometrical point of view.

New Bounds for the Maximum Size of Ternary Constant Weight Codes

This work was partially supported by the Bulgarian National Science Fund under Grant I–618/96.