There is disclosed the light-sensitive element having a high sensitivity and capable of forming a transferred image with a small fluctuation in a sensitivity and a gradation. The light-sensitive element which is processed by a silver salt diffusion transfer method comprising developing a light-sensitive element having a light-sensitive silver halide emulsion layer subjected to an imagewise exposure with an alkaline processing element containing a silver halide solvent to convert at least a part of unexposed silver halide contained in the emulsion layer to a transferable silver complex salt, and transferring at least a part of the complex salt on an image-receiving element to form the image on the image-receiving element contains the silver halide grains which are of silver bromoiodide or silver bromochloroiodide having the following constitutions (a), (b), (c) and (d), in the light-sensitive silver halide emulsion layer:. (a) the grain consists of a core (a nucleus) and plural layers of a shell; PA0 (b) an addition amount of iodide in forming the core is 0 to 1 mole %; an addition amount of iodide in forming the first layer shell is 60 to 100 mole %; and the total addition amount of iodide in forming the sell on and after the second layer is 0 to 2 mole %; PA0 (c) an average silver iodide content of the whole grain including the core and shell is 0.5 to 4.5 mole %; and PA0 (d) silver bromoiodide having a silver iodide content of 2 to 8 mole % is deposited on the grain surface after chemical sensitization in an amount corresponding to 1 to 10% by weight (in terms of silver amount) of the silver halide grains formed before chemical sensitization.

At present, the silver salt diffusion transfer method is well known in the art and, as a result, a description thereof will be brief. The details thereof are described in A. Rott and E. Weyde, "Photographic Silver Halide Diffusion Processes", Focal Press Co. (1972); J. Sturge, V. Walworth and A. Shepp, "Imaging Processes and Materials: Neblette's Eighth Edition", Chapter 6, Instant Photography and Related Reprographic Processes, published by Van Nostrand Reinhold Co. (1989); and G. Haist, "Modern Photographic Processing Vol. 2", Chapter 8, Diffusion Transfer, John Wiley and Sons Co. Many kinds of photographic materials can be prepared by this diffusion transfer method, which are described in detail in the above publications. It is known, for example, that a light-sensitive element comprising a silver halide emulsion coated on a support and an image-receiving element containing silver precipitate nuclei are superposed and a processing element consisting of a high viscosity alkaline processing composition containing a developing agent and a silver halide solvent is spread between the above two elements, whereby a transferred image can be obtained.
In the above constitution, after the light-sensitive element is exposed, it is superposed on the image-receiving element and the processing element is spread therebetween and they are separated after a fixed time, whereby a transferred image can be obtained on the image-receiving element. It is always desired to complete the formation of this transferred image in less time.
Methods for accelerating the completion of the transferred image include a method in which a high reductive compound such as a hydroquinone is used as a developing agent and a solvent having a fast dissolving speed such as hypo is used as a silver halide solvent, and a method in which silver chloride and silver brmochloride each with a high solubility are used for a silver halide emulsion present in the light-sensitive element. In the former method, however, the transferred image is very instable and the image can not be stored for a long period of time because of the generation of stain by the oxidation product of a developing agent and the sulfurization by residual hypo present.
In order to prevent this, an anti-oxidation layer such as polyvinyl alcohol containing an alkaly neutralizing agent needs to be coated on the surface of the image immediately after completing the image, which complicates handling. The latter method has the disadvantage that it can not be used as a photograph because of low sensitivity and because the density of the transferred image is reduced since fog is tends to be formed.
Meanwhile, it is strongly desired for the fluctuation in the photographic properties to be small under various use conditions and particularly it is desired that the fluctuation due to temperature of use is small.
In the above two methods, temperature of use dependency tends to deteriorate.

Light-sensitive element for silver salt diffusion transfer method


A herbicidal composition is provided which is substantially non-irritant to the eyes and which comprises a stable aqueous concentrate solution of one or more agriculturally acceptable salts-of N-phosphonomethylglycine and a surfactant represented by the formula ##STR1## wherein R is an alkyl group having from about 6 to about 14 carbon atoms, R.sup.1 is ethyl, propyl, or a mixture of ethyl and propyl, the sum of n and m is between about 5 and about 50, R.sup.2 is an alkyl group with 1-4 carbon atoms, X is an agriculturally acceptable anion, and the weight ratio of surfactant to N-phosphonomethylglycine (expressed as the acid equivalent) is between about 1:5 and about 5:1.

This invention relates to herbicidal compositions, and more particularly relates to herbicidal compositions containing one or more N-phosphonomethylglycine salts and a surfactant.
N-Phosphonomethylglycine, known in the agricultural chemical art as glyphosate, is a highly effective and commercially important phytotoxicant useful in controlling the growth of germinating seeds, emerging seedlings, maturing and established woody and herbaceous vegetation, and aquatic plants. N-phosphonomethylglycine and its salts are conveniently applied in an aqueous solution as a post-emergent phytotoxicant for the control of numerous plant species. N-Phosphonomethylglycine and its salts are characterized by a broad spectrum activity, i.e., they control growth of a wide variety of plants.
Commercial formulations of N-phosphonomethylglycine are usually aqueous solutions wherein the N-phosphonomethylglycine is present as a herbicidally acceptable salt, such as an alkali metal salt, the ammonium, alkylsulfonium, or alkylphosphonium salt or the salt of an amine having a molecular weight of less than about 300. The monoisopropylamine salt of N-phosphonomethylglycine is the most widely used salt in such aqueous compositions. In addition, such compositions usually contain a surfactant to enhance the effectiveness of the N-phosphonomethylglycine when it is applied to the foliage of various plants. The most widely used surfactant in commercial compositions is an ethoxylated fatty amine.
It is known to those skilled in the art that a particular surfactant used in an aqueous composition 5 with a herbicide can enhance the effectiveness of the herbicide, whereas other surfactants have very little, if any beneficial effect, and in fact, some may be antagonistic. Wyrill and Burnside, Weed Science, Vol. 25 (1977), p 275-287, examined dilute N-phosphonomethylglycine salt solutions containing different classes of surfactants, including polyoxyethylene octadecyl methyl ammonium chlorides containing on average 2 and 15 oxyethylene units (ETHOQUAD 18/12 and ETHOQUAD 18/25, respectively). They did not examine or suggest the use of shorter-chain alkyl methyl ammonium chlorides. Some classes of surfactant were more effective than others in enhancing the herbicidal effect of N-phosphonomethylglycine (used as a solution of the isopropylamine salt), and Wyrill and Burnside concluded that an effective surfactant is a critical component of any aqueous composition containing N-phosphonomethylglycine. For example, ETHOQUAD 18/12 was relatively ineffective in enhancing phytotoxicity of N-phosphonomethylglycine to hemp dogbane, whereas in a separate experiment ETHOQUAD 18/25 was one of the most effective surfactants tested. In the latter experiment, the surfactant was used at a concentration of 1% of the spray solution, a very high concentration by comparison with that delivered by commercial agricultural formulations of N-phosphonomethylglycine at typical application rates in typical spray volumes. The ratio of ETHOQUAD 18/25 to N-phosphonomethylglycine (expressed as acid equivalent) was 6.7:1 at the higher N-phosphonomethylglycine rate applied, and 26.7:1 at the lower rate applied. This compares with surfactant/ N-phosphonomethylglycine ratios typically in the range from 1:4 to 4:1, most commonly around 1:2, delivered by commercial agricultural formulations.
Although certain surfactants may enhance the biological activity of N-phosphonomethylglycine when used at relatively high concentrations in dilute N-phosphonomethylglycine salt solutions (e.g., a tank mix), many of such surfactants are ineffective at low surfactant/N-phosphonomethylglycine ratios. However, it is impossible to incorporate surfactants into highly concentrated aqueous compositions of N-phosphonomethylglycine except at such low ratios. Even then, many surfactants are difficult to coformulate with concentrated aqueous solutions of N-phosphonomethylglycine salts because of adverse effects on viscosity, clarity, high and low temperature stability and other physical characteristics that are desired by the end user. In addition, while N-phosphonomethylglycine and its salts are known to be of very low toxicity and environmentally acceptable, many surfactants are relatively toxic to aquatic life, and/or cause irritation when in contact with the eye.
U.S. Pat. No. 4,075,002 to Drewe et al. and U.S. Pat. No. 4,525,200 to Kimpara et al. each disclose polyoxyethylene alkyl methyl ammonium chlorides in combination with other surfactants in aqueous herbicidal compositions. However, neither of these references disclose the use of polyoxyethylene alkyl methyl ammonium chlorides in a herbicidal composition containing a herbicidally acceptable salt of N-phosphonomethylglycine, nor do they disclose that such herbicidal compositions have reduced eye irritation.
Accordingly, it would be desirable to obtain a stable, concentrated aqueous formulation of N-phosphonomethylglycine which contains a surfactant that at a low ratio of surfactant to N-phosphonomethylglycine is highly effective in enhancing the biological effect of N-phosphonomethylglycine but has lower eye irritation and aquatic toxicity than other surfactants. It has now been found that certain quaternary ammonium compounds are effective at low ratios of surfactant to N-phosphonomethylglycine in enhancing the herbicidal activity of N-phosphonomethylglycine, and that concentrated aqueous formulations of N-phosphonomethylglycine containing such quaternary ammonium compounds are clear, stable, of very low toxicity to aquatic life and virtually non-irritating to the eye.

