Abstract: Helicobacter based preparations comprising a pharmacologically active molecule of interest are disclosed, as well as methods of preparing and using said preparations. In particular, Helicobacter pylori vectors, vector plasmids and recombinant cells that include a sequence encoding a pharmacologically active molecule of interest useful in therapeutic treatments and/or vaccination against disease are provided. Delivery of the pharamacologically active molecules is provided at the mucosal surface, such as the gastric mucosa or nasal membranes, to provide effective and continuous delivery of a pharmacologically active agent.

Abstract: A railway rail fastening clip, for fastening a railway rail to an underlying rail foundation, is formed of an elongate plate shaped such that a central region of the plate has in profile the form of a letter C, a first end region of the plate extending from one side of the central portion of the plate to form a base portion of the clip for engaging a rail fastening anchoring device secured to the rail foundation and a second end region of the plate extending from the opposite side of the central region of the plate to form a toe portion of the clip for bearing on the railway rail. The toe portion of the clip is provided with an insulator retainer for retaining thereon a toe insulator for electrically insulating the clip from the rail.

Abstract: Error correcting codes of any distance (including codes of distance greater than four) use only exclusive OR (XOR) operations. Any code over a finite field of characteristic two are converted into a code whose encoding and correcting algorithms involve only XORs of words (and loading and storing of the data). Thus, the implementation of the encoding and correcting algorithms is more efficient, since it uses only XORs of words—an operation which is available on almost all microprocessors. An important code, the (3, 3) code of distance four, is also described.

Abstract: An efficient method for finding all the possible corrections of a bust of length b and e random errors consists of finding a polynomial whose roots are the candidate location for l— the location of the beginning of the burst—thus avoiding the search over all possible values of l (it is assumed that the burst is non-trivial, i.e., at least one of its errors has a non-zero value). In order to reduce the number of spurious solutions, it is assumed that the number of syndromes is t=2e+b+s, where s is at least 2. The larger the value of s the less likely it is that the algorithm will generate “spurious” solutions. Once the location of the burst is known, standard procedures are used to determine the magnitudes of the burst errors and the location and magnitude of the random errors.

Abstract: An error correction algebraic decoder uses a key equation solver for calculating the roots of finite field polynomial equations of degree up to six, and lends itself to efficient hardware implementation and low latency direction calculation. The decoder generally uses a two-step process. The first step is the conversion of quintic equations into sextic equations, and the second step is the adoption of an invertible Tschirnhausen transformation to reduce the sextic equations by eliminating the degree 5 term. The application of the Tschirnhausen transformation considerably decreases the complexity of the operations required in the transformation of the polynomial equation into a matrix. The second step defines a specific Gaussian elimination that separates the problem of solving quintic and sextic polynomial equations into a simpler problem of finding roots of a quadratic equation and a quartic equation.

Abstract: A railway rail fastening clip (3), for fastening a railway rail (1) to an underlying rail foundation (2), is formed of an elongate plate shaped such that a central region (31) of the plate has in profile the form of a letter C, a first end region of the plate extending from one side of the central portion (31) of the plate to form a base portion (32) of the clip (3) for engaging a rail fastening anchoring device (4) secured to the rail foundation (2) and a second end region of the plate extending from the opposite side of the central region (31) of the plate to form a toe portion (33) of the clip (3) for bearing on the railway rail (1). The toe portion (33) of the clip (3) is provided with insulator retaining means (34) for retaining thereon a toe insulator (5) for electrically insulating the clip (3) from the rail (1).

Abstract: An error correction algebraic decoder and an associated method correct a combination of a B-byte burst of errors and t-byte random errors in a failed sector, by iteratively adding and removing an erasure (N−B) times until the entire failed sector has been scanned, provided the following inequality is satisfied: (B+2t)≦(R−1), where N denotes the number of bytes, B denotes the length of the burst of errors, t denotes the total number of random errors, and R denotes the number of check bytes in the failed sector. This results in a corrected sector at a decoding latency that is a generally linear function of the number of the check bytes R, as follows: Decoding Latency=5R(N−B).

