Code-switching in Bangladesh

A survey of hybridization in proper names and commercial signs. CODE-SWITCHING is commonly seen as more typical of the spoken language. But there are some areas of language use, including business names (e.g. restaurants), where foreign proper names, common nouns and sometimes whole phrases are imported into the written language too. These constitute a more stable variety of code-switching than the spontaneous and more unpredictable code-switching in the spoken language.

Determining when the absolute state complexity of a Hermitian code achieves its DLP bound

Let g be the genus of the Hermitian function field H/F(q)2 and let C-L(D,mQ(infinity)) be a typical Hermitian code of length n. In [Des. Codes Cryptogr., to appear], we determined the dimension/length profile (DLP) lower bound on the state complexity of C-L(D,mQ(infinity)). Here we determine when this lower bound is tight and when it is not. For m less than or equal to n-2/2 or m greater than or equal to n-2/2 + 2g, the DLP lower bounds reach Wolf's upper bound on state complexity and thus are trivially tight. We begin by showing that for about half of the remaining values of m the DLP bounds cannot be tight. In these cases, we give a lower bound on the absolute state complexity of C-L(D,mQ(infinity)), which improves the DLP lower bound. Next we give a good coordinate order for C-L(D,mQ(infinity)). With this good order, the state complexity of C-L(D,mQ(infinity)) achieves its DLP bound (whenever this is possible). This coordinate order also provides an upper bound on the absolute state complexity of C-L(D,mQ(infinity)) (for those values of m for which the DLP bounds cannot be tight). Our bounds on absolute state complexity do not meet for some of these values of m, and this leaves open the question whether our coordinate order is best possible in these cases. A straightforward application of these results is that if C-L(D,mQ(infinity)) is self-dual, then its state complexity (with respect to the lexicographic coordinate order) achieves its DLP bound of n /2 - q(2)/4, and, in particular, so does its absolute state complexity.

The work of fracture in uniaxial and biaxial oriented unplasticised polyvinylchloride pipes

In oriented unplasticised polyvinylchloride (uPVC) pipes, cracks propagate tangentially rather than through the wall as in conventional pipe. Notched impact, a modified peel test and the specific work of fracture approach have been used to measure fracture toughness of a conventionally extruded, a uniaxially oriented and a biaxially oriented uPVC pipe in different directions. The different failure mode for the oriented pipes was found to result from an order of magnitude increase in the fracture toughness for cracks propagating perpendicular to the orientation direction. Differences in the fracture toughness between the oriented pipes were also related to their molecular orientation. (C) 2002 Elsevier Science Ltd. All rights reserved.

Polarised infrared and differential scanning calorimetry studies on oriented vinyl pipe materials

The molecular orientation in a conventionally extruded PVC pipe, a uniaxially oriented PVC pipe and a biaxially oriented PVC pipe has been studied via Infrared dichroism. The degree of order or crystallinity has also been studied by Differential Scanning Calorimetry and also via Infrared Spectroscopy. The fundamental structural difference between the conventional and oriented pipes was that polymer chains were preferentially aligning in the hoop direction for oriented pipes whereas they were fairly isotropic in the conventional pipe with a slight preferential alignment in the axial direction. Analysis of the C-Cl stretching mode indicated that the uniaxially oriented pipe had much higher alignment of the C-Cl bond in the axial direction than the biaxial pipe, which correlates with higher fracture toughness for circumferential cracking in the biaxial pipe. Both DSC and Infrared spectroscopy detected little change in the crystallinity or order in the oriented pipes compared to the conventionally extruded pipes. (C) 2002 Kluwer Academic Publishers.

Strongly regular graphs from differences of quadrics

In this note strongly regular graphs with new parameters are constructed using nested "blown up" quadrics in projective spaces. (C) 2002 Elsevier Science B.V. All rights reserved.

A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

Libraries of cyclic peptides are being synthesized using combinatorial chemistry for high throughput screening in the drug discovery process. This paper describes the min_syn_steps.cpp program (available at http://www.imb.uq.edu.au/groups/smythe/tran), which after inputting a list of cyclic peptides to be synthesized, removes cyclic redundant sequences and calculates synthetic strategies which minimize the synthetic steps as well as the reagent requirements. The synthetic steps and reagent requirements could be minimized by finding common subsets within the sequences for block synthesis. Since a brute-force approach to search for optimum synthetic strategies is impractically large, a subset-orientated approach is utilized here to limit the size of the search. (C) 2002 Elsevier Science Ltd. All rights reserved.