Herbicidal compositions comprising glyphosate salts and alkoxylated quaternary amine surfactants


An injectate delivery device for expanding tissue is provided. The injectate delivery device comprises: at least one fluid delivery tube comprising a proximal end, a distal end and a lumen therebetween; at least one fluid delivery element in fluid communication with the at least one fluid delivery tube lumen; a radially expanding element comprising the at least one fluid delivery element; a supply of vacuum constructed and arranged to cause tissue to tend toward the at least one fluid delivery element; and at least one control constructed and arranged to perform a function. The at least one control can be constructed and arranged to expand the radially expandable element and activate the supply of vacuum. Systems and method of injectate delivery are also provided.

The field of gastrointestinal endoscopy has for many years focused on diagnostic and therapeutic techniques to observe, modify and remove tissues located in the digestive tract. For example, prior to a procedure to remove or otherwise modify tissue, a method referred to in the art as "lift and cut" involves the injection of saline or other biocompatible solution beneath the submucosa in an attempt to elevate and/or expand the submucosa, thereby changing the geometry to make it suitable for treatment, for example resection of tissue. In some cases, an injection catheter is used to deliver the fluid within the submucosal layer, which does not readily dissipate, throughout the target area, and once the target resection area has been elevated and/or expanded, the tissue can be treated.
However, the current devices, systems and methods for expanding submucosal and other tissue layers are cumbersome, inaccurate, and have a limited effected tissue area. Therefore, there is a need for improved devices, systems and methods for expanding submucosal and other tissue layers that provide simplified use, larger expansion areas, and reduced procedure time.

Injectate delivery devices, systems and methods


A tubular introduced into a wellbore is perforated at pre-selected locations after the tubular has been cemented into place. The locations of the perforations are determined by modeling inflow performance of a stimulation fluid within the formation. The inflow performance parameters include reservoir porosity, permeability, pressure, damage skin and intrusion depth, perforation diameter and penetration depth or perforation crushed zone damage and intrusion depth.

1. Technical Field
The invention relates to a method of stimulating a drilled and cemented well for use in the production of hydrocarbons from a formation, when acid or an aggressive liquid is introduced through a perforated tubular for dissolving material.
2. Related Art
In related art, a cemented tubular, such as a casing or liner, may be perforated with an even density (number of perforations per unit length), and an improvement in stimulation fluid distribution may be attempted by changing the fluid characteristics, the injection rate or injection of dissolvable materials that temporarily seals off some of the perforations.
Pre-perforated liners may have an even distribution of perforations (number of perforations per unit length), but the use of such liners may suffer from the same disadvantages.
These methods for diverting stimulation fluids are normally not able to provide an even fluid distribution over longer intervals than about 250 meters.
EP 1 184 537 describes a method of stimulating a drilled well. The stimulation fluid is discharged into the annular space surrounding a well tubing through openings configured in the wall of the tubing in the longitudinal expanse of the tubing. The placement of the holes diverts the stimulation fluid along the entire length of the well tubing. The fluid influences the material on the surface of the wellbore.
The method described in EP 1 184 537 is not applicable to tubings or tubulars which are cemented into place. Furthermore, a provision for this method is the presence of a common and open annular volume between the tubular and the wellbore.


In an adaptive equalizing apparatus for MIMO (Multi-Input Multi-Output) turbo reception, an interference component in a received signal is subtracted therefrom using a replica of an interference component in an interference canceling part 31n, the subtracted output is filtered by a filter 32n, to cancel the remaining interference component and to perform multi-path combining, and in a degree-of-interference-cancellation estimation part 41n the degree of interference cancellation β(i) is set such that it is 0 for the iteration number i=1, 0.8+0.05 (i−1) for 5≧i≧2 and 1 for i≧6, and at the beginning of each iteration filter coefficients are calculated using β(i) and a channel estimation value in a filter coefficient calculating part 33n and the filter coefficient thus calculated are set in the filter 32n. An average value of soft decision symbol estimation values used in the interference canceling part may be used as β.