Abstract: A Hilbert transform is used to process perpendicular magnetic recording signals from both single layer and dual layer disks to produce a complex analytic signal. This complex analytic signal is used to derive angles of magnetization, which depend on the distance between recorded magnetic transitions and consequently which can be used in error estimation. Moreover, the Hilbert transform in cooperation with an equalizer FIR optimizes transformation of the signal such that conventional longitudinal recording processing methods can subsequently be used to process the signal that is read back from the magnetic recording medium.

Abstract: An on-the-fly algebraic error correction system and corresponding method for reducing error location search are presented. The method transforms an error locator polynomial into two transformed polynomials whose roots are elements in a smaller subfield, in order to significantly simplify the complexity, and to reduce the latency of the error correcting system hardware implementation. More specifically, if the error locator polynomial is over a finite field of (22n) elements, the transformed polynomial is over a finite subfield of (2n) elements. Thus, the problem of locating the roots of the error locator polynomial is reduced to locating the roots of the transformed polynomials. Assuming the error locator polynomial is of degree m, the present method requires at most (m2/2) evaluations of polynomials over the Galois field GF(22n) and (2n+1) evaluations over the subfield GF(2n) or root finding of two polynomials of at most a degree m over the subfield GF(2n).

Abstract: A system and method for algebraically correcting errors in complex digitized phase signals from a magneto-resistive or giant magneto-resistive (MR/GMR) head readback waveform includes a data state machine that encodes phase symbols into data bits in accordance with, e.g., the (1, 10) constraint and a parity state machine that generates parity symbols such that a single inserted parity symbol does not violate the (1, 7) constraint in a run length limited code and furthermore the data following the insertion will not violate the (1, 10) constraint in a run length limited code. The state machines can be used as a trellis to perform maximum likelihood decoding on received coded data, thus performing soft algebraic error detection on received data. The invention thus guarantees better overall error rate performance than hard decision post processing of blocks of detected bits by a parity check matrix which is otherwise vulnerable to loss of bit synchronization at high linear density recording.

Abstract: A soft error correction algebraic decoder and an associated method use erasure reliability numbers to derive error locations and values. More specifically, symbol reliability numbers from a maximum likelihood (ML) decoder as well as a parity check success/failure from inner modulation code symbols are combined by a Reed-Solomon decoder in an iterative manner, such that the ratio of erasures to errors is maximized. The soft error correction (ECC) algebraic decoder and associated method decode Reed Solomon codes using a binary code and detector side information. The Reed Solomon codes are optimally suited for use on erasure channels. A threshold adjustment algorithm qualifies candidate erasures based on a detector error filter output as well as modulation code constraint success/failure information, in particular parity check or failure as current modulation codes in disk drive applications use parity checks. This algorithm creates fixed erasure inputs to the Reed Solomon decoder.

Abstract: A computer system housing with a curved bezel that forms one or more sideways gap between a side of the computer housing chassis and the bezel attached to that side. Typically, the curved bezel is attached to the front of the chassis with each sideways gap extending perpendicularly from the front of the chassis to a predetermined width and stretching to predetermined length along the front of the chassis. The sideways gaps facilitate increased air inlet from the sides and allow efficient cooling of various system components that are mounted on the chassis and housed within the housing. One or more cooling fans may be mounted at different locations within the housing to optimize air circulation and, hence, cooling within the housing. The chassis may be partitioned into two separate sub-chassis for proper positioning of the cooling fans as well as to accommodate changes in computer system configurations with minimized retooling of the chassis.

Abstract: A circuit combines a read signal from an MR/GMR read head with a signal generated by a matched filter, the parameters of which depend on the geometry of the head and the output of which, generated every Nth clock period, includes a real part and an imaginary part that models an expected head response. The combined signal is phase equalized and sent to a complex correlator, which integrates the signal over N clock periods to output a correlated signal having real and imaginary portions of the Nth root of unity which correspond to bits in an N-clock data unit. The real and imaginary portions can subsequently be digitized and analyzed for errors.

