An agricultural tractor seeks to simplify a shaft support structure in a lower portion side of an elevating hydraulic cylinder which is externally installed to a rear side of a transmission case. The agricultural tractor of the present invention is provided with a travel machine body to which an engine and the transmission case are mounted, a lift arm which is provided in a rear portion side of an upper surface of the transmission case so as to freely oscillate up and down, the elevating hydraulic cylinder which oscillates up and down the lift arm, and rear axle cases which protrude laterally outward from the transmission case. An upper portion side of the elevating hydraulic cylinder is connected to the lift arm, and a lower portion side of the elevating hydraulic cylinder is supported to the travel machine body. The lower portion side of the elevating hydraulic cylinder is axially supported rotatably via a laterally directed pivot pin shaft by a hitch portion which is integrally formed in at least one of the right and left rear axle cases so as to protrude backward, and a bracket portion which is integrally formed in a rear surface of the transmission case so as to protrude backward.

An agricultural tractor is conventionally provided with a travel machine body to which an engine and a transmission case are mounted, a lift arm which is arranged in an upper surface side of a rear portion of the transmission case so as to freely oscillate up and down, and an elevating hydraulic cylinder which oscillates up and down the lift arm, and the elevating hydraulic cylinder for driving the lift arm is outward installed to the rear side of the transmission case (refer, for example, to patent document 1).


A floor sag eliminator that includes a floor plate assembly which is configured to be fastened to the underside of an existing floor between adjacent joists. One or more support arms are pivotally connected to the floor plate assembly at one of their ends. The other ends of the support arms are configured to engage and be retained by the side walls of floor joists. The support arms cooperate with the floor joists to provide support to the floor and to eliminate the sag.

Ideally the floor of a building is level, flat, and solid. However, sometimes a floor will develop localized sags, dips or weak spots. These may develop due to bad building materials, poor installation, or poor design of the floor. Sags, dips and weak spots may also develop over time as the construction materials age, warp, shrink or the like. Sags, dips, and weak spots may also develop due to overloading or uneven loading of the floor. Sags, dips and weak spots are particularly a problem in modular, manufactured and mobile homes since costs are frequently minimized in these types of construction; therefore, the amount, strength, and quality of the building materials employed are often reduced.
Solid, level, and flat floors are desirable for cosmetic as well as safety reasons. A floor with a localized sag or dip may cause a walker to stumble or fall. A localized weak spot may cause the floor to fail when loaded.
Previous approaches to eliminating floor sag can be divided into preventative approaches and curative approaches. Preventative approaches include using higher quality, and new designs, of building materials. To prevent a sag or dip, a floor should be designed to spread load evenly to the floor joists supporting the floor. Also, the floor joists should be close enough to one another to solidly support the floor. Positioning the floor joists closer to one another lowers the chance of a localized sag or dip. Bracing between floor joists can also be used to improve the distribution of loads. U.S. Pat. No. 2,865,059 to Scriven discloses a metal joist-bridging brace configured to be incorporated during the construction of a floor system. The upper portion of the brace is connected to the top side of the joist and the lower portion of the brace is connected to the underside of the joist; consequently, the braces must be installed before the floor is laid on top of the joists. This brace system cannot be incorporated after a floor system is complete without removing the floor from the joist. This limits the invention to preventative uses only.
Previous curative approaches to fixing localized sags, dips or weak spots that develop after a floor is complete, include hammering in pieces of wood between the joists and positioning jack posts underneath the problem area. These approaches work to eliminate the sag, dip or weak spot, but are time and labor intensive. To fabricate a nail-in wooden support requires woodcutting tools, and some degree of skill. A jack post is simpler to use but can be costly and takes up valuable space in the region below the floor.
There is a need for a simple to use, low cost means to quickly eliminate a localized sag, dip or weak spot in a floor. The present invention provides such a means to eliminate localized sags, dips, and weak spots. It can be added after construction is complete when a problem develops or during original construction to prevent later problems. The device does not require the removal of the floor or the floor covering. As will be described in greater detail hereinbelow, the present invention provides a floor sag eliminator which is affixed to the underside of a floor and connects to adjacent floor joists to provide support to the floor thereby eliminating a localized sag, dip or weak spot.


A fastening member detection device includes a contact structure that moves with respect to a medium while contacting the medium, a vibration detector that detects vibration that occur in the contact structure, and a controller that determines whether there is a fastening member that fastens the medium, based on the vibration.

Digitization of a plurality of paper documents that are put in a binder with a scanner device has been widely performed. Paper documents put in a binder may contain a fastened medium that is fastened by a staple or a clip. When such fastened medium is inserted into a scanner device, the media may be damaged or the scanner device may have trouble. For this reason, documents to be inserted into the scanner device are inserted into the scanner device after pre-processing to detect whether the documents are fastened with a staple is performed. Devices that automatically detect whether there is a staple have been known (see Japanese Laid-open Patent Publication No. 5-58512, Japanese Laid-open Patent Publication No. 2000-159449, Japanese Laid-open Patent Publication No. 2006-206198 and Japanese Laid-open Patent Publication No. 2012-210986).
Such a device however has a problem in that the device sometimes falsely detects whether there is a fastening member that fastens media. For example, as for a technology to detect a staple by using a magnetic no-contact metal detection technology, it may be falsely detected that there is no staple depending on the material of a staple. As for a method of detecting a staple by conduction through conductive rubber rollers between which a medium is interposed, when anticorrosive treatment has been applied to the surface of a staple, no conduction may occur and thus no staple may be detected. As for a technology to detect a staple by detecting a difference in color between a paper media and a staple by performing image processing, a copy print of a staple obtained by copying a medium fastened with a staple may be falsely detected as a staple.


A sustainable cell line of a Marek's disease herpesvirus (MDV) infected chicken cell line derived from chick embryo cells which are chicken helper factor (Chf) negative and which have been treated with N-methyl-N-nitro-N-nitrosoguansidine (MNNG) and then converted with the MDV which is able to infect avians in vivo. The cell line is useful for vaccine production and for determining the characteristics of the MDV under various conditions.

