Generation of Polyclonal Antibodies Against Recombinant Human Glucocerebrosidase Produced in Escherichia coli

Deficiency of the lysosomal glucocerebrosidase (GCR) enzyme results in Gaucher`s disease, the most common inherited storage disorder. Treatment consists of enzyme replacement therapy by the administration of recombinant GCR produced in Chinese hamster ovary cells. The production of anti-GCR antibodies has already been described with placenta-derived human GCR that requires successive chromatographic procedures. Here, we report a practical and efficient method to obtain anti-GCR polyclonal antibodies against recombinant GCR produced in Escherichia coli and further purified by a single step through nickel affinity chromatography. The purified GCR was used to immunize BALB/c mice and the induction of anti-GCR antibodies was evaluated by enzyme-linked immunosorbent assay. The specificity of the antiserum was also evaluated by western blot analysis against recombinant GCR produced by COS-7 cells or against endogenous GCR of human cell lines. GCR was strongly recognized by the produced antibodies, either as cell-associated or as secreted forms. The detected molecular masses of 59-66 kDa are in accordance to the expected size for glycosylated GCR. The GCR produced in E. coli would facilitate the production of polyclonal (shown here) and monoclonal antibodies and their use in the characterization of new biosimilar recombinant GCRs coming in the near future.

Generation of eigenstates using the phase-estimation algorithm

The phase estimation algorithm is so named because it allows an estimation of the eigenvalues associated with an operator. However, it has been proposed that the algorithm can also be used to generate eigenstates. Here we extend this proposal for small quantum systems, identifying the conditions under which the phase-estimation algorithm can successfully generate eigenstates. We then propose an implementation scheme based on an ion trap quantum computer. This scheme allows us to illustrate two simple examples, one in which the algorithm effectively generates eigenstates, and one in which it does not.

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.

Predictions of quantum mechanics and stochastic electrodynamics in travelling wave second harmonic generation

We show that stochastic electrodynamics and quantum mechanics give quantitatively different predictions for the quantum nondemolition (QND) correlations in travelling wave second harmonic generation. Using phase space methods and stochastic integration, we calculate correlations in both the positive-P and truncated Wigner representations, the latter being equivalent to the semi-classical theory of stochastic electrodynamics. We show that the semiclassical results are different in the regions where the system performs best in relation to the QND criteria, and that they significantly overestimate the performance in these regions. (C) 2001 Published by Elsevier Science B.V.

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.