1. Technical Field
The present invention relates to an adaptive equalizing apparatus for use in a turbo receiver or the like which iterates equalization and decoding and, more particularly, to an adaptive equalizing apparatus which cancels interference by use of a priori information and then further suppresses interference and combines multipath components by filtering. The invention also pertains to a program for implementation of such an adaptive equalizing apparatus.
2. Prior Art
The problem to be tackled in the mobile communication business is how to accommodate a great many users (mobile stations) on a limited number of frequencies with high quality. A solution to this problem is a MIMO (Multiple-Input Multiple-Output) system such as shown in FIG. 1. In this system, letting j represent a bit index, symbols generated from information bits b1(j) to bN(j) are sent from a plurality of transmitters S1 to SN at the same point in time and at the same frequency, and these transmitted signals are received by a MIMO receiver 30 equipped with antennas #1 to #M. The MIMO receiver 30 processes the received signals to estimate the information bits b1(j) to bN(j) forming the symbols sent from the transmitters S1 to SN, and outputs the estimated information bits as b1′(j) to bN′(j) to output terminals Out1 to OutN, respectively.
A concrete configuration scheme of the MIMO receiver in the MIMO system is still under study. In the case of using the MLS (Maximum Likelihood Sequence Estimation) criterion for the configuration of the MIMO receiver configuration in the MIMO system, letting N represent the number of transmitters, P the number of constellation points and Q the number of multi-paths over which the transmit signal from each transmitter reaches each antenna of the MIMO receiver, the computational complexity of the MIMO receiver becomes enormous with an increase in the number N of transmitters and in the number Q of multi-paths since the computational complexity increases in proportion to P(Q−1)N. Further, in the case of receiving information sent as plural parallel signals from a single user, separation of each parallel signal calls for larger amounts of computations with an increase in the number of multi-paths. From this point of view, the present invention is of great utility especially when applied to a turbo receiver for multiple stream signals, but the invention is also effective in a turbo receiver for a single user (one transmitter), that is, for a single stream signal, and receivers of other systems. A description will be given first of a conventional single-user turbo receiver.
Single-User Turbo Receiver
FIG. 2 shows, by way of example, the configurations of a transmitter and a receiver in this case. In a transmitter 10 an input information bit stream b(j) is subjected to error correction encoding by a channel encoder 11 to generate a coded bit stream c(j). The stream c(j) is interleaved by an interleaver 12 into a stream c(k), which is used to modulate a carrier signal in a symbol mapping part 13 into a transmit symbol stream s(k). And the transmit symbol stream s(k) is added by multiplexing means 15 with a training symbol str(k) from a training symbol stream generator 14, thereafter being transmitted. In general, the transmit symbol stream s(k) is transmitted after being converted to the radio frequency band.
This transmit signal is sent over a transmission channel (each multi-path channel) to a receiver 20. In the receiver 20 a SISO (Soft-Input-Soft-Output) equalizer 21 equalizes delayed waves. The input signal r(k) received by the receiver 20 is usually converted in a receiving part (not shown) from the high-frequency to the base band, and base band received signal is sampled at a frequency one or more times higher than the symbol frequency of the transmit symbol stream to generate a digital signal, which is input as a digital received signal r(k) to the equalizer 21.
In the case of a single user, that is, when N=1 in FIG. 1, the received output from each receiving antenna #m (where m=1, 2, . . . , M) can be expressed as follows.
            r      m                  (      k      )        =                    ∑                  q          =          0                          Q          -          1                                                        h            m                                          (            q            )                          ·                  s                                (                          k              -              q                        )                                +                  v        m                          (        k        )            where m is an antenna index, k is discrete time, h is a channel value (channel impulse response: channel characteristic), s(k) is a transmit symbol of the user (the transmitter 1), and vm(k) is an internal thermal noise of the receiver 20. And, the following equation is defined with the outputs from all the antennas #1 to #M represented as a vector r(k).
                              r                                (            k            )                          =                                              [                                                            r                  1                                                                  (                  k                  )                                                                                r                  2                                                                  (                  k                  )                                                                                …                                                                                r                  M                                                                  (                  k                  )                                                      ]                    T                                        =                                                            ∑                              q                =                0                                            Q                -                1                                                                                H                                                  (                  q                  )                                            ·                              s                                                  (                                      k                    -                    q                                    )                                                              +                      v                                      (              k              )                                          where:v(k)=[v1(k)v2(k) . . . vM(k)]T H(q)=[h1(q)h2(q) . . . hM(q)]T T indicates a transposed vector (or matrix). Next, the following vector and matrix are defined taking the number Q of multi-paths (channels) into consideration. In the following description, symbols added with m=1, . . . , M and n=1, . . . , N as subscripts, respectively, denote indices to elements of vectors or matrices.
                                          y                                      (              k              )                                ≡                                                        [                                                                    r                    T                                                                          (                                          k                      +                      Q                      -                      1                                        )                                                                                r                    T                                                                          (                                          k                      +                      Q                      -                      2                                        )                                                                                …                                                                                r                    T                                                                          (                    k                    )                                                              ]                        T                                                        ≡                                                        H              ·                              S                                                  (                  k                  )                                                      +                          n                                            (                k                )                                                                    where      :                                H        =          [                                                  H                                            (                0                )                                                          ⋯                                              H                                            (                                  Q                  -                  1                                )                                                                                0                                                                                ⋰                                                                                ⋰                                                                                0                                                                                H                                            (                0                )                                                          ⋯                                              H                                            (                                  Q                  -                  1                                )                                                        ]      S(k)=[s(k+Q−1)s(k+Q−2) . . . s(k−Q+1)]T n(k)=[vT(k+Q−1)vT(k+Q−2) . . . vT(k)]T The following description will be given on the assumption of using the BPSK modulation scheme. In multivalued modulation using many values, too, the prior art and the present invention can easily be extended by appropriate symbol mapping and demapping. The vector r(k) defined above is input to the equalizer 21. The SISO equalizer 21 is a linear equalizer, from which is derived, as its equalized output, LLR (Log-Likelihood Ratio) Λ1 between the probabilities that each coded bit s(k) is +1 and −1.
                                          Λ            1                                          [                          s                                            (                k                )                                      ]                          =                                  log                                              P                                                                                r                                                  [                                                            s                                                                    (                        k                        )                                                              =                                                                  +                        1                                            ❘                                              y                                                                          (                          k                          )                                                                                ]                                                                    P                                                                                r                                                  [                                                            s                                                                    (                        k                        )                                                              =                                                                  -                        1                                            ❘                                              y                                                                          (                          k                          )                                                                                ]                                                                                =                                                            λ              1                                                  [                              s                                                  (                  k                  )                                            ]                                +                                    λ              2              p                                                  [                              s                                                  (                  k                  )                                            ]                                          where λ1[s(k)] is external information that is sent to a subsequent decoder 24 and λ2p[s(k)] is a priori information that is sent to the equalizer 21. The LLR Λ1[s(k)] is fed to a subtractor 22, by which the a priori information λ2p[s(k)] is subtracted, and the subtracted output is provided to a de-interleaver 23, wherein it is subjected to de-interleaving opposite to that by the interleaver 12 to provide ), λ1[s(j)], which is fed to a SISO channel decoder 24. The decoder 24 performs SISO decoding by use of redundancy for the error correction added by the encoder 11 of the transmitter and outputs a decoded bit b′(j) as a temporary or final received signal, and calculates an LLR Λ2 for each bit by the following equation.
                                          Λ            2                                          [                          s                                            (                j                )                                      ]                          =                                  log                                              P                                                                                r                                                                                [                                                      s                                                              (                      j                      )                                                        =                                                            +                      1                                        ❘                                                                  λ                        1                                                                                [                                                                              s                                                                                (                              j                              )                                                                                ,                                                      j                            =                            0                                                    ,                                                                                …                                                                                ,                                                      B                            -                            1                                                                          ]                                                                                P                                                                                r                                                                                [                                                      s                                                              (                      j                      )                                                        =                                                            -                      1                                        ❘                                                                  λ                        1                                                                                [                                                                              s                                                                                (                              j                              )                                                                                ,                                                      j                            =                            0                                                    ,                                                                                …                                                                                ,                                                      B                            -                            1                                                                          ]                                                                                ≡                                                            λ              2                                                  [                              s                                                  (                  j                  )                                            ]                                +                                    λ              1              p                                                  [                              s                                                  (                  j                  )                                            ]                                          The output λ1[s(j)] from the deinterleaver 23 is provided as a priori information λ1p[s(j)] to a subtractor 25, by which the a priori information λ1p[s(j)] is subtracted from Λ2[s(j)]. The resulting λ2[s(j)] is provided as external information λ2p[s(k)] via an interleaver 26 to the equalizer 21 and the subtractor 22 during iteration processing. Depending on reception processing scheme, Λ1[s(k)] and Λ2[s(k)] may be replaced with λ1p[s(k)] and λ2p[s(k)], respectively. In this way, equalization and decoding are carried out iteratively to provide increased error rate.
Next, a detailed description will be given of the calculation of a linear filter that the equalizer 21 applies to a received vector y(k). The equalizer 21 uses the a priori information λ2p[s(k)] to calculate the following soft decision symbol estimated value.s′(k)=tanh[λ2p[s(k)]/2]Further, the equalizer 21 uses the estimated value and a channel matrix H to generate a replica of an interference component, H·S′(k), which is subtracted from the received signal. That is,
                                          Y            ′                                          (            k            )                          ≡                                              y                                      (              k              )                                -                      H            ·                                          S                ′                                                          (                k                )                                                                            =                                              H            ·                          (                                                S                                                        (                    k                    )                                                  -                                                      S                    ′                                                                          (                    k                    )                                                              )                                +                      n                                      (              k              )                                          whereS′(k)=[s′(k+Q−1) . . . s′(k+1)0s′(k−1) . . . s′(k−Q+1)]T Since the replica H·S′(k) of the interference component is not exactly accurate, the interference component cannot completely be canceled by this processing. Then, optimum linear filter coefficients wopt(k) for complete cancellation of the remaining interference component are calculated by the following MMSE (Minimum Mean Square Error) criterion.wopt(k)=arg min∥wH(k)·y′(k)−s(k)∥2 where H represents a conjugate transposition and ∥*∥ represent the norm, then w(k) is calculated which minimizes the above equation.
The following scheme for the derivation of w(k) is described, for example, in Daryl Reynolds and Xiaodong Wang, "Low Complexity Turbo-Equalization for Diversity Channels," ELSEVIER, Signal Processing, 81(2001), pp. 989–995. One of the primary challenges by the scheme is a sharp reduction of computational complexity. The computational complexity of the conventional MLSE turbo is in proportion to the order of PQ−1 (where P is the number of signal points of the transmit symbol), whereas according to this scheme the complexity is kept down to the order of Q3. Incidentally, wH(k)·y′(k) is the output from the equalizer 21, from which is calculated λ1[s(k)], which is provided via the de-interleaver 23 to the decoder 24 for decoding calculation.
There is proposed a method by which approximates the absolute value of a soft decision symbol estimated value s′n(k) to 1 in second and subsequent rounds of MMSE filter coefficients calculation in single-user turbo reception (see, for example, H. Ohmori, T. Asai, T. Matsumoto, "A matched filter approximation for SC/MMSE Iterative Equalizers," IEEE Trans. Commun. Letters, vol., no. 7, pp. 310–312, July 2001).
Next, a description will be given of the turbo reception method set forth in European Patent Publication EP1233565A2 (corresponding U.S. Patent Application Publication No. 2002-016560-A1) which is an extension of the single-user turbo reception to a multi-user turbo reception method. Since the configuration of one user (transmitter n (where n=1, . . . , N) for the multi-input multi-output turbo reception method is the same as the transmitter configuration shown in FIG. 2, reference characters denoting the signal stream corresponding to that of the user n are each attached with a subscript n and put in parentheses.
Letting Q represent the number of multi-paths over which radio waves propagate from one transmitting antenna to one receiving antenna, the signal that is received by an m-th (where m=1, . . . , M) antenna #m is a signal that has convoluted a delay profile (channel characteristic) hmn(q) in the transmit signal sn from the transmitter Sn, and the signal rm(k) received by the m-th antenna #m is a combined version of received signals from all the transmitters S1 to SN and added with noise. Accordingly, the received signal rm(k) is given by the following equation.
                                          r            m                                          (            k            )                          =                                            ∑                              q                =                0                                            Q                -                1                                                                (                                                                    h                    mn                                                                          (                    q                    )                                                                                s                                          n                                                                                (                                          k                      -                      q                                        )                                                              )                                +                                    n              m                                                  (              k              )                                                          (        1        )            Where nm(k) is an additive white Gaussian noise (AWGN) for the signal received by the m-th antenna #m.
In this specification, the following definition is given for convenience in writing the channel status (channel characteristic).
                                                                        r                                                  (                  k                  )                                            =                                                                            [                                                                                r                        1                                                                                (                        k                        )                                                                                r                        2                                                                                (                        k                        )                                                                                …                                                                                r                        M                                                                                (                        k                        )                                                                              ]                                T                                                                                =                                                                                ∑                                          q                      =                      1                                        Q                                                                                H                                                                    (                        q                        )                                                                                S                                                                    (                                                  k                          -                          q                                                )                                                                                +                                  n                                                                                (                    k                    )                                                                                (        2        )            where k is discrete time, T represents a transposed matrix or vector, and H(q), S(k) and n(k) are as follows.
                              H                                (            q            )                          =                  [                                                                                h                    11                                                                          (                    q                    )                                                                                h                    12                                                                          (                    q                    )                                                                              ⋯                                                                                h                                          1                                            N                                                                                (                    q                    )                                                                                h                    21                                                                          (                    q                    )                                                                                h                    22                                                                          (                    q                    )                                                                              ⋯                                                                                h                                          2                                            N                                                                                (                    q                    )                                                                                ⋮                                            ⋮                                            ⋰                                            ⋮                                                                                h                    M1                                                                          (                    q                    )                                                                                h                    M2                                                                          (                    q                    )                                                                              ⋯                                                                                h                    MN                                                                          (                    q                    )                                                                                ]                                    (        3        )            S(k)=[s1(k)s2(k) . . . sN(k)]T  (4)n(k)=[n1(k)n2(k) . . . nM(k)]T  (5)
FIG. 3 shows the functional configuration of the MIMO turbo receiver. The MIMO space-time turbo receiver is formed by a MIMO equalizer 20A and decoding parts 20B1 to 20BN for respective signal streams (users), and reduces the bit error rate by iterating equalization and decoding of the same received signal. The received signals from antennas #1 to #M are input to the space-time turbo equalizer 20A as base-band digital signals r1(k) . . . , rN(k) each sampled with the symbol period, for instance. The MIMO equalizer 20A: generates a replica of the received interference signal by use of a second external information value (a second a priori information stream) which is fed back from a SISO (Soft-Input Soft-Output) decoder 24An in the preceding iteration of equalization and decoding; removes MAI (Multiple Access Interference) and ISI (Inter-Symbol Interference) from the received signal r(k) by use of the received interference signal replica; and calculates a first external information value (first a priori information stream) λ1[sn(k)] of each symbol by MMSE filtering. Incidentally, since in the first round of MIMO equalization for each frame it is impossible to utilize the second external information value λ2[sn(k)] obtainable in the previous iteration, the equalizer 20A performs only the equalization by the MMSE filter. The decoding part for the signal stream n (SISO decoding part for each user) 20Bn de-interleaves, by a de-interleaver 23, the first external information value λ1[sn(k)] calculated by the MIMO equalizer 20A and subjects the de-interleaved output to SISO decoding by a SISO decoder 24An. The second external information value λ2[sn(k)] obtained by the SISO decoding for each symbol sn(j) is interleaved by an interleaver 26 and fed back to the MIMO equalizer 20A as the second a priori information λ2p[sn(k)].
FIG. 4 illustrates the configuration of the MIMO equalizer 20A. The MIMO equalizer 20A comprises a channel estimation part 21C, equalization parts 21A1 to 21AN corresponding to respective signal streams, and a training symbol generating part 29, and each equalization part 21An is made up of an adaptive equalization part 27n and an external information generating part 28n. The channel estimation part 21C estimates the channel status (transmission channel characteristic) based on the received signal and a training symbol fed from the training symbol generating part 29.
FIG. 5 depicts the configuration of the adaptive equalization part 27n, which comprises an interference canceling part 31n, an MMSE filtering part 32n, and a filter coefficient calculating part 33n . FIG. 6 shows an example of the configuration of the interference canceling part 31n. Referring first to FIG. 6, a replica generator 34n generates a received interference signal replica of the interference (MAI, ISI) component in the received signal based on the second a priori information streams λ2[s1(k)], . . . , λ2[sN(k)] (except λ2[sn(k)]) and an estimated channel status (a channel estimated value) H, and a subtractor 35n subtracts the interference signal replica Hue,n(k) from the received signal r(k). An estimated value (soft decision symbol estimated value) s′n(k) of the transmit signal sn(k) of each user is calculated by the following equation from the second a priori information value λ2[sn(k)].s′n(k)=tanh(λ2[sn(k)]/2)  (6)The soft decision symbol estimated value s′n(k) is a transmit signal replica of a magnitude corresponding to its degree of reliability. The estimated value Ue,n(k) of the signal which becomes an interference component of the transmit signal sn(k) from the transmitter Sn at time k is as follows:Ue,n(k)=[un(k+(Q−1))un(k+(Q−2)) . . . un(k+1)Ucn(k)Un(k−1). . . un(k−(Q−1))]T  (7)un(k)=[s′1(k)s′2(k) . . . s′N(k)]  (8)ucn(k)=[s′1(k)s′2(k) . . . s′n−1(k)0s′n+1(k) . . . s′N(k)]  (9)
By generating the received interference signal replica Hue,n(k) for the interference component ue,n(k) and canceling the replica in the received signal r(k), it is possible to obtain an estimated value r′s,n(k) of the received signal for the transmit symbol sn(k) from the transmitter Sn at time k which is the symbol to be detected. That is, the estimated value r′s,n(k) is given by the following equation.r′s,n(k)=re(k)−Hue,n(k)  (10)wherere(k)=[r(k+Q−1)r(k+Q−2) . . . r(k)]T  (11)
                    H        =                  [                                                                      H                                                        (                    0                    )                                                                                H                                                        (                    1                    )                                                                              ⋯                                                              H                                                        (                                          Q                      -                      1                                        )                                                                                0                                                                                H                                                        (                    0                    )                                                                                H                                                        (                    1                    )                                                                              ⋯                                                              H                                                        (                                          Q                      -                      1                                        )                                                                                ⋰                                                                                0                                                                                H                                                        (                    0                    )                                                                                H                                                        (                    1                    )                                                                                ⋯                                                                                H                                                        (                                          Q                      -                      1                                        )                                                                                ]                                    (        12        )            In this case, however, the estimated value r′s,n(k) still contains interference components left uncanceled due to a bit decision error in the previous iteration and the usage of the soft output value.
Next, the cancellation of interference components still remaining after the cancellation of the received interference signal replica from the received signal and multi-paths combining are carried out by the MMSE filtering part 32n. Since in the early iterations many interference components remain uncancelled after the subtraction of the interference replica, the MMSE filtering part 32n functions as a filter which cancels the remaining interference components, and with an increase in the number of iterations, the MMSE filtering part 32n operates to perform maximum-ratio combining of multi-paths. Letting the output from the MMSE filtering part 32n be represented by zn(k), it is given as follows:zn(k)=wnH(k)rs,n(k)  (13)where H denotes a conjugate transposed matrix and wn(k) is a coefficient vector of the MMSE filtering part 32n, which is defined as follows in the filter coefficient calculating part 33n.wn(k)=[HΛn(k)HH+σ2I]−1hn  (14)where I is a unit matrix, hn is
                                                                        h                n                            =                                                          [                                                                            h                                              1                                                n                                                                                (                                              Q                        -                        1                                            )                                                                                h                                              2                                                n                                                                                (                                              Q                        -                        1                                            )                                                                                …                                                                                h                      Mn                                                                                (                                              Q                        -                        1                                            )                                                                                h                                          1                                            n                                                                                (                                          Q                      -                      2                                        )                                                                                h                                          2                                            n                                                                                (                                          Q                      -                      2                                        )                                                                                …                                                                                h                    Mn                                                                          (                                          Q                      -                      2                                        )                                                                                ⋯                                                                                h                                              1                                                n                                                                                (                      0                      )                                                                                h                                              2                                                n                                                                                (                      0                      )                                                                                …                                                                                h                      Mn                                                                                (                      0                      )                                                                      ]                            T                                                          (        15        )            And, setting D(k) and Dc(k) toD(k)=[1−s′12(k)1−s′22(k) . . . 1−s′N2(k)]  (16)Dcn(k)=[1−s′12(k)1−s′22(k) . . . 1−s′n−12(k)1 1−s′n+12(k) . . . 1−s′N2(k)]  (17)Λn(k) is expressed as follows:Λn(k)=diag[D(k+(Q−1))D(k+(Q−2)) . . . D(k+1)Dcn(k)D(k−1) . . . D(k−(Q−1))]  (18)where σ2 represents the internal noise power of the receiver and diag a diagonal matrix (elements other than those of the diagonal are zeros).
With the prior art described above, symbols sent simultaneously from a plurality of user transmitters at the same frequency can be received by a plurality of antennas and separated for each user.
There is proposed, for example, in Japanese Patent Application Laid-Open Gazette 2002-33685 an interference canceller for use in the CDMA (Code Division Multiple Access) mobile communication system. To cancel interference for signals from a plurality of users, the proposed interference canceller provisionally decides a signal after error correction encoding and uses the provisionally decided value to generate a replica and, at this time, prevents occurrence of many errors attributable to the generation of a wrong replica when the above-mentioned provisionally decided value is wrong. This interference canceller will be described below with reference to FIG. 7 which is arranged for 3 users and 4 stages.
In a first stage 301 interference canceling parts (ICU) 311 to 313 each perform the processing shown in FIG. 8. In the first place, a RAKE receiving part 401 performs RAKE reception of a user signal. That is, for each path the user signal is despread in a despreading part 404, and the despread signal is provided to a channel estimation part 405 and a multiplication part 406. A channel estimated value derived from the despread signal in the channel estimation part 405 and the despread signal are multiplied in the multiplication part 406. Such multiplied outputs in the respective paths are added together in an adding part 407, and the result of RAKE reception, which is the result of the addition, is provided to an FEC (Forward Error Correction) decoding part 408 and a pre-FEC-decoding hard decision part 411 in a transmission data decision part 402.
The pre-FEC-decoding hard decision part 411 makes a hard decision directly based on the result of RAKE reception, and the FEC decoding part 408 performs FEC (Forward Error Correction) decoding based on the result of RAKE reception. The EFC decoded signal is subjected to hard decision in a hard decision part 409, thereafter being applied to an FEC encoding part 410 and an error detecting part 421. The FEC encoding part 410 performs FEC encoding of the hard decision signal, and outputs the FEC-encoded hard decision value to a switch 423 and the corresponding ICU parts 321 to 323 in a second stage 302.
An error detecting part 421 performs an error detection by CRC (Cyclic Redundancy Check), and applies the detected output to a switch control part 422 and the corresponding ICU parts 321 to 323 in the second stage 302.
The switch control part 422 controls the switch 423 according to the CRC output. When the CRC result is NG (error detected), the switch control part 422 controls the switch 423 to apply therethrough the yet-to-be-FEC-decoded hard decision value from the pre-FEC-decoding hard decision part 411 to a multiplying part 414 of each path in a replica generating part 403. The multiplying part 414 of each path in the replica generating part 403 multiplies the yet-to-be-FEC-decoded hard decision value and a channel estimated value of the corresponding path which is fed from the RAKE receiving part 401, and the multiplied output is provided to a re-spreading part 415, wherein it is spread in the same manner as at the transmitting side. The spread signals of the respective paths are added together in an adding part 416, and the added output is provided as a replica from each of the ICU parts 311 to 313, thereafter being applied to a second stage 302 via each of adding parts 315 to 317 in the first stage in FIG. 7.
When the CRC result is OK (no error detected), the switch control part 422 controls the switch 423 to apply therethrough the FEC-decoded hard decision signal (hard decision value) from the FEC ending part 410 to the multiplying part 414 of each path in the replica generating part 403.
Replicas of respective received signals from the ICU parts 311, 312 and 313 are subtracted in a subtracting part 314 from the received signal fed thereto via a delay part 310, and the subtracted received signal is added with replicas from the ICU parts 311, 312 and 313 in adding parts 315, 316 and 317, respectively. Accordingly, the output from the adding part 315, for instance, is equivalent to a signal obtainable by cancelling components of other user's received signals from the received signal. Similarly, the adding part 316 and 317 output the corresponding received signals from which other interference signals have been removed, respectively.
In the ICU parts 321 to 323 in the second stage 302, the RAKE receiving part 401 and the transmission data decision part 402 perform the same processing as in the case of the first stage 301 as shown in FIG. 9 in which the parts are denoted by reference numerals similar to those of the corresponding partsin FIG. 8. To the error detecting part 421 a are input the hard decision signal from the hard decision part 409 in the current stage (the second stage 302) and the CRC result provided from the previous stage (the first stage 301). To the switch part 423a are input a yet-to-be-decoded hard decision value and an FEC-decoded hard decision value in the current stage and the hard decision value provided from the previous stage. The current-stage error detected result (CRC result) in the error detecting part 421 a and the hard decision value from the FEC encoding part 410 are output to each of the corresponding ICU parts 331 to 333 of the next stage (third stage 303). The switch control part 422a selects its output signal to the replica generating part 403 according to the following three conditions. First, when the CRC result from the previous stage is OK (no error detected), the hard decision value of the previous stage is provided to the replica generating part 403. Second, when the CRC result from the previous stage is NG (error detected) and the CRC result on the hard decision signal in the current stage is OK, the hard decision value from the FEC encoding part 410 is selected and provided to the replica generating part 403. Third, when the CRC result from the previous stage is NG and the CRC result on the hard decision signal in the current stage is also NG, the hard decision value from the pre-FEC-decoding hard decision part 411 is selected and provided to the replica generating part 403.
Accordingly, the second stage 302 outputs each received signal having cancelled therefrom other received signals (interference signals). In the third stage 303, too, the same processing as in the second stage 302 is carried out. Turning to FIG. 10, the operation of each of the ICU parts 341 to 343 in the fourth stage 304 in FIG. 7 will be described below. The processing in the RAKE receiving part 401 is the same as in the case of the first stage 301. The output from the RAKE receiving part 401 is FEC decoded in the FEC decoding part 408 in a transmit data decision part 402a, and the FEC-decoded signal is subjected to hard decision in the hard decision part 409. A switch control part 422b controls a switch 423b to output therethrough, as a demodulated signal, the hard decision value of the previous stage or the hard decision signal from the hard decision part in the current stage, depending on whether the CRC result from the previous stage is OK (no error detected) or NG (error detect).
As described above, when the CRC result from the previous stage is OK, the error-free hard decision value of the previous stage is used to generate the replica—this ensures generation of an accurate replica. Besides, in this instance, a series of processes in the current stage, i.e. FEC decoding, hard decision and FEC encoding, become unnecessary, so that the computational complexity involved can be reduced. When the CRC result from the previous stage is NG and the CRC result in the current stage is OK, the error-free hard decision value in the current stage is used to generate the replica; hence, it is possible to obtain the replica with high accuracy. Further, when the CRC result from the previous stage is NG and the CRC result in the current stage is also NG, no wrong signal is used but a signal obtained by hard decision of a yet-to-be-FEC-decoded in the current stage is used to generate the replica—this excludes the possibility of a wrong replica by use of a wrong signal and provides for increased accuracy of replica.
Incidentally, in FIGS. 8 and 9, a soft-decision result of the output from the RAKE receiving part 401 may be used instead of the output from the pre-FEC decoding hard decision part 411.

Adaptive equalizing apparatus and program therefor


An emergency door opening apparatus for use on an aerospace vehicle for moving a door of the vehicle from a closed position to an open position. The apparatus includes a fluid cylinder (16) and piston (18) operatively connected to the door and to the vehicle and a supply or gas generating chemicals (24) which, when ignited, are operable to rapidly generate and supply to the fluid cylinder (16) a sufficient amount of gas to move the fluid cylinder (16) and piston (18) to effect opening of the door.

The present invention relates to a new and improved door actuator system for a vehicle and more specifically to an emergency door activating system for use on an aerospace vehicle including a fluid actuator which in the preferred embodiment is a fluid cylinder and piston operatively connected to the door and the vehicle for moving the door between an open and a closed position and wherein a supply of gas generating chemicals is provided which when actuated rapidly generates a supply of gas which is directed to said fluid cylinder and piston to effect rapid movement of the door of the vehicle between a closed position and a open position.
Emergency door activating systems are known including those for rapidly opening the door of an aerospace vehicle in an emergency situation.
One known emergency door activating system manufactured by Ratier-Figac of France utilizes a fluid damper and piston and cylinder assembly which is operatively connected between the body of the aircraft and the door. A reservoir of pressurized nitrogen is connected to the fluid cylinder. When it is desired to open the door in an emergency situation, the pressurized nitrogen is released from the reservoir and directed to the fluid cylinder to rapidly move the piston and effect opening of the door.
The prior art system suffers from the disadvantage that the reservoir of high pressure nitrogen must be maintained at all times on the aircraft. The weight associated with the reservoir of high pressure gas is substantial due to the construction of the reservoir, which is designed to hold approximately 150 cm3 of gas at approx 123 bar, and the weight of the monitoring equipment required to monitor the gas pressure in the reservoir. Aging of seals and leakage of nitrogen from the reservoir over time causes the prior art systems to require periodic maintenance to ensure that high pressure nitrogen is always present in the reservoir for use in an emergency situation to open the door. Monitoring of the gas pressure in the reservoir requires instrumentation which adds cost and weight and requires labor cost. Replacement of gas in the reservoir requires additional labor costs. If the nitrogen pressure becomes low as a result of leakage, the aircraft on which the nitrogen reservoir is located cannot be flown until the pressure is reestablished in the emergency door actuation system. Thus, loss of pressure in the emergency door actuation system is considered a "no go" item for commercial aircraft. It is extremely costly to ground an aircraft for maintenance and thus it is desirable to provide a low maintenance, low weight emergency door actuation system for use on an aerospace vehicle and other vehicles.


A method and an apparatus for efficiently controlling the power output of a solar cell array string or a plurality of solar cell array strings to achieve a maximum amount of output power from the strings under varying conditions of use. Maximum power output from a solar array string is achieved through control of a pulse width modulated DC/DC buck converter which transfers power from a solar array to a load or battery bus. The input voltage from the solar array to the converter is controlled by a pulse width modulation duty cycle, which in turn is controlled by a differential signal comparing the array voltage with a control voltage from a controller. By periodically adjusting the control voltage up or down by a small amount and comparing the power on the load or bus with that generated at different voltage values a maximum power output voltage may be obtained. The system is totally modular and additional solar array strings may be added to the system simply be adding converter boards to the system and changing some constants in the controller's control routines.

Solar cells, whether singly or connected in an array, have been utilized to supply power in a wide variety of applications. Those applications for which solar power may be utilized encompass virtually any device or system which utilizes electric power, and range from terrestrial uses in solar powered vehicles and hot water heaters to extraterrestrial uses in spacecraft. Because of the increasing importance and employment of solar generated power, it is necessary to make the most cost effective and efficient utilization of the power generated by a solar array. This is particularly true in applications where size and weight are significant concerns, such as in terrestrial vehicles or spacecraft in which the size and weight of solar panels contributes significantly to the size and weight of the overall system.
Effective utilization of the power generated by a solar cell array requires that the solar array be controlled to operate at its most efficient point. The most efficient operating point of a solar cell or solar cell array may vary dependent upon a variety of factors including temperature, illumination level, the type of cell, radiation damage to the cell, the number of cells in series and other cell properties. In general, the solar cell array will operate at its most efficient point and output the greatest amount of power at a specific power maximizing voltage which is determined by the operating conditions.
One such system for determining the power maximizing voltage of a solar cell array string operates by sensing the power at the output of a solar cell array before a signal indicative of power has propagated through the power tracking circuitry of the system. Since there may be losses in the tracking circuitry which would move the peak power point for the whole system, these losses can not be taken into account by such a system.
Another known system controls a large number of solar array strings grouped together as one. Since each individual solar array string has its power output maximizing voltage determined by different factors, the best peak power point for the group of solar array strings is necessarily less than the peak power outputs of the individual strings when each string is operated at its own output maximizing voltage.
Another known category of peak power trackers utilizes various analog techniques to approximate the peak power point of each solar array string. However, according to this category of power maximizing system each peak power tracker is an independent unit having logic circuitry required to peak power track the individual string the unit is controlling.

Microprocessor control of multiple peak power tracking DC/DC converters for use with solar cell arrays

The United States of America as represented by the Administrator of the National Aeronautics & Space Administration


We describe a polypeptide which binds and modulates the activity of a tumour suppressor polypeptide, for example p53; a nucleic acid molecule encoding said protein and screening methods which modulate the binding activity of said polypeptide for its target polypeptide(s).

Tumour suppressor genes encode proteins which function to inhibit cell growth or division and are therefore important with respect to maintaining proliferation, growth and differentiation of normal cells. Mutations in tumour suppressor genes result in abnormal cell-cycle progression whereby the normal cell-cycle check points which arrest the cell-cycle, when, for example, DNA is damaged, are ignored and damaged cells divide uncontrollably. The products of tumour suppressor genes function in all parts of the cell (e.g. cell surface, cytoplasm, nucleus) to prevent the passage of damaged cells through the cell-cycle (i.e. G1, S, G2, M and cytokinesis). A number of tumour suppressor genes have been isolated and sequenced. These include the Retinoblastoma gene (Rb), mutations in which are linked to cancers such as bone (osteocarcoma), bladder, small cell lung and breast cancer, as well as retinoblastoma. The Wilms Tumour 1 gene (WT-1), mutations that are linked to nephroblastoma and neurofibromatosis.
Arguably the tumour suppressor gene which has been the subject of the most intense research is p53. p53 encodes a protein which functions as a transcription factor and is a key regulator of the cell division cycle. It was discovered in 1978 (Lane and Crawford, 1979) as a protein shown to bind with affinity to the SV40 large T antigen. The p53 gene encodes a 393 amino acid polypeptide with a molecular weight of 53 kDa. One of the most important tumour suppression functions of p53 is its ability to induce apoptosis
Apoptosis, or programmed cell death, is a process by which multi-cellular organisms regulate cell number and differentiation. The process is regulated by factors which either induce or prevent apoptosis. Inducers of apoptosis include Bcl-2 family members, caspase family members and their associated factors Apaf-1 and Fadd. Caspases are synthesised as proenzymes which become activated after proteolytic cleavage. The active caspase then induces many of the morphological and biochemical changes associated with apoptosis. Mitochondria play a pivotal role in the activation process through the release of pro-apoptotic factors such as cytochrome c, AIF and Diablo. The release from mitochondria is controlled by the Bcl-2 family of proteins; (e.g. Bcl-2 and Bcl-x1 inhibit release; Bax and Bak induce release).
The polypeptide referred to as iASPP that is described in WO02/12325 is a further example of an agent involved in the regulation of apoptosis.


The present invention relates to a test tray for a test handler. According to this invention, there is disclosed a technique that an insert loaded in a loading part which is arranged in a matrix pattern in a frame of the test tray allows an amount and direction of free movement thereof to be determined in accordance with a location of the loading part, where the insert is loaded, on the matrix, thereby enabling a thermal expansion or contraction of a match plate or the test tray to be compensated.

In general, a test handler is an apparatus for assisting a tester to test semiconductor devices manufactured through predetermined manufacturing processes, and the test handler classifies the semiconductor devices by grade according to a test result. The test handler has been disclosed in several publications, e.g., Korean Patent Laid-open Publication No. 2003-0029266 entitled "Test handler".
Referring to FIG. 1, there is shown a conceptual diagram of a conventional side-docking type test handler as viewed from above. The side-docking type test handler includes a loading unit 11, a soak chamber 12, a test chamber 13, a desoak chamber 14, and an unloading unit 15. As illustrated in FIG. 1, the side-docking type test hander has a structure in which the soak chamber 12 is arranged at a back side of the loading unit 11 positioned on a left side in the test handler; the desoak chamber 14 is arranged at a back side of the unloading unit 15 positioned on a right side in the test handler; and the test chamber 13 is arranged at a back side of the soak chamber 12 and the desoak chamber 14.
In the loading unit 11, the semiconductor devices loaded on customer trays are transferred to a test tray and loaded thereon.
In the soak chamber 12, the test tray is translated toward the test chamber 13. While it is translated, the semiconductor devices loaded on the test tray are preheated or precooled depending on a preset test environment in the soak chamber 12.
In the test chamber 13, the test tray is transferred from the back side of the soak chamber 12 toward the back side of the desoak chamber 14. When the test tray is positioned at an approximately central portion C of the test chamber 13, the test tray is made to be closely attached to a tester 21 docked to a back side of the central portion C. Accordingly, the semiconductor devices loaded on the test tray are supplied to the tester 21 for testing (more specifically, the semiconductor devices are made to contact with contact sockets of the tester).
In the desoak chamber 14, the heated or cooled semiconductor devices transferred from the test chamber 13 are restored to a room temperature.
In the unloading unit 15, the semiconductor devices transferred from the desoak chamber 14 while being loaded on the test tray are classified by test grades and then transferred onto customer trays.
As described above, the semiconductor devices are transferred from the loading unit 11 to the unloading unit 15 via the soak chamber 12, the test chamber 13 and the desoak chamber 14, as indicated by an arrow a in FIG. 1. In this regard, the semiconductor devices are transferred from the loading unit 11 to the unloading unit 15 while being loaded on the test tray. This is because the test tray is designed to satisfy test conditions, whereas the customer tray is designed to densely load a large number of semiconductor devices so that a gap between semiconductor devices loaded on the customer tray does not satisfy the test conditions.
Since the semiconductor devices are transferred while being loaded on the test tray, the test tray needs to be transferred along a circulation path indicated by an arrow b beginning from the loading unit 11 and returning thereto via the soak chamber 12, the test chamber 13, the desoak chamber 14, and the unloading unit 15. The related arts of the test tray transfer method are disclosed in, e.g., Korean Patent Laid-open Publication No. 1997-0077466 entitled "TEST TRAY TRANSFER METHOD" (hereinafter, referred to as "prior art".
A continuously increasing demand for semiconductor devices has led to an increase in a processing amount per unit time of the test handler. Thus, there have arisen needs to increase the number of semiconductor devices to be tested at one time and improve a processing speed of the test handler. The present invention has a purpose of increasing the number of semiconductor devices that can be tested at one time.

Method for transferring test trays in a side-docking type test handler


The invention relates, in part, to methods of administering electrical or magnetic brain stimulation to increase learning rate.

The mechanisms underlying the formation of visual-motor associations, and the role of dopamine in this process, are topics of great importance in neuroscience. Derangements of this circuitry may play a role in Parkinson's Disease (PD) and learning disorders such as autism. There are numerous studies indicating that patients with PD suffer from learning deficits. In one such study, patients with PD were found to have impairments in sequence learning that were reversed with the administration of the dopamine precursor levodopa (Shohamy, D. et al., Behav Brain Res. 156:191-199, 2005). In support of the role of dopamine in learning, a recent study found that in normal human subjects, levodopa significantly enhanced the speed, overall success, and long-term retention of novel word learning in a dose-dependent manner (Knecht, S. et al., Ann Neurol. 56: 20-26, 2004). In addition, there is increasing evidence that striatal dysfunction may be an important component of autism. Volumetric MRI studies have suggested that there are differences in caudate size between normal and autistic children (Hollander, E. et al., Biol Psychiatry 58: 226-232, 2005). Other studies have suggested that autistic children may have increased serum antibodies to the caudate nucleus (Singh, V. K. & Rivas, W. H., Neurosci Lett. 355: 53-56, 2004), but the role of specific brain regions in learning such as the formation of visual-motor association remains unclear.


The disclosure discloses a catalyst capable of simultaneously removing COS and H2S in garbage gasification and a preparation method thereof, and belongs to the technical field of preparation of desulfurization catalysts. The method includes the following steps: pretreating an SBA-15 molecular sieve with a templating agent unremoved, which primarily includes the steps of removing the templating agent and introducing halogen atoms to modify the molecular sieve; then synthesizing an active component solution; and finally introducing active components into channels of the pretreated molecular sieve via surface tension by adopting an impregnation method, performing washing and drying, and performing calcining under an N2 atmosphere, so as to obtain the catalyst. The catalyst prepared according to the present disclosure can load the active components in fixed positions inside and outside the channels, and the components are easy to obtain, thereby having the advantages of low cost and good desulfurization effects.

Nowadays, "garbage siege" has become one of important factors restricting development of many regions and affecting the living quality of people. Household garbage not only occupies a lot of lands, but also causes continuous pollution to the environment on which human beings depend, thereby posing a threat to the health of human beings. Garbage gasification is a gasification reaction after household garbage subjected to pre-treatment such as crushing and drying enters a gasification furnace, and combustible gas generated by gasification is fed into a hearth of a coal-fired boiler to combust after the temperature of the combustible gas is reduced to about 400° C. A lot of toxic substances will be further generated in the garbage gasification process, wherein sulfur-containing compounds include inorganic sulfur (H2S) and organic sulfur (COS and the like). Thus, in order to reduce pollution of the sulfur-containing compounds generated in the garbage gasification process to the environment, researchers have made related researches. There are primary research reports as follows:
A patent with the application number 201910459266.5 discloses a desulfurization catalyst and a preparation method and an application thereof. Active substances include iron sesquioxide, cobalt oxide, molybdenum oxide and zinc oxide, wherein the mass ratio of Fe to Co to Mo is (1-5):(1-4):(1-5.5). A carrier is carbon, preferable activated carbon. Zinc is added in an amount so that zinc accounts for 1-20 wt % in the desulfurization catalyst. The desulfurization catalyst is researched to simultaneously remove various sulfides in a gas source based on carbon, and can remove carbonyl sulfide, mercaptan and hydrogen sulfide in the gas source integrally in a same process condition. The desulfurization catalyst can be used for desulfurizing and purifying sulfur-containing tail gas effectively, and the desulfurization efficiency reaches 98.5%. However, the catalyst takes activated carbon as the carrier, a pore diameter structure is a micropore structure, and carbonyl sulfide and hydrogen sulfide are catalytically oxidized in one step into elemental sulfur which will block channels when being loaded onto the surface of the catalyst to lead to a limited service life of the catalyst.
A patent with the application number 201210208285.9 discloses a detergent for adsorbing hydrogen sulfide and carbonyl sulfide in tail gas of natural gas. The detergent takes activated carbon as a carrier and a soluble zinc salt and a soluble copper salt as active components. The detergent is prepared by the following steps: first, preparing an aqueous solution from the active components zinc salt and copper salt; then mixing the active component solution with an activated carbon solution, and stirring the obtained mixture in a room temperature condition to obtain a solution loading an active metal carrier; then drying the solution loading the active metal carrier to obtain particles loading the active metal carrier; and finally, oxidizing the particles loading the active metal carrier, and washing and drying the oxidized particles to obtain a finished product detergent. However, as the active components of the detergent are the soluble zinc salt (zinc nitrate or zinc acetate), the active components of the detergent dissolved in water are acidic, so that the active components are easily lost when being loaded onto the carrier. Hydrogen sulfide and carbonyl sulfide in the tail gas of the natural gas are adsorbed at a not high temperature which is usually a normal temperature and the garbage gasification temperature is very high and can reach 300-400° C. If hydrogen sulfide and carbonyl sulfide at normal temperature are removed, a gas cooling apparatus shall be additionally arranged, such that the investment of the apparatus is large and the cost is high. If the detergent is directly used to remove hydrogen sulfide and carbonyl sulfide, the active components are easily deactivated, such that an expected desulfurization effect cannot be achieved.
A patent with the application number 201410856116.5 discloses a desulfurizer capable of removing hydrogen sulfide and carbonyl sulfide simultaneously. The desulfurizer is prepared from the following steps: mixing and kneading a zinc-containing compound, a binder and an accelerant for forming; drying the mixed and kneaded formed mixture to obtain a dried desulfurizing carrier precursor; roasting the obtained desulfurizing carrier precursor to obtain a desulfurizer carrier; impregnating the desulfurizer carrier with a first copper salt solution to load the copper active component to the desulfurizer carrier, wherein the first copper salt solution is an ammonia water solution of basic cupric carbonate; and drying and roasting the obtained impregnated sample to obtain the desulfurizer capable of removing hydrogen sulfide and carbonyl sulfide simultaneously. However, in the carrier mixing and kneading formation, problems that the contact areas between the toxic substances and the active components are small, loading is non-uniform and the channels are easily blocked and the like exist.
In conclusion, catalysts in the prior art cannot remove COS and H2S generated in the garbage gasification tail gas efficiently due to problems that the active components are easily lost, the channels are easily blocked and the like.

Catalyst capable of simultaneously removing COS and H


The compositions and methods described herein include agents that inhibit inflammasome signaling in the mammal such as antibodies directed against inflammasome components used alone or in combination with extracellular vesicle uptake inhibitor(s). Also described herein are compositions and methods of use thereof for treating multiple sclerosis.

Severe Traumatic Brain Injury (TBI) is a major public health concern and is a leading cause of mortality and morbidity throughout the world (3). In addition to direct injury to the brain, TBI may lead to complications in other organs, such as the lungs. Acute Lung Injury (ALI; 2) is a common cardiopulmonary problem after trauma and is associated with a hospital mortality rate of up from 40% (4). TBI patients, in particular, are susceptible to develop ALI, with some studies reporting an incidence as high as 30% (5). Recent studies have shown that systemic inflammatory factors may lead to pulmonary dysfunction and lung injury after TBI (6), but the precise molecular mechanism underlying TBI-induced lung injury remain poorly defined.
A flood of secreted inflammatory mediators, including cytokines, chemokines, and damage-associated molecular patterns (DAMPs) released by injured cells contribute to brain inflammation and affect distal organs such as the lungs (5). One of the most widely studied DAMPs is the high mobility group box-1 (HMGB1), which can serve as an early mediator of inflammation in various pathogenic states, including TBI (7). A more recent study has shown that HMGB1 can be involved in the mechanism of TBI-induced pulmonary dysfunction (8). HMGB1 release can be regulated by the inflammasome (9), a multi-protein complex involved in the activation of caspase-1 and the processing of IL-1β and IL-18 after TBI (10).
A variety explanations have been put forth to explain pathomechanisms of pulmonary complications after TBI, including increased vascular permeability leading to capillary leakage and infiltration of proteinaceous debris (11). Extracellular vesicles (EV) are membrane-contained vesicles that play a role in cell-to-cell communication (12) and have been implicated to play a role in the development of ALI in a LPS-induced murine model. Further, it has been shown that EV can carry bioactive cytokines such as IL-1β and inflammasome proteins (13) (14), and may trigger an immune response and amplify inflammation via its cargo to neighboring and surrounding cells. However, it is unknown if EV-mediated inflammasome signaling can contribute to the pathomechanism of TBI-induced ALI. Further, it is also unknown whether the pathomechanisms of TBI-induced ALI are shared by other conditions that produce lung inflammation. In addition, there is a scarcity of Federal Drug Administration (FDA) approved drugs to treat lung inflammation.
Accordingly, there is an urgent need not only for elucidating the pathomechanisms of lung inflammation caused by TBI as well as other conditions, but also the development of therapeutic compositions and uses thereof for treating and/or preventing lung inflammation.

Methods for treating lung inflammation with an anti-ASC antibody