Abstract: An error correction algebraic decoder uses a key equation solver for calculating the roots of finite field polynomial equations of degree up to six, and lends itself to efficient hardware implementation and low latency direction calculation. The decoder generally uses a two-step process. The first step is the conversion of quintic equations into sextic equations, and the second step is the adoption of an invertible Tschirnhausen transformation to reduce the sextic equations by eliminating the degree 5 term. The application of the Tschirnhausen transformation considerably decreases the complexity of the operations required in the transformation of the polynomial equation into a matrix. The second step defines a specific Gaussian elimination that separates the problem of solving quintic and sextic polynomial equations into a simpler problem of finding roots of a quadratic equation and a quartic equation.

Abstract: A method for the in vivo detection of urease-producing helicobacter in the upper stomach is disclosed. The dense carrier is divided into two separate groups which are combined with separate reagent indicators, one of which also contains urea. The carriers are food soluble products, preferably sugar beads having a diameter of approximately 0.2 to 3.0 mm. The treated carriers and urea are encapsulated in a soluble capsule which is administered to a patient. The density of the carriers cause the capsule to migrate to the gastric mucosa, where the capsule, but not the reagents, is dissolved, placing the reagents and urea in direct contact with the gastric mucosa. The urea reacts with any urease present in the stomach by creating ammonia, which increases the pH in the immediate vicinity of the urea containing carrier and indicator beads. The two reagents react differently, through color change, to the increase in pH, which is viewed through use of an endoscope.

Abstract: A Hilbert transform is used to process perpendicular magnetic recording signals from both single layer and dual layer disks to produce a complex analytic signal. This complex analytic signal is used to derive angles of magnetization, which depend on the distance between recorded magnetic transitions and consequently which can be used in error estimation. Moreover, the Hilbert transform in cooperation with an equalizer FIR optimizes transformation of the signal such that conventional longitudinal recording processing methods can subsequently be used to process the signal that is read back from the magnetic recording medium.

Abstract: A computer system housing with a curved bezel that forms one or more sideways gap between a side of the computer housing chassis and the bezel attached to that side. Typically, the curved bezel is attached to the front of the chassis with each sideways gap extending perpendicularly from the front of the chassis to a predetermined width and stretching to predetermined length along the front of the chassis. The sideways gaps facilitate increased air inlet from the sides and allow efficient cooling of various system components that are mounted on the chassis and housed within the housing. One or more cooling fans may be mounted at different locations within the housing to optimize air circulation and, hence, cooling within the housing. The chassis may be partitioned into two separate sub-chassis for proper positioning of the cooling fans as well as to accommodate changes in computer system configurations with minimized retooling of the chassis.

Abstract: A computer system housing with a curved bezel that forms one or more sideways gap between a side of the computer housing chassis and the bezel attached to that side. Typically, the curved bezel is attached to the front of the chassis with each sideways gap extending perpendicularly from the front of the chassis to a predetermined width and stretching to predetermined length along the front of the chassis. The sideways gaps facilitate increased air inlet from the sides and allow efficient cooling of various system components that are mounted on the chassis and housed within the housing. One or more cooling fans may be mounted at different locations within the housing to optimize air circulation and, hence, cooling within the housing. The chassis may be partitioned into two separate sub-chassis for proper positioning of the cooling fans as well as to accommodate changes in computer system configurations with minimized retooling of the chassis.

Abstract: A computationally efficient, machine-implementable method and means for detecting and correcting errors in received codewords on-the-fly within the capacity of a linear cyclic code using ultra-fast error location processing. Each error locator polynomial of degree t over a finite Galois field derived from a codeword syndrome is mapped into a matrix representative of a system of linear simultaneous equations related to the polynomial coefficients. Roots indicative of error locations within the codeword are extracted from the matrix by a modified Gaussian Elimination process for all the roots where t≦5 and at least one root plus a subset of candidate roots from the finite field for iterative substitution where t>5. Corrected values are separately determined and correction is secured by logically combining the corrected values with the codeword values in error at the error locations represented by the roots.