1. Summary of the Invention
The present invention relates to a sustainable chicken cell line infected with Marek's disease virus (MDV). In particular, the present invention relates to a cell line which can be used as a virus vaccine, as a system in which to produce altered MDV strains, and which can be used to determine the affect of various reagents or growth conditions on the cell line over time.
2. Description of Related Art
Marek's disease (MD) is a highly contagious lymphoproliferative disease of chickens, characterized by lymphocytic infiltration in visceral organs, muscles, and peripheral nerves. The etiological agent of MD, an avian herpesvirus called Marek's disease virus (MDV), is highly infectious and cell associated (Calnek, B. W., and R. L. Witter, In "Diseases of Poultry: Marek's Disease" (B. W. Calnek, et al., Eds.), pp. 342-385. Iowa State University press, Ames, Iowa (1991)). MDV replicates in a productive restrictive manner in B-lymphocytes and cells growing in tissue culture. Production of fully enveloped virus is restricted to feather follicle epithelium of infected birds (Witter, R. L., et al., J. Natl. Cancer Inst. 49:1121-1130 (1972); Calnek, B. W., et al., Avian Dis. 14:219-233 (1970)). MDV rapidly establishes a latent infection in T-lymphocytes, ultimately leading to malignant transformation and neoplastic disease (Shek, W. R., et al., J. Natl. Cancer Inst. 70:485-491 (1983)). However, the precise relationship between latency and transformation in MDV infected T-lymphocytes is unknown. Akiyama, Y., et al. (Continuous cell culture from lymphoma of Marek's disease. Biken J. 16:177-179 (1973)) first succeeded in establishing a T-lymphoblastoid cell line from MD-infected chickens. Since then, more than 80 cell lines have been produced from MD lymphomas (Akiyama, Y., et al., Two cell lines from lymphomas of Marek's disease. Biken J. 17:105-116 (1974); Powell, P. C., et al., Nature 251:79-80 (1974); Calnek, B. W., et al., Int. J. Cancer 21:100-107 (1978); Payne, L. N., et al., Int. J. Cancer 28:757-766 (1981); Nazerian K., and R. L. Witter, J. Natl. Cancer Inst. 54:435-458 (1975)). Although suitable for some studies, these cell lines are many passages removed from the original event(s) leading to their transformation.
Evidence suggests that viral genomes in MD-lymphoblastoid cell lines are predominately integrated into cellular chromosomes, but episomal forms also exist (Delecluse, H.-J., et al., J. Virol. 67:82-92 (1993)). Analysis of viral transcription in transformed lymphoblastoid cell lines has revealed variable but limited transcriptional activity confined to approximately 20% of the viral genome (Maray, T., et al., Virus Genes 2:49-68 (1988)). MDV-specific transcripts in transformed lymphoblastoid cells are primarily derived from within long and short region terminal repeats (TRL, and TRS respectively) and internal repeats (IRL and IRR respectively). Little transcriptional activity is detected within either the long unique (U.sub.L) or short unique (U.sub.S) regions (Sugaya, K., et al., J. Virol. 64:5773-5782 (1990)). MDV can be rescued from some lymphoblastoid cell lines by co-cultivation with primary or secondary chicken and duck embryo fibroblasts (CEF and DEF, respectively), which support the lytic cycle of MDV in vitro (Schat, K. A., et al., Int. J. Cancer 44:101-109 (1989)). In addition, some lymphoblastoid cell lines will induce MD upon injection into susceptible birds (Akiyama, Y., et al., Continuous cell culture from lymphoma of Marek's disease. Biken J. 16:177-179 (1973); Nazerian, K., et al., Avian Diseases 21:69-76 (1977)).
Since development of live virus Marek's disease vaccines in the late 1970's, losses to Marek's disease have been significantly reduced (Calnek and Witter, In "Diseases of Poultry: Marek's Disease" (B. W. Calnek, H. J. Barnes, C. W. Beard, W. M. Reid, and H. W. Yoder, Jr., Eds.), pp. 342-385. Iowa State University press, Ames IA (1991)). The most widely used Marek's disease vaccines are live Turkey herpesvirus (HVT or serotype 3 MDV) or a bivalent mixture of HVT and the apathogenic serotype 2 strain of MDV (MDV-2). The bivalent mixture of HVT and serotype 2 MDV synergistically affords greater protection against Marek's disease, especially in those situations where HVT is not fully effective (Witter, R. L., Protection by attenuated and polyvalent vaccines against highly virulent strain of Marek's disease virus. Avian Path. 11:49-62 (1982); Witter, R. L. and L. F. Lee, Polyvalent Marek's disease vaccines: safety, efficacy and protective synergism in chickens with maternal antibodies. Avian Path. 13:75-92 (1984); Witter, R. L., Principles of Vaccination. In "Marek's Disease: Scientific Basis and Methods of Control" (Payne, L. N., ed.) pp. 203-250. Marinus Nijhoff Pub., Boston, Mass. (1985)). Marek's disease vaccines are the most widely used vaccines in the poultry industry. Current Marek's disease vaccines are either suspensions of infected chicken embryo fibroblasts (CEF) or cell-free virus suspensions made from sonicated CEF infected with vaccine strains of Marek's disease virus (MDV).
Two major difficulties in working with MDV are the strongly cell associated nature of the virus and the lack a sustainable cell culture system amenable to productive (lytic) infections. Primary CEF and DEF are permissive for MDV replication. However, these cultures have a finite life span (approximately 3 weeks), thus necessitating passage of infected primary cells onto an uninfected cell monolayer to propagate MDV and to obtain sufficient quantities of virus with which to work. Such conditions also preclude establishment of one-step growth experiments for effective temporal gene regulation studies. The finite life span of CEF and DEF also make positive selection in mutagenesis studies difficult.
The poultry industry has always recognized the need for continuous avian cell lines that could be used in producing Marek's disease vaccines and simplify development of recombinant MDV vectors for polyvalent vaccines. Although many avian cell lines have been developed (Nazarian, K., An updated list of avian cell lines and transplantable tumors. Avian Path. 12:527-544 (1987)), none of these can substitute for CEF cells in vaccine production. Previous cell lines failed because they were either derived from virally transformed cells or, if derived from chemically transformed cells, the cells produced tumors when inoculated into chickens. Since there are no sustainable cell lines suitable for propagating MDV, the MDV vaccine industry uses primary chicken embryo fibroblasts (CEF) for production of vaccine virus (Churchill, A. E., Production of Vaccines. In "Marek's Disease: Scientific Basis and Methods of Control" (Payne, L. N., ed.), pp. 251-265. Marinus Nijhoff Publishing, Boston, Massachusetts (1985)). Since primary CEFs have a finite life span, they must be prepared every week, increasing costs for producing MDV vaccines. For example, one major United States MDV vaccine producer utilizes 25,000 chick embryos every week. It is estimated that costs associated with purchase and preparation of chick embryos accounts for 40 to 45% of the total cost of MDV vaccine production. A significant reduction in MDV vaccine production costs could be realized if a continuous cell line suitable for vaccine production were established. Requirements for such a cell line are: 1) The cell line can not be virally transformed, 2) Chemically transformed cell lines must be incapable of inducing tumors in vaccinated chickens, and 3) Virus titers produced by such a cell line must be equivalent (or nearly so) to titers obtained through infection of primary cells.
Development of a continuous cell line which would support MDV replication would alleviate many of the difficulties associated with MDV experimentation and vaccine production.

Sustainable chick cell line infected with marek's disease virus

Board of Trustees operating Michigan State University


A system is disclosed that generates a data source representation using at least one data source. The system includes a set of services that synchronize the data source representation with the data source, or sources, from which the data source representation is generated. The system also includes a set of services that operate on a data source representation to access and manage information stored in a data source, or sources, from which the data source representation is generated.

In today's business environment, organizations consider information management critical to their success. Typically, organizations use computer application software to collect and manage data from varied sources. These sources include customer relations, financial planning, marketing, human resources and manufacturing. Traditionally, organizations have stored such data in heterogeneous systems and in varied formats. This has resulted in a tremendous amount of information being collected and stored in numerous diverse and often unconnected computer systems and databases. Furthermore, relationships between pieces of data in varied formats and among heterogonous databases are typically inadequate or difficult in establishing. As a result, critical business and management decisions are often made based on an incomplete set of information.

Knowledge repository system for computing devices


An active matrix liquid crystal display improves its contrast by suppressing irregularity of an alignment film caused by video lines thereby reducing reverse regions on a display electrode. The active matrix liquid crystal display has first and second opposite substrates, a video line, an active element and a display electrode which are directly or indirectly formed on the first substrate, and an alignment film which is formed on or above the video line, the active element and the display electrode. The alignment film is so formed that is surface is at an angle of inclination of not more than 10.5.degree. with respect to the display electrode surface between the video line and the display electrode.

1. Field of the Invention
The present invention relates to an active matrix liquid crystal display which is applied to an office automation apparatus or a measuring instrument as a display.
2. Description of the Background Art
A liquid crystal display may present such a phenomenon, called reversal, that a region exhibiting orientation which is different from that in a display electrode, i.e., a reverse region, is formed around the display electrode to reduce the contrast of the liquid crystal display.
As to the reversal of a simple matrix liquid crystal display, known are such a phenomenon that strip-shaped reverse regions extending from a display electrode in three directions are formed by an electric field which obliquely extends between opposite electrodes (Japanese Patent Laying-Open No. 55-74517 (1980)), and a phenomenon causing strip-shaped reverse regions along two sides of a display electrode on its inclined surfaces (Japanese Patent Laying-Open No. 58-50514 (1983)).
On the other hand, a method of preparing a liquid crystal display including a step of rubbing an alignment film from a display electrode toward an active element (Japanese Patent Laying-Open No. 60-178425 (1985)) is proposed as a method of eliminating a reverse region in an active matrix liquid crystal display.
Even if the method described in this prior art is employed, however, the reversal in the active matrix liquid crystal display is not necessarily completely eliminated.

Active matrix liquid crystal display having alignment film with inclined surface


Here is disclosed an attachment for a golf tee improved to support a golf ball above a top face of the golf tee. An attachment constructed to be mounted on a head of a golf tee has a first annular segment having a generally inverted cone shape that is cut off at the top and adapted to be close round a peripheral surface of the head of the golf tee, a cylindrical second annular segment extending downward from a lower end of the first annular segment for partially surrounding a leg of the golf tee, and an elastically deformable supporting segment extending upward from an upper end of the first annular segment so as to support the golf ball with an upper distal end thereof. The first annular segment is formed with elastically deformable tongues and each of these tongues is formed on an inner surface thereof with a salience adapted to come in contact with a top face of the golf tee from above.

The present invention relates to an attachment used in combination with a golf tee to support a golf ball.
Conventional woody or plastic tees from which golf balls are driven off typically comprise a generally inverted cone-shaped head and a leg extending downward from a lower end of the head so that the leg may be fixed into the ground and the golf ball may be placed on the head immediately before the golf ball is driven from the tee. The golf tee disclosed in Japanese Unexamined Patent Application Publication No. 1992-189374 (hereinafter referred to as "Citation") comprises a support column member destined to be fixed in the ground, a seat member adapted to be engaged with a top of the support column member and a plurality of supporting arms arranged along a circumference of the seat member and functioning as springs. According to the disclosure of Citation, this golf tee advantageously limits a total area over which the golf ball rests in contact with the supporting arms to upper ends of the respective supporting arms and thereby remarkably alleviates a contact resistance exerted by the golf tee upon the golf ball at the moment of driving off. Correspondingly, carry of the golf ball is improved.
In the case of the golf tee disclosed in Citation, the support column member is formed on an outer peripheral surface thereof with a groove extending in the circumferential direction and the seat member is formed on an inner peripheral surface thereof with a ridge extending in the circumferential direction. The support column member is integrated with the seat member by forcibly engaging the ridge with the groove. Consequentially, such seat member adapted to be combined with the support column member in this manner can not be used with the commercially available golf tees.


The present invention provides personal cleaning articles useful for cleaning and/or exfoliating the skin. These articles provide multiple distinct patterns of relatively smooth and coarse elements to provide a user the ability to readily achieve the desired degree of cleansing and/or exfoliation. Further, the article provides a relatively smooth apertured outer layer and a relatively coarse underlying layer whereby a user can, with the application of varied amounts of pressure, more readily achieve and control a wider range of mechanical cleaning and/or exfoliating action against the skin. In certain aspects, the article may also be impregnated with one or more topical skin cleaning and/or exfoliating compounds.

Various disposable or single-use personal care cleaning articles are known and available today. Such articles are commonly used to remove dirt, oils, make-up as well as other undesirable matter from the body. In addition to basic personal cleaning, articles are also available that provide a deeper cleaning of the skin (epidermis) and that more effectively remove dead skin cells (corneocytes) from the outer most layer of the skin (stratus corneum). This process of removing dead skin cells from the outer most layer of the skin is commonly referred to as exfoliating. One of the perceived benefits from exfoliating is that a user's exfoliated skin appears fresh and healthy after the outer dull looking layer of dead skin cells are removed. The skin is constantly replenishing itself and producing new layers of dead skin cells. Thus, exfoliation is a process frequently utilized by many users. Exfoliating has long been accomplished through the use of relatively abrasive material such as a loofa or pumice. However, such highly abrasive materials can cause irritation and discomfort for many users. In addition, such traditional articles often fail to adequately remove residue from the skin formed or liberated in the process.
Less abrasive cleansing articles are known such as through the use of polymeric netting or sheet materials having polymer nodules thereon; by way of example such materials are described in U.S. Pat. No. 5,594,970 to Serge and US2003/0031703 McMeekin et al. In addition, there also exist two-sided cleanings pads that enable the user to choose between relatively rough and smooth sides. Examples of such two-sided pads are described in U.S. Pat. No. 5,744,149 Girardot, U.S. Pat. No. 7,488,697 Louis bit Picard et al., and US2007/0098768 Close et al. However, the desired level of roughness or mechanical scrubbing action an article provides can vary significantly from user to user. In addition, the desired level of cleaning and/or exfoliating may frequently vary according to the user's experience on a given day; e.g. intense exercise, exposure to high levels of dirt or grime, sun exposure, the use of certain types of make-up and so forth. Furthermore, many individual users have what are perceived to be localized problem areas and therefore desire differing levels of roughness or mechanical scrubbing action for different regions of their face or body. Thus, existing pads fail to provide the wide range of variation and control desired by many users.
Therefore, there exists a need for a single-use or limited-use cleaning article that provides the user with the ability to easily obtain numerous different levels of roughness and/or mechanical scrubbing action. Further, there exists a need for a cleaning article that both effectively dislodges foreign or unwanted matter and that also effectively removes the same from the user's skin. Still further, there exists a need for such a pad with improved handleability in order to enable the user to fully utilize the pad and more easily achieve the desired treatment.


A FIFO buffer in which respective portions are controlled in a distributed manner is provided. In the FIFO buffer, a number of loop circuits having delay elements are provided in which respective loop circuits are connected to one another in cascade manner. Additionally provided are a number of traffic control units for controlling the signal traffic between respective neighboring loop circuits. In the case where no signal is fed back to a traffic control unit from the output side and also a new signal is transmitted thereto from the input side, the traffic control unit transmits the new signal to the loop circuit which is on the output side. In the case where any signal is fed back to a traffic control unit from the output side and also a new signal is transmitted thereto from the input side, the traffic control unit again transmits the fed-back signal to the loop circuit which is on the output side and transmits the new signal to the loop circuit which is on the input side. In the case where any signal is fed back to a traffic control means from the output side and also no signal is transmitted thereto from the input side, the traffic control means transmits again the fed-back signal to the loop circuit which is on the output side.

Field of the Invention
The present invention relates to FIFO (First In First Out) buffers used for signal processing, and more particularly relates to the optical FIFO buffers used for optical signal processing, for example, optical computing, optical packet switching and the like.
Prior Art
Recently, optical technology has been introduced into signal processing performed in various fields, for example, communications, computing, packet switching and the like, the performance of which is thereby greatly improved.
In these signal processings, the case is often encountered in which a processing system cannot accept incoming signals continuously supplied from other devices connected thereto. In addition, a signal collision in which two different signals are simultaneously supplied to the same node may occur, whereby the functions to be achieved by the respective signals cannot be achieved. In order to prevent these problems, the input timing at which signals are supplied to the processing system must be controlled based on the current state of the processing system. For this reason, delay operations or buffering operations are used for various signal processing systems.
FIG. 12 shows an example of a conventional delay circuit using optical fiber delay lines. In FIG. 12, CA.sub.0 through CA.sub.n-1 respectively designate 2.times.2 optical couplers. To these 2.times.2 optical couplers CA.sub.0 through CA.sub.n-1, fiber delay lines LA.sub.0 through LA.sub.n-1 are respectively connected, wherein the fiber delay lines LA.sub.0 through LA.sub.n-1 respectively have propagation delay times 2.sup.0 T through 2.sup.n-1 T (T is a constant). In addition, to the 2.times.2 optical coupler CA.sub.0 through CA.sub.n-1, delay designation signals X.sub.0 through X.sub.n-1 are respectively supplied. In the case where the delay designation signal X.sub.i is active, a signal which comes into the 2.times.2 optical coupler CA.sub.i is delayed by passing through the fiber delay line LA.sub.i, after which the delayed signal is outputted from the 2.times.2 optical coupler CA.sub.i. In contrast, in the case where the delay designation signal X.sub.i is not active, a signal which comes into the 2.times.2 optical coupler CA.sub.i is directly outputted without passing through the fiber delay line LA.sub.i. With this delay circuit, the input timing at which signals are supplied to the processing system can be controlled among (2.sup.n -1 )T through 0 based on the delay designation signals X.sub.0 through X.sub.n-1.
By using a configuration similar to that shown in FIG. 12, a FIFO buffer can be constituted as shown in FIG. 13. In FIG. 13, CB.sub.0 through CB.sub.n-1 respectively designate 2.times.2 optical switches, wherein the 2.times.2 optical switches CB.sub.0 through CB.sub.n-1 are connected together in a cascade manner. To these 2.times.2 optical couplers CB.sub.0 through CB.sub.n-1, fiber delay lines LB.sub.0 through LB.sub.n-1 are respectively connected, wherein the fiber delay lines LB.sub.0 through LB.sub.n-1 have the same propagation delay time. Each 2.times.2 optical switch CB.sub.i and fiber delay line LB.sub.i connected therewith constitute a fiber loop memory for holding an optical signal which comes thereto. New incoming signals are sequentially supplied to the input terminal of the first stage 2.times.2 optical switch CB.sub.n-1 which is inserted in the first stage fiber loop memory. The output signals are picked up from the last stage 2.times.2 optical switch CB.sub.0 inserted in the last stage fiber loop memory, after the output signals are sequentially supplied to a device connected to the FIFO buffer. Hereinafter, a device which accepts the signals supplied from the FIFO buffer will be called a "continued device". A control unit (not shown) usually monitors the status of respective stage fiber loop memories and the status of the continued device. Based on the detected status, the control unit supplies traffic control signals Y.sub.0 through Y.sub.n-1 respectively to the 2.times.2 optical switches CB.sub.0 through CB.sub.n-1, whereby the input/output operation and holding operation of each fiber loop memory is controlled. By this control, the new incoming signal automatically propagates through the fiber loop memories which hold no signals, after which the incoming signal is automatically held in the fiber loop memory which is the nearest stage to the last stage and holds no signal. In addition, when the continued device can accept signals, the signal held in the last stage fiber loop memory is picked up from the 2.times.2 optical switch CB.sub.n-1, after which the picked up signal is supplied to the continued device. In the above-described FIFO buffer, the operations of respective portions provided in the FIFO buffer are controlled by the control unit in an integrated manner, the signals are automatically held and pass through the FIFO buffer, after which the signals are supplied to the continued device at the preferable timing at which the continued device can accept and process the incoming signals. However, a problem occurs in that the timing control in which the control unit supplies the traffic control signals is extremely critical so that normal signal traffic cannot be obtained in the FIFO buffer without exact timing adjustment.

Nippon Telegraph and Telephone Corporation


A method transforms a generalized parity check matrix representing a linear block binary code. First, an input generalized parity check matrix is defined for the linear block binary code. Auxiliary sets are formed from the input generalized parity check matrix and organized into a partially ordered set. The subsets of each auxiliary set are ordered in a list, and parity check equations are constructed from the list of ordered subsets. The parity check equations are translated into an output generalized parity check matrix, which can be used to decode a message encoded according to the linear block binary code.

A fundamental problem in the field of data storage and communication is the development of practical decoding methods for error-correcting codes (ECC), see Lin et al., "Error Control Coding: Fundamentals and Applications," Prentice Hall: Englewood Cliffs, N.J., 1983, Peterson et al., "Error-Correcting Codes," 2nd edition, MIT Press: Cambridge, Mass., 1972, and MacWilliams et al., "The Theory of Error-Correcting Codes," North-Holland: New York, N.Y., 1977.
An important class of such decoding methods include the prior art iterative decoding methods exemplified by the a posteriori probability propagation (APP) decoding method, and the belief propagation (BP) decoding method, which is also known as the "sum-product" decoding method. A large variety of other related decoded methods are based on simplifications or other alterations of the APP or BP decoding methods. A collection of papers on these decoding methods is contained in the "Special Issue on Codes on Graphs and Iterative Algorithms," IEEE Transactions on Information Theory, 47(2), February 2001.
These decoding methods use a representation of the code, which is specified by a generalized parity check (GPC) matrix, see Mackay, "Relationships between Sparse Graph Codes," Proceedings of IBIS 2000. The decoding performance of these methods normally depends on the GPC matrix used to represent the code.
Basic Definitions for Binary Linear Block Error-Correcting Codes
Any references to "codes" herein specifically mean binary linear block error-correcting codes. The basic idea behind these codes is to encode messages of k bits using blocks of N bits, where N>k. The additional N−k bits are used to decode corrupted messages. Corruption can be caused by failure in the storage media or noise in the transmission channel.
A code C is defined by set of 2k possible blocks of code words having a bit length N. A code with parameters N and k is often referred to as an (N, k) code. Codes are normally much more effective when N and k are large. However, as the size of the parameters N and k increase, so does the difficulty of decoding corrupted messages.
Generalized Parity Check GPC Matrices
A binary block code is "linear" if the modulo 2 sum of any two code-words also is a code-word. For example, the modulo 2 sum of 1110100 and 0111010 is 1001110. When a binary block code is linear, the modulo 2 sum of any two code-words form another code-word. Linear codes can be represented by a generalized parity check (GPC) matrix. In fact, a linear code may be represented by many different GPC matrices.
The GPC matrix representing an (n, k) code is defined by a matrix of 1's and 0's, with M rows and N columns, where N≧n. The columns of the GPC matrix are arranged so that the first n columns correspond to the n bits of the code. The remaining N−n columns correspond to "state variable bits" that help define the code. These state variable bits are sometimes referred to as "hidden bits" or "auxiliary bits." The value of n must be specified along with the N by M matrix to fully specify a code using the GPC matrix.
Each row of the GPC matrix represents a parity check constraint. The bits involved in the constraint represented by a particular row correspond to the columns that have a 1 in that row. The parity check constraint enforces that the sum of the bits must be even, or equivalently 0 when summed modulo 2. For example, a GPC matrix with N=7
                    [                                            1                                      1                                      1                                      0                                      1                                      0                                      0                                                          0                                      1                                      1                                      1                                      0                                      1                                      0                                                          0                                      0                                      1                                      1                                      1                                      0                                      1                                      ]                            (        1        )
represents three constraintsx1⊕x2⊕x3⊕x5=0  (2)x2⊕x3⊕x4⊕x6=0  (3)x3⊕x4⊕x5⊕x7=0,  (4)
where the variable xi represents the value of the ith bit, which can be 0 or 1, and the symbol ⊕ represents the modulo 2 sum. This GPC matrix is one way to represent the well-known Hamming (7, 4) code. This code is used an example code transformed below according to the invention.
Some of the M different constraints represented by the GPC matrix may be linearly dependent. In the GPC matrices given in equations (1) and (5), all the constraints are linearly independent. Another representation for the same code is a GPC matrix with N=n=7
                              [                                                    1                                            1                                            1                                            0                                            1                                            0                                            0                                                                    0                                            1                                            1                                            1                                            0                                            1                                            0                                                                    0                                            0                                            1                                            1                                            1                                            0                                            1                                                                    1                                            0                                            0                                            1                                            1                                            1                                            0                                                                    0                                            1                                            0                                            0                                            1                                            1                                            1                                                                    1                                            0                                            1                                            0                                            0                                            1                                            1                                                                    1                                            1                                            0                                            1                                            0                                            0                                            1                                              ]                .                            (        5        )
In this GPC matrix, the last four rows can be obtained by adding together combinations of the first three rows. This implies that the last four rows are merely redundant constraints, and there are actually only three linearly independent rows. For example, the fourth row can be obtained by adding together the first two rows. For this GPC matrix, there are three linearly independent rows. In general, there will be N−k linearly independent rows in an M by N GPC matrix representation of an (n, k) code.
The GPC matrices given in equations (1) and (5) did not use any hidden bits. Another GPC matrix that uses hidden bits and represents the same code is the GPC matrix, with N=11 and n=7,
                              [                                                    1                                            0                                            0                                            0                                            0                                            0                                            0                                            1                                            0                                            0                                            0                                                                    0                                            1                                            0                                            0                                            0                                            0                                            0                                            0                                            1                                            0                                            0                                                                    0                                            0                                            1                                            0                                            0                                            0                                            0                                            1                                            0                                            1                                            0                                                                    0                                            0                                            0                                            1                                            0                                            0                                            0                                            1                                            1                                            0                                            1                                                                    0                                            0                                            0                                            0                                            1                                            0                                            0                                            0                                            1                                            1                                            0                                                                    0                                            0                                            0                                            0                                            0                                            1                                            0                                            0                                            0                                            1                                            1                                                                    0                                            0                                            0                                            0                                            0                                            0                                            1                                            0                                            0                                            0                                            1                                              ]                .                            (        6        )            Decoding Methods Based on GPC Matrices
As stated above, prior-art decoding methods that utilize a representation of a code by a GPC matrix include the a posteriori probability propagation (APP) decoding method, belief propagation (BP), and the "sum-product" decoding method. If the same code is represented using two different GPC matrices, then the performance of these decoding methods is also different.
Often, the performance of decoding methods is measured in comparison with an optimal decoder that uses a maximum likelihood (ML) method. The ML decoder scans through all 2k possible code-words, and selects the one that is most likely to have been transmitted. However, the ML decoding method is not practical when k is large.
Generally speaking, the BP decoding method performs somewhat better than the APP decoding method, but at a cost in computational complexity. Other decoding methods based on these methods typically involve a similar trade-off between performance and complexity, but as a class, these decoding methods are considered to be practical for codes with large N and k.
Generally, the iterative decoding methods based on or similar to the BP and APP decoding methods perform reasonably close to ML decoding with GPC matrices that satisfy the following constraints: the number of 1's in each row is small; the number of rows is large; and the number of columns that have a 1 in both rows is small, i.e., ideally zero or one, for any two rows in the matrix.
Many codes, e.g., low-density parity check (LDPC) codes, first described by Gallager, in "Low-density parity check codes," Vol.21, Research Monograph Series, MIT Press, 1963 or irregular repeat-accumulate (IRA) codes, described by Khandkar et al., in "Irregular Repeat-Accumulate Codes," 2nd International Symposium on Turbo codes and Related Topics, pp. 1–8, 2000, are designed so that their GPC matrices have these characteristics, insofar as possible. The BP and APP decoding methods work quite well for these codes.
Some codes, e.g., one-step majority logic decodable codes, were designed to use other criteria, but have GPC matrix representations appropriate for BP or APP decoding. The performance of the BP and APP decoding methods is also good for these codes, see Lucas et al., "Iterative Decoding of One-Step Majority Logic Decodable Codes Based on Belief Propagation," IEEE Transactions on Communications, vol. COM-48, pp. 931–937, 2000.
Other classical codes such as Bose, Chaudhuri, and Hocquenghen (BCH) codes, and codes based on Euclidean or projective geometries also work well with ML decoding and have known GPC matrix representations. However, the known GPC matrix representations for these classical codes do not satisfy the three constraints above, and therefore iterative decoding methods perform poorly.
Therefore, there is a need for a method to transform a GPC matrix representation of a code into another GPC matrix representation of the same code. More particularly, it is desired to transform a GPC matrix representation so that the transformed GPC matrix works better than the original matrix when used with iterative decoding methods.

Transforming generalized parity check matrices for error-correcting codes

Mitsubishi Electric Research Laboratories, Inc


A remote call notification system for incoming calls to a wireless telecommunications device. The system includes a switch, a service control point, an intelligent server, a monitoring module, and a wireless terminating trigger used on a mobile switching center. All components are in communication with each other. The remote call notification is transmitted to a remote communication device such as a PC, an interactive pager, and a mobile phone. The call notification includes a calling number, the name of a calling party, time and date identifiers, status identifiers that provides a real-time status of the incoming communication, a disposition identifier, and a priority identifier. A remote call notification method including detecting an incoming communication to a subscriber's wireless communication device, creating a remote call notification, assigning an access address associated with a remote communication device, and forwarding the remote call notification to the remote communication device.

1. Field of the Invention
This invention relates generally to the field of communications. More particularly, this invention manages detailed information about all incoming communications to and all outgoing communications from a wireless communications device, such as a cellular phone connected to the Cellular Mobile Telephone Network (CMTN), and delivers this information to a wireless communications device, such as an alphanumeric pager.
2. Description of the Related Art
The field of telecommunications has experienced explosive growth, and more growth is planned as telecommunication access and numerous communication devices improve. This explosive growth is revolutionizing message notification and similar services. For example, U.S. Pat. No. 6,006,087 discloses a method and system for delivering a voice mail notification of a voice message left on a user's wireless service network. When a message is left in a user's mailbox assigned to the user's cellular phone, the voice mail system generates a voice mail notification that includes a calling number, the name of the calling party, and an index listing various messages so that a user can scroll through the messages and choose a desired message to retrieve and play. The voice mail notification is forwarded to and displayed by the cellular phone operated by a user.
In today's telecommunications world, it is commonplace for users to have multiple wired (i.e., landline) and wireless communications devices connected to various global telecommunications networks. For example, a user may have a first phone number assigned to a residential landline telephone, a second phone number assigned to a business telephone, a third phone number assigned to a mobile phone, and a fourth phone number assigned to a wireless paging device. Thus, many users have multiple wired and wireless devices with each device having a different phone number and with each device connected to different messaging systems and to different communications networks.
When an incoming communication is placed to a particular communications device, a user typically has no way of knowing about that incoming communication if the user is away from the communications device. Using a conventional approach, when a message is left on a messaging system assigned to a particular communication device, the messaging system causes the associated communications network to set the message waiting indicator on the called communications device; however, it is incapable of setting detailed messaging information on the user's other additional communications devices (wired and wireless). For example, when a message is left on a user's mobile phone messaging network, the user's paging device is incapable of providing detailed messaging information associated with the message left on the mobile phone messaging network. Since the purpose of having multiple communication devices is to allow a user to maintain constant communication, conventional approaches fall short by not being able to provide the ability to deliver detailed messaging information across all communication devices. Within the prior art, users have attempted to overcome this deficiency by utilizing a feature in voice mail systems referred to as outbound calling. An outbound calling feature allows a user to designate a telephone number (that may be assigned to a different communications device) that is dialed by the voice mail system during a fixed time period if a message is waiting for the user in the voice mail system.
Using this approach, users have also designated pagers' phone numbers as the number to be called for the outbound calling, or, have designated the telephone number of a wireless or landline telephone. One problem associated with designating a pager as the device to be called by the outbound calling is that it requires a user to carry both a pager to receive a general notification and a cellular phone to receive the detailed information. One problem associated with directing calls from the outbound calling feature to a wireless phone or a landline phone is that the user may not wish to access or to be bothered by all detailed message notifications.
In addition to receiving real-time information related to messages received and stored in a voice mail system, A user may also desire to know about all incoming communications to a communications device, such as a cellular telephone. For example, a user may desire to know if an incoming communication is being answered, if it receives a busy signal, if it is terminated, if it is forwarded to a different communications device (i.e., there currently isn't any way for a user to know about all incoming communications when a line is ringing, answered, busy, etc., with detailed call information).
Users who miss calls would like a way to know who has called them and whether or not that caller left a message. A user can obtain this information in a proactive way by calling their voice mail systems/answering machines at will and determining whether there are any messages. However, this does not provide a complete list of who has called them, just who left a message. Some Customer Premises Equipment (CPE) is capable of paging a user when an incoming call arrives, but this is limited to a pre-programmed set of callers they wish to be notified about. CPE is used to refer to equipment that a customer connects to the telephone system. Moreover, CPE does not announce the Calling Name delivery (CNAM) and Caller Identification (ID) because of the expense involved in doing so. Also, the duration of a call that does not terminate at the customer's premises is unknown by the CPE (for example, the call went to voice mail).
Thus, there is a current need for systems and methods for selecting, retrieving, storing, and managing detailed information related to all incoming communications to and all outgoing communications from a landline communications device. There is a further need to efficiently deliver this information to a remote communications device in order to provide real time and quasi-real time detailed message notification and similar information. There is still a further need to forward the communication or its equivalent to the remote communications device. Finally, there is a need to harmonize such information associated with multiple landline communications devices using different messaging systems.

Method for using AIN to deliver caller ID to text/alpha-numeric pagers as well as other wireless devices, for calls delivered to wireless network

AT&T Delaware Intellectual Property, Inc.


A system and method for providing digital audio services is described. One embodiment is a method for proving digital audio services, comprising receiving, using a communications interface, an audio stream from a content provider; determining a timestamp for a first audio stream segment; determining a timestamp for a second audio stream segment; updating a playlist with a representation of the audio stream; receiving a query for content information; and sending offer information, in response to receiving the query for content information.

Current portable interactive devices can be used to tag and identify audio via fingerprinting, speech recognition, or other listening techniques. Some devices have streamlined the process somewhat by automatically obtaining the radio frequency of a broadcaster so that RDS data identifying songs can be captured. Those devices employ a radio feedback loop or "sweeping" to obtain the radio frequency that the device originally receiving the broadcast is set to. However, those devices require a second radio transceiver, in addition to the device originally receiving the broadcast. Some inaccuracies can result, for example, when more than one broadcaster broadcasts the same or highly similar content.

Apparatus, system, and method for audio based browser cookies


A method is described that includes contacting an olefin with a catalyst in a polymerization reactor, polymerizing at least a portion of the olefin to form an alpha olefin reaction product, detecting a condition within the polymerization reactor, determining an average temperature of at least one olefin product particle based on the condition, determining an operating particle temperature threshold using a foul curve, comparing the average temperature of the polymer particle to the operating particle temperature threshold, changing one or more operating parameters in response to the comparing, and maintaining the average temperature of the olefin polymer particle at or below the operating particle temperature threshold in response to changing the one or more operating parameters. The alpha olefin reaction product includes a plurality of olefin polymer particles, and the polymerization reactor includes a reaction mixture that includes the olefin, the catalyst, a diluent, and the alpha olefin reaction product.

Polyolefins such as polyethylene and polypropylene may be prepared by a variety of polymerization process such as gas phase reactions, slurry polymerization, solution polymerization, and the like. In a slurry polymerization process, feed materials such as diluent, monomer and catalyst are introduced to a reaction zone, forming a slurry in the reaction zone. In continuous loop reactors, the slurry circulates through the reaction zone, and the monomer reacts at the catalyst in a polymerization reaction. The polymerization reaction yields solid polyolefins in the slurry. A polymerization product having solid polyolefins is then transferred from the reactor and separated to recover the solid polyolefins.

Temperature control for polymerizing particulate polyolefin


An entertainment system, having a capability to playback a stored digital video record that includes frames of video data received from a television broadcast system, approximates ranges of frames in a digital video record that are either commercials or non-commercials. The system also approximates frames that are either a beginning or an ending of a commercial or a non-commercial. The system then associates as a commercial two of the approximated frames that are a beginning or an ending of a commercial or a non-commercial and one or more of the approximated ranges there between until a predetermined percentage of the playback time of the digital video record is taken up by the associated commercials.

Traditionally, during television programs, viewers have been limited in the ability to control the content of a program being viewed. For example, during a television commercial segment or any other segment that may not be of immediate interest, viewers have been either forced to view the entire segment or change the channel and wait for the segment to conclude. The advent of video cassette recorders (VCRs) allowed viewers greater control over the content of segments when the program was pre-recorded. In recent years some VCR systems have included a relatively unsophisticated one-touch commercial skip feature. The feature consists of little more than a mechanism for automatically fast-forwarding the playback of video data by thirty seconds. By pushing a single button, the VCR automatically advances the video tape by the estimated length of an average commercial segment. While this feature introduces the convenience of a one-touch skip, the length of the skip does not always correspond with the length of a segment that is not of immediate interest to the viewer and is particularly ill-suited for identifying many program transitions that do not have predictable durations.
The advent of digital video formats has allowed for many conveniences not considered practical for a traditional VCR system. Such digital video formats, in particular the Moving Pictures Experts Group (MPEG) and other video compression formats, allow for more sophisticated segment skips. For example, a viewer using a digital video data system that records digital video data in a digital video record on a hard disk or another mass storage device may skip or replay to predetermined scenes, without the time consuming fast forward or rewind of a video tape.
Although digital video systems can more conveniently jump from one portion of a video program to another without having to physically advance a tape, conventional digital video data systems have also generally been capable of advancing between video segments at predetermined increments, such as at thirty-second intervals. Thus, viewers of recorded video data, whether using VCR systems or digital video data systems, have generally been constrained to advancing the video playback in certain, restrictive ways. For instance, the viewer can cause the playback to be skipped ahead by thirty seconds. Alternatively, viewers who wish to advance the playback of a video program past one or more commercials to the beginning of the next non-commercial segment have been forced to place the VCR or digital video data system in a fast-forward mode and then visually identify, by trial and error, the position that represents a segment transition. Accordingly, for entertainment systems that are capable of playing back a stored video program received from a television broadcast system, there is a need for a technique to identify the presence of the one or more commercials in the digital video record so that a playback of the digital video record can use this identified presence during any playback thereof.


An electronic device is formed by forming a first and second layer overlying a plurality of transistor locations. An etch is performed to remove portions of the first and second layers to expose a portion of the plurality of transistor locations, while other portions of the first and second layer remain to protect other transistor locations. Subsequently, source/drain locations of the exposed transistor locations are etched along with the remaining portion of the second layer. The etch is substantially terminated by removing the portion of the second layer using an end-point detection technique involving the first layer. Subsequently an epitaxial layer is formed in the source/drain recesses to provide stress on a channel region of the transistor locations.

1. Field of the Disclosure
The present disclosure relates to electronic devices and processes for forming them, and more particularly to electronic devices including epitaxially formed source/drain regions.
2. Description of the Related Art
The etch of source/drain regions can be used to clean source/drain regions or to form recesses within which subsequent epitaxial layer can be formed. The etch process may be used on NMOS and PMOS transistors locations independent of each other. Formation of a protective layer, such as oxide layer, over the transistor locations not being processed allows the processing on exposed transistor locations to proceed. The use of timed etches with the use of protective layers have shown to result in surface loading effects that cause locally increased etch rates that are hard to control and result in recess variations amongst source/drain regions. These recess variations can be tolerable where bulk substrates are used, but can result in bottoming-out where relatively thin active layers are available, such as with silicon-on-insulator substrates. Another problem occurs during removal of the layer used to protect wafer portions not being processed because the exposed transistor locations, which were just etched, are further subjected to the chemistries used to remove the protective layer thereby potentially damaging the exposed transistor locations. A process of providing greater control in the etching of source/drain regions to overcome these problems would be useful.
It will be appreciated that elements in the figures are illustrated for simplicity and clarity and have not necessarily been drawn to scale. For example, the dimensions of some of the elements in the figures may be exaggerated relative to other elements to help to improve understanding of embodiments.


A compound of formula:

Src homology 2 (SH2) domains selectively bind to phosphotyrosyl (pTyr)-containing regions of target proteins. SH2 binding can result in the modulation of c-src activity (Cooper et al., Cell 73: 1051-1054 (1993)), the alteration of the substrate specificity of c-abl proto-oncoproteins (Mayer et al., Mol. Cell. Biol. 14: 2883-2894 (1994); Feller et al., Trends Biochem. Sci. 19: 453-458 (1994)) and the transduction of signals initiated at growth factor receptors (Margolis et al., J. Am. Soc. Nephrol. 5: 1288-1299 (1994)) and cellular attachment systems (Schlaepfer et al., Nature 372: 786-791 (1994)). Thus, the SH2 domain has been suggested to be a promising site for therapeutic intervention (Brugge, Science 260: 918-919 (1993)).
The SH2 domain of growth factor receptor-bound protein 2 (Grb2), a 24 kda intracellular carrier agent that is composed of one SH2 domain and two src homology 3 (SH3) domains, mediates cellular signaling by binding pTyr-containing motifs within several proteins, although the Grb2 SH2 domain also can bind to proteins that do not contain pTyr (Oligino et al., J. Biol. Chem. 272: 29046-29052 (1997)). Such proteins include the adapter protein SHC (via p52 binding; Pelicci et al., Cell 70: 93-104 (1992); Rozakis-Adcock et al., Nature 360: 689-692 (1992); Sastry et al., Oncogene 11: 1107-1112 (1995); Janes et al., Oncogene 9: 3601-3608 (1994); Daly et al., Oncogene 9: 2723-2727 (1994)), growth factor receptors, such as epidermal growth factor receptors (EGFR) and their oncogenic analog receptors, the erbB receptors (Rozakis-Adcock et al. (1992), supra; Lowenstein et al., Cell 70: 431-442 (1992); Gale et al., Nature 363: 88-92 (1993); Buday et al., Cell 73: 611-620 (1993); Egan et al., Nature 363: 45-51 (1993)), in particular erbB2 (HER-2 or neu; via p185 binding; Sastry et al. (1995), supra; Janes et al. (1994), supra; Daly et al. (1994), supra; Xie et al., J. Biol. Chem. 270: 30717-30724 (1995); Gishizky et al., PNAS USA 92: 10889-10893 (1995)), morphology-determining proteins, such as cytoplasmic focal adhesion protein-tyrosine kinase (FAK; Schlaepfer et al. (1994), supra), and cellular oncoproteins, such as BCR-abl (Gale et al. (1993), supra; Pendergast et al., Cell 75: 175-185 (1993); Xie et al. (1995), supra; Gishizky et al. (1995), supra).
The prevention of Grb2-mediated multiprotein assemblies is considered to be a promising therapeutic target for the development of antiproliferative agents directed to cells that over-express growth factor receptors. In this regard, a non-phosphorylated peptide containing 11 amino acids in which the side chains of the two terminal cysteine residues form a ring has been reported to bind selectively the SH2 domain of Grb2 (Oligino et al. (1997), supra). The cyclic structure and the size of the ring have been determined to be critical to the binding activity of the non-phosphorylated peptide, which has been designated G1. An equipotent redox-stable thioether cyclized analog, G1TE, also has been reported (Oligino et al. (1997), supra). Unfortunately, G1 and G1TE have receptor affinities that are substantially lower than a segment of the naturally phosphorylated ligand, i.e., SHC(pY317)-9-mer (IC50 of 10-25 μM and 10-15 μM, respectively, vs. 1.0 μM). Accordingly, the utility of G1 and G1TE in in vivo prophylactic and therapeutic applications is limited.
In view of the above, there remains a need for an effective inhibitor of binding of an SH2 domain in a protein comprising an SH2 domain to a target protein. Therefore, it is an object of the present invention to provide non-phosphorylated cyclic peptide inhibitors of SH2 domains to target proteins, such as the SH2 domain that exists in Grb2 protein, which are redox-stable in vivo and are characterized by receptor affinities that are substantially better than currently available cyclic peptide inhibitors of SH2 domains. It is another object of the present invention to provide conjugates of such cyclic peptide inhibitors in order to facilitate cellular internalization of active agents. It is yet another object of the present invention to provide a composition comprising (i) such an inhibitor or such a conjugate and (ii) a carrier. It is still yet another object of the present invention to provide a method of synthesizing such conjugates. A further object of the present invention is to provide methods of use of such inhibitors and conjugates thereof. These and other objects and advantages, as well as additional inventive features, will be apparent from the detailed description provided herein.

Redox-stable, non-phosphorylated cyclic peptide inhibitors of SH2 domain binding to target protein, conjugates thereof, compositions and methods of synthesis and use

Abstract: A compound of formula:

Abstract: in which (i) aa1 is Adi and aa4 is Glu or (ii) each of aa1 and aa4 is Adi, L is sulfur, sulfoxide, oxygen or methylene, which compound (and its conjugates) bind to an SH2 domain in a protein comprising an SH2 domain, is non-phosphorylated, is redox-stable in vivo, is characterized by an IC50 in vivo of less than about 4.0 μM with respect to the SH2 domain in Grb2, and, upon binding to the SH2 domain of Grb2, has a turn conformation. A conjugate comprising a compound as described above and a carrier agent, a composition comprising (i) a compound or a conjugate as described above and (ii) a carrier, a method of inhibiting binding of an SH2 domain in a protein comprising an SH2 domain to a target protein in an animal, wherein the SH2 domain is contacted with a target protein-binding inhibiting effective amount of a compound or a conjugate as described above, and a method of synthesizing such conjugates.

The United States of America, represented by the Secretary, Department of Health and Human Services


The present invention relates to an oil separator for separating oil from a gaseous medium discharged by a compressor. The oil separator includes an inlet for communication with the discharge outlet of a compressor, and first and second outlets. The first outlet allows separated refrigerant to escape the oil separator, and the second outlet allows separated oil to escape the oil separator. A tortuous path lies between the inlet and a first outlet, and is comprised of one or more enlarged regions and one or more narrow regions that are angularly situated with each other. The walls of the tortuous path provide surfaces on which the oil contained within the gaseous medium can be impinged, and thereby separated from the gaseous medium. The oil separator may also include a collection chamber and drainage pathways that communicate with the tortuous path. The oil separator can be a separate body that is attached to a compressor, or may be integrally formed by a housing of a compressor.

The present invention relates to an oil separator that separates suspended oil from a gaseous medium. More specifically, the invention relates to an oil separator that achieves oil separation via impingement.
In compressors typically used in refrigeration and air conditioning systems, such as swashplate type compressors, a mist containing lubricating oil suspended in the gaseous refrigerant medium is often output from the compressor. That is, the high pressure refrigerant expelled by operation of the compressor frequently comprises a mist containing droplets of oil used to lubricate the moving parts of the compressor. Due to differences in various physical properties between the oil and the refrigerant, any oil that remains suspended in the refrigerant as it travels throughout the refrigeration circuit can reduce the performance of the compressor and refrigeration system. For example, by reducing oil available to the moving parts of the compressor, the compressor is susceptible to increased wear and seizure potential.
To combat these problems, an oil separator can be added to the refrigeration circuit, and is typically positioned between the compressor outlet and condenser inlet. The oil separator functions to separate the suspended oil from the gaseous refrigerant. Considering the potential effects of oil being gradually removed from the compressor due to its suspension in the refrigerant output, there is a need to improve the state of the oil compressor art.
The present invention provides an oil separator that comprises an inlet, a first outlet, a second outlet, and an interior chamber defining a tortuous path between the inlet and first outlet. The tortuous path includes at least one enlarged region and at least one narrow region in communication with each other and angularly oriented towards each other. The enlarged region provides a first wall suitable for impingement by a gaseous medium containing suspended oil. The narrow region provides a second wall suitable for the same purpose. The oil separator may further include a collection chamber and drainage pathways.

Oil separator having a tortuous path disposed between an inlet and first outlet


The present disclosure relates to a system and method of use for storing and communicating information such as beverage preparation parameters including but not limited to beverage recipes, advertisements or operator information. The present disclosure provides a system which stores the information, communicates the information, and when appropriate, displays the information. The present disclosure also includes a method of using the described system. This disclosure provides a storage device which provides beverage brewing parameters used in beverage preparation.

This disclosure generally relates to a beverage preparation system and method of use. Particularly, the present disclosure envisions a beverage preparation system and method of use including a beverage maker interface which utilizes a storage device for storing information, such as beverage preparation parameters, including but not limited to a beverage recipe, and a communication device for one or two way communication with the storage device, such as reading the recipe or transferring recipe updates. Reference to beverage recipe in these examples includes the various parameters used in preparing a beverage.
In one example, the present disclosure envisions a beverage brewer which utilizes heated water to infuse a beverage brewing substance. The communication device coupled to the brewer receives recipe information from the storage device and transmits recipe information to the brewer to provide control of the brewer relating to the specific beverage brewing substance used in the brewing process.
By way of background, a variety of beverage brewing devices have been developed to control the parameters associated with the brewing process. Such devices include those manufactured by Bunn-O-Matic Corporation, the assignee of the present disclosure. For example, in U.S. Pat. No. 5,375,508 issued Dec. 27, 1994 to the assignee of the present application, a control system is provided for use with a beverage brewing apparatus. The control system is programmable to control numerous adjustable functions associated with the brewer. The control system stores at least one function limit for each of the functions which it controls. As such, it is generally known to provide programmable control of beverage brewing parameters and user control of such parameters.
U.S. Pat. No. 5,375,508 also considers and discloses ways to prevent or prohibit unauthorized parties from utilizing the controls. One of the embodiments is shown in the form of a detachable programmable module which physically removes the control from the brewer. Another version of a limited control, contemplated by this patent, is to functionally disconnect, as with the removable module, the control function to prevent unintended parties from utilizing the control function. By using a pass code or limited control function with a module attached to the brewer, the input device and its control functions are separated from selectively modifying the control circuits. The input device may be a control panel associated with the brewer, although not detachable from the brewer, but requiring a pass code to have access thereto. Such a control panel would act as a separate input device as a result of the functions providing separate functions from the brewing device.
Another embodiment of this disclosure is generally directed to a beverage substance dispenser, beverage maker or brewer and funnel interface and its method of use. More particularly, the disclosure contemplates an interface which utilizes a funnel which can be mounted on either a brewing substance dispenser, such as a coffee grinder, or a beverage maker, such as a coffee brewer, to communicate information regarding beverage batch size and/or type of beverage from the brewing substance dispenser to the beverage maker.
U.S. Pat. No. 5,186,399, which is assigned to the same assignee as the present application, describes a system of connecting a multiple batch size brewer and a dual hopper grinder in order to coordinate the amount of ground coffee with the selected brewing volume. This system might not be explicit regarding setting the switches on the coffee grinder and on the coffee brewer to achieve the desired results and confusion may result. This confusion may occur if the user is preoccupied or busy. Also, this system is complicated when a dual head coffee brewer is used with a dual hopper coffee grinder, and when a single coffee grinder services more than one coffee brewer. In addition, the grinding operation is generally much faster than a brewing cycle (seconds versus minutes). Consequently, it is feasible for one coffee grinder to service several coffee brewers. Due to the complexity and expense of the switching and interconnect cables, however, a maximum of two coffee brewers are used with the system disclosed in U.S. Pat. No. 5,186,399.
The parent and grandparent applications, U.S. patent applications Ser. Nos. 09/472,367 and 09/337,102, which are assigned to the same assignee as the present application, disclose a wireless grinder-brewer interface and its method of use. A selector on the funnel is set by a user to select beverage batch size and type. This information is wirelessly communicated to the grinder and to the brewer when the funnel is mounted thereon. When this type of system is used, it is possible for a user to unintentionally move the selector when the funnel is being moved from the grinder to the brewer, such that the information communicated to the brewer is incorrect.
The present disclosure provides an interface and method which overcomes the limitations found in the system disclosed in U.S. Pat. No. 5,186,399 and in the parent and grandparent applications, U.S. patent applications Ser. Nos. 09/472,367 and 09/337,102. Other features and advantages will become apparent upon a reading of the following specification, in combination with a study of the drawings.

This patent is subject to a terminal disclaimer.


A method for dependent trust in a computer system is provided. In this method, trust dependency relationships are defined among components of the computer system, specifying, for a component, which components it relies on in ensuring the integrity or confidentiality of its code or data. Subsequently, trust dependencies are resolved and the results are used in performing certain operations described in Trusted Computing Group standards including generating an attestation reply, sealing data, and unsealing data. In addition, methods for computing an integrity measurement for a Core Root of Trust for Measurement of a trust-dependent component are included. A system for dependent trust in a computer system is also described.

Computer systems are often comprised of components, where a component typically is embodied as an execution domain in which software may execute in isolation from other components, potentially affected by only the other components on which there is an acknowledged trust dependency. An example is a layered computer platform. With layering implemented in hardware, software, or a combination of hardware and software, each layer will consist of one or more components. The layered computer platform architecture is often constructed with a hierarchical privilege model. Each layer is more privileged than the layers above it. A layer having higher privilege is allowed to control and potentially corrupt the layers above it that have less or lower privileges. In such layered computer platform architecture, components in the upper layers are trust-dependent on components in the layers below them. In general, a component is trust-dependent on another component if it relies on another component in ensuring the integrity or confidentiality of its code or data. The Trusted Computing Group (TCG) has developed standards to ensure the security and integrity of a computing platform. The current standards do not address systems with trust dependencies.
According to TCG standards, there are Trusted Building Blocks (TBBs) for a platform which form the root of trust for the platform. These include a Trusted Platform Module (TPM) and a Core Root of Trust for Measurement (CRTM). A CRTM is the root of trust from which integrity measurements begin within a trusted computer platform. The TPM provides secure storage and reporting for the integrity measurements and other data. The platform manufacturer provides CRTM logic for each trusted computer platform. The CRTM logic can be changed, however, changes can only be made by the manufacturer of the computer platform. In addition, the changes can only be made under controlled conditions. TCG specifies two types of CRTM: a Static CRTM (S-CRTM) and a Dynamic CRTM (D-CRTM).
In platforms with an S-CRTM, the S-CRTM is the first module to be executed after the platform is reset. The S-CRTM computes an integrity measurement of the next code in the boot sequence (e.g., using a one-way hash algorithm (e.g., SHA-1)), and records the integrity measurement in a Platform Configuration Register (PCR) within the TPM. Boot control is then transferred to the code that was measured, which in turn measures and records the next code that is loaded. This process is continued and repeated until the platform is booted and applications of the platform are running.
In computer platforms with a D-CRTM, the D-CRTM may be invoked at any time after the platform is reset. The D-CRTM sets up a trusted computing environment, measures the first code to run in that environment and stores that measurement in a PCR within the TPM. The D-CRTM asserts "locality", which provides an indicator to the TPM that the measurement came from a D-CRTM rather than an S-CRTM, and the TPM divides its PCRs among localities asserted by the D-CRTM. Subsequently, code continues to be booted in the trusted computing environment, with the code that is loaded into the computer platform being integrity measured and the measurements recorded in the TPM.
As part of the integrity measurement process, a measurement log is maintained by the components in the chain of trust. The measurement log contains information on what measurements were taken, in what order, and in which of the PCRs the measurements were stored.
A computer system that is comprised of components may have multiple TBBs, one for each component, and there may be trust dependencies among the components. Thus, a PCR in one component may be trust-dependent on PCRs in another component. For TPM operations that use PCRs, methods are needed to define and resolve the trust dependencies.

System and methods for dependent trust in a computer system


A method and apparatus for electrically interfacing between two or more distinct environments. The method and apparatus are directed to an electrical feedthru with one or more electrical transmission lines coated with one or more thin dielectric layers of material to insulate the transmission lines from a feedthru body. The dielectric layers may include a diamond-like carbon coating, which electrically insulates, but also thermally conducts. The use of thin dielectric layers facilitates smaller, more efficient electrical feedthrus. Therefore, the electrical feedthru may be used, for example, with MEMS devices. The electrical feedthru is not limited to any particular geometry, it may be adapted to fit between any two environments.

A variety of standard methods and devices currently exist for passing electrical signals and current across distinct environments. Such devices are commonly referred to as electrical feedthrus or bulkheads. The intent of electrical feedthrus is to facilitate passage of the electrical signals, current, or both across the distinct environments without breaching the integrity of any boundary between the two distinct environments. One variety of electrical feedthrus includes epoxy encapsulated transmission lines. The transmission lines are usually centered within the epoxy capsule, with the lines running parallel to the epoxy capsule. The epoxy capsule insulates the transmission lines at a boundary between two distinct environments. Another variety of electrical feedthrus includes constructing a boundary body between two distinct environments with non-conductive materials and inserting the transmission lines through the boundary body. The boundary body between the two distinct environments is then sealed by standard sealing techniques, such as the use of an O-ring. Glass and ceramic capsules or boundary bodies are also commonly used.
However, these standard electrical feedthrus have a number of drawbacks. The primary problem associated with standard electrical feedthrus is the use of dissimilar materials for construction of the feedthru. For example, an electrical feedthru (2) shown in FIG. 1 requires a thick pre-formed ceramic or glass insulator capsule (4) set in a body (6) to electrically isolate a pin (8) inserted through the insulator capsule (4) from the body (6). The thick insulator capsule (4) is typically made of glass or ceramic, and the pins (8) and body (6) are metallic. The coefficients of thermal expansion of metals and ceramics are generally quite different. Therefore, to maintain the integrity of the seal between the ceramic and the metal, typical electrical feedthrus are limited to a relatively narrow range of temperatures and pressure fluctuations. For example, if the body (6) is steel and the insulator capsule (4) is ceramic, the body (6) would expand more than twice as much as the insulator capsule (4) when subjected to an increase in temperature. The larger the increase in temperature, the larger the difference between the expansion of the body (6) and the insulator capsule (4). This difference in expansion causes high stresses at an interface (9) between the body (6) and the insulator capsule (4). High stresses at the interface (9) result in feedthrus that are prone to failure, and thus limit the performance of the feedthrough.
Another problem associated with electrical feedthrus is the size. Standard electrical feedthrus are often much too large for many applications, particularly for micro-electro-mechanical-systems (MEMS). The electrical feedthru (2) shown in FIG. 1 is considered a very small one, possibly the smallest currently available ceramic feedthru useful in high pressure, high temperature applications. However, the electrical feedthru (2) shown in FIG. 1 requires a pre-formed ceramic or epoxy insulator capsule (4) that has a wall thickness of at least 750 μm. Further, as the number of transmission lines needed increases, the size of the electrical feedhthrus or bulkheads becomes even larger. Referring again to FIG. 1, only a single pin (8) can be located within the thick insulator capsule (4) while maintaining electrical isolation, and the diameter of the ceramic insulator (4) is at least 2 mm. Therefore, according the spacing shown, it takes at least a diameter of 8.0 mm to arrange the six transmission lines or pins (8). However, in actual practice the electrical feedhtru is at least 9.0 mm in diameter to provide support for the multiple ceramic insulator capsules (4). There are many instances, including applications to MEMS devices, where a much larger density of transmissions lines and a much smaller electrical feedthru would be desirable.
Yet another disadvantage of typical electrical feedthrus is the inability of ceramic, glass, and epoxy material to conduct heat. Poor heat conduction means limited ability to dissipate heat. Therefore, typical electrical feedthrus such as the feedthru (2) shown in FIG. 1 are not capable of efficiently dissipating heat through the body (6). Accordingly, any heat-generating devices connected to the transmission lines (8) must be cooled without the aid of conducting heat through the body (6).


Disclosed is an address mapping method for a data storage device using a hybrid mapping scheme. The address mapping method determines whether write data includes a defined super sequential block (SSB), and selects an address mapping mode for the write data in accordance with whether or not a SSB is present.

Embodiments of the inventive concept relate to semiconductor memory devices, and more particularly, to semiconductor memory devices using address mapping techniques capable of increasing the efficiency of merge operations. Embodiments of the inventive concept also relate to data write methods performed in semiconductor memory devices using such address mapping techniques. Still other embodiments of the inventive concept relate to user devices that incorporate such semiconductor memory devices and/or data write methods.
Semiconductor memory devices may be characterized in their operative nature as volatile and non-volatile. Volatile memory devices generally perform read/write operations at high speed, but lose stored data in the absence of applied power. In contrast, non-volatile memory devices retain stored data in the absence of applied power. Accordingly, non-volatile memory devices are used to store data that must be retained regardless of power conditions. In particular, among the broad class of non-volatile memory devices, so-called flash memory devices are characterized by high memory cell integration density as compared with other types of EEPROMs. Thus, flash memory devices have proven particularly useful when incorporated into user devices and systems requiring mass data storage (e.g., use as auxiliary memory devices).
Contemporary flash memory devices operate in accordance with a defined erase unit (i.e., a data block size erased during an erase operation) and a defined write unit (i.e., a data block size written or programmed to during a write or program operation). A difference in block size between the erase unit and write unit generally necessitates the use of a specialized software tool commonly referred to as a flash translation layer or FTL.
The FTL is essentially an address mapping scheme that converts a given address (e.g., a logical address) defined in one domain into a corresponding address (e.g., a physical address) defined in another domain. Thus, in common use the FTL translates address types across domain boundaries. For example, a logical address (LA) defined by a host (e.g., a controller, processor, or high level application) may be converted back-and-forth with a corresponding physical address (PA) defined by an arrangement of memory cells in a flash memory device. Hence, the FTL converts respective, yet corresponding, addresses between a host domain and a flash memory device domain.
Address mapping may be accomplished using page mapping, block mapping, or hybrid mapping. A page mapping table is used for page mapping. That is, a page mapping table may be used to perform a mapping operation on a page by page basis between logical page addresses and corresponding physical page addresses.
A block mapping table is used for block mapping. That is, the block mapping table may be used to perform a mapping operation on a block by block between logical block addresses and corresponding physical block addresses.
Hybrid mapping methods essentially use both page mapping and block mapping techniques.
A memory block typically includes multiple pages. The size of a mapping table used for page mapping is therefore tens or hundreds of times larger than an analogous mapping table used for block mapping. Thus, a page mapping table will require a great deal more memory space than a block mapping table.
However, a memory block is rather large and constituent page locations within each block are fixed, despite frequent updates to the pages. For this reason, block mapping necessitates the use of many merge operations to ensure sufficient availability of memory space.

Data storage device, user device and data write method


Systems and methods for transmitting a prioritized audio stream along with multimedia content are disclosed. A particular method includes receiving a designation at a server of a prioritized audio stream to be transmitted with multimedia content. The designation is received at a server prior to transmission of the multimedia content. The multimedia content is retrieved from a first content source and the prioritized audio stream is retrieved from a second content source that is different than the first content source, where the first content source and the second content source are external to the server. The prioritized audio stream is added to a least a portion of the multimedia content to form a composite content stream. The method includes transmitting the composite content stream to a destination device via a network.

Advances in broadcasting and entertainment technology have made it possible to simultaneously experience multimedia content from multiple sources. For example, football fans may watch television coverage of a particular game while listening to a local radio broadcast of the game instead of the television commentary. As another example, some automobile racing leagues provide online streaming of in-car comments from drivers. Fans of a particular driver may watch television coverage of a race while listening to driver comments streamed to a computer. However, the television and radio/Internet stream are often out-of-sync, decreasing the overall enjoyment of the multimedia content. Furthermore, a user may have to operate multiple devices (e.g., a television and either a radio receiver or a computer) in order to enjoy the simultaneous broadcasts of content.

Transmitting a prioritized audio stream along with multimedia content